OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 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 12 matching lines...) Expand all Loading... |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | 27 |
28 // Flags: --allow-natives-syntax | 28 // Flags: --allow-natives-syntax |
29 | 29 |
30 function o1() { | 30 function o1() { |
31 } | 31 } |
32 | 32 |
33 o1(); o1(); | 33 if (%GetOptimizationStatus(o1) != 4) { |
34 %OptimizeFunctionOnNextCall(o1); | 34 // 4 == optimization disabled. |
35 o1(); | 35 o1(); o1(); |
| 36 %OptimizeFunctionOnNextCall(o1); |
| 37 o1(); |
36 | 38 |
37 // Check that the given function was optimized. | 39 // Check that the given function was optimized. |
38 assertOptimized(o1); | 40 assertOptimized(o1); |
39 | 41 |
40 // Test the %NeverOptimizeFunction runtime call. | 42 // Test the %NeverOptimizeFunction runtime call. |
41 %NeverOptimizeFunction(u1); | 43 %NeverOptimizeFunction(u1); |
42 function u1() { | 44 function u1() { |
| 45 } |
| 46 |
| 47 function u2() { |
| 48 u1(); |
| 49 } |
| 50 |
| 51 u1(); u1(); |
| 52 u2(); u2(); |
| 53 |
| 54 %OptimizeFunctionOnNextCall(u1); |
| 55 %OptimizeFunctionOnNextCall(u2); |
| 56 |
| 57 u1(); u1(); |
| 58 u2(); u2(); |
| 59 |
| 60 // 2 => not optimized. |
| 61 assertUnoptimized(u1); |
| 62 assertOptimized(u2); |
43 } | 63 } |
44 | |
45 function u2() { | |
46 u1(); | |
47 } | |
48 | |
49 u1(); u1(); | |
50 u2(); u2(); | |
51 | |
52 %OptimizeFunctionOnNextCall(u1); | |
53 %OptimizeFunctionOnNextCall(u2); | |
54 | |
55 u1(); u1(); | |
56 u2(); u2(); | |
57 | |
58 assertUnoptimized(u1); | |
59 assertOptimized(u2); | |
OLD | NEW |