| 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 | 
|   11 //       with the distribution. |   11 //       with the distribution. | 
|   12 //     * Neither the name of Google Inc. nor the names of its |   12 //     * Neither the name of Google Inc. nor the names of its | 
|   13 //       contributors may be used to endorse or promote products derived |   13 //       contributors may be used to endorse or promote products derived | 
|   14 //       from this software without specific prior written permission. |   14 //       from this software without specific prior written permission. | 
|   15 // |   15 // | 
|   16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |   16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 
|   17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |   17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 
|   18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |   18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 
|   19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |   19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 
|   20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |   20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 
|   21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |   21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 
|   22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |   22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 
|   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: --harmony-scoping --allow-natives-syntax --noparallel-recompilation |   28 // Flags: --harmony-scoping --allow-natives-syntax | 
|   29  |   29  | 
|   30 // TODO(ES6): properly activate extended mode |   30 // TODO(ES6): properly activate extended mode | 
|   31 "use strict"; |   31 "use strict"; | 
|   32  |   32  | 
|   33 // Check that the following functions are optimizable. |   33 // Check that the following functions are optimizable. | 
|   34 var functions = [ f1, f2, f3, f4, f5, f6, f7, f8, f9, f10, f11, f12, f13, f14, |   34 var functions = [ f1, f2, f3, f4, f5, f6, f7, f8, f9, f10, f11, f12, f13, f14, | 
|   35                   f15, f16, f17, f18, f19, f20, f21, f22, f23 ]; |   35                   f15, f16, f17, f18, f19, f20, f21, f22, f23 ]; | 
|   36  |   36  | 
|   37 for (var i = 0; i < functions.length; ++i) { |   37 for (var i = 0; i < functions.length; ++i) { | 
|   38   var func = functions[i]; |   38   var func = functions[i]; | 
|   39   print("Testing:"); |   39   print("Testing:"); | 
|   40   print(func); |   40   print(func); | 
|   41   for (var j = 0; j < 10; ++j) { |   41   for (var j = 0; j < 10; ++j) { | 
|   42     func(12); |   42     func(12); | 
|   43   } |   43   } | 
|   44   %OptimizeFunctionOnNextCall(func); |   44   %OptimizeFunctionOnNextCall(func); | 
|   45   func(12); |   45   func(12); | 
|   46   assertTrue(%GetOptimizationStatus(func) != 2); |   46   assertOptimized(func); | 
|   47 } |   47 } | 
|   48  |   48  | 
|   49 function f1() { } |   49 function f1() { } | 
|   50  |   50  | 
|   51 function f2(x) { } |   51 function f2(x) { } | 
|   52  |   52  | 
|   53 function f3() { |   53 function f3() { | 
|   54   let x; |   54   let x; | 
|   55 } |   55 } | 
|   56  |   56  | 
| (...skipping 196 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
|  253   f(42, true); |  253   f(42, true); | 
|  254 } catch (e) { |  254 } catch (e) { | 
|  255   assertInstanceof(e, ReferenceError); |  255   assertInstanceof(e, ReferenceError); | 
|  256 } |  256 } | 
|  257  |  257  | 
|  258 try { |  258 try { | 
|  259   g(42, true); |  259   g(42, true); | 
|  260 } catch (e) { |  260 } catch (e) { | 
|  261   assertInstanceof(e, ReferenceError); |  261   assertInstanceof(e, ReferenceError); | 
|  262 } |  262 } | 
| OLD | NEW |