Lines Matching refs:D3
260 LazyCallGraph::Node &D3 = (I++)->getNode(); in TEST() local
261 EXPECT_EQ("d3", D3.getFunction().getName()); in TEST()
317 D3.populate(); in TEST()
318 EXPECT_EQ(D3->end(), std::next(D3->begin())); in TEST()
319 EXPECT_EQ("d1", D3->begin()->getFunction().getName()); in TEST()
770 LazyCallGraph::Node &D3 = *CG.lookup(lookupFunction(*M, "d3")); in TEST() local
782 ASSERT_EQ(&DRC, CG.lookupRefSCC(D3)); in TEST()
801 if (&E.getNode() == &D3) in TEST()
821 EXPECT_EQ(&CRC, CG.lookupRefSCC(D3)); in TEST()
862 LazyCallGraph::Node &D3 = *CG.lookup(lookupFunction(*M, "d3")); in TEST() local
874 ASSERT_EQ(&DRC, CG.lookupRefSCC(D3)); in TEST()
893 if (&E.getNode() == &D3) in TEST()
913 EXPECT_EQ(&CRC, CG.lookupRefSCC(D3)); in TEST()
1108 LazyCallGraph::Node &D3 = *CG.lookup(lookupFunction(*M, "d3")); in TEST() local
1120 ASSERT_EQ(&DRC, CG.lookupRefSCC(D3)); in TEST()
1156 C1Call->setCalledFunction(&D3.getFunction()); in TEST()
1157 D1Call->setCalledFunction(&D3.getFunction()); in TEST()
1161 CRC.insertTrivialCallEdge(C1, D3); in TEST()
1162 DRC.insertTrivialCallEdge(D1, D3); in TEST()
1171 EXPECT_EQ(&NewDC, CG.lookupSCC(D3)); in TEST()
1176 EXPECT_EQ(&NewDRC, CG.lookupRefSCC(D3)); in TEST()
1202 EXPECT_EQ(&NewDRC, CG.lookupRefSCC(D3)); in TEST()