Searched defs:graph (Results 26 - 50 of 71) sorted by relevance

123

/art/compiler/optimizing/
H A Dside_effects_analysis.h28 explicit SideEffectsAnalysis(HGraph* graph) argument
29 : HOptimization(graph, kSideEffectsAnalysisPassName),
30 graph_(graph),
31 block_effects_(graph->GetBlocks().size(),
32 graph->GetArena()->Adapter(kArenaAllocSideEffectsAnalysis)),
33 loop_effects_(graph->GetBlocks().size(),
34 graph->GetArena()->Adapter(kArenaAllocSideEffectsAnalysis)) {}
H A Dssa_test.cc35 explicit SsaPrettyPrinter(HGraph* graph) : HPrettyPrinter(graph), str_("") {} argument
67 static void ReNumberInstructions(HGraph* graph) { argument
69 for (HBasicBlock* block : graph->GetBlocks()) {
82 HGraph* graph = CreateCFG(&allocator, data); local
85 RemoveSuspendChecks(graph);
86 ReNumberInstructions(graph);
89 for (HBasicBlock* block : graph->GetBlocks()) {
95 SsaPrettyPrinter printer(graph);
H A Dblock_builder.h29 HBasicBlockBuilder(HGraph* graph, argument
32 : arena_(graph->GetArena()),
33 graph_(graph),
H A Dfind_loops_test.cc40 HGraph* graph = CreateCFG(&allocator, data); local
41 for (HBasicBlock* block : graph->GetBlocks()) {
53 HGraph* graph = CreateCFG(&allocator, data); local
54 for (HBasicBlock* block : graph->GetBlocks()) {
69 HGraph* graph = CreateCFG(&allocator, data); local
70 for (HBasicBlock* block : graph->GetBlocks()) {
86 HGraph* graph = CreateCFG(&allocator, data); local
87 for (HBasicBlock* block : graph->GetBlocks()) {
101 HGraph* graph = CreateCFG(&allocator, data); local
102 for (HBasicBlock* block : graph
107 TestBlock(HGraph* graph, uint32_t block_id, bool is_loop_header, uint32_t parent_loop_header_id, const int* blocks_in_loop = nullptr, size_t number_of_blocks = 0) argument
147 HGraph* graph = CreateCFG(&allocator, data); local
175 HGraph* graph = CreateCFG(&allocator, data); local
200 HGraph* graph = CreateCFG(&allocator, data); local
226 HGraph* graph = CreateCFG(&allocator, data); local
252 HGraph* graph = CreateCFG(&allocator, data); local
277 HGraph* graph = CreateCFG(&allocator, data); local
308 HGraph* graph = CreateCFG(&allocator, data); local
338 HGraph* graph = CreateCFG(&allocator, data); local
354 HGraph* graph = CreateCFG(&allocator, data); local
[all...]
H A Dgraph_checker.h26 // A control-flow graph visitor performing various checks.
29 explicit GraphChecker(HGraph* graph, const char* dump_prefix = "art::GraphChecker: ") argument
30 : HGraphDelegateVisitor(graph),
31 errors_(graph->GetArena()->Adapter(kArenaAllocGraphChecker)),
33 seen_ids_(graph->GetArena(),
34 graph->GetCurrentInstructionId(),
37 blocks_storage_(graph->GetArena()->Adapter(kArenaAllocGraphChecker)),
38 visited_storage_(graph->GetArena(), 0u, true, kArenaAllocGraphChecker) {}
40 // Check the whole graph (in reverse post-order).
76 // Was the last visit of the graph vali
[all...]
H A Dliveness_test.cc49 HGraph* graph = CreateCFG(&allocator, data); local
51 PrepareForRegisterAllocation(graph).Run();
54 x86::CodeGeneratorX86 codegen(graph, *features_x86.get(), CompilerOptions());
55 SsaLivenessAnalysis liveness(graph, &codegen);
59 for (HInsertionOrderIterator it(*graph); !it.Done(); it.Advance()) {
H A Dnodes_test.cc26 * Test that removing instruction from the graph removes itself from user lists
33 HGraph* graph = CreateGraph(&allocator); local
34 HBasicBlock* entry = new (&allocator) HBasicBlock(graph);
35 graph->AddBlock(entry);
36 graph->SetEntryBlock(entry);
38 graph->GetDexFile(), 0, 0, Primitive::kPrimNot);
42 HBasicBlock* first_block = new (&allocator) HBasicBlock(graph);
43 graph->AddBlock(first_block);
49 HBasicBlock* exit_block = new (&allocator) HBasicBlock(graph);
50 graph
76 HGraph* graph = CreateGraph(&allocator); local
104 HGraph* graph = CreateGraph(&allocator); local
125 HGraph* graph = CreateGraph(&allocator); local
[all...]
H A Dssa_builder.h27 * Transforms a graph into SSA form. The liveness guarantees of
50 SsaBuilder(HGraph* graph, argument
53 : graph_(graph),
57 ambiguous_agets_(graph->GetArena()->Adapter(kArenaAllocGraphBuilder)),
58 ambiguous_asets_(graph->GetArena()->Adapter(kArenaAllocGraphBuilder)),
59 uninitialized_strings_(graph->GetArena()->Adapter(kArenaAllocGraphBuilder)) {
H A Dbuilder.h37 HGraphBuilder(HGraph* graph, argument
47 : graph_(graph),
53 block_builder_(graph, dex_file, code_item),
54 ssa_builder_(graph, dex_compilation_unit->GetDexCache(), handles),
55 instruction_builder_(graph,
69 HGraphBuilder(HGraph* graph, argument
73 : graph_(graph),
80 block_builder_(graph, nullptr, code_item),
81 ssa_builder_(graph, null_dex_cache_, handles),
82 instruction_builder_(graph,
[all...]
H A Ddead_code_elimination.cc25 static void MarkReachableBlocks(HGraph* graph, ArenaBitVector* visited) { argument
26 ArenaVector<HBasicBlock*> worklist(graph->GetArena()->Adapter(kArenaAllocDCE));
29 visited->SetBit(graph->GetEntryBlock()->GetBlockId());
30 worklist.push_back(graph->GetEntryBlock());
93 // Do not eliminate dead blocks if the graph has irreducible loops. We could
H A Dconstant_folding.cc25 explicit HConstantFoldingVisitor(HGraph* graph) argument
26 : HGraphDelegateVisitor(graph) {}
45 explicit InstructionWithAbsorbingInputSimplifier(HGraph* graph) : HGraphVisitor(graph) {} argument
H A Dgraph_test.cc28 static HBasicBlock* createIfBlock(HGraph* graph, ArenaAllocator* allocator) { argument
29 HBasicBlock* if_block = new (allocator) HBasicBlock(graph);
30 graph->AddBlock(if_block);
31 HInstruction* instr = graph->GetIntConstant(4);
39 static HBasicBlock* createGotoBlock(HGraph* graph, ArenaAllocator* allocator) { argument
40 HBasicBlock* block = new (allocator) HBasicBlock(graph);
41 graph->AddBlock(block);
47 static HBasicBlock* createEntryBlock(HGraph* graph, ArenaAllocator* allocator) { argument
48 HBasicBlock* block = createGotoBlock(graph, allocator);
49 graph
53 createReturnBlock(HGraph* graph, ArenaAllocator* allocator) argument
61 createExitBlock(HGraph* graph, ArenaAllocator* allocator) argument
76 HGraph* graph = CreateGraph(&allocator); local
111 HGraph* graph = CreateGraph(&allocator); local
146 HGraph* graph = CreateGraph(&allocator); local
181 HGraph* graph = CreateGraph(&allocator); local
216 HGraph* graph = CreateGraph(&allocator); local
255 HGraph* graph = CreateGraph(&allocator); local
291 HGraph* graph = CreateGraph(&allocator); local
[all...]
H A Dgvn_test.cc33 HGraph* graph = CreateGraph(&allocator); local
34 HBasicBlock* entry = new (&allocator) HBasicBlock(graph);
35 graph->AddBlock(entry);
36 graph->SetEntryBlock(entry);
37 HInstruction* parameter = new (&allocator) HParameterValue(graph->GetDexFile(),
43 HBasicBlock* block = new (&allocator) HBasicBlock(graph);
44 graph->AddBlock(block);
53 graph->GetDexFile(),
62 graph->GetDexFile(),
72 graph
118 HGraph* graph = CreateGraph(&allocator); local
201 HGraph* graph = CreateGraph(&allocator); local
326 HGraph* graph = CreateGraph(&allocator); local
[all...]
H A Dinstruction_builder.h35 HInstructionBuilder(HGraph* graph, argument
47 : arena_(graph->GetArena()),
48 graph_(graph),
66 loop_headers_(graph->GetArena()->Adapter(kArenaAllocGraphBuilder)) {
H A Dintrinsics.h36 IntrinsicsRecognizer(HGraph* graph, CompilerDriver* driver, OptimizingCompilerStats* stats) argument
37 : HOptimization(graph, kIntrinsicsRecognizerPassName, stats),
H A Doptimizing_unit_test.h64 void RemoveSuspendChecks(HGraph* graph) { argument
65 for (HBasicBlock* block : graph->GetBlocks()) {
83 // Create a control-flow graph from Dex instructions.
89 HGraph* graph = CreateGraph(allocator); local
94 HGraphBuilder builder(graph, *item, &handles, return_type);
96 return graph_built ? graph : nullptr;
119 // Returns if the instruction is removed from the graph.
H A Dpc_relative_fixups_x86.cc29 PCRelativeHandlerVisitor(HGraph* graph, CodeGenerator* codegen) argument
30 : HGraphVisitor(graph),
127 HGraph* graph = GetGraph(); variable
129 HX86FPNeg* x86_fp_neg = new (graph->GetArena()) HX86FPNeg(
146 HGraph* graph = GetGraph(); variable
148 HX86PackedSwitch* x86_switch = new (graph->GetArena()) HX86PackedSwitch(
H A Dcode_generator_mips.h170 LocationsBuilderMIPS(HGraph* graph, CodeGeneratorMIPS* codegen) argument
171 : HGraphVisitor(graph), codegen_(codegen) {}
203 InstructionCodeGeneratorMIPS(HGraph* graph, CodeGeneratorMIPS* codegen);
259 CodeGeneratorMIPS(HGraph* graph,
H A Dcode_generator_mips64.h170 LocationsBuilderMIPS64(HGraph* graph, CodeGeneratorMIPS64* codegen) argument
171 : HGraphVisitor(graph), codegen_(codegen) {}
203 InstructionCodeGeneratorMIPS64(HGraph* graph, CodeGeneratorMIPS64* codegen);
259 CodeGeneratorMIPS64(HGraph* graph,
H A Dcode_generator_x86_64.h157 LocationsBuilderX86_64(HGraph* graph, CodeGeneratorX86_64* codegen) argument
158 : HGraphVisitor(graph), codegen_(codegen) {}
189 InstructionCodeGeneratorX86_64(HGraph* graph, CodeGeneratorX86_64* codegen);
292 CodeGeneratorX86_64(HGraph* graph,
H A Dregister_allocator_test.cc41 HGraph* graph = CreateCFG(&allocator, data); local
44 x86::CodeGeneratorX86 codegen(graph, *features_x86.get(), CompilerOptions());
45 SsaLivenessAnalysis liveness(graph, &codegen);
59 HGraph* graph = CreateGraph(&allocator); local
62 x86::CodeGeneratorX86 codegen(graph, *features_x86.get(), CompilerOptions());
150 * Which becomes the following graph:
174 * Which becomes the following graph:
213 * Which becomes the following graph:
263 * Which becomes the following graph:
292 HGraph* graph local
326 HGraph* graph = CreateCFG(&allocator, data); local
380 HGraph* graph = CreateCFG(&allocator, data); local
404 HGraph* graph = CreateCFG(&allocator, data); local
460 HGraph* graph = CreateGraph(allocator); local
536 HGraph* graph = BuildIfElseWithPhi(&allocator, &phi, &input1, &input2); local
553 HGraph* graph = BuildIfElseWithPhi(&allocator, &phi, &input1, &input2); local
572 HGraph* graph = BuildIfElseWithPhi(&allocator, &phi, &input1, &input2); local
591 HGraph* graph = BuildIfElseWithPhi(&allocator, &phi, &input1, &input2); local
613 HGraph* graph = CreateGraph(allocator); local
654 HGraph* graph = BuildFieldReturn(&allocator, &field, &ret); local
669 HGraph* graph = BuildFieldReturn(&allocator, &field, &ret); local
690 HGraph* graph = CreateGraph(allocator); local
722 HGraph* graph = BuildTwoSubs(&allocator, &first_sub, &second_sub); local
738 HGraph* graph = BuildTwoSubs(&allocator, &first_sub, &second_sub); local
761 HGraph* graph = CreateGraph(allocator); local
791 HGraph* graph = BuildDiv(&allocator, &div); local
815 HGraph* graph = CreateGraph(&allocator); local
[all...]
H A Dbounds_check_elimination_test.cc358 static HInstruction* BuildSSAGraph1(HGraph* graph, argument
363 HBasicBlock* entry = new (allocator) HBasicBlock(graph);
364 graph->AddBlock(entry);
365 graph->SetEntryBlock(entry);
367 graph->GetDexFile(), 0, 0, Primitive::kPrimNot);
370 HInstruction* constant_initial = graph->GetIntConstant(initial);
371 HInstruction* constant_increment = graph->GetIntConstant(increment);
372 HInstruction* constant_10 = graph->GetIntConstant(10);
374 HBasicBlock* block = new (allocator) HBasicBlock(graph);
375 graph
473 BuildSSAGraph2(HGraph *graph, ArenaAllocator* allocator, int initial, int increment = -1, IfCondition cond = kCondLE) argument
583 BuildSSAGraph3(HGraph* graph, ArenaAllocator* allocator, int initial, int increment, IfCondition cond) argument
687 BuildSSAGraph4(HGraph* graph, ArenaAllocator* allocator, int initial, IfCondition cond = kCondGE) argument
[all...]
H A Dcode_generator_arm.h155 LocationsBuilderARM(HGraph* graph, CodeGeneratorARM* codegen) argument
156 : HGraphVisitor(graph), codegen_(codegen) {}
194 InstructionCodeGeneratorARM(HGraph* graph, CodeGeneratorARM* codegen);
299 CodeGeneratorARM(HGraph* graph,
H A Dcode_generator_arm64.h193 InstructionCodeGeneratorARM64(HGraph* graph, CodeGeneratorARM64* codegen);
284 LocationsBuilderARM64(HGraph* graph, CodeGeneratorARM64* codegen) argument
285 : HGraphVisitor(graph), codegen_(codegen) {}
341 CodeGeneratorARM64(HGraph* graph,
H A Dcode_generator_x86.h151 LocationsBuilderX86(HGraph* graph, CodeGeneratorX86* codegen) argument
152 : HGraphVisitor(graph), codegen_(codegen) {}
183 InstructionCodeGeneratorX86(HGraph* graph, CodeGeneratorX86* codegen);
310 CodeGeneratorX86(HGraph* graph,
604 // If there is a HX86ComputeBaseMethodAddress instruction in the graph

Completed in 233 milliseconds

123