/art/test/537-checker-arraycopy/src/ |
H A D | Main.java | 73 public static void arraycopy(Object[] obj, int pos) { argument 74 System.arraycopy(obj, pos, obj, 0, obj.length); 83 public static int arraycopy2(Object[] obj, int pos) { argument 84 System.arraycopy(obj, pos, obj, pos - 1, obj.length); 85 return pos;
|
/art/tools/dexfuzz/src/dexfuzz/rawdex/ |
H A D | Offsettable.java | 87 public void setOriginalPosition(int pos) { argument 88 originalPosition = pos; 105 public void setNewPosition(int pos) { argument 107 newPosition = pos;
|
/art/runtime/base/ |
H A D | stringpiece.cc | 37 StringPiece::size_type StringPiece::copy(char* buf, size_type n, size_type pos) const { 38 size_type ret = std::min(length_ - pos, n); 39 memcpy(buf, ptr_ + pos, ret); 43 StringPiece::size_type StringPiece::find(const StringPiece& s, size_type pos) const { 44 if (length_ == 0 || pos > static_cast<size_type>(length_)) { 47 const char* result = std::search(ptr_ + pos, ptr_ + length_, s.ptr_, s.ptr_ + s.length_); 61 StringPiece::size_type StringPiece::find(char c, size_type pos) const { 62 if (length_ == 0 || pos >= length_) { 65 const char* result = std::find(ptr_ + pos, ptr_ + length_, c); 69 StringPiece::size_type StringPiece::rfind(const StringPiece& s, size_type pos) cons 90 substr(size_type pos, size_type n) const argument [all...] |
H A D | transform_array_ref.h | 120 TransformArrayRef SubArray(size_type pos) { argument 121 return TransformArrayRef(base().subarray(pos), GetFunction()); 123 TransformArrayRef SubArray(size_type pos) const { 124 return TransformArrayRef(base().subarray(pos), GetFunction()); 126 TransformArrayRef SubArray(size_type pos, size_type length) const { argument 127 return TransformArrayRef(base().subarray(pos, length), GetFunction());
|
H A D | array_ref.h | 165 ArrayRef SubArray(size_type pos) { argument 166 return SubArray(pos, size() - pos); 168 ArrayRef<const T> SubArray(size_type pos) const { 169 return SubArray(pos, size() - pos); 171 ArrayRef SubArray(size_type pos, size_type length) { argument 172 DCHECK_LE(pos, size()); 173 DCHECK_LE(length, size() - pos); 174 return ArrayRef(data() + pos, lengt 176 SubArray(size_type pos, size_type length) const argument [all...] |
/art/runtime/ |
H A D | type_lookup_table.h | 45 uint32_t pos = hash & GetSizeMask(); local 46 // Thanks to special insertion algorithm, the element at position pos can be empty or start of 48 const Entry* entry = &entries_[pos]; 56 pos = (pos + entry->next_pos_delta) & GetSizeMask(); 57 entry = &entries_[pos];
|
H A D | dexopt_test.cc | 61 size_t pos = oat_location.find(dalvik_cache); local 62 if (pos != std::string::npos) { 63 oat_location = oat_location.replace(pos, dalvik_cache.length(), dalvik_cache_tmp);
|
H A D | reference_table_test.cc | 178 size_t pos = haystack.find(needle, start); local 179 if (pos == std::string::npos) { 182 res.push_back(pos); 183 start = pos + 1;
|
H A D | type_lookup_table.cc | 116 const uint32_t pos = hash & GetSizeMask(); local 117 if (!entries_[pos].IsEmpty()) { 120 entries_[pos] = entry; 121 entries_[pos].next_pos_delta = 0; 126 uint32_t pos = FindLastEntryInBucket(hash & GetSizeMask()); local 127 uint32_t next_pos = (pos + 1) & GetSizeMask(); 131 const uint32_t delta = (next_pos >= pos) ? (next_pos - pos) : (next_pos + Size() - pos); 132 entries_[pos] [all...] |
H A D | oat_file_assistant_test.cc | 50 size_t pos = dex_location.rfind('/'); local 51 if (pos != std::string::npos) { 53 dex_parent_ = dex_location.substr(0, pos);
|
H A D | safe_map.h | 103 iterator PutBefore(const_iterator pos, const K& k, const V& v) { argument 105 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first)); 106 DCHECK(pos == map_.begin() || map_.key_comp()((--const_iterator(pos))->first, k)); 107 return map_.emplace_hint(pos, k, v); 109 iterator PutBefore(const_iterator pos, const K& k, V&& v) { argument 111 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first)); 112 DCHECK(pos [all...] |
H A D | oat_file_assistant.cc | 128 size_t pos = dex_location_.rfind('/'); local 129 if (pos == std::string::npos) { 132 std::string parent = dex_location_.substr(0, pos); 530 size_t pos = location.rfind('/'); local 531 if (pos == std::string::npos) { 535 std::string dir = location.substr(0, pos+1); 548 std::string file = location.substr(pos+1); 549 pos = file.rfind('.'); 550 if (pos == std::string::npos) { 554 std::string base = file.substr(0, pos); [all...] |
H A D | utils.cc | 851 size_t pos = filename->rfind('/'); local 852 CHECK_NE(pos, std::string::npos) << *filename << " " << isa; 853 filename->insert(pos, "/", 1); 854 filename->insert(pos + 1, GetInstructionSetString(isa));
|
/art/compiler/ |
H A D | cfi_test.h | 85 size_t pos = str.find(substr); local 86 CHECK_NE(std::string::npos, pos); 87 return pos + strlen(substr); 97 size_t pos; local 98 while ((pos = line.find(" ")) != std::string::npos) { 99 line = line.replace(pos, 2, " "); 122 size_t pos; local 123 if ((pos = new_line.find(bad_reg)) != std::string::npos) { 124 new_line = new_line.replace(pos, strlen(bad_reg), ""); 127 if ((pos [all...] |
H A D | image_test.cc | 171 size_t pos = image_filename.rfind('/'); local 172 CHECK_NE(pos, std::string::npos) << image_filename; 174 image_dir = image_filename.substr(0, pos);
|
/art/compiler/optimizing/ |
H A D | optimizing_unit_test.h | 116 std::string::size_type pos = result.find(p.first); local 117 DCHECK_NE(pos, std::string::npos) 119 result.replace(pos, p.first.size(), p.second);
|
H A D | register_allocator_linear_scan.cc | 816 ArenaVector<LiveInterval*>* intervals, ArenaVector<LiveInterval*>::iterator pos) { 817 DCHECK(intervals->begin() <= pos && pos < intervals->end()); 818 LiveInterval* interval = *pos; 820 DCHECK(pos + 1 < intervals->end()); 821 DCHECK_EQ(*(pos + 1), interval->GetHighInterval()); 822 return intervals->erase(pos, pos + 2); 824 DCHECK(intervals->begin() < pos); 825 DCHECK_EQ(*(pos 815 RemoveIntervalAndPotentialOtherHalf( ArenaVector<LiveInterval*>* intervals, ArenaVector<LiveInterval*>::iterator pos) argument [all...] |
H A D | load_store_elimination.cc | 36 ReferenceInfo(HInstruction* reference, size_t pos) argument 38 position_(pos), 264 size_t pos = 0; local 270 aliasing_matrix_.SetBit(CheckedAliasingMatrixPosition(i, j, pos)); 272 pos++; 357 size_t pos = ref_info_array_.size(); local 358 ref_info = new (GetGraph()->GetArena()) ReferenceInfo(instruction, pos);
|
H A D | intrinsics_mips64.cc | 2136 // Utility routine to verify that "length(input) - pos >= length" 2157 Location pos, 2165 // Calculate length(input) - pos. 2166 if (pos.IsConstant()) { 2167 int32_t pos_const = pos.GetConstant()->AsIntConstant()->GetValue(); 2175 // Check that (length(input) - pos) >= zero. 2181 // Verify that (length(input) - pos) >= length. 2185 // The only way the copy can succeed is if pos is zero. 2186 GpuRegister pos_reg = pos.AsRegister<GpuRegister>(); 2189 // Verify that pos > 2156 CheckPosition(Mips64Assembler* assembler, Location pos, GpuRegister input, Location length, SlowPathCodeMIPS64* slow_path, bool length_is_input_length = false) argument [all...] |
/art/runtime/gc/space/ |
H A D | region_space-inl.h | 247 uint8_t* pos = r->Begin(); local 251 r->LiveBytes() != static_cast<size_t>(top - pos); 254 reinterpret_cast<uintptr_t>(pos), 260 while (pos < top) { 261 mirror::Object* obj = reinterpret_cast<mirror::Object*>(pos); 264 pos = reinterpret_cast<uint8_t*>(GetNextObject(obj));
|
H A D | bump_pointer_space.cc | 157 uint8_t* pos = Begin(); local 159 uint8_t* main_end = pos; 176 while (pos < main_end) { 177 mirror::Object* obj = reinterpret_cast<mirror::Object*>(pos); 186 pos = reinterpret_cast<uint8_t*>(GetNextObject(obj)); 190 while (pos < end) { 191 BlockHeader* header = reinterpret_cast<BlockHeader*>(pos); 193 pos += sizeof(BlockHeader); // Skip the header so that we know where the objects 194 mirror::Object* obj = reinterpret_cast<mirror::Object*>(pos); 195 const mirror::Object* end_obj = reinterpret_cast<const mirror::Object*>(pos [all...] |
H A D | malloc_space.cc | 106 size_t pos = recent_free_pos_; local 111 pos = pos != 0 ? pos - 1 : kRecentFreeMask; 112 if (recent_freed_objects_[pos].first == obj) { 113 return recent_freed_objects_[pos].second;
|
/art/test/536-checker-intrinsic-optimization/src/ |
H A D | Main.java | 163 static public char $opt$noinline$stringCharAt(String s, int pos) { argument 165 return s.charAt(pos); 184 static public char $opt$noinline$stringCharAtCatch(String s, int pos) { argument 187 return s.charAt(pos);
|
/art/compiler/utils/mips64/ |
H A D | assembler_mips64_test.cc | 1424 for (int32_t pos = 0; pos < 32; pos++) { 1426 __ Dext(*reg1, *reg2, pos, size); 1427 expected << "dext $" << *reg1 << ", $" << *reg2 << ", " << pos << ", " << size << "\n"; 1443 for (int32_t pos = 32; pos < 64; pos++) { 1444 for (int32_t size = 1; pos + size <= 64; size++) { 1445 __ Dinsu(*reg1, *reg2, pos, siz 2422 Dinsu(mips64::GpuRegister rt, mips64::GpuRegister rs, int pos, int size) argument [all...] |
/art/compiler/linker/arm64/ |
H A D | relative_patcher_arm64_test.cc | 73 void InsertInsn(std::vector<uint8_t>* code, size_t pos, uint32_t insn) { argument 74 CHECK_LE(pos, code->size()); 82 code->insert(code->begin() + pos, insn_code, insn_code + sizeof(insn_code));
|