Searched refs:index (Results 76 - 100 of 186) sorted by relevance

12345678

/art/runtime/interpreter/mterp/arm/
H A Dop_const_string_jumbo.S9 bl MterpConstString @ (index, tgt_reg, shadow_frame, self)
H A Dop_instance_of.S14 bl MterpInstanceOf @ (index, &obj, method, self)
/art/runtime/interpreter/mterp/mips/
H A Dop_const_string_jumbo.S10 JAL(MterpConstString) # v0 <- Mterp(index, tgt_reg, shadow_frame, self)
H A Dop_instance_of.S15 JAL(MterpInstanceOf) # v0 <- Mterp(index, &obj, method, self)
/art/runtime/interpreter/mterp/mips64/
H A Dop_instance_of.S15 jal MterpInstanceOf # (index, &obj, method, self)
/art/runtime/interpreter/mterp/x86/
H A Dop_instance_of.S19 call SYMBOL(MterpInstanceOf) # (index, &obj, method, self)
/art/runtime/gc/accounting/
H A Dspace_bitmap-inl.h37 const size_t index = OffsetToIndex(offset); local
39 Atomic<uintptr_t>* atomic_entry = reinterpret_cast<Atomic<uintptr_t>*>(&bitmap_begin_[index]);
40 DCHECK_LT(index, bitmap_size_ / sizeof(intptr_t)) << " bitmap_size_ = " << bitmap_size_;
164 const size_t index = OffsetToIndex(offset); local
166 DCHECK_LT(index, bitmap_size_ / sizeof(intptr_t)) << " bitmap_size_ = " << bitmap_size_;
167 uintptr_t* address = &bitmap_begin_[index];
H A Dspace_bitmap.h60 // <index> is the index of .bits that contains the bit representing
67 static constexpr T IndexToOffset(T index) { argument
68 return static_cast<T>(index * kAlignment * kBitsPerIntPtrT);
98 const size_t index = OffsetToIndex(offset); local
99 return index < bitmap_size_ / sizeof(intptr_t);
/art/runtime/mirror/
H A Darray.h69 void* GetRawData(size_t component_size, int32_t index)
72 + (index * component_size);
76 const void* GetRawData(size_t component_size, int32_t index) const {
78 + (index * component_size);
82 // Returns true if the index is valid. If not, throws an ArrayIndexOutOfBoundsException and
85 ALWAYS_INLINE bool CheckIsValidIndex(int32_t index) SHARED_REQUIRES(Locks::mutator_lock_);
95 void ThrowArrayIndexOutOfBoundsException(int32_t index)
H A Dstring.cc77 void String::SetCharAt(int32_t index, uint16_t c) { argument
78 DCHECK((index >= 0) && (index < count_));
79 GetValue()[index] = c;
270 void String::GetChars(int32_t start, int32_t end, Handle<CharArray> array, int32_t index) { argument
271 uint16_t* data = array->GetData() + index;
H A Dstring-inl.h134 inline uint16_t String::CharAt(int32_t index) { argument
136 if (UNLIKELY((index < 0) || (index >= count))) {
139 "length=%i; index=%i", count, index);
142 return GetValue()[index];
/art/runtime/native/
H A Djava_lang_String.cc32 static jchar String_charAt(JNIEnv* env, jobject java_this, jint index) { argument
34 return soa.Decode<mirror::String*>(java_this)->CharAt(index);
84 jcharArray buffer, jint index) {
88 soa.Decode<mirror::String*>(java_this)->GetChars(start, end, char_array, index);
98 static void String_setCharAt(JNIEnv* env, jobject java_this, jint index, jchar c) { argument
100 soa.Decode<mirror::String*>(java_this)->SetCharAt(index, c);
83 String_getCharsNoCheck(JNIEnv* env, jobject java_this, jint start, jint end, jcharArray buffer, jint index) argument
/art/compiler/optimizing/
H A Dparallel_move_resolver.cc119 MoveOperands* ParallelMoveResolverWithSwap::PerformMove(size_t index) { argument
127 MoveOperands* move = moves_[index];
175 moves_[index]->ClearPending(destination);
216 EmitSwap(index);
236 EmitMove(index);
398 void ParallelMoveResolverNoSwap::PerformMove(size_t index) { argument
407 MoveOperands* move = moves_[index];
463 EmitMove(index);
470 EmitMove(index);
482 // We do not depend on the pending move index
[all...]
H A Dload_store_elimination.cc114 // A heap location is a reference-offset/index pair that a value can be loaded from
125 HInstruction* index,
129 index_(index),
133 DCHECK((offset == kInvalidFieldOffset && index != nullptr) ||
134 (offset != kInvalidFieldOffset && index == nullptr));
146 // Returns the definition of declaring class' dex index.
167 HInstruction* const index_; // index of an array element.
168 const int16_t declaring_class_def_index_; // declaring class's def's dex index.
210 HeapLocation* GetHeapLocation(size_t index) const {
211 return heap_locations_[index];
123 HeapLocation(ReferenceInfo* ref_info, size_t offset, HInstruction* index, int16_t declaring_class_def_index) argument
245 FindHeapLocationIndex(ReferenceInfo* ref_info, size_t offset, HInstruction* index, int16_t declaring_class_def_index) const argument
384 GetOrCreateHeapLocation(HInstruction* ref, size_t offset, HInstruction* index, int16_t declaring_class_def_index) argument
410 VisitArrayAccess(HInstruction* array, HInstruction* index) argument
709 VisitGetLocation(HInstruction* instruction, HInstruction* ref, size_t offset, HInstruction* index, int16_t declaring_class_def_index) argument
772 VisitSetLocation(HInstruction* instruction, HInstruction* ref, size_t offset, HInstruction* index, int16_t declaring_class_def_index, HInstruction* value) argument
893 HInstruction* index = instruction->InputAt(1); variable
903 HInstruction* index = instruction->InputAt(1); variable
[all...]
H A Dinstruction_simplifier_arm64.cc32 HInstruction* index,
43 if (index->IsConstant() ||
44 (index->IsBoundsCheck() && index->AsBoundsCheck()->GetIndex()->IsConstant())) {
45 // When the index is a constant all the addressing can be fitted in the
30 TryExtractArrayAccessAddress(HInstruction* access, HInstruction* array, HInstruction* index, int access_size) argument
H A Dbounds_check_elimination.cc301 * incrementing/decrementing array index (MonotonicValueRange).
808 HInstruction* index = bounds_check->InputAt(0); variable
815 // Analyze index range.
816 if (!index->IsIntConstant()) {
817 // Non-constant index.
821 // Try index range obtained by dominator-based analysis.
822 ValueRange* index_range = LookupValueRange(index, block);
824 ReplaceInstruction(bounds_check, index);
827 // Try index range obtained by induction variable analysis.
829 if (InductionRangeFitsIn(&array_range, bounds_check, index,
1199 HInstruction* index = bounds_check->InputAt(0); local
1285 InductionRangeFitsIn(ValueRange* array_range, HInstruction* context, HInstruction* index, bool* try_dynamic_bce) argument
1326 HInstruction* index = instruction->InputAt(0); local
1464 CanHandleInfiniteLoop( HLoopInformation* loop, HBoundsCheck* check, HInstruction* index, bool needs_infinite_test) argument
1648 size_t index = it2->GetIndex(); local
1662 size_t index = it2->GetIndex(); local
[all...]
H A Dinliner.cc192 uint32_t index = DexFile::kDexNoIndex; local
195 index = cls->FindTypeIndexInOtherDexFile(dex_file);
201 index = cls->GetDexTypeIndex();
206 if (dex_cache->GetResolvedType(index) == nullptr) {
207 dex_cache->SetResolvedType(index, cls);
210 index = cls->FindTypeIndexInOtherDexFile(dex_file);
212 // as there may be different class loaders. So only return the index if it's
214 if (index != DexFile::kDexNoIndex && dex_cache->GetResolvedType(index) != cls) {
215 index
606 size_t index = IndexOfElement(graph_->reverse_post_order_, cursor_block); local
[all...]
/art/runtime/
H A Dart_method.h85 // Set an entry at an index.
86 void SetInterfaceMethod(size_t index, size_t pointer_size, ArtMethod* method) { argument
87 SetMethod(index * kMethodCount + kMethodInterface, pointer_size, method);
90 void SetImplementationMethod(size_t index, size_t pointer_size, ArtMethod* method) { argument
91 SetMethod(index * kMethodCount + kMethodImplementation, pointer_size, method);
94 ArtMethod* GetInterfaceMethod(size_t index, size_t pointer_size) const { argument
95 return GetMethod(index * kMethodCount + kMethodInterface, pointer_size);
98 ArtMethod* GetImplementationMethod(size_t index, size_t pointer_size) const { argument
99 return GetMethod(index * kMethodCount + kMethodImplementation, pointer_size);
190 ArtMethod* GetMethod(size_t index, size_ argument
199 SetMethod(size_t index, size_t pointer_size, ArtMethod* method) argument
[all...]
H A Dtransaction.cc159 void Transaction::RecordWriteArray(mirror::Array* array, size_t index, uint64_t value) { argument
165 array_log.LogValue(index, value);
484 void Transaction::ArrayLog::LogValue(size_t index, uint64_t value) { argument
485 auto it = array_values_.find(index);
487 array_values_.insert(std::make_pair(index, value));
501 size_t index, uint64_t value) {
506 array->AsBooleanArray()->SetWithoutChecks<false>(index, static_cast<uint8_t>(value));
509 array->AsByteArray()->SetWithoutChecks<false>(index, static_cast<int8_t>(value));
512 array->AsCharArray()->SetWithoutChecks<false>(index, static_cast<uint16_t>(value));
515 array->AsShortArray()->SetWithoutChecks<false>(index, static_cas
500 UndoArrayWrite(mirror::Array* array, Primitive::Type array_type, size_t index, uint64_t value) argument
[all...]
H A Dmonitor_pool.h137 size_t index = offset / kChunkSize; local
138 size_t top_index = index / kMaxListSize;
139 size_t list_index = index % kMaxListSize;
177 static constexpr size_t ChunkListCapacity(size_t index) { argument
178 return kInitialChunkStorage << index;
200 static constexpr size_t kMaxChunkLists = 8; // Dictated by 3 bit index. Don't increase above 8.
203 // We lose 3 bits in monitor id due to 3 bit monitor_chunks_ index, and gain it back from
213 // Top 3 bits (of 28): index into monitor_chunks_.
214 // Next 16 bits: index into the chunk list, i.e. monitor_chunks_[i].
218 // contains 64K entries, and we make full use of the available index spac
[all...]
H A Dindirect_reference_table.cc142 size_t index; local
153 index = pScan - table_;
157 index = topIndex++;
160 table_[index].Add(obj);
161 result = ToIndirectRef(index);
183 // If the entry is not between the current top index and the bottom index
216 LOG(WARNING) << "Attempt to remove index outside index area (" << idx
222 LOG(WARNING) << "Attempt to remove invalid index " << id
[all...]
H A Doat_file_manager.cc189 static const char* GetClassDescriptor(const DexFile* dex_file, size_t index) { argument
190 DCHECK(IsUint<16>(index));
191 const DexFile::ClassDef& class_def = dex_file->GetClassDef(static_cast<uint16_t>(index));
395 size_t index = 0; local
397 while (!temp.empty() && index < shared_libraries_split.size() - 1) {
402 if (dex_filename != shared_libraries_split[index] ||
403 dex_checksum != std::stoul(shared_libraries_split[index + 1])) {
407 index += 2;
411 return temp.empty() && index == shared_libraries_split.size();
/art/tools/dexfuzz/src/dexfuzz/rawdex/
H A DOffsetTracker.java96 * Related to index_after_map_list, this is the index we save when we're jumping back to
264 * offsettable table index back to the right place.
273 * offsettable table index back to where it was before.
457 int index = getOffsettableIndexForFirstItemType(item);
458 if (index == -1) {
462 insertOffsettableAt(index, offsettable);
474 int index = getOffsettableIndexForItem(itemBefore);
475 if (index == -1) {
479 insertOffsettableAt(index + 1, offsettable);
/art/runtime/interpreter/mterp/
H A Dmterp.cc132 int index = testVal - firstKey; local
133 if (index < 0 || index >= size) {
142 return entries[index];
265 extern "C" bool MterpConstString(uint32_t index, uint32_t tgt_vreg, ShadowFrame* shadow_frame,
268 String* s = ResolveString(self, *shadow_frame, index);
276 extern "C" bool MterpConstClass(uint32_t index, uint32_t tgt_vreg, ShadowFrame* shadow_frame,
279 Class* c = ResolveVerifyAndClinit(index, shadow_frame->GetMethod(), self, false, false);
287 extern "C" bool MterpCheckCast(uint32_t index, StackReference<mirror::Object>* vreg_addr,
290 Class* c = ResolveVerifyAndClinit(index, metho
376 int32_t index = shadow_frame->GetVReg(inst->VRegC_23x()); local
[all...]
/art/dexdump/
H A Ddexdump.cc491 * representation for the index in the given instruction. This will
500 // Determine index and width of the string.
501 u4 index = 0; local
513 index = pDecInsn->VRegB();
517 index = pDecInsn->VRegB();
522 index = pDecInsn->VRegC();
529 // Determine index type.
535 outSize = snprintf(buf, bufSize, "<unknown-index>");
540 outSize = snprintf(buf, bufSize, "<no-index>");
543 if (index < pDexFil
[all...]

Completed in 1779 milliseconds

12345678