Searched defs:pos (Results 1 - 12 of 12) sorted by relevance
/art/compiler/ |
H A D | image_test.cc | 53 size_t pos = image_filename.rfind('/'); local 54 CHECK_NE(pos, std::string::npos) << image_filename; 55 std::string image_dir(image_filename, 0, pos);
|
/art/runtime/base/ |
H A D | stringpiece.cc | 28 int StringPiece::copy(char* buf, size_type n, size_type pos) const { 29 int ret = std::min(length_ - pos, n); 30 memcpy(buf, ptr_ + pos, ret); 34 StringPiece::size_type StringPiece::find(const StringPiece& s, size_type pos) const { 35 if (length_ < 0 || pos > static_cast<size_type>(length_)) 38 const char* result = std::search(ptr_ + pos, ptr_ + length_, 53 StringPiece::size_type StringPiece::find(char c, size_type pos) const { 54 if (length_ <= 0 || pos >= static_cast<size_type>(length_)) { 57 const char* result = std::find(ptr_ + pos, ptr_ + length_, c); 61 StringPiece::size_type StringPiece::rfind(const StringPiece& s, size_type pos) cons 82 substr(size_type pos, size_type n) const argument [all...] |
/art/runtime/gc/space/ |
H A D | bump_pointer_space.cc | 154 byte* pos = Begin(); local 156 byte* main_end = pos; 173 while (pos < main_end) { 174 mirror::Object* obj = reinterpret_cast<mirror::Object*>(pos); 182 pos = reinterpret_cast<byte*>(GetNextObject(obj)); 186 while (pos < end) { 187 BlockHeader* header = reinterpret_cast<BlockHeader*>(pos); 189 pos += sizeof(BlockHeader); // Skip the header so that we know where the objects 190 mirror::Object* obj = reinterpret_cast<mirror::Object*>(pos); 191 const mirror::Object* end = reinterpret_cast<const mirror::Object*>(pos [all...] |
H A D | malloc_space.cc | 102 size_t pos = recent_free_pos_; local 107 pos = pos != 0 ? pos - 1 : kRecentFreeMask; 108 if (recent_freed_objects_[pos].first == obj) { 109 return recent_freed_objects_[pos].second;
|
/art/runtime/ |
H A D | safe_map.h | 96 iterator PutBefore(iterator pos, const K& k, const V& v) { argument 98 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first)); 99 DCHECK(pos == map_.begin() || map_.key_comp()((--iterator(pos))->first, k)); 100 return map_.emplace_hint(pos, k, v);
|
H A D | utils.cc | 1282 size_t pos = filename->rfind('/'); local 1283 CHECK_NE(pos, std::string::npos) << *filename << " " << isa; 1284 filename->insert(pos, "/", 1); 1285 filename->insert(pos + 1, GetInstructionSetString(isa));
|
H A D | dex_file.h | 411 const char* pos = strrchr(location, kMultiDexSeparator); local 412 if (pos == nullptr) { 415 return std::string(location, pos - location); 420 size_t pos = location_.rfind(kMultiDexSeparator); local 421 if (pos == std::string::npos) { 424 return location_.substr(0, pos);
|
/art/compiler/optimizing/ |
H A D | builder.cc | 103 uint32_t pos = 1; local 105 switch (shorty[pos++]) { 114 new (arena_) HParameterValue(parameter_index++, Primitive::GetType(shorty[pos - 1]));
|
/art/runtime/mirror/ |
H A D | class-inl.h | 605 uint32_t pos = sizeof(mirror::Class); local 609 MemberOffset offset = MemberOffset(pos); 611 pos += sizeof(ImTableEntry); 615 pos += sizeof(int32_t); 619 MemberOffset offset = MemberOffset(pos); 621 pos += sizeof(VTableEntry);
|
/art/compiler/dex/ |
H A D | local_value_numbering.cc | 1043 int16_t pos = 0; local 1046 DCHECK_LT(pos, mir->ssa_rep->num_uses); 1047 while (incoming[pos] != lvn->Id()) { 1048 ++pos; 1049 DCHECK_LT(pos, mir->ssa_rep->num_uses); 1051 int s_reg = uses[pos]; 1052 ++pos;
|
/art/runtime/gc/allocator/ |
H A D | rosalloc.cc | 773 std::set<Run*>::iterator pos = non_full_runs->find(run); local 774 if (pos != non_full_runs->end()) { 775 non_full_runs->erase(pos); 798 std::set<Run*>::iterator pos = non_full_runs->find(run); local 799 if (pos == non_full_runs->end()) { 1284 std::unordered_set<Run*, hash_run, eq_run>::iterator pos = full_runs->find(run); local 1285 DCHECK(pos != full_runs->end()); 1286 full_runs->erase(pos);
|
/art/runtime/gc/ |
H A D | heap.cc | 1868 uintptr_t pos = it->second; local 1870 forward_address = reinterpret_cast<mirror::Object*>(pos); 1875 AddBin(size - object_size, pos + object_size); // Add a new bin with the remaining space.
|
Completed in 2872 milliseconds