| /art/compiler/optimizing/ |
| H A D | code_generator_x86_64.h | 156 LocationsBuilderX86_64(HGraph* graph, CodeGeneratorX86_64* codegen)
188 InstructionCodeGeneratorX86_64(HGraph* graph, CodeGeneratorX86_64* codegen);
293 CodeGeneratorX86_64(HGraph* graph,
|
| H A D | superblock_cloner.cc | 89 // Calls HGraph::OrderLoopHeaderPredecessors for each loop in the graph.
90 static void OrderLoopsHeadersPredecessors(HGraph* graph) {
317 // This is a modified version of HGraph::AnalyzeLoops.
549 SuperblockCloner::SuperblockCloner(HGraph* graph,
656 HGraph* graph = orig_block->GetGraph();
|
| H A D | gvn.cc | 344 GlobalValueNumberer(HGraph* graph,
362 HGraph* graph_;
|
| H A D | load_store_analysis.h | 188 explicit HeapLocationCollector(HGraph* graph)
567 explicit LoadStoreAnalysis(HGraph* graph, const char* name = kLoadStoreAnalysisPassName)
|
| H A D | dominator_test.cc | 35 HGraph* graph = CreateCFG(data);
|
| H A D | emit_swap_mips_test.cc | 107 HGraph* graph_;
|
| H A D | instruction_simplifier_arm.cc | 35 InstructionSimplifierArmVisitor(HGraph* graph, OptimizingCompilerStats* stats)
|
| H A D | instruction_simplifier_arm64.cc | 35 InstructionSimplifierArm64Visitor(HGraph* graph, OptimizingCompilerStats* stats)
|
| H A D | licm_test.cc | 99 HGraph* graph_;
|
| H A D | liveness_test.cc | 50 HGraph* graph = CreateCFG(data);
|
| H A D | loop_optimization.h | 37 HLoopOptimization(HGraph* graph,
|
| H A D | optimizing_cfi_test.cc | 154 HGraph* graph_;
|
| H A D | scheduler.cc | 545 void HScheduler::Schedule(HGraph* graph) {
606 HGraph* graph = block->GetGraph();
|
| H A D | nodes.h | 176 friend class HGraph;
308 class HGraph : public ArenaObject<kArenaAllocGraph> { class in namespace:art
310 HGraph(ArenaAllocator* allocator, function in class:art::HGraph
396 HInstruction* InlineInto(HGraph* outer_graph, HInvoke* invoke);
761 DISALLOW_COPY_AND_ASSIGN(HGraph);
766 HLoopInformation(HBasicBlock* header, HGraph* graph)
886 // Note that HGraph is constructed so that catch blocks cannot simultaneously
947 explicit HBasicBlock(HGraph* graph, uint32_t dex_pc = kNoDexPc)
1024 HGraph* GetGraph() const { return graph_; }
1025 void SetGraph(HGraph* grap
[all...] |
| H A D | induction_var_analysis.h | 38 explicit HInductionVarAnalysis(HGraph* graph, const char* name = kInductionPassName);
|
| H A D | intrinsics.h | 40 IntrinsicsRecognizer(HGraph* graph,
|
| H A D | loop_optimization_test.cc | 103 HGraph* graph_;
198 // This is a test for nodes.cc functionality - HGraph::SimplifyLoop.
240 // This is a test for nodes.cc functionality - HGraph::SimplifyLoop.
|
| H A D | optimization.cc | 173 HGraph* graph,
|
| H A D | register_allocator.cc | 71 bool RegisterAllocator::CanAllocateRegistersFor(const HGraph& graph ATTRIBUTE_UNUSED,
|
| H A D | superblock_cloner_test.cc | 153 HGraph* graph_;
|
| H A D | code_generator_arm64.h | 245 InstructionCodeGeneratorARM64(HGraph* graph, CodeGeneratorARM64* codegen);
348 LocationsBuilderARM64(HGraph* graph, CodeGeneratorARM64* codegen)
405 CodeGeneratorARM64(HGraph* graph,
|
| H A D | code_generator_arm_vixl.h | 260 LocationsBuilderARMVIXL(HGraph* graph, CodeGeneratorARMVIXL* codegen)
299 InstructionCodeGeneratorARMVIXL(HGraph* graph, CodeGeneratorARMVIXL* codegen);
426 CodeGeneratorARMVIXL(HGraph* graph,
|
| H A D | bounds_check_elimination_test.cc | 59 HGraph* graph_;
358 static HInstruction* BuildSSAGraph1(HGraph* graph,
473 static HInstruction* BuildSSAGraph2(HGraph *graph,
583 static HInstruction* BuildSSAGraph3(HGraph* graph,
685 static HInstruction* BuildSSAGraph4(HGraph* graph,
|
| H A D | block_builder.cc | 27 HBasicBlockBuilder::HBasicBlockBuilder(HGraph* graph,
|
| H A D | code_generator.cc | 773 std::unique_ptr<CodeGenerator> CodeGenerator::Create(HGraph* graph,
828 CodeGenerator::CodeGenerator(HGraph* graph,
879 const HGraph& graph,
896 static void CheckLoopEntriesCanBeUsedForOsr(const HGraph& graph,
|