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

Side by Side Diff: test/cctest/interpreter/bytecode_expectations/LogicalExpressions.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: "
(...skipping 20 matching lines...) Expand all
31 var x = 0; return (x == 1) || 3; 31 var x = 0; return (x == 1) || 3;
32 " 32 "
33 frame size: 1 33 frame size: 1
34 parameter count: 1 34 parameter count: 1
35 bytecode array length: 14 35 bytecode array length: 14
36 bytecodes: [ 36 bytecodes: [
37 /* 30 E> */ B(StackCheck), 37 /* 30 E> */ B(StackCheck),
38 /* 42 S> */ B(LdaZero), 38 /* 42 S> */ B(LdaZero),
39 B(Star), R(0), 39 B(Star), R(0),
40 /* 45 S> */ B(LdaSmi), U8(1), 40 /* 45 S> */ B(LdaSmi), U8(1),
41 /* 55 E> */ B(TestEqual), R(0), U8(1), 41 /* 55 E> */ B(TestEqual), R(0), U8(2),
42 B(JumpIfTrue), U8(4), 42 B(JumpIfTrue), U8(4),
43 B(LdaSmi), U8(3), 43 B(LdaSmi), U8(3),
44 /* 67 S> */ B(Return), 44 /* 67 S> */ B(Return),
45 ] 45 ]
46 constant pool: [ 46 constant pool: [
47 ] 47 ]
48 handlers: [ 48 handlers: [
49 ] 49 ]
50 50
51 --- 51 ---
(...skipping 21 matching lines...) Expand all
73 var x = 0; return (x == 0) && 3; 73 var x = 0; return (x == 0) && 3;
74 " 74 "
75 frame size: 1 75 frame size: 1
76 parameter count: 1 76 parameter count: 1
77 bytecode array length: 13 77 bytecode array length: 13
78 bytecodes: [ 78 bytecodes: [
79 /* 30 E> */ B(StackCheck), 79 /* 30 E> */ B(StackCheck),
80 /* 42 S> */ B(LdaZero), 80 /* 42 S> */ B(LdaZero),
81 B(Star), R(0), 81 B(Star), R(0),
82 /* 45 S> */ B(LdaZero), 82 /* 45 S> */ B(LdaZero),
83 /* 55 E> */ B(TestEqual), R(0), U8(1), 83 /* 55 E> */ B(TestEqual), R(0), U8(2),
84 B(JumpIfFalse), U8(4), 84 B(JumpIfFalse), U8(4),
85 B(LdaSmi), U8(3), 85 B(LdaSmi), U8(3),
86 /* 67 S> */ B(Return), 86 /* 67 S> */ B(Return),
87 ] 87 ]
88 constant pool: [ 88 constant pool: [
89 ] 89 ]
90 handlers: [ 90 handlers: [
91 ] 91 ]
92 92
93 --- 93 ---
(...skipping 456 matching lines...) Expand 10 before | Expand all | Expand 10 after
550 bytecode array length: 279 550 bytecode array length: 279
551 bytecodes: [ 551 bytecodes: [
552 /* 30 E> */ B(StackCheck), 552 /* 30 E> */ B(StackCheck),
553 /* 42 S> */ B(LdaSmi), U8(1), 553 /* 42 S> */ B(LdaSmi), U8(1),
554 B(Star), R(0), 554 B(Star), R(0),
555 /* 53 S> */ B(LdaSmi), U8(2), 555 /* 53 S> */ B(LdaSmi), U8(2),
556 B(Star), R(1), 556 B(Star), R(1),
557 /* 60 S> */ B(LdaSmi), U8(3), 557 /* 60 S> */ B(LdaSmi), U8(3),
558 B(Star), R(2), 558 B(Star), R(2),
559 /* 63 S> */ B(LdaSmi), U8(3), 559 /* 63 S> */ B(LdaSmi), U8(3),
560 /* 73 E> */ B(TestGreaterThan), R(0), U8(1), 560 /* 73 E> */ B(TestGreaterThan), R(0), U8(2),
561 B(JumpIfTrueConstant), U8(0), 561 B(JumpIfTrueConstant), U8(0),
562 B(LdaSmi), U8(1), 562 B(LdaSmi), U8(1),
563 B(Star), R(1), 563 B(Star), R(1),
564 B(LdaSmi), U8(2), 564 B(LdaSmi), U8(2),
565 B(Star), R(2), 565 B(Star), R(2),
566 B(LdaSmi), U8(1), 566 B(LdaSmi), U8(1),
567 B(Star), R(1), 567 B(Star), R(1),
568 B(LdaSmi), U8(2), 568 B(LdaSmi), U8(2),
569 B(Star), R(2), 569 B(Star), R(2),
570 B(LdaSmi), U8(1), 570 B(LdaSmi), U8(1),
(...skipping 166 matching lines...) Expand 10 before | Expand all | Expand 10 after
737 bytecode array length: 278 737 bytecode array length: 278
738 bytecodes: [ 738 bytecodes: [
739 /* 30 E> */ B(StackCheck), 739 /* 30 E> */ B(StackCheck),
740 /* 42 S> */ B(LdaZero), 740 /* 42 S> */ B(LdaZero),
741 B(Star), R(0), 741 B(Star), R(0),
742 /* 53 S> */ B(LdaSmi), U8(2), 742 /* 53 S> */ B(LdaSmi), U8(2),
743 B(Star), R(1), 743 B(Star), R(1),
744 /* 60 S> */ B(LdaSmi), U8(3), 744 /* 60 S> */ B(LdaSmi), U8(3),
745 B(Star), R(2), 745 B(Star), R(2),
746 /* 63 S> */ B(LdaSmi), U8(5), 746 /* 63 S> */ B(LdaSmi), U8(5),
747 /* 73 E> */ B(TestLessThan), R(0), U8(1), 747 /* 73 E> */ B(TestLessThan), R(0), U8(2),
748 B(JumpIfFalseConstant), U8(0), 748 B(JumpIfFalseConstant), U8(0),
749 B(LdaSmi), U8(1), 749 B(LdaSmi), U8(1),
750 B(Star), R(1), 750 B(Star), R(1),
751 B(LdaSmi), U8(2), 751 B(LdaSmi), U8(2),
752 B(Star), R(2), 752 B(Star), R(2),
753 B(LdaSmi), U8(1), 753 B(LdaSmi), U8(1),
754 B(Star), R(1), 754 B(Star), R(1),
755 B(LdaSmi), U8(2), 755 B(LdaSmi), U8(2),
756 B(Star), R(2), 756 B(Star), R(2),
757 B(LdaSmi), U8(1), 757 B(LdaSmi), U8(1),
(...skipping 175 matching lines...) Expand 10 before | Expand all | Expand 10 after
933 B(JumpIfToBooleanTrue), U8(3), 933 B(JumpIfToBooleanTrue), U8(3),
934 B(LdaZero), 934 B(LdaZero),
935 B(LdaSmi), U8(1), 935 B(LdaSmi), U8(1),
936 /* 68 S> */ B(Return), 936 /* 68 S> */ B(Return),
937 ] 937 ]
938 constant pool: [ 938 constant pool: [
939 ] 939 ]
940 handlers: [ 940 handlers: [
941 ] 941 ]
942 942
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698