Searched refs:HGraph (Results 1 - 25 of 121) sorted by relevance

12345

/art/compiler/optimizing/
H A Dlinear_order.h26 void LinearizeGraphInternal(const HGraph* graph, ArrayRef<HBasicBlock*> linear_order);
40 void LinearizeGraph(const HGraph* graph, Vector* linear_order) {
H A Dssa_phi_elimination.h31 explicit SsaDeadPhiElimination(HGraph* graph)
53 explicit SsaRedundantPhiElimination(HGraph* graph)
H A Dcha_guard_optimization.h29 explicit CHAGuardOptimization(HGraph* graph,
H A Dcode_sinking.h31 CodeSinking(HGraph* graph,
H A Dconstant_folding.h42 HConstantFolding(HGraph* graph, const char* name) : HOptimization(graph, name) {}
H A Dconstructor_fence_redundancy_elimination.h50 ConstructorFenceRedundancyElimination(HGraph* graph,
H A Dgvn.h29 GVNOptimization(HGraph* graph,
H A Dinstruction_simplifier_arm.h28 InstructionSimplifierArm(HGraph* graph, OptimizingCompilerStats* stats)
H A Dinstruction_simplifier_arm64.h28 InstructionSimplifierArm64(HGraph* graph, OptimizingCompilerStats* stats)
H A Dselect_generator.h66 HSelectGenerator(HGraph* graph,
H A Dx86_memory_gen.h30 X86MemoryOperandGeneration(HGraph* graph,
H A Dcodegen_test_utils.h64 typedef CodeGenerator* (*CreateCodegenFn)(HGraph*, const CompilerOptions&);
72 CodeGenerator* CreateCodeGenerator(HGraph* graph, const CompilerOptions& compiler_options) {
104 TestCodeGeneratorARMVIXL(HGraph* graph,
148 TestCodeGeneratorARM64(HGraph* graph,
168 TestCodeGeneratorX86(HGraph* graph,
281 static void ValidateGraph(HGraph* graph) {
294 HGraph* graph,
295 const std::function<void(HGraph*)>& hook_before_codegen,
315 HGraph* graph,
316 std::function<void(HGraph*)> hook_before_codege
[all...]
H A Dgraph_checker_test.cc24 HGraph* CreateSimpleCFG();
36 HGraph* GraphCheckerTest::CreateSimpleCFG() {
37 HGraph* graph = CreateGraph();
52 HGraph* graph = CreateCFG(data);
98 HGraph* graph = CreateSimpleCFG();
113 HGraph* graph = CreateSimpleCFG();
H A Dblock_builder.h30 HBasicBlockBuilder(HGraph* graph,
70 HGraph* const graph_;
H A Dside_effects_analysis.h28 explicit SideEffectsAnalysis(HGraph* graph, const char* pass_name = kSideEffectsAnalysisPassName)
49 HGraph* graph_;
H A Dx86_memory_gen.cc29 MemoryOperandVisitor(HGraph* graph, bool do_implicit_null_checks)
72 X86MemoryOperandGeneration::X86MemoryOperandGeneration(HGraph* graph,
H A Dbounds_check_elimination.h29 BoundsCheckElimination(HGraph* graph,
H A Ddead_code_elimination.h32 HDeadCodeElimination(HGraph* graph, OptimizingCompilerStats* stats, const char* name)
H A Dinstruction_simplifier_mips.h32 InstructionSimplifierMips(HGraph* graph, CodeGenerator* codegen, OptimizingCompilerStats* stats)
H A Dlicm.h29 LICM(HGraph* graph,
H A Dpc_relative_fixups_mips.h31 PcRelativeFixups(HGraph* graph, CodeGenerator* codegen, OptimizingCompilerStats* stats)
H A Dpc_relative_fixups_x86.h31 PcRelativeFixups(HGraph* graph, CodeGenerator* codegen, OptimizingCompilerStats* stats)
H A Dbuilder.h37 HGraphBuilder(HGraph* graph,
48 HGraphBuilder(HGraph* graph,
62 HGraph* const graph_;
H A Doptimization.h35 HOptimization(HGraph* graph,
54 HGraph* const graph_;
133 HGraph* graph,
H A Dfind_loops_test.cc38 HGraph* graph = CreateCFG(data);
49 HGraph* graph = CreateCFG(data);
63 HGraph* graph = CreateCFG(data);
78 HGraph* graph = CreateCFG(data);
91 HGraph* graph = CreateCFG(data);
97 static void TestBlock(HGraph* graph,
135 HGraph* graph = CreateCFG(data);
161 HGraph* graph = CreateCFG(data);
184 HGraph* graph = CreateCFG(data);
208 HGraph* grap
[all...]

Completed in 362 milliseconds

12345