Lines Matching defs:DT

55   DominatorTree DT(*F);
57   DomTreeUpdater DTU(DT, PDT, DomTreeUpdater::UpdateStrategy::Eager);
115   ASSERT_TRUE(DT.verify());
123   ASSERT_TRUE(DT.verify());
129   EXPECT_TRUE(DT.verify());
143   ASSERT_FALSE(DT.verify());
146   ASSERT_TRUE(DT.verify());
166   DominatorTree DT(*F);
168   DomTreeUpdater DTU(DT, PDT, DomTreeUpdater::UpdateStrategy::Eager);
173   ASSERT_TRUE(DT.verify());
191   ASSERT_TRUE(DT.verify());
204   ASSERT_TRUE(DT.verify());
211   ASSERT_TRUE(DT.verify());
240   DominatorTree DT(*F);
242   DomTreeUpdater DTU(&DT, PDT, DomTreeUpdater::UpdateStrategy::Lazy);
329   DominatorTree DT(*F);
331   DomTreeUpdater DTU(&DT, PDT, DomTreeUpdater::UpdateStrategy::Lazy);
415   // BB3} because the edge previously existed at the start of this test when DT
425   ASSERT_TRUE(DT.verify());
453   DominatorTree DT(*F);
455   DomTreeUpdater DTU(&DT, &PDT, DomTreeUpdater::UpdateStrategy::Lazy);
536   DominatorTree DT(*F);
538   DomTreeUpdater DTU(DT, PDT, DomTreeUpdater::UpdateStrategy::Lazy);
558   // recalculate() call below will not actually recalculate the DT as there
578   ASSERT_TRUE(DT.verify());
590   // do this to test the case when there are no pending DT updates but there are
599   // updates and DT/PDT not flushed together.
625   DominatorTree DT(*F);
627   DomTreeUpdater DTU(DT, PDT, DomTreeUpdater::UpdateStrategy::Lazy);
697   ASSERT_TRUE(DT.verify());
744   DominatorTree DT(*F);
745   DomTreeUpdater DTU(&DT, nullptr, DomTreeUpdater::UpdateStrategy::Lazy);
817   DominatorTree DT(*F);
818   DomTreeUpdater DTU(&DT, nullptr, DomTreeUpdater::UpdateStrategy::Lazy);