/art/tools/dexfuzz/src/dexfuzz/rawdex/formats/ |
H A D | RawInsnHelper.java | 25 * Read a signed byte from the idx into the raw array. 27 public static long getSignedByteFromByte(byte[] raw, int idx) { argument 28 return (long) raw[idx]; 32 * Read an unsigned byte from the idx into the raw array. 34 public static long getUnsignedByteFromByte(byte[] raw, int idx) { argument 35 return ((long) raw[idx]) & 0xff; 39 * Read an unsigned lower 4 bits from the idx into the raw array. 41 public static long getUnsignedLowNibbleFromByte(byte[] raw, int idx) { argument 42 return ((long) raw[idx]) & 0xf; 46 * Read an unsigned higher 4 bits from the idx int 48 getUnsignedHighNibbleFromByte(byte[] raw, int idx) argument 55 getUnsignedShortFromTwoBytes(byte[] raw, int idx) argument 63 getSignedShortFromTwoBytes(byte[] raw, int idx) argument 71 getUnsignedIntFromFourBytes(byte[] raw, int idx) argument 81 getSignedIntFromFourBytes(byte[] raw, int idx) argument 91 getSignedLongFromEightBytes(byte[] raw, int idx) argument 105 writeUnsignedIntToFourBytes(byte[] raw, int idx, int value) argument 115 writeUnsignedShortToTwoBytes(byte[] raw, int idx, int value) argument [all...] |
/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 SetWithoutChecks<false>(idx, interface);
|
H A D | iftable.h | 56 auto idx = i * kMax + kMethodArray; local 57 DCHECK(Get(idx) == nullptr); 58 Set<false>(idx, arr);
|
H A D | dex_cache-inl.h | 98 inline PtrType DexCache::GetElementPtrSize(PtrType* ptr_array, size_t idx, size_t ptr_size) { argument 100 uint64_t element = reinterpret_cast<const uint64_t*>(ptr_array)[idx]; 104 uint32_t element = reinterpret_cast<const uint32_t*>(ptr_array)[idx]; 111 size_t idx, 115 reinterpret_cast<uint64_t*>(ptr_array)[idx] = 119 reinterpret_cast<uint32_t*>(ptr_array)[idx] = 110 SetElementPtrSize(PtrType* ptr_array, size_t idx, PtrType ptr, size_t ptr_size) argument
|
/art/runtime/base/ |
H A D | bit_vector.cc | 124 uint32_t idx; local 125 for (idx = 0; idx < min_size; idx++) { 126 storage_[idx] &= src->GetRawStorageWord(idx); 133 for (; idx < storage_size_; idx++) { 134 storage_[idx] = 0; 161 for (uint32_t idx 195 uint32_t idx = 0; local 255 uint32_t idx; local 348 EnsureSize(uint32_t idx) argument [all...] |
H A D | bit_vector.h | 45 * for (uint32_t idx : bit_vector.Indexes()) { 46 * // Use idx. 149 void SetBit(uint32_t idx) { argument 154 if (idx >= storage_size_ * kWordBits) { 155 EnsureSize(idx); 157 storage_[WordIndex(idx)] |= BitMask(idx); 161 void ClearBit(uint32_t idx) { argument 163 if (idx < storage_size_ * kWordBits) { 165 storage_[WordIndex(idx)] 252 IsBitSet(const uint32_t* storage, uint32_t idx) argument 287 WordIndex(uint32_t idx) argument 292 BitMask(uint32_t idx) argument [all...] |
H A D | histogram-inl.h | 111 for (size_t idx = 0; idx < kInitialBucketCount; idx++) { 218 for (size_t idx = 0; idx < frequency_.size(); idx++) { 219 accumulated += frequency_[idx]; 236 for (size_t idx = 0; idx < data.perc_.size(); idx [all...] |
H A D | histogram_test.cc | 234 for (uint64_t idx = 0ull; idx < 150ull; idx++) { 241 for (size_t idx = 0; idx < 200; idx++) { 257 for (uint64_t idx = 0ull; idx < 30ull; idx++) { 259 hist->AddValue(idx * idx_inne [all...] |
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;
|
/art/runtime/ |
H A D | indirect_reference_table-inl.h | 45 int idx = ExtractIndex(iref); local 46 if (UNLIKELY(idx >= topIndex)) { 51 idx, 56 if (UNLIKELY(table_[idx].GetReference()->IsNull())) { 62 if (UNLIKELY(!CheckEntry("use", iref, idx))) { 68 // Make sure that the entry at "idx" is correctly paired with "iref". 69 inline bool IndirectReferenceTable::CheckEntry(const char* what, IndirectRef iref, int idx) const { 70 IndirectRef checkRef = ToIndirectRef(idx); 89 uint32_t idx = ExtractIndex(iref); local 90 mirror::Object* obj = table_[idx] 100 uint32_t idx = ExtractIndex(iref); local [all...] |
H A D | indirect_reference_table.cc | 213 const int idx = ExtractIndex(iref); local 214 if (idx < bottomIndex) { 216 LOG(WARNING) << "Attempt to remove index outside index area (" << idx 220 if (idx >= topIndex) { 222 LOG(WARNING) << "Attempt to remove invalid index " << idx 227 if (idx == topIndex - 1) { 230 if (!CheckEntry("remove", iref, idx)) { 234 *table_[idx].GetReference() = GcRoot<mirror::Object>(nullptr); 262 if (table_[idx].GetReference()->IsNull()) { 263 LOG(INFO) << "--- WEIRD: removing null entry " << idx; [all...] |
H A D | reference_table.cc | 165 for (int idx = count - 1; idx >= first; --idx) { 166 mirror::Object* ref = entries[idx].Read(); 171 os << StringPrintf(" %5d: cleared jweak\n", idx); 177 os << StringPrintf(" %5d: %p (raw) (%zd bytes)\n", idx, ref, size); 203 os << StringPrintf(" %5d: ", idx) << ref << " " << className << extras << "\n";
|
H A D | dex_file.h | 259 const TypeItem& GetTypeItem(uint32_t idx) const { 260 DCHECK_LT(idx, this->size_); 261 return this->list_[idx]; 507 const StringId& GetStringId(uint32_t idx) const { 508 DCHECK_LT(idx, NumStringIds()) << GetLocation(); 509 return string_ids_[idx]; 531 const char* StringDataAndUtf16LengthByIdx(uint32_t idx, uint32_t* utf16_length) const { argument 532 if (idx == kDexNoIndex) { 536 const StringId& string_id = GetStringId(idx); 540 const char* StringDataByIdx(uint32_t idx) cons 574 StringByTypeIdx(uint32_t idx, uint32_t* unicode_length) const argument 1283 DexFileReference(const DexFile* file, uint32_t idx) argument [all...] |
H A D | dex_file_verifier.h | 62 bool CheckClassDataItemField(uint32_t idx, 67 bool CheckClassDataItemMethod(uint32_t idx, 138 const char* CheckLoadStringByIdx(uint32_t idx, const char* error_fmt); 143 const DexFile::FieldId* CheckLoadFieldId(uint32_t idx, const char* error_fmt); 144 const DexFile::MethodId* CheckLoadMethodId(uint32_t idx, const char* error_fmt); 162 bool CheckFieldAccessFlags(uint32_t idx,
|
H A D | dex_file_verifier.cc | 73 const char* DexFileVerifier::CheckLoadStringByIdx(uint32_t idx, const char* error_string) { argument 74 if (UNLIKELY(!CheckIndex(idx, dex_file_->NumStringIds(), error_string))) { 77 return dex_file_->StringDataByIdx(idx); 85 uint32_t idx = type_id.descriptor_idx_; local 86 return CheckLoadStringByIdx(idx, error_string); 89 const DexFile::FieldId* DexFileVerifier::CheckLoadFieldId(uint32_t idx, const char* error_string) { argument 90 if (UNLIKELY(!CheckIndex(idx, dex_file_->NumFieldIds(), error_string))) { 93 return &dex_file_->GetFieldId(idx); 96 const DexFile::MethodId* DexFileVerifier::CheckLoadMethodId(uint32_t idx, const char* err_string) { argument 97 if (UNLIKELY(!CheckIndex(idx, dex_file 495 CheckClassDataItemField(uint32_t idx, uint32_t access_flags, uint32_t class_access_flags, uint16_t class_type_index, bool expect_static) argument 533 CheckClassDataItemMethod(uint32_t idx, uint32_t access_flags, uint32_t class_access_flags, uint16_t class_type_index, uint32_t code_offset, std::unordered_set<uint32_t>* direct_method_indexes, bool expect_direct) argument 640 uint32_t idx = ReadUnsignedLittleEndian(value_arg + 1); local 651 uint32_t idx = ReadUnsignedLittleEndian(value_arg + 1); local 663 uint32_t idx = ReadUnsignedLittleEndian(value_arg + 1); local 674 uint32_t idx = ReadUnsignedLittleEndian(value_arg + 1); local 731 uint32_t idx = DecodeUnsignedLeb128(&ptr_); local 2120 uint32_t idx = DecodeUnsignedLeb128(&data); local 2456 GetFieldDescriptionOrError(const uint8_t* const begin, const DexFile::Header* const header, uint32_t idx) argument 2473 GetMethodDescriptionOrError(const uint8_t* const begin, const DexFile::Header* const header, uint32_t idx) argument 2490 CheckFieldAccessFlags(uint32_t idx, uint32_t field_access_flags, uint32_t class_access_flags, std::string* error_msg) argument [all...] |
/art/runtime/gc/allocator/ |
H A D | rosalloc-inl.h | 64 size_t idx = SizeToIndexAndBracketSize(size, &bracket_size); local 65 DCHECK_LT(idx, kNumThreadLocalSizeBrackets); 66 Run* thread_local_run = reinterpret_cast<Run*>(self->GetRosAllocRun(idx)); 69 MutexLock mu(self, *size_bracket_locks_[idx]); 70 CHECK(non_full_runs_[idx].find(thread_local_run) == non_full_runs_[idx].end()); 71 CHECK(full_runs_[idx].find(thread_local_run) == full_runs_[idx].end()); 85 size_t idx = SizeToIndexAndBracketSize(size, &bracket_size); local 86 Run* thread_local_run = reinterpret_cast<Run*>(self->GetRosAllocRun(idx)); 107 size_t idx = SizeToIndexAndBracketSize(size, &bracket_size); local 114 const uint8_t idx = size_bracket_idx_; local [all...] |
H A D | rosalloc.cc | 325 size_t idx = pm_idx + 1; local 327 while (idx < end && page_map_[idx] == pm_part_type) { 328 page_map_[idx] = kPageMapEmpty; 330 idx++; 552 RosAlloc::Run* RosAlloc::AllocRun(Thread* self, size_t idx) { argument 556 new_run = reinterpret_cast<Run*>(AllocPages(self, numOfPages[idx], kPageMapRun)); 562 new_run->size_bracket_idx_ = idx; 565 if (kUsePrefetchDuringAllocRun && idx < kNumThreadLocalSizeBrackets) { 572 const size_t num_of_slots = numOfSlots[idx]; 586 RefillRun(Thread* self, size_t idx) argument 602 AllocFromCurrentRunUnlocked(Thread* self, size_t idx) argument 614 << " into full_runs_[" << std::dec << idx << "]"; local 646 size_t idx = SizeToIndexAndBracketSize(size, &bracket_size); local 665 size_t idx = SizeToIndexAndBracketSize(size, &bracket_size); local 704 << " into full_runs_[" << std::dec << idx << "]"; local 767 const size_t idx = run->size_bracket_idx_; local 835 << " into non_full_runs_[" << std::dec << idx << "]"; local 846 const uint8_t idx = size_bracket_idx_; local 864 size_t idx = size_bracket_idx_; local 880 const uint8_t idx = size_bracket_idx_; local 896 const uint8_t idx = size_bracket_idx_; local 932 const uint8_t idx = size_bracket_idx_; local 946 const uint8_t idx = size_bracket_idx_; local 966 const uint8_t idx = size_bracket_idx_; local 973 size_t idx = size_bracket_idx_; local 1110 size_t idx = run->size_bracket_idx_; local 1199 << " into non_full_runs_[" << std::dec << idx; local 1281 size_t idx = run->size_bracket_idx_; local 1317 size_t idx = pm_idx + 1; local 1339 size_t idx = run->size_bracket_idx_; local 1443 size_t idx = i + 1; local 1548 RevokeRun(Thread* self, size_t idx, Run* run) argument 1558 << " into full_runs_[" << std::dec << idx << "]"; local 1571 << " into non_full_runs_[" << std::dec << idx << "]"; local 1792 size_t idx = i + 1; local 1821 size_t idx = run->size_bracket_idx_; local 1877 const size_t idx = size_bracket_idx_; local 2128 size_t idx = i + 1; local 2144 size_t idx = run->size_bracket_idx_; local [all...] |
H A D | rosalloc.h | 371 const uint8_t idx = size_bracket_idx_; local 372 return reinterpret_cast<Slot*>(reinterpret_cast<uintptr_t>(this) + headerSizes[idx]); 375 const uint8_t idx = size_bracket_idx_; local 376 const size_t bracket_size = bracketSizes[idx]; 402 const uint8_t idx = size_bracket_idx_; local 403 const size_t bracket_size = bracketSizes[idx]; 468 const uint8_t idx = size_bracket_idx_; local 469 const size_t bracket_size = bracketSizes[idx]; 474 DCHECK_LT(slot_idx, numOfSlots[idx]); 478 const uint8_t idx local 511 IndexToBracketSize(size_t idx) argument 521 size_t idx; local 577 size_t idx; local [all...] |
/art/runtime/verifier/ |
H A D | register_line.cc | 432 for (size_t idx = 0; idx < num_regs_; idx++) { 433 if (line_[idx] != incoming_line->line_[idx]) { 434 const RegType& incoming_reg_type = incoming_line->GetRegisterType(verifier, idx); 435 const RegType& cur_type = GetRegisterType(verifier, idx); 438 line_[idx] = new_type.GetId(); 451 for (uint32_t idx = 0; idx < num_regs [all...] |
/art/dexlist/ |
H A D | dexlist.cc | 95 const char* fileName, u4 idx, u4 flags ATTRIBUTE_UNUSED, 103 const DexFile::MethodId& pMethodId = pDexFile->GetMethodId(idx); 142 void dumpClass(const DexFile* pDexFile, u4 idx) { argument 143 const DexFile::ClassDef& pClassDef = pDexFile->GetClassDef(idx); 197 for (u4 idx = 0; idx < classDefsSize; idx++) { 198 dumpClass(pDexFile, idx); 94 dumpMethod(const DexFile* pDexFile, const char* fileName, u4 idx, u4 flags ATTRIBUTE_UNUSED, const DexFile::CodeItem* pCode, u4 codeOffset) argument
|
/art/compiler/optimizing/ |
H A D | block_builder.cc | 47 for (size_t idx = 0; idx < code_item_.tries_size_; ++idx) { 48 const DexFile::TryItem* try_item = DexFile::GetTryItems(code_item_, idx); 67 for (uint32_t idx = 0; idx < handlers_size; ++idx) { 278 for (uint32_t idx = 0; idx < handlers_size; ++idx) { [all...] |
/art/tools/dexfuzz/src/dexfuzz/program/ |
H A D | MutatableCode.java | 138 public MInsn getInstructionAt(int idx) { argument 139 return mutatableInsns.get(idx); 206 int idx = 0; 209 matchesIndicesToChange.add(idx); 212 replacementIndicesToChange.add(idx); 215 idx++; 264 int idx = 0; 267 indicesToChange.add(idx); 268 Log.debug(switchInsn + "[" + idx 271 idx [all...] |
/art/tools/dexfuzz/src/dexfuzz/rawdex/ |
H A D | OffsetTracker.java | 310 int idx = 0; 315 idx++; 318 rawDexFile.mapList.mapItems.add(idx, typeListMapItem); 336 int idx = 0; 341 idx++; 344 rawDexFile.mapList.mapItems.add(idx, fieldMapItem); 397 private void insertOffsettableAt(int idx, Offsettable offsettable) { argument 398 offsettableTable.add(idx, offsettable); 399 if (indexAfterMapList > idx) { 402 if (restorePoint > idx) { [all...] |
/art/compiler/linker/ |
H A D | relative_patcher_test.h | 105 size_t idx = 0u; local 107 offset = patcher_->ReserveSpace(offset, compiled_method.get(), compiled_method_refs_[idx]); 118 method_offset_map_.map.Put(compiled_method_refs_[idx], quick_code_offset); 119 ++idx; 186 size_t idx = 0u; local 192 ++idx; 194 CHECK_NE(idx, compiled_method_refs_.size()); 195 CHECK_EQ(compiled_methods_[idx]->GetQuickCode().size(), expected_code.size()); 199 size_t offset = result.second - compiled_methods_[idx]->CodeDelta();
|
/art/test/074-gc-thrash/src/ |
H A D | Main.java | 168 int idx = 0; 171 strings[idx] = makeString(idx); 173 if (idx % (ARRAY_SIZE / 4) == 0) { 178 idx = (idx + 1) % ARRAY_SIZE;
|