/third_party/node/deps/v8/src/codegen/x64/ |
H A D | macro-assembler-x64.h | 392 // Load code entry point from the CodeDataContainer object. 395 // Load code entry point from the CodeDataContainer object and compute 397 // corresponding to builtins, because their entry points values point to 788 void JumpToOffHeapInstructionStream(Address entry);
|
/third_party/node/deps/v8/src/objects/ |
H A D | js-objects.h | 85 InternalIndex entry); 838 // its size by more than the 1 entry necessary, so sequentially adding fields
|
/third_party/node/deps/v8/src/snapshot/ |
H A D | deserializer.cc | 508 // Mutate the given object handle so that the backreference entry is in PostProcessNewObject() 824 // Internal reference target is encoded as an offset from code entry. in VisitInternalReference() 832 Address target = host.entry() + target_offset; in VisitInternalReference() 985 // entry as a Handle backing? in ReadSingleBytecodeData() 996 // entry as a Handle backing? in ReadSingleBytecodeData() 1007 // shared_heap_object_cache entry as a Handle backing? in ReadSingleBytecodeData()
|
/third_party/node/deps/openssl/openssl/crypto/sha/asm/ |
H A D | keccak1600-ppc64.pl | 723 mflr r12 ; vvvvvv "distance" between . and 1st data entry
|
H A D | keccak1600p8-ppc.pl | 785 mflr r12 ; vvvvvv "distance" between . and 1st data entry
|
H A D | sha512-ppc.pl | 30 # blocked upon entry to SHA512 block routine. This is because 731 mflr $Tbl ; vvvvvv "distance" between . and 1st data entry
|
/third_party/skia/third_party/externals/spirv-tools/test/opt/ |
H A D | aggressive_dead_code_elim_test.cpp | 817 // Eliminate stores to private in entry point with no calls 1002 // Should not eliminate stores to private when function is not entry point 1067 // Eliminate stores to private in entry point with no calls 3498 %entry = OpLabel 3602 // Everything is reachable from an entry point, so no functions should be 5003 %entry = OpLabel 5889 %entry = OpLabel 5997 %entry = OpLabel 6021 %entry = OpLabel 6046 %entry [all...] |
/third_party/openssl/crypto/sha/asm/ |
H A D | keccak1600p8-ppc.pl | 785 mflr r12 ; vvvvvv "distance" between . and 1st data entry
|
H A D | keccak1600-ppc64.pl | 723 mflr r12 ; vvvvvv "distance" between . and 1st data entry
|
H A D | sha512-ppc.pl | 30 # blocked upon entry to SHA512 block routine. This is because 731 mflr $Tbl ; vvvvvv "distance" between . and 1st data entry
|
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/opt/ |
H A D | aggressive_dead_code_elim_test.cpp | 817 // Eliminate stores to private in entry point with no calls 1002 // Should not eliminate stores to private when function is not entry point 1067 // Eliminate stores to private in entry point with no calls 3498 %entry = OpLabel 3602 // Everything is reachable from an entry point, so no functions should be 5003 %entry = OpLabel 5889 %entry = OpLabel 5997 %entry = OpLabel 6021 %entry = OpLabel 6046 %entry [all...] |
/third_party/rust/crates/regex/src/ |
H A D | dfa.rs | 1766 fmtd.entry(&si.to_string(), &TransitionsRow(&self.table[s..e])); 1781 fmtd.entry(&vb(b as usize), &"DEAD"); 1784 fmtd.entry(&vb(b as usize), &si.to_string());
|
/third_party/spirv-tools/source/opt/ |
H A D | ir_context.cpp | 108 // The dominator analysis hold the pseudo entry and exit nodes from the CFG. in InvalidateAnalyses() 932 // Collect all of the entry points as the roots. in ProcessEntryPointCallTree() 943 // Add all entry points since they can be reached from outside the module. in ProcessReachableCallTree() 1119 ->Dominates(enclosing_function->entry().get(), &bb); in IsReachable()
|
/third_party/sqlite/src/ |
H A D | shell.c | 1191 ** particular directory entry should be skipped over when searching for 1192 ** the next directory entry that should be returned by the readdir() or 1214 extern INT readdir_r(LPDIR dirp, LPDIRENT entry, LPDIRENT *result); 1353 LPDIRENT entry, in readdir_r() 1364 entry->d_ino = dirp->d_first.d_ino; in readdir_r() 1365 entry->d_attributes = dirp->d_first.d_attributes; in readdir_r() 1366 strncpy(entry->d_name, dirp->d_first.d_name, NAME_MAX); in readdir_r() 1367 entry->d_name[NAME_MAX] = '\0'; in readdir_r() 1369 *result = entry; in readdir_r() 1384 entry in readdir_r() 1351 readdir_r( LPDIR dirp, LPDIRENT entry, LPDIRENT *result ) readdir_r() argument [all...] |
/third_party/mesa3d/src/compiler/glsl/ |
H A D | ast_to_hir.cpp | 6925 hash_table_foreach(state->switch_state.labels_ht, entry) { in hir() 6926 const struct case_label *const l = (struct case_label *) entry->data; in hir() 7017 hash_entry *entry = in hir() local 7021 if (entry) { in hir() 7023 (struct case_label *) entry->data; in hir()
|
/third_party/node/deps/v8/src/d8/ |
H A D | d8.cc | 298 // Specifying 0 as the "old size" causes the existing map entry to not 494 auto entry = cached_code_map_.find(*key); in LookupCodeCache() local 495 if (entry != cached_code_map_.end() && entry->second) { in LookupCodeCache() 496 int length = entry->second->length; in LookupCodeCache() 498 memcpy(cache, entry->second->data, length); in LookupCodeCache()
|
/third_party/mesa3d/src/gallium/drivers/iris/ |
H A D | iris_state.c | 4090 iris_pack_state(GENX(SO_DECL_ENTRY), so_decl_map + 3 + i * 2, entry) { in iris_create_so_decl_list() 4091 entry.Stream0Decl = so_decl[0][i]; in iris_create_so_decl_list() 4092 entry.Stream1Decl = so_decl[1][i]; in iris_create_so_decl_list() 4093 entry.Stream2Decl = so_decl[2][i]; in iris_create_so_decl_list() 4094 entry.Stream3Decl = so_decl[3][i]; in iris_create_so_decl_list() 4951 * Returns the binding table entry (offset to SURFACE_STATE).
|
/third_party/skia/third_party/externals/swiftshader/src/Reactor/ |
H A D | SubzeroReactor.cpp | 466 // Connect the entry block to the top of the initial basic block in finalizeFunction() 632 const void *entry; 690 entryPoints[index].entry = elfImage + sectionHeader[i].sh_offset; 796 __builtin___clear_cache((char *)entryPoint.entry, (char *)entryPoint.entry + entryPoint.codeSize); 987 // and returns a Routine with the entry points to these functions. 1076 // Done compiling functions, get entry pointers to each of them 1081 ::routine->setEntry(i, entryPoints[i].entry); 4692 // We insert these instructions at the top of the entry node,
|
/third_party/mesa3d/src/gallium/drivers/zink/ |
H A D | zink_compiler.c | 3249 set_foreach(shader->programs, entry) { in zink_shader_free() 3251 struct zink_compute_program *comp = (void*)entry->key; in zink_shader_free() 3259 struct zink_gfx_program *prog = (void*)entry->key; in zink_shader_free()
|
/third_party/node/deps/v8/tools/ |
H A D | grokdump.py | 1736 self.entry = self.address + Code.HeaderSize(heap) 1741 lines = self.heap.reader.GetDisasmLines(self.entry, self.instruction_size) 1750 return FormatDisasmLine(self.entry, self.heap, line) 2311 # Find entry with highest count
|
/third_party/mesa3d/src/mesa/main/ |
H A D | bufferobj.c | 1220 set_foreach(ctx->Shared->ZombieBufferObjects, entry) { in unreference_zombie_buffers_for_ctx() 1221 struct gl_buffer_object *buf = (struct gl_buffer_object *)entry->key; in unreference_zombie_buffers_for_ctx() 1224 _mesa_set_remove(ctx->Shared->ZombieBufferObjects, entry); in unreference_zombie_buffers_for_ctx()
|
/third_party/libfuse/lib/ |
H A D | fuse.c | 377 static inline void list_del(struct list_head *entry) in list_del() argument 379 struct list_head *prev = entry->prev; in list_del() 380 struct list_head *next = entry->next; in list_del()
|
/third_party/node/deps/v8/src/compiler/backend/arm/ |
H A D | instruction-selector-arm.cc | 2973 const ShuffleEntry& entry = table[i]; in TryMatchArchShuffle() local 2976 if ((entry.shuffle[j] & mask) != (shuffle[j] & mask)) { in TryMatchArchShuffle() 2981 *opcode = entry.opcode; in TryMatchArchShuffle()
|
/third_party/node/deps/v8/src/compiler/backend/mips64/ |
H A D | instruction-selector-mips64.cc | 3192 const ShuffleEntry& entry = table[i]; in TryMatchArchShuffle() local 3195 if ((entry.shuffle[j] & mask) != (shuffle[j] & mask)) { in TryMatchArchShuffle() 3200 *opcode = entry.opcode; in TryMatchArchShuffle()
|
/third_party/node/deps/v8/src/compiler/backend/x64/ |
H A D | instruction-selector-x64.cc | 3592 const ShuffleEntry& entry = table[i]; in TryMatchArchShuffle() local 3595 if ((entry.shuffle[j] & mask) != (shuffle[j] & mask)) { in TryMatchArchShuffle() 3600 *arch_shuffle = &entry; in TryMatchArchShuffle()
|