Searched refs:last (Results 1 - 17 of 17) sorted by relevance

/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(current_chunk_list_index_* (kMaxListSize * 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.cc130 uintptr_t last = 0; local
133 EXPECT_NE(last, random_start);
134 last = random_start;
/art/compiler/utils/
H A Dintrusive_forward_list.h138 IntrusiveForwardList(InputIterator first, InputIterator last) : IntrusiveForwardList() { argument
139 insert_after(before_begin(), first, last); local
173 void assign(InputIterator first, InputIterator last) { argument
174 IntrusiveForwardList tmp(first, last);
191 iterator insert_after(const_iterator position, InputIterator first, InputIterator last) { argument
192 while (first != last) {
198 const_iterator last = position; local
199 std::advance(last, 2);
200 return erase_after(position, last);
202 iterator erase_after(const_iterator position, const_iterator last) { argument
231 const_iterator last = i; local
240 splice_after(const_iterator position, IntrusiveForwardList& src, const_iterator first, const_iterator last) argument
269 splice_after(const_iterator position, IntrusiveForwardList&& src, const_iterator first, const_iterator last) argument
[all...]
H A Dassembler.h311 // Override the last delayed PC. The new PC can be out of order.
340 void AppendRawData(const std::vector<uint8_t>& raw_data, size_t first, size_t last) { argument
342 DCHECK_LE(first, last);
343 DCHECK_LE(last, raw_data.size());
344 opcodes_.insert(opcodes_.end(), raw_data.begin() + first, raw_data.begin() + last);
/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 Ddchecked_vector.h72 InputIterator last,
74 : Base(first, last, alloc) { }
161 iterator insert(const_iterator position, InputIterator first, InputIterator last) { argument
163 return Base::insert(position, first, last);
179 iterator erase(const_iterator first, const_iterator last) {
181 DCHECK(first <= last && last <= cend());
182 return Base::erase(first, last);
71 dchecked_vector(InputIterator first, InputIterator last, const allocator_type& alloc = allocator_type()) 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.cc276 Arena* last = first; local
277 while (last->next_ != nullptr) {
278 last = last->next_;
282 last->next_ = free_arenas_;
/art/compiler/optimizing/
H A Dconstant_folding_test.cc765 HInstruction* last; local
766 block->AddInstruction(last = new (&allocator_) HAbove(zero, parameter));
767 block->AddInstruction(new (&allocator_) HSelect(last, parameter, parameter, 0));
768 block->AddInstruction(last = new (&allocator_) HAbove(parameter, zero));
769 block->AddInstruction(new (&allocator_) HSelect(last, parameter, parameter, 0));
770 block->AddInstruction(last = new (&allocator_) HAboveOrEqual(zero, parameter));
771 block->AddInstruction(new (&allocator_) HSelect(last, parameter, parameter, 0));
772 block->AddInstruction(last = new (&allocator_) HAboveOrEqual(parameter, zero));
773 block->AddInstruction(new (&allocator_) HSelect(last, parameter, parameter, 0));
774 block->AddInstruction(last
[all...]
H A Dnodes.cc1704 // a loop header is removed last, a requirement for correct loop information
1829 // If this was the last back edge of the loop, we deliberately leave the
2029 HInstruction* last = body->GetLastInstruction(); local
2036 if (last->IsReturn()) {
2037 return_value = last->InputAt(0);
2039 DCHECK(last->IsReturnVoid());
2042 invoke->GetBlock()->RemoveInstruction(last);
2108 HInstruction* last = predecessor->GetLastInstruction(); local
2110 return_value = last->InputAt(0);
2112 predecessor->AddInstruction(new (allocator) HGoto(last
2122 HInstruction* last = predecessor->GetLastInstruction(); local
[all...]
H A Dinduction_var_analysis.h153 InductionInfo* RotatePeriodicInduction(InductionInfo* induction, InductionInfo* last);
H A Dregister_allocator.cc169 // Iterate post-order, to ensure the list is sorted, and the last added interval
757 // Take the last interval of the input. It is the location of that interval
761 // TODO: Handle non-split intervals last in the work list.
865 // Pick the register pair that is used the last.
930 // Pick the register that is used the last.
986 // Find the register that is used the last, and spill the interval
1102 // If the first use of that instruction is after the last use of the found
1182 // Ensure the slow path interval is the last to be processed at its location: we want the
1534 HInstruction* last = block->GetLastInstruction(); local
1539 DCHECK(!last
[all...]
H A Dinduction_var_analysis.cc327 InductionInfo* last) {
334 return CreateInduction(kPeriodic, induction, last, type_);
337 kPeriodic, induction->op_a, RotatePeriodicInduction(induction->op_b, last), type_);
325 RotatePeriodicInduction( InductionInfo* induction, InductionInfo* last) argument
/art/runtime/jdwp/
H A Djdwp_main.cc601 * Return the time, in milliseconds, since the last debugger activity.
612 int64_t last = last_activity_time_ms_.LoadSequentiallyConsistent(); local
615 if (last == 0) {
616 VLOG(jdwp) << "+++ last=busy";
622 CHECK_GE(now, last);
624 VLOG(jdwp) << "+++ debugger interval=" << (now - last);
625 return now - last;
/art/compiler/
H A Dcompiled_method.h126 SrcMap(InputIt first, InputIt last, const Allocator& alloc) argument
127 : std::vector<SrcMapElem, Allocator>(first, last, alloc) {}
/art/tools/dexfuzz/src/dexfuzz/program/mutators/
H A DArithOpChanger.java163 Opcode last = opcodeList.get(opcodeList.size() - 1);
164 if (Opcode.isBetween(opcode, first, last)) {
/art/oatdump/
H A Doatdump.cc552 // If the last thing in the file is code for a method, there won't be an offset for the "next"
1145 StackMap last = code_info_.GetStackMapAt(0u, encoding_); local
1148 if (last.GetNativePcOffset(encoding_.stack_map_encoding) >
1153 last = current;

Completed in 420 milliseconds