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 19 matching lines...) Expand all Loading... |
30 var test_id = 0; | 30 var test_id = 0; |
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 |
| 41 var test_double_output = new Function( |
| 42 'n', |
| 43 '"' + (test_id++) + '";return Math.floor(n) + -0.0'); |
| 44 assertEquals(expect, test_double_output(input)); |
| 45 assertEquals(expect, test_double_output(input)); |
| 46 assertEquals(expect, test_double_output(input)); |
| 47 %OptimizeFunctionOnNextCall(test_double_output); |
| 48 assertEquals(expect, test_double_output(input)); |
40 } | 49 } |
41 | 50 |
42 function zero() { | 51 function zero() { |
43 var x = 0.5; | 52 var x = 0.5; |
44 return (function() { return x - 0.5; })(); | 53 return (function() { return x - 0.5; })(); |
45 } | 54 } |
46 | 55 |
47 function test() { | 56 function test() { |
48 // 2^30 is a smi boundary. | 57 // 2^30 is a smi boundary. |
49 var two_30 = 1 << 30; | 58 var two_30 = 1 << 30; |
(...skipping 17 matching lines...) Expand all Loading... |
67 testFloor(-two_30 + 1, -two_30 + 1 + 0.1); | 76 testFloor(-two_30 + 1, -two_30 + 1 + 0.1); |
68 testFloor(-two_30 + 1, -two_30 + 1 + 0.5); | 77 testFloor(-two_30 + 1, -two_30 + 1 + 0.5); |
69 testFloor(-two_30 + 1, -two_30 + 1 + 0.7); | 78 testFloor(-two_30 + 1, -two_30 + 1 + 0.7); |
70 } | 79 } |
71 | 80 |
72 | 81 |
73 // Test in a loop to cover the custom IC and GC-related issues. | 82 // Test in a loop to cover the custom IC and GC-related issues. |
74 for (var i = 0; i < 100; i++) { | 83 for (var i = 0; i < 100; i++) { |
75 test(); | 84 test(); |
76 } | 85 } |
OLD | NEW |