Lines Matching refs:blks
140 AdjacencyListGraph blks(SetupFromAdjacencyList( in TEST_F() local
146 esg.RemoveBlock(blks.Get("left")); in TEST_F()
154 ASSERT_TRUE(contents.find(blks.Get("left")) == contents.end()); in TEST_F()
156 ASSERT_TRUE(contents.find(blks.Get("right")) != contents.end()); in TEST_F()
157 ASSERT_TRUE(contents.find(blks.Get("entry")) != contents.end()); in TEST_F()
158 ASSERT_TRUE(contents.find(blks.Get("exit")) != contents.end()); in TEST_F()
159 esg.RemoveBlock(blks.Get("right")); in TEST_F()
217 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", in TEST_F() local
233 esg.RemoveBlock(blks.Get("l2")); in TEST_F()
242 ASSERT_TRUE(contents.find(blks.Get("l1")) == contents.end()); in TEST_F()
243 ASSERT_TRUE(contents.find(blks.Get("l2")) == contents.end()); in TEST_F()
244 ASSERT_TRUE(contents.find(blks.Get("l3")) == contents.end()); in TEST_F()
245 ASSERT_TRUE(contents.find(blks.Get("l1l")) == contents.end()); in TEST_F()
246 ASSERT_TRUE(contents.find(blks.Get("l1r")) == contents.end()); in TEST_F()
247 ASSERT_TRUE(contents.find(blks.Get("l2l")) == contents.end()); in TEST_F()
248 ASSERT_TRUE(contents.find(blks.Get("l2r")) == contents.end()); in TEST_F()
251 ASSERT_TRUE(contents.find(blks.Get("right")) != contents.end()); in TEST_F()
252 ASSERT_TRUE(contents.find(blks.Get("entry")) != contents.end()); in TEST_F()
253 ASSERT_TRUE(contents.find(blks.Get("exit")) != contents.end()); in TEST_F()
285 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", in TEST_F() local
296 esg.RemoveBlock(blks.Get("l2")); in TEST_F()
306 ASSERT_TRUE(contents.find(blks.Get("l2")) == contents.end()); in TEST_F()
310 ASSERT_TRUE(contents.find(blks.Get("l1")) != contents.end()); in TEST_F()
311 ASSERT_TRUE(contents.find(blks.Get("l1loop")) != contents.end()); in TEST_F()
312 ASSERT_TRUE(contents.find(blks.Get("right")) != contents.end()); in TEST_F()
313 ASSERT_TRUE(contents.find(blks.Get("entry")) != contents.end()); in TEST_F()
314 ASSERT_TRUE(contents.find(blks.Get("exit")) != contents.end()); in TEST_F()
341 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", in TEST_F() local
352 esg.RemoveBlock(blks.Get("l1")); in TEST_F()
362 ASSERT_TRUE(contents.find(blks.Get("l1")) == contents.end()); in TEST_F()
363 ASSERT_TRUE(contents.find(blks.Get("l1loop")) == contents.end()); in TEST_F()
364 ASSERT_TRUE(contents.find(blks.Get("l2")) == contents.end()); in TEST_F()
367 ASSERT_TRUE(contents.find(blks.Get("right")) != contents.end()); in TEST_F()
368 ASSERT_TRUE(contents.find(blks.Get("entry")) != contents.end()); in TEST_F()
369 ASSERT_TRUE(contents.find(blks.Get("exit")) != contents.end()); in TEST_F()
396 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", in TEST_F() local
407 esg.RemoveBlock(blks.Get("l1loop")); in TEST_F()
418 ASSERT_TRUE(contents.find(blks.Get("l1loop")) == contents.end()); in TEST_F()
419 ASSERT_TRUE(contents.find(blks.Get("l1")) == contents.end()); in TEST_F()
420 ASSERT_TRUE(contents.find(blks.Get("l2")) == contents.end()); in TEST_F()
423 ASSERT_TRUE(contents.find(blks.Get("right")) != contents.end()); in TEST_F()
424 ASSERT_TRUE(contents.find(blks.Get("entry")) != contents.end()); in TEST_F()
425 ASSERT_TRUE(contents.find(blks.Get("exit")) != contents.end()); in TEST_F()
467 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", in TEST_F() local
482 esg.RemoveBlock(blks.Get("l1loop_left")); in TEST_F()
493 ASSERT_TRUE(contents.find(blks.Get("l1loop")) == contents.end()); in TEST_F()
494 ASSERT_TRUE(contents.find(blks.Get("l1")) == contents.end()); in TEST_F()
495 ASSERT_TRUE(contents.find(blks.Get("l1loop_left")) == contents.end()); in TEST_F()
496 ASSERT_TRUE(contents.find(blks.Get("l1loop_right")) == contents.end()); in TEST_F()
497 ASSERT_TRUE(contents.find(blks.Get("l1loop_merge")) == contents.end()); in TEST_F()
498 ASSERT_TRUE(contents.find(blks.Get("l2")) == contents.end()); in TEST_F()
501 ASSERT_TRUE(contents.find(blks.Get("right")) != contents.end()); in TEST_F()
502 ASSERT_TRUE(contents.find(blks.Get("entry")) != contents.end()); in TEST_F()
503 ASSERT_TRUE(contents.find(blks.Get("exit")) != contents.end()); in TEST_F()
535 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", in TEST_F() local
549 esg.RemoveBlock(blks.Get("l1loop_left")); in TEST_F()
560 ASSERT_TRUE(contents.find(blks.Get("l1loop")) == contents.end()); in TEST_F()
561 ASSERT_TRUE(contents.find(blks.Get("l1")) == contents.end()); in TEST_F()
562 ASSERT_TRUE(contents.find(blks.Get("l1loop_left")) == contents.end()); in TEST_F()
563 ASSERT_TRUE(contents.find(blks.Get("l1loop_right")) == contents.end()); in TEST_F()
564 ASSERT_TRUE(contents.find(blks.Get("l2")) == contents.end()); in TEST_F()
567 ASSERT_TRUE(contents.find(blks.Get("right")) != contents.end()); in TEST_F()
568 ASSERT_TRUE(contents.find(blks.Get("entry")) != contents.end()); in TEST_F()
569 ASSERT_TRUE(contents.find(blks.Get("exit")) != contents.end()); in TEST_F()
573 AdjacencyListGraph blks(SetupFromAdjacencyList( in TEST_F() local
579 esg.RemoveBlock(blks.Get("left")); in TEST_F()
580 esg.RemoveBlock(blks.Get("right")); in TEST_F()
592 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", in TEST_F() local
602 esg.RemoveBlock(blks.Get("a")); in TEST_F()
603 esg.RemoveBlock(blks.Get("c")); in TEST_F()
612 ASSERT_TRUE(contents.find(blks.Get("a")) == contents.end()); in TEST_F()
613 ASSERT_TRUE(contents.find(blks.Get("c")) == contents.end()); in TEST_F()
616 ASSERT_TRUE(contents.find(blks.Get("entry")) != contents.end()); in TEST_F()
617 ASSERT_TRUE(contents.find(blks.Get("exit")) != contents.end()); in TEST_F()
618 ASSERT_TRUE(contents.find(blks.Get("b")) != contents.end()); in TEST_F()
622 std::unordered_set<const HBasicBlock*> exclude_a({ blks.Get("a") }); in TEST_F()
623 std::unordered_set<const HBasicBlock*> exclude_c({ blks.Get("c") }); in TEST_F()
691 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", in TEST_F() local
707 esg.RemoveBlock(blks.Get("a")); in TEST_F()
708 esg.RemoveBlock(blks.Get("c_mid")); in TEST_F()
717 ASSERT_TRUE(contents.find(blks.Get("a")) == contents.end()); in TEST_F()
718 ASSERT_TRUE(contents.find(blks.Get("c_begin_1")) == contents.end()); in TEST_F()
719 ASSERT_TRUE(contents.find(blks.Get("c_begin_2")) == contents.end()); in TEST_F()
720 ASSERT_TRUE(contents.find(blks.Get("c_mid")) == contents.end()); in TEST_F()
721 ASSERT_TRUE(contents.find(blks.Get("c_end_1")) == contents.end()); in TEST_F()
722 ASSERT_TRUE(contents.find(blks.Get("c_end_2")) == contents.end()); in TEST_F()
725 ASSERT_TRUE(contents.find(blks.Get("entry")) != contents.end()); in TEST_F()
726 ASSERT_TRUE(contents.find(blks.Get("exit")) != contents.end()); in TEST_F()
727 ASSERT_TRUE(contents.find(blks.Get("b")) != contents.end()); in TEST_F()
731 BlockSet exclude_a({ blks.Get("a") }); in TEST_F()
732 BlockSet exclude_c({ blks.Get("c_begin_1"), in TEST_F()
733 blks.Get("c_begin_2"), in TEST_F()
734 blks.Get("c_mid"), in TEST_F()
735 blks.Get("c_end_1"), in TEST_F()
736 blks.Get("c_end_2") }); in TEST_F()
746 BlockSet({ blks.Get("c_begin_1"), blks.Get("c_begin_2") }) == it.EntryBlocks() && in TEST_F()
747 BlockSet({ blks.Get("c_end_1"), blks.Get("c_end_2") }) == it.ExitBlocks(); in TEST_F()
779 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", in TEST_F() local
791 esg.RemoveBlock(blks.Get("esc_top")); in TEST_F()
792 esg.RemoveBlock(blks.Get("esc_bottom")); in TEST_F()
818 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", "exit", edges)); in TEST_F() local
828 EXPECT_TRUE(contents.find(blks.Get(mid)) != contents.end()) << mid; in TEST_F()
847 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", "exit", edges)); in TEST_F() local
850 esg.RemoveBlock(blks.Get("blk2")); in TEST_F()
851 esg.RemoveBlock(blks.Get("blk4")); in TEST_F()
861 ASSERT_TRUE(contents.find(blks.Get("blk2")) == contents.end()); in TEST_F()
862 ASSERT_TRUE(contents.find(blks.Get("blk4")) == contents.end()); in TEST_F()
878 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", "exit", edges)); in TEST_F() local
882 esg.RemoveBlock(blks.Get(mid)); in TEST_F()
907 AdjacencyListGraph blks(SetupFromAdjacencyList(mid_blocks.front(), mid_blocks.back(), edges)); in TEST_F() local
938 AdjacencyListGraph blks(SetupFromAdjacencyList(mid_blocks.front(), mid_blocks.back(), edges)); in TEST_F() local
942 HBasicBlock* remove_implicit = blks.Get(mid_blocks[kToRemoveIdx]); in TEST_F()
955 EXPECT_TRUE(contents.find(blks.Get(mid_blocks.front())) != contents.end()); in TEST_F()
956 EXPECT_TRUE(contents.find(blks.Get(mid_blocks.back())) != contents.end()); in TEST_F()
972 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", "exit", edges)); in TEST_F() local