Lines Matching full:exponent
1926 // in the exponent.
2292 // If exponent is all ones the number is either a NaN or +/-Infinity.
2347 // Get exponent word.
2349 // Get exponent alone in scratch2.
2357 // Check whether the exponent matches a 32 bit signed int that is not a Smi.
2358 // A non-Smi integer is 1.xxx * 2^30 so the exponent is 30 (biased). This is
2359 // the exponent that we are fastest at and also the highest exponent we can
2364 // for cmp because of the overflow flag, but we know the exponent is in the
2369 // If we have a match of the int32-but-not-Smi exponent then skip some
2372 // If the exponent is higher than that then go to slow case. This catches
2376 // We know the exponent is smaller than 30 (biased). If it is less than
2384 // We have an exponent between 0 and 30 in scratch2. Subtract from 30 to
2393 // Shift up the mantissa bits to take up the space the exponent used to
2407 // Move down according to the exponent.
2468 // Extract the biased exponent in result.
2479 // Express exponent as delta to (number of mantissa bits + 31).
