Home
last modified time | relevance | path

Searched refs:idx (Results 1 – 25 of 39) sorted by relevance

12

/art/runtime/base/
Dbit_vector.cc144 uint32_t idx; in Intersect() local
145 for (idx = 0; idx < min_size; idx++) { in Intersect()
146 storage_[idx] &= src->GetRawStorageWord(idx); in Intersect()
153 for (; idx < storage_size_; idx++) { in Intersect()
154 storage_[idx] = 0; in Intersect()
185 for (uint32_t idx = 0; idx < src_size; idx++) { in Union() local
186 uint32_t existing = storage_[idx]; in Union()
187 uint32_t update = existing | src->GetRawStorageWord(idx); in Union()
190 storage_[idx] = update; in Union()
222 uint32_t idx = 0; in UnionIfNotIn() local
[all …]
Dhistogram-inl.h106 for (size_t idx = 0; idx < kInitialBucketCount; idx++) { in Initialize() local
189 for (size_t idx = 0; idx < frequency_.size(); idx++) { in CreateHistogram() local
190 accumulated += frequency_[idx]; in CreateHistogram()
202 for (size_t idx = 0; idx < data.perc_.size(); idx++) { in Percentile() local
203 if (per <= data.perc_[idx]) { in Percentile()
204 upper_idx = idx; in Percentile()
208 if (per >= data.perc_[idx] && idx != 0 && data.perc_[idx] != data.perc_[idx - 1]) { in Percentile()
209 lower_idx = idx; in Percentile()
Dhistogram_test.cc234 for (uint64_t idx = 0ull; idx < 150ull; idx++) { in TEST() local
241 for (size_t idx = 0; idx < 200; idx++) { in TEST() local
257 for (uint64_t idx = 0ull; idx < 30ull; idx++) { in TEST() local
259 hist->AddValue(idx * idx_inner); in TEST()
Dtiming_logger.h115 uint64_t GetTotalTime(size_t idx) { in GetTotalTime() argument
116 return data_[idx].total_time; in GetTotalTime()
118 uint64_t GetExclusiveTime(size_t idx) { in GetExclusiveTime() argument
119 return data_[idx].exclusive_time; in GetExclusiveTime()
Dbit_vector.h192 uint32_t GetRawStorageWord(size_t idx) const { return storage_[idx]; } in GetRawStorageWord() argument
/art/runtime/gc/allocator/
Drosalloc.cc312 size_t idx = pm_idx + 1; in FreePages() local
314 while (idx < end && page_map_[idx] == pm_part_type) { in FreePages()
315 page_map_[idx] = kPageMapEmpty; in FreePages()
317 idx++; in FreePages()
535 RosAlloc::Run* RosAlloc::AllocRun(Thread* self, size_t idx) { in AllocRun() argument
539 new_run = reinterpret_cast<Run*>(AllocPages(self, numOfPages[idx], kPageMapRun)); in AllocRun()
545 new_run->size_bracket_idx_ = idx; in AllocRun()
550 if (kUsePrefetchDuringAllocRun && idx < kNumThreadLocalSizeBrackets) { in AllocRun()
557 const size_t num_of_slots = numOfSlots[idx]; in AllocRun()
558 const size_t bracket_size = bracketSizes[idx]; in AllocRun()
[all …]
Drosalloc.h286 static size_t IndexToBracketSize(size_t idx) { in IndexToBracketSize() argument
287 DCHECK(idx < kNumOfSizeBrackets); in IndexToBracketSize()
288 return bracketSizes[idx]; in IndexToBracketSize()
293 size_t idx; in BracketSizeToIndex() local
295 idx = kNumOfSizeBrackets - 2; in BracketSizeToIndex()
297 idx = kNumOfSizeBrackets - 1; in BracketSizeToIndex()
301 idx = size / 16 - 1; in BracketSizeToIndex()
303 DCHECK(bracketSizes[idx] == size); in BracketSizeToIndex()
304 return idx; in BracketSizeToIndex()
336 size_t idx = bracket_size / 16 - 1; in SizeToIndexAndBracketSize() local
[all …]
/art/runtime/
Dindirect_reference_table-inl.h42 int idx = ExtractIndex(iref); in GetChecked() local
43 if (UNLIKELY(idx >= topIndex)) { in GetChecked()
45 << iref << " (index " << idx << " in a table of size " << topIndex << ")"; in GetChecked()
49 if (UNLIKELY(table_[idx].GetReference()->IsNull())) { in GetChecked()
54 if (UNLIKELY(!CheckEntry("use", iref, idx))) { in GetChecked()
61 inline bool IndirectReferenceTable::CheckEntry(const char* what, IndirectRef iref, int idx) const { in CheckEntry() argument
62 IndirectRef checkRef = ToIndirectRef(idx); in CheckEntry()
78 uint32_t idx = ExtractIndex(iref); in Get() local
79 mirror::Object* obj = table_[idx].GetReference()->Read<kWithoutReadBarrier>(); in Get()
82 obj = table_[idx].GetReference()->Read(); in Get()
Dindirect_reference_table.cc167 const int idx = ExtractIndex(iref); in Remove() local
168 if (idx < bottomIndex) { in Remove()
170 LOG(WARNING) << "Attempt to remove index outside index area (" << idx in Remove()
174 if (idx >= topIndex) { in Remove()
176 LOG(WARNING) << "Attempt to remove invalid index " << idx in Remove()
181 if (idx == topIndex - 1) { in Remove()
184 if (!CheckEntry("remove", iref, idx)) { in Remove()
188 *table_[idx].GetReference() = GcRoot<mirror::Object>(nullptr); in Remove()
217 if (table_[idx].GetReference()->IsNull()) { in Remove()
218 LOG(INFO) << "--- WEIRD: removing null entry " << idx; in Remove()
[all …]
Dreference_table.cc165 for (int idx = count - 1; idx >= first; --idx) { in Dump() local
166 mirror::Object* ref = entries[idx].Read(); in Dump()
171 os << StringPrintf(" %5d: cleared jweak\n", idx); in Dump()
177 os << StringPrintf(" %5d: %p (raw) (%zd bytes)\n", idx, ref, size); in Dump()
196 os << StringPrintf(" %5d: ", idx) << ref << " " << className << extras << "\n"; in Dump()
223 for (size_t idx = 1; idx < count; idx++) { in Dump() local
224 mirror::Object* prev = sorted_entries[idx-1].Read<kWithoutReadBarrier>(); in Dump()
225 mirror::Object* current = sorted_entries[idx].Read<kWithoutReadBarrier>(); in Dump()
Ddex_file.h243 const TypeItem& GetTypeItem(uint32_t idx) const { in GetTypeItem() argument
244 DCHECK_LT(idx, this->size_); in GetTypeItem()
245 return this->list_[idx]; in GetTypeItem()
458 const StringId& GetStringId(uint32_t idx) const { in GetStringId() argument
459 DCHECK_LT(idx, NumStringIds()) << GetLocation(); in GetStringId()
460 return string_ids_[idx]; in GetStringId()
482 const char* StringDataAndUtf16LengthByIdx(uint32_t idx, uint32_t* utf16_length) const { in StringDataAndUtf16LengthByIdx() argument
483 if (idx == kDexNoIndex) { in StringDataAndUtf16LengthByIdx()
487 const StringId& string_id = GetStringId(idx); in StringDataAndUtf16LengthByIdx()
491 const char* StringDataByIdx(uint32_t idx) const { in StringDataByIdx() argument
[all …]
Ddex_file_verifier.h60 bool CheckClassDataItemField(uint32_t idx, uint32_t access_flags, bool expect_static);
61 bool CheckClassDataItemMethod(uint32_t idx, uint32_t access_flags, uint32_t code_offset,
103 const char* CheckLoadStringByIdx(uint32_t idx, const char* error_fmt);
108 const DexFile::FieldId* CheckLoadFieldId(uint32_t idx, const char* error_fmt);
109 const DexFile::MethodId* CheckLoadMethodId(uint32_t idx, const char* error_fmt);
Ddex_file_verifier.cc69 const char* DexFileVerifier::CheckLoadStringByIdx(uint32_t idx, const char* error_string) { in CheckLoadStringByIdx() argument
70 if (UNLIKELY(!CheckIndex(idx, dex_file_->NumStringIds(), error_string))) { in CheckLoadStringByIdx()
73 return dex_file_->StringDataByIdx(idx); in CheckLoadStringByIdx()
81 uint32_t idx = type_id.descriptor_idx_; in CheckLoadStringByTypeIdx() local
82 return CheckLoadStringByIdx(idx, error_string); in CheckLoadStringByTypeIdx()
85 const DexFile::FieldId* DexFileVerifier::CheckLoadFieldId(uint32_t idx, const char* error_string) { in CheckLoadFieldId() argument
86 if (UNLIKELY(!CheckIndex(idx, dex_file_->NumFieldIds(), error_string))) { in CheckLoadFieldId()
89 return &dex_file_->GetFieldId(idx); in CheckLoadFieldId()
92 const DexFile::MethodId* DexFileVerifier::CheckLoadMethodId(uint32_t idx, const char* err_string) { in CheckLoadMethodId() argument
93 if (UNLIKELY(!CheckIndex(idx, dex_file_->NumMethodIds(), err_string))) { in CheckLoadMethodId()
[all …]
Dclass_linker-inl.h206 inline mirror::DexCache* ClassLinker::GetDexCache(size_t idx) { in GetDexCache() argument
208 DCHECK(idx < dex_caches_.size()); in GetDexCache()
209 return dex_caches_[idx].Read(); in GetDexCache()
/art/runtime/mirror/
Diftable-inl.h28 const size_t idx = i * kMax + kInterface; in SetInterface() local
29 DCHECK_EQ(Get(idx), static_cast<Object*>(nullptr)); in SetInterface()
30 SetWithoutChecks<false>(idx, interface); in SetInterface()
Dclass.cc753 uint16_t Class::GetDirectInterfaceTypeIdx(uint32_t idx) { in GetDirectInterfaceTypeIdx() argument
756 return GetInterfaceTypeList()->GetTypeItem(idx).type_idx_; in GetDirectInterfaceTypeIdx()
759 mirror::Class* Class::GetDirectInterface(Thread* self, Handle<mirror::Class> klass, uint32_t idx) { in GetDirectInterface() argument
764 if (idx == 0) { in GetDirectInterface()
767 DCHECK_EQ(1U, idx); in GetDirectInterface()
773 return interfaces->Get(idx); in GetDirectInterface()
775 uint16_t type_idx = klass->GetDirectInterfaceTypeIdx(idx); in GetDirectInterface()
/art/compiler/dex/
Dssa_transformation.cc141 for (uint32_t idx : bb->data_flow_info->def_v->Indexes()) { in FillDefBlockMatrix() local
143 def_block_matrix_[idx]->SetBit(bb->id); in FillDefBlockMatrix()
447 unsigned int idx; in ComputeSuccLineIn() local
448 for (idx = 0; idx < dest->GetStorageSize(); idx++) { in ComputeSuccLineIn()
449 dest->GetRawStorage()[idx] |= src1->GetRawStorageWord(idx) & ~(src2->GetRawStorageWord(idx)); in ComputeSuccLineIn()
515 for (uint32_t idx : input_blocks->Indexes()) { in InsertPhiNodes() local
516 BasicBlock* def_bb = GetBasicBlock(idx); in InsertPhiNodes()
527 for (uint32_t idx : phi_blocks->Indexes()) { in InsertPhiNodes() local
528 BasicBlock* phi_bb = GetBasicBlock(idx); in InsertPhiNodes()
565 int idx = 0; in InsertPhiNodeOperands() local
[all …]
Ddataflow_iterator-inl.h161 BasicBlockId idx = idx_; in Next() local
163 BasicBlock* bb = mir_graph_->GetBasicBlock(block_id_list_->Get(idx)); in Next()
166 if (loop_ends_->Get(idx) != 0u) { in Next()
167 loop_head_stack_->Insert(std::make_pair(idx, false)); // Not recalculating. in Next()
Dmir_graph.cc321 for (uint32_t idx = 0; idx < handlers_size; idx++) { in ProcessTryCatchBlocks() local
896 int idx; in DumpCFG() local
898 for (idx = 0; idx < num_blocks; idx++) { in DumpCFG()
899 int block_idx = all_blocks ? idx : dfs_order_->Get(idx); in DumpCFG()
1680 uint16_t idx = static_cast<uint16_t>(topological_order_->Size()); in ComputeTopologicalSortOrder() local
1681 topological_order_loop_ends_->Put(topological_order_indexes_->Get(bb->id), idx); in ComputeTopologicalSortOrder()
1752 uint16_t idx = static_cast<uint16_t>(topological_order_->Size()); in ComputeTopologicalSortOrder() local
1753 topological_order_indexes_->Put(bb->id, idx); in ComputeTopologicalSortOrder()
1796 int idx; in HasSuspendTestBetween() local
1797 for (idx = gen_suspend_test_list_.Size() - 1; idx >= 0; idx--) { in HasSuspendTestBetween()
[all …]
Dlocal_value_numbering_test.cc75 #define DEF_AGET(opcode, reg, obj, idx) \ argument
76 { opcode, 0u, 0u, 2, { obj, idx }, 1, { reg } }
77 #define DEF_AGET_WIDE(opcode, reg, obj, idx) \ argument
78 { opcode, 0u, 0u, 2, { obj, idx }, 2, { reg, reg + 1 } }
79 #define DEF_APUT(opcode, reg, obj, idx) \ argument
80 { opcode, 0u, 0u, 3, { reg, obj, idx }, 0, { } }
81 #define DEF_APUT_WIDE(opcode, reg, obj, idx) \ argument
82 { opcode, 0u, 0u, 4, { reg, reg + 1, obj, idx }, 0, { } }
/art/runtime/verifier/
Dregister_line.cc461 for (size_t idx = 0; idx < num_regs_; idx++) { in MergeRegisters() local
462 if (line_[idx] != incoming_line->line_[idx]) { in MergeRegisters()
463 RegType& incoming_reg_type = incoming_line->GetRegisterType(idx); in MergeRegisters()
464 RegType& cur_type = GetRegisterType(idx); in MergeRegisters()
467 line_[idx] = new_type.GetId(); in MergeRegisters()
474 for (uint32_t idx = 0; idx < num_regs_; idx++) { in MergeRegisters() local
475 size_t depths = reg_to_lock_depths_.count(idx); in MergeRegisters()
476 size_t incoming_depths = incoming_line->reg_to_lock_depths_.count(idx); in MergeRegisters()
479 reg_to_lock_depths_.erase(idx); in MergeRegisters()
481 LOG(WARNING) << "mismatched stack depths for register v" << idx in MergeRegisters()
Dmethod_verifier.h122 RegisterLine* GetLine(size_t idx) { in GetLine() argument
123 DCHECK_LT(idx, size_); in GetLine()
124 return register_lines_[idx]; in GetLine()
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 …]
Dmethod_verifier.cc609 for (uint32_t idx = 0; idx < tries_size; idx++) { in ScanTryCatchBlocks() local
610 const DexFile::TryItem* try_item = &tries[idx]; in ScanTryCatchBlocks()
632 for (uint32_t idx = 0; idx < handlers_size; idx++) { in ScanTryCatchBlocks() local
782 bool MethodVerifier::CheckRegisterIndex(uint32_t idx) { in CheckRegisterIndex() argument
783 if (idx >= code_item_->registers_size_) { in CheckRegisterIndex()
784 Fail(VERIFY_ERROR_BAD_CLASS_HARD) << "register index out of range (" << idx << " >= " in CheckRegisterIndex()
791 bool MethodVerifier::CheckWideRegisterIndex(uint32_t idx) { in CheckWideRegisterIndex() argument
792 if (idx + 1 >= code_item_->registers_size_) { in CheckWideRegisterIndex()
793 Fail(VERIFY_ERROR_BAD_CLASS_HARD) << "wide register index out of range (" << idx in CheckWideRegisterIndex()
800 bool MethodVerifier::CheckFieldIndex(uint32_t idx) { in CheckFieldIndex() argument
[all …]
/art/test/074-gc-thrash/src/
DMain.java168 int idx = 0; in run() local
171 strings[idx] = makeString(idx); in run()
173 if (idx % (ARRAY_SIZE / 4) == 0) { in run()
178 idx = (idx + 1) % ARRAY_SIZE; in run()
/art/compiler/optimizing/
Dssa_liveness_analysis.cc190 for (uint32_t idx : live_in->Indexes()) { in ComputeLiveRanges() local
191 HInstruction* current = instructions_from_ssa_index_.Get(idx); in ComputeLiveRanges()
246 for (uint32_t idx : live_in->Indexes()) { in ComputeLiveRanges() local
247 HInstruction* current = instructions_from_ssa_index_.Get(idx); in ComputeLiveRanges()

12