| OLD | NEW |
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 20 matching lines...) Expand all Loading... |
| 31 | 31 |
| 32 function testFloor(expect, input) { | 32 function testFloor(expect, input) { |
| 33 var test = new Function('n', | 33 var test = new Function('n', |
| 34 '"' + (test_id++) + '";return Math.floor(n)'); | 34 '"' + (test_id++) + '";return Math.floor(n)'); |
| 35 assertEquals(expect, test(input)); | 35 assertEquals(expect, test(input)); |
| 36 assertEquals(expect, test(input)); | 36 assertEquals(expect, test(input)); |
| 37 assertEquals(expect, test(input)); | 37 assertEquals(expect, test(input)); |
| 38 %OptimizeFunctionOnNextCall(test); | 38 %OptimizeFunctionOnNextCall(test); |
| 39 assertEquals(expect, test(input)); | 39 assertEquals(expect, test(input)); |
| 40 | 40 |
| 41 var test_double_input = new Function( |
| 42 'n', |
| 43 '"' + (test_id++) + '";return Math.floor(+n)'); |
| 44 assertEquals(expect, test_double_input(input)); |
| 45 assertEquals(expect, test_double_input(input)); |
| 46 assertEquals(expect, test_double_input(input)); |
| 47 %OptimizeFunctionOnNextCall(test_double_input); |
| 48 assertEquals(expect, test_double_input(input)); |
| 49 |
| 41 var test_double_output = new Function( | 50 var test_double_output = new Function( |
| 42 'n', | 51 'n', |
| 43 '"' + (test_id++) + '";return Math.floor(n) + -0.0'); | 52 '"' + (test_id++) + '";return Math.floor(n) + -0.0'); |
| 44 assertEquals(expect, test_double_output(input)); | 53 assertEquals(expect, test_double_output(input)); |
| 45 assertEquals(expect, test_double_output(input)); | 54 assertEquals(expect, test_double_output(input)); |
| 46 assertEquals(expect, test_double_output(input)); | 55 assertEquals(expect, test_double_output(input)); |
| 47 %OptimizeFunctionOnNextCall(test_double_output); | 56 %OptimizeFunctionOnNextCall(test_double_output); |
| 48 assertEquals(expect, test_double_output(input)); | 57 assertEquals(expect, test_double_output(input)); |
| 58 |
| 59 var test_via_ceil = new Function( |
| 60 'n', |
| 61 '"' + (test_id++) + '";return -Math.ceil(-n)'); |
| 62 assertEquals(expect, test_via_ceil(input)); |
| 63 assertEquals(expect, test_via_ceil(input)); |
| 64 assertEquals(expect, test_via_ceil(input)); |
| 65 %OptimizeFunctionOnNextCall(test_via_ceil); |
| 66 assertEquals(expect, test_via_ceil(input)); |
| 67 |
| 68 if (input >= 0) { |
| 69 var test_via_trunc = new Function( |
| 70 'n', |
| 71 '"' + (test_id++) + '";return Math.trunc(n)'); |
| 72 assertEquals(expect, test_via_trunc(input)); |
| 73 assertEquals(expect, test_via_trunc(input)); |
| 74 assertEquals(expect, test_via_trunc(input)); |
| 75 %OptimizeFunctionOnNextCall(test_via_trunc); |
| 76 assertEquals(expect, test_via_trunc(input)); |
| 77 } |
| 49 } | 78 } |
| 50 | 79 |
| 51 function zero() { | 80 function zero() { |
| 52 var x = 0.5; | 81 var x = 0.5; |
| 53 return (function() { return x - 0.5; })(); | 82 return (function() { return x - 0.5; })(); |
| 54 } | 83 } |
| 55 | 84 |
| 56 function test() { | 85 function test() { |
| 57 // 2^30 is a smi boundary. | 86 // 2^30 is a smi boundary. |
| 58 var two_30 = 1 << 30; | 87 var two_30 = 1 << 30; |
| (...skipping 17 matching lines...) Expand all Loading... |
| 76 testFloor(-two_30 + 1, -two_30 + 1 + 0.1); | 105 testFloor(-two_30 + 1, -two_30 + 1 + 0.1); |
| 77 testFloor(-two_30 + 1, -two_30 + 1 + 0.5); | 106 testFloor(-two_30 + 1, -two_30 + 1 + 0.5); |
| 78 testFloor(-two_30 + 1, -two_30 + 1 + 0.7); | 107 testFloor(-two_30 + 1, -two_30 + 1 + 0.7); |
| 79 } | 108 } |
| 80 | 109 |
| 81 | 110 |
| 82 // Test in a loop to cover the custom IC and GC-related issues. | 111 // Test in a loop to cover the custom IC and GC-related issues. |
| 83 for (var i = 0; i < 100; i++) { | 112 for (var i = 0; i < 100; i++) { |
| 84 test(); | 113 test(); |
| 85 } | 114 } |
| OLD | NEW |