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

1234

/art/compiler/optimizing/
H A Doptimization.h31 HOptimization(HGraph* graph,
49 HGraph* const graph_;
H A Dconstant_folding.h42 HConstantFolding(HGraph* graph, const char* name = kConstantFoldingPassName)
H A Ddex_cache_array_fixups_arm.h28 DexCacheArrayFixups(HGraph* graph, OptimizingCompilerStats* stats)
H A Dgvn.h29 GVNOptimization(HGraph* graph,
H A Dinstruction_simplifier.h38 InstructionSimplifier(HGraph* graph,
H A Dload_store_elimination.h28 LoadStoreElimination(HGraph* graph, const SideEffectsAnalysis& side_effects)
H A Dpc_relative_fixups_x86.h31 PcRelativeFixups(HGraph* graph, CodeGenerator* codegen, OptimizingCompilerStats* stats)
H A Dselect_generator.h50 HSelectGenerator(HGraph* graph, OptimizingCompilerStats* stats)
H A Dinstruction_simplifier_arm.h28 InstructionSimplifierArmVisitor(HGraph* graph, OptimizingCompilerStats* stats)
48 InstructionSimplifierArm(HGraph* graph, OptimizingCompilerStats* stats)
H A Dside_effects_analysis.h28 explicit SideEffectsAnalysis(HGraph* graph)
49 HGraph* graph_;
H A Dssa_phi_elimination.h32 explicit SsaDeadPhiElimination(HGraph* graph)
61 explicit SsaRedundantPhiElimination(HGraph* graph)
H A Dbounds_check_elimination.h29 BoundsCheckElimination(HGraph* graph,
H A Ddead_code_elimination.h32 HDeadCodeElimination(HGraph* graph,
H A Dlicm.h29 LICM(HGraph* graph, const SideEffectsAnalysis& side_effects, OptimizingCompilerStats* stats)
H A Dgraph_checker_test.cc30 HGraph* CreateSimpleCFG(ArenaAllocator* allocator) {
31 HGraph* graph = CreateGraph(allocator);
48 HGraph* graph = CreateCFG(&allocator, data);
99 HGraph* graph = CreateSimpleCFG(&allocator);
117 HGraph* graph = CreateSimpleCFG(&allocator);
H A Doptimizing_unit_test.h64 void RemoveSuspendChecks(HGraph* graph) {
77 inline HGraph* CreateGraph(ArenaAllocator* allocator) {
78 return new (allocator) HGraph(
84 inline HGraph* CreateCFG(ArenaAllocator* allocator,
89 HGraph* graph = CreateGraph(allocator);
H A Dbuilder.h37 HGraphBuilder(HGraph* graph,
69 HGraphBuilder(HGraph* graph,
103 HGraph* const graph_;
H A Dgraph_visualizer.h30 class HGraph;
35 * This class outputs the HGraph in the C1visualizer format.
103 HGraph* graph,
112 HGraph* const graph_;
H A Dsharpening.h35 HSharpening(HGraph* graph,
H A Dfind_loops_test.cc40 HGraph* graph = CreateCFG(&allocator, data);
53 HGraph* graph = CreateCFG(&allocator, data);
69 HGraph* graph = CreateCFG(&allocator, data);
86 HGraph* graph = CreateCFG(&allocator, data);
101 HGraph* graph = CreateCFG(&allocator, data);
107 static void TestBlock(HGraph* graph,
147 HGraph* graph = CreateCFG(&allocator, data);
175 HGraph* graph = CreateCFG(&allocator, data);
200 HGraph* graph = CreateCFG(&allocator, data);
226 HGraph* grap
[all...]
H A Dblock_builder.h29 HBasicBlockBuilder(HGraph* graph,
72 HGraph* const graph_;
H A Dinliner.h28 class HGraph;
35 HInliner(HGraph* outer_graph,
36 HGraph* outermost_graph,
81 size_t RunOptimizations(HGraph* callee_graph,
184 HGraph* const outermost_graph_;
H A Dgraph_test.cc28 static HBasicBlock* createIfBlock(HGraph* graph, ArenaAllocator* allocator) {
39 static HBasicBlock* createGotoBlock(HGraph* graph, ArenaAllocator* allocator) {
47 static HBasicBlock* createEntryBlock(HGraph* graph, ArenaAllocator* allocator) {
53 static HBasicBlock* createReturnBlock(HGraph* graph, ArenaAllocator* allocator) {
61 static HBasicBlock* createExitBlock(HGraph* graph, ArenaAllocator* allocator) {
76 HGraph* graph = CreateGraph(&allocator);
111 HGraph* graph = CreateGraph(&allocator);
146 HGraph* graph = CreateGraph(&allocator);
181 HGraph* graph = CreateGraph(&allocator);
216 HGraph* grap
[all...]
H A Dinduction_var_range.h103 HGraph* graph,
115 HGraph* graph,
186 HGraph* graph,
196 HGraph* graph,
H A Dprepare_for_register_allocation.h31 explicit PrepareForRegisterAllocation(HGraph* graph) : HGraphDelegateVisitor(graph) {}

Completed in 216 milliseconds

1234