/art/runtime/mirror/ |
H A D | iftable-inl.h | 28 const size_t idx = i * kMax + kInterface; local 29 DCHECK_EQ(Get(idx), static_cast<Object*>(nullptr)); 30 Set<false>(idx, interface);
|
H A D | class.cc | 769 uint16_t Class::GetDirectInterfaceTypeIdx(uint32_t idx) { argument 772 return GetInterfaceTypeList()->GetTypeItem(idx).type_idx_; 775 mirror::Class* Class::GetDirectInterface(Thread* self, Handle<mirror::Class> klass, uint32_t idx) { argument 780 if (idx == 0) { 783 DCHECK_EQ(1U, idx); 789 return interfaces->Get(idx); 791 uint16_t type_idx = klass->GetDirectInterfaceTypeIdx(idx);
|
/art/runtime/ |
H A D | indirect_reference_table-inl.h | 42 int idx = ExtractIndex(iref); local 43 if (UNLIKELY(idx >= topIndex)) { 45 << iref << " (index " << idx << " in a table of size " << topIndex << ")"; 49 if (UNLIKELY(table_[idx].IsNull())) { 54 if (UNLIKELY(!CheckEntry("use", iref, idx))) { 60 // Make sure that the entry at "idx" is correctly paired with "iref". 61 inline bool IndirectReferenceTable::CheckEntry(const char* what, IndirectRef iref, int idx) const { 62 IndirectRef checkRef = ToIndirectRef(idx); 78 uint32_t idx = ExtractIndex(iref); local 79 mirror::Object* obj = table_[idx] [all...] |
H A D | indirect_reference_table.cc | 188 int idx = ExtractIndex(iref); local 196 if (idx < bottomIndex) { 198 LOG(WARNING) << "Attempt to remove index outside index area (" << idx 202 if (idx >= topIndex) { 204 LOG(WARNING) << "Attempt to remove invalid index " << idx 209 if (idx == topIndex-1) { 212 if (!CheckEntry("remove", iref, idx)) { 216 table_[idx] = GcRoot<mirror::Object>(nullptr); 245 if (table_[idx].IsNull()) { 246 LOG(INFO) << "--- WEIRD: removing null entry " << idx; [all...] |
H A D | class_linker-inl.h | 206 inline mirror::DexCache* ClassLinker::GetDexCache(size_t idx) { argument 208 DCHECK(idx < dex_caches_.size()); 209 return dex_caches_[idx].Read();
|
H A D | dex_file_verifier.cc | 69 const char* DexFileVerifier::CheckLoadStringByIdx(uint32_t idx, const char* error_string) { argument 70 if (UNLIKELY(!CheckIndex(idx, dex_file_->NumStringIds(), error_string))) { 73 return dex_file_->StringDataByIdx(idx); 81 uint32_t idx = type_id.descriptor_idx_; local 82 return CheckLoadStringByIdx(idx, error_string); 85 const DexFile::FieldId* DexFileVerifier::CheckLoadFieldId(uint32_t idx, const char* error_string) { argument 86 if (UNLIKELY(!CheckIndex(idx, dex_file_->NumFieldIds(), error_string))) { 89 return &dex_file_->GetFieldId(idx); 92 const DexFile::MethodId* DexFileVerifier::CheckLoadMethodId(uint32_t idx, const char* err_string) { argument 93 if (UNLIKELY(!CheckIndex(idx, dex_file 447 CheckClassDataItemField(uint32_t idx, uint32_t access_flags, bool expect_static) argument 467 CheckClassDataItemMethod(uint32_t idx, uint32_t access_flags, uint32_t code_offset, bool expect_direct) argument 563 uint32_t idx = ReadUnsignedLittleEndian(value_arg + 1); local 574 uint32_t idx = ReadUnsignedLittleEndian(value_arg + 1); local 586 uint32_t idx = ReadUnsignedLittleEndian(value_arg + 1); local 597 uint32_t idx = ReadUnsignedLittleEndian(value_arg + 1); local 654 uint32_t idx = DecodeUnsignedLeb128(&ptr_); local 1826 uint32_t idx = DecodeUnsignedLeb128(&data); local [all...] |
H A D | dex_file.h | 241 const TypeItem& GetTypeItem(uint32_t idx) const { 242 DCHECK_LT(idx, this->size_); 243 return this->list_[idx]; 455 const StringId& GetStringId(uint32_t idx) const { 456 DCHECK_LT(idx, NumStringIds()) << GetLocation(); 457 return string_ids_[idx]; 479 const char* StringDataAndUtf16LengthByIdx(uint32_t idx, uint32_t* utf16_length) const { argument 480 if (idx == kDexNoIndex) { 484 const StringId& string_id = GetStringId(idx); 488 const char* StringDataByIdx(uint32_t idx) cons 520 StringByTypeIdx(uint32_t idx, uint32_t* unicode_length) const argument [all...] |
H A D | class_linker.cc | 3698 for (uint32_t idx = 0; idx < handlers_size; idx++) { 4456 uint16_t idx = interfaces->GetTypeItem(i).type_idx_; local 4457 mirror::Class* interface = ResolveType(dex_file, idx, klass.Get()); 4717 size_t idx = super_ifcount; local 4732 for (size_t j = 0; j < idx; j++) { 4741 iftable->SetInterface(idx++, interface); 4746 for (size_t k = 0; k < idx; k++) { 4754 iftable->SetInterface(idx [all...] |
H A D | debugger.cc | 4638 size_t idx = HeadIndex(); local 4640 AllocRecord* record = &recent_allocation_records_[idx]; 4652 idx = (idx + 1) & (alloc_record_max_ - 1); 4683 idx = HeadIndex(); 4691 AllocRecord* record = &recent_allocation_records_[idx]; 4715 idx = (idx + 1) & (alloc_record_max_ - 1);
|
H A D | jni_internal.cc | 117 const char* kind, jint idx, bool return_errors) 121 << ": " << kind << " is null at index " << idx; local 124 "%s is null at index %d", kind, idx);
|
/art/compiler/dex/ |
H A D | dataflow_iterator-inl.h | 161 BasicBlockId idx = idx_; local 163 BasicBlock* bb = mir_graph_->GetBasicBlock(block_id_list_->Get(idx)); 166 if (loop_ends_->Get(idx) != 0u) { 167 loop_head_stack_->Insert(std::make_pair(idx, false)); // Not recalculating.
|
H A D | ssa_transformation.cc | 134 * register idx is defined in BasicBlock bb. 141 for (uint32_t idx : bb->data_flow_info->def_v->Indexes()) { 142 /* Block bb defines register idx */ 143 def_block_matrix_[idx]->SetBit(bb->id); 447 unsigned int idx; local 448 for (idx = 0; idx < dest->GetStorageSize(); idx++) { 449 dest->GetRawStorage()[idx] |= src1->GetRawStorageWord(idx) 565 int idx = 0; local [all...] |
H A D | mir_graph.cc | 321 for (uint32_t idx = 0; idx < handlers_size; idx++) { 894 int idx; local 896 for (idx = 0; idx < num_blocks; idx++) { 897 int block_idx = all_blocks ? idx : dfs_order_->Get(idx); 1678 uint16_t idx local 1750 uint16_t idx = static_cast<uint16_t>(topological_order_->Size()); local 1794 int idx; local 2150 size_t idx = iterator.GetIndex() - 1; local [all...] |
/art/runtime/base/ |
H A D | timing_logger.h | 115 uint64_t GetTotalTime(size_t idx) { argument 116 return data_[idx].total_time; 118 uint64_t GetExclusiveTime(size_t idx) { argument 119 return data_[idx].exclusive_time;
|
H A D | bit_vector.cc | 144 uint32_t idx; local 145 for (idx = 0; idx < min_size; idx++) { 146 storage_[idx] &= src->GetRawStorageWord(idx); 153 for (; idx < storage_size_; idx++) { 154 storage_[idx] = 0; 185 for (uint32_t idx 222 uint32_t idx = 0; local 289 uint32_t idx; local [all...] |
/art/runtime/gc/allocator/ |
H A D | rosalloc.h | 286 static size_t IndexToBracketSize(size_t idx) { argument 287 DCHECK(idx < kNumOfSizeBrackets); 288 return bracketSizes[idx]; 293 size_t idx; 295 idx = kNumOfSizeBrackets - 2; 297 idx = kNumOfSizeBrackets - 1; 301 idx = size / 16 - 1; 303 DCHECK(bracketSizes[idx] == size); 304 return idx; 336 size_t idx [all...] |
H A D | rosalloc.cc | 312 size_t idx = pm_idx + 1; local 314 while (idx < end && page_map_[idx] == pm_part_type) { 315 page_map_[idx] = kPageMapEmpty; 317 idx++; 535 RosAlloc::Run* RosAlloc::AllocRun(Thread* self, size_t idx) { argument 539 new_run = reinterpret_cast<Run*>(AllocPages(self, numOfPages[idx], kPageMapRun)); 545 new_run->size_bracket_idx_ = idx; 550 if (kUsePrefetchDuringAllocRun && idx < kNumThreadLocalSizeBrackets) { 557 const size_t num_of_slots = numOfSlots[idx]; 570 RefillRun(Thread* self, size_t idx) argument 586 AllocFromCurrentRunUnlocked(Thread* self, size_t idx) argument 598 << " into full_runs_[" << std::dec << idx << "]"; local 625 size_t idx = SizeToIndexAndBracketSize(size, &bracket_size); local 644 size_t idx = SizeToIndexAndBracketSize(size, &bracket_size); local 694 << " into full_runs_[" << std::dec << idx << "]"; local 745 const size_t idx = run->size_bracket_idx_; local 814 << " into non_full_runs_[" << std::dec << idx << "]"; local 836 size_t idx = size_bracket_idx_; local 854 const size_t idx = size_bracket_idx_; local 893 const byte idx = size_bracket_idx_; local 924 const size_t idx = size_bracket_idx_; local 1005 const byte idx = size_bracket_idx_; local 1041 const byte idx = size_bracket_idx_; local 1089 const size_t idx = size_bracket_idx_; local 1099 const byte idx = size_bracket_idx_; local 1104 const byte idx = size_bracket_idx_; local 1117 size_t idx = size_bracket_idx_; local 1246 size_t idx = run->size_bracket_idx_; local 1336 << " into non_full_runs_[" << std::dec << idx; local 1418 size_t idx = run->size_bracket_idx_; local 1454 size_t idx = pm_idx + 1; local 1476 size_t idx = run->size_bracket_idx_; local 1580 size_t idx = i + 1; local 1674 RevokeRun(Thread* self, size_t idx, Run* run) argument 1684 << " into full_runs_[" << std::dec << idx << "]"; local 1697 << " into non_full_runs_[" << std::dec << idx << "]"; local 1915 size_t idx = i + 1; local 1941 size_t idx = run->size_bracket_idx_; local 1997 const size_t idx = size_bracket_idx_; local [all...] |
/art/runtime/verifier/ |
H A D | method_verifier.h | 122 RegisterLine* GetLine(size_t idx) { argument 123 DCHECK_LT(idx, size_); 124 return register_lines_[idx]; 356 bool CheckRegisterIndex(uint32_t idx); 359 bool CheckWideRegisterIndex(uint32_t idx); 363 bool CheckFieldIndex(uint32_t idx); 367 bool CheckMethodIndex(uint32_t idx); 371 bool CheckNewInstance(uint32_t idx); 374 bool CheckStringIndex(uint32_t idx); 378 bool CheckTypeIndex(uint32_t idx); [all...] |
H A D | reg_type_cache.cc | 125 bool RegTypeCache::MatchDescriptor(size_t idx, const StringPiece& descriptor, bool precise) { argument 126 RegType* entry = entries_[idx];
|
H A D | method_verifier.cc | 592 for (uint32_t idx = 0; idx < tries_size; idx++) { 593 const DexFile::TryItem* try_item = &tries[idx]; 615 for (uint32_t idx = 0; idx < handlers_size; idx++) { 765 bool MethodVerifier::CheckRegisterIndex(uint32_t idx) { argument 766 if (idx >= code_item_->registers_size_) { 767 Fail(VERIFY_ERROR_BAD_CLASS_HARD) << "register index out of range (" << idx << " > 774 CheckWideRegisterIndex(uint32_t idx) argument 783 CheckFieldIndex(uint32_t idx) argument 792 CheckMethodIndex(uint32_t idx) argument 801 CheckNewInstance(uint32_t idx) argument 816 CheckStringIndex(uint32_t idx) argument 825 CheckTypeIndex(uint32_t idx) argument 834 CheckNewArray(uint32_t idx) argument [all...] |
/art/compiler/dex/portable/ |
H A D | mir_to_gbc.cc | 515 void MirConverter::ConvertConstObject(uint32_t idx, argument 518 ::llvm::Value* index = irb_->getInt32(idx);
|