Lines Matching refs:branch
88 // The final states for every polymorphic branch. We join them with
103 Node* branch =
104 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control);
105 exit_controls.push_back(graph()->NewNode(common()->IfFalse(), branch));
106 control = graph()->NewNode(common()->IfTrue(), branch);
111 Node* branch = graph()->NewNode(common()->Branch(), check, control);
112 control = graph()->NewNode(common()->IfFalse(), branch);
113 Node* receiverissmi_control = graph()->NewNode(common()->IfTrue(), branch);
140 Node* branch =
141 graph()->NewNode(common()->Branch(), check, fallthrough_control);
142 fallthrough_control = graph()->NewNode(common()->IfFalse(), branch);
143 this_control = graph()->NewNode(common()->IfTrue(), branch);
154 Node* branch =
155 graph()->NewNode(common()->Branch(), check, fallthrough_control);
156 fallthrough_control = graph()->NewNode(common()->IfFalse(), branch);
157 this_controls.push_back(graph()->NewNode(common()->IfTrue(), branch));
211 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue),
213 exit_controls.push_back(graph()->NewNode(common()->IfFalse(), branch));
214 this_control = graph()->NewNode(common()->IfTrue(), branch);
239 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kFalse),
241 exit_controls.push_back(graph()->NewNode(common()->IfTrue(), branch));
242 this_control = graph()->NewNode(common()->IfFalse(), branch);
278 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue),
281 graph()->NewNode(common()->IfFalse(), branch));
282 this_control = graph()->NewNode(common()->IfTrue(), branch);
321 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue),
324 graph()->NewNode(common()->IfFalse(), branch));
325 this_control = graph()->NewNode(common()->IfTrue(), branch);
331 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kFalse),
333 exit_controls.push_back(graph()->NewNode(common()->IfTrue(), branch));
334 this_control = graph()->NewNode(common()->IfFalse(), branch);
346 branch = graph()->NewNode(common()->Branch(BranchHint::kTrue),
348 branch);
350 graph()->NewNode(common()->IfTrue(), branch));
391 // Mark the last fallthrough branch as deferred.
516 // The final states for every polymorphic branch. We join them with
529 Node* branch =
530 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control);
531 exit_controls.push_back(graph()->NewNode(common()->IfTrue(), branch));
532 control = graph()->NewNode(common()->IfFalse(), branch);
561 Node* branch =
562 graph()->NewNode(common()->Branch(), check, fallthrough_control);
563 this_controls.push_back(graph()->NewNode(common()->IfTrue(), branch));
565 fallthrough_control = graph()->NewNode(common()->IfFalse(), branch);
578 Node* branch =
579 graph()->NewNode(common()->Branch(), check, fallthrough_control);
582 Node* transition_control = graph()->NewNode(common()->IfTrue(), branch);
608 fallthrough_control = graph()->NewNode(common()->IfFalse(), branch);
639 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue),
641 exit_controls.push_back(graph()->NewNode(common()->IfFalse(), branch));
642 this_control = graph()->NewNode(common()->IfTrue(), branch);
654 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue),
656 exit_controls.push_back(graph()->NewNode(common()->IfFalse(), branch));
657 this_control = graph()->NewNode(common()->IfTrue(), branch);
679 branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), check,
681 exit_controls.push_back(graph()->NewNode(common()->IfFalse(), branch));
682 this_control = graph()->NewNode(common()->IfTrue(), branch);
699 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), check,
701 exit_controls.push_back(graph()->NewNode(common()->IfFalse(), branch));
702 this_control = graph()->NewNode(common()->IfTrue(), branch);
741 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kFalse),
743 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
744 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
793 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kFalse),
795 this_control = graph()->NewNode(common()->IfFalse(), branch);
796 exit_controls.push_back(graph()->NewNode(common()->IfTrue(), branch));
803 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue),
805 exit_controls.push_back(graph()->NewNode(common()->IfFalse(), branch));
806 this_control = graph()->NewNode(common()->IfTrue(), branch);
812 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue),
814 exit_controls.push_back(graph()->NewNode(common()->IfFalse(), branch));
815 this_control = graph()->NewNode(common()->IfTrue(), branch);
832 // Mark the last fallthrough branch as deferred.
978 Node* branch = NodeProperties::GetControlInput(if_projection);
979 DCHECK_EQ(IrOpcode::kBranch, branch->opcode());
981 NodeProperties::ChangeOp(branch, common()->Branch(BranchHint::kFalse));
984 NodeProperties::ChangeOp(branch, common()->Branch(BranchHint::kTrue));
