| /art/runtime/ |
| D | monitor_pool.cc | 71 Monitor* last = reinterpret_cast<Monitor*>(reinterpret_cast<uintptr_t>(chunk) + in AllocateChunk() local
73 last->next_free_ = nullptr; in AllocateChunk()
75 last->monitor_id_ = OffsetToMonitorId(current_chunk_list_index_* (kMaxListSize * kChunkSize) in AllocateChunk()
78 Monitor* before = reinterpret_cast<Monitor*>(reinterpret_cast<uintptr_t>(last) - in AllocateChunk()
80 before->next_free_ = last; in AllocateChunk()
82 before->monitor_id_ = OffsetToMonitorId(MonitorIdToOffset(last->monitor_id_) - in AllocateChunk()
85 last = before; in AllocateChunk()
87 DCHECK(last == reinterpret_cast<Monitor*>(chunk)); in AllocateChunk()
88 first_free_ = last; in AllocateChunk()
|
| D | mem_map_test.cc | 132 uintptr_t last = 0; in TEST_F() local
135 EXPECT_NE(last, random_start); in TEST_F()
136 last = random_start; in TEST_F()
|
| /art/compiler/utils/ |
| D | intrusive_forward_list.h | 148 IntrusiveForwardList(InputIterator first, InputIterator last) : IntrusiveForwardList() { in IntrusiveForwardList() argument
149 insert_after(before_begin(), first, last); in IntrusiveForwardList()
183 void assign(InputIterator first, InputIterator last) { in assign() argument
184 IntrusiveForwardList tmp(first, last); in assign()
201 iterator insert_after(const_iterator position, InputIterator first, InputIterator last) { in insert_after() argument
202 while (first != last) { in insert_after()
208 const_iterator last = position; in erase_after() local
209 std::advance(last, 2); in erase_after()
210 return erase_after(position, last); in erase_after()
212 iterator erase_after(const_iterator position, const_iterator last) { in erase_after() argument
[all …]
|
| D | assembler.h | 344 void AppendRawData(const std::vector<uint8_t>& raw_data, size_t first, size_t last) { in AppendRawData() argument
346 DCHECK_LE(first, last); in AppendRawData()
347 DCHECK_LE(last, raw_data.size()); in AppendRawData()
348 opcodes_.insert(opcodes_.end(), raw_data.begin() + first, raw_data.begin() + last); in AppendRawData()
|
| /art/compiler/optimizing/ |
| D | constant_folding_test.cc | 765 HInstruction* last; in TEST_F() local
766 block->AddInstruction(last = new (&allocator_) HAbove(zero, parameter)); in TEST_F()
767 block->AddInstruction(new (&allocator_) HSelect(last, parameter, parameter, 0)); in TEST_F()
768 block->AddInstruction(last = new (&allocator_) HAbove(parameter, zero)); in TEST_F()
769 block->AddInstruction(new (&allocator_) HSelect(last, parameter, parameter, 0)); in TEST_F()
770 block->AddInstruction(last = new (&allocator_) HAboveOrEqual(zero, parameter)); in TEST_F()
771 block->AddInstruction(new (&allocator_) HSelect(last, parameter, parameter, 0)); in TEST_F()
772 block->AddInstruction(last = new (&allocator_) HAboveOrEqual(parameter, zero)); in TEST_F()
773 block->AddInstruction(new (&allocator_) HSelect(last, parameter, parameter, 0)); in TEST_F()
774 block->AddInstruction(last = new (&allocator_) HBelow(zero, parameter)); in TEST_F()
[all …]
|
| D | dead_code_elimination.cc | 186 HInstruction* last = block->GetLastInstruction(); in SimplifyIfs() local
189 last->IsIf() && in SimplifyIfs()
192 bool has_only_phi_and_if = (last == first) && (last->InputAt(0) == block->GetFirstPhi()); in SimplifyIfs()
197 (first->GetNext() == last) && in SimplifyIfs()
198 (last->InputAt(0) == first) && in SimplifyIfs()
231 successor_to_update = last->AsIf()->IfTrueSuccessor(); in SimplifyIfs()
235 successor_to_update = last->AsIf()->IfFalseSuccessor(); in SimplifyIfs()
|
| D | induction_var_range_test.cc | 763 HInstruction* last = range_.GenerateLastValue(phi, graph_, loop_preheader_); in TEST_F() local
764 ASSERT_TRUE(last->IsAdd()); in TEST_F()
765 ExpectInt(1000, last->InputAt(0)); in TEST_F()
766 ExpectInt(0, last->InputAt(1)); in TEST_F()
815 HInstruction* last = range_.GenerateLastValue(phi, graph_, loop_preheader_); in TEST_F() local
816 ASSERT_TRUE(last->IsSub()); in TEST_F()
817 ExpectInt(1000, last->InputAt(0)); in TEST_F()
818 ASSERT_TRUE(last->InputAt(1)->IsNeg()); in TEST_F()
819 last = last->InputAt(1)->InputAt(0); in TEST_F()
820 ASSERT_TRUE(last->IsSub()); in TEST_F()
[all …]
|
| D | register_allocation_resolver.cc | 633 HInstruction* last = block->GetLastInstruction(); in InsertParallelMoveAtExitOf() local
638 DCHECK(!last->IsIf() && !last->IsPackedSwitch()); in InsertParallelMoveAtExitOf()
639 HInstruction* previous = last->GetPrevious(); in InsertParallelMoveAtExitOf()
643 size_t position = last->GetLifetimePosition(); in InsertParallelMoveAtExitOf()
648 block->InsertInstructionBefore(move, last); in InsertParallelMoveAtExitOf()
|
| D | nodes.cc | 2178 HInstruction* last = body->GetLastInstruction(); in InlineInto() local
2185 if (last->IsReturn()) { in InlineInto()
2186 return_value = last->InputAt(0); in InlineInto()
2188 DCHECK(last->IsReturnVoid()); in InlineInto()
2191 invoke->GetBlock()->RemoveInstruction(last); in InlineInto()
2260 HInstruction* last = predecessor->GetLastInstruction(); in InlineInto() local
2261 if (last->IsThrow()) { in InlineInto()
2275 if (last->IsReturnVoid()) { in InlineInto()
2279 DCHECK(last->IsReturn()); in InlineInto()
2281 return_value_phi->AddInput(last->InputAt(0)); in InlineInto()
[all …]
|
| D | ssa_liveness_analysis.h | 197 inline Iterator FindUseAtOrAfterPosition(Iterator first, Iterator last, size_t position) { in FindUseAtOrAfterPosition() argument
203 first, last, [position](const value_type& use) { return use.GetPosition() >= position; }); in FindUseAtOrAfterPosition()
217 Iterator last, in FindMatchingUseRange() argument
220 Iterator begin = FindUseAtOrAfterPosition(first, last, position_begin); in FindMatchingUseRange()
221 Iterator end = FindUseAtOrAfterPosition(begin, last, position_end); in FindMatchingUseRange()
|
| D | induction_var_analysis.h | 160 InductionInfo* RotatePeriodicInduction(InductionInfo* induction, InductionInfo* last);
|
| D | induction_var_analysis.cc | 385 InductionInfo* last) { in RotatePeriodicInduction() argument
395 last, in RotatePeriodicInduction()
402 RotatePeriodicInduction(induction->op_b, last), in RotatePeriodicInduction()
|
| D | code_generator_arm_vixl.cc | 183 size_t last, in SaveContiguousSRegisterList() argument
188 DCHECK_LE(first, last); in SaveContiguousSRegisterList()
189 if ((first == last) && (first == 0)) { in SaveContiguousSRegisterList()
199 if (last % 2 == 0) { in SaveContiguousSRegisterList()
201 --last; in SaveContiguousSRegisterList()
204 if (first < last) { in SaveContiguousSRegisterList()
206 DCHECK_EQ((last - first + 1) % 2, 0u); in SaveContiguousSRegisterList()
207 size_t number_of_d_regs = (last - first + 1) / 2; in SaveContiguousSRegisterList()
224 __ Vstr(vixl32::SRegister(last + 1), MemOperand(sp, stack_offset)); in SaveContiguousSRegisterList()
232 size_t last, in RestoreContiguousSRegisterList() argument
[all …]
|
| /art/runtime/base/ |
| D | dchecked_vector.h | 70 InputIterator last,
72 : Base(first, last, alloc) { } in Base() argument
159 iterator insert(const_iterator position, InputIterator first, InputIterator last) { in insert() argument
161 return Base::insert(position, first, last); in insert()
177 iterator erase(const_iterator first, const_iterator last) { in erase() argument
179 DCHECK(first <= last && last <= cend()); in erase()
180 return Base::erase(first, last); in erase()
|
| D | stringpiece.cc | 74 const char* last = ptr_ + std::min(ulen - s.length_, pos) + s.length_; in rfind() local
75 const char* result = std::find_end(ptr_, last, s.ptr_, s.ptr_ + s.length_); in rfind()
76 return result != last ? result - ptr_ : npos; in rfind()
|
| D | iteration_range.h | 35 IterationRange(iterator first, iterator last) : first_(first), last_(last) { } in IterationRange() argument
|
| D | arena_allocator.cc | 362 Arena* last = first; in FreeArenaChain() local
363 while (last->next_ != nullptr) { in FreeArenaChain()
364 last = last->next_; in FreeArenaChain()
368 last->next_ = free_arenas_; in FreeArenaChain()
|
| /art/test/048-reflect-v8/ |
| D | expected.txt | 22 Annotations by type, defined by class User with annotation Calendar: @Calendar(dayOfMonth=last, day…
23 …ss User with annotation Calendars: @Calendars(value=[@Calendar(dayOfMonth=last, dayOfWeek=unspecif…
28 Annotations by type, defined by class UserSub with annotation Calendar: @Calendar(dayOfMonth=last, …
29 …UserSub with annotation Calendars: @Calendars(value=[@Calendar(dayOfMonth=last, dayOfWeek=unspecif…
31 …serSub2 with annotation Calendars: @Calendars(value=[@Calendar(dayOfMonth=last, dayOfWeek=unspecif…
40 …r, annotation interface Calendars: @Calendars(value=[@Calendar(dayOfMonth=last, dayOfWeek=unspecif…
54 …ype, defined by class User with annotation Calendar: @Calendar(dayOfMonth=last, dayOfWeek=unspecif…
55 …ss User with annotation Calendars: @Calendars(value=[@Calendar(dayOfMonth=last, dayOfWeek=unspecif…
71 Annotations by type, defined by method user with annotation Calendar: @Calendar(dayOfMonth=last, da…
72 …od user with annotation Calendars: @Calendars(value=[@Calendar(dayOfMonth=last, dayOfWeek=unspecif…
[all …]
|
| /art/runtime/jdwp/ |
| D | jdwp_main.cc | 619 int64_t last = last_activity_time_ms_.LoadSequentiallyConsistent(); in LastDebuggerActivity() local
622 if (last == 0) { in LastDebuggerActivity()
629 CHECK_GE(now, last); in LastDebuggerActivity()
631 VLOG(jdwp) << "+++ debugger interval=" << (now - last); in LastDebuggerActivity()
632 return now - last; in LastDebuggerActivity()
|
| /art/test/800-smali/smali/ |
| D | b_20224106.smali | 4 # an order abort (the last failure must be hard).
|
| D | b_20843113.smali | 22 move-exception v0 # Overwrite the (last) "this" register. This should be
|
| /art/test/015-switch/ |
| D | expected.txt | 126 CORRECT big sparse / last
|
| /art/test/564-checker-irreducible-loop/smali/ |
| D | IrreducibleLoop.smali | 38 # ArtMethod was a live_in of the last block before the loop, but did not have
|
| /art/tools/dexfuzz/src/dexfuzz/program/mutators/ |
| D | ArithOpChanger.java | 163 Opcode last = opcodeList.get(opcodeList.size() - 1); in getLegalDifferentOpcode() local
164 if (Opcode.isBetween(opcode, first, last)) { in getLegalDifferentOpcode()
|
| /art/tools/runtime_memusage/ |
| D | README | 46 default: only the last pid is processed
|