Home
last modified time | relevance | path

Searched refs:idx (Results 1 – 25 of 69) 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.h134 void SetBit(uint32_t idx) { in SetBit() argument
139 if (idx >= storage_size_ * kWordBits) { in SetBit()
140 EnsureSize(idx); in SetBit()
142 storage_[WordIndex(idx)] |= BitMask(idx); in SetBit()
146 void ClearBit(uint32_t idx) { in ClearBit() argument
148 if (idx < storage_size_ * kWordBits) { in ClearBit()
150 storage_[WordIndex(idx)] &= ~BitMask(idx); in ClearBit()
155 bool IsBitSet(uint32_t idx) const { in IsBitSet() argument
158 return (idx < (storage_size_ * kWordBits)) && IsBitSet(storage_, idx); in IsBitSet()
210 uint32_t GetRawStorageWord(size_t idx) const { in GetRawStorageWord() argument
[all …]
Dhistogram-inl.h110 for (size_t idx = 0; idx < kInitialBucketCount; idx++) { in Initialize() local
210 for (size_t idx = 0; idx < frequency_.size(); idx++) { in CreateHistogram() local
211 accumulated += frequency_[idx]; in CreateHistogram()
228 for (size_t idx = 0; idx < data.perc_.size(); idx++) { in Percentile() local
229 if (per <= data.perc_[idx]) { in Percentile()
230 upper_idx = idx; in Percentile()
234 if (per >= data.perc_[idx] && idx != 0 && data.perc_[idx] != data.perc_[idx - 1]) { in Percentile()
235 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.h70 size_t idx = SizeToIndexAndBracketSize(size, &bracket_size); in CanAllocFromThreadLocalRun() local
71 DCHECK_EQ(idx, SizeToIndex(size)); in CanAllocFromThreadLocalRun()
72 DCHECK_EQ(bracket_size, IndexToBracketSize(idx)); in CanAllocFromThreadLocalRun()
73 DCHECK_EQ(bracket_size, bracketSizes[idx]); in CanAllocFromThreadLocalRun()
76 DCHECK_LT(idx, kNumThreadLocalSizeBrackets); in CanAllocFromThreadLocalRun()
77 Run* thread_local_run = reinterpret_cast<Run*>(self->GetRosAllocRun(idx)); in CanAllocFromThreadLocalRun()
80 MutexLock mu(self, *size_bracket_locks_[idx]); in CanAllocFromThreadLocalRun()
81 CHECK(non_full_runs_[idx].find(thread_local_run) == non_full_runs_[idx].end()); in CanAllocFromThreadLocalRun()
82 CHECK(full_runs_[idx].find(thread_local_run) == full_runs_[idx].end()); in CanAllocFromThreadLocalRun()
96 size_t idx = SizeToIndexAndBracketSize(size, &bracket_size); in AllocFromThreadLocalRun() local
[all …]
Drosalloc.cc317 size_t idx = pm_idx + 1; in FreePages() local
319 while (idx < end && page_map_[idx] == pm_part_type) { in FreePages()
320 page_map_[idx] = kPageMapEmpty; in FreePages()
322 idx++; in FreePages()
544 RosAlloc::Run* RosAlloc::AllocRun(Thread* self, size_t idx) { in AllocRun() argument
548 new_run = reinterpret_cast<Run*>(AllocPages(self, numOfPages[idx], kPageMapRun)); in AllocRun()
554 new_run->size_bracket_idx_ = idx; in AllocRun()
559 if (kUsePrefetchDuringAllocRun && idx < kNumThreadLocalSizeBrackets) { in AllocRun()
566 const size_t num_of_slots = numOfSlots[idx]; in AllocRun()
567 const size_t bracket_size = bracketSizes[idx]; in AllocRun()
[all …]
Drosalloc.h296 static size_t IndexToBracketSize(size_t idx) { in IndexToBracketSize() argument
297 DCHECK_LT(idx, kNumOfSizeBrackets); in IndexToBracketSize()
298 return bracketSizes[idx]; in IndexToBracketSize()
303 size_t idx; in BracketSizeToIndex() local
305 idx = kNumOfSizeBrackets - 2; in BracketSizeToIndex()
307 idx = kNumOfSizeBrackets - 1; in BracketSizeToIndex()
311 idx = size / 16 - 1; in BracketSizeToIndex()
313 DCHECK(bracketSizes[idx] == size); in BracketSizeToIndex()
314 return idx; in BracketSizeToIndex()
355 size_t idx = bracket_size / 16 - 1; in SizeToIndexAndBracketSize() local
[all …]
/art/runtime/
Dindirect_reference_table-inl.h44 int idx = ExtractIndex(iref); in GetChecked() local
45 if (UNLIKELY(idx >= topIndex)) { in GetChecked()
47 << iref << " (index " << idx << " in a table of size " << topIndex << ")"; in GetChecked()
51 if (UNLIKELY(table_[idx].GetReference()->IsNull())) { in GetChecked()
56 if (UNLIKELY(!CheckEntry("use", iref, idx))) { in GetChecked()
63 inline bool IndirectReferenceTable::CheckEntry(const char* what, IndirectRef iref, int idx) const { in CheckEntry() argument
64 IndirectRef checkRef = ToIndirectRef(idx); in CheckEntry()
80 uint32_t idx = ExtractIndex(iref); in Get() local
81 mirror::Object* obj = table_[idx].GetReference()->Read<kReadBarrierOption>(); in Get()
91 uint32_t idx = ExtractIndex(iref); in Update() local
[all …]
Dindirect_reference_table.cc196 const int idx = ExtractIndex(iref); in Remove() local
197 if (idx < bottomIndex) { in Remove()
199 LOG(WARNING) << "Attempt to remove index outside index area (" << idx in Remove()
203 if (idx >= topIndex) { in Remove()
205 LOG(WARNING) << "Attempt to remove invalid index " << idx in Remove()
210 if (idx == topIndex - 1) { in Remove()
213 if (!CheckEntry("remove", iref, idx)) { in Remove()
217 *table_[idx].GetReference() = GcRoot<mirror::Object>(nullptr); in Remove()
245 if (table_[idx].GetReference()->IsNull()) { in Remove()
246 LOG(INFO) << "--- WEIRD: removing null entry " << idx; in Remove()
[all …]
Ddex_file.h244 const TypeItem& GetTypeItem(uint32_t idx) const { in GetTypeItem() argument
245 DCHECK_LT(idx, this->size_); in GetTypeItem()
246 return this->list_[idx]; in GetTypeItem()
475 const StringId& GetStringId(uint32_t idx) const { in GetStringId() argument
476 DCHECK_LT(idx, NumStringIds()) << GetLocation(); in GetStringId()
477 return string_ids_[idx]; in GetStringId()
499 const char* StringDataAndUtf16LengthByIdx(uint32_t idx, uint32_t* utf16_length) const { in StringDataAndUtf16LengthByIdx() argument
500 if (idx == kDexNoIndex) { in StringDataAndUtf16LengthByIdx()
504 const StringId& string_id = GetStringId(idx); in StringDataAndUtf16LengthByIdx()
508 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 …]
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()
/art/runtime/mirror/
Ddex_cache-inl.h42 inline ArtField* DexCache::GetResolvedField(uint32_t idx, size_t ptr_size) { in GetResolvedField() argument
44 auto* field = GetResolvedFields()->GetElementPtrSize<ArtField*>(idx, ptr_size); in GetResolvedField()
51 inline void DexCache::SetResolvedField(uint32_t idx, ArtField* field, size_t ptr_size) { in SetResolvedField() argument
53 GetResolvedFields()->SetElementPtrSize(idx, field, ptr_size); in SetResolvedField()
67 inline void DexCache::SetResolvedMethod(uint32_t idx, ArtMethod* method, size_t ptr_size) { in SetResolvedMethod() argument
69 GetResolvedMethods()->SetElementPtrSize(idx, method, ptr_size); in SetResolvedMethod()
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()
Diftable.h50 auto idx = i * kMax + kMethodArray; in SetMethodArray() local
51 DCHECK(Get(idx) == nullptr); in SetMethodArray()
52 Set<false>(idx, arr); in SetMethodArray()
/art/compiler/dex/
Ddataflow_iterator-inl.h132 BasicBlockId idx = idx_; in Next() local
134 BasicBlock* bb = mir_graph_->GetBasicBlock((*block_id_list_)[idx]); in Next()
136 if ((*loop_ends_)[idx] != 0u) { in Next()
137 loop_head_stack_->push_back(std::make_pair(idx, false)); // Not recalculating. in Next()
180 BasicBlockId idx = idx_; in Next() local
182 BasicBlock* bb = mir_graph_->GetBasicBlock((*block_id_list_)[idx]); in Next()
184 if ((*loop_ends_)[idx] != 0u) { in Next()
191 loop_head_stack_->push_back(std::make_pair(idx, recalculating)); in Next()
Dssa_transformation.cc128 for (uint32_t idx : bb->data_flow_info->def_v->Indexes()) { in FillDefBlockMatrix() local
130 temp_.ssa.def_block_matrix[idx]->SetBit(bb->id); in FillDefBlockMatrix()
422 unsigned int idx; in ComputeSuccLineIn() local
423 for (idx = 0; idx < dest->GetStorageSize(); idx++) { in ComputeSuccLineIn()
424 dest->GetRawStorage()[idx] |= src1->GetRawStorageWord(idx) & ~(src2->GetRawStorageWord(idx)); in ComputeSuccLineIn()
489 for (uint32_t idx : input_blocks->Indexes()) { in FindPhiNodeBlocks() local
490 BasicBlock* def_bb = GetBasicBlock(idx); in FindPhiNodeBlocks()
521 int idx = 0; in InsertPhiNodeOperands() local
525 uses[idx] = pred_bb->data_flow_info->vreg_to_ssa_map_exit[v_reg]; in InsertPhiNodeOperands()
526 incoming[idx] = pred_id; in InsertPhiNodeOperands()
[all …]
/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/runtime/verifier/
Dregister_line.cc375 for (size_t idx = 0; idx < num_regs_; idx++) { in MergeRegisters() local
376 if (line_[idx] != incoming_line->line_[idx]) { in MergeRegisters()
377 const RegType& incoming_reg_type = incoming_line->GetRegisterType(verifier, idx); in MergeRegisters()
378 const RegType& cur_type = GetRegisterType(verifier, idx); in MergeRegisters()
381 line_[idx] = new_type.GetId(); in MergeRegisters()
389 for (uint32_t idx = 0; idx < num_regs_; idx++) { in MergeRegisters() local
390 size_t depths = reg_to_lock_depths_.count(idx); in MergeRegisters()
391 size_t incoming_depths = incoming_line->reg_to_lock_depths_.count(idx); in MergeRegisters()
394 reg_to_lock_depths_.erase(idx); in MergeRegisters()
396 LOG(WARNING) << "mismatched stack depths for register v" << idx in MergeRegisters()
Dmethod_verifier.h118 RegisterLine* GetLine(size_t idx) { in GetLine() argument
119 DCHECK_LT(idx, size_); in GetLine()
120 return register_lines_[idx]; in GetLine()
398 bool CheckRegisterIndex(uint32_t idx);
401 bool CheckWideRegisterIndex(uint32_t idx);
405 bool CheckFieldIndex(uint32_t idx);
409 bool CheckMethodIndex(uint32_t idx);
413 bool CheckNewInstance(uint32_t idx);
416 bool CheckStringIndex(uint32_t idx);
420 bool CheckTypeIndex(uint32_t idx);
[all …]
/art/compiler/linker/
Drelative_patcher_test.h85 size_t idx = 0u; in Link() local
87 offset = patcher_->ReserveSpace(offset, compiled_method.get(), compiled_method_refs_[idx]); in Link()
98 method_offset_map_.map.Put(compiled_method_refs_[idx], quick_code_offset); in Link()
99 ++idx; in Link()
157 size_t idx = 0u; in CheckLinkedMethod() local
163 ++idx; in CheckLinkedMethod()
165 CHECK_NE(idx, compiled_method_refs_.size()); in CheckLinkedMethod()
166 CHECK_EQ(compiled_methods_[idx]->GetQuickCode()->size(), expected_code.size()); in CheckLinkedMethod()
170 size_t offset = result.second - compiled_methods_[idx]->CodeDelta(); in CheckLinkedMethod()
/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()

123