Home
last modified time | relevance | path

Searched refs:graph1 (Results 1 - 18 of 18) sorted by relevance

/arkcompiler/runtime_core/compiler/tests/
H A Dgraph_comparator_test.cpp63 // graph1 and graph2 is equal but have different ids in TEST_F()
64 auto graph1 = CreateEmptyGraph(); in TEST_F() local
65 GRAPH(graph1) in TEST_F()
92 ASSERT_TRUE(GraphComparator().Compare(graph1, graph2)); in TEST_F()
97 // graph1 and graph2 is equal but have different ids in TEST_F()
98 auto graph1 = CreateEmptyGraph(); in TEST_F() local
99 GRAPH(graph1) in TEST_F()
146 ASSERT_TRUE(GraphComparator().Compare(graph1, graph2)); in TEST_F()
151 auto graph1 = CreateGraph({{3, 4}, {5, 6}, {6, 7}}); in TEST_F() local
157 ASSERT_TRUE(GraphComparator().Compare(graph1, graph in TEST_F()
176 auto graph1 = CreateEmptyGraph(); TEST_F() local
[all...]
H A Dgraph_comparator.h30 bool Compare(Graph *graph1, Graph *graph2) in Compare() argument
32 ASSERT(graph1 != nullptr); in Compare()
34 graph1->InvalidateAnalysis<Rpo>(); in Compare()
36 if (graph1->GetBlocksRPO().size() != graph2->GetBlocksRPO().size()) { in Compare()
40 for (auto it1 = graph1->GetBlocksRPO().begin(), it2 = graph2->GetBlocksRPO().begin(); in Compare()
41 it1 != graph1->GetBlocksRPO().end(); it1++, it2++) { in Compare()
47 return std::equal(graph1->GetBlocksRPO().begin(), graph1->GetBlocksRPO().end(), graph2->GetBlocksRPO().begin(), in Compare()
H A Dcompiler_graph_test.cpp476 GraphMode graph1(arg1); in HWTEST_F()
477 graph1.Osr(true); in HWTEST_F()
480 graph1.Dump(out); in HWTEST_F()
488 EXPECT_FALSE(graph1.SupportManagedCode()); in HWTEST_F()
518 GraphMode graph1(arg1); in HWTEST_F()
519 graph1.SetNative(false); in HWTEST_F()
520 graph1.SetFastPath(false); in HWTEST_F()
521 graph1.SetBoundary(false); in HWTEST_F()
522 graph1.SetInterpreter(false); in HWTEST_F()
523 graph1 in HWTEST_F()
[all...]
H A Dgraph_cloner_test.cpp65 auto graph1 = CreateEmptyGraph(); in TEST_F() local
66 GRAPH(graph1) in TEST_F()
120 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); in TEST_F() local
164 auto graph1 = CreateEmptyGraph(); in TEST_F() local
165 GRAPH(graph1) in TEST_F()
225 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); in TEST_F() local
354 auto graph1 = CreateEmptyGraph(); in TEST_F() local
355 GRAPH(graph1) in TEST_F()
406 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); in TEST_F() local
H A Dbasicblock_test.cpp392 auto graph1 = CreateEmptyGraph(); in TEST_F() local
393 GRAPH(graph1) in TEST_F()
427 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); in TEST_F() local
/arkcompiler/runtime_core/static_core/compiler/tests/
H A Dgraph_comparator_test.cpp67 // graph1 and graph2 is equal but have different ids in TEST_F()
68 auto graph1 = CreateEmptyGraph(); in TEST_F() local
69 GRAPH(graph1) in TEST_F()
96 ASSERT_TRUE(GraphComparator().Compare(graph1, graph2)); in TEST_F()
101 auto graph1 = CreateEmptyGraph(); in CreateComparePhi1Graph1() local
102 GRAPH(graph1) in CreateComparePhi1Graph1()
125 return graph1; in CreateComparePhi1Graph1()
130 // graph1 and graph2 is equal but have different ids in TEST_F()
131 auto graph1 = CreateComparePhi1Graph1(); in TEST_F() local
156 ASSERT_TRUE(GraphComparator().Compare(graph1, graph in TEST_F()
161 auto graph1 = CreateGraph({{3U, 4U}, {5U, 6U}, {6U, 7U}}); TEST_F() local
186 auto graph1 = CreateEmptyGraph(); CreateDifferentInstCountGraph1() local
217 auto graph1 = CreateDifferentInstCountGraph1(); TEST_F() local
[all...]
H A Dgraph_comparator.h26 bool Compare(Graph *graph1, Graph *graph2) in Compare() argument
28 graph1->InvalidateAnalysis<Rpo>(); in Compare()
30 if (graph1->GetBlocksRPO().size() != graph2->GetBlocksRPO().size()) { in Compare()
34 for (auto it1 = graph1->GetBlocksRPO().begin(), it2 = graph2->GetBlocksRPO().begin(); in Compare()
35 it1 != graph1->GetBlocksRPO().end(); it1++, it2++) { in Compare()
41 return std::equal(graph1->GetBlocksRPO().begin(), graph1->GetBlocksRPO().end(), graph2->GetBlocksRPO().begin(), in Compare()
H A Dgraph_cloner_test.cpp130 auto graph1 = CreateEmptyGraph(); in TEST_F() local
131 out_graph::LoopCopingSimpleLoop::CREATE(graph1); in TEST_F()
132 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); in TEST_F() local
246 auto graph1 = CreateEmptyGraph(); in TEST_F() local
247 out_graph::LoopCopingLoopSum::CREATE(graph1); in TEST_F()
248 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); in TEST_F() local
438 auto graph1 = CreateEmptyGraph(); in TEST_F() local
439 out_graph::LoopCopingWithoutIndexResolver::CREATE(graph1); in TEST_F()
440 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); in TEST_F() local
H A Dpeepholes_test.cpp49 auto graph1 = CreateEmptyGraph(); in CheckCompare() local
50 GRAPH(graph1) in CheckCompare()
64 graph1->RunPass<Peepholes>(); in CheckCompare()
65 GraphChecker(graph1).Check(); in CheckCompare()
82 ASSERT_TRUE(GraphComparator().Compare(graph1, graph2)); in CheckCompare()
126 auto graph1 = CreateEmptyGraph(); in CheckCast() local
127 GRAPH(graph1) in CheckCast()
167 ASSERT_EQ(graph1->RunPass<Peepholes>(), applied); in CheckCast()
168 ASSERT_TRUE(GraphComparator().Compare(graph1, graph2)); in CheckCast()
216 auto graph1 in CheckCast() local
1793 auto graph1 = CreateEmptyGraph(); TEST_F() local
3034 auto graph1 = CreateEmptyGraph(); TEST_F() local
3071 auto graph1 = CreateEmptyGraph(); TEST_F() local
3110 auto graph1 = CreateEmptyGraph(); TEST_F() local
4307 auto graph1 = CreateEmptyGraph(); TEST_F() local
5465 auto graph1 = CreateEmptyGraph(); TEST_F() local
5496 auto graph1 = CreateEmptyGraph(); TEST_F() local
5527 auto graph1 = CreateEmptyGraph(); TEST_F() local
5560 auto graph1 = CreateEmptyGraph(); TEST_F() local
5594 auto graph1 = CreateEmptyGraph(); TEST_F() local
5624 auto graph1 = CreateEmptyGraph(); TEST_F() local
5655 auto graph1 = CreateEmptyGraph(); TEST_F() local
6410 auto graph1 = CreateEmptyGraph(); TEST_F() local
6442 auto graph1 = CreateEmptyGraph(); TEST_F() local
6474 auto graph1 = CreateEmptyGraph(); TEST_F() local
6506 auto graph1 = CreateEmptyGraph(); TEST_F() local
6538 auto graph1 = CreateEmptyGraph(); TEST_F() local
6570 auto graph1 = CreateEmptyGraph(); TEST_F() local
[all...]
H A Dredundant_loop_elimination_test.cpp595 auto graph1 = CreateEmptyGraph(); in TEST_F() local
596 GRAPH(graph1) in TEST_F()
618 ASSERT_TRUE(graph1->RunPass<RedundantLoopElimination>()); in TEST_F()
632 ASSERT_TRUE(GraphComparator().Compare(graph1, graph2)); in TEST_F()
639 auto graph1 = CreateEmptyGraph(); in TEST_F() local
640 GRAPH(graph1) in TEST_F()
661 auto graph2 = GraphCloner(graph1, graph1->GetAllocator(), graph1->GetLocalAllocator()).CloneGraph(); in TEST_F()
662 ASSERT_FALSE(graph1 in TEST_F()
[all...]
H A Dlicm_test.cpp883 auto graph1 = CreateEmptyGraph(); in TEST_F() local
884 GRAPH(graph1) in TEST_F()
909 ASSERT_TRUE(GraphComparator().Compare(graph, graph1)); in TEST_F()
943 auto graph1 = CreateEmptyGraph(); in TEST_F() local
944 GRAPH(graph1) in TEST_F()
969 ASSERT_TRUE(GraphComparator().Compare(graph, graph1)); in TEST_F()
1007 auto graph1 = CreateEmptyGraph(); in TEST_F() local
1008 graph1->SetDynamicMethod(); in TEST_F()
1010 graph1->SetDynUnitTestFlag(); in TEST_F()
1012 GRAPH(graph1) in TEST_F()
1077 auto graph1 = CreateEmptyGraph(); TEST_F() local
[all...]
H A Dchecks_elimination_test.cpp43 auto graph1 = CreateEmptyGraph(); in SimpleTest() local
44 GRAPH(graph1) in SimpleTest()
58 graph1->RunPass<ChecksElimination>(); in SimpleTest()
89 ASSERT_TRUE(GraphComparator().Compare(graph1, graph2)); in SimpleTest()
164 auto graph1 = ArithmeticTestInput(index, arrayLen, opc, val); in ArithmeticTest() local
165 auto clone = GraphCloner(graph1, graph1->GetAllocator(), graph1->GetLocalAllocator()).CloneGraph(); in ArithmeticTest()
166 bool result = graph1->RunPass<ChecksElimination>(); in ArithmeticTest()
177 ASSERT_TRUE(GraphComparator().Compare(graph1, (APPLIED_TYP in ArithmeticTest()
250 auto graph1 = ModTestInput(arrayLen, mod); ModTest() local
354 auto graph1 = PhiTestInput(index, lenArray, mod); PhiTest() local
2210 auto graph1 = CreateEmptyGraph(); TEST_F() local
2247 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); TEST_F() local
2293 auto graph1 = CreateEmptyGraph(); TEST_F() local
2372 auto graph1 = CreateEmptyGraph(); TEST_F() local
2408 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); TEST_F() local
2454 auto graph1 = CreateEmptyGraph(); TEST_F() local
2490 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); TEST_F() local
2538 auto graph1 = CreateEmptyGraph(); TEST_F() local
2582 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); TEST_F() local
2663 auto graph1 = CreateEmptyGraph(); TEST_F() local
2697 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); TEST_F() local
2740 auto graph1 = CreateEmptyGraph(); TEST_F() local
2777 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); TEST_F() local
2821 auto graph1 = CreateEmptyGraph(); TEST_F() local
2855 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); TEST_F() local
2911 auto graph1 = CreateEmptyGraph(); TEST_F() local
2959 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); TEST_F() local
3028 auto graph1 = CreateEmptyGraph(); TEST_F() local
3091 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); TEST_F() local
3246 auto graph1 = CreateEmptyGraph(); TEST_F() local
3281 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); TEST_F() local
3334 auto graph1 = CreateEmptyGraph(); TEST_F() local
3383 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); TEST_F() local
3405 auto graph1 = CreateEmptyGraph(); TEST_F() local
3422 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); TEST_F() local
3444 auto graph1 = CreateEmptyGraph(); TEST_F() local
3461 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); TEST_F() local
3508 auto graph1 = CreateEmptyGraph(); TEST_F() local
3555 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); TEST_F() local
3596 auto graph1 = CreateEmptyGraph(); TEST_F() local
3630 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); TEST_F() local
3694 auto graph1 = CreateEmptyGraph(); TEST_F() local
3710 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); TEST_F() local
4054 auto graph1 = CreateEmptyGraph(); TEST_F() local
4091 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); TEST_F() local
4260 auto graph1 = CreateEmptyGraph(); TEST_F() local
4297 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); TEST_F() local
4339 auto graph1 = CreateEmptyGraph(); TEST_F() local
4376 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); TEST_F() local
4422 auto graph1 = CreateEmptyGraph(); TEST_F() local
4470 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); TEST_F() local
4516 auto graph1 = CreateEmptyGraph(); TEST_F() local
4566 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); TEST_F() local
4633 auto graph1 = CreateEmptyGraph(); TEST_F() local
4689 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); TEST_F() local
4753 auto graph1 = CreateEmptyGraph(); TEST_F() local
4807 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); TEST_F() local
5641 auto graph1 = CreateEmptyGraph(); TEST_F() local
5670 auto graph1 = CreateEmptyGraph(); TEST_F() local
5704 auto graph1 = CreateEmptyGraph(); TEST_F() local
[all...]
H A Dlowering_test.cpp2629 auto graph1 = CreateEmptyLowLevelGraph(); in TEST_F() local
2630 GRAPH(graph1) in TEST_F()
2643 ASSERT_TRUE(graph1->RunPass<Lowering>()); in TEST_F()
2644 graph1->RunPass<Cleanup>(); in TEST_F()
2658 ASSERT_TRUE(GraphComparator().Compare(graph1, graph2)); in TEST_F()
2665 auto graph1 = CreateEmptyLowLevelGraph(); in TEST_F() local
2666 GRAPH(graph1) in TEST_F()
2680 ASSERT_TRUE(graph1->RunPass<Lowering>()); in TEST_F()
2681 graph1->RunPass<Cleanup>(); in TEST_F()
2683 auto typeSize = DataType::GetTypeSize(type, graph1 in TEST_F()
2710 auto graph1 = CreateEmptyLowLevelGraph(); TEST_F() local
2756 auto graph1 = CreateEmptyLowLevelGraph(); TEST_F() local
2803 auto graph1 = CreateEmptyLowLevelGraph(); TEST_F() local
[all...]
H A Dlinear_order_test.cpp271 auto graph1 = CreateGraphWithDefaultRuntime(); in TEST_F() local
272 GRAPH(graph1) in TEST_F()
292 const auto &blocks1 = graph1->GetBlocksLinearOrder(); in TEST_F()
H A Dbasicblock_test.cpp436 auto graph1 = CreateEmptyGraph(); in TEST_F() local
437 GRAPH(graph1) in TEST_F()
471 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph1)); in TEST_F() local
542 auto *graph1 = IfLikelyUnlikelyTestBuildGraph(); in TEST_F() local
544 const auto &blocks1 = graph1->GetBlocksLinearOrder(); in TEST_F()
H A Dvn_test.cpp1519 auto graph1 = CreateGraphWithDefaultRuntime(); in TEST_F() local
1520 GRAPH(graph1) in TEST_F()
1529 GraphChecker(graph1).Check(); in TEST_F()
1530 ASSERT_TRUE(graph1->RunPass<ValNum>()); in TEST_F()
1583 auto graph1 = CreateGraphWithDefaultRuntime(); in TEST_F() local
1584 GRAPH(graph1) in TEST_F()
1593 GraphChecker(graph1).Check(); in TEST_F()
1594 ASSERT_TRUE(graph1->RunPass<ValNum>()); in TEST_F()
1657 auto graph1 = CreateGraphWithDefaultRuntime(); in TEST_F() local
1658 graph1 in TEST_F()
1895 auto graph1 = CreateGraphWithDefaultRuntime(); TEST_F() local
1962 auto graph1 = CreateGraphWithDefaultRuntime(); TEST_F() local
[all...]
/arkcompiler/runtime_core/bytecode_optimizer/tests/
H A Dcommon.h273 bool Compare(Graph *graph1, Graph *graph2) in Compare() argument
275 graph1->InvalidateAnalysis<compiler::Rpo>(); in Compare()
277 if (graph1->GetBlocksRPO().size() != graph2->GetBlocksRPO().size()) { in Compare()
278 std::cerr << "Different number of blocks: " << graph1->GetBlocksRPO().size() << " and " in Compare()
282 return std::equal(graph1->GetBlocksRPO().begin(), graph1->GetBlocksRPO().end(), graph2->GetBlocksRPO().begin(), in Compare()
/arkcompiler/runtime_core/static_core/bytecode_optimizer/tests/
H A Dcommon.h282 bool Compare(Graph *graph1, Graph *graph2) in Compare() argument
284 graph1->InvalidateAnalysis<compiler::Rpo>(); in Compare()
286 if (graph1->GetBlocksRPO().size() != graph2->GetBlocksRPO().size()) { in Compare()
287 std::cerr << "Different number of blocks: " << graph1->GetBlocksRPO().size() << " and " in Compare()
291 return std::equal(graph1->GetBlocksRPO().begin(), graph1->GetBlocksRPO().end(), graph2->GetBlocksRPO().begin(), in Compare()

Completed in 23 milliseconds