Cross Reference: /external/v8/test/cctest/compiler/test-node-algorithm.cc

Lines Matching refs:visitor
228   ReenterNodeVisitor visitor;
229   graph.VisitNodeUsesFromStart(&visitor);
231   CHECK_EQ(22, static_cast<int>(visitor.nodes_.size()));
232   CHECK_EQ(24, static_cast<int>(visitor.edges_.size()));
234   CHECK(n0->id() == visitor.nodes_[0]);
235   CHECK(n0->id() == visitor.edges_[0].first);
236   CHECK(n1->id() == visitor.edges_[0].second);
237   CHECK(n1->id() == visitor.nodes_[1]);
239   CHECK(-n1->id() == visitor.edges_[1].second);
240   CHECK(-n0->id() == visitor.edges_[1].first);
241   CHECK(n0->id() == visitor.edges_[2].first);
242   CHECK(n2->id() == visitor.edges_[2].second);
243   CHECK(n2->id() == visitor.nodes_[2]);
244   CHECK(n2->id() == visitor.edges_[3].first);
245   CHECK(n3->id() == visitor.edges_[3].second);
246   CHECK(n3->id() == visitor.nodes_[3]);
248   CHECK(n3->id() == visitor.edges_[4].first);
249   CHECK(n0->id() == visitor.edges_[4].second);
250   CHECK(n0->id() == visitor.nodes_[4]);
251   CHECK(n0->id() == visitor.edges_[5].first);
252   CHECK(n1->id() == visitor.edges_[5].second);
253   CHECK(n1->id() == visitor.nodes_[5]);
255   CHECK(-n1->id() == visitor.nodes_[6]);
256   CHECK(-n1->id() == visitor.edges_[6].second);
257   CHECK(-n0->id() == visitor.edges_[6].first);
258   CHECK(n0->id() == visitor.edges_[7].first);
259   CHECK(n2->id() == visitor.edges_[7].second);
260   CHECK(n2->id() == visitor.nodes_[7]);
261   CHECK(n2->id() == visitor.edges_[8].first);
262   CHECK(n3->id() == visitor.edges_[8].second);
263   CHECK(n3->id() == visitor.nodes_[8]);
264   CHECK(n3->id() == visitor.edges_[9].first);
265   CHECK(n0->id() == visitor.edges_[9].second);
266   CHECK(n0->id() == visitor.nodes_[9]);
268   CHECK(-n0->id() == visitor.edges_[10].second);
269   CHECK(-n3->id() == visitor.edges_[10].first);
270   CHECK(-n3->id() == visitor.nodes_[10]);
271   CHECK(-n3->id() == visitor.edges_[11].second);
272   CHECK(-n2->id() == visitor.edges_[11].first);
273   CHECK(-n2->id() == visitor.nodes_[11]);
274   CHECK(-n2->id() == visitor.edges_[12].second);
275   CHECK(-n0->id() == visitor.edges_[12].first);
276   CHECK(n0->id() == visitor.edges_[13].first);
277   CHECK(n4->id() == visitor.edges_[13].second);
278   CHECK(n4->id() == visitor.nodes_[12]);
279   CHECK(n4->id() == visitor.edges_[14].first);
280   CHECK(n5->id() == visitor.edges_[14].second);
281   CHECK(n5->id() == visitor.nodes_[13]);
282   CHECK(-n5->id() == visitor.nodes_[14]);
283   CHECK(-n5->id() == visitor.edges_[15].second);
284   CHECK(-n4->id() == visitor.edges_[15].first);
285   CHECK(-n4->id() == visitor.nodes_[15]);
286   CHECK(-n4->id() == visitor.edges_[16].second);
287   CHECK(-n0->id() == visitor.edges_[16].first);
288   CHECK(-n0->id() == visitor.nodes_[16]);
289   CHECK(-n0->id() == visitor.edges_[17].second);
290   CHECK(-n3->id() == visitor.edges_[17].first);
291   CHECK(-n3->id() == visitor.nodes_[17]);
292   CHECK(-n3->id() == visitor.edges_[18].second);
293   CHECK(-n2->id() == visitor.edges_[18].first);
294   CHECK(-n2->id() == visitor.nodes_[18]);
295   CHECK(-n2->id() == visitor.edges_[19].second);
296   CHECK(-n0->id() == visitor.edges_[19].first);
298   CHECK(n0->id() == visitor.edges_[20].first);
299   CHECK(n4->id() == visitor.edges_[20].second);
300   CHECK(n4->id() == visitor.nodes_[19]);
301   CHECK(n4->id() == visitor.edges_[21].first);
302   CHECK(n5->id() == visitor.edges_[21].second);
303   CHECK(-n5->id() == visitor.edges_[22].second);
304   CHECK(-n4->id() == visitor.edges_[22].first);
305   CHECK(-n4->id() == visitor.nodes_[20]);
306   CHECK(-n4->id() == visitor.edges_[23].second);
307   CHECK(-n0->id() == visitor.edges_[23].first);
308   CHECK(-n0->id() == visitor.nodes_[21]);