/art/test/407-arrays/src/ |
H A D | Main.java | 33 int[] ints, Object[] objects, long[] longs, int index) { 35 assertEquals(false, bools[index]); 38 assertEquals(0, bytes[index]); 41 assertEquals(0, chars[index]); 44 assertEquals(0, shorts[index]); 47 assertEquals(0, ints[index]); 50 assertNull(objects[index]); 53 assertEquals(0, longs[index]); 57 int[] ints, Object[] objects, long[] longs, int index) { 61 assertEquals(true, bools[index]); 32 $opt$testReads(boolean[] bools, byte[] bytes, char[] chars, short[] shorts, int[] ints, Object[] objects, long[] longs, int index) argument 56 $opt$testWrites(boolean[] bools, byte[] bytes, char[] chars, short[] shorts, int[] ints, Object[] objects, long[] longs, int index) argument 98 ensureThrows(boolean[] array, int index) argument 120 $opt$doArrayLoad(boolean[] array, int index) argument 124 $opt$doArrayStore(boolean[] array, int index) argument [all...] |
/art/runtime/ |
H A D | gc_map.h | 40 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 D | method_reference.h | 26 // 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 D | monitor_pool_test.cc | 80 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 D | monitor_pool.h | 119 size_t index = offset / kChunkSize; local 121 uintptr_t base = *(monitor_chunks_.LoadRelaxed()+index); 133 for (size_t index = 0; index < num_chunks_; ++index) { 134 uintptr_t chunk_addr = *(monitor_chunks_.LoadRelaxed() + index); 136 return OffsetToMonitorId(reinterpret_cast<uintptr_t>(mon) - chunk_addr + index * kChunkSize);
|
/art/runtime/arch/x86/ |
H A D | asm_support_x86.S | 31 #define RAW_VAR(name,index) $index 32 #define VAR(name,index) SYMBOL($index) 33 #define PLT_VAR(name, index) SYMBOL($index) 34 #define REG_VAR(name,index) %$index 35 #define CALL_MACRO(name,index) $index [all...] |
/art/runtime/arch/x86_64/ |
H A D | asm_support_x86_64.S | 31 #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/compiler/utils/ |
H A D | growable_array.h | 123 void InsertAt(size_t index, T elem) { argument 124 DCHECK(index <= Size()); 126 for (size_t i = Size() - 1; i > index; --i) { 129 elem_list_[index] = elem; 136 T Get(size_t index) const { 137 DCHECK_LT(index, num_used_); 138 return elem_list_[index]; 141 // Overwrite existing element at position index. List must be large enough. 142 void Put(size_t index, T elem) { argument 143 DCHECK_LT(index, num_used 147 Increment(size_t index) argument 172 DeleteAt(size_t index) argument [all...] |
/art/runtime/gc/accounting/ |
H A D | atomic_stack.h | 67 // Atomically bump the back index by the given number of 73 int32_t index; local 76 index = back_index_.LoadRelaxed(); 77 new_index = index + num_slots; 82 } while (!back_index_.CompareExchangeWeakRelaxed(index, new_index)); 83 *start_address = &begin_[index]; 87 for (int32_t i = index; i < new_index; ++i) { 89 << "i=" << i << " index=" << index << " new_index=" << new_index; 107 int32_t index local 122 int32_t index = front_index_.LoadRelaxed(); local 198 int32_t index; variable [all...] |
H A D | space_bitmap-inl.h | 37 const size_t index = OffsetToIndex(offset); local 39 Atomic<uword>* atomic_entry = reinterpret_cast<Atomic<uword>*>(&bitmap_begin_[index]); 40 DCHECK_LT(index, bitmap_size_ / kWordSize) << " bitmap_size_ = " << bitmap_size_; 163 const size_t index = OffsetToIndex(offset); local 165 DCHECK_LT(index, bitmap_size_ / kWordSize) << " bitmap_size_ = " << bitmap_size_; 166 uword* address = &bitmap_begin_[index];
|
H A D | space_bitmap.h | 59 // <index> is the index of .bits that contains the bit representing 66 static constexpr T IndexToOffset(T index) { argument 67 return static_cast<T>(index * kAlignment * kBitsPerWord); 97 const size_t index = OffsetToIndex(offset); local 98 return index < bitmap_size_ / kWordSize; 188 const size_t index = OffsetToIndex(offset); local 189 return &bitmap_begin_[index];
|
/art/runtime/base/ |
H A D | hash_set.h | 66 Iterator(HashSet* hash_set, size_t index) : hash_set_(hash_set), index_(index) { argument 107 size_t NextNonEmptySlot(size_t index) const { 109 DCHECK_LT(index, num_buckets); 111 ++index; 112 } while (index < num_buckets && hash_set_->IsFreeSlot(index)); 113 return index; 180 // Relies on maintaining the invariant that there's no empty slots from the 'ideal' index of an 181 // element to its actual location/index 238 size_t index = IndexForHash(hash); local 260 const size_t index = FirstAvailableSlot(IndexForHash(hash)); local 312 ElementForIndex(size_t index) argument [all...] |
/art/runtime/mirror/ |
H A D | string-inl.h | 57 inline uint16_t String::CharAt(int32_t index) { argument 61 if (UNLIKELY(static_cast<uint32_t>(index) >= static_cast<uint32_t>(count_))) { 65 "length=%i; index=%i", count_, index); 68 return GetCharArray()->Get(index + GetOffset());
|
H A D | array.h | 77 void* GetRawData(size_t component_size, int32_t index) 80 + (index * component_size); 84 const void* GetRawData(size_t component_size, int32_t index) const { 86 + (index * component_size); 90 // Returns true if the index is valid. If not, throws an ArrayIndexOutOfBoundsException and 93 ALWAYS_INLINE bool CheckIsValidIndex(int32_t index) SHARED_LOCKS_REQUIRED(Locks::mutator_lock_); 99 void ThrowArrayIndexOutOfBoundsException(int32_t index)
|
/art/runtime/verifier/ |
H A D | dex_gc_map.h | 55 // 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 D | method_verifier-inl.h | 37 inline const InstructionFlags& MethodVerifier::GetInstructionFlags(size_t index) const { 38 return insn_flags_[index];
|
/art/compiler/dex/ |
H A D | vreg_analysis.cc | 22 bool MIRGraph::SetFp(int index, bool is_fp) { argument 24 if (is_fp && !reg_location_[index].fp) { 25 reg_location_[index].fp = true; 26 reg_location_[index].defined = true; 32 bool MIRGraph::SetFp(int index) { argument 34 if (!reg_location_[index].fp) { 35 reg_location_[index].fp = true; 36 reg_location_[index].defined = true; 42 bool MIRGraph::SetCore(int index, bool is_core) { argument 44 if (is_core && !reg_location_[index] 52 SetCore(int index) argument 62 SetRef(int index, bool is_ref) argument 72 SetRef(int index) argument 82 SetWide(int index, bool is_wide) argument 91 SetWide(int index) argument 100 SetHigh(int index, bool is_high) argument 109 SetHigh(int index) argument [all...] |
/art/compiler/optimizing/ |
H A D | parallel_move_resolver.cc | 65 void ParallelMoveResolver::PerformMove(size_t index) { argument 73 DCHECK(!moves_.Get(index)->IsPending()); 74 DCHECK(!moves_.Get(index)->IsRedundant()); 79 DCHECK(!moves_.Get(index)->GetSource().IsInvalid()); 80 Location destination = moves_.Get(index)->MarkPending(); 101 MoveOperands* move = moves_.Get(index); 128 EmitSwap(index); 145 EmitMove(index);
|
H A D | parallel_move_resolver.h | 64 virtual void EmitMove(size_t index) = 0; 67 virtual void EmitSwap(size_t index) = 0; 81 // Perform the move at the moves_ index in question (possibly requiring 83 void PerformMove(size_t index);
|
H A D | parallel_move_test.cc | 29 virtual void EmitMove(size_t index) { argument 30 MoveOperands* move = moves_.Get(index); 41 virtual void EmitSwap(size_t index) { argument 42 MoveOperands* move = moves_.Get(index);
|
H A D | code_generator_x86_64.cc | 654 uint32_t index = gp_index_++; local 656 if (index < calling_convention.GetNumberOfRegisters()) { 657 return X86_64CpuLocation(calling_convention.GetRegisterAt(index)); 664 uint32_t index = gp_index_; local 666 if (index < calling_convention.GetNumberOfRegisters()) { 668 return X86_64CpuLocation(calling_convention.GetRegisterAt(index)); 1090 Location index = locations->InAt(1); local 1096 if (index.IsConstant()) { 1098 (index.GetConstant()->AsIntConstant()->GetValue() << TIMES_1) + data_offset)); 1100 __ movzxb(out, Address(obj, index 1196 Location index = locations->InAt(1); local 1296 CpuRegister index = locations->InAt(0).AsX86_64().AsCpuRegister(); local 1338 EmitMove(size_t index) argument 1435 EmitSwap(size_t index) argument [all...] |
H A D | nodes.h | 463 HUseListNode(T* user, size_t index, HUseListNode* tail) argument 464 : user_(user), index_(index), tail_(tail) {} 512 virtual void SetRawInputAt(size_t index, HInstruction* input) = 0; 517 void AddUseAt(HInstruction* user, size_t index) { argument 518 uses_ = new (block_->GetGraph()->GetArena()) HUseListNode<HInstruction>(user, index, uses_); 521 void AddEnvUseAt(HEnvironment* user, size_t index) { argument 523 user, index, env_uses_); 526 void RemoveUser(HInstruction* user, size_t index); 588 // When doing liveness analysis, instructions that have uses get an SSA index. 658 void SetRawEnvAt(size_t index, HInstructio argument 1147 SetArgumentAt(size_t index, HInstruction* argument) argument 1151 SetRawInputAt(size_t index, HInstruction* input) argument 1238 HParameterValue(uint8_t index, Primitive::Type parameter_type) argument 1278 SetRawInputAt(size_t index, HInstruction* input) argument 1376 HArrayGet(HInstruction* array, HInstruction* index, Primitive::Type type) argument 1390 HArraySet(HInstruction* array, HInstruction* index, HInstruction* value, uint32_t dex_pc) argument 1429 HBoundsCheck(HInstruction* index, HInstruction* length, uint32_t dex_pc) argument 1457 HTemporary(size_t index) argument [all...] |
/art/test/102-concurrent-gc/src/ |
H A D | Main.java | 36 int index = rnd.nextInt(buckets); 37 l[index].bytes = new byte[bufferSize];
|
/art/test/121-modifiers/src/ |
H A D | Main.java | 146 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 D | java_lang_VMClassLoader.cc | 61 * entry 'index' of the boot class path. 72 static jstring VMClassLoader_getBootClassPathResource(JNIEnv* env, jclass, jstring javaName, jint index) { argument 79 if (index < 0 || size_t(index) >= path.size()) { 82 const DexFile* dex_file = path[index];
|