Home
last modified time | relevance | path

Searched refs:LexBFS (Results 1 - 8 of 8) sorted by relevance

/arkcompiler/runtime_core/compiler/tests/
H A Dreg_alloc_interference_graph_test.cpp154 auto peo = gr.LexBFS(); in TEST_F()
160 TEST_F(RegAllocInterferenceTest, LexBFS) in TEST_F()
176 auto peo = gr.LexBFS(); in TEST_F()
H A Dreg_alloc_interference_graph_new_test.cpp273 * @tc.desc: Verify the LexBFS function of InterferenceGraph in simple case.
287 auto peo = ig.LexBFS(); in HWTEST_F()
295 * @tc.desc: Verify the LexBFS function of InterferenceGraph.
319 auto peo = ig.LexBFS(); in HWTEST_F()
H A Dcompiler_regalloc_test.cpp312 * @tc.desc: Verify the LexBFS function.
334 auto peo = gr.LexBFS(); in HWTEST_F()
371 auto peo = gr.LexBFS(); in HWTEST_F()
/arkcompiler/runtime_core/compiler/optimizer/optimizations/regalloc/
H A Dinterference_graph.cpp83 ArenaVector<unsigned> InterferenceGraph::LexBFS() const in LexBFS() function in panda::compiler::InterferenceGraph
139 const auto &peo = LexBFS();
H A Dinterference_graph.h243 // Build LexBFS, so reverse order gives minimal coloring
244 ArenaVector<unsigned> LexBFS() const;
/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/regalloc/
H A Dinterference_graph.cpp69 ArenaVector<unsigned> InterferenceGraph::LexBFS() const in LexBFS() function in ark::compiler::InterferenceGraph
154 const auto &peo = LexBFS();
H A Dinterference_graph.h274 // Build LexBFS, so reverse order gives minimal coloring
275 ArenaVector<unsigned> LexBFS() const;
/arkcompiler/runtime_core/static_core/compiler/tests/
H A Dreg_alloc_interference_graph_test.cpp142 auto peo = gr.LexBFS(); in TEST_F()
170 TEST_F(RegAllocInterferenceTest, LexBFS) in TEST_F()
186 auto peo = gr.LexBFS(); in TEST_F()

Completed in 6 milliseconds