1// Copyright 2008 the V8 project authors. All rights reserved.
2// Redistribution and use in source and binary forms, with or without
3// modification, are permitted provided that the following conditions are
4// met:
5//
6//     * Redistributions of source code must retain the above copyright
7//       notice, this list of conditions and the following disclaimer.
8//     * Redistributions in binary form must reproduce the above
9//       copyright notice, this list of conditions and the following
10//       disclaimer in the documentation and/or other materials provided
11//       with the distribution.
12//     * Neither the name of Google Inc. nor the names of its
13//       contributors may be used to endorse or promote products derived
14//       from this software without specific prior written permission.
15//
16// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
28// Ensure that Number.MAX_VALUE and Number.MIN_VALUE are extreme.
29function testLimits() {
30  var i; var eps;
31  for (i = 0, eps = 1; i < 1100; i++, eps /= 2) {
32    var mulAboveMax = Number.MAX_VALUE * (1 + eps);
33    var addAboveMax = Number.MAX_VALUE + 1/eps;
34    var mulBelowMin = Number.MIN_VALUE * (1 - eps);
35    var addBelowMin = Number.MIN_VALUE - eps;
36    assertTrue(mulAboveMax == Number.MAX_VALUE ||
37               mulAboveMax == Infinity, "mul" + i);
38    assertTrue(addAboveMax == Number.MAX_VALUE ||
39               addAboveMax == Infinity, "add" + i);
40    assertTrue(mulBelowMin == Number.MIN_VALUE ||
41               mulBelowMin <= 0, "mul2" + i);
42    assertTrue(addBelowMin == Number.MIN_VALUE ||
43               addBelowMin <= 0, "add2" + i);
44  }
45}
46
47testLimits();
48