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 |
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: --allow-natives-syntax | 28 // Flags: --allow-natives-syntax |
29 | 29 |
30 // Test that we do not generate OSR entry points that have an arguments | 30 (function ApplyArgumentsDeoptInReceiverMapCheck() { |
31 // stack height different from zero. The OSR machinery cannot generate | 31 function invoker(h, r) { |
32 // frames for that. | 32 return function XXXXX() { |
Jakob Kummerow
2014/01/10 13:47:03
nit: indentation is inconsistent here and again se
Jarin
2014/01/10 14:14:45
Done.
| |
33 | 33 var res = h.apply({ fffffff : r(this) }, arguments); |
34 (function() { | 34 return res; |
35 "use strict"; | 35 }; |
36 | |
37 var instantReturn = false; | |
38 function inner() { | |
39 if (instantReturn) return; | |
40 assertSame(3, arguments.length); | |
41 assertSame(1, arguments[0]); | |
42 assertSame(2, arguments[1]); | |
43 assertSame(3, arguments[2]); | |
44 } | 36 } |
45 | 37 |
46 function outer() { | 38 var y = invoker(m, selfOf); |
47 inner(1,2,3); | 39 |
48 // Trigger OSR, if optimization is not disabled. | 40 function selfOf(c) { |
49 if (%GetOptimizationStatus(outer) != 4) { | 41 var sssss = c.self_; |
50 while (%GetOptimizationCount(outer) == 0) {} | 42 return sssss; |
51 } | |
52 } | 43 } |
53 | 44 |
54 outer(); | 45 function m() { |
46 return this.fffffff; | |
47 } | |
48 | |
49 for (var i = 0; i < 200; i++) { | |
Jakob Kummerow
2014/01/10 13:47:03
use a smaller loop count here (say, 3), and %Optim
Jarin
2014/01/10 14:14:45
Done.
| |
50 y.apply({ self_ : 3 }); | |
51 } | |
52 | |
53 assertEquals(y.apply({ self_ : 3, uuu : 4 }), 3); | |
55 })(); | 54 })(); |
55 | |
56 (function ApplyArgumetsDeoptInReceiverExplicit() { | |
Jakob Kummerow
2014/01/10 13:47:03
nit: s/Argumets/Arguments/
Jarin
2014/01/10 14:14:45
Done.
| |
57 | |
58 function f() { return this + 21; } | |
59 | |
60 function deopt() { | |
61 %DeoptimizeFunction(XXXXX); | |
62 return 21; | |
63 } | |
64 | |
65 function XXXXX() { | |
66 return f.apply(deopt(), arguments); | |
67 }; | |
68 | |
69 XXXXX(); | |
70 XXXXX(); | |
71 XXXXX(); | |
72 | |
73 %OptimizeFunctionOnNextCall(XXXXX); | |
74 | |
75 assertEquals(42, XXXXX()); | |
76 })(); | |
OLD | NEW |