Searched refs:index (Results 1 - 25 of 126) sorted by relevance

123456

/art/test/407-arrays/src/
H A DMain.java34 double[] doubles, int index) {
36 assertEquals(false, bools[index]);
39 assertEquals(0, bytes[index]);
42 assertEquals(0, chars[index]);
45 assertEquals(0, shorts[index]);
48 assertEquals(0, ints[index]);
51 assertNull(objects[index]);
54 assertEquals(0, longs[index]);
57 assertEquals(0, floats[index]);
60 assertEquals(0, doubles[index]);
32 $opt$testReads(boolean[] bools, byte[] bytes, char[] chars, short[] shorts, int[] ints, Object[] objects, long[] longs, float[] floats, double[] doubles, int index) argument
63 $opt$testWrites(boolean[] bools, byte[] bytes, char[] chars, short[] shorts, int[] ints, Object[] objects, long[] longs, float[] floats, double doubles[], int index) argument
124 $opt$testLongWrites(long[] longs, int index) argument
133 ensureThrows(boolean[] array, int index) argument
155 $opt$doArrayLoad(boolean[] array, int index) argument
159 $opt$doArrayStore(boolean[] array, int index) argument
[all...]
/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/runtime/arch/x86_64/
H A Dasm_support_x86_64.S31 #define RAW_VAR(name,index) $index
32 #define VAR(name,index) SYMBOL($index)
33 #define PLT_VAR(name, index) PLT_SYMBOL($index)
34 #define REG_VAR(name,index) %$index
35 #define CALL_MACRO(name,index) $index
[all...]
/art/runtime/
H A Dgc_map.h40 const uint8_t* GetBitMap(size_t index) const {
41 size_t entry_offset = index * EntryWidth();
45 // Get the native PC encoded in the table at the given index.
46 uintptr_t GetNativePcOffset(size_t index) const {
47 size_t entry_offset = index * EntryWidth();
68 size_t index = Hash(native_pc_offset) % num_entries; local
70 while (GetNativePcOffset(index) != native_pc_offset) {
71 index = (index + 1) % num_entries;
75 return GetBitMap(index);
[all...]
H A Dmethod_reference.h26 // A method is uniquely located by its DexFile and the method_ids_ table index into that DexFile
28 MethodReference(const DexFile* file, uint32_t index) : dex_file(file), dex_method_index(index) { argument
H A Dimage.cc131 ArtMethod* ImageHeader::GetImageMethod(ImageMethod index) const {
132 CHECK_LT(static_cast<size_t>(index), kImageMethodsCount);
133 return reinterpret_cast<ArtMethod*>(image_methods_[index]);
136 void ImageHeader::SetImageMethod(ImageMethod index, ArtMethod* method) { argument
137 CHECK_LT(static_cast<size_t>(index), kImageMethodsCount);
138 image_methods_[index] = reinterpret_cast<uint64_t>(method);
141 const ImageSection& ImageHeader::GetImageSection(ImageSections index) const {
142 CHECK_LT(static_cast<size_t>(index), kSectionCount);
143 return sections_[index];
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 Dmonitor_pool.h124 size_t index = offset / kChunkSize; local
126 uintptr_t base = *(monitor_chunks_.LoadRelaxed()+index);
138 for (size_t index = 0; index < num_chunks_; ++index) {
139 uintptr_t chunk_addr = *(monitor_chunks_.LoadRelaxed() + index);
142 reinterpret_cast<uintptr_t>(mon) - chunk_addr + index * kChunkSize);
/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/runtime/arch/x86/
H A Dasm_support_x86.S33 #define RAW_VAR(name,index) $index
34 #define VAR(name,index) SYMBOL($index)
35 #define PLT_VAR(name, index) SYMBOL($index)
36 #define REG_VAR(name,index) %$index
37 #define CALL_MACRO(name,index) $index
[all...]
/art/compiler/utils/
H A Dgrowable_array.h86 void InsertAt(size_t index, T elem) { argument
87 DCHECK(index <= Size());
89 for (size_t i = Size() - 1; i > index; --i) {
92 elem_list_[index] = elem;
99 T Get(size_t index) const {
100 DCHECK_LT(index, num_used_);
101 return elem_list_[index];
104 // Overwrite existing element at position index. List must be large enough.
105 void Put(size_t index, T elem) { argument
106 DCHECK_LT(index, num_used
110 Increment(size_t index) argument
135 DeleteAt(size_t index) argument
[all...]
/art/runtime/gc/accounting/
H A Datomic_stack.h86 // Atomically bump the back index by the given number of
94 int32_t index; local
97 index = back_index_.LoadRelaxed();
98 new_index = index + num_slots;
103 } while (!back_index_.CompareExchangeWeakRelaxed(index, new_index));
104 *start_address = begin_ + index;
108 for (int32_t i = index; i < new_index; ++i) {
110 << "i=" << i << " index=" << index << " new_index=" << new_index;
128 const int32_t index local
143 int32_t index = front_index_.LoadRelaxed(); local
224 int32_t index; local
[all...]
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];
/art/runtime/verifier/
H A Ddex_gc_map.h55 // Get the Dex PC at the given index
56 uint16_t GetDexPc(size_t index) const {
57 size_t entry_offset = index * EntryWidth();
66 const uint8_t* GetBitMap(size_t index) const {
67 size_t entry_offset = index * EntryWidth();
H A Dmethod_verifier-inl.h37 inline const InstructionFlags& MethodVerifier::GetInstructionFlags(size_t index) const {
38 return insn_flags_[index];
/art/test/410-floats/src/
H A DMain.java103 public static void testArrayOperations(float[] a, int index, float value1, float value2) { argument
110 a[index] = value1;
111 a[index + 1] = value2;
117 public static void testArrayOperations(double[] a, int index, double value1, double value2) { argument
124 a[index] = value1;
125 a[index + 1] = value2;
/art/runtime/base/
H A Dhash_set.h66 BaseIterator(HashSetType* hash_set, size_t index) : index_(index), hash_set_(hash_set) { argument
105 size_t NextNonEmptySlot(size_t index, const HashSet* hash_set) const { argument
107 DCHECK_LT(index, num_buckets);
109 ++index;
110 } while (index < num_buckets && hash_set->IsFreeSlot(index));
111 return index;
249 // Relies on maintaining the invariant that there's no empty slots from the 'ideal' index of an
250 // element to its actual location/index
332 const size_t index = FirstAvailableSlot(IndexForHash(hash)); local
389 ElementForIndex(size_t index) argument
418 size_t index = IndexForHash(hash); local
[all...]
/art/test/102-concurrent-gc/src/
H A DMain.java36 int index = rnd.nextInt(buckets);
37 l[index].bytes = new byte[bufferSize];
/art/compiler/optimizing/
H A Dparallel_move_resolver.h86 virtual void EmitMove(size_t index) = 0;
89 virtual void EmitSwap(size_t index) = 0;
97 // Perform the move at the moves_ index in question (possibly requiring
113 MoveOperands* PerformMove(size_t index);
149 virtual void EmitMove(size_t index) = 0;
166 // Perform the move at the given index in `moves_` (possibly requiring other moves to satisfy
168 void PerformMove(size_t index);
H A Dgvn.cc81 size_t index = BucketIndex(hash_code); local
83 if (!buckets_owned_.IsBitSet(index)) {
84 CloneBucket(index);
86 buckets_[index] = new (allocator_) Node(instruction, hash_code, buckets_[index]);
94 size_t index = BucketIndex(hash_code); local
96 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) {
110 size_t index = BucketIndex(hash_code); local
112 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) {
172 Node* CloneBucket(size_t index, Nod argument
[all...]
H A Dcode_generator.h116 // The current index for core registers.
118 // The current index for floating-point registers.
120 // The current stack index.
265 // Helper that returns the pointer offset of an index in an object array.
268 static size_t GetCacheOffset(uint32_t index);
270 size_t GetCachePointerOffset(uint32_t index);
438 size_t GetStackOffsetOfSavedRegister(size_t index);
451 // The current block index in `block_order_` of the block
485 C GetRegisterAt(size_t index) const {
486 DCHECK_LT(index, number_of_registers
[all...]
/art/test/121-modifiers/src/
H A DMain.java146 int index = name.indexOf("Field");
147 if (index > 0) {
148 String shortS = name.substring(0, index);
175 int index = name.indexOf("Method");
176 if (index > 0) {
177 String shortS = name.substring(0, index);
/art/runtime/native/
H A Djava_lang_VMClassLoader.cc64 * entry 'index' of the boot class path.
76 jint index) {
84 if (index < 0 || size_t(index) >= path.size()) {
87 const DexFile* dex_file = path[index];
75 VMClassLoader_getBootClassPathResource(JNIEnv* env, jclass, jstring javaName, jint index) argument
/art/test/036-finalizer/src/
H A DMain.java137 private int index; field in class:Main.FinalizeCounter
148 FinalizeCounter(int index) { argument
149 this.index = index;
154 finalized[index] = true;
/art/runtime/entrypoints/quick/
H A Dquick_throw_entrypoints.cc70 // Called by generated call to throw an array index out of bounds exception.
71 extern "C" NO_RETURN void artThrowArrayBoundsFromCode(int index, int length, Thread* self)
74 ThrowArrayIndexOutOfBoundsException(index, length);

Completed in 1234 milliseconds

123456