1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
|
// Copyright 2013 the V8 project authors. All rights reserved.
// Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
// DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR ANY
// DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
// (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
// ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
description(
"This test checks that toString() round-trip on a function that has a expression of form 4..x does not lose its meaning."
+ " The expression accesses the property 'x' from number '4'."
);
// construct same test-case for different kinds of number literals. the switch is used to avoid
// individual returns getting optimized away (if the interpreter would do dead code elimination)
// testcase for number literal with decimal point, i.e '4.'
function f1(a) {
switch(a) {
case "member":
return 4..x;
case "arrayget":
return 4.["x"];
case "constr":
return 4.();
case "funccall":
return 4..f();
case "parenfunccall":
return (4..x)();
case "assignment":
return 4..x = 33;
case "assignment2":
return 4..x >>>= 1;
case "prefix":
return ++4..x;
case "postfix":
return 4..x++;
case "delete":
delete 4..x;
return 4..x;
}
return 0;
}
// '4. .'
function f2(a) {
switch(a) {
case "member":
return 4. .x;
case "arrayget":
return 4. ["x"];
case "constr":
return 4.();
case "funccall":
return 4. .f();
case "parenfunccall":
return (4. .x)();
case "assignment":
return 4. .x = 33;
case "assignment2":
return 4. .x >>>= 1;
case "prefix":
return ++4. .x;
case "postfix":
return 4. .x++;
case "delete":
delete 4. .x;
return 4. .x;
}
return 0;
}
// '4e20'
function f2(a) {
switch(a) {
case "member":
return 4e20.x;
case "arrayget":
return 4e20["x"];
case "constr":
return 4e20();
case "funccall":
return 4e20.f();
case "parenfunccall":
return (4e20.x)();
case "assignment":
return 4e20.x = 33;
case "assignment2":
return 4e20.x >>>= 1;
case "prefix":
return ++4e20.x;
case "postfix":
return 4e20.x++;
case "delete":
delete 4e20.x;
return 4e20.x;
}
return 0;
}
// '4.1e-20'
function f3(a) {
switch(a) {
case "member":
return 4.1e-20.x;
case "arrayget":
return 4.1e-20["x"];
case "constr":
return 4.1e-20();
case "funccall":
return 4.1e-20.f();
case "parenfunccall":
return (4.1e-20.x)();
case "assignment":
return 4.1e-20.x = 33;
case "assignment2":
return 4.1e-20.x >>>= 1;
case "prefix":
return ++4.1e-20.x;
case "postfix":
return 4.1e-20.x++;
case "delete":
delete 4.1e-20.x;
return 4.1e-20.x;
}
return 0;
}
// '4'
function f4(a) {
switch(a) {
case "member":
return 4 .x;
case "arrayget":
return 4["x"];
case "constr":
return 4();
case "funccall":
return 4 .f();
case "parenfunccall":
return (4 .x)();
case "assignment":
return 4 .x = 33;
case "assignment2":
return 4 .x >>>= 1;
case "prefix":
return ++4 .x;
case "postfix":
return 4 .x++;
case "delete":
delete 4 .x;
return 4 .x;
}
return 0;
}
// '(4)'
function f5(a) {
switch(a) {
case "member":
return (4).x;
case "arrayget":
return (4)["x"];
case "constr":
return (4)();
case "funccall":
return (4).f();
case "parenfunccall":
return ((4).x)();
case "assignment":
return (4).x = 33;
case "assignment2":
return (4).x >>>= 1;
case "prefix":
return ++(4).x;
case "postfix":
return (4).x++;
case "delete":
delete (4).x;
return (4).x;
}
return 0;
}
unevalf = function(x) { return '(' + x.toString() + ')'; };
function testToString(fn)
{
shouldBe("unevalf(eval(unevalf(" + fn + ")))", "unevalf(" + fn + ")");
}
for(var i = 1; i < 6; ++i)
testToString("f" + i);
|
