Home
last modified time | relevance | path

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

123

/art/tools/dexfuzz/src/dexfuzz/rawdex/formats/
DRawInsnHelper.java27 public static long getSignedByteFromByte(byte[] raw, int idx) { in getSignedByteFromByte() argument
28 return (long) raw[idx]; in getSignedByteFromByte()
34 public static long getUnsignedByteFromByte(byte[] raw, int idx) { in getUnsignedByteFromByte() argument
35 return ((long) raw[idx]) & 0xff; in getUnsignedByteFromByte()
41 public static long getUnsignedLowNibbleFromByte(byte[] raw, int idx) { in getUnsignedLowNibbleFromByte() argument
42 return ((long) raw[idx]) & 0xf; in getUnsignedLowNibbleFromByte()
48 public static long getUnsignedHighNibbleFromByte(byte[] raw, int idx) { in getUnsignedHighNibbleFromByte() argument
49 return (((long) raw[idx]) >> 4) & 0xf; in getUnsignedHighNibbleFromByte()
55 public static long getUnsignedShortFromTwoBytes(byte[] raw, int idx) { in getUnsignedShortFromTwoBytes() argument
56 return (long) ( (((long) raw[idx]) & 0xff) in getUnsignedShortFromTwoBytes()
[all …]
/art/runtime/base/
Dbit_vector.cc124 uint32_t idx; in Intersect() local
125 for (idx = 0; idx < min_size; idx++) { in Intersect()
126 storage_[idx] &= src->GetRawStorageWord(idx); in Intersect()
133 for (; idx < storage_size_; idx++) { in Intersect()
134 storage_[idx] = 0; in Intersect()
161 for (uint32_t idx = 0; idx < src_size; idx++) { in Union() local
162 uint32_t existing = storage_[idx]; in Union()
163 uint32_t update = existing | src->GetRawStorageWord(idx); in Union()
166 storage_[idx] = update; in Union()
195 uint32_t idx = 0; in UnionIfNotIn() local
[all …]
Dbit_vector.h149 void SetBit(uint32_t idx) { in SetBit() argument
154 if (idx >= storage_size_ * kWordBits) { in SetBit()
155 EnsureSize(idx); in SetBit()
157 storage_[WordIndex(idx)] |= BitMask(idx); in SetBit()
161 void ClearBit(uint32_t idx) { in ClearBit() argument
163 if (idx < storage_size_ * kWordBits) { in ClearBit()
165 storage_[WordIndex(idx)] &= ~BitMask(idx); in ClearBit()
170 bool IsBitSet(uint32_t idx) const { in IsBitSet() argument
173 return (idx < (storage_size_ * kWordBits)) && IsBitSet(storage_, idx); in IsBitSet()
225 uint32_t GetRawStorageWord(size_t idx) const { in GetRawStorageWord() argument
[all …]
Dhistogram-inl.h112 for (size_t idx = 0; idx < kInitialBucketCount; idx++) { in Initialize() local
223 for (size_t idx = 0; idx < frequency_.size(); idx++) { in CreateHistogram() local
224 accumulated += frequency_[idx]; in CreateHistogram()
239 for (size_t idx = 0; idx < data.perc_.size(); idx++) { in Percentile() local
240 if (per <= data.perc_[idx]) { in Percentile()
241 upper_idx = idx; in Percentile()
245 if (per >= data.perc_[idx] && idx != 0 && data.perc_[idx] != data.perc_[idx - 1]) { in Percentile()
246 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()
/art/runtime/gc/allocator/
Drosalloc-inl.h64 size_t idx = SizeToIndexAndBracketSize(size, &bracket_size); in CanAllocFromThreadLocalRun() local
65 DCHECK_LT(idx, kNumThreadLocalSizeBrackets); in CanAllocFromThreadLocalRun()
66 Run* thread_local_run = reinterpret_cast<Run*>(self->GetRosAllocRun(idx)); in CanAllocFromThreadLocalRun()
69 MutexLock mu(self, *size_bracket_locks_[idx]); in CanAllocFromThreadLocalRun()
70 CHECK(non_full_runs_[idx].find(thread_local_run) == non_full_runs_[idx].end()); in CanAllocFromThreadLocalRun()
71 CHECK(full_runs_[idx].find(thread_local_run) == full_runs_[idx].end()); in CanAllocFromThreadLocalRun()
85 size_t idx = SizeToIndexAndBracketSize(size, &bracket_size); in AllocFromThreadLocalRun() local
86 Run* thread_local_run = reinterpret_cast<Run*>(self->GetRosAllocRun(idx)); in AllocFromThreadLocalRun()
89 MutexLock mu(self, *size_bracket_locks_[idx]); in AllocFromThreadLocalRun()
90 CHECK(non_full_runs_[idx].find(thread_local_run) == non_full_runs_[idx].end()); in AllocFromThreadLocalRun()
[all …]
Drosalloc.cc330 size_t idx = pm_idx + 1; in FreePages() local
332 while (idx < end && page_map_[idx] == pm_part_type) { in FreePages()
333 page_map_[idx] = kPageMapEmpty; in FreePages()
335 idx++; in FreePages()
545 RosAlloc::Run* RosAlloc::AllocRun(Thread* self, size_t idx) { in AllocRun() argument
549 new_run = reinterpret_cast<Run*>(AllocPages(self, numOfPages[idx], kPageMapRun)); in AllocRun()
555 new_run->size_bracket_idx_ = idx; in AllocRun()
558 if (kUsePrefetchDuringAllocRun && idx < kNumThreadLocalSizeBrackets) { in AllocRun()
565 const size_t num_of_slots = numOfSlots[idx]; in AllocRun()
566 const size_t bracket_size = bracketSizes[idx]; in AllocRun()
[all …]
Drosalloc.h371 const uint8_t idx = size_bracket_idx_; in FirstSlot() local
372 return reinterpret_cast<Slot*>(reinterpret_cast<uintptr_t>(this) + headerSizes[idx]); in FirstSlot()
375 const uint8_t idx = size_bracket_idx_; in LastSlot() local
376 const size_t bracket_size = bracketSizes[idx]; in LastSlot()
402 const uint8_t idx = size_bracket_idx_; in InitFreeList() local
403 const size_t bracket_size = bracketSizes[idx]; in InitFreeList()
468 const uint8_t idx = size_bracket_idx_; in ToSlot() local
469 const size_t bracket_size = bracketSizes[idx]; in ToSlot()
474 DCHECK_LT(slot_idx, numOfSlots[idx]); in ToSlot()
478 const uint8_t idx = size_bracket_idx_; in SlotIndex() local
[all …]
/art/runtime/
Dindirect_reference_table-inl.h48 uint32_t idx = ExtractIndex(iref); in GetChecked() local
49 if (UNLIKELY(idx >= top_index)) { in GetChecked()
54 idx, in GetChecked()
59 if (UNLIKELY(table_[idx].GetReference()->IsNull())) { in GetChecked()
65 if (UNLIKELY(!CheckEntry("use", iref, idx))) { in GetChecked()
74 uint32_t idx) const { in CheckEntry() argument
75 IndirectRef checkRef = ToIndirectRef(idx); in CheckEntry()
94 uint32_t idx = ExtractIndex(iref); in Get() local
95 ObjPtr<mirror::Object> obj = table_[idx].GetReference()->Read<kReadBarrierOption>(); in Get()
105 uint32_t idx = ExtractIndex(iref); in Update() local
[all …]
Ddex_file-inl.h46 inline const char* DexFile::StringDataAndUtf16LengthByIdx(dex::StringIndex idx, in StringDataAndUtf16LengthByIdx() argument
48 if (!idx.IsValid()) { in StringDataAndUtf16LengthByIdx()
52 const StringId& string_id = GetStringId(idx); in StringDataAndUtf16LengthByIdx()
56 inline const char* DexFile::StringDataByIdx(dex::StringIndex idx) const { in StringDataByIdx() argument
58 return StringDataAndUtf16LengthByIdx(idx, &unicode_length); in StringDataByIdx()
61 inline const char* DexFile::StringByTypeIdx(dex::TypeIndex idx, uint32_t* unicode_length) const { in StringByTypeIdx() argument
62 if (!idx.IsValid()) { in StringByTypeIdx()
65 const TypeId& type_id = GetTypeId(idx); in StringByTypeIdx()
69 inline const char* DexFile::StringByTypeIdx(dex::TypeIndex idx) const { in StringByTypeIdx() argument
70 if (!idx.IsValid()) { in StringByTypeIdx()
[all …]
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()
547 const StringId& GetStringId(dex::StringIndex idx) const { in GetStringId() argument
548 DCHECK_LT(idx.index_, NumStringIds()) << GetLocation(); in GetStringId()
549 return string_ids_[idx.index_]; in GetStringId()
568 const char* StringDataAndUtf16LengthByIdx(dex::StringIndex idx, uint32_t* utf16_length) const;
570 const char* StringDataByIdx(dex::StringIndex idx) const;
586 bool IsTypeIndexValid(dex::TypeIndex idx) const { in IsTypeIndexValid() argument
587 return idx.IsValid() && idx.index_ < NumTypeIds(); in IsTypeIndexValid()
[all …]
Dindirect_reference_table.cc363 const uint32_t idx = ExtractIndex(iref); in Remove() local
364 if (idx < bottom_index) { in Remove()
366 LOG(WARNING) << "Attempt to remove index outside index area (" << idx in Remove()
370 if (idx >= top_index) { in Remove()
372 LOG(WARNING) << "Attempt to remove invalid index " << idx in Remove()
380 if (idx == top_index - 1) { in Remove()
383 if (!CheckEntry("remove", iref, idx)) { in Remove()
387 *table_[idx].GetReference() = GcRoot<mirror::Object>(nullptr); in Remove()
417 if (table_[idx].GetReference()->IsNull()) { in Remove()
418 LOG(INFO) << "--- WEIRD: removing null entry " << idx; in Remove()
[all …]
Ddex_file_types.h31 explicit constexpr StringIndex(uint32_t idx) : index_(idx) {} in StringIndex() argument
66 explicit constexpr TypeIndex(uint16_t idx) : index_(idx) {} in TypeIndex() argument
Ddex_file_verifier.h79 bool CheckClassDataItemField(uint32_t idx,
84 bool CheckClassDataItemMethod(uint32_t idx,
158 const char* CheckLoadStringByIdx(dex::StringIndex idx, const char* error_fmt);
163 const DexFile::FieldId* CheckLoadFieldId(uint32_t idx, const char* error_fmt);
164 const DexFile::MethodId* CheckLoadMethodId(uint32_t idx, const char* error_fmt);
165 const DexFile::ProtoId* CheckLoadProtoId(uint32_t idx, const char* error_fmt);
183 bool CheckFieldAccessFlags(uint32_t idx,
Ddex_file_verifier.cc102 const char* DexFileVerifier::CheckLoadStringByIdx(dex::StringIndex idx, const char* error_string) { in CheckLoadStringByIdx() argument
103 if (UNLIKELY(!CheckIndex(idx.index_, dex_file_->NumStringIds(), error_string))) { in CheckLoadStringByIdx()
106 return dex_file_->StringDataByIdx(idx); in CheckLoadStringByIdx()
177 const DexFile::FieldId* DexFileVerifier::CheckLoadFieldId(uint32_t idx, const char* error_string) { in CheckLoadFieldId() argument
178 if (UNLIKELY(!CheckIndex(idx, dex_file_->NumFieldIds(), error_string))) { in CheckLoadFieldId()
181 return &dex_file_->GetFieldId(idx); in CheckLoadFieldId()
184 const DexFile::MethodId* DexFileVerifier::CheckLoadMethodId(uint32_t idx, const char* err_string) { in CheckLoadMethodId() argument
185 if (UNLIKELY(!CheckIndex(idx, dex_file_->NumMethodIds(), err_string))) { in CheckLoadMethodId()
188 return &dex_file_->GetMethodId(idx); in CheckLoadMethodId()
191 const DexFile::ProtoId* DexFileVerifier::CheckLoadProtoId(uint32_t idx, const char* err_string) { in CheckLoadProtoId() argument
[all …]
/art/runtime/mirror/
Diftable-inl.h29 const size_t idx = i * kMax + kInterface; in SetInterface() local
30 DCHECK_EQ(Get(idx), static_cast<Object*>(nullptr)); in SetInterface()
31 SetWithoutChecks<false>(idx, interface); in SetInterface()
36 auto idx = i * kMax + kMethodArray; in SetMethodArray() local
37 DCHECK(Get(idx) == nullptr); in SetMethodArray()
38 Set<false>(idx, arr); in SetMethodArray()
/art/dexlayout/
Ddexlayout.h93 void DumpBytecodes(uint32_t idx, const dex_ir::CodeItem* code, uint32_t code_offset);
95 void DumpClass(int idx, char** last_package);
96 void DumpClassAnnotations(int idx);
97 void DumpClassDef(int idx);
98 void DumpCode(uint32_t idx, const dex_ir::CodeItem* code, uint32_t code_offset);
102 void DumpIField(uint32_t idx, uint32_t flags, int i);
110 void DumpMethod(uint32_t idx, uint32_t flags, const dex_ir::CodeItem* code, int i);
112 void DumpSField(uint32_t idx, uint32_t flags, int i, dex_ir::EncodedValue* init);
128 void DumpCFG(const DexFile* dex_file, int idx);
/art/runtime/verifier/
Dregister_line.cc431 for (size_t idx = 0; idx < num_regs_; idx++) { in MergeRegisters() local
432 if (line_[idx] != incoming_line->line_[idx]) { in MergeRegisters()
433 const RegType& incoming_reg_type = incoming_line->GetRegisterType(verifier, idx); in MergeRegisters()
434 const RegType& cur_type = GetRegisterType(verifier, idx); in MergeRegisters()
438 line_[idx] = new_type.GetId(); in MergeRegisters()
450 for (uint32_t idx = 0; idx < num_regs_; idx++) { in MergeRegisters() local
451 size_t depths = reg_to_lock_depths_.count(idx); in MergeRegisters()
452 size_t incoming_depths = incoming_line->reg_to_lock_depths_.count(idx); in MergeRegisters()
471 if (!FindLockAliasedRegister(idx, in MergeRegisters()
474 !FindLockAliasedRegister(idx, in MergeRegisters()
[all …]
/art/dexlist/
Ddexlist.cc94 const char* fileName, u4 idx, u4 flags ATTRIBUTE_UNUSED, in dumpMethod() argument
102 const DexFile::MethodId& pMethodId = pDexFile->GetMethodId(idx); in dumpMethod()
139 void dumpClass(const DexFile* pDexFile, u4 idx) { in dumpClass() argument
140 const DexFile::ClassDef& pClassDef = pDexFile->GetClassDef(idx); in dumpClass()
193 for (u4 idx = 0; idx < classDefsSize; idx++) { in processFile() local
194 dumpClass(pDexFile, idx); in processFile()
/art/tools/dexfuzz/src/dexfuzz/program/
DMutatableCode.java138 public MInsn getInstructionAt(int idx) { in getInstructionAt() argument
139 return mutatableInsns.get(idx); in getInstructionAt()
206 int idx = 0; in updateTryBlocksWithReplacementInsn() local
209 matchesIndicesToChange.add(idx); in updateTryBlocksWithReplacementInsn()
212 replacementIndicesToChange.add(idx); in updateTryBlocksWithReplacementInsn()
215 idx++; in updateTryBlocksWithReplacementInsn()
264 int idx = 0; in deleteInstructionFull() local
267 indicesToChange.add(idx); in deleteInstructionFull()
268 Log.debug(switchInsn + "[" + idx in deleteInstructionFull()
271 idx++; in deleteInstructionFull()
/art/tools/dexfuzz/src/dexfuzz/rawdex/
DOffsetTracker.java310 int idx = 0; in addTypeListsToMapFile() local
315 idx++; in addTypeListsToMapFile()
318 rawDexFile.mapList.mapItems.add(idx, typeListMapItem); in addTypeListsToMapFile()
336 int idx = 0; in addFieldIdsToHeaderAndMapFile() local
341 idx++; in addFieldIdsToHeaderAndMapFile()
344 rawDexFile.mapList.mapItems.add(idx, fieldMapItem); in addFieldIdsToHeaderAndMapFile()
397 private void insertOffsettableAt(int idx, Offsettable offsettable) { in insertOffsettableAt() argument
398 offsettableTable.add(idx, offsettable); in insertOffsettableAt()
399 if (indexAfterMapList > idx) { in insertOffsettableAt()
402 if (restorePoint > idx) { in insertOffsettableAt()
/art/compiler/optimizing/
Dblock_builder.cc48 for (size_t idx = 0; idx < code_item_.tries_size_; ++idx) { in CreateBranchTargets() local
49 const DexFile::TryItem* try_item = DexFile::GetTryItems(code_item_, idx); in CreateBranchTargets()
68 for (uint32_t idx = 0; idx < handlers_size; ++idx) { in CreateBranchTargets() local
288 for (uint32_t idx = 0; idx < handlers_size; ++idx) { in InsertTryBoundaryBlocks() local
Dload_store_elimination.cc131 auto idx = std::find(possibly_removed_stores_.begin(), in KeepIfIsStore() local
133 if (idx != possibly_removed_stores_.end()) { in KeepIfIsStore()
135 possibly_removed_stores_.erase(idx); in KeepIfIsStore()
295 size_t idx = heap_location_collector_.FindHeapLocationIndex( in VisitGetLocation() local
297 DCHECK_NE(idx, HeapLocationCollector::kHeapLocationNotFound); in VisitGetLocation()
300 HInstruction* heap_value = heap_values[idx]; in VisitGetLocation()
305 heap_values[idx] = constant; in VisitGetLocation()
322 heap_values[idx] = instruction; in VisitGetLocation()
362 size_t idx = heap_location_collector_.FindHeapLocationIndex( in VisitSetLocation() local
364 DCHECK_NE(idx, HeapLocationCollector::kHeapLocationNotFound); in VisitSetLocation()
[all …]
/art/compiler/linker/
Drelative_patcher_test.h110 size_t idx = 0u; in Link() local
112 offset = patcher_->ReserveSpace(offset, compiled_method.get(), compiled_method_refs_[idx]); in Link()
122 method_offset_map_.map.Put(compiled_method_refs_[idx], quick_code_offset); in Link()
123 ++idx; in Link()
195 size_t idx = 0u; in CheckLinkedMethod() local
201 ++idx; in CheckLinkedMethod()
203 CHECK_NE(idx, compiled_method_refs_.size()); in CheckLinkedMethod()
204 CHECK_EQ(compiled_methods_[idx]->GetQuickCode().size(), expected_code.size()); in CheckLinkedMethod()
208 size_t offset = result.second - compiled_methods_[idx]->CodeDelta(); in CheckLinkedMethod()
/art/test/074-gc-thrash/src/
DMain.java167 int idx = 0; in run() local
170 strings[idx] = makeString(idx); in run()
172 if (idx % (ARRAY_SIZE / 4) == 0) { in run()
177 idx = (idx + 1) % ARRAY_SIZE; in run()

123