Lines Matching refs:branch
188 Node* branch;
195 branch = t.graph.NewNode(t.common.Branch(), cond, loop);
196 if_true = t.graph.NewNode(t.common.IfTrue(), branch);
197 exit = t.graph.NewNode(t.common.IfFalse(), branch);
261 Node* body[] = {w.branch, w.if_true};
278 Node* body[] = {w.branch, w.if_true};
294 Node* body[] = {w.branch, w.if_true, c.add};
310 Node* body[] = {w.branch, w.if_true, c.store};
327 Node* body[] = {w.branch, w.if_true, c1.add, c2.add};
345 Node* body[] = {w1.branch, w1.if_true};
354 Node* body[] = {w2.branch, w2.if_true};
375 Node* body[] = {w1.branch, w1.if_true, c1.add};
384 Node* body[] = {w2.branch, w2.if_true, c2.add};
400 if (i & 3) w2.branch->ReplaceInput(0, c1.phi);
410 Node* body[] = {w1.branch, w1.if_true, c1.add};
419 Node* body[] = {w2.branch, w2.if_true, c2.add};
438 Node* b1[] = {w1.branch, w1.if_true, w2.loop, w2.branch, w2.if_true, w2.exit};
442 Node* b2[] = {w2.branch, w2.if_true};
454 w2.branch->ReplaceInput(0, c2.phi);
462 Node* b1[] = {w1.branch, w1.if_true, w2.loop, w2.branch, w2.if_true,
467 Node* b2[] = {w2.branch, w2.if_true, c2.add};
497 Node* b1[] = {w1.branch, w1.if_true, w2.loop, p2a,
498 p2b, w2.branch, w2.if_true, w2.exit};
502 Node* b2[] = {w2.branch, w2.if_true};
525 Node* b1[] = {w1.branch, w1.if_true, w2.loop, w2.branch, w2.if_true,
526 w2.exit, w3.loop, w3.branch, w3.if_true, w3.exit};
530 Node* b2[] = {w2.branch, w2.if_true};
534 Node* b3[] = {w3.branch, w3.if_true};
555 Node* b1[] = {w1.branch, w1.if_true, w2.loop, w2.branch, w2.if_true,
556 w2.exit, w3.loop, w3.branch, w3.if_true, w3.exit};
560 Node* b2[] = {w2.branch, w2.if_true, w3.loop, w3.branch, w3.if_true, w3.exit};
564 Node* b3[] = {w3.branch, w3.if_true};
582 w1.branch->ReplaceInput(0, c1.phi);
583 w2.branch->ReplaceInput(0, c2.phi);
584 w3.branch->ReplaceInput(0, c3.phi);
591 Node* b1[] = {w1.branch, w1.if_true, c1.add, c2.add, c2.add,
592 c2.phi, c3.phi, w2.loop, w2.branch, w2.if_true,
593 w2.exit, w3.loop, w3.branch, w3.if_true, w3.exit};
597 Node* b2[] = {w2.branch, w2.if_true, c2.add, c3.add, c3.phi,
598 w3.loop, w3.branch, w3.if_true, w3.exit};
602 Node* b3[] = {w3.branch, w3.if_true, c3.add};
623 Node* branch = t.graph.NewNode(t.common.Branch(), cond, last);
624 Node* if_true = t.graph.NewNode(t.common.IfTrue(), branch);
625 Node* exit = t.graph.NewNode(t.common.IfFalse(), branch);
628 body[body_count++] = branch;
660 Node* branch = t.graph.NewNode(t.common.Branch(), cond, exit);
661 Node* if_true = t.graph.NewNode(t.common.IfTrue(), branch);
662 Node* if_false = t.graph.NewNode(t.common.IfFalse(), branch);
665 body[body_count++] = branch;
695 Node* branch = t.graph.NewNode(t.common.Branch(), cond, loop);
696 Node* if_true = t.graph.NewNode(t.common.IfTrue(), branch);
697 Node* exit = t.graph.NewNode(t.common.IfFalse(), branch);
708 Node* body[] = {cond, branch, if_true};
731 Node* branch1 = t.graph.NewNode(t.common.Branch(), cond1, loop1);
740 Node* branch2 = t.graph.NewNode(t.common.Branch(), cond2, loop2);
807 Node* branch1 = t.graph.NewNode(t.common.Branch(), cond1, loop1);
816 Node* branch2 = t.graph.NewNode(t.common.Branch(), cond2, loop2);
825 Node* branch3 = t.graph.NewNode(t.common.Branch(), cond3, loop3);
933 Node* branch = t.graph.NewNode(t.common.Branch(), phi, loop);
934 Node* if_true = t.graph.NewNode(t.common.IfTrue(), branch);
935 Node* exit = t.graph.NewNode(t.common.IfFalse(), branch);
940 nodes[i * 4 + 2] = branch;
969 Node* branch = t.graph.NewNode(t.common.Branch(), phi, loop);
970 Node* if_true = t.graph.NewNode(t.common.IfTrue(), branch);
971 Node* exit = t.graph.NewNode(t.common.IfFalse(), branch);
976 nodes[i * 5 + 3] = branch; // body
