Cross Reference: /external/llvm/unittests/Analysis/LazyCallGraphTest.cpp

Lines Matching refs:Node
128   // the IR, and everything in our module is an entry node, so just directly
129   // build variables for each node.
131   LazyCallGraph::Node &A1 = *I++;
133   LazyCallGraph::Node &A2 = *I++;
135   LazyCallGraph::Node &A3 = *I++;
137   LazyCallGraph::Node &B1 = *I++;
139   LazyCallGraph::Node &B2 = *I++;
141   LazyCallGraph::Node &B3 = *I++;
143   LazyCallGraph::Node &C1 = *I++;
145   LazyCallGraph::Node &C2 = *I++;
147   LazyCallGraph::Node &C3 = *I++;
149   LazyCallGraph::Node &D1 = *I++;
151   LazyCallGraph::Node &D2 = *I++;
153   LazyCallGraph::Node &D3 = *I++;
161   for (LazyCallGraph::Node &N : A1)
174   for (LazyCallGraph::Node &N : B1)
186   for (LazyCallGraph::Node &N : C1)
209   for (LazyCallGraph::Node *N : D)
223   for (LazyCallGraph::Node *N : C)
237   for (LazyCallGraph::Node *N : B)
253   for (LazyCallGraph::Node *N : A)
296   LazyCallGraph::Node &A = CG.get(lookupFunction(*M, "a"));
297   LazyCallGraph::Node &B = CG.get(lookupFunction(*M, "b"));
303   LazyCallGraph::Node &C = *B.begin();
329   // children of each node in the SCC.
364   LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a"));
365   LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b"));
366   LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c"));
367   LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d"));
368   LazyCallGraph::Node &E = *CG.lookup(lookupFunction(*M, "e"));
404   LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a"));
405   LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b"));
406   LazyCallGraph::Node &C = *CG.lookup(lookupFunction(*M, "c"));
407   LazyCallGraph::Node &D = *CG.lookup(lookupFunction(*M, "d"));
453   LazyCallGraph::Node &A1 = *CG.lookup(lookupFunction(*M, "a1"));
454   LazyCallGraph::Node &A2 = *CG.lookup(lookupFunction(*M, "a2"));
455   LazyCallGraph::Node &A3 = *CG.lookup(lookupFunction(*M, "a3"));
456   LazyCallGraph::Node &B1 = *CG.lookup(lookupFunction(*M, "b1"));
457   LazyCallGraph::Node &B2 = *CG.lookup(lookupFunction(*M, "b2"));
458   LazyCallGraph::Node &B3 = *CG.lookup(lookupFunction(*M, "b3"));
459   LazyCallGraph::Node &C1 = *CG.lookup(lookupFunction(*M, "c1"));
460   LazyCallGraph::Node &C2 = *CG.lookup(lookupFunction(*M, "c2"));
461   LazyCallGraph::Node &C3 = *CG.lookup(lookupFunction(*M, "c3"));
462   LazyCallGraph::Node &D1 = *CG.lookup(lookupFunction(*M, "d1"));
463   LazyCallGraph::Node &D2 = *CG.lookup(lookupFunction(*M, "d2"));
464   LazyCallGraph::Node &D3 = *CG.lookup(lookupFunction(*M, "d3"));
540   LazyCallGraph::Node &C1 = *CG.lookup(lookupFunction(*M, "c1"));
541   LazyCallGraph::Node &C2 = *CG.lookup(lookupFunction(*M, "c2"));
542   LazyCallGraph::Node &C3 = *CG.lookup(lookupFunction(*M, "c3"));
543   LazyCallGraph::Node &D1 = *CG.lookup(lookupFunction(*M, "d1"));
544   LazyCallGraph::Node &D2 = *CG.lookup(lookupFunction(*M, "d2"));
545   LazyCallGraph::Node &D3 = *CG.lookup(lookupFunction(*M, "d3"));
601   LazyCallGraph::Node &A = *CG.lookup(lookupFunction(*M, "a"));
602   LazyCallGraph::Node &B = *CG.lookup(lookupFunction(*M, "b"));
641   LazyCallGraph::Node &A = *CG1.lookup(lookupFunction(*M1, "a"));
642   LazyCallGraph::Node &B = *CG1.lookup(lookupFunction(*M1, "b"));
643   LazyCallGraph::Node &C = *CG1.lookup(lookupFunction(*M1, "c"));
694   LazyCallGraph::Node &A = *CG1.lookup(lookupFunction(*M1, "a"));
695   LazyCallGraph::Node &B = *CG1.lookup(lookupFunction(*M1, "b"));
696   LazyCallGraph::Node &C = *CG1.lookup(lookupFunction(*M1, "c"));
OpenGrok
