| /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()
|
| /art/libartbase/base/ |
| D | intrusive_forward_list.h | 149 IntrusiveForwardList(InputIterator first, InputIterator last) : IntrusiveForwardList() { in IntrusiveForwardList() argument
150 insert_after(before_begin(), first, last); in IntrusiveForwardList()
184 void assign(InputIterator first, InputIterator last) { in assign() argument
185 IntrusiveForwardList tmp(first, last); in assign()
202 iterator insert_after(const_iterator position, InputIterator first, InputIterator last) { in insert_after() argument
203 while (first != last) { in insert_after()
209 const_iterator last = position; in erase_after() local
210 std::advance(last, 2); in erase_after()
211 return erase_after(position, last); in erase_after()
213 iterator erase_after(const_iterator position, const_iterator last) { in erase_after() argument
[all …]
|
| D | malloc_arena_pool.cc | 152 Arena* last = first; in FreeArenaChain() local
153 while (last->next_ != nullptr) { in FreeArenaChain()
154 last = last->next_; in FreeArenaChain()
157 last->next_ = free_arenas_; in FreeArenaChain()
|
| 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 | iteration_range.h | 36 IterationRange(iterator first, iterator last) : first_(first), last_(last) { } in IterationRange() argument
|
| D | utils.cc | 255 Str* last = out_result + len; in Split() local
261 if (out_result == last) { in Split()
|
| /art/compiler/optimizing/ |
| D | constant_folding_test.cc | 756 HInstruction* last; in TEST_F() local
757 block->AddInstruction(last = new (GetAllocator()) HAbove(zero, parameter)); in TEST_F()
758 block->AddInstruction(new (GetAllocator()) HSelect(last, parameter, parameter, 0)); in TEST_F()
759 block->AddInstruction(last = new (GetAllocator()) HAbove(parameter, zero)); in TEST_F()
760 block->AddInstruction(new (GetAllocator()) HSelect(last, parameter, parameter, 0)); in TEST_F()
761 block->AddInstruction(last = new (GetAllocator()) HAboveOrEqual(zero, parameter)); in TEST_F()
762 block->AddInstruction(new (GetAllocator()) HSelect(last, parameter, parameter, 0)); in TEST_F()
763 block->AddInstruction(last = new (GetAllocator()) HAboveOrEqual(parameter, zero)); in TEST_F()
764 block->AddInstruction(new (GetAllocator()) HSelect(last, parameter, parameter, 0)); in TEST_F()
765 block->AddInstruction(last = new (GetAllocator()) HBelow(zero, parameter)); in TEST_F()
[all …]
|
| D | dead_code_elimination.cc | 244 HInstruction* last = block->GetLastInstruction(); in SimplifyAlwaysThrows() local
247 first->GetNext() == last && in SimplifyAlwaysThrows()
248 last->IsGoto() && in SimplifyAlwaysThrows()
326 HInstruction* last = block->GetLastInstruction(); in SimplifyIfs() local
329 last->IsIf() && in SimplifyIfs()
332 bool has_only_phi_and_if = (last == first) && (last->InputAt(0) == block->GetFirstPhi()); in SimplifyIfs()
337 (first->GetNext() == last) && in SimplifyIfs()
338 (last->InputAt(0) == first) && in SimplifyIfs()
371 successor_to_update = last->AsIf()->IfTrueSuccessor(); in SimplifyIfs()
375 successor_to_update = last->AsIf()->IfFalseSuccessor(); in SimplifyIfs()
|
| D | induction_var_range_test.cc | 788 HInstruction* last = range_.GenerateLastValue(phi, graph_, loop_preheader_); in TEST_F() local
789 ASSERT_TRUE(last->IsAdd()); in TEST_F()
790 ExpectInt(1000, last->InputAt(0)); in TEST_F()
791 ExpectInt(0, last->InputAt(1)); in TEST_F()
840 HInstruction* last = range_.GenerateLastValue(phi, graph_, loop_preheader_); in TEST_F() local
841 ASSERT_TRUE(last->IsSub()); in TEST_F()
842 ExpectInt(1000, last->InputAt(0)); in TEST_F()
843 ASSERT_TRUE(last->InputAt(1)->IsNeg()); in TEST_F()
844 last = last->InputAt(1)->InputAt(0); in TEST_F()
845 ASSERT_TRUE(last->IsSub()); in TEST_F()
[all …]
|
| D | code_sinking.cc | 37 HInstruction* last = exit_predecessor->GetLastInstruction(); in Run() local
39 if (!last->IsReturn() && !last->IsReturnVoid()) { in Run()
|
| D | register_allocation_resolver.cc | 635 HInstruction* last = block->GetLastInstruction(); in InsertParallelMoveAtExitOf() local
640 DCHECK(!last->IsIf() && !last->IsPackedSwitch()); in InsertParallelMoveAtExitOf()
641 HInstruction* previous = last->GetPrevious(); in InsertParallelMoveAtExitOf()
645 size_t position = last->GetLifetimePosition(); in InsertParallelMoveAtExitOf()
650 block->InsertInstructionBefore(move, last); in InsertParallelMoveAtExitOf()
|
| D | execution_subgraph.cc | 146 const HBasicBlock* last = graph_->GetBlocks()[current_path.back()]; in Prune() local
149 cur_block = last; in Prune()
|
| D | ssa_liveness_analysis.h | 199 inline Iterator FindUseAtOrAfterPosition(Iterator first, Iterator last, size_t position) { in FindUseAtOrAfterPosition() argument
205 first, last, [position](const value_type& use) { return use.GetPosition() >= position; }); in FindUseAtOrAfterPosition()
219 Iterator last, in FindMatchingUseRange() argument
222 Iterator begin = FindUseAtOrAfterPosition(first, last, position_begin); in FindMatchingUseRange()
223 Iterator end = FindUseAtOrAfterPosition(begin, last, position_end); in FindMatchingUseRange()
|
| /art/runtime/base/ |
| D | mem_map_arena_pool.cc | 155 Arena* last = first; in FreeArenaChain() local
156 while (last->next_ != nullptr) { in FreeArenaChain()
157 last = last->next_; in FreeArenaChain()
160 last->next_ = free_arenas_; in FreeArenaChain()
|
| /art/test/048-reflect-v8/ |
| D | expected-stdout.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/compiler/utils/ |
| 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/libdexfile/dex/ |
| D | primitive_test.cc | 28 int last = static_cast<int>(Primitive::Type::kPrimLast); in CheckPrimitiveTypeWidensTo() local
29 for (int i = 0; i <= last; ++i) { in CheckPrimitiveTypeWidensTo()
|
| /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-stdout.txt | 126 CORRECT big sparse / last
|
| /art/runtime/native/ |
| D | java_lang_StringFactory.cc | 173 int last = offset + byte_count; in StringFactory_newStringFromUtf8Bytes() local
181 while (idx < last) { in StringFactory_newStringFromUtf8Bytes()
|
| /art/tools/ahat/src/main/com/android/ahat/dominators/ |
| D | Dominators.java | 201 public long last() { in last() method in Dominators.IdSet
346 long seenid = dstS.inRefIds.last(); in computeDominators()
|
| /art/build/apex/ |
| D | art_apex_test.py | 833 def get_last_vertical(last): argument
834 return '└── ' if last else '├── '
850 last = self.get_last_vertical(i == len(key_list) - 1)
854 print('%s%s[ n/a ] %s' % (prev, last, val.name))
856 print('%s%s[%11d] %s' % (prev, last, val.size, val.name))
858 print('%s%s%s' % (prev, last, val.name))
|
| /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()
|