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

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

Issue 2038323002: [interpreter] Filter expression positions at source. (Closed) Base URL: https://chromium.googlesource.com/v8/v8.git@oth-0060-source-position-testing
Patch Set: Rebase Created 4 years, 6 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 pool type: number 6 pool type: number
7 execute: yes 7 execute: yes
8 wrap: yes 8 wrap: yes
9 9
10 --- 10 ---
11 snippet: " 11 snippet: "
12 var a = 1; 12 var a = 1;
13 switch(a) { 13 switch(a) {
14 case 1: return 2; 14 case 1: return 2;
15 case 2: return 3; 15 case 2: return 3;
16 } 16 }
17 " 17 "
18 frame size: 3 18 frame size: 3
19 parameter count: 1 19 parameter count: 1
20 bytecode array length: 33 20 bytecode array length: 32
21 bytecodes: [ 21 bytecodes: [
22 /* 30 E> */ B(StackCheck), 22 /* 30 E> */ B(StackCheck),
23 /* 42 S> */ B(LdaSmi), U8(1), 23 /* 42 S> */ B(LdaSmi), U8(1),
24 /* 42 E> */ B(Star), R(1), 24 B(Star), R(1),
25 /* 52 E> */ B(Nop),
26 B(Star), R(0), 25 B(Star), R(0),
27 /* 45 S> */ B(LdaSmi), U8(1), 26 /* 45 S> */ B(LdaSmi), U8(1),
28 B(TestEqualStrict), R(0), 27 B(TestEqualStrict), R(0),
29 B(Mov), R(0), R(2), 28 B(Mov), R(0), R(2),
30 B(JumpIfToBooleanTrue), U8(10), 29 B(JumpIfToBooleanTrue), U8(10),
31 B(LdaSmi), U8(2), 30 B(LdaSmi), U8(2),
32 B(TestEqualStrict), R(2), 31 B(TestEqualStrict), R(2),
33 B(JumpIfTrue), U8(7), 32 B(JumpIfTrue), U8(7),
34 B(Jump), U8(8), 33 B(Jump), U8(8),
35 /* 66 S> */ B(LdaSmi), U8(2), 34 /* 66 S> */ B(LdaSmi), U8(2),
(...skipping 11 matching lines...) Expand all
47 --- 46 ---
48 snippet: " 47 snippet: "
49 var a = 1; 48 var a = 1;
50 switch(a) { 49 switch(a) {
51 case 1: a = 2; break; 50 case 1: a = 2; break;
52 case 2: a = 3; break; 51 case 2: a = 3; break;
53 } 52 }
54 " 53 "
55 frame size: 3 54 frame size: 3
56 parameter count: 1 55 parameter count: 1
57 bytecode array length: 39 56 bytecode array length: 38
58 bytecodes: [ 57 bytecodes: [
59 /* 30 E> */ B(StackCheck), 58 /* 30 E> */ B(StackCheck),
60 /* 42 S> */ B(LdaSmi), U8(1), 59 /* 42 S> */ B(LdaSmi), U8(1),
61 /* 42 E> */ B(Star), R(1), 60 B(Star), R(1),
62 /* 52 E> */ B(Nop),
63 B(Star), R(0), 61 B(Star), R(0),
64 /* 45 S> */ B(LdaSmi), U8(1), 62 /* 45 S> */ B(LdaSmi), U8(1),
65 B(TestEqualStrict), R(0), 63 B(TestEqualStrict), R(0),
66 B(Mov), R(0), R(2), 64 B(Mov), R(0), R(2),
67 B(JumpIfToBooleanTrue), U8(10), 65 B(JumpIfToBooleanTrue), U8(10),
68 B(LdaSmi), U8(2), 66 B(LdaSmi), U8(2),
69 B(TestEqualStrict), R(2), 67 B(TestEqualStrict), R(2),
70 B(JumpIfTrue), U8(10), 68 B(JumpIfTrue), U8(10),
71 B(Jump), U8(14), 69 B(Jump), U8(14),
72 /* 66 S> */ B(LdaSmi), U8(2), 70 /* 66 S> */ B(LdaSmi), U8(2),
(...skipping 13 matching lines...) Expand all
86 --- 84 ---
87 snippet: " 85 snippet: "
88 var a = 1; 86 var a = 1;
89 switch(a) { 87 switch(a) {
90 case 1: a = 2; // fall-through 88 case 1: a = 2; // fall-through
91 case 2: a = 3; break; 89 case 2: a = 3; break;
92 } 90 }
93 " 91 "
94 frame size: 3 92 frame size: 3
95 parameter count: 1 93 parameter count: 1
96 bytecode array length: 37 94 bytecode array length: 36
97 bytecodes: [ 95 bytecodes: [
98 /* 30 E> */ B(StackCheck), 96 /* 30 E> */ B(StackCheck),
99 /* 42 S> */ B(LdaSmi), U8(1), 97 /* 42 S> */ B(LdaSmi), U8(1),
100 /* 42 E> */ B(Star), R(1), 98 B(Star), R(1),
101 /* 52 E> */ B(Nop),
102 B(Star), R(0), 99 B(Star), R(0),
103 /* 45 S> */ B(LdaSmi), U8(1), 100 /* 45 S> */ B(LdaSmi), U8(1),
104 B(TestEqualStrict), R(0), 101 B(TestEqualStrict), R(0),
105 B(Mov), R(0), R(2), 102 B(Mov), R(0), R(2),
106 B(JumpIfToBooleanTrue), U8(10), 103 B(JumpIfToBooleanTrue), U8(10),
107 B(LdaSmi), U8(2), 104 B(LdaSmi), U8(2),
108 B(TestEqualStrict), R(2), 105 B(TestEqualStrict), R(2),
109 B(JumpIfTrue), U8(8), 106 B(JumpIfTrue), U8(8),
110 B(Jump), U8(12), 107 B(Jump), U8(12),
111 /* 66 S> */ B(LdaSmi), U8(2), 108 /* 66 S> */ B(LdaSmi), U8(2),
112 /* 68 E> */ B(Star), R(1), 109 B(Star), R(1),
113 /* 98 S> */ B(LdaSmi), U8(3), 110 /* 98 S> */ B(LdaSmi), U8(3),
114 B(Star), R(1), 111 B(Star), R(1),
115 /* 105 S> */ B(Jump), U8(2), 112 /* 105 S> */ B(Jump), U8(2),
116 B(LdaUndefined), 113 B(LdaUndefined),
117 /* 114 S> */ B(Return), 114 /* 114 S> */ B(Return),
118 ] 115 ]
119 constant pool: [ 116 constant pool: [
120 ] 117 ]
121 handlers: [ 118 handlers: [
122 ] 119 ]
123 120
124 --- 121 ---
125 snippet: " 122 snippet: "
126 var a = 1; 123 var a = 1;
127 switch(a) { 124 switch(a) {
128 case 2: break; 125 case 2: break;
129 case 3: break; 126 case 3: break;
130 default: a = 1; break; 127 default: a = 1; break;
131 } 128 }
132 " 129 "
133 frame size: 3 130 frame size: 3
134 parameter count: 1 131 parameter count: 1
135 bytecode array length: 37 132 bytecode array length: 36
136 bytecodes: [ 133 bytecodes: [
137 /* 30 E> */ B(StackCheck), 134 /* 30 E> */ B(StackCheck),
138 /* 42 S> */ B(LdaSmi), U8(1), 135 /* 42 S> */ B(LdaSmi), U8(1),
139 /* 42 E> */ B(Star), R(1), 136 B(Star), R(1),
140 /* 52 E> */ B(Nop),
141 B(Star), R(0), 137 B(Star), R(0),
142 /* 45 S> */ B(LdaSmi), U8(2), 138 /* 45 S> */ B(LdaSmi), U8(2),
143 B(TestEqualStrict), R(0), 139 B(TestEqualStrict), R(0),
144 B(Mov), R(0), R(2), 140 B(Mov), R(0), R(2),
145 B(JumpIfToBooleanTrue), U8(10), 141 B(JumpIfToBooleanTrue), U8(10),
146 B(LdaSmi), U8(3), 142 B(LdaSmi), U8(3),
147 B(TestEqualStrict), R(2), 143 B(TestEqualStrict), R(2),
148 B(JumpIfTrue), U8(6), 144 B(JumpIfTrue), U8(6),
149 B(Jump), U8(6), 145 B(Jump), U8(6),
150 /* 66 S> */ B(Jump), U8(10), 146 /* 66 S> */ B(Jump), U8(10),
(...skipping 17 matching lines...) Expand all
168 case 3: a = 2; break; 164 case 3: a = 2; break;
169 default: a = 3; break; 165 default: a = 3; break;
170 } 166 }
171 " 167 "
172 frame size: 3 168 frame size: 3
173 parameter count: 1 169 parameter count: 1
174 bytecode array length: 45 170 bytecode array length: 45
175 bytecodes: [ 171 bytecodes: [
176 /* 30 E> */ B(StackCheck), 172 /* 30 E> */ B(StackCheck),
177 /* 42 S> */ B(LdaSmi), U8(1), 173 /* 42 S> */ B(LdaSmi), U8(1),
178 /* 42 E> */ B(Star), R(1), 174 B(Star), R(1),
179 B(TypeOf), 175 /* 42 E> */ B(TypeOf),
180 B(Star), R(0), 176 B(Star), R(0),
181 /* 45 S> */ B(LdaSmi), U8(2), 177 /* 45 S> */ B(LdaSmi), U8(2),
182 B(TestEqualStrict), R(0), 178 B(TestEqualStrict), R(0),
183 B(Mov), R(0), R(2), 179 B(Mov), R(0), R(2),
184 B(JumpIfToBooleanTrue), U8(10), 180 B(JumpIfToBooleanTrue), U8(10),
185 B(LdaSmi), U8(3), 181 B(LdaSmi), U8(3),
186 B(TestEqualStrict), R(2), 182 B(TestEqualStrict), R(2),
187 B(JumpIfTrue), U8(10), 183 B(JumpIfTrue), U8(10),
188 B(Jump), U8(14), 184 B(Jump), U8(14),
189 /* 74 S> */ B(LdaSmi), U8(1), 185 /* 74 S> */ B(LdaSmi), U8(1),
(...skipping 16 matching lines...) Expand all
206 --- 202 ---
207 snippet: " 203 snippet: "
208 var a = 1; 204 var a = 1;
209 switch(a) { 205 switch(a) {
210 case typeof(a): a = 1; break; 206 case typeof(a): a = 1; break;
211 default: a = 2; break; 207 default: a = 2; break;
212 } 208 }
213 " 209 "
214 frame size: 3 210 frame size: 3
215 parameter count: 1 211 parameter count: 1
216 bytecode array length: 32 212 bytecode array length: 31
217 bytecodes: [ 213 bytecodes: [
218 /* 30 E> */ B(StackCheck), 214 /* 30 E> */ B(StackCheck),
219 /* 42 S> */ B(LdaSmi), U8(1), 215 /* 42 S> */ B(LdaSmi), U8(1),
220 /* 42 E> */ B(Star), R(1), 216 B(Star), R(1),
221 /* 52 E> */ B(Nop),
222 B(Star), R(0), 217 B(Star), R(0),
223 /* 45 S> */ B(TypeOf), 218 /* 45 S> */ B(TypeOf),
224 B(TestEqualStrict), R(0), 219 B(TestEqualStrict), R(0),
225 B(Mov), R(0), R(2), 220 B(Mov), R(0), R(2),
226 B(JumpIfToBooleanTrue), U8(4), 221 B(JumpIfToBooleanTrue), U8(4),
227 B(Jump), U8(8), 222 B(Jump), U8(8),
228 /* 74 S> */ B(LdaSmi), U8(1), 223 /* 74 S> */ B(LdaSmi), U8(1),
229 B(Star), R(1), 224 B(Star), R(1),
230 /* 81 S> */ B(Jump), U8(8), 225 /* 81 S> */ B(Jump), U8(8),
231 /* 98 S> */ B(LdaSmi), U8(2), 226 /* 98 S> */ B(LdaSmi), U8(2),
(...skipping 77 matching lines...) Expand 10 before | Expand all | Expand 10 after
309 a = 2; 304 a = 2;
310 a = 2; 305 a = 2;
311 break; 306 break;
312 case 2: 307 case 2:
313 a = 3; 308 a = 3;
314 break; 309 break;
315 } 310 }
316 " 311 "
317 frame size: 3 312 frame size: 3
318 parameter count: 1 313 parameter count: 1
319 bytecode array length: 291 314 bytecode array length: 290
320 bytecodes: [ 315 bytecodes: [
321 /* 30 E> */ B(StackCheck), 316 /* 30 E> */ B(StackCheck),
322 /* 42 S> */ B(LdaSmi), U8(1), 317 /* 42 S> */ B(LdaSmi), U8(1),
323 /* 42 E> */ B(Star), R(1), 318 B(Star), R(1),
324 /* 52 E> */ B(Nop),
325 B(Star), R(0), 319 B(Star), R(0),
326 /* 45 S> */ B(LdaSmi), U8(1), 320 /* 45 S> */ B(LdaSmi), U8(1),
327 B(TestEqualStrict), R(0), 321 B(TestEqualStrict), R(0),
328 B(Mov), R(0), R(2), 322 B(Mov), R(0), R(2),
329 B(JumpIfToBooleanTrue), U8(10), 323 B(JumpIfToBooleanTrue), U8(10),
330 B(LdaSmi), U8(2), 324 B(LdaSmi), U8(2),
331 B(TestEqualStrict), R(2), 325 B(TestEqualStrict), R(2),
332 B(JumpIfTrueConstant), U8(0), 326 B(JumpIfTrueConstant), U8(0),
333 B(JumpConstant), U8(1), 327 B(JumpConstant), U8(1),
334 /* 68 S> */ B(LdaSmi), U8(2), 328 /* 68 S> */ B(LdaSmi), U8(2),
(...skipping 145 matching lines...) Expand 10 before | Expand all | Expand 10 after
480 case 1: 474 case 1:
481 switch(a + 1) { 475 switch(a + 1) {
482 case 2 : a = 1; break; 476 case 2 : a = 1; break;
483 default : a = 2; break; 477 default : a = 2; break;
484 } // fall-through 478 } // fall-through
485 case 2: a = 3; 479 case 2: a = 3;
486 } 480 }
487 " 481 "
488 frame size: 5 482 frame size: 5
489 parameter count: 1 483 parameter count: 1
490 bytecode array length: 60 484 bytecode array length: 59
491 bytecodes: [ 485 bytecodes: [
492 /* 30 E> */ B(StackCheck), 486 /* 30 E> */ B(StackCheck),
493 /* 42 S> */ B(LdaSmi), U8(1), 487 /* 42 S> */ B(LdaSmi), U8(1),
494 /* 42 E> */ B(Star), R(2), 488 B(Star), R(2),
495 /* 52 E> */ B(Nop),
496 B(Star), R(0), 489 B(Star), R(0),
497 /* 45 S> */ B(LdaSmi), U8(1), 490 /* 45 S> */ B(LdaSmi), U8(1),
498 B(TestEqualStrict), R(0), 491 B(TestEqualStrict), R(0),
499 B(Mov), R(0), R(3), 492 B(Mov), R(0), R(3),
500 B(JumpIfToBooleanTrue), U8(10), 493 B(JumpIfToBooleanTrue), U8(10),
501 B(LdaSmi), U8(2), 494 B(LdaSmi), U8(2),
502 B(TestEqualStrict), R(3), 495 B(TestEqualStrict), R(3),
503 B(JumpIfTrue), U8(33), 496 B(JumpIfTrue), U8(33),
504 B(Jump), U8(35), 497 B(Jump), U8(35),
505 /* 77 E> */ B(LdaSmi), U8(1), 498 B(LdaSmi), U8(1),
506 B(Add), R(2), 499 /* 77 E> */ B(Add), R(2),
507 B(Star), R(1), 500 B(Star), R(1),
508 /* 70 S> */ B(LdaSmi), U8(2), 501 /* 70 S> */ B(LdaSmi), U8(2),
509 B(TestEqualStrict), R(1), 502 B(TestEqualStrict), R(1),
510 B(Mov), R(1), R(4), 503 B(Mov), R(1), R(4),
511 B(JumpIfToBooleanTrue), U8(4), 504 B(JumpIfToBooleanTrue), U8(4),
512 B(Jump), U8(8), 505 B(Jump), U8(8),
513 /* 101 S> */ B(LdaSmi), U8(1), 506 /* 101 S> */ B(LdaSmi), U8(1),
514 B(Star), R(2), 507 B(Star), R(2),
515 /* 108 S> */ B(Jump), U8(8), 508 /* 108 S> */ B(Jump), U8(8),
516 /* 131 S> */ B(LdaSmi), U8(2), 509 /* 131 S> */ B(LdaSmi), U8(2),
517 B(Star), R(2), 510 B(Star), R(2),
518 /* 138 S> */ B(Jump), U8(2), 511 /* 138 S> */ B(Jump), U8(2),
519 /* 176 S> */ B(LdaSmi), U8(3), 512 /* 176 S> */ B(LdaSmi), U8(3),
520 /* 178 E> */ B(Star), R(2), 513 B(Star), R(2),
521 B(LdaUndefined), 514 B(LdaUndefined),
522 /* 185 S> */ B(Return), 515 /* 185 S> */ B(Return),
523 ] 516 ]
524 constant pool: [ 517 constant pool: [
525 ] 518 ]
526 handlers: [ 519 handlers: [
527 ] 520 ]
528 521
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698