Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(742)

Side by Side Diff: test/mjsunit/strict-mode-opt.js

Issue 6910022: Replace long running loops by OptimizeFunctionOnNextCall in some tests. (Closed) Base URL: https://v8.googlecode.com/svn/branches/bleeding_edge
Patch Set: Address comments. Created 9 years, 7 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
« no previous file with comments | « test/mjsunit/regress/regress-1099.js ('k') | no next file » | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
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: --allow-natives-syntax
29
28 var global = 0; 30 var global = 0;
29 var MAX = 1000000; 31 var MAX = 5;
30 32
31 // Attempt to inline strcit in non-strict. 33 // Attempt to inline strcit in non-strict.
32 34
33 function strictToBeInlined(n) { 35 function strictToBeInlined(n) {
34 "use strict"; 36 "use strict";
35 global = "strict"; 37 global = "strict";
36 if (n == MAX) { undefined_variable_strict = "value"; } 38 if (n == MAX) { undefined_variable_strict = "value"; }
37 } 39 }
38 40
39 function nonstrictCallStrict(n) { 41 function nonstrictCallStrict(n) {
40 strictToBeInlined(n); 42 strictToBeInlined(n);
41 } 43 }
42 44
43 (function testInlineStrictInNonStrict() { 45 (function testInlineStrictInNonStrict() {
44 for (var i = 0; i <= MAX; i ++) { 46 for (var i = 0; i <= MAX; i ++) {
45 try { 47 try {
48 if (i == MAX - 1) %OptimizeFunctionOnNextCall(nonstrictCallStrict);
46 nonstrictCallStrict(i); 49 nonstrictCallStrict(i);
47 } catch (e) { 50 } catch (e) {
48 assertInstanceof(e, ReferenceError); 51 assertInstanceof(e, ReferenceError);
49 assertEquals(MAX, i); 52 assertEquals(MAX, i);
50 return; 53 return;
51 } 54 }
52 } 55 }
53 fail("ReferenceError after MAX iterations", "no exception"); 56 fail("ReferenceError after MAX iterations", "no exception");
54 })(); 57 })();
55 58
56 // Attempt to inline non-strict in strict. 59 // Attempt to inline non-strict in strict.
57 60
58 function nonstrictToBeInlined(n) { 61 function nonstrictToBeInlined(n) {
59 global = "nonstrict"; 62 global = "nonstrict";
60 if (n == MAX) { undefined_variable_nonstrict = "The nonstrict value"; } 63 if (n == MAX) { undefined_variable_nonstrict = "The nonstrict value"; }
61 } 64 }
62 65
63 function strictCallNonStrict(n) { 66 function strictCallNonStrict(n) {
64 "use strict"; 67 "use strict";
65 nonstrictToBeInlined(n); 68 nonstrictToBeInlined(n);
66 } 69 }
67 70
68 (function testInlineNonStrictInStrict() { 71 (function testInlineNonStrictInStrict() {
69 for (var i = 0; i <= MAX; i ++) { 72 for (var i = 0; i <= MAX; i ++) {
70 try { 73 try {
74 if (i == MAX - 1) %OptimizeFunctionOnNextCall(nonstrictCallStrict);
71 strictCallNonStrict(i); 75 strictCallNonStrict(i);
72 } catch (e) { 76 } catch (e) {
73 fail("no exception", "exception"); 77 fail("no exception", "exception");
74 } 78 }
75 } 79 }
76 assertEquals("The nonstrict value", undefined_variable_nonstrict); 80 assertEquals("The nonstrict value", undefined_variable_nonstrict);
77 })(); 81 })();
78 82
79 // Optimize strict function. 83 // Optimize strict function.
80 84
81 function strictAssignToUndefined(n) { 85 function strictAssignToUndefined(n) {
82 "use strict"; 86 "use strict";
83 global = "strict"; 87 global = "strict";
84 if (n == MAX) { undefined_variable_strict_2 = "value"; } 88 if (n == MAX) { undefined_variable_strict_2 = "value"; }
85 } 89 }
86 90
87 (function testOptimizeStrictAssignToUndefined() { 91 (function testOptimizeStrictAssignToUndefined() {
88 for (var i = 0; i <= MAX; i ++) { 92 for (var i = 0; i <= MAX; i ++) {
89 try { 93 try {
94 if (i == MAX - 1) %OptimizeFunctionOnNextCall(nonstrictCallStrict);
90 strictAssignToUndefined(i); 95 strictAssignToUndefined(i);
91 } catch (e) { 96 } catch (e) {
92 assertInstanceof(e, ReferenceError); 97 assertInstanceof(e, ReferenceError);
93 assertEquals(MAX, i); 98 assertEquals(MAX, i);
94 return; 99 return;
95 } 100 }
96 } 101 }
97 fail("ReferenceError after MAX iterations", "no exception"); 102 fail("ReferenceError after MAX iterations", "no exception");
98 })(); 103 })();
OLDNEW
« no previous file with comments | « test/mjsunit/regress/regress-1099.js ('k') | no next file » | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698