/art/runtime/arch/ |
D | memcmp16_test.cc | 24 uint32_t next() { in next() function in RandGen 53 size_t type = r.next() % range_of_tests; in CheckSeparate() 62 count1 = (r.next() % max_length) + min_length; in CheckSeparate() 63 count2 = (r.next() % max_length) + min_length; in CheckSeparate() 67 count1 = (r.next() % max_length) + min_length; in CheckSeparate() 73 count2 = (r.next() % max_length) + min_length; in CheckSeparate() 102 bool fill_same = r.next() % 1 == 1; in CheckSeparate() 106 s1[i] = static_cast<uint16_t>(r.next() & 0xFFFF); in CheckSeparate() 110 s1[i] = static_cast<uint16_t>(r.next() & 0xFFFF); in CheckSeparate() 113 s2[i] = static_cast<uint16_t>(r.next() & 0xFFFF); in CheckSeparate() [all …]
|
/art/compiler/optimizing/ |
D | ssa_builder.cc | 214 HPhi* next = phi->GetNextEquivalentPhiWithSameType(); in EquivalentPhisCleanup() local 215 if (next != nullptr) { in EquivalentPhisCleanup() 218 if (next->IsLive()) { in EquivalentPhisCleanup() 219 phi->ReplaceWith(next); in EquivalentPhisCleanup() 221 next->ReplaceWith(phi); in EquivalentPhisCleanup() 223 DCHECK(next->GetNextEquivalentPhiWithSameType() == nullptr) in EquivalentPhisCleanup() 304 HInstruction* next = phi->GetNext(); in BuildSsa() local 305 if (!IsPhiEquivalentOf(next, phi)) continue; in BuildSsa() 306 if (next->AsPhi()->IsDead()) { in BuildSsa() 308 next = next->GetNext(); in BuildSsa() [all …]
|
D | gvn.cc | 148 Node(HInstruction* instruction, size_t hash_code, Node* next) in Node() argument 149 : instruction_(instruction), hash_code_(hash_code), next_(next) {} in Node() 237 Node* next = node->GetNext(); in DeleteAllImpureWhich() local 240 buckets_[i] = next; in DeleteAllImpureWhich() 242 previous->SetNext(next); in DeleteAllImpureWhich() 247 node = next; in DeleteAllImpureWhich() 381 HInstruction* next = current->GetNext(); in VisitBasicBlock() local 400 current = next; in VisitBasicBlock()
|
D | ssa_phi_elimination.cc | 66 HInstruction* next = nullptr; in EliminateDeadPhis() local 70 next = current->GetNext(); in EliminateDeadPhis() 95 current = next; in EliminateDeadPhis()
|
D | ssa_liveness_analysis.h | 60 LiveRange(size_t start, size_t end, LiveRange* next) : start_(start), end_(end), next_(next) { in LiveRange() argument 110 UsePosition* next) in UsePosition() argument 115 next_(next) { in UsePosition() 120 DCHECK(next_ == nullptr || next->GetPosition() >= GetPosition()); in UsePosition() 128 void SetNext(UsePosition* next) { next_ = next; } in SetNext() argument 176 void SetNext(SafepointPosition* next) { in SetNext() argument 177 next_ = next; in SetNext()
|
D | inliner.cc | 56 HInstruction* next = instruction->GetNext(); in Run() local 71 instruction = next; in Run()
|
D | nodes.cc | 607 HInstruction* next = GetNext(); in GetNextDisregardingMoves() local 608 while (next != nullptr && next->IsParallelMove()) { in GetNextDisregardingMoves() 609 next = next->GetNext(); in GetNextDisregardingMoves() 611 return next; in GetNextDisregardingMoves()
|
/art/runtime/ |
D | monitor_pool_test.cc | 31 uint32_t next() { in next() function in art::RandGen 70 alloc = r.next() % 2 == 0; in TEST_F() 80 size_t index = r.next() % monitors.size(); in TEST_F() 112 size_t index = r.next() % monitors.size(); in TEST_F()
|
/art/runtime/gc/accounting/ |
D | space_bitmap_test.cc | 105 uint32_t next() { in next() function in art::gc::accounting::RandGen 127 size_t offset = RoundDown(r.next() % heap_capacity, kAlignment); in RunTest() 128 bool set = r.next() % 2 == 1; in RunTest() 141 size_t offset = RoundDown(r.next() % heap_capacity, kAlignment); in RunTest() 143 size_t end = offset + RoundDown(r.next() % (remain + 1), kAlignment); in RunTest()
|
/art/compiler/dex/ |
D | post_opt_passes.cc | 33 MIR* next = mir->next; in Worker() local 41 mir = next; in Worker()
|
D | type_inference.cc | 426 mir = mir->next) { in Apply() 458 for (; mir != main_mirs_end; mir = mir->next) { in Apply() 520 DCHECK(mir->next == nullptr); in Apply() 675 for (MIR* mir = bb->first_mir_insn; mir != nullptr; mir = mir->next) { in InitializeCheckCastData() 726 for (MIR* mir = bb->first_mir_insn; mir != nullptr; mir = mir->next) { in InitializeSRegs() 816 for (size_t next = 0u; next != num_uses; ++next) { in InitializeSRegs() local 817 int32_t input_mod_s_reg = ModifiedSReg(uses[next]); in InitializeSRegs() 844 size_t next = 0u; in InitializeSRegs() local 847 int32_t param_s_reg = ModifiedSReg(uses[next]); in InitializeSRegs() 848 DCHECK(!param_type.Wide() || uses[next] + 1 == uses[next + 1]); in InitializeSRegs() [all …]
|
D | mir_graph.cc | 192 insn = insn->next; in SplitBlock() 254 prev->next = nullptr; in SplitBlock() 275 p = p->next; in SplitBlock() 326 p = p->next; in FindBlock() 1001 for (mir = bb->first_mir_insn; mir; mir = mir->next) { in DumpCFG() 1016 mir->next ? " | " : " "); in DumpCFG() 1124 last_list_mir->next = nullptr; in InsertMIRListAfter() 1126 MIR* after_list = insert_after->next; in InsertMIRListAfter() 1127 insert_after->next = first_list_mir; in InsertMIRListAfter() 1128 last_list_mir->next = after_list; in InsertMIRListAfter() [all …]
|
D | mir_optimization.cc | 61 for (mir = bb->first_mir_insn; mir != nullptr; mir = mir->next) { in DoConstantPropagation() 123 mir = mir->next; in AdvanceMIR() 188 for (MIR* mir = bb->first_mir_insn; mir != nullptr; mir = mir->next) { in FindPhi() 488 for (MIR* mir = bb->first_mir_insn; mir != nullptr; mir = mir->next) { in BasicBlockOpt() 547 if (mir->next != nullptr) { in BasicBlockOpt() 548 MIR* mir_next = mir->next; in BasicBlockOpt() 627 (tk->first_mir_insn->next == tk->last_mir_insn) && in BasicBlockOpt() 734 for (MIR* mir = bb->first_mir_insn; mir != nullptr; mir = mir->next) { in CountChecks() 936 for (MIR* mir = bb->first_mir_insn; mir != nullptr; mir = mir->next) { in EliminateNullChecksGate() 1005 for (MIR* mir = bb->first_mir_insn; mir != nullptr; mir = mir->next) { in EliminateNullChecks() [all …]
|
D | mir_analysis.cc | 1002 for (MIR* mir = tbb->first_mir_insn; mir != nullptr; mir = mir->next) { in AnalyzeBlock() 1222 for (MIR* mir = bb->first_mir_insn; mir != nullptr; mir = mir->next) { in DoCacheFieldLoweringInfo() 1363 for (MIR* mir = bb->first_mir_insn; mir != nullptr; mir = mir->next) { in DoCacheMethodLoweringInfo()
|
/art/tools/ |
D | analyze-init-failures.py | 51 raw_line = it.next() 60 raw_line = it.next() 70 raw_line = it.next() 91 raw_line = it.next()
|
/art/test/080-oom-throw/src/ |
D | Main.java | 39 InstanceMemEater next; field in Main.InstanceMemEater 65 lastMemEater.next = InstanceMemEater.allocate(); in triggerInstanceOOM() 66 lastMemEater = lastMemEater.next; in triggerInstanceOOM()
|
/art/compiler/dwarf/ |
D | dwarf_test.h | 46 bool next; member 53 void Check(const char* substr, bool next, const char* at_file, int at_line) { in Check() argument 54 expected_lines_.push_back(ExpectedLine {substr, next, at_file, at_line}); in Check() 138 } else if (expected_line.next) { in CheckObjdumpOutput()
|
/art/compiler/dex/quick/ |
D | codegen_util.cc | 102 if (after->next == nullptr) { in MarkSafepointPCAfter() 116 first_lir_insn_ = lir->next; in UnlinkLIR() 117 if (lir->next != nullptr) { in UnlinkLIR() 118 lir->next->prev = nullptr; in UnlinkLIR() 120 DCHECK(lir->next == nullptr); in UnlinkLIR() 126 lir->prev->next = nullptr; in UnlinkLIR() 127 } else if ((lir->prev != nullptr) && (lir->next != nullptr)) { in UnlinkLIR() 128 lir->prev->next = lir->next; in UnlinkLIR() 129 lir->next->prev = lir->prev; in UnlinkLIR() 322 for (LIR* lir = first_lir_insn_; lir != nullptr; lir = lir->next) { in UpdateLIROffsets() [all …]
|
D | ralloc_util.cc | 339 int next = *next_temp; in AllocTempBody() local 341 if (next >= num_regs) { in AllocTempBody() 342 next = 0; in AllocTempBody() 344 RegisterInfo* info = regs[next]; in AllocTempBody() 360 *next_temp = next + 1; in AllocTempBody() 363 next++; in AllocTempBody() 365 next = *next_temp; in AllocTempBody() 368 if (next >= num_regs) { in AllocTempBody() 369 next = 0; in AllocTempBody() 371 RegisterInfo* info = regs[next]; in AllocTempBody() [all …]
|
/art/test/444-checker-nce/src/ |
D | Main.java | 259 private ListElement next; field in ListElement 272 xTail = xTail.next; in isShorter() 273 yTail = yTail.next; in isShorter()
|
/art/test/504-regression-baseline-entry/ |
D | info.txt | 2 through to the next block.
|
/art/runtime/gc/ |
D | reference_queue.cc | 76 mirror::Reference* next = head->GetPendingNext(); in DequeuePendingReference() local 78 list_->SetPendingNext<true>(next); in DequeuePendingReference() 80 list_->SetPendingNext<false>(next); in DequeuePendingReference()
|
/art/runtime/jdwp/ |
D | jdwp_event.cc | 189 CHECK(pEvent->next == nullptr); in RegisterEvent() 239 pEvent->next = event_list_; in RegisterEvent() 264 event_list_ = pEvent->next; in UnregisterEvent() 266 pEvent->prev->next = pEvent->next; in UnregisterEvent() 269 if (pEvent->next != nullptr) { in UnregisterEvent() 270 pEvent->next->prev = pEvent->prev; in UnregisterEvent() 271 pEvent->next = nullptr; in UnregisterEvent() 321 for (JdwpEvent* pEvent = event_list_; pEvent != nullptr; pEvent = pEvent->next) { in UnregisterEventById() 350 JdwpEvent* pNextEvent = pEvent->next; in UnregisterAll() 384 CHECK(pEvent->next == nullptr); in EventFree() [all …]
|
D | jdwp_event.h | 93 JdwpEvent* next; member
|
/art/compiler/utils/ |
D | assembler.h | 230 SlowPath* next = nullptr; in EmitSlowPaths() local 232 for ( ; cur != nullptr ; cur = next) { in EmitSlowPaths() 234 next = cur->next_; in EmitSlowPaths()
|