Home
last modified time | relevance | path

Searched refs:graph (Results 1 – 25 of 103) sorted by relevance

12345

/arkcompiler/runtime_core/compiler/tests/
Dcompiler_graph_test.cpp68 …graph_test_.TestBuildGraphFromFile(pfile, [&test_method_name, &status](Graph* graph, std::string &… in __anon1425b6d40102() argument
73 EXPECT_NE(graph, nullptr); in __anon1425b6d40102()
74 auto start_block = graph->GetStartBlock(); in __anon1425b6d40102()
93 …graph_test_.TestBuildGraphFromFile(pfile, [&test_method_name, &status](Graph* graph, std::string &… in __anon1425b6d40202() argument
98 EXPECT_NE(graph, nullptr); in __anon1425b6d40202()
101 for (const auto &block : graph->GetVectorBlocks()) { in __anon1425b6d40202()
107 graph->DisconnectBlockRec(bb, true, true); in __anon1425b6d40202()
124 …graph_test_.TestBuildGraphFromFile(pfile, [&test_method_name, &status](Graph* graph, std::string &… in __anon1425b6d40302() argument
129 EXPECT_NE(graph, nullptr); in __anon1425b6d40302()
130 EXPECT_EQ(graph->GetParametersSlotsCount(), 0); in __anon1425b6d40302()
[all …]
Dcompiler_basicblock_test.cpp53 graph_test_.TestBuildGraphFromFile(pfile, [&](Graph* graph, std::string &method_name) { in __anond946d00f0102() argument
55 auto start_block = graph->GetStartBlock(); in __anond946d00f0102()
56 auto end_block = graph->GetEndBlock(); in __anond946d00f0102()
59 for (auto bb : graph->GetBlocksRPO()) { in __anond946d00f0102()
82 …graph_test_.TestBuildGraphFromFile(pfile, [&test_method_name, &status](Graph* graph, std::string &… in __anond946d00f0202() argument
87 for (auto bb : graph->GetBlocksRPO()) { in __anond946d00f0202()
91 graph->GetEndBlock()->InsertBlockBefore(bb->GetPredecessor(0)); in __anond946d00f0202()
92 graph->GetStartBlock()->InsertBlockBefore(bb->GetPredecessor(0)); in __anond946d00f0202()
95 EXPECT_TRUE(graph->GetStartBlock()->IsDominate(graph->GetStartBlock())); in __anond946d00f0202()
111 …graph_test_.TestBuildGraphFromFile(pfile, [&test_method_name, &status](Graph* graph, std::string &… in __anond946d00f0302() argument
[all …]
Dir_builder_test.cpp67 auto graph = CreateGraphWithDefaultRuntime(); in CheckSimple() local
68 GRAPH(graph) in CheckSimple()
79 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in CheckSimple()
107 auto graph = CreateGraphWithDefaultRuntime(); in CheckSimpleWithImm() local
109 GRAPH(graph) in CheckSimpleWithImm()
120 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in CheckSimpleWithImm()
142 auto graph = CreateGraphWithDefaultRuntime(); in CheckCmp() local
143 GRAPH(graph) in CheckCmp()
156 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in CheckCmp()
174 auto graph = CreateGraphWithDefaultRuntime(); in CheckFloatCmp() local
[all …]
Dliveness_analyzer_new_test.cpp50 …graph_test_.TestBuildGraphFromFile(pfile, [test_method_name, &status](Graph* graph, std::string &m… in __anonf1f112df0102() argument
55 EXPECT_NE(graph, nullptr); in __anonf1f112df0102()
56 LivenessAnalyzer liveness_analyzer(graph); in __anonf1f112df0102()
80 …graph_test_.TestBuildGraphFromFile(pfile, [test_method_name, &status](Graph* graph, std::string &m… in __anonf1f112df0202() argument
85 EXPECT_NE(graph, nullptr); in __anonf1f112df0202()
87 graph->RunPass<LivenessAnalyzer>(); in __anonf1f112df0202()
88 auto liveness_analyzer = &graph->GetAnalysis<LivenessAnalyzer>(); in __anonf1f112df0202()
222 …graph_test_.TestBuildGraphFromFile(pfile, [test_method_name, &status](Graph* graph, std::string &m… in __anonf1f112df0302() argument
227 EXPECT_NE(graph, nullptr); in __anonf1f112df0302()
228 LivenessAnalyzer liveness_analyzer(graph); in __anonf1f112df0302()
[all …]
Ddump_test.cpp62 …graph_test_.TestBuildGraphFromFile(pfile, [&test_method_name, &status](Graph* graph, std::string &… in __anon51f1233e0102() argument
67 EXPECT_NE(graph, nullptr); in __anon51f1233e0102()
68 for (auto bb : graph->GetBlocksRPO()) { in __anon51f1233e0102()
71 auto value1 = InstId(inst, graph->GetAllocator()); in __anon51f1233e0102()
76 auto value = InstId(inst, graph->GetAllocator()); in __anon51f1233e0102()
95 …graph_test_.TestBuildGraphFromFile(pfile, [&test_method_name, &status](Graph* graph, std::string &… in __anon51f1233e0202() argument
100 EXPECT_NE(graph, nullptr); in __anon51f1233e0202()
104 BlockProps(graph->GetStartBlock(), &data); in __anon51f1233e0202()
109 BlockProps(graph->GetEndBlock(), &data); in __anon51f1233e0202()
111 Loop loop(graph->GetAllocator(), graph->GetEndBlock(), 1); in __anon51f1233e0202()
[all …]
Dloop_analyzer_new_test.cpp50 …graph_test_.TestBuildGraphFromFile(pfile, [test_method_name, &status](Graph* graph, std::string &m… in __anonf25df3b00102() argument
55 EXPECT_NE(graph, nullptr); in __anonf25df3b00102()
56 EXPECT_TRUE(graph->RunPass<LoopAnalyzer>()); in __anonf25df3b00102()
73 …graph_test_.TestBuildGraphFromFile(pfile, [test_method_name, &status](Graph* graph, std::string &m… in __anonf25df3b00202() argument
78 EXPECT_NE(graph, nullptr); in __anonf25df3b00202()
79 for (auto bb : graph->GetBlocksRPO()) { in __anonf25df3b00202()
84 Loop loop(graph->GetAllocator(), bb->GetSuccessor(0), 1); in __anonf25df3b00202()
85 Loop other(graph->GetAllocator(), bb->GetSuccessor(0), 1); in __anonf25df3b00202()
107 …graph_test_.TestBuildGraphFromFile(pfile, [test_method_name, &status](Graph* graph, std::string &m… in __anonf25df3b00302() argument
112 EXPECT_NE(graph, nullptr); in __anonf25df3b00302()
[all …]
Dcompiler_inst_test.cpp78 …graph_test_.TestBuildGraphFromFile(pfile, [&test_method_name, &status](Graph* graph, std::string &… in __anon1be7da800102() argument
83 EXPECT_NE(graph, nullptr); in __anon1be7da800102()
85 for (auto bb : graph->GetBlocksRPO()) { in __anon1be7da800102()
92 save_state_inst->AllocateImmediates(graph->GetAllocator(), size); in __anon1be7da800102()
130 …graph_test_.TestBuildGraphFromFile(pfile, [&test_method_name, &status](Graph* graph, std::string &… in __anon1be7da800202() argument
135 EXPECT_NE(graph, nullptr); in __anon1be7da800202()
136 for (auto bb : graph->GetBlocksRPO()) { in __anon1be7da800202()
142 auto constInst = inst->Clone(graph); in __anon1be7da800202()
145 constInst = inst->Clone(graph); in __anon1be7da800202()
148 constInst = inst->Clone(graph); in __anon1be7da800202()
[all …]
Dunit_test.h118 …auto graph = GetAllocator()->New<Graph>(GetAllocator(), GetLocalAllocator(), arch_, is_dynamic, fa… variable
119 graph->CreateStartBlock();
120 graph->CreateEndBlock();
121 return graph;
133 auto graph = GetAllocator()->New<Graph>(GetAllocator(), GetLocalAllocator(), arch, false); in CreateEmptyFastpathGraph() local
134 graph->SetMode(GraphMode::FastPath()); in CreateEmptyFastpathGraph()
135 return graph; in CreateEmptyFastpathGraph()
138 BasicBlock *CreateEmptyBlock(Graph *graph) const in CreateEmptyBlock() argument
140 auto block = graph->GetAllocator()->New<BasicBlock>(graph); in CreateEmptyBlock()
141 graph->AddBlock(block); in CreateEmptyBlock()
[all …]
Dlinear_order_new_test.cpp50 …graph_test_.TestBuildGraphFromFile(pfile, [test_method_name, &status](Graph* graph, std::string &m… in __anond752aec70102() argument
55 EXPECT_NE(graph, nullptr); in __anond752aec70102()
56 EXPECT_TRUE(graph->RunPass<LinearOrder>()); in __anond752aec70102()
73 …graph_test_.TestBuildGraphFromFile(pfile, [test_method_name, &status](Graph* graph, std::string &m… in __anond752aec70202() argument
78 EXPECT_NE(graph, nullptr); in __anond752aec70202()
80 for (auto bb : graph->GetBlocksRPO()) { in __anond752aec70202()
82 graph->SetStartBlock(bb->GetSuccessor(1)); in __anond752aec70202()
85 EXPECT_TRUE(graph->RunPass<LinearOrder>()); in __anond752aec70202()
102 …graph_test_.TestBuildGraphFromFile(pfile, [test_method_name, &status](Graph* graph, std::string &m… in __anond752aec70302() argument
107 EXPECT_NE(graph, nullptr); in __anond752aec70302()
[all …]
Dcompiler_regalloc_test.cpp81 …graph_test_.TestBuildGraphFromFile(pfile, [&test_method_name, &status](Graph* graph, std::string &… in __anonfa4f11eb0302() argument
86 EXPECT_NE(graph, nullptr); in __anonfa4f11eb0302()
87 InterferenceGraph inter_graph(graph->GetAllocator()); in __anonfa4f11eb0302()
120 …graph_test_.TestBuildGraphFromFile(pfile, [&test_method_name, &status](Graph* graph, std::string &… in __anonfa4f11eb0402() argument
125 EXPECT_NE(graph, nullptr); in __anonfa4f11eb0402()
127 GraphMatrix graph_matrix(graph->GetAllocator()); in __anonfa4f11eb0402()
148 …graph_test_.TestBuildGraphFromFile(pfile, [&test_method_name, &status](Graph* graph, std::string &… in __anonfa4f11eb0502() argument
153 EXPECT_NE(graph, nullptr); in __anonfa4f11eb0502()
155 InterferenceGraph inter_graph(graph->GetAllocator()); in __anonfa4f11eb0502()
183 …graph_test_.TestBuildGraphFromFile(pfile, [&test_method_name, &status](Graph* graph, std::string &… in __anonfa4f11eb0602() argument
[all …]
Dcompiler_optimizations_test.cpp79 graph_test_.TestBuildGraphFromFile(pfile, [&test_method_name, &status, &status1](Graph* graph,
84 EXPECT_NE(graph, nullptr); in __anon87bf345c0102()
87 for (const auto &block : graph->GetVectorBlocks()) { in __anon87bf345c0102()
165 …graph_test_.TestBuildGraphFromFile(pfile, [&test_method_name, &status](Graph* graph, std::string &… in __anon87bf345c0202() argument
170 EXPECT_NE(graph, nullptr); in __anon87bf345c0202()
171 EXPECT_FALSE(graph->RunPass<ValNum>()); in __anon87bf345c0202()
172 ValNum vnum(graph); in __anon87bf345c0202()
173 for (const auto &block : graph->GetVectorBlocks()) { in __anon87bf345c0202()
201 …graph_test_.TestBuildGraphFromFile(pfile, [&test_method_name, &status](Graph* graph, std::string &… in __anon87bf345c0302() argument
206 EXPECT_NE(graph, nullptr); in __anon87bf345c0302()
[all …]
Ddominators_tree_new_test.cpp49 …graph_test_.TestBuildGraphFromFile(pfile, [test_method_name, &status](Graph* graph, std::string &m… in __anone12190200102() argument
54 EXPECT_NE(graph, nullptr); in __anone12190200102()
55 for (auto bb : graph->GetBlocksRPO()) { in __anone12190200102()
60 DominatorsTree dominators_tree(graph); in __anone12190200102()
84 …graph_test_.TestBuildGraphFromFile(pfile, [test_method_name, &status](Graph* graph, std::string &m… in __anone12190200202() argument
89 EXPECT_NE(graph, nullptr); in __anone12190200202()
90 for (auto bb : graph->GetBlocksRPO()) { in __anone12190200202()
95 DominatorsTree dominators_tree(graph); in __anone12190200202()
118 …graph_test_.TestBuildGraphFromFile(pfile, [test_method_name, &status](Graph* graph, std::string &m… in __anone12190200302() argument
123 EXPECT_NE(graph, nullptr); in __anone12190200302()
[all …]
Dgraph_checker_test.cpp58 …graphTest_.TestBuildGraphFromFile(pfile, [&test_method_name, &status](Graph* graph, std::string &m… in __anon0cd4934e0102() argument
63 EXPECT_NE(graph, nullptr); in __anon0cd4934e0102()
65 graph->InvalidateAnalysis<LoopAnalyzer>(); in __anon0cd4934e0102()
66 EXPECT_TRUE(graph->RunPass<LoopAnalyzer>()); in __anon0cd4934e0102()
67 GraphChecker gChecker(graph); in __anon0cd4934e0102()
Dreg_alloc_common_test.cpp25 void RunRegAllocatorsAndCheck(Graph *graph, Checker checker) const in RunRegAllocatorsAndCheck() argument
37 auto graph = CreateEmptyGraph(); in TestParametersLocations() local
39 GRAPH(graph) in TestParametersLocations()
69 GRAPH(graph) in TestParametersLocations()
100 RunRegAllocatorsAndCheck(graph, [type = reg_type](Graph *check_graph) { in TestParametersLocations()
157 auto graph = CreateEmptyGraph(); in TEST_F() local
158 GRAPH(graph) in TEST_F()
173 if (graph->GetArch() == Arch::AARCH32) { in TEST_F()
179 RunRegAllocatorsAndCheck(graph, [](Graph *check_graph) { in TEST_F()
194 auto graph = CreateEmptyGraph(); in TEST_F() local
[all …]
/arkcompiler/runtime_core/compiler/optimizer/ir_builder/
Dir_builder.h54 void Init(Graph *graph, uint32_t try_id) in Init()
57 auto allocator = graph->GetLocalAllocator(); in Init()
59 begin_bb = graph->CreateEmptyBlock(boundaries.begin_pc); in Init()
61 end_bb = graph->CreateEmptyBlock(boundaries.end_pc); in Init()
64 graph->AppendTryBeginBlock(begin_bb); in Init()
69 explicit IrBuilder(Graph *graph) : IrBuilder(graph, graph->GetMethod()) {} in IrBuilder() argument
71 IrBuilder(Graph *graph, RuntimeInterface::MethodPtr method) in IrBuilder() argument
72 : Optimization(graph), in IrBuilder()
73 blocks_(graph->GetLocalAllocator()->Adapter()), in IrBuilder()
74 catches_pc_(graph->GetLocalAllocator()->Adapter()), in IrBuilder()
[all …]
/arkcompiler/runtime_core/bytecode_optimizer/tests/
Dcodegen_test.cpp97 …graph_test_.TestBuildGraphFromFile(pfile, [test_method_name, &status](Graph* graph, std::string &m… in __anona44e78530102() argument
102 EXPECT_NE(graph, nullptr); in __anona44e78530102()
103 for (auto bb : graph->GetBlocksRPO()) { in __anona44e78530102()
110 BytecodeGen bc_gen(graph, function, interface, prog); in __anona44e78530102()
134 …graph_test_.TestBuildGraphFromFile(pfile, [test_method_name, &status](Graph* graph, std::string &m… in __anona44e78530202() argument
139 EXPECT_NE(graph, nullptr); in __anona44e78530202()
140 for (auto bb : graph->GetBlocksRPO()) { in __anona44e78530202()
148 BytecodeGen bc_gen(graph, function, interface, prog); in __anona44e78530202()
171 …graph_test_.TestBuildGraphFromFile(pfile, [test_method_name, &status](Graph* graph, std::string &m… in __anona44e78530302() argument
176 EXPECT_NE(graph, nullptr); in __anona44e78530302()
[all …]
Dreg_encoder_test.cpp52 …graph_test_.TestBuildGraphFromFile(pFile, [test_method_name, &status](Graph* graph, std::string &m… in __anonacbbb79b0102() argument
57 EXPECT_NE(graph, nullptr); in __anonacbbb79b0102()
58 EXPECT_TRUE(RegAlloc(graph)); in __anonacbbb79b0102()
59 EXPECT_TRUE(graph->RunPass<RegEncoder>()); in __anonacbbb79b0102()
76 …graph_test_.TestBuildGraphFromFile(pFile, [test_method_name, &status](Graph* graph, std::string &m… in __anonacbbb79b0202() argument
81 EXPECT_NE(graph, nullptr); in __anonacbbb79b0202()
82 EXPECT_TRUE(graph->RunPass<RegAccAlloc>()); in __anonacbbb79b0202()
Dconst_array_resolver_test.cpp23 auto graph = CreateEmptyGraph(); in TEST_F() local
24 GRAPH(graph) in TEST_F()
45 EXPECT_TRUE(graph->RunPass<ConstArrayResolver>(&interface)); in TEST_F()
61 EXPECT_TRUE(GraphComparator().Compare(graph, expected)); in TEST_F()
66 auto graph = CreateEmptyGraph(); in TEST_F() local
67 GRAPH(graph) in TEST_F()
88 EXPECT_TRUE(graph->RunPass<ConstArrayResolver>(&interface)); in TEST_F()
93 auto graph = CreateEmptyGraph(); in TEST_F() local
94 GRAPH(graph) in TEST_F()
126 EXPECT_TRUE(graph->RunPass<ConstArrayResolver>(&interface)); in TEST_F()
[all …]
/arkcompiler/runtime_core/bytecode_optimizer/
Doptimize_bytecode.cpp48 constexpr void RunOpts(compiler::Graph *graph) in RunOpts() argument
50 graph->RunPass<compiler::Cleanup>(); in RunOpts()
51 graph->RunPass<T>(); in RunOpts()
55 constexpr void RunOpts(compiler::Graph *graph) in RunOpts() argument
57 RunOpts<First>(graph); in RunOpts()
58 RunOpts<Second, Rest...>(graph); in RunOpts()
61 bool RunOptimizations(compiler::Graph *graph, BytecodeOptIrInterface *iface) in RunOptimizations() argument
69 graph->RunPass<compiler::Cleanup>(); in RunOptimizations()
70 ASSERT(graph->IsDynamicMethod()); in RunOptimizations()
71 RunOpts<compiler::ValNum, compiler::Lowering, compiler::MoveConstants>(graph); in RunOptimizations()
[all …]
/arkcompiler/runtime_core/compiler/optimizer/optimizations/
Dcleanup.h25 explicit Cleanup(Graph *graph) in Cleanup() argument
26 : Optimization(graph), in Cleanup()
27 empty1_(graph->GetLocalAllocator()->Adapter()), in Cleanup()
28 empty2_(graph->GetLocalAllocator()->Adapter()), in Cleanup()
29 saved_preds_(graph->GetLocalAllocator()->Adapter()), in Cleanup()
30 dead_(graph->GetLocalAllocator()->Adapter()), in Cleanup()
31 temp_(graph->GetLocalAllocator()->Adapter()), in Cleanup()
32 ancestors_(graph->GetLocalAllocator()->Adapter()), in Cleanup()
33 buckets_(graph->GetLocalAllocator()->Adapter()), in Cleanup()
34 idoms_(graph->GetLocalAllocator()->Adapter()), in Cleanup()
[all …]
/arkcompiler/runtime_core/compiler/optimizer/optimizations/regalloc/
Dreg_alloc_base.cpp29 RegAllocBase::RegAllocBase(Graph *graph) in RegAllocBase() argument
30 : RegAllocBase(graph, 0, 0, MAX_NUM_STACK_SLOTS) in RegAllocBase()
34 RegAllocBase::RegAllocBase(Graph *graph, const RegMask &reg_mask, const VRegMask &vreg_mask, size_t… in RegAllocBase() argument
35 : Optimization(graph), in RegAllocBase()
36 regs_mask_(graph->GetLocalAllocator()), in RegAllocBase()
37 vregs_mask_(graph->GetLocalAllocator()), in RegAllocBase()
38 stack_mask_(graph->GetLocalAllocator()), in RegAllocBase()
39 stack_use_last_positions_(graph->GetLocalAllocator()->Adapter()) in RegAllocBase()
46 RegAllocBase::RegAllocBase(Graph *graph, size_t regs_count) in RegAllocBase() argument
47 : Optimization(graph), in RegAllocBase()
[all …]
Dreg_alloc.cpp23 bool RegAlloc(Graph *graph) in RegAlloc() argument
25 graph->RunPass<Cleanup>(); in RegAlloc()
27 RegAllocResolver(graph).ResolveCatchPhis(); in RegAlloc()
28 return graph->RunPass<RegAllocGraphColoring>(VIRTUAL_FRAME_SIZE); in RegAlloc()
Dsplit_resolver.h25 …explicit SplitResolver(Graph *graph) : SplitResolver(graph, &graph->GetAnalysis<LivenessAnalyzer>(… in SplitResolver() argument
26 …explicit SplitResolver(Graph *graph, LivenessAnalyzer *liveness) : graph_(graph), liveness_(livene… in SplitResolver() argument
/arkcompiler/ets_runtime/ecmascript/compiler/
Dcode_generator.h32 virtual void GenerateCodeForStub(Circuit *circuit, const ControlFlowGraph &graph, size_t index,
35 …virtual void GenerateCode(Circuit *circuit, const ControlFlowGraph &graph, const CompilationConfig…
49 …void RunForStub(Circuit *circuit, const ControlFlowGraph &graph, size_t index, const CompilationCo… in RunForStub() argument
51 impl_->GenerateCodeForStub(circuit, graph, index, cfg); in RunForStub()
59 void Run(Circuit *circuit, const ControlFlowGraph &graph, const CompilationConfig *cfg, in Run() argument
62 impl_->GenerateCode(circuit, graph, cfg, methodLiteral, jsPandaFile, methodName_); in Run()
/arkcompiler/runtime_core/compiler/optimizer/templates/intrinsics/
Dgenerate_operations_intrinsic_graph.inl.erb19 auto graph = CreateGraphWithOneBasicBlock();
27 … intrinsic_inst->AppendInput(CreateParamInst(graph, DataType::<%= arg %>, <%= i %>));
35 ASSERT(graph->GetVectorBlocks().size() > 2);
36 auto block = graph->GetVectorBlocks()[2];
38 auto save_state = graph->CreateInstSaveState();
45 ret = graph->CreateInstReturnVoid();
47 ret = graph->CreateInstReturn();
52 return graph;

12345