OLD | NEW |
---|---|
(Empty) | |
1 // Copyright 2011 the V8 project authors. All rights reserved. | |
2 // Redistribution and use in source and binary forms, with or without | |
3 // modification, are permitted provided that the following conditions are | |
4 // met: | |
5 // | |
6 // * Redistributions of source code must retain the above copyright | |
7 // notice, this list of conditions and the following disclaimer. | |
8 // * Redistributions in binary form must reproduce the above | |
9 // copyright notice, this list of conditions and the following | |
10 // disclaimer in the documentation and/or other materials provided | |
11 // with the distribution. | |
12 // * Neither the name of Google Inc. nor the names of its | |
13 // contributors may be used to endorse or promote products derived | |
14 // from this software without specific prior written permission. | |
15 // | |
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
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. | |
27 | |
28 var global = 0; | |
29 var MAX = 10000000; | |
Lasse Reichstein
2011/04/08 12:54:18
That's a lot. Is it really necessary?
Are there an
Martin Maly
2011/04/08 14:27:39
Turns out we inline even with one zero removed so
| |
30 | |
31 // Attempt to inline strcit in non-strict. | |
32 | |
33 function strictToBeInlined(n) { | |
34 "use strict"; | |
35 global = "strict"; | |
36 if (n == MAX) { undefined_variable_strict = "value"; } | |
37 } | |
38 | |
39 function nonstrictCallStrict(n) { | |
40 strictToBeInlined(n); | |
41 } | |
42 | |
43 (function testInlineStrictInNonStrict() { | |
44 for (var i = 0; i <= MAX; i ++) { | |
45 try { | |
46 nonstrictCallStrict(i); | |
47 } catch (e) { | |
48 assertInstanceof(e, ReferenceError); | |
49 assertEquals(MAX, i); | |
50 return; | |
51 } | |
52 } | |
53 fail("ReferenceError after MAX iterations", "no exception"); | |
54 })(); | |
55 | |
56 // Attempt to inline non-strict in strict. | |
57 | |
58 function nonstrictToBeInlined(n) { | |
59 global = "nonstrict"; | |
60 if (n == MAX) { undefined_variable_nonstrict = "The nonstrict value"; } | |
61 } | |
62 | |
63 function strictCallNonStrict(n) { | |
64 "use strict"; | |
65 nonstrictToBeInlined(n); | |
66 } | |
67 | |
68 (function testInlineNonStrictInStrict() { | |
69 for (var i = 0; i <= MAX; i ++) { | |
70 try { | |
71 strictCallNonStrict(i); | |
72 } catch (e) { | |
73 fail("no exception", "exception"); | |
74 } | |
75 } | |
76 assertEquals("The nonstrict value", undefined_variable_nonstrict); | |
77 })(); | |
78 | |
79 // Optimize strict function. | |
80 | |
81 function strictAssignToUndefined(n) { | |
82 "use strict"; | |
83 global = "strict"; | |
84 if (n == MAX) { undefined_variable_strict_2 = "value"; } | |
85 } | |
86 | |
87 (function testOptimizeStrictAssignToUndefined() { | |
88 for (var i = 0; i <= MAX; i ++) { | |
89 try { | |
90 strictAssignToUndefined(i); | |
91 } catch (e) { | |
92 assertInstanceof(e, ReferenceError); | |
93 assertEquals(MAX, i); | |
94 return; | |
95 } | |
96 } | |
97 fail("ReferenceError after MAX iterations", "no exception"); | |
98 })(); | |
OLD | NEW |