Searched refs:idx (Results 1 - 25 of 69) sorted by relevance

123

/art/tools/dexfuzz/src/dexfuzz/rawdex/formats/
H A DRawInsnHelper.java25 * 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 Diftable-inl.h28 const size_t idx = i * kMax + kInterface; local
29 DCHECK_EQ(Get(idx), static_cast<Object*>(nullptr));
30 SetWithoutChecks<false>(idx, interface);
H A Ddex_cache-inl.h42 inline ArtField* DexCache::GetResolvedField(uint32_t idx, size_t ptr_size) { argument
44 auto* field = GetResolvedFields()->GetElementPtrSize<ArtField*>(idx, ptr_size);
51 inline void DexCache::SetResolvedField(uint32_t idx, ArtField* field, size_t ptr_size) { argument
53 GetResolvedFields()->SetElementPtrSize(idx, field, ptr_size);
67 inline void DexCache::SetResolvedMethod(uint32_t idx, ArtMethod* method, size_t ptr_size) { argument
69 GetResolvedMethods()->SetElementPtrSize(idx, method, ptr_size);
H A Diftable.h50 auto idx = i * kMax + kMethodArray; local
51 DCHECK(Get(idx) == nullptr);
52 Set<false>(idx, arr);
/art/runtime/
H A Dindirect_reference_table-inl.h44 int idx = ExtractIndex(iref); local
45 if (UNLIKELY(idx >= topIndex)) {
47 << iref << " (index " << idx << " in a table of size " << topIndex << ")";
51 if (UNLIKELY(table_[idx].GetReference()->IsNull())) {
56 if (UNLIKELY(!CheckEntry("use", iref, idx))) {
62 // Make sure that the entry at "idx" is correctly paired with "iref".
63 inline bool IndirectReferenceTable::CheckEntry(const char* what, IndirectRef iref, int idx) const {
64 IndirectRef checkRef = ToIndirectRef(idx);
80 uint32_t idx = ExtractIndex(iref); local
81 mirror::Object* obj = table_[idx]
91 uint32_t idx = ExtractIndex(iref); local
[all...]
H A Dindirect_reference_table.cc196 const int idx = ExtractIndex(iref); local
197 if (idx < bottomIndex) {
199 LOG(WARNING) << "Attempt to remove index outside index area (" << idx
203 if (idx >= topIndex) {
205 LOG(WARNING) << "Attempt to remove invalid index " << idx
210 if (idx == topIndex - 1) {
213 if (!CheckEntry("remove", iref, idx)) {
217 *table_[idx].GetReference() = GcRoot<mirror::Object>(nullptr);
245 if (table_[idx].GetReference()->IsNull()) {
246 LOG(INFO) << "--- WEIRD: removing null entry " << idx;
[all...]
H A Ddex_file.h244 const TypeItem& GetTypeItem(uint32_t idx) const {
245 DCHECK_LT(idx, this->size_);
246 return this->list_[idx];
475 const StringId& GetStringId(uint32_t idx) const {
476 DCHECK_LT(idx, NumStringIds()) << GetLocation();
477 return string_ids_[idx];
499 const char* StringDataAndUtf16LengthByIdx(uint32_t idx, uint32_t* utf16_length) const { argument
500 if (idx == kDexNoIndex) {
504 const StringId& string_id = GetStringId(idx);
508 const char* StringDataByIdx(uint32_t idx) cons
540 StringByTypeIdx(uint32_t idx, uint32_t* unicode_length) const argument
1056 DexFileReference(const DexFile* file, uint32_t idx) argument
[all...]
H A 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);
H A Dreference_table.cc165 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);
196 os << StringPrintf(" %5d: ", idx) << ref << " " << className << extras << "\n";
/art/runtime/base/
H A Dbit_vector.cc124 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
352 EnsureSize(uint32_t idx) argument
[all...]
H A Dbit_vector.h44 * for (uint32_t idx : bit_vector.Indexes()) {
45 * // Use idx.
134 void SetBit(uint32_t idx) { argument
139 if (idx >= storage_size_ * kWordBits) {
140 EnsureSize(idx);
142 storage_[WordIndex(idx)] |= BitMask(idx);
146 void ClearBit(uint32_t idx) { argument
148 if (idx < storage_size_ * kWordBits) {
150 storage_[WordIndex(idx)]
232 IsBitSet(const uint32_t* storage, uint32_t idx) argument
254 WordIndex(uint32_t idx) argument
259 BitMask(uint32_t idx) argument
[all...]
H A Dhistogram-inl.h110 for (size_t idx = 0; idx < kInitialBucketCount; idx++) {
210 for (size_t idx = 0; idx < frequency_.size(); idx++) {
211 accumulated += frequency_[idx];
228 for (size_t idx = 0; idx < data.perc_.size(); idx
[all...]
H A Dhistogram_test.cc234 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 Dtiming_logger.h115 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/gc/allocator/
H A Drosalloc-inl.h70 size_t idx = SizeToIndexAndBracketSize(size, &bracket_size); local
71 DCHECK_EQ(idx, SizeToIndex(size));
72 DCHECK_EQ(bracket_size, IndexToBracketSize(idx));
73 DCHECK_EQ(bracket_size, bracketSizes[idx]);
76 DCHECK_LT(idx, kNumThreadLocalSizeBrackets);
77 Run* thread_local_run = reinterpret_cast<Run*>(self->GetRosAllocRun(idx));
80 MutexLock mu(self, *size_bracket_locks_[idx]);
81 CHECK(non_full_runs_[idx].find(thread_local_run) == non_full_runs_[idx].end());
82 CHECK(full_runs_[idx]
96 size_t idx = SizeToIndexAndBracketSize(size, &bracket_size); local
118 size_t idx = SizeToIndexAndBracketSize(size, &bracket_size); local
123 const size_t idx = size_bracket_idx_; local
[all...]
H A Drosalloc.cc317 size_t idx = pm_idx + 1; local
319 while (idx < end && page_map_[idx] == pm_part_type) {
320 page_map_[idx] = kPageMapEmpty;
322 idx++;
544 RosAlloc::Run* RosAlloc::AllocRun(Thread* self, size_t idx) { argument
548 new_run = reinterpret_cast<Run*>(AllocPages(self, numOfPages[idx], kPageMapRun));
554 new_run->size_bracket_idx_ = idx;
559 if (kUsePrefetchDuringAllocRun && idx < kNumThreadLocalSizeBrackets) {
566 const size_t num_of_slots = numOfSlots[idx];
579 RefillRun(Thread* self, size_t idx) argument
595 AllocFromCurrentRunUnlocked(Thread* self, size_t idx) argument
607 << " into full_runs_[" << std::dec << idx << "]"; local
639 size_t idx = SizeToIndexAndBracketSize(size, &bracket_size); local
663 size_t idx = SizeToIndexAndBracketSize(size, &bracket_size); local
713 << " into full_runs_[" << std::dec << idx << "]"; local
776 const size_t idx = run->size_bracket_idx_; local
844 << " into non_full_runs_[" << std::dec << idx << "]"; local
866 size_t idx = size_bracket_idx_; local
885 const uint8_t idx = size_bracket_idx_; local
915 const size_t idx = size_bracket_idx_; local
935 const size_t idx = size_bracket_idx_; local
1016 const uint8_t idx = size_bracket_idx_; local
1053 const uint8_t idx = size_bracket_idx_; local
1091 const size_t idx = size_bracket_idx_; local
1101 const uint8_t idx = size_bracket_idx_; local
1106 const uint8_t idx = size_bracket_idx_; local
1119 size_t idx = size_bracket_idx_; local
1255 size_t idx = run->size_bracket_idx_; local
1344 << " into non_full_runs_[" << std::dec << idx; local
1426 size_t idx = run->size_bracket_idx_; local
1462 size_t idx = pm_idx + 1; local
1484 size_t idx = run->size_bracket_idx_; local
1588 size_t idx = i + 1; local
1687 RevokeRun(Thread* self, size_t idx, Run* run) argument
1697 << " into full_runs_[" << std::dec << idx << "]"; local
1710 << " into non_full_runs_[" << std::dec << idx << "]"; local
1935 size_t idx = i + 1; local
1964 size_t idx = run->size_bracket_idx_; local
2020 const size_t idx = size_bracket_idx_; local
[all...]
H A Drosalloc.h296 static size_t IndexToBracketSize(size_t idx) { argument
297 DCHECK_LT(idx, kNumOfSizeBrackets);
298 return bracketSizes[idx];
303 size_t idx; local
305 idx = kNumOfSizeBrackets - 2;
307 idx = kNumOfSizeBrackets - 1;
311 idx = size / 16 - 1;
313 DCHECK(bracketSizes[idx] == size);
314 return idx;
355 size_t idx
[all...]
/art/compiler/dex/
H A Ddataflow_iterator-inl.h132 BasicBlockId idx = idx_; local
134 BasicBlock* bb = mir_graph_->GetBasicBlock((*block_id_list_)[idx]);
136 if ((*loop_ends_)[idx] != 0u) {
137 loop_head_stack_->push_back(std::make_pair(idx, false)); // Not recalculating.
180 BasicBlockId idx = idx_; local
182 BasicBlock* bb = mir_graph_->GetBasicBlock((*block_id_list_)[idx]);
184 if ((*loop_ends_)[idx] != 0u) {
191 loop_head_stack_->push_back(std::make_pair(idx, recalculating));
H A Dssa_transformation.cc121 * register idx is defined in BasicBlock bb.
128 for (uint32_t idx : bb->data_flow_info->def_v->Indexes()) {
129 /* Block bb defines register idx */
130 temp_.ssa.def_block_matrix[idx]->SetBit(bb->id);
422 unsigned int idx; local
423 for (idx = 0; idx < dest->GetStorageSize(); idx++) {
424 dest->GetRawStorage()[idx] |= src1->GetRawStorageWord(idx)
521 int idx = 0; local
[all...]
/art/tools/dexfuzz/src/dexfuzz/program/
H A DMutatableCode.java138 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 DOffsetTracker.java310 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 Drelative_patcher_test.h85 size_t idx = 0u; local
87 offset = patcher_->ReserveSpace(offset, compiled_method.get(), compiled_method_refs_[idx]);
98 method_offset_map_.map.Put(compiled_method_refs_[idx], quick_code_offset);
99 ++idx;
157 size_t idx = 0u; local
163 ++idx;
165 CHECK_NE(idx, compiled_method_refs_.size());
166 CHECK_EQ(compiled_methods_[idx]->GetQuickCode()->size(), expected_code.size());
170 size_t offset = result.second - compiled_methods_[idx]->CodeDelta();
/art/runtime/verifier/
H A Dmethod_verifier.h118 RegisterLine* GetLine(size_t idx) { argument
119 DCHECK_LT(idx, size_);
120 return register_lines_[idx];
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/utils/
H A Ddex_cache_arrays_layout-inl.h72 inline size_t DexCacheArraysLayout::ElementOffset(size_t element_size, uint32_t idx) { argument
73 return mirror::Array::DataOffset(element_size).Uint32Value() + element_size * idx;
/art/test/074-gc-thrash/src/
H A DMain.java168 int idx = 0;
171 strings[idx] = makeString(idx);
173 if (idx % (ARRAY_SIZE / 4) == 0) {
178 idx = (idx + 1) % ARRAY_SIZE;

Completed in 396 milliseconds

123