OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 %SetAllocationTimeout(20, 0); | 30 %SetAllocationTimeout(20, 0); |
31 function f() { | 31 function f() { |
32 return [[1, 2, 3], [1.1, 1.2, 1.3], [[], [], []]]; | 32 return [[1, 2, 3], [1.1, 1.2, 1.3], [[], [], []]]; |
33 } | 33 } |
34 | 34 |
35 f(); f(); f(); | 35 f(); f(); f(); |
36 %OptimizeFunctionOnNextCall(f); | 36 %OptimizeFunctionOnNextCall(f); |
37 for (var i=0; i<50; i++) { | 37 for (var i=0; i<50; i++) { |
38 f(); | 38 f(); |
39 } | 39 } |
40 | |
41 | |
42 | |
OLD | NEW |