Lines Matching refs:NewNode
66 return Replace(graph_->NewNode(&OPB0));
69 return Replace(graph_->NewNode(&OPB1, node->InputAt(0)));
73 graph_->NewNode(&OPB2, node->InputAt(0), node->InputAt(1)));
112 return Replace(graph_->NewNode(&OPB1, node));
128 return Replace(graph_->NewNode(&OPC1, graph_->NewNode(&OPC1, node)));
201 Node* n1 = graph.NewNode(&OPA0);
202 Node* end = graph.NewNode(&OPA1, n1);
217 Node* n1 = graph.NewNode(&OPA0);
218 Node* n2 = graph.NewNode(&OPA1, n1);
219 Node* n3 = graph.NewNode(&OPA1, n1);
220 Node* end = graph.NewNode(&OPA2, n2, n3);
237 Node* n1 = graph.NewNode(&OPA0);
238 Node* end = graph.NewNode(&OPA1, n1);
260 Node* n1 = graph.NewNode(&OPA0);
261 Node* n2 = graph.NewNode(&OPA1, n1);
262 Node* n3 = graph.NewNode(&OPA1, n1);
263 Node* end = graph.NewNode(&OPA2, n2, n3);
290 Node* n1 = graph.NewNode(&OPA0);
291 Node* n2 = graph.NewNode(&OPA1, n1);
292 Node* n3 = graph.NewNode(&OPA1, n1);
293 Node* end = graph.NewNode(&OPA2, n2, n3);
329 Node* end = graph.NewNode(&OPA0);
351 Node* end = graph.NewNode(&OPB0);
378 Node* n1 = graph.NewNode(&OPA0);
379 Node* end = graph.NewNode(&OPA1, n1);
400 Node* n1 = graph.NewNode(&OPA0);
401 Node* n2 = graph.NewNode(&OPA1, n1);
402 Node* n3 = graph.NewNode(&OPA1, n1);
403 Node* end = graph.NewNode(&OPA2, n2, n3);
430 Node* n1 = graph.NewNode(&OPA0);
433 end = graph.NewNode(&OPA1, end);
455 Node* n1 = graph.NewNode(&OPA0);
456 Node* n2 = graph.NewNode(&OPA1, n1);
457 Node* n3 = graph.NewNode(&OPA1, n1);
458 Node* end = graph.NewNode(&OPA2, n2, n3);
490 Node* n1 = graph.NewNode(&OPA0);
491 Node* n2 = graph.NewNode(&OPA1, n1);
492 Node* n3 = graph.NewNode(&OPA1, n1);
495 if (i == 0) end = graph.NewNode(&OPA2, n2, n3);
496 if (i == 1) end = graph.NewNode(&OPA2, n3, n2);
497 if (i == 2) end = graph.NewNode(&OPA2, n2, n1);
498 if (i == 3) end = graph.NewNode(&OPA2, n1, n2);
499 if (i == 4) end = graph.NewNode(&OPA2, n3, n1);
500 if (i == 5) end = graph.NewNode(&OPA2, n1, n3);
522 Node* level4 = graph->NewNode(&OPA0);
523 Node* level3[] = {graph->NewNode(&OPA1, level4),
524 graph->NewNode(&OPA1, level4)};
526 Node* level2[] = {graph->NewNode(&OPA1, level3[p3[0]]),
527 graph->NewNode(&OPA1, level3[p3[1]]),
528 graph->NewNode(&OPA1, level3[p3[0]]),
529 graph->NewNode(&OPA1, level3[p3[1]])};
531 Node* level1[] = {graph->NewNode(&OPA2, level2[p2[0]], level2[p2[1]]),
532 graph->NewNode(&OPA2, level2[p2[2]], level2[p2[3]])};
534 Node* end = graph->NewNode(&OPA2, level1[p1[0]], level1[p1[1]]);
598 Node* n1 = graph.NewNode(&OPA0);
599 Node* end = graph.NewNode(&OPA1, n1);
645 Node* n1 = graph.NewNode(&OPA0);
646 Node* end = graph.NewNode(&OPA1, n1);
