Cross Reference: /frameworks/compile/mclinker/unittests/GraphTest.cpp

Lines Matching defs:u1
39   ListDigraph::Node* u1 = graph.addNode();
43   ASSERT_TRUE(NULL == u1->first_in);
44   ASSERT_TRUE(NULL == u1->first_out);
45   ASSERT_TRUE(u2 == u1->prev);
46   ASSERT_TRUE(NULL == u1->next);
51   ASSERT_TRUE(u1 == u2->next);
64   ASSERT_TRUE(NULL == u1->first_in);
65   ASSERT_TRUE(NULL == u1->first_out);
66   ASSERT_TRUE(u3 == u1->prev);
67   ASSERT_TRUE(NULL == u1->next);
71   ASSERT_TRUE(u1 == u3->next);
86   ListDigraph::Node* u1 = graph.addNode();
90   ASSERT_TRUE(NULL == u1->first_in);
91   ASSERT_TRUE(NULL == u1->first_out);
92   ASSERT_TRUE(u2 == u1->prev);
93   ASSERT_TRUE(NULL == u1->next);
98   ASSERT_TRUE(u1 == u2->next);
109   graph.erase(*u1);
111   ASSERT_TRUE(NULL == u1->first_in);
112   ASSERT_TRUE(NULL == u1->first_out);
113   ASSERT_TRUE(NULL == u1->prev);
114   ASSERT_TRUE(NULL == u1->next);
133   ListDigraph::Node* u1 = graph.addNode();
137   ASSERT_TRUE(NULL == u1->first_in);
138   ASSERT_TRUE(NULL == u1->first_out);
139   ASSERT_TRUE(u2 == u1->prev);
140   ASSERT_TRUE(NULL == u1->next);
145   ASSERT_TRUE(u1 == u2->next);
163   ASSERT_TRUE(NULL == u1->first_in);
164   ASSERT_TRUE(NULL == u1->first_out);
165   ASSERT_TRUE(u2 == u1->prev);
166   ASSERT_TRUE(NULL == u1->next);
170   ASSERT_TRUE(u1 == u2->next);
180   ListDigraph::Node* u1 = graph.addNode();
184   ListDigraph::Arc* a1 = graph.addArc(*u1, *u2);
186   ListDigraph::Arc* a3 = graph.addArc(*u3, *u1);
188   ASSERT_TRUE(u1 == a1->source && u2 == a1->target);
190   ASSERT_TRUE(u3 == a3->source && u1 == a3->target);
192   ASSERT_TRUE(u1->first_in == a3 && u1->first_out == a1);
200   ListDigraph::Node* u1 = graph.addNode();
204   ListDigraph::Arc* a1 = graph.addArc(*u1, *u1);
205   ListDigraph::Arc* a2 = graph.addArc(*u1, *u2);
206   ListDigraph::Arc* a3 = graph.addArc(*u1, *u3);
208   ASSERT_TRUE(u1 == a1->source && u1 == a1->target);
209   ASSERT_TRUE(u1 == a2->source && u2 == a2->target);
210   ASSERT_TRUE(u1 == a3->source && u3 == a3->target);
212   ASSERT_TRUE(u1->first_in == a1 && u1->first_out == a3);
220   ListDigraph::Node* u1 = graph.addNode();
224   ListDigraph::Arc* a1 = graph.addArc(*u1, *u2);
226   ListDigraph::Arc* a3 = graph.addArc(*u3, *u1);
230   ASSERT_TRUE(u1 == a1->source && u2 == a1->target);
231   ASSERT_TRUE(u3 == a3->source && u1 == a3->target);
246   ListDigraph::Node* u1 = graph.addNode();
250   ListDigraph::Arc* a1 = graph.addArc(*u1, *u2);
252   ListDigraph::Arc* a3 = graph.addArc(*u3, *u1);
257   ASSERT_TRUE(u3 == a3->source && u1 == a3->target);
260   ASSERT_TRUE(u1->first_in == a3 && u1->first_out == NULL);
272   ListDigraph::Node* u1 = graph.addNode();
276   ListDigraph::Arc* a1 = graph.addArc(*u1, *u2);
278   ListDigraph::Arc* a3 = graph.addArc(*u3, *u1);
282   ASSERT_TRUE(u1 == a1->source && u2 == a1->target);
286   ASSERT_TRUE(u1->first_in == NULL && u1->first_out == a1);
298   ListDigraph::Node* u1 = graph.addNode();
302   ListDigraph::Arc* a1 = graph.addArc(*u1, *u1);
303   graph.addArc(*u1, *u2);
304   graph.addArc(*u1, *u3);
306   graph.erase(*u1);