Lines Matching defs:check
101 Node* check = graph()->NewNode(simplified()->ReferenceEqual(Type::Name()),
104 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control);
110 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), receiver);
111 Node* branch = graph()->NewNode(common()->Branch(), check, control);
130 // Perform map check on {receiver}.
133 // Emit an instance type check for strings.
137 Node* check =
141 graph()->NewNode(common()->Branch(), check, fallthrough_control);
151 Node* check =
155 graph()->NewNode(common()->Branch(), check, fallthrough_control);
163 // Join this check with the "receiver is smi" check above, and mark the
164 // "receiver is smi" check as "consumed" so that we don't deoptimize if
209 Node* check = graph()->NewNode(
212 check, this_control);
233 Node* check = graph()->NewNode(
240 check, this_control);
276 Node* check =
279 check, this_control);
319 Node* check =
322 check, this_control);
329 Node* check =
332 check, this_control);
343 check = graph()->NewNode(
347 check, this_control);
407 // failes (i.e. failing prototype chain check).
528 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), receiver);
530 graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control);
549 // Perform map check on {receiver}.
558 Node* check =
562 graph()->NewNode(common()->Branch(), check, fallthrough_control);
574 // Check if {receiver} has the specified {transition_source} map.
575 Node* check = graph()->NewNode(
579 graph()->NewNode(common()->Branch(), check, fallthrough_control);
627 // Certain stores need a prototype chain check because shape changes
635 // Check that the {index} is actually a Number.
637 Node* check =
640 check, this_control);
647 // Convert the {index} to an unsigned32 value and check if the result is
652 Node* check = graph()->NewNode(simplified()->NumberEqual(), this_index32,
655 check, this_control);
676 check = graph()->NewNode(
679 branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), check,
696 // Check that the {index} is in the valid range for the {receiver}.
697 Node* check = graph()->NewNode(simplified()->NumberLessThan(), this_index,
699 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kTrue), check,
737 // Perform the hole check on the result.
738 Node* check =
742 check, this_control);
745 // Check if we are allowed to turn the hole into undefined.
773 // Perform the hole check on the result.
774 Node* check =
776 // Check if we are allowed to return the hole directly.
790 check, jsgraph()->UndefinedConstant(), this_value);
794 check, this_control);
802 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), this_value);
804 check, this_control);
810 Node* check =
813 check, this_control);
839 // failes (i.e. failing prototype chain check).
911 // Check if we have feedback for a named access.
