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

Side by Side Diff: test/cctest/interpreter/bytecode_expectations/BasicLoops.golden

Issue 2640273002: [ignition] Expect 'I' for signed bytecode operands (Closed)
Patch Set: Rebase Created 3 years, 11 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
OLDNEW
1 # 1 #
2 # Autogenerated by generate-bytecode-expectations. 2 # Autogenerated by generate-bytecode-expectations.
3 # 3 #
4 4
5 --- 5 ---
6 wrap: yes 6 wrap: yes
7 7
8 --- 8 ---
9 snippet: " 9 snippet: "
10 var x = 0; 10 var x = 0;
(...skipping 50 matching lines...) Expand 10 before | Expand all | Expand 10 after
61 } 61 }
62 return y; 62 return y;
63 " 63 "
64 frame size: 2 64 frame size: 2
65 parameter count: 1 65 parameter count: 1
66 bytecode array length: 54 66 bytecode array length: 54
67 bytecodes: [ 67 bytecodes: [
68 /* 30 E> */ B(StackCheck), 68 /* 30 E> */ B(StackCheck),
69 /* 42 S> */ B(LdaZero), 69 /* 42 S> */ B(LdaZero),
70 B(Star), R(0), 70 B(Star), R(0),
71 /* 53 S> */ B(LdaSmi), U8(1), 71 /* 53 S> */ B(LdaSmi), I8(1),
72 B(Star), R(1), 72 B(Star), R(1),
73 /* 65 S> */ B(LdaSmi), U8(10), 73 /* 65 S> */ B(LdaSmi), I8(10),
74 /* 65 E> */ B(TestLessThan), R(0), U8(2), 74 /* 65 E> */ B(TestLessThan), R(0), U8(2),
75 B(JumpIfFalse), U8(38), 75 B(JumpIfFalse), U8(38),
76 /* 56 E> */ B(StackCheck), 76 /* 56 E> */ B(StackCheck),
77 /* 75 S> */ B(LdaSmi), U8(12), 77 /* 75 S> */ B(LdaSmi), I8(12),
78 /* 81 E> */ B(Mul), R(1), U8(3), 78 /* 81 E> */ B(Mul), R(1), U8(3),
79 B(Star), R(1), 79 B(Star), R(1),
80 /* 89 S> */ B(LdaSmi), U8(1), 80 /* 89 S> */ B(LdaSmi), I8(1),
81 /* 95 E> */ B(Add), R(0), U8(4), 81 /* 95 E> */ B(Add), R(0), U8(4),
82 B(Star), R(0), 82 B(Star), R(0),
83 /* 102 S> */ B(LdaSmi), U8(3), 83 /* 102 S> */ B(LdaSmi), I8(3),
84 /* 108 E> */ B(TestEqual), R(0), U8(5), 84 /* 108 E> */ B(TestEqual), R(0), U8(5),
85 B(JumpIfFalse), U8(4), 85 B(JumpIfFalse), U8(4),
86 /* 114 S> */ B(Jump), U8(11), 86 /* 114 S> */ B(Jump), U8(11),
87 /* 126 S> */ B(LdaSmi), U8(4), 87 /* 126 S> */ B(LdaSmi), I8(4),
88 /* 132 E> */ B(TestEqual), R(0), U8(6), 88 /* 132 E> */ B(TestEqual), R(0), U8(6),
89 B(JumpIfFalse), U8(4), 89 B(JumpIfFalse), U8(4),
90 /* 138 S> */ B(Jump), U8(5), 90 /* 138 S> */ B(Jump), U8(5),
91 B(JumpLoop), U8(40), U8(0), 91 B(JumpLoop), U8(40), I8(0),
92 /* 147 S> */ B(Ldar), R(1), 92 /* 147 S> */ B(Ldar), R(1),
93 /* 157 S> */ B(Return), 93 /* 157 S> */ B(Return),
94 ] 94 ]
95 constant pool: [ 95 constant pool: [
96 ] 96 ]
97 handlers: [ 97 handlers: [
98 ] 98 ]
99 99
100 --- 100 ---
101 snippet: " 101 snippet: "
(...skipping 13 matching lines...) Expand all
115 bytecode array length: 62 115 bytecode array length: 62
116 bytecodes: [ 116 bytecodes: [
117 /* 30 E> */ B(StackCheck), 117 /* 30 E> */ B(StackCheck),
118 /* 42 S> */ B(LdaZero), 118 /* 42 S> */ B(LdaZero),
119 B(Star), R(0), 119 B(Star), R(0),
120 /* 45 E> */ B(StackCheck), 120 /* 45 E> */ B(StackCheck),
121 /* 62 S> */ B(LdaZero), 121 /* 62 S> */ B(LdaZero),
122 /* 68 E> */ B(TestLessThan), R(0), U8(2), 122 /* 68 E> */ B(TestLessThan), R(0), U8(2),
123 B(JumpIfFalse), U8(4), 123 B(JumpIfFalse), U8(4),
124 /* 73 S> */ B(Jump), U8(45), 124 /* 73 S> */ B(Jump), U8(45),
125 /* 85 S> */ B(LdaSmi), U8(3), 125 /* 85 S> */ B(LdaSmi), I8(3),
126 /* 91 E> */ B(TestEqual), R(0), U8(3), 126 /* 91 E> */ B(TestEqual), R(0), U8(3),
127 B(JumpIfFalse), U8(4), 127 B(JumpIfFalse), U8(4),
128 /* 97 S> */ B(Jump), U8(39), 128 /* 97 S> */ B(Jump), U8(39),
129 /* 106 S> */ B(LdaSmi), U8(4), 129 /* 106 S> */ B(LdaSmi), I8(4),
130 /* 112 E> */ B(TestEqual), R(0), U8(4), 130 /* 112 E> */ B(TestEqual), R(0), U8(4),
131 B(JumpIfFalse), U8(4), 131 B(JumpIfFalse), U8(4),
132 /* 118 S> */ B(Jump), U8(30), 132 /* 118 S> */ B(Jump), U8(30),
133 /* 127 S> */ B(LdaSmi), U8(10), 133 /* 127 S> */ B(LdaSmi), I8(10),
134 /* 133 E> */ B(TestEqual), R(0), U8(5), 134 /* 133 E> */ B(TestEqual), R(0), U8(5),
135 B(JumpIfFalse), U8(4), 135 B(JumpIfFalse), U8(4),
136 /* 140 S> */ B(Jump), U8(18), 136 /* 140 S> */ B(Jump), U8(18),
137 /* 152 S> */ B(LdaSmi), U8(5), 137 /* 152 S> */ B(LdaSmi), I8(5),
138 /* 158 E> */ B(TestEqual), R(0), U8(6), 138 /* 158 E> */ B(TestEqual), R(0), U8(6),
139 B(JumpIfFalse), U8(4), 139 B(JumpIfFalse), U8(4),
140 /* 164 S> */ B(Jump), U8(12), 140 /* 164 S> */ B(Jump), U8(12),
141 /* 173 S> */ B(LdaSmi), U8(1), 141 /* 173 S> */ B(LdaSmi), I8(1),
142 /* 179 E> */ B(Add), R(0), U8(7), 142 /* 179 E> */ B(Add), R(0), U8(7),
143 B(Star), R(0), 143 B(Star), R(0),
144 B(JumpLoop), U8(52), U8(0), 144 B(JumpLoop), U8(52), I8(0),
145 /* 186 S> */ B(Ldar), R(0), 145 /* 186 S> */ B(Ldar), R(0),
146 /* 196 S> */ B(Return), 146 /* 196 S> */ B(Return),
147 ] 147 ]
148 constant pool: [ 148 constant pool: [
149 ] 149 ]
150 handlers: [ 150 handlers: [
151 ] 151 ]
152 152
153 --- 153 ---
154 snippet: " 154 snippet: "
155 var i = 0; 155 var i = 0;
156 while (true) { 156 while (true) {
157 while (i < 3) { 157 while (i < 3) {
158 if (i == 2) break; 158 if (i == 2) break;
159 i = i + 1; 159 i = i + 1;
160 } 160 }
161 i = i + 1; 161 i = i + 1;
162 break; 162 break;
163 } 163 }
164 return i; 164 return i;
165 " 165 "
166 frame size: 1 166 frame size: 1
167 parameter count: 1 167 parameter count: 1
168 bytecode array length: 44 168 bytecode array length: 44
169 bytecodes: [ 169 bytecodes: [
170 /* 30 E> */ B(StackCheck), 170 /* 30 E> */ B(StackCheck),
171 /* 42 S> */ B(LdaZero), 171 /* 42 S> */ B(LdaZero),
172 B(Star), R(0), 172 B(Star), R(0),
173 /* 45 E> */ B(StackCheck), 173 /* 45 E> */ B(StackCheck),
174 /* 71 S> */ B(LdaSmi), U8(3), 174 /* 71 S> */ B(LdaSmi), I8(3),
175 /* 71 E> */ B(TestLessThan), R(0), U8(2), 175 /* 71 E> */ B(TestLessThan), R(0), U8(2),
176 B(JumpIfFalse), U8(22), 176 B(JumpIfFalse), U8(22),
177 /* 62 E> */ B(StackCheck), 177 /* 62 E> */ B(StackCheck),
178 /* 82 S> */ B(LdaSmi), U8(2), 178 /* 82 S> */ B(LdaSmi), I8(2),
179 /* 88 E> */ B(TestEqual), R(0), U8(3), 179 /* 88 E> */ B(TestEqual), R(0), U8(3),
180 B(JumpIfFalse), U8(4), 180 B(JumpIfFalse), U8(4),
181 /* 94 S> */ B(Jump), U8(12), 181 /* 94 S> */ B(Jump), U8(12),
182 /* 105 S> */ B(LdaSmi), U8(1), 182 /* 105 S> */ B(LdaSmi), I8(1),
183 /* 111 E> */ B(Add), R(0), U8(4), 183 /* 111 E> */ B(Add), R(0), U8(4),
184 B(Star), R(0), 184 B(Star), R(0),
185 B(JumpLoop), U8(24), U8(1), 185 B(JumpLoop), U8(24), I8(1),
186 /* 122 S> */ B(LdaSmi), U8(1), 186 /* 122 S> */ B(LdaSmi), I8(1),
187 /* 128 E> */ B(Add), R(0), U8(5), 187 /* 128 E> */ B(Add), R(0), U8(5),
188 B(Star), R(0), 188 B(Star), R(0),
189 /* 135 S> */ B(Jump), U8(2), 189 /* 135 S> */ B(Jump), U8(2),
190 /* 144 S> */ B(Ldar), R(0), 190 /* 144 S> */ B(Ldar), R(0),
191 /* 154 S> */ B(Return), 191 /* 154 S> */ B(Return),
192 ] 192 ]
193 constant pool: [ 193 constant pool: [
194 ] 194 ]
195 handlers: [ 195 handlers: [
196 ] 196 ]
197 197
198 --- 198 ---
199 snippet: " 199 snippet: "
200 var x = 10; 200 var x = 10;
201 var y = 1; 201 var y = 1;
202 while (x) { 202 while (x) {
203 y = y * 12; 203 y = y * 12;
204 x = x - 1; 204 x = x - 1;
205 } 205 }
206 return y; 206 return y;
207 " 207 "
208 frame size: 2 208 frame size: 2
209 parameter count: 1 209 parameter count: 1
210 bytecode array length: 34 210 bytecode array length: 34
211 bytecodes: [ 211 bytecodes: [
212 /* 30 E> */ B(StackCheck), 212 /* 30 E> */ B(StackCheck),
213 /* 42 S> */ B(LdaSmi), U8(10), 213 /* 42 S> */ B(LdaSmi), I8(10),
214 B(Star), R(0), 214 B(Star), R(0),
215 /* 54 S> */ B(LdaSmi), U8(1), 215 /* 54 S> */ B(LdaSmi), I8(1),
216 B(Star), R(1), 216 B(Star), R(1),
217 /* 64 S> */ B(Ldar), R(0), 217 /* 64 S> */ B(Ldar), R(0),
218 B(JumpIfToBooleanFalse), U8(20), 218 B(JumpIfToBooleanFalse), U8(20),
219 /* 57 E> */ B(StackCheck), 219 /* 57 E> */ B(StackCheck),
220 /* 71 S> */ B(LdaSmi), U8(12), 220 /* 71 S> */ B(LdaSmi), I8(12),
221 /* 77 E> */ B(Mul), R(1), U8(2), 221 /* 77 E> */ B(Mul), R(1), U8(2),
222 B(Star), R(1), 222 B(Star), R(1),
223 /* 85 S> */ B(LdaSmi), U8(1), 223 /* 85 S> */ B(LdaSmi), I8(1),
224 /* 91 E> */ B(Sub), R(0), U8(3), 224 /* 91 E> */ B(Sub), R(0), U8(3),
225 B(Star), R(0), 225 B(Star), R(0),
226 B(JumpLoop), U8(19), U8(0), 226 B(JumpLoop), U8(19), I8(0),
227 /* 98 S> */ B(Ldar), R(1), 227 /* 98 S> */ B(Ldar), R(1),
228 /* 108 S> */ B(Return), 228 /* 108 S> */ B(Return),
229 ] 229 ]
230 constant pool: [ 230 constant pool: [
231 ] 231 ]
232 handlers: [ 232 handlers: [
233 ] 233 ]
234 234
235 --- 235 ---
236 snippet: " 236 snippet: "
237 var x = 0; var y = 1; 237 var x = 0; var y = 1;
238 do { 238 do {
239 y = y * 10; 239 y = y * 10;
240 if (x == 5) break; 240 if (x == 5) break;
241 if (x == 6) continue; 241 if (x == 6) continue;
242 x = x + 1; 242 x = x + 1;
243 } while (x < 10); 243 } while (x < 10);
244 return y; 244 return y;
245 " 245 "
246 frame size: 2 246 frame size: 2
247 parameter count: 1 247 parameter count: 1
248 bytecode array length: 54 248 bytecode array length: 54
249 bytecodes: [ 249 bytecodes: [
250 /* 30 E> */ B(StackCheck), 250 /* 30 E> */ B(StackCheck),
251 /* 42 S> */ B(LdaZero), 251 /* 42 S> */ B(LdaZero),
252 B(Star), R(0), 252 B(Star), R(0),
253 /* 53 S> */ B(LdaSmi), U8(1), 253 /* 53 S> */ B(LdaSmi), I8(1),
254 B(Star), R(1), 254 B(Star), R(1),
255 /* 56 E> */ B(StackCheck), 255 /* 56 E> */ B(StackCheck),
256 /* 63 S> */ B(LdaSmi), U8(10), 256 /* 63 S> */ B(LdaSmi), I8(10),
257 /* 69 E> */ B(Mul), R(1), U8(2), 257 /* 69 E> */ B(Mul), R(1), U8(2),
258 B(Star), R(1), 258 B(Star), R(1),
259 /* 77 S> */ B(LdaSmi), U8(5), 259 /* 77 S> */ B(LdaSmi), I8(5),
260 /* 83 E> */ B(TestEqual), R(0), U8(3), 260 /* 83 E> */ B(TestEqual), R(0), U8(3),
261 B(JumpIfFalse), U8(4), 261 B(JumpIfFalse), U8(4),
262 /* 89 S> */ B(Jump), U8(28), 262 /* 89 S> */ B(Jump), U8(28),
263 /* 98 S> */ B(LdaSmi), U8(6), 263 /* 98 S> */ B(LdaSmi), I8(6),
264 /* 104 E> */ B(TestEqual), R(0), U8(4), 264 /* 104 E> */ B(TestEqual), R(0), U8(4),
265 B(JumpIfFalse), U8(4), 265 B(JumpIfFalse), U8(4),
266 /* 110 S> */ B(Jump), U8(9), 266 /* 110 S> */ B(Jump), U8(9),
267 /* 122 S> */ B(LdaSmi), U8(1), 267 /* 122 S> */ B(LdaSmi), I8(1),
268 /* 128 E> */ B(Add), R(0), U8(5), 268 /* 128 E> */ B(Add), R(0), U8(5),
269 B(Star), R(0), 269 B(Star), R(0),
270 /* 144 S> */ B(LdaSmi), U8(10), 270 /* 144 S> */ B(LdaSmi), I8(10),
271 /* 144 E> */ B(TestLessThan), R(0), U8(6), 271 /* 144 E> */ B(TestLessThan), R(0), U8(6),
272 B(JumpIfFalse), U8(5), 272 B(JumpIfFalse), U8(5),
273 B(JumpLoop), U8(40), U8(0), 273 B(JumpLoop), U8(40), I8(0),
274 /* 151 S> */ B(Ldar), R(1), 274 /* 151 S> */ B(Ldar), R(1),
275 /* 161 S> */ B(Return), 275 /* 161 S> */ B(Return),
276 ] 276 ]
277 constant pool: [ 277 constant pool: [
278 ] 278 ]
279 handlers: [ 279 handlers: [
280 ] 280 ]
281 281
282 --- 282 ---
283 snippet: " 283 snippet: "
284 var x = 10; 284 var x = 10;
285 var y = 1; 285 var y = 1;
286 do { 286 do {
287 y = y * 12; 287 y = y * 12;
288 x = x - 1; 288 x = x - 1;
289 } while (x); 289 } while (x);
290 return y; 290 return y;
291 " 291 "
292 frame size: 2 292 frame size: 2
293 parameter count: 1 293 parameter count: 1
294 bytecode array length: 32 294 bytecode array length: 32
295 bytecodes: [ 295 bytecodes: [
296 /* 30 E> */ B(StackCheck), 296 /* 30 E> */ B(StackCheck),
297 /* 42 S> */ B(LdaSmi), U8(10), 297 /* 42 S> */ B(LdaSmi), I8(10),
298 B(Star), R(0), 298 B(Star), R(0),
299 /* 54 S> */ B(LdaSmi), U8(1), 299 /* 54 S> */ B(LdaSmi), I8(1),
300 B(Star), R(1), 300 B(Star), R(1),
301 /* 57 E> */ B(StackCheck), 301 /* 57 E> */ B(StackCheck),
302 /* 64 S> */ B(LdaSmi), U8(12), 302 /* 64 S> */ B(LdaSmi), I8(12),
303 /* 70 E> */ B(Mul), R(1), U8(2), 303 /* 70 E> */ B(Mul), R(1), U8(2),
304 B(Star), R(1), 304 B(Star), R(1),
305 /* 78 S> */ B(LdaSmi), U8(1), 305 /* 78 S> */ B(LdaSmi), I8(1),
306 /* 84 E> */ B(Sub), R(0), U8(3), 306 /* 84 E> */ B(Sub), R(0), U8(3),
307 B(Star), R(0), 307 B(Star), R(0),
308 /* 98 S> */ B(JumpIfToBooleanFalse), U8(5), 308 /* 98 S> */ B(JumpIfToBooleanFalse), U8(5),
309 B(JumpLoop), U8(17), U8(0), 309 B(JumpLoop), U8(17), I8(0),
310 /* 102 S> */ B(Ldar), R(1), 310 /* 102 S> */ B(Ldar), R(1),
311 /* 112 S> */ B(Return), 311 /* 112 S> */ B(Return),
312 ] 312 ]
313 constant pool: [ 313 constant pool: [
314 ] 314 ]
315 handlers: [ 315 handlers: [
316 ] 316 ]
317 317
318 --- 318 ---
319 snippet: " 319 snippet: "
320 var x = 0; var y = 1; 320 var x = 0; var y = 1;
321 do { 321 do {
322 y = y * 10; 322 y = y * 10;
323 if (x == 5) break; 323 if (x == 5) break;
324 x = x + 1; 324 x = x + 1;
325 if (x == 6) continue; 325 if (x == 6) continue;
326 } while (false); 326 } while (false);
327 return y; 327 return y;
328 " 328 "
329 frame size: 2 329 frame size: 2
330 parameter count: 1 330 parameter count: 1
331 bytecode array length: 44 331 bytecode array length: 44
332 bytecodes: [ 332 bytecodes: [
333 /* 30 E> */ B(StackCheck), 333 /* 30 E> */ B(StackCheck),
334 /* 42 S> */ B(LdaZero), 334 /* 42 S> */ B(LdaZero),
335 B(Star), R(0), 335 B(Star), R(0),
336 /* 53 S> */ B(LdaSmi), U8(1), 336 /* 53 S> */ B(LdaSmi), I8(1),
337 B(Star), R(1), 337 B(Star), R(1),
338 /* 56 E> */ B(StackCheck), 338 /* 56 E> */ B(StackCheck),
339 /* 63 S> */ B(LdaSmi), U8(10), 339 /* 63 S> */ B(LdaSmi), I8(10),
340 /* 69 E> */ B(Mul), R(1), U8(2), 340 /* 69 E> */ B(Mul), R(1), U8(2),
341 B(Star), R(1), 341 B(Star), R(1),
342 /* 77 S> */ B(LdaSmi), U8(5), 342 /* 77 S> */ B(LdaSmi), I8(5),
343 /* 83 E> */ B(TestEqual), R(0), U8(3), 343 /* 83 E> */ B(TestEqual), R(0), U8(3),
344 B(JumpIfFalse), U8(4), 344 B(JumpIfFalse), U8(4),
345 /* 89 S> */ B(Jump), U8(18), 345 /* 89 S> */ B(Jump), U8(18),
346 /* 98 S> */ B(LdaSmi), U8(1), 346 /* 98 S> */ B(LdaSmi), I8(1),
347 /* 104 E> */ B(Add), R(0), U8(4), 347 /* 104 E> */ B(Add), R(0), U8(4),
348 B(Star), R(0), 348 B(Star), R(0),
349 /* 111 S> */ B(LdaSmi), U8(6), 349 /* 111 S> */ B(LdaSmi), I8(6),
350 /* 117 E> */ B(TestEqual), R(0), U8(5), 350 /* 117 E> */ B(TestEqual), R(0), U8(5),
351 B(JumpIfFalse), U8(4), 351 B(JumpIfFalse), U8(4),
352 /* 123 S> */ B(Jump), U8(2), 352 /* 123 S> */ B(Jump), U8(2),
353 /* 150 S> */ B(Ldar), R(1), 353 /* 150 S> */ B(Ldar), R(1),
354 /* 160 S> */ B(Return), 354 /* 160 S> */ B(Return),
355 ] 355 ]
356 constant pool: [ 356 constant pool: [
357 ] 357 ]
358 handlers: [ 358 handlers: [
359 ] 359 ]
360 360
361 --- 361 ---
362 snippet: " 362 snippet: "
363 var x = 0; var y = 1; 363 var x = 0; var y = 1;
364 do { 364 do {
365 y = y * 10; 365 y = y * 10;
366 if (x == 5) break; 366 if (x == 5) break;
367 x = x + 1; 367 x = x + 1;
368 if (x == 6) continue; 368 if (x == 6) continue;
369 } while (true); 369 } while (true);
370 return y; 370 return y;
371 " 371 "
372 frame size: 2 372 frame size: 2
373 parameter count: 1 373 parameter count: 1
374 bytecode array length: 47 374 bytecode array length: 47
375 bytecodes: [ 375 bytecodes: [
376 /* 30 E> */ B(StackCheck), 376 /* 30 E> */ B(StackCheck),
377 /* 42 S> */ B(LdaZero), 377 /* 42 S> */ B(LdaZero),
378 B(Star), R(0), 378 B(Star), R(0),
379 /* 53 S> */ B(LdaSmi), U8(1), 379 /* 53 S> */ B(LdaSmi), I8(1),
380 B(Star), R(1), 380 B(Star), R(1),
381 /* 56 E> */ B(StackCheck), 381 /* 56 E> */ B(StackCheck),
382 /* 63 S> */ B(LdaSmi), U8(10), 382 /* 63 S> */ B(LdaSmi), I8(10),
383 /* 69 E> */ B(Mul), R(1), U8(2), 383 /* 69 E> */ B(Mul), R(1), U8(2),
384 B(Star), R(1), 384 B(Star), R(1),
385 /* 77 S> */ B(LdaSmi), U8(5), 385 /* 77 S> */ B(LdaSmi), I8(5),
386 /* 83 E> */ B(TestEqual), R(0), U8(3), 386 /* 83 E> */ B(TestEqual), R(0), U8(3),
387 B(JumpIfFalse), U8(4), 387 B(JumpIfFalse), U8(4),
388 /* 89 S> */ B(Jump), U8(21), 388 /* 89 S> */ B(Jump), U8(21),
389 /* 98 S> */ B(LdaSmi), U8(1), 389 /* 98 S> */ B(LdaSmi), I8(1),
390 /* 104 E> */ B(Add), R(0), U8(4), 390 /* 104 E> */ B(Add), R(0), U8(4),
391 B(Star), R(0), 391 B(Star), R(0),
392 /* 111 S> */ B(LdaSmi), U8(6), 392 /* 111 S> */ B(LdaSmi), I8(6),
393 /* 117 E> */ B(TestEqual), R(0), U8(5), 393 /* 117 E> */ B(TestEqual), R(0), U8(5),
394 B(JumpIfFalse), U8(4), 394 B(JumpIfFalse), U8(4),
395 /* 123 S> */ B(Jump), U8(2), 395 /* 123 S> */ B(Jump), U8(2),
396 B(JumpLoop), U8(33), U8(0), 396 B(JumpLoop), U8(33), I8(0),
397 /* 149 S> */ B(Ldar), R(1), 397 /* 149 S> */ B(Ldar), R(1),
398 /* 159 S> */ B(Return), 398 /* 159 S> */ B(Return),
399 ] 399 ]
400 constant pool: [ 400 constant pool: [
401 ] 401 ]
402 handlers: [ 402 handlers: [
403 ] 403 ]
404 404
405 --- 405 ---
406 snippet: " 406 snippet: "
407 var x = 0; 407 var x = 0;
408 for (;;) { 408 for (;;) {
409 if (x == 1) break; 409 if (x == 1) break;
410 if (x == 2) continue; 410 if (x == 2) continue;
411 x = x + 1; 411 x = x + 1;
412 } 412 }
413 " 413 "
414 frame size: 1 414 frame size: 1
415 parameter count: 1 415 parameter count: 1
416 bytecode array length: 35 416 bytecode array length: 35
417 bytecodes: [ 417 bytecodes: [
418 /* 30 E> */ B(StackCheck), 418 /* 30 E> */ B(StackCheck),
419 /* 42 S> */ B(LdaZero), 419 /* 42 S> */ B(LdaZero),
420 B(Star), R(0), 420 B(Star), R(0),
421 /* 45 E> */ B(StackCheck), 421 /* 45 E> */ B(StackCheck),
422 /* 58 S> */ B(LdaSmi), U8(1), 422 /* 58 S> */ B(LdaSmi), I8(1),
423 /* 64 E> */ B(TestEqual), R(0), U8(2), 423 /* 64 E> */ B(TestEqual), R(0), U8(2),
424 B(JumpIfFalse), U8(4), 424 B(JumpIfFalse), U8(4),
425 /* 70 S> */ B(Jump), U8(21), 425 /* 70 S> */ B(Jump), U8(21),
426 /* 79 S> */ B(LdaSmi), U8(2), 426 /* 79 S> */ B(LdaSmi), I8(2),
427 /* 85 E> */ B(TestEqual), R(0), U8(3), 427 /* 85 E> */ B(TestEqual), R(0), U8(3),
428 B(JumpIfFalse), U8(4), 428 B(JumpIfFalse), U8(4),
429 /* 91 S> */ B(Jump), U8(9), 429 /* 91 S> */ B(Jump), U8(9),
430 /* 103 S> */ B(LdaSmi), U8(1), 430 /* 103 S> */ B(LdaSmi), I8(1),
431 /* 109 E> */ B(Add), R(0), U8(4), 431 /* 109 E> */ B(Add), R(0), U8(4),
432 B(Star), R(0), 432 B(Star), R(0),
433 B(JumpLoop), U8(26), U8(0), 433 B(JumpLoop), U8(26), I8(0),
434 B(LdaUndefined), 434 B(LdaUndefined),
435 /* 116 S> */ B(Return), 435 /* 116 S> */ B(Return),
436 ] 436 ]
437 constant pool: [ 437 constant pool: [
438 ] 438 ]
439 handlers: [ 439 handlers: [
440 ] 440 ]
441 441
442 --- 442 ---
443 snippet: " 443 snippet: "
444 for (var x = 0;;) { 444 for (var x = 0;;) {
445 if (x == 1) break; 445 if (x == 1) break;
446 if (x == 2) continue; 446 if (x == 2) continue;
447 x = x + 1; 447 x = x + 1;
448 } 448 }
449 " 449 "
450 frame size: 1 450 frame size: 1
451 parameter count: 1 451 parameter count: 1
452 bytecode array length: 35 452 bytecode array length: 35
453 bytecodes: [ 453 bytecodes: [
454 /* 30 E> */ B(StackCheck), 454 /* 30 E> */ B(StackCheck),
455 /* 47 S> */ B(LdaZero), 455 /* 47 S> */ B(LdaZero),
456 B(Star), R(0), 456 B(Star), R(0),
457 /* 34 E> */ B(StackCheck), 457 /* 34 E> */ B(StackCheck),
458 /* 56 S> */ B(LdaSmi), U8(1), 458 /* 56 S> */ B(LdaSmi), I8(1),
459 /* 62 E> */ B(TestEqual), R(0), U8(2), 459 /* 62 E> */ B(TestEqual), R(0), U8(2),
460 B(JumpIfFalse), U8(4), 460 B(JumpIfFalse), U8(4),
461 /* 68 S> */ B(Jump), U8(21), 461 /* 68 S> */ B(Jump), U8(21),
462 /* 77 S> */ B(LdaSmi), U8(2), 462 /* 77 S> */ B(LdaSmi), I8(2),
463 /* 83 E> */ B(TestEqual), R(0), U8(3), 463 /* 83 E> */ B(TestEqual), R(0), U8(3),
464 B(JumpIfFalse), U8(4), 464 B(JumpIfFalse), U8(4),
465 /* 89 S> */ B(Jump), U8(9), 465 /* 89 S> */ B(Jump), U8(9),
466 /* 101 S> */ B(LdaSmi), U8(1), 466 /* 101 S> */ B(LdaSmi), I8(1),
467 /* 107 E> */ B(Add), R(0), U8(4), 467 /* 107 E> */ B(Add), R(0), U8(4),
468 B(Star), R(0), 468 B(Star), R(0),
469 B(JumpLoop), U8(26), U8(0), 469 B(JumpLoop), U8(26), I8(0),
470 B(LdaUndefined), 470 B(LdaUndefined),
471 /* 114 S> */ B(Return), 471 /* 114 S> */ B(Return),
472 ] 472 ]
473 constant pool: [ 473 constant pool: [
474 ] 474 ]
475 handlers: [ 475 handlers: [
476 ] 476 ]
477 477
478 --- 478 ---
479 snippet: " 479 snippet: "
480 var x = 0; 480 var x = 0;
481 for (;; x = x + 1) { 481 for (;; x = x + 1) {
482 if (x == 1) break; 482 if (x == 1) break;
483 if (x == 2) continue; 483 if (x == 2) continue;
484 } 484 }
485 " 485 "
486 frame size: 1 486 frame size: 1
487 parameter count: 1 487 parameter count: 1
488 bytecode array length: 35 488 bytecode array length: 35
489 bytecodes: [ 489 bytecodes: [
490 /* 30 E> */ B(StackCheck), 490 /* 30 E> */ B(StackCheck),
491 /* 42 S> */ B(LdaZero), 491 /* 42 S> */ B(LdaZero),
492 B(Star), R(0), 492 B(Star), R(0),
493 /* 45 E> */ B(StackCheck), 493 /* 45 E> */ B(StackCheck),
494 /* 68 S> */ B(LdaSmi), U8(1), 494 /* 68 S> */ B(LdaSmi), I8(1),
495 /* 74 E> */ B(TestEqual), R(0), U8(3), 495 /* 74 E> */ B(TestEqual), R(0), U8(3),
496 B(JumpIfFalse), U8(4), 496 B(JumpIfFalse), U8(4),
497 /* 80 S> */ B(Jump), U8(21), 497 /* 80 S> */ B(Jump), U8(21),
498 /* 89 S> */ B(LdaSmi), U8(2), 498 /* 89 S> */ B(LdaSmi), I8(2),
499 /* 95 E> */ B(TestEqual), R(0), U8(4), 499 /* 95 E> */ B(TestEqual), R(0), U8(4),
500 B(JumpIfFalse), U8(4), 500 B(JumpIfFalse), U8(4),
501 /* 101 S> */ B(Jump), U8(2), 501 /* 101 S> */ B(Jump), U8(2),
502 /* 55 S> */ B(LdaSmi), U8(1), 502 /* 55 S> */ B(LdaSmi), I8(1),
503 /* 59 E> */ B(Add), R(0), U8(2), 503 /* 59 E> */ B(Add), R(0), U8(2),
504 B(Star), R(0), 504 B(Star), R(0),
505 B(JumpLoop), U8(26), U8(0), 505 B(JumpLoop), U8(26), I8(0),
506 B(LdaUndefined), 506 B(LdaUndefined),
507 /* 113 S> */ B(Return), 507 /* 113 S> */ B(Return),
508 ] 508 ]
509 constant pool: [ 509 constant pool: [
510 ] 510 ]
511 handlers: [ 511 handlers: [
512 ] 512 ]
513 513
514 --- 514 ---
515 snippet: " 515 snippet: "
516 for (var x = 0;; x = x + 1) { 516 for (var x = 0;; x = x + 1) {
517 if (x == 1) break; 517 if (x == 1) break;
518 if (x == 2) continue; 518 if (x == 2) continue;
519 } 519 }
520 " 520 "
521 frame size: 1 521 frame size: 1
522 parameter count: 1 522 parameter count: 1
523 bytecode array length: 35 523 bytecode array length: 35
524 bytecodes: [ 524 bytecodes: [
525 /* 30 E> */ B(StackCheck), 525 /* 30 E> */ B(StackCheck),
526 /* 47 S> */ B(LdaZero), 526 /* 47 S> */ B(LdaZero),
527 B(Star), R(0), 527 B(Star), R(0),
528 /* 34 E> */ B(StackCheck), 528 /* 34 E> */ B(StackCheck),
529 /* 66 S> */ B(LdaSmi), U8(1), 529 /* 66 S> */ B(LdaSmi), I8(1),
530 /* 72 E> */ B(TestEqual), R(0), U8(3), 530 /* 72 E> */ B(TestEqual), R(0), U8(3),
531 B(JumpIfFalse), U8(4), 531 B(JumpIfFalse), U8(4),
532 /* 78 S> */ B(Jump), U8(21), 532 /* 78 S> */ B(Jump), U8(21),
533 /* 87 S> */ B(LdaSmi), U8(2), 533 /* 87 S> */ B(LdaSmi), I8(2),
534 /* 93 E> */ B(TestEqual), R(0), U8(4), 534 /* 93 E> */ B(TestEqual), R(0), U8(4),
535 B(JumpIfFalse), U8(4), 535 B(JumpIfFalse), U8(4),
536 /* 99 S> */ B(Jump), U8(2), 536 /* 99 S> */ B(Jump), U8(2),
537 /* 53 S> */ B(LdaSmi), U8(1), 537 /* 53 S> */ B(LdaSmi), I8(1),
538 /* 57 E> */ B(Add), R(0), U8(2), 538 /* 57 E> */ B(Add), R(0), U8(2),
539 B(Star), R(0), 539 B(Star), R(0),
540 B(JumpLoop), U8(26), U8(0), 540 B(JumpLoop), U8(26), I8(0),
541 B(LdaUndefined), 541 B(LdaUndefined),
542 /* 111 S> */ B(Return), 542 /* 111 S> */ B(Return),
543 ] 543 ]
544 constant pool: [ 544 constant pool: [
545 ] 545 ]
546 handlers: [ 546 handlers: [
547 ] 547 ]
548 548
549 --- 549 ---
550 snippet: " 550 snippet: "
551 var u = 0; 551 var u = 0;
552 for (var i = 0; i < 100; i = i + 1) { 552 for (var i = 0; i < 100; i = i + 1) {
553 u = u + 1; 553 u = u + 1;
554 continue; 554 continue;
555 } 555 }
556 " 556 "
557 frame size: 2 557 frame size: 2
558 parameter count: 1 558 parameter count: 1
559 bytecode array length: 36 559 bytecode array length: 36
560 bytecodes: [ 560 bytecodes: [
561 /* 30 E> */ B(StackCheck), 561 /* 30 E> */ B(StackCheck),
562 /* 42 S> */ B(LdaZero), 562 /* 42 S> */ B(LdaZero),
563 B(Star), R(0), 563 B(Star), R(0),
564 /* 58 S> */ B(LdaZero), 564 /* 58 S> */ B(LdaZero),
565 B(Star), R(1), 565 B(Star), R(1),
566 /* 63 S> */ B(LdaSmi), U8(100), 566 /* 63 S> */ B(LdaSmi), I8(100),
567 /* 63 E> */ B(TestLessThan), R(1), U8(2), 567 /* 63 E> */ B(TestLessThan), R(1), U8(2),
568 B(JumpIfFalse), U8(22), 568 B(JumpIfFalse), U8(22),
569 /* 45 E> */ B(StackCheck), 569 /* 45 E> */ B(StackCheck),
570 /* 85 S> */ B(LdaSmi), U8(1), 570 /* 85 S> */ B(LdaSmi), I8(1),
571 /* 91 E> */ B(Add), R(0), U8(4), 571 /* 91 E> */ B(Add), R(0), U8(4),
572 B(Star), R(0), 572 B(Star), R(0),
573 /* 98 S> */ B(Jump), U8(2), 573 /* 98 S> */ B(Jump), U8(2),
574 /* 72 S> */ B(LdaSmi), U8(1), 574 /* 72 S> */ B(LdaSmi), I8(1),
575 /* 76 E> */ B(Add), R(1), U8(3), 575 /* 76 E> */ B(Add), R(1), U8(3),
576 B(Star), R(1), 576 B(Star), R(1),
577 B(JumpLoop), U8(24), U8(0), 577 B(JumpLoop), U8(24), I8(0),
578 B(LdaUndefined), 578 B(LdaUndefined),
579 /* 110 S> */ B(Return), 579 /* 110 S> */ B(Return),
580 ] 580 ]
581 constant pool: [ 581 constant pool: [
582 ] 582 ]
583 handlers: [ 583 handlers: [
584 ] 584 ]
585 585
586 --- 586 ---
587 snippet: " 587 snippet: "
588 var y = 1; 588 var y = 1;
589 for (var x = 10; x; --x) { 589 for (var x = 10; x; --x) {
590 y = y * 12; 590 y = y * 12;
591 } 591 }
592 return y; 592 return y;
593 " 593 "
594 frame size: 2 594 frame size: 2
595 parameter count: 1 595 parameter count: 1
596 bytecode array length: 33 596 bytecode array length: 33
597 bytecodes: [ 597 bytecodes: [
598 /* 30 E> */ B(StackCheck), 598 /* 30 E> */ B(StackCheck),
599 /* 42 S> */ B(LdaSmi), U8(1), 599 /* 42 S> */ B(LdaSmi), I8(1),
600 B(Star), R(0), 600 B(Star), R(0),
601 /* 58 S> */ B(LdaSmi), U8(10), 601 /* 58 S> */ B(LdaSmi), I8(10),
602 B(Star), R(1), 602 B(Star), R(1),
603 /* 62 S> */ B(Ldar), R(1), 603 /* 62 S> */ B(Ldar), R(1),
604 B(JumpIfToBooleanFalse), U8(19), 604 B(JumpIfToBooleanFalse), U8(19),
605 /* 45 E> */ B(StackCheck), 605 /* 45 E> */ B(StackCheck),
606 /* 74 S> */ B(LdaSmi), U8(12), 606 /* 74 S> */ B(LdaSmi), I8(12),
607 /* 80 E> */ B(Mul), R(0), U8(3), 607 /* 80 E> */ B(Mul), R(0), U8(3),
608 B(Star), R(0), 608 B(Star), R(0),
609 /* 67 S> */ B(Ldar), R(1), 609 /* 67 S> */ B(Ldar), R(1),
610 B(Dec), U8(2), 610 B(Dec), U8(2),
611 B(Star), R(1), 611 B(Star), R(1),
612 B(JumpLoop), U8(18), U8(0), 612 B(JumpLoop), U8(18), I8(0),
613 /* 88 S> */ B(Ldar), R(0), 613 /* 88 S> */ B(Ldar), R(0),
614 /* 98 S> */ B(Return), 614 /* 98 S> */ B(Return),
615 ] 615 ]
616 constant pool: [ 616 constant pool: [
617 ] 617 ]
618 handlers: [ 618 handlers: [
619 ] 619 ]
620 620
621 --- 621 ---
622 snippet: " 622 snippet: "
(...skipping 32 matching lines...) Expand 10 before | Expand all | Expand 10 after
655 frame size: 2 655 frame size: 2
656 parameter count: 1 656 parameter count: 1
657 bytecode array length: 36 657 bytecode array length: 36
658 bytecodes: [ 658 bytecodes: [
659 /* 30 E> */ B(StackCheck), 659 /* 30 E> */ B(StackCheck),
660 /* 42 S> */ B(LdaZero), 660 /* 42 S> */ B(LdaZero),
661 B(Star), R(0), 661 B(Star), R(0),
662 /* 58 S> */ B(LdaZero), 662 /* 58 S> */ B(LdaZero),
663 B(Star), R(1), 663 B(Star), R(1),
664 /* 45 E> */ B(StackCheck), 664 /* 45 E> */ B(StackCheck),
665 /* 76 S> */ B(LdaSmi), U8(1), 665 /* 76 S> */ B(LdaSmi), I8(1),
666 /* 82 E> */ B(Add), R(0), U8(3), 666 /* 82 E> */ B(Add), R(0), U8(3),
667 B(Star), R(0), 667 B(Star), R(0),
668 /* 89 S> */ B(LdaSmi), U8(20), 668 /* 89 S> */ B(LdaSmi), I8(20),
669 /* 95 E> */ B(TestEqual), R(0), U8(4), 669 /* 95 E> */ B(TestEqual), R(0), U8(4),
670 B(JumpIfFalse), U8(4), 670 B(JumpIfFalse), U8(4),
671 /* 102 S> */ B(Jump), U8(11), 671 /* 102 S> */ B(Jump), U8(11),
672 /* 69 S> */ B(Ldar), R(1), 672 /* 69 S> */ B(Ldar), R(1),
673 B(Inc), U8(2), 673 B(Inc), U8(2),
674 B(Star), R(1), 674 B(Star), R(1),
675 B(JumpLoop), U8(23), U8(0), 675 B(JumpLoop), U8(23), I8(0),
676 /* 112 S> */ B(Ldar), R(0), 676 /* 112 S> */ B(Ldar), R(0),
677 /* 122 S> */ B(Return), 677 /* 122 S> */ B(Return),
678 ] 678 ]
679 constant pool: [ 679 constant pool: [
680 ] 680 ]
681 handlers: [ 681 handlers: [
682 ] 682 ]
683 683
684 --- 684 ---
685 snippet: " 685 snippet: "
(...skipping 17 matching lines...) Expand all
703 /* 52 S> */ B(Ldar), R(1), 703 /* 52 S> */ B(Ldar), R(1),
704 B(JumpIfToBooleanFalse), U8(46), 704 B(JumpIfToBooleanFalse), U8(46),
705 /* 45 E> */ B(StackCheck), 705 /* 45 E> */ B(StackCheck),
706 B(Ldar), R(closure), 706 B(Ldar), R(closure),
707 B(CreateBlockContext), U8(0), 707 B(CreateBlockContext), U8(0),
708 B(PushContext), R(3), 708 B(PushContext), R(3),
709 B(LdaTheHole), 709 B(LdaTheHole),
710 B(StaCurrentContextSlot), U8(4), 710 B(StaCurrentContextSlot), U8(4),
711 B(CreateClosure), U8(1), U8(2), U8(2), 711 B(CreateClosure), U8(1), U8(2), U8(2),
712 B(Star), R(0), 712 B(Star), R(0),
713 /* 73 S> */ B(LdaSmi), U8(1), 713 /* 73 S> */ B(LdaSmi), I8(1),
714 /* 73 E> */ B(StaCurrentContextSlot), U8(4), 714 /* 73 E> */ B(StaCurrentContextSlot), U8(4),
715 B(Mov), R(0), R(2), 715 B(Mov), R(0), R(2),
716 /* 106 S> */ B(LdaCurrentContextSlot), U8(4), 716 /* 106 S> */ B(LdaCurrentContextSlot), U8(4),
717 B(JumpIfToBooleanFalse), U8(8), 717 B(JumpIfToBooleanFalse), U8(8),
718 /* 113 S> */ B(PopContext), R(3), 718 /* 113 S> */ B(PopContext), R(3),
719 B(PopContext), R(3), 719 B(PopContext), R(3),
720 B(Jump), U8(10), 720 B(Jump), U8(10),
721 /* 126 S> */ B(LdaCurrentContextSlot), U8(4), 721 /* 126 S> */ B(LdaCurrentContextSlot), U8(4),
722 B(Inc), U8(3), 722 B(Inc), U8(3),
723 /* 127 E> */ B(StaCurrentContextSlot), U8(4), 723 /* 127 E> */ B(StaCurrentContextSlot), U8(4),
724 B(PopContext), R(3), 724 B(PopContext), R(3),
725 B(JumpLoop), U8(45), U8(0), 725 B(JumpLoop), U8(45), I8(0),
726 B(LdaUndefined), 726 B(LdaUndefined),
727 /* 137 S> */ B(Return), 727 /* 137 S> */ B(Return),
728 ] 728 ]
729 constant pool: [ 729 constant pool: [
730 FIXED_ARRAY_TYPE, 730 FIXED_ARRAY_TYPE,
731 SHARED_FUNCTION_INFO_TYPE, 731 SHARED_FUNCTION_INFO_TYPE,
732 ] 732 ]
733 handlers: [ 733 handlers: [
734 ] 734 ]
735 735
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698