Lines Matching defs:control
64 // Try to use a phi as a branch condition if the control flow from the branch
66 // control flow of the second_branch is predictable because the first_branch
70 // later passes through branch cloning in effect-control-linearizer.
258 // condition control condition control
297 Node* control = graph()->NewNode(common()->Throw(), effect, node);
298 NodeProperties::MergeControlToEnd(graph(), common(), control);
318 Node* control = NodeProperties::GetControlInput(node);
322 if (!reduced_.Get(control)) {
326 ControlPathConditions conditions = node_conditions_.Get(control);
333 // with the {control} node that already contains the right information.
334 ReplaceWithValue(node, dead(), effect, control);
336 control = graph()->NewNode(common()->Deoptimize(p.reason(), p.feedback()),
337 frame_state, effect, control);
339 NodeProperties::MergeControlToEnd(graph(), common(), control);
408 // We just propagate the information from the control input (ideally,
409 // we would only revisit control uses if there is change).
430 // The control path for the node is the path obtained by appending the
431 // current_condition to the prev_conditions. Use the original control path as