wine/gecko
0
0
Fork 0
mirror of https://gitlab.winehq.org/wine/wine-gecko.git synced 2024-09-13 09:24:08 -07:00
Code Issues Packages Projects Releases Wiki Activity

Bug 925848 - IonMonkey: Don't intersect [0,?] and [?,0] to [0,0]. r=nbp

Browse Source
This commit is contained in:
Dan Gohman 2013-10-15 20:49:44 -07:00
parent bcb01f765f
commit 972e219580
1 changed files with 8 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
js/src/jit/RangeAnalysis.cpp
View File

@ -372,6 +372,14 @@ Range::intersect(const Range *lhs, const Range *rhs, bool *emptyRange)
bool newFractional = lhs->canHaveFractionalPart_ && rhs->canHaveFractionalPart_;
uint16_t newExponent = Min(lhs->max_exponent_, rhs->max_exponent_);
// NaN is a special value which is neither greater than infinity or less than
// negative infinity. When we intersect two ranges like [?, 0] and [0, ?], we
// can end up thinking we have both a lower and upper bound, even though NaN
// is still possible. In this case, just be conservative, since any case where
// we can have NaN is not especially interesting.
if (newHasInt32LowerBound && newHasInt32UpperBound && newExponent == IncludesInfinityAndNaN)
return nullptr;
// If one of the ranges has a fractional part and the other doesn't, it's
// possible that we will have computed a newExponent that's more precise
// than our newLower and newUpper. This is unusual, so we handle it here