| /aosp12/art/compiler/optimizing/ |
| H A D | codegen_test_utils.h | 48 typedef CodeGenerator* (*CreateCodegenFn)(HGraph*, const CompilerOptions&);
88 TestCodeGeneratorARMVIXL(HGraph* graph, const CompilerOptions& compiler_options) in TestCodeGeneratorARMVIXL()
130 TestCodeGeneratorARM64(HGraph* graph, const CompilerOptions& compiler_options) in TestCodeGeneratorARM64()
148 TestCodeGeneratorX86(HGraph* graph, const CompilerOptions& compiler_options) in TestCodeGeneratorX86()
269 static void ValidateGraph(HGraph* graph) { in ValidateGraph()
282 HGraph* graph, in RunCodeNoCheck()
283 const std::function<void(HGraph*)>& hook_before_codegen, in RunCodeNoCheck()
303 HGraph* graph, in RunCode()
304 std::function<void(HGraph*)> hook_before_codegen, in RunCode()
314 HGraph* graph, in RunCode()
[all …]
|
| H A D | graph_test.cc | 29 HBasicBlock* CreateIfBlock(HGraph* graph);
30 HBasicBlock* CreateGotoBlock(HGraph* graph);
31 HBasicBlock* CreateEntryBlock(HGraph* graph);
33 HBasicBlock* CreateExitBlock(HGraph* graph);
81 HGraph* graph = CreateGraph(); in TEST_F()
113 HGraph* graph = CreateGraph(); in TEST_F()
145 HGraph* graph = CreateGraph(); in TEST_F()
177 HGraph* graph = CreateGraph(); in TEST_F()
209 HGraph* graph = CreateGraph(); in TEST_F()
245 HGraph* graph = CreateGraph(); in TEST_F()
[all …]
|
| H A D | find_loops_test.cc | 38 HGraph* graph = CreateCFG(data); in TEST_F()
49 HGraph* graph = CreateCFG(data); in TEST_F()
63 HGraph* graph = CreateCFG(data); in TEST_F()
78 HGraph* graph = CreateCFG(data); in TEST_F()
91 HGraph* graph = CreateCFG(data); in TEST_F()
97 static void TestBlock(HGraph* graph, in TestBlock()
135 HGraph* graph = CreateCFG(data); in TEST_F()
161 HGraph* graph = CreateCFG(data); in TEST_F()
184 HGraph* graph = CreateCFG(data); in TEST_F()
208 HGraph* graph = CreateCFG(data); in TEST_F()
[all …]
|
| H A D | induction_var_range.h | 102 HGraph* graph,
113 HInstruction* GenerateTakenTest(HInstruction* context, HGraph* graph, HBasicBlock* block);
127 HInstruction* GenerateLastValue(HInstruction* instruction, HGraph* graph, HBasicBlock* block);
182 HGraph* graph,
190 HInstruction* GenerateTripCount(HLoopInformation* loop, HGraph* graph, HBasicBlock* block);
292 HGraph* graph,
303 HGraph* graph,
309 HGraph* graph,
315 HGraph* graph,
321 HGraph* graph,
[all …]
|
| H A D | graph_checker_test.cc | 24 HGraph* CreateSimpleCFG();
36 HGraph* GraphCheckerTest::CreateSimpleCFG() { in CreateSimpleCFG()
37 HGraph* graph = CreateGraph(); in CreateSimpleCFG()
52 HGraph* graph = CreateCFG(data); in TestCode()
98 HGraph* graph = CreateSimpleCFG(); in TEST_F()
113 HGraph* graph = CreateSimpleCFG(); in TEST_F()
|
| H A D | register_allocator_test.cc | 91 HGraph* graph = CreateCFG(data); in Check()
106 HGraph* graph = CreateGraph(); in TEST_F()
330 HGraph* graph = CreateCFG(data); in Loop3()
363 HGraph* graph = CreateCFG(data); in TEST_F()
413 HGraph* graph = CreateCFG(data); in DeadPhi()
437 HGraph* graph = CreateCFG(data); in TEST_F()
491 HGraph* graph = CreateGraph(); in BuildIfElseWithPhi()
641 HGraph* graph = CreateGraph(); in BuildFieldReturn()
717 HGraph* graph = CreateGraph(); in BuildTwoSubs()
789 HGraph* graph = CreateGraph(); in BuildDiv()
[all …]
|
| H A D | execution_subgraph.h | 56 explicit BlockIdToBlockTransformer(const HGraph* graph) : graph_(graph) {} in BlockIdToBlockTransformer()
58 inline const HGraph* GetGraph() const { in GetGraph()
74 const HGraph* const graph_;
129 explicit ExcludedCohort(ScopedArenaAllocator* allocator, HGraph* graph) in ExcludedCohort()
208 HGraph* graph_;
229 ExecutionSubgraph(HGraph* graph, ScopedArenaAllocator* allocator);
297 static bool CanAnalyse(HGraph* graph) { in CanAnalyse()
332 HGraph* graph_;
|
| H A D | constant_folding_test.cc | 84 HGraph* graph_;
124 auto check_after_cf = [](HGraph* graph) { in TEST_F()
185 auto check_after_cf = [](HGraph* graph) { in TEST_F()
246 auto check_after_cf = [](HGraph* graph) { in TEST_F()
325 auto check_after_cf = [](HGraph* graph) { in TEST_F()
396 auto check_after_cf = [](HGraph* graph) { in TEST_F()
459 auto check_after_cf = [](HGraph* graph) { in TEST_F()
523 auto check_after_cf = [](HGraph* graph) { in TEST_F()
623 auto check_after_cf = [](HGraph* graph) { in TEST_F()
708 auto check_after_cf = [](HGraph* graph) { in TEST_F()
[all …]
|
| H A D | live_ranges_test.cc | 32 HGraph* BuildGraph(const std::vector<uint16_t>& data);
37 HGraph* LiveRangesTest::BuildGraph(const std::vector<uint16_t>& data) { in BuildGraph()
38 HGraph* graph = CreateCFG(data); in BuildGraph()
65 HGraph* graph = BuildGraph(data); in TEST_F()
110 HGraph* graph = BuildGraph(data); in TEST_F()
157 HGraph* graph = BuildGraph(data); in TEST_F()
231 HGraph* graph = BuildGraph(data); in TEST_F()
307 HGraph* graph = BuildGraph(data); in TEST_F()
381 HGraph* graph = BuildGraph(data); in TEST_F()
|
| H A D | inliner.h | 30 class HGraph; variable
36 HInliner(HGraph* outer_graph,
37 HGraph* outermost_graph,
97 void SubstituteArguments(HGraph* callee_graph,
104 void RunOptimizations(HGraph* callee_graph,
142 bool CanInlineBody(const HGraph* callee_graph,
306 HGraph* const outermost_graph_;
|
| H A D | codegen_test.cc | 81 HGraph* graph = CreateCFG(data); in TestCode()
415 HGraph* graph = CreateGraph(); in TEST_F()
477 HGraph* graph = CreateGraph(); in TEST_F()
608 HGraph* graph = CreateGraph(); in TestComparison()
722 HGraph* graph = CreateGraph(); in TEST_F()
746 HGraph* graph = CreateGraph(); in TEST_F()
796 HGraph* graph = CreateGraph(); in TEST_F()
832 HGraph* graph = CreateGraph(); in TEST_F()
847 HGraph* graph = CreateGraph(); in TEST_F()
866 HGraph* graph = CreateGraph(); in TEST_F()
[all …]
|
| H A D | graph_visualizer.h | 32 class HGraph; variable
105 HGraph* graph,
119 static void DumpInstruction(std::ostream* output, HGraph* graph, HInstruction* instruction);
134 HGraph* const graph_;
|
| H A D | builder.h | 36 HGraphBuilder(HGraph* graph,
44 HGraphBuilder(HGraph* graph,
57 HGraph* const graph_;
|
| H A D | optimizing_unit_test.h | 109 inline void RemoveSuspendChecks(HGraph* graph) { in RemoveSuspendChecks()
145 HGraph* graph, in AdjacencyListGraph()
210 HGraph* graph_;
251 graph_ = new (allocator) HGraph(
262 HGraph* CreateCFG(const std::vector<uint16_t>& data,
265 HGraph* graph = CreateGraph(handles);
323 bool CheckGraph(HGraph* graph, std::ostream& oss = std::cerr) {
545 HGraph* graph_;
689 HGraph* graph,
710 HGraph* graph,
[all …]
|
| H A D | optimization.h | 34 HOptimization(HGraph* graph,
54 HGraph* const graph_;
143 HGraph* graph,
|
| H A D | execution_subgraph_test.h | 24 class HGraph; variable
29 static bool CalculateValidity(HGraph* graph, const ExecutionSubgraph* subgraph);
|
| H A D | linear_order.h | 26 void LinearizeGraphInternal(const HGraph* graph, ArrayRef<HBasicBlock*> linear_order);
40 void LinearizeGraph(const HGraph* graph, Vector* linear_order) { in LinearizeGraph()
|
| H A D | ssa_phi_elimination.h | 31 explicit SsaDeadPhiElimination(HGraph* graph) in SsaDeadPhiElimination()
53 explicit SsaRedundantPhiElimination(HGraph* graph) in SsaRedundantPhiElimination()
|
| H A D | nodes.cc | 58 void HGraph::AddBlock(HBasicBlock* block) { in AddBlock()
232 void HGraph::ClearDominanceInformation() { in ClearDominanceInformation()
239 void HGraph::ClearLoopInformation() { in ClearLoopInformation()
401 const HGraph* graph_;
440 void HGraph::ComputeDominanceInformation() { in ComputeDominanceInformation()
708 void HGraph::ComputeTryBlockInformation() { in ComputeTryBlockInformation()
734 void HGraph::SimplifyCFG() { in SimplifyCFG()
866 const char* HGraph::GetMethodName() const { in GetMethodName()
993 HGraph* graph = header_->GetGraph(); in Populate()
1769 HGraph* graph = GetBlock()->GetGraph(); in TryStaticEvaluation()
[all …]
|
| H A D | side_effects_analysis.h | 28 explicit SideEffectsAnalysis(HGraph* graph, const char* pass_name = kSideEffectsAnalysisPassName)
49 HGraph* graph_;
|
| H A D | block_builder.h | 30 HBasicBlockBuilder(HGraph* graph,
75 HGraph* const graph_;
|
| H A D | x86_memory_gen.cc | 29 MemoryOperandVisitor(HGraph* graph, bool do_implicit_null_checks) in MemoryOperandVisitor()
72 X86MemoryOperandGeneration::X86MemoryOperandGeneration(HGraph* graph, in X86MemoryOperandGeneration()
|
| H A D | optimizing_compiler.cc | 106 PassObserver(HGraph* graph, in PassObserver()
222 HGraph* const graph_;
309 bool RunOptimizations(HGraph* graph, in RunOptimizations()
350 HGraph* graph, in RunOptimizations()
359 void RunOptimizations(HGraph* graph,
393 bool RunArchOptimizations(HGraph* graph,
398 bool RunBaselineOptimizations(HGraph* graph,
581 static void AllocateRegisters(HGraph* graph, in AllocateRegisters()
613 void OptimizingCompiler::RunOptimizations(HGraph* graph, in RunOptimizations()
806 HGraph* graph = new (allocator) HGraph( in TryCompile()
[all …]
|
| H A D | nodes_test.cc | 145 HGraph* graph = CreateGraph(); in TEST_F()
185 HGraph* graph = CreateGraph(); in TEST_F()
210 HGraph* graph = CreateGraph(); in TEST_F()
228 HGraph* graph = CreateGraph(); in TEST_F()
|
| H A D | superblock_cloner.h | 69 inline bool IsEdgeValid(HEdge edge, HGraph* graph) { in IsEdgeValid()
144 SuperblockCloner(HGraph* graph,
348 HGraph* const graph_;
543 bool IsSubgraphConnected(SuperblockCloner::HBasicBlockSet* work_set, HGraph* graph);
|