Lines Matching defs:check
568 // {prototype}. That does, however, mean that we must check {prototype}'s
890 // We can only use the property cell value map for map check
914 Node* check =
918 simplified()->CheckIf(DeoptimizeReason::kValueMismatch), check,
1102 // Note: The map check generated by ReduceGlobalAccesses ensures that we
1168 // Try to build string check or number check if possible. Otherwise build
1169 // a map check.
1178 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), receiver);
1179 Node* branch = graph()->NewNode(common()->Branch(), check, control);
1240 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), receiver);
1241 Node* branch = graph()->NewNode(common()->Branch(), check, control);
1258 // Perform map check on {lookup_start_object}.
1268 // Last map check on the fallthrough control path, do a
1284 Node* check = this_effect =
1288 graph()->NewNode(common()->Branch(), check, this_control);
1295 // Join this check with the "receiver is smi" check above.
1675 // For holey stores or growing stores, we need to check that the prototype
1687 // then we need to check that all prototypes have stable maps with
1708 // If we have any fast arrays, we need to check and depend on
1747 // Perform map check on the {receiver}.
1789 // Perform map check(s) on {receiver}.
1793 // Last map check on the fallthrough control path, do a
1804 Node* check = this_effect =
1808 graph()->NewNode(common()->Branch(), check, fallthrough_control);
1897 Node* check = graph()->NewNode(simplified()->ReferenceEqual(),
1903 check, effect, control);
2035 // and indices so far, we can turn the {JSLoadProperty} into a map check
2037 // the {LoadFieldByIndex} operator. The map check is only necessary when
2063 // No need to repeat the map check if we can prove that there's no
2070 Node* check = graph()->NewNode(simplified()->ReferenceEqual(), receiver_map,
2074 check, effect, control);
2089 Node* check = graph()->NewNode(
2094 simplified()->CheckIf(DeoptimizeReason::kWrongEnumIndices), check, effect,
2467 // If the field is constant check that the value we are going
2472 Node* check =
2475 simplified()->CheckIf(DeoptimizeReason::kWrongValue), check,
2486 // If the field is constant check that the value we are going
2491 Node* check = graph()->NewNode(simplified()->SameValueNumbersOnly(),
2494 simplified()->CheckIf(DeoptimizeReason::kWrongValue), check,
2508 // Emit a map check for the value.
2699 // See if we can skip the detaching check.
2715 Node* check = graph()->NewNode(
2723 check, effect, control);
2735 // Only check that the {index} is in SignedSmall range. We do the actual
2736 // bounds check below and just skip the property access if it's out of
2762 Node* check =
2765 check, control);
2771 // Do a real bounds check against {length}. This is in order to
2834 Node* check =
2837 check, control);
2842 // Do a real bounds check against {length}. This is in order to
2886 // For has-property on a typed array, all we need is a bounds check.
2930 // bounds check below and just skip the store below if it's out of
2974 Node* check =
2977 check, control);
2983 // Do a real bounds check against {length}. This is in order to
3051 // Perform the hole check on the result.
3065 // For packed arrays with NoElementsProctector valid, a bound check
3071 // If the index is in bounds, do a load and hole check.
3206 Node* check =
3208 Node* branch = graph()->NewNode(common()->Branch(), check, control);
3221 // there must be no other check after this.
3258 Node* check =
3261 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, *control);
3264 // Do a real bounds check against {length}. This is in order to protect