/art/compiler/dex/quick/ |
H A D | lazy_debug_frame_opcode_writer.cc | 35 size_t pos = 0; local 37 DCHECK_GE(advance.pos, pos); 40 old_opcodes.begin() + pos, 41 old_opcodes.begin() + advance.pos); 42 pos = advance.pos; 50 old_opcodes.begin() + pos,
|
H A D | lazy_debug_frame_opcode_writer.h | 53 size_t pos; member in struct:art::dwarf::FINAL::__anon21
|
/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 | stringpiece.h | 142 size_type copy(char* buf, size_type n, size_type pos = 0) const; 144 size_type find(const StringPiece& s, size_type pos = 0) const; 145 size_type find(char c, size_type pos = 0) const; 146 size_type rfind(const StringPiece& s, size_type pos = npos) const; 147 size_type rfind(char c, size_type pos = npos) const; 149 StringPiece substr(size_type pos, size_type n = npos) const;
|
/art/compiler/ |
H A D | cfi_test.h | 75 size_t pos = str.find(substr); local 76 CHECK_NE(std::string::npos, pos); 77 return pos + strlen(substr); 87 size_t pos; local 88 while ((pos = line.find(" ")) != std::string::npos) { 89 line = line.replace(pos, 2, " "); 112 size_t pos; local 113 if ((pos = new_line.find(bad_reg)) != std::string::npos) { 114 new_line = new_line.replace(pos, strlen(bad_reg), ""); 117 if ((pos [all...] |
H A D | image_test.cc | 54 size_t pos = image_filename.rfind('/'); local 55 CHECK_NE(pos, std::string::npos) << image_filename; 56 std::string image_dir(image_filename, 0, pos);
|
/art/runtime/gc/space/ |
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 | 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;
|
H A D | region_space-inl.h | 245 uint8_t* pos = r->Begin(); local 247 while (pos < top) { 248 mirror::Object* obj = reinterpret_cast<mirror::Object*>(pos); 251 pos = reinterpret_cast<uint8_t*>(GetNextObject(obj));
|
/art/compiler/optimizing/ |
H A D | optimizing_unit_test.h | 104 std::string::size_type pos = result.find(p.first); local 105 EXPECT_NE(pos, std::string::npos); 106 result.replace(pos, p.first.size(), p.second);
|
/art/runtime/ |
H A D | safe_map.h | 97 iterator PutBefore(iterator pos, const K& k, const V& v) { argument 99 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first)); 100 DCHECK(pos == map_.begin() || map_.key_comp()((--iterator(pos))->first, k)); 101 return map_.emplace_hint(pos, k, v);
|
H A D | oat_file_assistant.cc | 756 size_t pos = location.rfind('/'); local 757 if (pos == std::string::npos) { 761 std::string dir = location.substr(0, pos+1); 766 if (pos == std::string::npos) { 769 file = location.substr(pos+1); 773 pos = file.rfind('.'); 774 if (pos == std::string::npos) { 778 std::string base = file.substr(0, pos);
|
H A D | dex_file.h | 420 const char* pos = strrchr(location, kMultiDexSeparator); local 421 if (pos == nullptr) { 424 return std::string(location, pos - location); 436 size_t pos = location.rfind(kMultiDexSeparator); local 437 if (pos == std::string::npos) { 440 return location.substr(pos);
|
H A D | utils.cc | 1361 size_t pos = filename->rfind('/'); local 1362 CHECK_NE(pos, std::string::npos) << *filename << " " << isa; 1363 filename->insert(pos, "/", 1); 1364 filename->insert(pos + 1, GetInstructionSetString(isa));
|
/art/compiler/dex/ |
H A D | mir_analysis.cc | 1278 for (size_t pos = 0u; pos != ifield_pos; ++pos) { 1279 const uint32_t field_idx = field_idxs[pos]; 1284 MirIFieldLoweringInfo(masked_field_idx, field_types[pos], is_quickened)); 1294 for (size_t pos = max_refs; pos != sfield_pos;) { 1295 --pos; 1296 sfield_lowering_infos_.push_back(MirSFieldLoweringInfo(field_idxs[pos], field_types[pos])); [all...] |
H A D | mir_graph_test.cc | 434 size_t pos = 0; local 438 ASSERT_NE(arraysize(expected_and_change), pos); local 439 ASSERT_EQ(expected_and_change[pos].first, bb->id) << pos; 440 change = expected_and_change[pos].second; 441 ++pos; 443 ASSERT_EQ(arraysize(expected_and_change), pos); local
|
H A D | gvn_dead_code_elimination.h | 99 MIRData* GetMIRData(size_t pos);
|
H A D | gvn_dead_code_elimination.cc | 92 uint16_t pos = mir_data_.size(); local 106 vreg_data_[v_reg].change = pos; 117 vreg_data_[v_reg + 1].change = pos; 165 inline GvnDeadCodeElimination::MIRData* GvnDeadCodeElimination::VRegChains::GetMIRData(size_t pos) { argument 166 DCHECK_LT(pos, mir_data_.size()); 167 return &mir_data_[pos];
|
H A D | mir_graph.cc | 2438 auto pos = std::find(predecessors.begin(), predecessors.end(), old_pred); local 2439 DCHECK(pos != predecessors.end()); 2440 // It's faster to move the back() to *pos than erase(pos). 2441 *pos = predecessors.back(); 2443 size_t idx = std::distance(predecessors.begin(), pos); 2458 auto pos = std::find(predecessors.begin(), predecessors.end(), old_pred); local 2459 DCHECK(pos != predecessors.end()); 2460 *pos = new_pred; 2461 size_t idx = std::distance(predecessors.begin(), pos); [all...] |
H A D | local_value_numbering.cc | 1170 int16_t pos = 0; local 1172 DCHECK_LT(pos, mir->ssa_rep->num_uses); 1173 while (incoming[pos] != lvn->Id()) { 1174 ++pos; 1175 DCHECK_LT(pos, mir->ssa_rep->num_uses); 1177 int s_reg = uses[pos]; 1178 ++pos;
|
/art/patchoat/ |
H A D | patchoat.cc | 422 for (size_t pos = 0; pos < section.Size(); pos += sizeof(ArtField)) { 423 auto* src = reinterpret_cast<ArtField*>(heap_->Begin() + section.Offset() + pos); 433 for (size_t pos = 0; pos < section.Size(); pos += method_size) { 434 auto* src = reinterpret_cast<ArtMethod*>(heap_->Begin() + section.Offset() + pos);
|
/art/tools/ |
H A D | cpplint.py | 1061 def CloseExpression(clean_lines, linenum, pos): 1064 If lines[linenum][pos] points to a '(' or '{' or '[', finds the 1065 linenum/pos that correspond to the closing of the expression. 1070 pos: A position on the line. 1073 A tuple (line, linenum, pos) pointer *past* the closing brace, or 1080 startchar = line[pos] 1088 end_pos = FindEndOfExpressionInLine(line, pos, 0, startchar, endchar) 1091 tail = line[pos:] 2615 pos = line.find('else if') 2616 pos [all...] |
/art/runtime/gc/allocator/ |
H A D | rosalloc.cc | 804 std::set<Run*>::iterator pos = non_full_runs->find(run); local 805 if (pos != non_full_runs->end()) { 806 non_full_runs->erase(pos); 828 auto pos = non_full_runs->find(run); local 829 if (pos == non_full_runs->end()) { 1292 std::unordered_set<Run*, hash_run, eq_run>::iterator pos = full_runs->find(run); local 1293 DCHECK(pos != full_runs->end()); 1294 full_runs->erase(pos);
|
/art/compiler/linker/arm64/ |
H A D | relative_patcher_arm64_test.cc | 196 void InsertInsn(std::vector<uint8_t>* code, size_t pos, uint32_t insn) { argument 197 CHECK_LE(pos, code->size()); 203 code->insert(code->begin() + pos, insn_code, insn_code + sizeof(insn_code));
|