/art/tools/ahat/src/main/com/android/ahat/heapdump/ |
D | Instances.java | 53 private long previous = -1; in Instances() 57 if (x.getId() == previous) { in Instances() 60 previous = x.getId(); in Instances()
|
/art/compiler/optimizing/ |
D | register_allocation_resolver.cc | 533 HInstruction* previous = user->GetPrevious(); in AddInputMoveFor() local 535 if (previous == nullptr in AddInputMoveFor() 536 || !previous->IsParallelMove() in AddInputMoveFor() 537 || previous->GetLifetimePosition() < user->GetLifetimePosition()) { in AddInputMoveFor() 542 move = previous->AsParallelMove(); in AddInputMoveFor() 607 HInstruction* previous = at->GetPrevious(); in InsertParallelMoveAt() local 608 if (previous == nullptr in InsertParallelMoveAt() 609 || !previous->IsParallelMove() in InsertParallelMoveAt() 610 || previous->GetLifetimePosition() != position) { in InsertParallelMoveAt() 614 DCHECK(previous == nullptr in InsertParallelMoveAt() [all …]
|
D | gvn.cc | 239 Node* previous = nullptr; in DeleteAllImpureWhich() local 253 previous = CloneBucket(i, previous); in DeleteAllImpureWhich() 254 node = (previous == nullptr) ? buckets_[i] : previous->GetNext(); in DeleteAllImpureWhich() 257 previous = node; in DeleteAllImpureWhich() 271 if (previous == nullptr) { in DeleteAllImpureWhich() 274 previous->SetNext(next); in DeleteAllImpureWhich() 277 previous = node; in DeleteAllImpureWhich()
|
D | ssa_liveness_analysis.h | 639 for (SafepointPosition* safepoint = first_safepoint_, *previous = nullptr; in FindSafepointJustBefore() local 641 previous = safepoint, safepoint = safepoint->GetNext()) { in FindSafepointJustBefore() 642 if (safepoint->GetPosition() >= position) return previous; in FindSafepointJustBefore() 683 LiveRange* previous = nullptr; in SplitAt() local 689 previous = current; in SplitAt() 695 DCHECK(previous != nullptr); in SplitAt() 698 last_range_ = previous; in SplitAt() 699 previous->next_ = nullptr; in SplitAt() 715 if (previous != nullptr) { in SplitAt() 716 previous->next_ = last_range_; in SplitAt()
|
D | loop_optimization.h | 59 previous(nullptr), in LoopNode() 64 LoopNode* previous; member
|
D | loop_optimization.cc | 584 node->previous = last_loop_; in AddLoop() 593 if (node->previous != nullptr) { in RemoveLoop() 595 node->previous->next = node->next; in RemoveLoop() 597 node->next->previous = node->previous; in RemoveLoop() 608 node->next->previous = nullptr; in RemoveLoop()
|
D | nodes.cc | 1153 HInstruction* previous = GetPrevious(); in GetPreviousDisregardingMoves() local 1154 while (previous != nullptr && previous->IsParallelMove()) { in GetPreviousDisregardingMoves() 1155 previous = previous->GetPrevious(); in GetPreviousDisregardingMoves() 1157 return previous; in GetPreviousDisregardingMoves()
|
D | code_generator_arm64.cc | 3101 HInstruction* previous = got->GetPrevious(); in HandleGoto() local 3117 if (block->IsEntryBlock() && (previous != nullptr) && previous->IsSuspendCheck()) { in HandleGoto() 3118 GenerateSuspendCheck(previous->AsSuspendCheck(), nullptr); in HandleGoto()
|
D | code_generator_mips64.cc | 3695 HInstruction* previous = got->GetPrevious(); in HandleGoto() local 3708 if (block->IsEntryBlock() && (previous != nullptr) && previous->IsSuspendCheck()) { in HandleGoto() 3709 GenerateSuspendCheck(previous->AsSuspendCheck(), nullptr); in HandleGoto()
|
D | code_generator_x86_64.cc | 1540 HInstruction* previous = got->GetPrevious(); in HandleGoto() local 1553 if (block->IsEntryBlock() && (previous != nullptr) && previous->IsSuspendCheck()) { in HandleGoto() 1554 GenerateSuspendCheck(previous->AsSuspendCheck(), nullptr); in HandleGoto()
|
D | code_generator_x86.cc | 1381 HInstruction* previous = got->GetPrevious(); in HandleGoto() local 1395 if (block->IsEntryBlock() && (previous != nullptr) && previous->IsSuspendCheck()) { in HandleGoto() 1396 GenerateSuspendCheck(previous->AsSuspendCheck(), nullptr); in HandleGoto()
|
D | code_generator_arm_vixl.cc | 2413 HInstruction* previous = got->GetPrevious(); in HandleGoto() local 2430 if (block->IsEntryBlock() && (previous != nullptr) && previous->IsSuspendCheck()) { in HandleGoto() 2431 GenerateSuspendCheck(previous->AsSuspendCheck(), nullptr); in HandleGoto()
|
D | code_generator_mips.cc | 4368 HInstruction* previous = got->GetPrevious(); in HandleGoto() local 4381 if (block->IsEntryBlock() && (previous != nullptr) && previous->IsSuspendCheck()) { in HandleGoto() 4382 GenerateSuspendCheck(previous->AsSuspendCheck(), nullptr); in HandleGoto()
|
/art/test/001-Main/ |
D | info.txt | 1 Import of a previous oat test. Empty main, just test starting up the runtime.
|
/art/tools/ahat/src/main/com/android/ahat/ |
D | ObjectHandler.java | 137 Value previous = Value.getBaseline(base.asArrayInstance().getValue(i)); in printArrayElements() local 138 if (!Objects.equals(current, previous)) { in printArrayElements() 140 delta.append(Summarizer.summarize(previous)); in printArrayElements() 177 Value previous = Value.getBaseline(field.baseline); in printFields() local 179 was.append(Summarizer.summarize(previous)); in printFields() 192 Objects.equals(field.current, previous) ? new DocString() : was); in printFields()
|
/art/test/541-regression-inlined-deopt/ |
D | info.txt | 3 control over vregs because the previous test 449 would pass because the vreg
|
/art/compiler/utils/ |
D | assembler.cc | 58 fixup = fixup->previous(); in ProcessFixups()
|
D | assembler.h | 58 AssemblerFixup* previous() const { return previous_; } in previous() function
|
/art/tools/checker/ |
D | README | 32 matched the previous check. Cannot be used after any but the 72 after the 'CHECK-START' keyword. The previous example can be updated to run for
|
/art/cmdline/ |
D | README.md | 137 once, only the latest value is taken into account (and all previous occurrences of the argument are 140 In some situations, we may want to accumulate the argument values instead of discarding the previous
|
/art/runtime/interpreter/mterp/x86/ |
D | arithmetic.S | 293 fldcw LOCAL0(%esp) # restore previous rounding mode
|
/art/test/510-checker-try-catch/smali/ |
D | Builder.smali | 402 # Same as previous test, only the blocks are processed in the opposite order.
|