Home
last modified time | relevance | path

Searched refs:blks (Results 1 – 4 of 4) sorted by relevance

/art/compiler/optimizing/
Dinstruction_simplifier_test.cc55 void PerformSimplification(const AdjacencyListGraph& blks) { in PerformSimplification() argument
57 LOG(INFO) << "Pre simplification " << blks; in PerformSimplification()
64 LOG(INFO) << "Post simplify " << blks; in PerformSimplification()
151 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", in TEST_P() local
158 #define GET_BLOCK(name) HBasicBlock* name = blks.Get(#name) in TEST_P()
210 PerformSimplification(blks); in TEST_P()
232 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", "exit", {{"entry", "exit"}})); in TEST_P() local
233 #define GET_BLOCK(name) HBasicBlock* name = blks.Get(#name) in TEST_P()
269 PerformSimplification(blks); in TEST_P()
Dload_store_analysis_test.cc221 AdjacencyListGraph blks( in TEST_F() local
223 HBasicBlock* body = blks.Get("body"); in TEST_F()
725 AdjacencyListGraph blks(SetupFromAdjacencyList( in TEST_F() local
729 HBasicBlock* entry = blks.Get("entry"); in TEST_F()
730 HBasicBlock* left = blks.Get("left"); in TEST_F()
731 HBasicBlock* right = blks.Get("right"); in TEST_F()
732 HBasicBlock* exit = blks.Get("exit"); in TEST_F()
829 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", "exit", { { "entry", "exit" } })); in TEST_F() local
830 HBasicBlock* entry = blks.Get("entry"); in TEST_F()
831 HBasicBlock* exit = blks.Get("exit"); in TEST_F()
[all …]
Doptimizing_unit_test.h675 std::variant<std::nullopt_t, HBasicBlock*, std::initializer_list<HBasicBlock*>> blks =
681 if (std::holds_alternative<std::initializer_list<HBasicBlock*>>(blks)) {
682 for (HBasicBlock* blk : std::get<std::initializer_list<HBasicBlock*>>(blks)) {
685 } else if (std::holds_alternative<std::nullopt_t>(blks)) {
688 vis.VisitBasicBlock(std::get<HBasicBlock*>(blks));
696 std::variant<std::nullopt_t, HBasicBlock*, std::initializer_list<HBasicBlock*>> blks =
704 if (std::holds_alternative<std::initializer_list<HBasicBlock*>>(blks)) {
705 for (HBasicBlock* blk : std::get<std::initializer_list<HBasicBlock*>>(blks)) {
708 } else if (std::holds_alternative<std::nullopt_t>(blks)) {
711 vis.VisitBasicBlock(std::get<HBasicBlock*>(blks));
[all …]
Dload_store_elimination_test.cc79 void PerformLSE(const AdjacencyListGraph& blks) { in PerformLSE() argument
84 LOG(INFO) << "Pre LSE " << blks; in PerformLSE()
88 LOG(INFO) << "Post LSE " << blks; in PerformLSE()
1773 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", in TEST_F() local
1791 #define GET_BLOCK(name) HBasicBlock* name = blks.Get(#name) in TEST_F()
1882 PerformLSE(blks); in TEST_F()
1910 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", in TEST_F() local
1917 HBasicBlock* entry = blks.Get("entry"); in TEST_F()
1918 HBasicBlock* left = blks.Get("left"); in TEST_F()
1919 HBasicBlock* right = blks.Get("right"); in TEST_F()
[all …]