/art/compiler/optimizing/ |
H A D | ssa_phi_elimination.cc | 96 HInstruction* next = nullptr; local 100 next = current->GetNext(); 120 current = next;
|
H A D | ssa_builder.cc | 67 HPhi* next = phi->GetNextEquivalentPhiWithSameType(); local 68 if (next != nullptr) { 71 if (next->IsLive()) { 72 phi->ReplaceWith(next); 75 next->ReplaceWith(phi); 77 DCHECK(next->GetNextEquivalentPhiWithSameType() == nullptr) 91 HInstruction* next = phi->GetNext(); local 92 if (!phi->IsVRegEquivalentOf(next)) continue; 93 if (next->AsPhi()->IsDead()) { 95 next 281 HInstruction* next = aget->GetNext(); local 434 auto next = current; local 617 HInstruction* next = phi->GetNext(); local [all...] |
H A D | gvn.cc | 191 Node(HInstruction* instruction, size_t hash_code, Node* next) argument 192 : instruction_(instruction), hash_code_(hash_code), next_(next) {} 272 Node* next = node->GetNext(); local 275 buckets_[i] = next; 277 previous->SetNext(next); 282 node = next; 418 // Therefore, there is no need to propagate the value set to the next block. 477 // Save the next instruction in case `current` is removed from the graph. 478 HInstruction* next = current->GetNext(); local 502 current = next; [all...] |
H A D | loop_optimization.h | 57 next(nullptr) {} 62 LoopNode* next; member in struct:art::HLoopOptimization::LoopNode
|
/art/runtime/ |
H A D | monitor_pool_test.cc | 31 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 D | method_handles.h | 86 // // Used to read the next boolean/short/int or float value from the 90 // // Used to the read the next reference value from the source. 93 // // Used to read the next double or long value from the source. 153 const uint32_t next = operands_->GetOperand(operand_index_); local 155 return next; 159 const uint32_t next = operands_->GetOperand(operand_index_); local 161 return next; 166 size_t operand_index_; // the next register operand to read from frame
|
H A D | handle_scope-inl.h | 210 LocalScopeType* next = reinterpret_cast<LocalScopeType*>(current_scope_->GetLink()); local 212 current_scope_ = next;
|
H A D | subtype_check_info.h | 217 SubtypeCheckInfo child = *this; // Copy everything (path, next, of). 230 // Always clear the inherited Parent's next Value, i.e. the child's last path entry. 246 BitStringChar next = GetNext(); local 247 if (next != next.MaximumValue()) { 248 // The parent's "next" value is now the child's latest path element. 249 OverwriteNextValueFromParent(/*inout*/&child, next); 250 // Update self next value, so that future CreateChild calls 252 SetNext(next + 1u); 318 bool MaybeGetNext(/*out*/BitStringChar* next) cons 330 SubtypeCheckInfo(BitString path_to_root, BitStringChar next, bool overflow, size_t depth) argument 372 SetNext(BitStringChar next) argument 379 SetNextUnchecked(BitStringChar next) argument [all...] |
/art/tools/ahat/src/main/com/android/ahat/heapdump/ |
H A D | DominatorReferenceIterator.java | 39 Reference ref = mIter.next(); 48 public AhatInstance next() { method in class:DominatorReferenceIterator 50 AhatInstance next = mNext; 52 return next;
|
H A D | SkipNullsIterator.java | 37 mNext = mIter.next(); 43 public T next() { method in class:SkipNullsIterator 47 T next = mNext; 49 return next;
|
H A D | AhatClassInstance.java | 311 // mFields and mFieldIndex are reset each time we walk up to the next 339 public FieldValue next() { method in class:AhatClassInstance.InstanceFieldIterator 366 FieldValue field = mIter.next(); 376 public Reference next() { method in class:AhatClassInstance.StrongReferenceIterator 380 Reference next = mNext; 382 return next; 403 FieldValue field = mIter.next(); 414 public Reference next() { method in class:AhatClassInstance.WeakReferentReferenceIterator 418 Reference next = mNext; 420 return next; [all...] |
/art/runtime/arch/ |
H A D | memcmp16_test.cc | 25 uint32_t next() { function in class:RandGen 54 size_t type = r.next() % range_of_tests; 63 count1 = (r.next() % max_length) + min_length; 64 count2 = (r.next() % max_length) + min_length; 68 count1 = (r.next() % max_length) + min_length; 74 count2 = (r.next() % max_length) + min_length; 103 bool fill_same = r.next() % 2 == 1; 107 s1[i] = static_cast<uint16_t>(r.next() & 0xFFFF); 111 s1[i] = static_cast<uint16_t>(r.next() & 0xFFFF); 114 s2[i] = static_cast<uint16_t>(r.next() [all...] |
H A D | stub_test.cc | 646 uint32_t next() { function in class:art::RandGen 719 size_t index = r.next() % kNumberOfLocks; 722 if (!fat[index] && (r.next() % kMoveToFat == 0)) { 741 take_lock = r.next() % 2 == 0;
|
/art/test/080-oom-throw/src/ |
H A D | Main.java | 39 InstanceMemEater next; field in class:Main.InstanceMemEater 89 lastMemEater.next = InstanceMemEater.allocate(); 90 lastMemEater = lastMemEater.next;
|
/art/test/1922-owned-monitors-info/ |
H A D | owned_monitors.cc | 44 static bool doCallRunnable(JNIEnv* env, jobject next) { argument 53 env->CallVoidMethod(next, run); 58 JNIEnv* env, jobject thiz, jobject next) { 62 if (doCallRunnable(env, next)) { 71 JNIEnv* env, jobject thiz ATTRIBUTE_UNUSED, jobject mon, jobject next) { 75 if (doCallRunnable(env, next)) { 57 Java_art_Test1922_00024Target_lockThisNative( JNIEnv* env, jobject thiz, jobject next) argument 70 Java_art_Test1922_00024Target_lockNative( JNIEnv* env, jobject thiz ATTRIBUTE_UNUSED, jobject mon, jobject next) argument
|
/art/test/444-checker-nce/src/ |
H A D | Main.java | 247 private ListElement next; field in class:ListElement 260 xTail = xTail.next; 261 yTail = yTail.next;
|
/art/compiler/debug/dwarf/ |
H A D | dwarf_test.h | 48 bool next; member in struct:art::dwarf::DwarfTest::ExpectedLine 54 // If next is true, it must be the next line. Otherwise lines are skipped. 55 void Check(const char* substr, bool next, const char* at_file, int at_line) { argument 56 expected_lines_.push_back(ExpectedLine {substr, next, at_file, at_line}); 130 } else if (expected_line.next) {
|
/art/disassembler/ |
H A D | disassembler_arm.cc | 208 uintptr_t next; local 220 next = reinterpret_cast<uintptr_t>(disasm_->DecodeT32At(ip, end_address)); 223 next = reinterpret_cast<uintptr_t>(disasm_->DecodeA32At(ip)); 228 return next - instr_ptr;
|
/art/runtime/gc/accounting/ |
H A D | space_bitmap_test.cc | 148 uint32_t next() { function in class:art::gc::accounting::RandGen 169 size_t offset = RoundDown(r.next() % heap_capacity, kAlignment); 170 bool set = r.next() % 2 == 1; 180 const size_t offset = RoundDown(r.next() % heap_capacity, kAlignment); 182 const size_t end = offset + RoundDown(r.next() % (remain + 1), kAlignment);
|
/art/runtime/gc/ |
H A D | reference_queue.cc | 67 ObjPtr<mirror::Reference> next = ref->GetPendingNext<kWithoutReadBarrier>(); local 68 list_->SetPendingNext(next);
|
/art/runtime/jdwp/ |
H A D | jdwp_event.h | 93 JdwpEvent* next; member in struct:art::JDWP::JdwpEvent
|
/art/runtime/jit/ |
H A D | debugger_interface.cc | 69 // 4) go back to step 2 using the next pointer (if non-null). 201 JITCodeEntry* next = entry->next_.load(std::memory_order_relaxed); local 203 entry->prev_->next_.store(next, std::memory_order_relaxed); 205 descriptor.head_.store(next, std::memory_order_relaxed); 207 if (next != nullptr) { 208 next->prev_ = entry->prev_;
|
/art/compiler/utils/ |
H A D | assembler.h | 150 SlowPath* next = nullptr; local 152 for ( ; cur != nullptr ; cur = next) { 154 next = cur->next_;
|
/art/runtime/base/ |
H A D | arena_allocator.cc | 361 Arena* next = first->next_; local 363 first = next;
|
/art/test/530-checker-lse/src/ |
H A D | Main.java | 43 TestClass next; field in class:TestClass 160 obj.next = obj2; // Make obj2 a non-singleton. 292 obj.next = obj2; 1164 obj1.next = obj2; 1176 obj1.next = obj2;
|