Searched refs:next (Results 1 - 25 of 49) sorted by relevance

12

/art/runtime/arch/
H A Dmemcmp16_test.cc24 uint32_t next() { function in class:RandGen
53 size_t type = r.next() % range_of_tests;
62 count1 = (r.next() % max_length) + min_length;
63 count2 = (r.next() % max_length) + min_length;
67 count1 = (r.next() % max_length) + min_length;
73 count2 = (r.next() % max_length) + min_length;
102 bool fill_same = r.next() % 1 == 1;
106 s1[i] = static_cast<uint16_t>(r.next() & 0xFFFF);
110 s1[i] = static_cast<uint16_t>(r.next() & 0xFFFF);
113 s2[i] = static_cast<uint16_t>(r.next()
[all...]
/art/compiler/dex/
H A Dpost_opt_passes.cc33 MIR* next = mir->next; local
41 mir = next;
H A Dmir_graph.cc192 insn = insn->next;
254 prev->next = nullptr;
275 p = p->next;
326 p = p->next;
864 * The next instruction could be the target of a previously parsed
1001 for (mir = bb->first_mir_insn; mir; mir = mir->next) {
1016 mir->next ? " | " : " ");
1124 last_list_mir->next = nullptr;
1126 MIR* after_list = insert_after->next;
1127 insert_after->next
1169 MIR* next = current->next; local
[all...]
H A Dtype_inference.cc426 mir = mir->next) {
458 for (; mir != main_mirs_end; mir = mir->next) {
520 DCHECK(mir->next == nullptr);
544 * does not generate this pattern (at least recently). Further, in the next revision of
675 for (MIR* mir = bb->first_mir_insn; mir != nullptr; mir = mir->next) {
726 for (MIR* mir = bb->first_mir_insn; mir != nullptr; mir = mir->next) {
816 for (size_t next = 0u; next != num_uses; ++next) {
817 int32_t input_mod_s_reg = ModifiedSReg(uses[next]);
844 size_t next = 0u; local
1000 size_t next = 0; local
[all...]
H A Dmir_optimization.cc61 for (mir = bb->first_mir_insn; mir != nullptr; mir = mir->next) {
119 /* Advance to next strictly dominated MIR node in an extended basic block */
123 mir = mir->next;
139 * To be used at an invoke mir. If the logically next mir node represents
188 for (MIR* mir = bb->first_mir_insn; mir != nullptr; mir = mir->next) {
488 for (MIR* mir = bb->first_mir_insn; mir != nullptr; mir = mir->next) {
547 if (mir->next != nullptr) {
548 MIR* mir_next = mir->next;
549 // Make sure result of cmp is used by next insn and nowhere else
627 (tk->first_mir_insn->next
[all...]
H A Dmir_analysis.cc1002 for (MIR* mir = tbb->first_mir_insn; mir != nullptr; mir = mir->next) {
1222 for (MIR* mir = bb->first_mir_insn; mir != nullptr; mir = mir->next) {
1363 for (MIR* mir = bb->first_mir_insn; mir != nullptr; mir = mir->next) {
H A Dmir_dataflow.cc998 for (mir = bb->first_mir_insn; mir != nullptr; mir = mir->next) {
1211 for (MIR* mir = bb->first_mir_insn; mir != nullptr; mir = mir->next) {
1402 for (MIR* mir = bb->first_mir_insn; (mir != nullptr); mir = mir->next) {
/art/compiler/optimizing/
H A Dssa_builder.cc214 HPhi* next = phi->GetNextEquivalentPhiWithSameType(); local
215 if (next != nullptr) {
218 if (next->IsLive()) {
219 phi->ReplaceWith(next);
221 next->ReplaceWith(phi);
223 DCHECK(next->GetNextEquivalentPhiWithSameType() == nullptr)
304 HInstruction* next = phi->GetNext(); local
305 if (!IsPhiEquivalentOf(next, phi)) continue;
306 if (next->AsPhi()->IsDead()) {
308 next
473 HInstruction* next = phi->GetNext(); local
[all...]
H A Dgvn.cc148 Node(HInstruction* instruction, size_t hash_code, Node* next) argument
149 : instruction_(instruction), hash_code_(hash_code), next_(next) {}
237 Node* next = node->GetNext(); local
240 buckets_[i] = next;
242 previous->SetNext(next);
247 node = next;
347 // Therefore, there is no need to propagate the value set to the next block.
380 // Save the next instruction in case `current` is removed from the graph.
381 HInstruction* next = current->GetNext(); local
400 current = next;
[all...]
H A Dssa_phi_elimination.cc66 HInstruction* next = nullptr; local
70 next = current->GetNext();
95 current = next;
H A Dssa_liveness_analysis.h60 LiveRange(size_t start, size_t end, LiveRange* next) : start_(start), end_(end), next_(next) { argument
110 UsePosition* next)
115 next_(next) {
120 DCHECK(next_ == nullptr || next->GetPosition() >= GetPosition());
128 void SetNext(UsePosition* next) { next_ = next; } argument
176 void SetNext(SafepointPosition* next) { argument
177 next_ = next;
597 // Move to next rang
106 UsePosition(HInstruction* user, HEnvironment* environment, size_t input_index, size_t position, UsePosition* next) argument
[all...]
H A Dinliner.cc56 HInstruction* next = instruction->GetNext(); local
71 instruction = next;
H A Dnodes.cc607 HInstruction* next = GetNext(); local
608 while (next != nullptr && next->IsParallelMove()) {
609 next = next->GetNext();
611 return next;
1352 // Update the next instruction id of the outer graph, so that instructions
/art/test/080-oom-throw/src/
H A DMain.java39 InstanceMemEater next; field in class:Main.InstanceMemEater
65 lastMemEater.next = InstanceMemEater.allocate();
66 lastMemEater = lastMemEater.next;
/art/runtime/
H A Dmonitor_pool_test.cc31 uint32_t next() { function in class:art::RandGen
70 alloc = r.next() % 2 == 0;
80 size_t index = r.next() % monitors.size();
112 size_t index = r.next() % monitors.size();
/art/runtime/gc/accounting/
H A Dspace_bitmap_test.cc105 uint32_t next() { function in class:art::gc::accounting::RandGen
127 size_t offset = RoundDown(r.next() % heap_capacity, kAlignment);
128 bool set = r.next() % 2 == 1;
141 size_t offset = RoundDown(r.next() % heap_capacity, kAlignment);
143 size_t end = offset + RoundDown(r.next() % (remain + 1), kAlignment);
/art/compiler/dwarf/
H A Ddwarf_test.h46 bool next; member in struct:art::dwarf::DwarfTest::ExpectedLine
52 // If next is true, it must be the next line. Otherwise lines are skipped.
53 void Check(const char* substr, bool next, const char* at_file, int at_line) { argument
54 expected_lines_.push_back(ExpectedLine {substr, next, at_file, at_line});
138 } else if (expected_line.next) {
/art/tools/
H A Danalyze-init-failures.py51 raw_line = it.next()
59 # The error line should be next.
60 raw_line = it.next()
70 raw_line = it.next()
91 raw_line = it.next()
/art/test/444-checker-nce/src/
H A DMain.java259 private ListElement next; field in class:ListElement
272 xTail = xTail.next;
273 yTail = yTail.next;
/art/compiler/dex/quick/
H A Dcodegen_util.cc102 if (after->next == nullptr) {
116 first_lir_insn_ = lir->next;
117 if (lir->next != nullptr) {
118 lir->next->prev = nullptr;
120 DCHECK(lir->next == nullptr);
126 lir->prev->next = nullptr;
127 } else if ((lir->prev != nullptr) && (lir->next != nullptr)) {
128 lir->prev->next = lir->next;
129 lir->next
[all...]
H A Dralloc_util.cc339 int next = *next_temp; local
341 if (next >= num_regs) {
342 next = 0;
344 RegisterInfo* info = regs[next];
360 *next_temp = next + 1;
363 next++;
365 next = *next_temp;
368 if (next >= num_regs) {
369 next = 0;
371 RegisterInfo* info = regs[next];
[all...]
/art/runtime/jdwp/
H A Djdwp_event.h93 JdwpEvent* next; member in struct:art::JDWP::JdwpEvent
H A Djdwp_event.cc189 CHECK(pEvent->next == nullptr);
239 pEvent->next = event_list_;
264 event_list_ = pEvent->next;
266 pEvent->prev->next = pEvent->next;
269 if (pEvent->next != nullptr) {
270 pEvent->next->prev = pEvent->prev;
271 pEvent->next = nullptr;
321 for (JdwpEvent* pEvent = event_list_; pEvent != nullptr; pEvent = pEvent->next) {
350 JdwpEvent* pNextEvent = pEvent->next;
[all...]
/art/runtime/gc/
H A Dreference_queue.cc76 mirror::Reference* next = head->GetPendingNext(); local
78 list_->SetPendingNext<true>(next);
80 list_->SetPendingNext<false>(next);
/art/compiler/utils/
H A Dassembler.h230 SlowPath* next = nullptr; local
232 for ( ; cur != nullptr ; cur = next) {
234 next = cur->next_;

Completed in 385 milliseconds

12