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 24 matching lines...) Expand all Loading... |
35 var n = 0; | 35 var n = 0; |
36 var i = 1; | 36 var i = 1; |
37 n = i + a; | 37 n = i + a; |
38 } | 38 } |
39 | 39 |
40 f(1); | 40 f(1); |
41 f(1); | 41 f(1); |
42 %OptimizeFunctionOnNextCall(f); | 42 %OptimizeFunctionOnNextCall(f); |
43 f(1); | 43 f(1); |
44 assertOptimized(f); | 44 assertOptimized(f); |
| 45 |
| 46 |
| 47 function g() { // 0th parameter (receiver) is tagged. |
| 48 var s = ''; // First local has string type. |
| 49 var n = 0; |
| 50 var i = 1; |
| 51 n = i + this; |
| 52 } |
| 53 |
| 54 g.call(1); |
| 55 g.call(1); |
| 56 %OptimizeFunctionOnNextCall(g); |
| 57 g.call(1); |
| 58 assertOptimized(g); |
OLD | NEW |