| "Tests that if we have a tower of large numerical constants being added to each other, the DFG knows that a sufficiently large tower may produce a large enough value that overflow check elimination must be careful." |
| return (a + b + 281474976710655 + 281474976710655 + 281474976710655 + 281474976710655 + |
| 281474976710655 + 281474976710655 + 281474976710655 + 281474976710655 + |
| 281474976710655 + 281474976710655 + 281474976710655 + 281474976710655 + |
| 281474976710655 + 281474976710655 + 281474976710655 + 281474976710655 + |
| 281474976710655 + 281474976710655 + 281474976710655 + 281474976710655 + |
| 281474976710655 + 281474976710655 + 281474976710655 + 281474976710655 + |
| 281474976710655 + 281474976710655 + 281474976710655 + 281474976710655 + |
| 281474976710655 + 281474976710655 + 281474976710655 + 281474976710655 + 30) | 0; |
| for (var i = 0; i < 2; i = dfgIncrement({f:foo, i:i + 1, n:1})) { |
| shouldBe("foo(" + a + ", " + b + ")", "" + expected); |