| /art/compiler/optimizing/ |
| D | find_loops_test.cc | 34 HGraph* graph = builder.BuildGraph(*item); in TestCode() local
47 HGraph* graph = TestCode(data, &arena); in TEST() local
59 HGraph* graph = TestCode(data, &arena); in TEST() local
74 HGraph* graph = TestCode(data, &arena); in TEST() local
90 HGraph* graph = TestCode(data, &arena); in TEST() local
104 HGraph* graph = TestCode(data, &arena); in TEST() local
110 static void TestBlock(HGraph* graph, in TestBlock()
149 HGraph* graph = TestCode(data, &arena); in TEST() local
176 HGraph* graph = TestCode(data, &arena); in TEST() local
200 HGraph* graph = TestCode(data, &arena); in TEST() local
[all …]
|
| D | graph_test.cc | 28 static HBasicBlock* createIfBlock(HGraph* graph, ArenaAllocator* allocator) { in createIfBlock()
40 static HBasicBlock* createGotoBlock(HGraph* graph, ArenaAllocator* allocator) { in createGotoBlock()
48 static HBasicBlock* createReturnBlock(HGraph* graph, ArenaAllocator* allocator) { in createReturnBlock()
56 static HBasicBlock* createExitBlock(HGraph* graph, ArenaAllocator* allocator) { in createExitBlock()
71 HGraph* graph = new (&allocator) HGraph(&allocator); in TEST() local
106 HGraph* graph = new (&allocator) HGraph(&allocator); in TEST() local
141 HGraph* graph = new (&allocator) HGraph(&allocator); in TEST() local
177 HGraph* graph = new (&allocator) HGraph(&allocator); in TEST() local
213 HGraph* graph = new (&allocator) HGraph(&allocator); in TEST() local
253 HGraph* graph = new (&allocator) HGraph(&allocator); in TEST() local
[all …]
|
| D | live_ranges_test.cc | 33 HGraph* graph = builder.BuildGraph(*item); in BuildGraph() local
59 HGraph* graph = BuildGraph(data, &allocator); in TEST() local
106 HGraph* graph = BuildGraph(data, &allocator); in TEST() local
155 HGraph* graph = BuildGraph(data, &allocator); in TEST() local
231 HGraph* graph = BuildGraph(data, &allocator); in TEST() local
|
| D | ssa_phi_elimination.h | 30 explicit SsaDeadPhiElimination(HGraph* graph) in SsaDeadPhiElimination()
52 explicit SsaRedundantPhiElimination(HGraph* graph) in SsaRedundantPhiElimination()
|
| D | register_allocator_test.cc | 39 HGraph* graph = builder.BuildGraph(*item); in Check() local
58 HGraph* graph = new (&allocator) HGraph(&allocator); in TEST() local
253 HGraph* graph = builder.BuildGraph(*item); in BuildSSAGraph() local
299 HGraph* graph = BuildSSAGraph(data, &allocator); in TEST() local
331 HGraph* graph = BuildSSAGraph(data, &allocator); in TEST() local
|
| D | pretty_printer.h | 27 explicit HPrettyPrinter(HGraph* graph) : HGraphVisitor(graph) { } in HPrettyPrinter()
106 explicit StringPrettyPrinter(HGraph* graph) in StringPrettyPrinter()
|
| D | ssa_type_propagation.h | 27 explicit SsaTypePropagation(HGraph* graph) in SsaTypePropagation()
|
| D | ssa_builder.h | 28 explicit SsaBuilder(HGraph* graph) in SsaBuilder()
|
| D | graph_visualizer.cc | 31 HGraphVisualizerPrinter(HGraph* graph, in HGraphVisualizerPrinter()
243 HGraph* graph, in HGraphVisualizer()
266 HGraph* graph, in HGraphVisualizer()
|
| D | ssa_test.cc | 33 explicit SsaPrettyPrinter(HGraph* graph) : HPrettyPrinter(graph), str_("") {} in SsaPrettyPrinter()
65 static void ReNumberInstructions(HGraph* graph) { in ReNumberInstructions()
83 HGraph* graph = builder.BuildGraph(*item); in TestCode() local
|
| D | code_generator_x86_64.h | 84 LocationsBuilderX86_64(HGraph* graph, CodeGeneratorX86_64* codegen) in LocationsBuilderX86_64()
|
| D | code_generator_x86.h | 87 LocationsBuilderX86(HGraph* graph, CodeGeneratorX86* codegen) in LocationsBuilderX86()
|
| D | code_generator_arm.h | 86 explicit LocationsBuilderARM(HGraph* graph, CodeGeneratorARM* codegen) in LocationsBuilderARM()
|
| D | optimizing_compiler.cc | 108 HGraph* graph = builder.BuildGraph(*code_item); in TryCompile() local
|
| D | linearize_test.cc | 41 HGraph* graph = builder.BuildGraph(*item); in TestCode() local
|
| D | code_generator.h | 143 CodeGenerator(HGraph* graph, size_t number_of_registers) in CodeGenerator()
|
| D | pretty_printer_test.cc | 35 HGraph* graph = builder.BuildGraph(*item); in TestCode() local
|
| D | nodes.h | 192 HLoopInformation(HBasicBlock* header, HGraph* graph) in HLoopInformation()
262 explicit HBasicBlock(HGraph* graph) in HBasicBlock()
1553 explicit HGraphVisitor(HGraph* graph) : graph_(graph) {} in HGraphVisitor()
1579 explicit HInsertionOrderIterator(const HGraph& graph) : graph_(graph), index_(0) {} in HInsertionOrderIterator()
1594 explicit HReversePostOrderIterator(const HGraph& graph) : graph_(graph), index_(0) {} in HReversePostOrderIterator()
1609 explicit HPostOrderIterator(const HGraph& graph) in HPostOrderIterator()
|
| D | dominator_test.cc | 32 HGraph* graph = builder.BuildGraph(*item); in TestCode() local
|
| /art/compiler/sea_ir/types/ |
| D | type_inference.cc | 39 FunctionTypeInfo::FunctionTypeInfo(const SeaGraph* graph, art::verifier::RegTypeCache* types) in FunctionTypeInfo()
47 FunctionTypeInfo::FunctionTypeInfo(const SeaGraph* graph, InstructionNode* inst, in FunctionTypeInfo()
143 void TypeInference::ComputeTypes(SeaGraph* graph) SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) { in ComputeTypes()
|
| D | type_inference_visitor.h | 37 TypeInferenceVisitor(SeaGraph* graph, TypeData* type_data, in TypeInferenceVisitor()
42 void Initialize(SeaGraph* graph) { } in Initialize()
|
| D | type_inference_visitor.cc | 24 void TypeInferenceVisitor::Visit(SeaGraph* graph) { in Visit()
|
| /art/compiler/sea_ir/debug/ |
| D | dot_gen.h | 48 void Visit(SeaGraph* graph) { in Visit()
102 void DumpSea(SeaGraph* graph, std::string filename, in DumpSea()
|
| D | dot_gen.cc | 23 void DotGenerationVisitor::Initialize(SeaGraph* graph) { in Initialize()
|
| /art/compiler/sea_ir/code_gen/ |
| D | code_gen.cc | 39 void CodeGenPassVisitor::Initialize(SeaGraph* graph) { in Initialize()
59 void CodeGenPostpassVisitor::Visit(SeaGraph* graph) { } in Visit()
60 void CodeGenVisitor::Visit(SeaGraph* graph) { } in Visit()
61 void CodeGenPrepassVisitor::Visit(SeaGraph* graph) { in Visit()
|