Lines Matching refs:nan
2309 Label* nan, Condition cond, FPURegister cmp1,
2321 DCHECK(nan || target);
2322 // Check for unordered (NaN) cases.
2323 if (nan) {
2324 bool long_branch = nan->is_bound() ? is_near(nan) : is_trampoline_emitted();
2331 BranchLong(nan, bd);
2335 bc1t(nan);
2350 BranchLong(nan, bd);
2354 bc1nez(nan, kDoubleCompareReg);
2384 // Here NaN cases were either handled by this function or are assumed to
2442 // Here NaN cases were either handled by this function or are assumed to
2673 FPURegister src2, Label* nan) {
2674 if (nan) {
2675 BranchF64(nullptr, nan, eq, src1, src2);
2702 FPURegister src2, Label* nan) {
2703 if (nan) {
2704 BranchF64(nullptr, nan, eq, src1, src2);
2731 FPURegister src2, Label* nan) {
2732 if (nan) {
2733 BranchF32(nullptr, nan, eq, src1, src2);
2760 FPURegister src2, Label* nan) {
2761 if (nan) {
2762 BranchF32(nullptr, nan, eq, src1, src2);
4917 // Check if the result of subtraction is NaN.
4923 // Check if first operand is a NaN.
4926 // Second operand must be a NaN.
4950 // Check if the result of subtraction is NaN.
4956 NaN.
4959 // Second operand must be a NaN.
5534 // If exponent is all ones the number is either a NaN or +/-Infinity.
7055 // Double value is less than zero, NaN or Inf, return 0.
