Searched defs:next (Results 1 - 23 of 23) sorted by relevance

/art/compiler/optimizing/
H A Dssa_phi_elimination.cc61 HInstruction* next = nullptr; local
63 next = current->GetNext();
67 current = next;
H A Dssa_liveness_analysis.h55 LiveRange(size_t start, size_t end, LiveRange* next) : start_(start), end_(end), next_(next) { argument
96 UsePosition* next)
101 next_(next) {
103 DCHECK(next_ == nullptr || next->GetPosition() >= GetPosition());
365 // Move to next range.
92 UsePosition(HInstruction* user, size_t input_index, bool is_environment, size_t position, UsePosition* next) argument
/art/compiler/dex/
H A Dpost_opt_passes.cc62 MIR* next = mir->next; local
70 mir = next;
H A Dvreg_analysis.cc130 * does not generate this pattern (at least recently). Further, in the next revision of
160 int next = 0; local
163 changed |= SetCore(uses[next]);
166 changed |= SetRef(uses[next]);
169 reg_location_[uses[next]].wide = true;
170 reg_location_[uses[next + 1]].wide = true;
171 reg_location_[uses[next + 1]].high_word = true;
172 DCHECK_EQ(SRegToVReg(uses[next])+1,
173 SRegToVReg(uses[next + 1]));
174 next
[all...]
H A Dmir_graph.cc163 insn = insn->next;
217 prev->next = nullptr;
239 p = p->next;
823 * The next instruction could be the target of a previously parsed
914 for (mir = bb->first_mir_insn; mir; mir = mir->next) {
926 mir->next ? " | " : " ");
933 mir->next ? " | " : " ");
944 mir->next ? " | " : " ");
1064 last_list_mir->next = nullptr;
1066 MIR* after_list = insert_after->next;
1109 MIR* next = current->next; local
[all...]
H A Dmir_graph.h352 MIR* next; member in struct:art::MIR
372 next(nullptr), ssa_rep(nullptr) {
464 * @brief Used to obtain the next MIR that follows unconditionally.
/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();
H A Delf_file.cc1379 // Creates a new tag and moves data pointer up to the start of the next one.
1506 // Moves to the next DIE. Returns false if at last entry.
1508 bool next() { function in class:art::DebugInfoIterator
1567 } while (iter->next());
H A Dthread.h456 void SetWaitNext(Thread* next) { argument
457 tlsPtr_.wait_next = next;
798 // The next time a suspend check is done, it will load from the value at this address
969 // at the next poll.
1077 // The next thread in the wait set this thread is part of or NULL if not waiting.
/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...]
H A Dstub_test.cc662 uint32_t next() { function in class:art::RandGen
734 size_t index = r.next() % kNumberOfLocks;
737 if (!fat[index] && (r.next() % kMoveToFat == 0)) {
756 lock = r.next() % 2 == 0;
1249 int32_t new_offset = 1 + (r.next() % (length - 1));
1251 int32_t new_length = 1 + (rest > 0 ? r.next() % rest : 0);
/art/test/080-oom-throw/src/
H A DMain.java35 InstanceMemEater next; field in class:Main.InstanceMemEater
60 lastMemEater.next = InstanceMemEater.allocate();
61 lastMemEater = lastMemEater.next;
/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/runtime/gc/
H A Dreference_queue.cc75 mirror::Reference* next = head->GetPendingNext(); local
77 list_->SetPendingNext<true>(next);
79 list_->SetPendingNext<false>(next);
/art/runtime/jdwp/
H A Djdwp_event.h93 JdwpEvent* next; member in struct:art::JDWP::JdwpEvent
/art/compiler/utils/
H A Dassembler.h224 SlowPath* next = NULL; local
226 for ( ; cur != NULL ; cur = next) {
228 next = cur->next_;
/art/compiler/dex/quick/
H A Dralloc_util.cc355 int next = *next_temp; local
357 if (next >= num_regs)
358 next = 0;
359 RegisterInfo* info = regs.Get(next);
375 *next_temp = next + 1;
378 next++;
380 next = *next_temp;
383 if (next >= num_regs)
384 next = 0;
385 RegisterInfo* info = regs.Get(next);
[all...]
H A Dmir_to_lir.h172 LIR* next; member in struct:art::LIR
201 #define NEXT_LIR(lir) (lir->next)
/art/compiler/utils/arm/
H A Dassembler_arm32.cc1211 int32_t next = buffer_.Load<int32_t>(position); local
1212 int32_t encoded = Arm32Assembler::EncodeBranchOffset(bound_pc - position, next);
1214 label->position_ = Arm32Assembler::DecodeBranchOffset(next);
H A Dassembler_thumb2.cc2094 uint16_t next = buffer_.Load<uint16_t>(branch_location); // Get next in chain. local
2127 label->position_ = next; // Move to next.
/art/compiler/utils/mips/
H A Dassembler_mips.cc153 int32_t next = buffer_.Load<int32_t>(position); local
155 int32_t encoded = MipsAssembler::EncodeBranchOffset(offset, next, is_jump);
157 label->position_ = MipsAssembler::DecodeBranchOffset(next, is_jump);
/art/compiler/utils/x86/
H A Dassembler_x86.cc1316 int next = buffer_.Load<int32_t>(position); local
1318 label->position_ = next;
/art/compiler/utils/x86_64/
H A Dassembler_x86_64.cc1512 int next = buffer_.Load<int32_t>(position); local
1514 label->position_ = next;

Completed in 433 milliseconds