Searched defs:last (Results 1 - 10 of 10) sorted by relevance

/art/runtime/base/
H A Diteration_range.h25 // range [first, last) defined by two iterators.
35 IterationRange(iterator first, iterator last) : first_(first), last_(last) { } argument
H A Dstringpiece.cc74 const char* last = ptr_ + std::min(ulen - s.length_, pos) + s.length_; local
75 const char* result = std::find_end(ptr_, last, s.ptr_, s.ptr_ + s.length_);
76 return result != last ? result - ptr_ : npos;
H A Darena_allocator.cc226 Arena* last = first; local
227 while (last->next_ != nullptr) {
228 last = last->next_;
232 last->next_ = free_arenas_;
/art/runtime/
H A Dmonitor_pool.cc71 Monitor* last = reinterpret_cast<Monitor*>(reinterpret_cast<uintptr_t>(chunk) + local
73 last->next_free_ = nullptr;
75 last->monitor_id_ = OffsetToMonitorId((num_chunks_ - 1) * kChunkSize +
78 Monitor* before = reinterpret_cast<Monitor*>(reinterpret_cast<uintptr_t>(last) -
80 before->next_free_ = last;
81 // Derive monitor_id from last.
82 before->monitor_id_ = OffsetToMonitorId(MonitorIdToOffset(last->monitor_id_) -
85 last = before;
87 DCHECK(last == reinterpret_cast<Monitor*>(chunk));
88 first_free_ = last;
[all...]
H A Dmem_map_test.cc115 uintptr_t last = 0; local
118 EXPECT_NE(last, random_start);
119 last = random_start;
/art/runtime/jdwp/
H A Djdwp_main.cc599 * Return the time, in milliseconds, since the last debugger activity.
610 int64_t last = last_activity_time_ms_.LoadSequentiallyConsistent(); local
613 if (last == 0) {
614 VLOG(jdwp) << "+++ last=busy";
620 CHECK_GE(now, last);
622 VLOG(jdwp) << "+++ debugger interval=" << (now - last);
623 return now - last;
/art/compiler/
H A Dcompiled_method.h121 SrcMap(InputIt first, InputIt last, const Allocator& alloc) argument
122 : std::vector<SrcMapElem, Allocator>(first, last, alloc) {}
/art/compiler/optimizing/
H A Dnodes.cc1020 // a loop header is removed last, a requirement for correct loop information
1029 // If this was the last back edge of the loop, we deliberately leave the
1232 HInstruction* last = body->GetLastInstruction(); local
1238 if (last->IsReturn()) {
1239 invoke->ReplaceWith(last->InputAt(0));
1241 DCHECK(last->IsReturnVoid());
1244 invoke->GetBlock()->RemoveInstruction(last);
1265 HInstruction* last = predecessor->GetLastInstruction(); local
1267 return_value = last->InputAt(0);
1270 predecessor->RemoveInstruction(last);
1280 HInstruction* last = predecessor->GetLastInstruction(); local
[all...]
H A Dregister_allocator.cc151 // Iterate post-order, to ensure the list is sorted, and the last added interval
718 // Take the last interval of the input. It is the location of that interval
722 // TODO: Handle non-split intervals last in the work list.
825 // Pick the register pair that is used the last.
850 // Pick the register that is used the last.
902 // Find the register that is used the last, and spill the interval
1003 // If the first use of that instruction is after the last use of the found
1092 // Ensure the slow path interval is the last to be processed at its location: we want the
1422 HInstruction* last = block->GetLastInstruction(); local
1427 DCHECK(!last
[all...]
/art/compiler/dex/
H A Dmir_graph.cc199 // Similarly, prev will be the last instruction of the "top" block
723 1 /* Fall-through on last insn; dead or punt to interpreter. */);
1091 // Insert it after the last MIR.
1096 // Insert it after the last MIR.
1135 MIR* last = last_list_mir->next; local
1136 for (MIR* mir = first_list_mir; mir != last; mir = mir->next) {
2371 // the last SSA number of the same dalvik register. At the end, if it is different than ssa_reg,

Completed in 185 milliseconds