Lines Matching full:branch
20 Node* branch;
29 branch = graph->NewNode(common->Branch(hint), cond, graph->start());
30 if_true = graph->NewNode(common->IfTrue(), branch);
31 if_false = graph->NewNode(common->IfFalse(), branch);
36 void Chain(Diamond& that) { branch->ReplaceInput(1, that.merge); }
39 void Chain(Node* that) { branch->ReplaceInput(1, that); }
41 // Nest {this} into either the if_true or if_false branch of {that}.
44 branch->ReplaceInput(1, that.if_true);
47 branch->ReplaceInput(1, that.if_false);