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

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

Issue 2337123003: [turbofan] Collect invocation counts and compute relative call frequencies. (Closed)
Patch Set: Address feedback. Created 4 years, 3 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 execute: yes 6 execute: yes
7 wrap: yes 7 wrap: yes
8 8
9 --- 9 ---
10 snippet: " 10 snippet: "
11 var a = 1; 11 var a = 1;
12 switch(a) { 12 switch(a) {
13 case 1: return 2; 13 case 1: return 2;
14 case 2: return 3; 14 case 2: return 3;
15 } 15 }
16 " 16 "
17 frame size: 3 17 frame size: 3
18 parameter count: 1 18 parameter count: 1
19 bytecode array length: 34 19 bytecode array length: 34
20 bytecodes: [ 20 bytecodes: [
21 /* 30 E> */ B(StackCheck), 21 /* 30 E> */ B(StackCheck),
22 /* 42 S> */ B(LdaSmi), U8(1), 22 /* 42 S> */ B(LdaSmi), U8(1),
23 B(Star), R(0), 23 B(Star), R(0),
24 B(Star), R(1), 24 B(Star), R(1),
25 /* 45 S> */ B(LdaSmi), U8(1), 25 /* 45 S> */ B(LdaSmi), U8(1),
26 B(TestEqualStrict), R(1), U8(1), 26 B(TestEqualStrict), R(1), U8(2),
27 B(Mov), R(0), R(2), 27 B(Mov), R(0), R(2),
28 B(JumpIfToBooleanTrue), U8(11), 28 B(JumpIfToBooleanTrue), U8(11),
29 B(LdaSmi), U8(2), 29 B(LdaSmi), U8(2),
30 B(TestEqualStrict), R(2), U8(2), 30 B(TestEqualStrict), R(2), U8(3),
31 B(JumpIfTrue), U8(7), 31 B(JumpIfTrue), U8(7),
32 B(Jump), U8(8), 32 B(Jump), U8(8),
33 /* 66 S> */ B(LdaSmi), U8(2), 33 /* 66 S> */ B(LdaSmi), U8(2),
34 /* 97 S> */ B(Return), 34 /* 97 S> */ B(Return),
35 /* 85 S> */ B(LdaSmi), U8(3), 35 /* 85 S> */ B(LdaSmi), U8(3),
36 /* 97 S> */ B(Return), 36 /* 97 S> */ B(Return),
37 B(LdaUndefined), 37 B(LdaUndefined),
38 /* 97 S> */ B(Return), 38 /* 97 S> */ B(Return),
39 ] 39 ]
40 constant pool: [ 40 constant pool: [
(...skipping 11 matching lines...) Expand all
52 " 52 "
53 frame size: 3 53 frame size: 3
54 parameter count: 1 54 parameter count: 1
55 bytecode array length: 40 55 bytecode array length: 40
56 bytecodes: [ 56 bytecodes: [
57 /* 30 E> */ B(StackCheck), 57 /* 30 E> */ B(StackCheck),
58 /* 42 S> */ B(LdaSmi), U8(1), 58 /* 42 S> */ B(LdaSmi), U8(1),
59 B(Star), R(0), 59 B(Star), R(0),
60 B(Star), R(1), 60 B(Star), R(1),
61 /* 45 S> */ B(LdaSmi), U8(1), 61 /* 45 S> */ B(LdaSmi), U8(1),
62 B(TestEqualStrict), R(1), U8(1), 62 B(TestEqualStrict), R(1), U8(2),
63 B(Mov), R(0), R(2), 63 B(Mov), R(0), R(2),
64 B(JumpIfToBooleanTrue), U8(11), 64 B(JumpIfToBooleanTrue), U8(11),
65 B(LdaSmi), U8(2), 65 B(LdaSmi), U8(2),
66 B(TestEqualStrict), R(2), U8(2), 66 B(TestEqualStrict), R(2), U8(3),
67 B(JumpIfTrue), U8(10), 67 B(JumpIfTrue), U8(10),
68 B(Jump), U8(14), 68 B(Jump), U8(14),
69 /* 66 S> */ B(LdaSmi), U8(2), 69 /* 66 S> */ B(LdaSmi), U8(2),
70 B(Star), R(0), 70 B(Star), R(0),
71 /* 73 S> */ B(Jump), U8(8), 71 /* 73 S> */ B(Jump), U8(8),
72 /* 89 S> */ B(LdaSmi), U8(3), 72 /* 89 S> */ B(LdaSmi), U8(3),
73 B(Star), R(0), 73 B(Star), R(0),
74 /* 96 S> */ B(Jump), U8(2), 74 /* 96 S> */ B(Jump), U8(2),
75 B(LdaUndefined), 75 B(LdaUndefined),
76 /* 105 S> */ B(Return), 76 /* 105 S> */ B(Return),
(...skipping 13 matching lines...) Expand all
90 " 90 "
91 frame size: 3 91 frame size: 3
92 parameter count: 1 92 parameter count: 1
93 bytecode array length: 38 93 bytecode array length: 38
94 bytecodes: [ 94 bytecodes: [
95 /* 30 E> */ B(StackCheck), 95 /* 30 E> */ B(StackCheck),
96 /* 42 S> */ B(LdaSmi), U8(1), 96 /* 42 S> */ B(LdaSmi), U8(1),
97 B(Star), R(0), 97 B(Star), R(0),
98 B(Star), R(1), 98 B(Star), R(1),
99 /* 45 S> */ B(LdaSmi), U8(1), 99 /* 45 S> */ B(LdaSmi), U8(1),
100 B(TestEqualStrict), R(1), U8(1), 100 B(TestEqualStrict), R(1), U8(2),
101 B(Mov), R(0), R(2), 101 B(Mov), R(0), R(2),
102 B(JumpIfToBooleanTrue), U8(11), 102 B(JumpIfToBooleanTrue), U8(11),
103 B(LdaSmi), U8(2), 103 B(LdaSmi), U8(2),
104 B(TestEqualStrict), R(2), U8(2), 104 B(TestEqualStrict), R(2), U8(3),
105 B(JumpIfTrue), U8(8), 105 B(JumpIfTrue), U8(8),
106 B(Jump), U8(12), 106 B(Jump), U8(12),
107 /* 66 S> */ B(LdaSmi), U8(2), 107 /* 66 S> */ B(LdaSmi), U8(2),
108 B(Star), R(0), 108 B(Star), R(0),
109 /* 98 S> */ B(LdaSmi), U8(3), 109 /* 98 S> */ B(LdaSmi), U8(3),
110 B(Star), R(0), 110 B(Star), R(0),
111 /* 105 S> */ B(Jump), U8(2), 111 /* 105 S> */ B(Jump), U8(2),
112 B(LdaUndefined), 112 B(LdaUndefined),
113 /* 114 S> */ B(Return), 113 /* 114 S> */ B(Return),
114 ] 114 ]
(...skipping 13 matching lines...) Expand all
128 " 128 "
129 frame size: 3 129 frame size: 3
130 parameter count: 1 130 parameter count: 1
131 bytecode array length: 38 131 bytecode array length: 38
132 bytecodes: [ 132 bytecodes: [
133 /* 30 E> */ B(StackCheck), 133 /* 30 E> */ B(StackCheck),
134 /* 42 S> */ B(LdaSmi), U8(1), 134 /* 42 S> */ B(LdaSmi), U8(1),
135 B(Star), R(0), 135 B(Star), R(0),
136 B(Star), R(1), 136 B(Star), R(1),
137 /* 45 S> */ B(LdaSmi), U8(2), 137 /* 45 S> */ B(LdaSmi), U8(2),
138 B(TestEqualStrict), R(1), U8(1), 138 B(TestEqualStrict), R(1), U8(2),
139 B(Mov), R(0), R(2), 139 B(Mov), R(0), R(2),
140 B(JumpIfToBooleanTrue), U8(11), 140 B(JumpIfToBooleanTrue), U8(11),
141 B(LdaSmi), U8(3), 141 B(LdaSmi), U8(3),
142 B(TestEqualStrict), R(2), U8(2), 142 B(TestEqualStrict), R(2), U8(3),
143 B(JumpIfTrue), U8(6), 143 B(JumpIfTrue), U8(6),
144 B(Jump), U8(6), 144 B(Jump), U8(6),
145 /* 66 S> */ B(Jump), U8(10), 145 /* 66 S> */ B(Jump), U8(10),
146 /* 82 S> */ B(Jump), U8(8), 146 /* 82 S> */ B(Jump), U8(8),
147 /* 99 S> */ B(LdaSmi), U8(1), 147 /* 99 S> */ B(LdaSmi), U8(1),
148 B(Star), R(0), 148 B(Star), R(0),
149 /* 106 S> */ B(Jump), U8(2), 149 /* 106 S> */ B(Jump), U8(2),
150 B(LdaUndefined), 150 B(LdaUndefined),
151 /* 115 S> */ B(Return), 151 /* 115 S> */ B(Return),
152 ] 152 ]
(...skipping 14 matching lines...) Expand all
167 frame size: 3 167 frame size: 3
168 parameter count: 1 168 parameter count: 1
169 bytecode array length: 47 169 bytecode array length: 47
170 bytecodes: [ 170 bytecodes: [
171 /* 30 E> */ B(StackCheck), 171 /* 30 E> */ B(StackCheck),
172 /* 42 S> */ B(LdaSmi), U8(1), 172 /* 42 S> */ B(LdaSmi), U8(1),
173 B(Star), R(0), 173 B(Star), R(0),
174 /* 42 E> */ B(TypeOf), 174 /* 42 E> */ B(TypeOf),
175 B(Star), R(1), 175 B(Star), R(1),
176 /* 45 S> */ B(LdaSmi), U8(2), 176 /* 45 S> */ B(LdaSmi), U8(2),
177 B(TestEqualStrict), R(1), U8(1), 177 B(TestEqualStrict), R(1), U8(2),
178 B(Mov), R(1), R(2), 178 B(Mov), R(1), R(2),
179 B(JumpIfToBooleanTrue), U8(11), 179 B(JumpIfToBooleanTrue), U8(11),
180 B(LdaSmi), U8(3), 180 B(LdaSmi), U8(3),
181 B(TestEqualStrict), R(2), U8(2), 181 B(TestEqualStrict), R(2), U8(3),
182 B(JumpIfTrue), U8(10), 182 B(JumpIfTrue), U8(10),
183 B(Jump), U8(14), 183 B(Jump), U8(14),
184 /* 74 S> */ B(LdaSmi), U8(1), 184 /* 74 S> */ B(LdaSmi), U8(1),
185 B(Star), R(0), 185 B(Star), R(0),
186 /* 81 S> */ B(Jump), U8(14), 186 /* 81 S> */ B(Jump), U8(14),
187 /* 97 S> */ B(LdaSmi), U8(2), 187 /* 97 S> */ B(LdaSmi), U8(2),
188 B(Star), R(0), 188 B(Star), R(0),
189 /* 104 S> */ B(Jump), U8(8), 189 /* 104 S> */ B(Jump), U8(8),
190 /* 121 S> */ B(LdaSmi), U8(3), 190 /* 121 S> */ B(LdaSmi), U8(3),
191 B(Star), R(0), 191 B(Star), R(0),
(...skipping 16 matching lines...) Expand all
208 " 208 "
209 frame size: 3 209 frame size: 3
210 parameter count: 1 210 parameter count: 1
211 bytecode array length: 32 211 bytecode array length: 32
212 bytecodes: [ 212 bytecodes: [
213 /* 30 E> */ B(StackCheck), 213 /* 30 E> */ B(StackCheck),
214 /* 42 S> */ B(LdaSmi), U8(1), 214 /* 42 S> */ B(LdaSmi), U8(1),
215 B(Star), R(0), 215 B(Star), R(0),
216 B(Star), R(1), 216 B(Star), R(1),
217 /* 45 S> */ B(TypeOf), 217 /* 45 S> */ B(TypeOf),
218 B(TestEqualStrict), R(1), U8(1), 218 B(TestEqualStrict), R(1), U8(2),
219 B(Mov), R(0), R(2), 219 B(Mov), R(0), R(2),
220 B(JumpIfToBooleanTrue), U8(4), 220 B(JumpIfToBooleanTrue), U8(4),
221 B(Jump), U8(8), 221 B(Jump), U8(8),
222 /* 74 S> */ B(LdaSmi), U8(1), 222 /* 74 S> */ B(LdaSmi), U8(1),
223 B(Star), R(0), 223 B(Star), R(0),
224 /* 81 S> */ B(Jump), U8(8), 224 /* 81 S> */ B(Jump), U8(8),
225 /* 98 S> */ B(LdaSmi), U8(2), 225 /* 98 S> */ B(LdaSmi), U8(2),
226 B(Star), R(0), 226 B(Star), R(0),
227 /* 105 S> */ B(Jump), U8(2), 227 /* 105 S> */ B(Jump), U8(2),
228 B(LdaUndefined), 228 B(LdaUndefined),
(...skipping 81 matching lines...) Expand 10 before | Expand all | Expand 10 after
310 " 310 "
311 frame size: 3 311 frame size: 3
312 parameter count: 1 312 parameter count: 1
313 bytecode array length: 292 313 bytecode array length: 292
314 bytecodes: [ 314 bytecodes: [
315 /* 30 E> */ B(StackCheck), 315 /* 30 E> */ B(StackCheck),
316 /* 42 S> */ B(LdaSmi), U8(1), 316 /* 42 S> */ B(LdaSmi), U8(1),
317 B(Star), R(0), 317 B(Star), R(0),
318 B(Star), R(1), 318 B(Star), R(1),
319 /* 45 S> */ B(LdaSmi), U8(1), 319 /* 45 S> */ B(LdaSmi), U8(1),
320 B(TestEqualStrict), R(1), U8(1), 320 B(TestEqualStrict), R(1), U8(2),
321 B(Mov), R(0), R(2), 321 B(Mov), R(0), R(2),
322 B(JumpIfToBooleanTrue), U8(11), 322 B(JumpIfToBooleanTrue), U8(11),
323 B(LdaSmi), U8(2), 323 B(LdaSmi), U8(2),
324 B(TestEqualStrict), R(2), U8(2), 324 B(TestEqualStrict), R(2), U8(3),
325 B(JumpIfTrueConstant), U8(0), 325 B(JumpIfTrueConstant), U8(0),
326 B(JumpConstant), U8(1), 326 B(JumpConstant), U8(1),
327 /* 68 S> */ B(LdaSmi), U8(2), 327 /* 68 S> */ B(LdaSmi), U8(2),
328 B(Star), R(0), 328 B(Star), R(0),
329 /* 77 S> */ B(LdaSmi), U8(2), 329 /* 77 S> */ B(LdaSmi), U8(2),
330 B(Star), R(0), 330 B(Star), R(0),
331 /* 86 S> */ B(LdaSmi), U8(2), 331 /* 86 S> */ B(LdaSmi), U8(2),
332 B(Star), R(0), 332 B(Star), R(0),
333 /* 95 S> */ B(LdaSmi), U8(2), 333 /* 95 S> */ B(LdaSmi), U8(2),
334 B(Star), R(0), 334 B(Star), R(0),
(...skipping 145 matching lines...) Expand 10 before | Expand all | Expand 10 after
480 " 480 "
481 frame size: 5 481 frame size: 5
482 parameter count: 1 482 parameter count: 1
483 bytecode array length: 62 483 bytecode array length: 62
484 bytecodes: [ 484 bytecodes: [
485 /* 30 E> */ B(StackCheck), 485 /* 30 E> */ B(StackCheck),
486 /* 42 S> */ B(LdaSmi), U8(1), 486 /* 42 S> */ B(LdaSmi), U8(1),
487 B(Star), R(0), 487 B(Star), R(0),
488 B(Star), R(2), 488 B(Star), R(2),
489 /* 45 S> */ B(LdaSmi), U8(1), 489 /* 45 S> */ B(LdaSmi), U8(1),
490 B(TestEqualStrict), R(2), U8(4), 490 B(TestEqualStrict), R(2), U8(5),
491 B(Mov), R(0), R(3), 491 B(Mov), R(0), R(3),
492 B(JumpIfToBooleanTrue), U8(11), 492 B(JumpIfToBooleanTrue), U8(11),
493 B(LdaSmi), U8(2), 493 B(LdaSmi), U8(2),
494 B(TestEqualStrict), R(3), U8(5), 494 B(TestEqualStrict), R(3), U8(6),
495 B(JumpIfTrue), U8(34), 495 B(JumpIfTrue), U8(34),
496 B(Jump), U8(36), 496 B(Jump), U8(36),
497 /* 77 E> */ B(AddSmi), U8(1), R(0), U8(1), 497 /* 77 E> */ B(AddSmi), U8(1), R(0), U8(2),
498 B(Star), R(1), 498 B(Star), R(1),
499 /* 70 S> */ B(LdaSmi), U8(2), 499 /* 70 S> */ B(LdaSmi), U8(2),
500 B(TestEqualStrict), R(1), U8(2), 500 B(TestEqualStrict), R(1), U8(3),
501 B(Mov), R(1), R(4), 501 B(Mov), R(1), R(4),
502 B(JumpIfToBooleanTrue), U8(4), 502 B(JumpIfToBooleanTrue), U8(4),
503 B(Jump), U8(8), 503 B(Jump), U8(8),
504 /* 101 S> */ B(LdaSmi), U8(1), 504 /* 101 S> */ B(LdaSmi), U8(1),
505 B(Star), R(0), 505 B(Star), R(0),
506 /* 108 S> */ B(Jump), U8(8), 506 /* 108 S> */ B(Jump), U8(8),
507 /* 131 S> */ B(LdaSmi), U8(2), 507 /* 131 S> */ B(LdaSmi), U8(2),
508 B(Star), R(0), 508 B(Star), R(0),
509 /* 138 S> */ B(Jump), U8(2), 509 /* 138 S> */ B(Jump), U8(2),
510 /* 176 S> */ B(LdaSmi), U8(3), 510 /* 176 S> */ B(LdaSmi), U8(3),
511 B(Star), R(0), 511 B(Star), R(0),
512 B(LdaUndefined), 512 B(LdaUndefined),
513 /* 185 S> */ B(Return), 513 /* 185 S> */ B(Return),
514 ] 514 ]
515 constant pool: [ 515 constant pool: [
516 ] 516 ]
517 handlers: [ 517 handlers: [
518 ] 518 ]
519 519
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698