/art/tools/dexfuzz/src/dexfuzz/rawdex/formats/ |
D | RawInsnHelper.java | 27 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/libartbase/base/ |
D | bit_vector.cc | 124 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 …]
|
D | bit_vector.h | 137 void SetBit(uint32_t idx) { in SetBit() argument 142 if (idx >= storage_size_ * kWordBits) { in SetBit() 143 EnsureSize(idx); in SetBit() 145 storage_[WordIndex(idx)] |= BitMask(idx); in SetBit() 149 void ClearBit(uint32_t idx) { in ClearBit() argument 151 if (idx < storage_size_ * kWordBits) { in ClearBit() 153 storage_[WordIndex(idx)] &= ~BitMask(idx); in ClearBit() 158 bool IsBitSet(uint32_t idx) const { in IsBitSet() argument 161 return (idx < (storage_size_ * kWordBits)) && IsBitSet(storage_, idx); in IsBitSet() 213 uint32_t GetRawStorageWord(size_t idx) const { in GetRawStorageWord() argument [all …]
|
D | bit_string.h | 153 size_t idx = 0; in GetBitLengthTotalAtPosition() local 155 while (idx < position && idx < kCapacity) { in GetBitLengthTotalAtPosition() 156 sum += kBitSizeAtPosition[idx]; in GetBitLengthTotalAtPosition() 157 ++idx; in GetBitLengthTotalAtPosition() 182 BitStringChar operator[](size_t idx) const { 183 DCHECK_LT(idx, kCapacity); 185 StorageType data = BitFieldExtract(storage_, GetLsbForPosition(idx), kBitSizeAtPosition[idx]); 187 return BitStringChar(data, kBitSizeAtPosition[idx]); 193 void SetAt(size_t idx, BitStringChar bitchar) { in SetAt() 194 DCHECK_LT(idx, kCapacity); in SetAt() [all …]
|
D | histogram-inl.h | 117 for (size_t idx = 0; idx < kInitialBucketCount; idx++) { in Initialize() local 228 for (size_t idx = 0; idx < frequency_.size(); idx++) { in CreateHistogram() local 229 accumulated += frequency_[idx]; in CreateHistogram() 244 for (size_t idx = 0; idx < data.perc_.size(); idx++) { in Percentile() local 245 if (per <= data.perc_[idx]) { in Percentile() 246 upper_idx = idx; in Percentile() 250 if (per >= data.perc_[idx] && idx != 0 && data.perc_[idx] != data.perc_[idx - 1]) { in Percentile() 251 lower_idx = idx; in Percentile()
|
D | histogram_test.cc | 234 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/ |
D | rosalloc-inl.h | 64 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 …]
|
D | rosalloc.cc | 333 size_t idx = pm_idx + 1; in FreePages() local 335 while (idx < end && page_map_[idx] == pm_part_type) { in FreePages() 336 page_map_[idx] = kPageMapEmpty; in FreePages() 338 idx++; in FreePages() 548 RosAlloc::Run* RosAlloc::AllocRun(Thread* self, size_t idx) { in AllocRun() argument 552 new_run = reinterpret_cast<Run*>(AllocPages(self, numOfPages[idx], kPageMapRun)); in AllocRun() 558 new_run->size_bracket_idx_ = idx; in AllocRun() 561 if (kUsePrefetchDuringAllocRun && idx < kNumThreadLocalSizeBrackets) { in AllocRun() 568 const size_t num_of_slots = numOfSlots[idx]; in AllocRun() 569 const size_t bracket_size = bracketSizes[idx]; in AllocRun() [all …]
|
D | rosalloc.h | 372 const uint8_t idx = size_bracket_idx_; in FirstSlot() local 373 return reinterpret_cast<Slot*>(reinterpret_cast<uintptr_t>(this) + headerSizes[idx]); in FirstSlot() 376 const uint8_t idx = size_bracket_idx_; in LastSlot() local 377 const size_t bracket_size = bracketSizes[idx]; in LastSlot() 403 const uint8_t idx = size_bracket_idx_; in InitFreeList() local 404 const size_t bracket_size = bracketSizes[idx]; in InitFreeList() 469 const uint8_t idx = size_bracket_idx_; in ToSlot() local 470 const size_t bracket_size = bracketSizes[idx]; in ToSlot() 475 DCHECK_LT(slot_idx, numOfSlots[idx]); in ToSlot() 479 const uint8_t idx = size_bracket_idx_; in SlotIndex() local [all …]
|
/art/runtime/ |
D | indirect_reference_table-inl.h | 48 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 …]
|
D | indirect_reference_table.cc | 372 const uint32_t idx = ExtractIndex(iref); in Remove() local 373 if (idx < bottom_index) { in Remove() 375 LOG(WARNING) << "Attempt to remove index outside index area (" << idx in Remove() 379 if (idx >= top_index) { in Remove() 381 LOG(WARNING) << "Attempt to remove invalid index " << idx in Remove() 389 if (idx == top_index - 1) { in Remove() 392 if (!CheckEntry("remove", iref, idx)) { in Remove() 396 *table_[idx].GetReference() = GcRoot<mirror::Object>(nullptr); in Remove() 426 if (table_[idx].GetReference()->IsNull()) { in Remove() 427 LOG(INFO) << "--- WEIRD: removing null entry " << idx; in Remove() [all …]
|
/art/test/596-app-images/ |
D | app_images.cc | 44 size_t idx = loc_name.rfind('/'); in check_name() local 45 if (idx != std::string::npos) { in check_name() 46 loc_name = loc_name.substr(idx + 1); in check_name() 48 idx = loc_name.rfind('.'); in check_name() 49 if (idx != std::string::npos) { in check_name() 50 loc_name = loc_name.substr(0, idx); in check_name()
|
/art/runtime/mirror/ |
D | iftable-inl.h | 39 const size_t idx = i * kMax + kInterface; in SetInterface() local 40 DCHECK(Get(idx) == nullptr); in SetInterface() 41 SetWithoutChecks<false>(idx, interface); in SetInterface() 68 auto idx = i * kMax + kMethodArray; in SetMethodArray() local 69 DCHECK(Get(idx) == nullptr); in SetMethodArray() 70 Set<false>(idx, arr); in SetMethodArray()
|
D | array-inl.h | 230 inline T PointerArray::GetElementPtrSize(uint32_t idx) { in GetElementPtrSize() argument 236 return GetElementPtrSizeUnchecked<T, kPointerSize, kVerifyFlags>(idx); in GetElementPtrSize() 240 inline T PointerArray::GetElementPtrSizeUnchecked(uint32_t idx) { in GetElementPtrSizeUnchecked() argument 246 static_cast<uint64_t>(AsLongArrayUnchecked<kVerifyFlags>()->GetWithoutChecks(idx)); in GetElementPtrSizeUnchecked() 250 static_cast<uint32_t>(AsIntArrayUnchecked<kVerifyFlags>()->GetWithoutChecks(idx)); in GetElementPtrSizeUnchecked() 256 inline T PointerArray::GetElementPtrSize(uint32_t idx, PointerSize ptr_size) { in GetElementPtrSize() argument 258 return GetElementPtrSize<T, PointerSize::k64, kVerifyFlags>(idx); in GetElementPtrSize() 260 return GetElementPtrSize<T, PointerSize::k32, kVerifyFlags>(idx); in GetElementPtrSize() 264 inline void PointerArray::SetElementPtrSize(uint32_t idx, uint64_t element, PointerSize ptr_size) { in SetElementPtrSize() argument 267 SetWithoutChecks<kTransactionActive, kCheckTransaction>(idx, element); in SetElementPtrSize() [all …]
|
/art/dexlayout/ |
D | dexlayout.h | 138 void DumpBytecodes(uint32_t idx, const dex_ir::CodeItem* code, uint32_t code_offset); 140 void DumpClass(int idx, char** last_package); 141 void DumpClassAnnotations(int idx); 142 void DumpClassDef(int idx); 143 void DumpCode(uint32_t idx, 153 void DumpIField(uint32_t idx, uint32_t flags, uint32_t hiddenapi_flags, int i); 161 void DumpMethod(uint32_t idx, 167 void DumpSField(uint32_t idx, 186 void DumpCFG(const DexFile* dex_file, int idx);
|
/art/libdexfile/dex/ |
D | dex_file.h | 243 const dex::StringId& GetStringId(dex::StringIndex idx) const { in GetStringId() argument 244 DCHECK_LT(idx.index_, NumStringIds()) << GetLocation(); in GetStringId() 245 return string_ids_[idx.index_]; in GetStringId() 265 const char* StringDataAndUtf16LengthByIdx(dex::StringIndex idx, uint32_t* utf16_length) const; 267 const char* StringDataByIdx(dex::StringIndex idx) const; 268 std::string_view StringViewByIdx(dex::StringIndex idx) const; 281 bool IsTypeIndexValid(dex::TypeIndex idx) const { in IsTypeIndexValid() argument 282 return idx.IsValid() && idx.index_ < NumTypeIds(); in IsTypeIndexValid() 286 const dex::TypeId& GetTypeId(dex::TypeIndex idx) const { in GetTypeId() argument 287 DCHECK_LT(idx.index_, NumTypeIds()) << GetLocation(); in GetTypeId() [all …]
|
D | dex_file-inl.h | 60 inline const char* DexFile::StringDataAndUtf16LengthByIdx(dex::StringIndex idx, in StringDataAndUtf16LengthByIdx() argument 62 if (!idx.IsValid()) { in StringDataAndUtf16LengthByIdx() 66 const dex::StringId& string_id = GetStringId(idx); in StringDataAndUtf16LengthByIdx() 70 inline const char* DexFile::StringDataByIdx(dex::StringIndex idx) const { in StringDataByIdx() argument 72 return StringDataAndUtf16LengthByIdx(idx, &unicode_length); in StringDataByIdx() 75 inline std::string_view DexFile::StringViewByIdx(dex::StringIndex idx) const { in StringViewByIdx() argument 77 const char* data = StringDataAndUtf16LengthByIdx(idx, &unicode_length); in StringViewByIdx() 81 inline const char* DexFile::StringByTypeIdx(dex::TypeIndex idx, uint32_t* unicode_length) const { in StringByTypeIdx() argument 82 if (!idx.IsValid()) { in StringByTypeIdx() 85 const dex::TypeId& type_id = GetTypeId(idx); in StringByTypeIdx() [all …]
|
D | dex_file_reference.h | 28 DexFileReference(const DexFile* file, uint32_t idx) : dex_file(file), index(idx) {} in DexFileReference() argument
|
/art/dexlist/ |
D | dexlist.cc | 86 const char* fileName, u4 idx, u4 flags ATTRIBUTE_UNUSED, in dumpMethod() argument 92 CodeItemDebugInfoAccessor accessor(*pDexFile, pCode, idx); in dumpMethod() 95 const dex::MethodId& pMethodId = pDexFile->GetMethodId(idx); in dumpMethod() 136 void dumpClass(const DexFile* pDexFile, u4 idx) { in dumpClass() argument 137 const dex::ClassDef& class_def = pDexFile->GetClassDef(idx); in dumpClass() 190 for (u4 idx = 0; idx < classDefsSize; idx++) { in processFile() local 191 dumpClass(pDexFile, idx); in processFile()
|
/art/runtime/verifier/ |
D | register_line.cc | 433 for (size_t idx = 0; idx < num_regs_; idx++) { in MergeRegisters() local 434 if (line_[idx] != incoming_line->line_[idx]) { in MergeRegisters() 435 const RegType& incoming_reg_type = incoming_line->GetRegisterType(verifier, idx); in MergeRegisters() 436 const RegType& cur_type = GetRegisterType(verifier, idx); in MergeRegisters() 440 line_[idx] = new_type.GetId(); in MergeRegisters() 452 for (uint32_t idx = 0; idx < num_regs_; idx++) { in MergeRegisters() local 453 size_t depths = reg_to_lock_depths_.count(idx); in MergeRegisters() 454 size_t incoming_depths = incoming_line->reg_to_lock_depths_.count(idx); in MergeRegisters() 473 if (!FindLockAliasedRegister(idx, in MergeRegisters() 476 !FindLockAliasedRegister(idx, in MergeRegisters() [all …]
|
/art/compiler/optimizing/ |
D | load_store_elimination.cc | 310 auto idx = std::find(possibly_removed_stores_.begin(), in KeepIfIsStore() local 312 if (idx != possibly_removed_stores_.end()) { in KeepIfIsStore() 314 possibly_removed_stores_.erase(idx); in KeepIfIsStore() 544 void VisitGetLocation(HInstruction* instruction, size_t idx) { in VisitGetLocation() argument 545 DCHECK_NE(idx, HeapLocationCollector::kHeapLocationNotFound); in VisitGetLocation() 548 HInstruction* heap_value = heap_values[idx]; in VisitGetLocation() 553 heap_values[idx] = constant; in VisitGetLocation() 556 heap_values[idx] = kUnknownHeapValue; in VisitGetLocation() 564 heap_values[idx] = instruction; in VisitGetLocation() 565 KeepStoresIfAliasedToLocation(heap_values, idx); in VisitGetLocation() [all …]
|
/art/tools/dexfuzz/src/dexfuzz/program/ |
D | MutatableCode.java | 138 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/ |
D | OffsetTracker.java | 310 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/test/074-gc-thrash/src/ |
D | Main.java | 167 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()
|
/art/runtime/base/ |
D | timing_logger.h | 135 uint64_t GetTotalTime(size_t idx) { in GetTotalTime() argument 136 return data_[idx].total_time; in GetTotalTime() 138 uint64_t GetExclusiveTime(size_t idx) { in GetExclusiveTime() argument 139 return data_[idx].exclusive_time; in GetExclusiveTime()
|