Lines Matching refs:branch
29 Node* branch;
36 struct Branch {
37 Node* branch;
109 Node* branch = graph()->NewNode(common()->Branch(), cond, loop);
110 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
111 Node* exit = graph()->NewNode(common()->IfFalse(), branch);
113 return {loop, branch, if_true, exit};
126 Branch NewBranch(Node* cond, Node* control = nullptr) {
128 Node* branch = graph()->NewNode(common()->Branch(), cond, control);
129 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
130 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
131 return {branch, if_true, if_false};
153 Node* br1 = ExpectPeeled(w.branch, peeled);
174 Node* br1 = ExpectPeeled(w.branch, peeled);
204 Node* bro = ExpectPeeled(outer.branch, peeled);
212 Node* bri = ExpectPeeled(inner.branch, peeled);
249 ExpectNotPeeled(outer.branch, peeled);
253 Node* bri = ExpectPeeled(inner.branch, peeled);
286 ExpectNotPeeled(outer.branch, peeled);
290 Node* bri = ExpectPeeled(inner.branch, peeled);
315 Branch b1 = NewBranch(p0, loop);
316 Branch b2 = NewBranch(p0, b1.if_true);
325 Node* b1b = ExpectPeeled(b1.branch, peeled);
333 Node* b2b = ExpectPeeled(b2.branch, peeled);
349 Branch b1 = NewBranch(p0, loop);
350 Branch b2 = NewBranch(p0, b1.if_true);
362 Node* b1b = ExpectPeeled(b1.branch, peeled);
370 Node* b2b = ExpectPeeled(b2.branch, peeled);
397 Branch b1 = NewBranch(p0, loop);
398 Branch b2 = NewBranch(p0, b1.if_true);
415 Node* b1b = ExpectPeeled(b1.branch, peeled);
423 Node* b2b = ExpectPeeled(b2.branch, peeled);
457 Branch b1 = NewBranch(p0, loop);
458 Branch b2 = NewBranch(p0, b1.if_true);
479 Branch b1 = NewBranch(p0, loop);
