OLD | NEW |
(Empty) | |
| 1 // Copyright 2012 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 // Flags: --allow-natives-syntax |
| 29 |
| 30 var cases = [ |
| 31 [0.0, 0.0, 0.0, 0,0], |
| 32 [undefined, 0.0, NaN, NaN], |
| 33 [0.0, undefined, NaN, NaN], |
| 34 [NaN, 0.0, NaN, NaN], |
| 35 [0.0, NaN, NaN, NaN], |
| 36 [-NaN, 0.0, NaN, NaN], |
| 37 [0.0, -NaN, NaN, NaN], |
| 38 [Infinity, 0.0, Infinity, 0.0], |
| 39 [0.0, Infinity, Infinity, 0.0], |
| 40 [-Infinity, 0.0, 0.0, -Infinity], |
| 41 [0.0, -Infinity, 0.0, -Infinity] |
| 42 ]; |
| 43 |
| 44 function do_min(a, b) { |
| 45 return Math.min(a, b); |
| 46 } |
| 47 |
| 48 function do_max(a, b) { |
| 49 return Math.max(a, b); |
| 50 } |
| 51 |
| 52 // Make sure that non-crankshaft results match expectations. |
| 53 for (i = 0; i < cases.length; ++i) { |
| 54 var c = cases[i]; |
| 55 assertEquals(c[3], do_min(c[0], c[1])); |
| 56 assertEquals(c[2], do_max(c[0], c[1])); |
| 57 } |
| 58 |
| 59 // Make sure that crankshaft results match expectations. |
| 60 for (i = 0; i < cases.length; ++i) { |
| 61 var c = cases[i]; |
| 62 %OptimizeFunctionOnNextCall(do_min); |
| 63 %OptimizeFunctionOnNextCall(do_max); |
| 64 assertEquals(c[3], do_min(c[0], c[1])); |
| 65 assertEquals(c[2], do_max(c[0], c[1])); |
| 66 } |
OLD | NEW |