| 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: --use-osr --allow-natives-syntax --no-concurrent-osr | 28 // Flags: --use-osr --allow-natives-syntax --no-concurrent-osr |
| 29 | 29 |
| 30 function f() { | 30 function f() { |
| 31 do { | 31 do { |
| 32 do { | 32 do { |
| 33 for (var i = 0; i < 10000000; i++) { | 33 for (var i = 0; i < 10; i++) %OptimizeOsr(); |
| 34 // This should run long enough to trigger OSR. | |
| 35 } | |
| 36 } while (false); | 34 } while (false); |
| 37 } while (false); | 35 } while (false); |
| 38 } | 36 } |
| 39 | 37 |
| 40 f(); | 38 f(); |
| 41 assertTrue(%GetOptimizationCount(f) > 0 || %GetOptimizationStatus(f) == 4); | 39 assertTrue(%GetOptimizationCount(f) > 0 || %GetOptimizationStatus(f) == 4); |
| 42 | 40 |
| 43 function g() { | 41 function g() { |
| 44 for (var i = 0; i < 1; i++) { } | 42 for (var i = 0; i < 1; i++) { } |
| 45 | 43 |
| 46 do { | 44 do { |
| 47 do { | 45 do { |
| 48 for (var i = 0; i < 1; i++) { } | 46 for (var i = 0; i < 1; i++) { } |
| 49 } while (false); | 47 } while (false); |
| 50 } while (false); | 48 } while (false); |
| 51 | 49 |
| 52 do { | 50 do { |
| 53 do { | 51 do { |
| 54 do { | 52 do { |
| 55 do { | 53 do { |
| 56 do { | 54 do { |
| 57 do { | 55 do { |
| 58 do { | 56 do { |
| 59 do { | 57 do { |
| 60 for (var i = 0; i < 10000000; i++) { } | 58 for (var i = 0; i < 10; i++) %OptimizeOsr(); |
| 61 } while (false); | 59 } while (false); |
| 62 } while (false); | 60 } while (false); |
| 63 } while (false); | 61 } while (false); |
| 64 } while (false); | 62 } while (false); |
| 65 } while (false); | 63 } while (false); |
| 66 } while (false); | 64 } while (false); |
| 67 } while (false); | 65 } while (false); |
| 68 } while (false); | 66 } while (false); |
| 69 } | 67 } |
| 70 | 68 |
| 71 g(); | 69 g(); |
| 72 assertTrue(%GetOptimizationCount(g) > 0 || %GetOptimizationStatus(g) == 4); | 70 assertTrue(%GetOptimizationCount(g) > 0 || %GetOptimizationStatus(g) == 4); |
| OLD | NEW |