Lines Matching refs:branch
184 CHECK(!nodes.IsLive(d.branch));
196 Node* branch = T.graph.NewNode(T.common.Branch(), T.p0, loop);
197 Node* if_true = T.graph.NewNode(T.common.IfTrue(), branch);
198 Node* if_false = T.graph.NewNode(T.common.IfFalse(), branch);
210 CheckInputs(branch, T.p0, loop);
211 CheckInputs(if_true, branch);
212 CheckInputs(if_false, branch);
224 Node* branch1 = T.graph.NewNode(T.common.Branch(), T.p0, loop);
228 Node* branch2 = T.graph.NewNode(T.common.Branch(), T.p0, if_true1);
262 Node* branch1 = T.graph.NewNode(T.common.Branch(), T.p0, loop);
266 Node* branch2 = T.graph.NewNode(T.common.Branch(), T.p0, if_true1);
297 Node* branch;
305 branch = t.graph.NewNode(t.common.Branch(), cond, loop);
306 if_true = t.graph.NewNode(t.common.IfTrue(), branch);
307 exit = t.graph.NewNode(t.common.IfFalse(), branch);
345 outer.branch->ReplaceInput(0, outer_phi);
349 inner.branch->ReplaceInput(0, osr_phi);
374 CHECK_NE(new_outer_branch, outer.branch);
404 outer.branch->ReplaceInput(0, outer_phi);
408 inner.branch->ReplaceInput(0, osr_phi);
412 Node* x_branch = T.graph.NewNode(T.common.Branch(), osr_phi, inner.exit);
448 CHECK_NE(new_outer_branch, outer.branch);
496 loop0.branch->ReplaceInput(0, loop0_cntr);
512 loop2.branch->ReplaceInput(0, loop2_cntr);
517 // Branch to either the outer or middle loop.
518 Node* branch = T.graph.NewNode(T.common.Branch(), loop2_cntr, loop2.exit);
519 Node* if_true = T.graph.NewNode(T.common.IfTrue(), branch);
520 Node* if_false = T.graph.NewNode(T.common.IfFalse(), branch);
537 CheckInputs(loop2.branch, osr_phi, loop2.loop);
538 CheckInputs(loop2.if_true, loop2.branch);
539 CheckInputs(loop2.exit, loop2.branch);
540 CheckInputs(branch, osr_phi, loop2.exit);
541 CheckInputs(if_true, branch);
542 CheckInputs(if_false, branch);
