Lines Matching defs:check
886 // Unlink the check point; effect uses will be updated to the incoming
1429 // In case of 0, we need to check the high bits for the IEEE -0 pattern.
1543 Node* check = __ Uint32LessThanOrEqual(value, SmiMaxValueConstant());
1544 __ GotoIfNot(check, &if_not_in_smi_range);
1562 Node* check =
1564 __ GotoIfNot(check, &if_not_in_smi_range);
1633 // For HeapNumber {value}, just check that its value is not 0.0, -0.0 or
1661 // If {value} is a Smi, then we only need to check that it's not zero.
1685 Node* check = ObjectIsSmi(value);
1686 __ GotoIfNot(check, &if_not_smi);
1706 Node* check = ObjectIsSmi(value);
1707 __ GotoIfNot(check, &if_not_smi);
1727 Node* check = ObjectIsSmi(value);
1728 __ GotoIfNot(check, &if_not_smi);
1752 Node* check = ObjectIsSmi(value);
1753 __ GotoIfNot(check, &if_not_smi);
1774 Node* check = ObjectIsSmi(value);
1775 __ GotoIfNot(check, &if_not_smi);
1833 Node* check = ObjectIsSmi(result);
1835 check, frame_state);
1855 Node* check = __ TaggedEqual(value_map, map);
1857 __ BranchWithCriticalSafetyCheck(check, &done, &migrate);
1860 __ BranchWithCriticalSafetyCheck(check, &done, &next_map);
1876 Node* check = __ TaggedEqual(value_map, map);
1878 __ DeoptimizeIfNot(DeoptimizeReason::kWrongMap, p.feedback(), check,
1882 __ BranchWithCriticalSafetyCheck(check, &done, &next_map);
1897 Node* check = __ TaggedEqual(value_map, map);
1900 __ DeoptimizeIfNot(DeoptimizeReason::kWrongMap, p.feedback(), check,
1904 __ BranchWithCriticalSafetyCheck(check, &done, &next_map);
1945 Node* check = __ TaggedEqual(value_map, map);
1949 __ BranchWithCriticalSafetyCheck(check, &passed, &next_map);
1993 Node* check = __ Uint32LessThanOrEqual(
1996 check, frame_state);
2028 Node* check =
2030 __ DeoptimizeIfNot(DeoptimizeReason::kNotASymbol, FeedbackSource(), check,
2043 Node* check = __ Uint32LessThan(value_instance_type,
2045 __ DeoptimizeIfNot(DeoptimizeReason::kNotAString, params.feedback(), check,
2058 Node* check = __ Word32Equal(
2063 check, frame_state);
2097 Node* check = __ Projection(1, value);
2098 __ DeoptimizeIf(DeoptimizeReason::kOverflow, FeedbackSource(), check,
2109 Node* check = __ Projection(1, value);
2110 __ DeoptimizeIf(DeoptimizeReason::kOverflow, FeedbackSource(), check,
2125 // check to see if the relevant least significant bits of the {lhs}
2132 Node* check = __ Word32Equal(__ Word32And(lhs, mask), zero);
2134 check, frame_state);
2193 Node* check = __ Word32Equal(lhs, __ Int32Mul(value, rhs));
2195 check, frame_state);
2223 Node* check = __ Projection(1, add);
2224 __ DeoptimizeIf(DeoptimizeReason::kLostPrecision, params.feedback(), check,
2347 // check to see if the relevant least significant bits of the {lhs}
2354 Node* check = __ Word32Equal(__ Word32And(lhs, mask), zero);
2356 check, frame_state);
2360 Node* check = __ Word32Equal(rhs, zero);
2361 __ DeoptimizeIf(DeoptimizeReason::kDivisionByZero, FeedbackSource(), check,
2368 check = __ Word32Equal(lhs, __ Int32Mul(rhs, value));
2370 check, frame_state);
2383 Node* check = __ Word32Equal(rhs, zero);
2384 __ DeoptimizeIf(DeoptimizeReason::kDivisionByZero, FeedbackSource(), check,
2398 Node* check = __ Projection(1, projection);
2399 __ DeoptimizeIf(DeoptimizeReason::kOverflow, FeedbackSource(), check,
2439 Node* check = __ Word64Equal(__ ChangeInt32ToInt64(value32), value);
2440 __ DeoptimizeIfNot(DeoptimizeReason::kLostPrecision, params.feedback(), check,
2451 Node* check = __ Word64Equal(__ ChangeInt32ToInt64(value32), value);
2452 __ DeoptimizeIfNot(DeoptimizeReason::kLostPrecision, params.feedback(), check,
2468 Node* check = __ Uint32LessThan(index, limit);
2471 params.check_parameters().feedback(), check,
2477 __ Branch(check, &done, &if_abort);
2502 Node* check = __ Uint32LessThanOrEqual(value, SmiMaxValueConstant());
2503 __ DeoptimizeIfNot(DeoptimizeReason::kLostPrecision, params.feedback(), check,
2514 Node* check = __ Uint64LessThan(index, limit);
2517 params.check_parameters().feedback(), check,
2523 __ Branch(check, &done, &if_abort);
2538 Node* check = __ Uint64LessThanOrEqual(value, __ Int64Constant(kMaxInt));
2539 __ DeoptimizeIfNot(DeoptimizeReason::kLostPrecision, params.feedback(), check,
2549 Node* check =
2551 __ DeoptimizeIfNot(DeoptimizeReason::kLostPrecision, params.feedback(), check,
2574 // In case of 0, we need to check the high bits for the IEEE -0 pattern.
2593 // detected and would not lead to a deoptimization from the first check.
2644 // In case of 0, we need to check the high bits for the IEEE -0 pattern.
2669 Node* check = ObjectIsSmi(value);
2670 __ DeoptimizeIfNot(DeoptimizeReason::kNotASmi, params.feedback(), check,
2687 // In the non-Smi case, check the heap numberness, load the number and convert
2735 Node* check = ObjectIsSmi(value);
2736 __ GotoIfNot(check, &if_not_smi);
2740 // In the non-Smi case, check the heap numberness, load the number and convert
2765 Node* check = ObjectIsSmi(value);
2766 __ GotoIfNot(check, &if_not_smi);
2770 // In the non-Smi case, check the heap numberness, load the number and convert
2815 // For oddballs also contain the numeric value, let us just check that
2843 Node* check = ObjectIsSmi(value);
2844 __ GotoIf(check, &if_smi);
2847 // Otherwise, check heap numberness and load the number.
2866 Node* check = ObjectIsSmi(value);
2867 __ DeoptimizeIfNot(DeoptimizeReason::kNotASmi, params.feedback(), check,
2878 Node* check = ObjectIsSmi(value);
2879 __ DeoptimizeIf(DeoptimizeReason::kSmi, params.feedback(), check,
2981 Node* check = ObjectIsSmi(value);
2982 __ GotoIfNot(check, &if_not_smi);
3005 Node* check = ObjectIsSmi(value);
3006 __ GotoIfNot(check, &if_not_smi);
3010 // Otherwise, check that it's a heap number or oddball and truncate the value
3049 Node* check = ObjectIsSmi(value);
3050 __ GotoIf(check, &if_smi);
3075 Node* check = ObjectIsSmi(value);
3076 __ GotoIf(check, &if_smi);
3094 Node* check = ObjectIsSmi(value);
3095 __ GotoIf(check, &if_smi);
3119 Node* check = ObjectIsSmi(value);
3120 __ GotoIf(check, &if_smi);
3144 Node* check = ObjectIsSmi(value);
3145 __ GotoIf(check, &if_smi);
3166 Node* check = __ Word32Equal(__ Float64ExtractHighWord32(value),
3168 return check;
3174 Node* check = __ Float64Equal(diff, diff);
3175 return check;
3196 Node* check = __ Float64Equal(diff, diff);
3197 __ Goto(&done, check);
3207 Node* check = __ Float64Equal(diff, __ Float64Constant(0));
3208 return check;
3230 Node* check = __ Float64Equal(diff, __ Float64Constant(0));
3231 __ Goto(&done, check);
3244 Node* check = __ Float64Equal(diff, __ Float64Constant(0));
3245 __ GotoIfNot(check, &done, zero);
3273 Node* check = __ Float64Equal(diff, __ Float64Constant(0));
3274 __ GotoIfNot(check, &done, zero);
3375 Node* check = __ Word32Equal(diff, __ Int32Constant(0));
3376 return check;
3462 Node* check = ObjectIsSmi(value);
3463 __ GotoIf(check, &if_smi);
3484 Node* check = ObjectIsSmi(value);
3485 __ GotoIf(check, &if_smi);
3506 Node* check = ObjectIsSmi(value);
3507 __ GotoIf(check, &if_smi);
3613 Node* check = __ UintLessThan(index, length);
3614 __ GotoIfNot(check, &done, result);
3657 Node* check = __ UintLessThan(index, length);
3658 __ GotoIfNot(check, &done, result);
4424 // First check whether {value} is a NaN at all...
4430 // check. See http://crbug.com/v8/8264 for details.
4431 Node* check = __ Word32Equal(__ Float64ExtractHighWord32(value),
4433 __ DeoptimizeIf(DeoptimizeReason::kHole, params.feedback(), check,
4445 Node* check = __ TaggedEqual(value, __ TheHoleConstant());
4446 __ DeoptimizeIf(DeoptimizeReason::kHole, FeedbackSource(), check,
4457 Node* check = __ TaggedEqual(value, __ TheHoleConstant());
4458 __ GotoIf(check, &if_is_hole);
4533 // The {val} is a ThinString, let's check the actual value.
4549 Node* check = __ TaggedEqual(exp, val);
4550 __ DeoptimizeIfNot(DeoptimizeReason::kWrongName, FeedbackSource(), check,
4741 Node* check = __ TaggedEqual(elements_map, __ FixedArrayMapConstant());
4742 __ GotoIfNot(check, &if_not_fixed_array);
4776 Node* check = __ Uint32LessThan(index, elements_length);
4777 __ GotoIfNot(check, &if_grow);
4819 Node* check = __ TaggedEqual(object_map, source_map);
4820 __ GotoIf(check, &if_map_same);
5180 // If this check fails, you've probably added new fields to
5461 // We may have transitioned in-place away from double, so check that
5786 Node* check = __ TaggedEqual(value_map, heap_number_map);
5787 __ GotoIfNot(check, &transition_double_to_fast);
5798 Node* check = __ TaggedEqual(value_map, heap_number_map);
5799 __ GotoIfNot(check, &if_value_not_heap_number);
6116 Node* check = __ Uint32LessThan(
6118 __ GotoIf(check, &convert_to_object);
6149 Node* check = __ Uint32LessThan(
6151 __ GotoIf(check, &convert_to_object);
6568 Node* check =
6570 __ GotoIf(check, &done, entry);