Searched defs:index (Results 1 - 25 of 146) sorted by relevance

123456

/art/test/562-checker-no-intermediate/src/
H A DMain.java92 array[index] += Math.abs(-42);
95 static int index = 0; field in class:Main
/art/test/413-regalloc-regression/src/
H A DMain.java26 public void removeElementAt(int index) { argument
27 for (int i = index; i < size - 1; i++) {
/art/test/456-baseline-array-set/src/
H A DMain.java22 public static void doArrayAccess(Integer value, int index) { argument
27 array[index] = array[index + 1];
28 array[index] = value;
/art/test/609-checker-x86-bounds-check/src/
H A DMain.java85 static void testArrayLengthBoundsCheckX86(int[] array, int index) { argument
86 array[index] = 9;
/art/libdexfile/dex/
H A Dtype_reference.h31 // A type is located by its DexFile and the string_ids_ table index into that DexFile.
34 TypeReference(const DexFile* file, dex::TypeIndex index) argument
35 : DexFileReference(file, index.index_) {}
38 return dex::TypeIndex(index);
H A Ddex_file_reference.h28 DexFileReference(const DexFile* file, uint32_t idx) : dex_file(file), index(idx) {}
30 uint32_t index; member in class:art::DexFileReference
37 return a.index < b.index;
47 return a.dex_file == b.dex_file && a.index == b.index;
H A Dstring_reference.h31 // A string is located by its DexFile and the string_ids_ table index into that DexFile.
34 StringReference(const DexFile* file, dex::StringIndex index) argument
35 : DexFileReference(file, index.index_) {}
38 return dex::StringIndex(index);
57 sr1.index < sr2.index,
60 return sr1.index < sr2.index;
/art/runtime/
H A Dimtable.h40 uint8_t* AddressOfElement(size_t index, PointerSize pointer_size) { argument
41 return reinterpret_cast<uint8_t*>(this) + OffsetOfElement(index, pointer_size);
44 ArtMethod* Get(size_t index, PointerSize pointer_size) { argument
45 DCHECK_LT(index, kSize);
46 uint8_t* ptr = AddressOfElement(index, pointer_size);
56 void Set(size_t index, ArtMethod* method, PointerSize pointer_size) { argument
57 DCHECK_LT(index, kSize);
58 uint8_t* ptr = AddressOfElement(index, pointer_size);
68 static size_t OffsetOfElement(size_t index, PointerSize pointer_size) { argument
69 return index * static_cas
[all...]
H A Dindex_bss_mapping.cc27 uint32_t index,
29 uint32_t diff = GetIndex(index_bits) - index;
37 // Shift out the index bits and bits for lower indexes.
50 uint32_t index,
53 DCHECK_LT(index, number_of_indexes);
63 return (entry.index_and_mask & index_mask) < index;
69 return entry.GetBssOffset(index_bits, index, slot_size);
26 GetBssOffset(size_t index_bits, uint32_t index, size_t slot_size) const argument
49 GetBssOffset(const IndexBssMapping* mapping, uint32_t index, uint32_t number_of_indexes, size_t slot_size) argument
H A Dmethod_info.h57 ALWAYS_INLINE MethodIndexType GetMethodIndex(size_t index) const {
59 return region_.LoadBits(index * BitSizeOf<MethodIndexType>(), BitSizeOf<MethodIndexType>());
62 void SetMethodIndex(size_t index, MethodIndexType method_index) { argument
63 region_.StoreBits(index * BitSizeOf<MethodIndexType>(),
H A Dmonitor_pool_test.cc80 size_t index = r.next() % monitors.size(); local
81 Monitor* mon = monitors[index];
82 monitors.erase(monitors.begin() + index);
112 size_t index = r.next() % monitors.size(); local
113 Monitor* mon = monitors[index];
114 monitors.erase(monitors.begin() + index);
H A Ddex_reference_collection.h29 // Collection of dex references that is more memory efficient than a vector of <dex, index> pairs.
48 void AddReference(const DexFile* dex, IndexType index) { argument
49 GetOrInsertVector(dex)->push_back(index);
/art/test/145-alloc-tracking-stress/src/
H A DMain.java29 Main(int index) { argument
30 threadIndex = index;
/art/test/597-deopt-new-string/src/
H A DMain.java27 Main(int index) { argument
28 threadIndex = index;
/art/test/626-const-class-linking/src/
H A DRacyLoader.java25 private int index = 0; field in class:RacyLoader
62 my_index = index;
63 ++index;
64 if (index != limit) {
71 } while (index < limit);
H A DRacyMisbehavingLoader.java25 private int index = 0; field in class:RacyMisbehavingLoader
43 ++index;
44 if (index == 2 * count) {
83 my_index = index;
84 ++index;
85 if (index != limit) {
92 } while (index < limit);
/art/dex2oat/linker/
H A Dindex_bss_mapping_encoder.h40 // Try to merge the next index -> bss_offset mapping into the current entry.
42 bool TryMerge(uint32_t index, uint32_t bss_offset) { argument
43 DCHECK_LE(MinimumBitsToStore(index), index_bits_);
44 DCHECK_NE(index, entry_.GetIndex(index_bits_));
48 uint32_t diff = index - entry_.GetIndex(index_bits_);
56 // Insert the bit indicating the index we've just overwritten
59 entry_.index_and_mask = mask | index;
/art/runtime/verifier/
H A Dmethod_verifier-inl.h35 inline const InstructionFlags& MethodVerifier::GetInstructionFlags(size_t index) const {
36 return insn_flags_[index];
39 inline InstructionFlags& MethodVerifier::GetInstructionFlags(size_t index) { argument
40 return insn_flags_[index];
/art/test/497-inlining-and-class-loader/
H A Dclear_dex_cache.cc52 uint32_t index = pair.index; local
56 int_array->Set(2u * i, index);
60 long_array->Set(2u * i, index);
79 uint32_t index; local
83 index = static_cast<uint32_t>(int_array->Get(2u * i));
87 index = dchecked_integral_cast<uint32_t>(long_array->Get(2u * i));
90 mirror::MethodDexCachePair pair(method, index);
/art/test/527-checker-array-access-split/src/
H A DMain.java26 * Test that HArrayGet with a constant index is not split.
57 * Test that HArraySet with a constant index is not split.
120 public static int get(int array[], int index) { argument
121 return array[index];
165 public static void set(int array[], int index, int value) { argument
166 array[index] = value;
233 public static void getSet(int array[], int index) { argument
234 array[index] = array[index] + 1;
309 public static int[] accrossGC(int array[], int index) { argument
[all...]
/art/test/597-deopt-busy-loop/src/
H A DMain.java28 Main(int index) { argument
29 threadIndex = index;
/art/test/905-object-free/src/art/
H A DTest905.java108 private static native long[] getCollectedTags(int index); argument
/art/test/952-invoke-custom/src/
H A DTestInvokeCustomWithConcurrentThreads.java78 private static int setCalled(int index) { argument
79 called[index].getAndIncrement();
80 targetted[getThreadIndex()].set(index);
/art/compiler/optimizing/
H A Dinstruction_simplifier_mips.cc40 HInstruction* index,
50 HInstruction* index,
56 if (index->IsConstant() ||
57 (index->IsBoundsCheck() && index->AsBoundsCheck()->GetIndex()->IsConstant())) {
58 // If index is constant the whole address calculation often can be done by load/store
79 // It is beneficial to extract index intermediate address only if there are at least 2 users.
80 for (const HUseListNode<HInstruction*>& use : index->GetUses()) {
114 new (allocator) HIntermediateArrayAddressIndex(index, shift, kNoDexPc);
49 TryExtractArrayAccessIndex(HInstruction* access, HInstruction* index, DataType::Type packed_type) argument
H A Dnodes_mips.h77 // This instruction computes part of the array access offset (index offset).
80 // Address = CONST_OFFSET + base_addr + index << ELEM_SHIFT. The address part
81 // (index << ELEM_SHIFT) can be shared across array accesses with
82 // the same data type and index. For example, in the following loop 5 accesses can share address
96 HIntermediateArrayAddressIndex(HInstruction* index, HInstruction* shift, uint32_t dex_pc) argument
101 SetRawInputAt(0, index);

Completed in 1087 milliseconds

123456