| /art/compiler/optimizing/ |
| D | instruction_simplifier_shared.cc | 257 HGraph* graph = access->GetBlock()->GetGraph(); in TryExtractArrayAccessAddress() local
258 ArenaAllocator* allocator = graph->GetAllocator(); in TryExtractArrayAccessAddress()
260 HIntConstant* offset = graph->GetIntConstant(data_offset); in TryExtractArrayAccessAddress()
291 HGraph* graph = access->GetBlock()->GetGraph(); in TryExtractVecArrayAccessAddress() local
292 ArenaAllocator* allocator = graph->GetAllocator(); in TryExtractVecArrayAccessAddress()
328 HIntConstant* offset = graph->GetIntConstant(data_offset); in TryExtractVecArrayAccessAddress()
329 HIntConstant* shift = graph->GetIntConstant(component_shift); in TryExtractVecArrayAccessAddress()
|
| D | instruction_simplifier_x86_64.cc | 26 InstructionSimplifierX86_64Visitor(HGraph* graph, in InstructionSimplifierX86_64Visitor() argument
29 : HGraphVisitor(graph), in InstructionSimplifierX86_64Visitor()
|
| D | liveness_test.cc | 48 HGraph* graph = CreateCFG(data); in TestCode() local
52 PrepareForRegisterAllocation(graph, *compiler_options).Run(); in TestCode()
53 std::unique_ptr<CodeGenerator> codegen = CodeGenerator::Create(graph, *compiler_options); in TestCode()
54 SsaLivenessAnalysis liveness(graph, codegen.get(), GetScopedAllocator()); in TestCode()
58 for (HBasicBlock* block : graph->GetBlocks()) { in TestCode()
|
| D | prepare_for_register_allocation.h | 34 PrepareForRegisterAllocation(HGraph* graph,
37 : HGraphDelegateVisitor(graph, stats), in HGraphDelegateVisitor() argument
|
| D | instruction_simplifier_x86.cc | 26 InstructionSimplifierX86Visitor(HGraph* graph, in InstructionSimplifierX86Visitor() argument
29 : HGraphVisitor(graph), in InstructionSimplifierX86Visitor()
|
| D | superblock_cloner.cc | 89 static void OrderLoopsHeadersPredecessors(HGraph* graph) { in OrderLoopsHeadersPredecessors() argument
90 for (HBasicBlock* block : graph->GetPostOrder()) { in OrderLoopsHeadersPredecessors()
92 graph->OrderLoopHeaderPredecessors(block); in OrderLoopsHeadersPredecessors()
684 void DumpBB(HGraph* graph) { in DumpBB() argument
685 for (HBasicBlock* bb : graph->GetBlocks()) { in DumpBB()
827 SuperblockCloner::SuperblockCloner(HGraph* graph, in SuperblockCloner() argument
832 : graph_(graph), in SuperblockCloner()
833 arena_(graph->GetAllocator()), in SuperblockCloner()
844 graph->GetAllocator()->Adapter(kArenaAllocSuperblockCloner)) { in SuperblockCloner()
1018 HGraph* graph = orig_block->GetGraph(); in CloneBasicBlock() local
[all …]
|
| D | scheduler.cc | 479 ScopedArenaVector<SchedulingNode*>* nodes, const SchedulingGraph& graph) const { in SelectMaterializedCondition()
504 SchedulingNode* condition_node = (condition != nullptr) ? graph.GetNode(condition) : nullptr; in SelectMaterializedCondition()
519 ScopedArenaVector<SchedulingNode*>* nodes, const SchedulingGraph& graph) { in PopHighestPriorityNode() argument
524 select_node = SelectMaterializedCondition(nodes, graph); in PopHighestPriorityNode()
558 void HScheduler::Schedule(HGraph* graph) { in Schedule() argument
562 ScopedArenaAllocator allocator(graph->GetArenaStack()); in Schedule()
563 LoadStoreAnalysis lsa(graph, &allocator); in Schedule()
564 if (!only_optimize_loop_blocks_ || graph->HasLoops()) { in Schedule()
569 for (HBasicBlock* block : graph->GetReversePostOrder()) { in Schedule()
627 HGraph* graph = block->GetGraph(); in Schedule() local
[all …]
|
| D | suspend_check_test.cc | 37 HGraph* graph = CreateCFG(data); in TestCode() local
38 HBasicBlock* first_block = graph->GetEntryBlock()->GetSingleSuccessor(); in TestCode()
|
| D | select_generator.h | 66 HSelectGenerator(HGraph* graph,
|
| D | constructor_fence_redundancy_elimination.cc | 30 CFREVisitor(HGraph* graph, OptimizingCompilerStats* stats) in CFREVisitor() argument
31 : HGraphVisitor(graph), in CFREVisitor()
32 scoped_allocator_(graph->GetArenaStack()), in CFREVisitor()
|
| D | x86_memory_gen.h | 30 X86MemoryOperandGeneration(HGraph* graph,
|
| D | ssa_builder.h | 51 SsaBuilder(HGraph* graph, in SsaBuilder() argument
55 : graph_(graph), in SsaBuilder()
|
| D | cha_guard_optimization.cc | 35 explicit CHAGuardVisitor(HGraph* graph) in CHAGuardVisitor() argument
36 : HGraphVisitor(graph), in CHAGuardVisitor()
39 graph->GetAllocator()->Adapter(kArenaAllocCHA)), in CHAGuardVisitor()
|
| D | nodes.cc | 819 HGraph* graph = header_->GetGraph(); in Populate() local
827 ScopedArenaAllocator allocator(graph->GetArenaStack()); in Populate()
829 graph->GetBlocks().size(), in Populate()
845 if (!is_irreducible_loop && graph->IsCompilingOsr()) { in Populate()
865 graph->SetHasIrreducibleLoops(true); in Populate()
867 graph->SetHasLoops(true); in Populate()
1549 HGraph* graph = GetBlock()->GetGraph(); in TryStaticEvaluation() local
1554 return graph->GetIntConstant(static_cast<int8_t>(value), GetDexPc()); in TryStaticEvaluation()
1556 return graph->GetIntConstant(static_cast<uint8_t>(value), GetDexPc()); in TryStaticEvaluation()
1558 return graph->GetIntConstant(static_cast<int16_t>(value), GetDexPc()); in TryStaticEvaluation()
[all …]
|
| D | pretty_printer_test.cc | 36 HGraph* graph = CreateCFG(data); in TestCode() local
37 StringPrettyPrinter printer(graph); in TestCode()
|
| /art/tools/ahat/src/main/com/android/ahat/dominators/ |
| D | DominatorsComputation.java | 123 Dominators.Graph<Node> graph = new Dominators.Graph<Node>() { in computeDominators() local
145 new Dominators(graph).progress(progress, numNodes).computeDominators(root); in computeDominators()
|
| /art/test/622-simplifyifs-exception-edges/ |
| D | info.txt | 1 Regression test for the SimplifyIfs() graph simplification erroneously trying
|
| /art/test/614-checker-dump-constant-location/ |
| D | info.txt | 1 Test that the graph visualizer outputs useful information for constant
|
| /art/test/489-current-method-regression/ |
| D | info.txt | 2 of HCurrentMethod from the optimizing graph.
|
| /art/test/475-regression-inliner-ids/ |
| D | info.txt | 2 instruction IDs in the caller graph.
|
| /art/test/478-checker-clinit-check-pruning/ |
| D | info.txt | 2 added by the graph builder during the construction of a static invoke
|
| /art/test/516-dead-move-result/ |
| D | info.txt | 1 Regression test for the graph builder in optimizing,
|
| /art/test/515-dce-dominator/ |
| D | info.txt | 3 the graph when blocks get removed.
|
| /art/test/695-simplify-throws/ |
| D | info.txt | 3 tree and that code used to not anticipate seeing phis in the graph.
|
| /art/tools/ahat/src/main/com/android/ahat/heapdump/ |
| D | AhatSnapshot.java | 68 Dominators.Graph<AhatInstance> graph = new Dominators.Graph<AhatInstance>() { in AhatSnapshot() local
89 new Dominators(graph).progress(progress, mInstances.size()).computeDominators(mSuperRoot); in AhatSnapshot()
|