/art/runtime/jit/ |
H A D | debugger_interface.cc | 82 JITCodeEntry* entry = new JITCodeEntry; local 83 CHECK(entry != nullptr); 84 entry->symfile_addr_ = symfile_copy; 85 entry->symfile_size_ = symfile.size(); 86 entry->prev_ = nullptr; 88 entry->next_ = __jit_debug_descriptor.first_entry_; 89 if (entry->next_ != nullptr) { 90 entry->next_->prev_ = entry; 92 __jit_debug_descriptor.first_entry_ = entry; 124 DeleteJITCodeEntry(JITCodeEntry* entry) argument 139 JITCodeEntry* entry = CreateJITCodeEntryInternal(std::move(symfile)); local [all...] |
H A D | debugger_interface.h | 36 void DeleteJITCodeEntry(JITCodeEntry* entry); 39 // The address is used only to uniquely identify the entry. 44 // Returns false if entry for the given address was not found.
|
/art/runtime/jdwp/ |
H A D | object_registry.cc | 91 ObjectRegistryEntry* entry = nullptr; local 92 if (ContainsLocked(soa.Self(), obj_h.Get(), identity_hash_code, &entry)) { 94 ++entry->reference_count; 96 entry = new ObjectRegistryEntry; 97 entry->jni_reference_type = JNIWeakGlobalRefType; 98 entry->jni_reference = nullptr; 99 entry->reference_count = 0; 100 entry->id = 0; 101 entry->identity_hash_code = identity_hash_code; 102 object_to_entry_.insert(std::make_pair(identity_hash_code, entry)); 126 ObjectRegistryEntry* entry = it->second; local 157 const ObjectRegistryEntry* entry = pair.second; local 178 ObjectRegistryEntry& entry = *it->second; local 191 ObjectRegistryEntry& entry = *it->second; local 211 Demote(ObjectRegistryEntry& entry) argument 222 Promote(ObjectRegistryEntry& entry) argument 238 ObjectRegistryEntry& entry = *it->second; local 254 ObjectRegistryEntry* entry = it->second; local [all...] |
H A D | object_registry.h | 118 void Demote(ObjectRegistryEntry& entry) 121 void Promote(ObjectRegistryEntry& entry)
|
/art/runtime/arch/x86/ |
H A D | thread_x86.cc | 61 descriptor_table_entry_t entry; local 62 memset(&entry, 0, sizeof(entry)); 63 entry.limit0 = (limit & 0x0ffff); 64 entry.limit = (limit & 0xf0000) >> 16; 65 entry.base0 = (base & 0x0000ffff); 66 entry.base1 = (base & 0x00ff0000) >> 16; 67 entry.base2 = (base & 0xff000000) >> 24; 68 entry.type = ((read_exec_only ^ 1) << 1) | (contents << 2); 69 entry [all...] |
/art/runtime/ |
H A D | type_lookup_table.cc | 88 Entry entry; local 89 entry.str_offset = str_id.string_data_off_; 90 entry.data = MakeData(i, hash, GetSizeMask()); 91 if (!SetOnInitialPos(entry, hash)) { 102 Entry entry; local 103 entry.str_offset = str_id.string_data_off_; 104 entry.data = MakeData(class_def_idx, hash, GetSizeMask()); 105 Insert(entry, hash); 115 bool TypeLookupTable::SetOnInitialPos(const Entry& entry, uint32_t hash) { argument 120 entries_[pos] = entry; 125 Insert(const Entry& entry, uint32_t hash) argument 138 const Entry* entry = &entries_[pos]; local [all...] |
H A D | type_lookup_table.h | 48 const Entry* entry = &entries_[pos]; local 49 while (!entry->IsEmpty()) { 50 if (CmpHashBits(entry->data, hash) && IsStringsEquals(str, entry->str_offset)) { 51 return GetClassDefIdx(entry->data); 53 if (entry->IsLast()) { 56 pos = (pos + entry->next_pos_delta) & GetSizeMask(); 57 entry = &entries_[pos]; 97 * So the data element of Entry used to store class_def_idx and part of hash of the entry. 147 // Attempt to set an entry o [all...] |
/art/compiler/optimizing/ |
H A D | nodes_test.cc | 34 HBasicBlock* entry = new (&allocator) HBasicBlock(graph); local 35 graph->AddBlock(entry); 36 graph->SetEntryBlock(entry); 39 entry->AddInstruction(parameter); 40 entry->AddInstruction(new (&allocator) HGoto()); 44 entry->AddSuccessor(first_block); 77 HBasicBlock* entry = new (&allocator) HBasicBlock(graph); local 78 graph->AddBlock(entry); 79 graph->SetEntryBlock(entry); 84 entry 105 HBasicBlock* entry = new (&allocator) HBasicBlock(graph); local 126 HBasicBlock* entry = new (&allocator) HBasicBlock(graph); local [all...] |
H A D | stack_map_stream.cc | 78 // Create a new entry in the location catalog and the hash map. 132 for (const StackMapEntry& entry : stack_maps_) { 133 max_native_pc_offset = std::max(max_native_pc_offset, entry.native_pc_offset); 214 for (const StackMapEntry& entry : stack_maps_) { 215 if (entry.same_dex_register_map_as_ == kNoSameDexMapFound) { 216 size += ComputeDexRegisterMapSize(entry.num_dex_registers, entry.live_dex_registers_mask); 220 for (size_t j = 0; j < entry.inlining_depth; ++j) { 235 for (const StackMapEntry& entry : stack_maps_) { 236 for (size_t j = 0; j < entry 292 StackMapEntry entry = stack_maps_[i]; local 508 StackMapEntry entry = stack_maps_[s]; local [all...] |
H A D | gvn_test.cc | 34 HBasicBlock* entry = new (&allocator) HBasicBlock(graph); local 35 graph->AddBlock(entry); 36 graph->SetEntryBlock(entry); 41 entry->AddInstruction(parameter); 45 entry->AddSuccessor(block); 119 HBasicBlock* entry = new (&allocator) HBasicBlock(graph); local 120 graph->AddBlock(entry); 121 graph->SetEntryBlock(entry); 126 entry->AddInstruction(parameter); 130 entry 202 HBasicBlock* entry = new (&allocator) HBasicBlock(graph); local 327 HBasicBlock* entry = new (&allocator) HBasicBlock(graph); local [all...] |
H A D | bounds_check_elimination_test.cc | 69 HBasicBlock* entry = new (&allocator_) HBasicBlock(graph_); local 70 graph_->AddBlock(entry); 71 graph_->SetEntryBlock(entry); 76 entry->AddInstruction(parameter1); 77 entry->AddInstruction(parameter2); 88 entry->AddSuccessor(block1); 166 HBasicBlock* entry = new (&allocator_) HBasicBlock(graph_); local 167 graph_->AddBlock(entry); 168 graph_->SetEntryBlock(entry); 173 entry 230 HBasicBlock* entry = new (&allocator_) HBasicBlock(graph_); local 294 HBasicBlock* entry = new (&allocator_) HBasicBlock(graph_); local 363 HBasicBlock* entry = new (allocator) HBasicBlock(graph); local 478 HBasicBlock* entry = new (allocator) HBasicBlock(graph); local 588 HBasicBlock* entry = new (allocator) HBasicBlock(graph); local 691 HBasicBlock* entry = new (allocator) HBasicBlock(graph); local 794 HBasicBlock* entry = new (&allocator_) HBasicBlock(graph_); local [all...] |
H A D | register_allocator_test.cc | 461 HBasicBlock* entry = new (allocator) HBasicBlock(graph); local 463 graph->AddBlock(entry); 464 graph->SetEntryBlock(entry); 467 entry->AddInstruction(parameter); 471 entry->AddSuccessor(block); 615 HBasicBlock* entry = new (allocator) HBasicBlock(graph); local 616 graph->AddBlock(entry); 617 graph->SetEntryBlock(entry); 620 entry->AddInstruction(parameter); 624 entry 691 HBasicBlock* entry = new (allocator) HBasicBlock(graph); local 762 HBasicBlock* entry = new (allocator) HBasicBlock(graph); local 816 HBasicBlock* entry = new (&allocator) HBasicBlock(graph); local [all...] |
H A D | block_builder.cc | 39 // Create the first block for the dex instructions, single successor of the entry block. 313 for (auto entry : try_block_info) { 314 HBasicBlock* try_block = graph_->GetBlocks()[entry.first]; 316 if (GetTryItem(predecessor, try_block_info) != entry.second) { 322 LinkToCatchBlocks(try_entry, code_item_, entry.second, catch_blocks); 330 for (auto entry : try_block_info) { 331 HBasicBlock* try_block = graph_->GetBlocks()[entry.first]; 340 DCHECK_EQ(entry.second, GetTryItem(successor, try_block_info)); 348 LinkToCatchBlocks(try_exit, code_item_, entry.second, catch_blocks);
|
H A D | dex_cache_array_fixups_arm.cc | 37 for (const auto& entry : dex_cache_array_bases_) { 39 // entry block) and relieve some pressure on the register allocator 41 HArmDexCacheArraysBase* base = entry.second; 86 // Insert the base at the start of the entry block, move it to a better
|
/art/compiler/utils/ |
H A D | test_dex_file_builder.h | 103 for (auto& entry : strings_) { 104 entry.second.idx = string_idx; 106 entry.second.data_offset = data_section_size; 107 data_section_size += entry.first.length() + 1u /* length */ + 1u /* null-terminator */; 114 for (auto& entry : types_) { 115 entry.second = type_idx; 123 for (auto& entry : protos_) { 124 entry.second.idx = proto_idx; 126 size_t num_args = entry.first.args.size(); 128 entry [all...] |
H A D | swap_space.cc | 38 for (const auto& entry : free_by_size) { 39 if (last_size != entry.first) { 40 last_size = entry.first; 43 LOG(INFO) << " 0x" << std::hex << entry.second->Start() 44 << " size=" << std::dec << entry.second->size; 91 for (const auto& entry : free_by_size) { 92 sum1 += entry.second->size; 97 for (const auto& entry : free_by_start) { 98 sum2 += entry.size;
|
/art/compiler/dex/quick/ |
H A D | dex_file_to_method_inliner_map.cc | 35 for (auto& entry : inliners_) { 36 delete entry.second; 59 DexFileMethodInliner** inliner = &inliners_[dex_file]; // inserts new entry if not found
|
/art/test/063-process-manager/src/ |
H A D | Main.java | 29 for (Map.Entry<Thread, StackTraceElement[]> entry : 31 Thread t = entry.getKey();
|
/art/tools/checker/file_format/c1visualizer/ |
H A D | struct.py | 28 for entry in self.passes: 29 if entry.name == name: 30 return entry
|
/art/runtime/verifier/ |
H A D | reg_type_cache.cc | 38 ALWAYS_INLINE static inline bool MatchingPrecisionForClass(const RegType* entry, bool precise) 40 if (entry->IsPreciseReference() == precise) { 44 if (!precise && entry->GetClass()->CannotBeAssignedFromOtherTypes()) { 46 // we found a matching entry based on the descriptor. Return the precise entry in that case. 133 const RegType* entry = entries_[idx]; local 134 if (descriptor != entry->descriptor_) { 137 if (entry->HasClass()) { 138 return MatchingPrecisionForClass(entry, precise); 142 DCHECK(entry 196 RegType* entry; local 320 const Type* entry = Type::CreateInstance(klass, descriptor, RegTypeCache::primitive_count_); local 447 UninitializedType* entry = nullptr; local 482 RegType* entry; local 534 UninitializedType* entry; local 567 ConstantType* entry; local 584 ConstantType* entry; local 601 ConstantType* entry; local [all...] |
/art/tools/ahat/src/ |
H A D | Query.java | 94 for (Map.Entry<String, String> entry : params.entrySet()) { 96 newQuery.append(entry.getKey()); 98 newQuery.append(entry.getValue());
|
/art/runtime/interpreter/mterp/arm/ |
H A D | bincmp.S | 15 cmp rPROFILE, #JIT_CHECK_OSR @ possible OSR re-entry?
|
H A D | zcmp.S | 13 cmp rPROFILE, #JIT_CHECK_OSR @ possible OSR re-entry?
|
/art/compiler/debug/ |
H A D | elf_debug_line_writer.h | 36 static bool PositionInfoCallback(void* ctx, const DexFile::PositionInfo& entry) { argument 37 static_cast<PositionInfos*>(ctx)->push_back(entry); 201 // Add file entry. 233 [](uint32_t address, const DexFile::PositionInfo& entry) { 234 return address < entry.address_;
|
/art/dexdump/ |
H A D | dexdump.cc | 472 * Callback for dumping each positions table entry. 474 static bool dumpPositionsCb(void* /*context*/, const DexFile::PositionInfo& entry) { argument 475 fprintf(gOutFile, " 0x%04x line=%d\n", entry.address_, entry.line_); 480 * Callback for dumping locals table entry. 482 static void dumpLocalsCb(void* /*context*/, const DexFile::LocalInfo& entry) { argument 483 const char* signature = entry.signature_ != nullptr ? entry.signature_ : ""; 485 entry.start_address_, entry [all...] |