[turbofan] Collect invocation counts and compute relative call frequencies.

test/cctest/interpreter/bytecode_expectations/IfConditions.golden

 #
 # Autogenerated by generate-bytecode-expectations.
 #
 
 ---
 execute: yes
 wrap: no
 test function name: f
 
 ---
@@ skipping 103 matching lines @@
   f();
 "
 frame size: 2
 parameter count: 1
 bytecode array length: 23
 bytecodes: [
   /*   10 E> */ B(StackCheck),
   /*   25 S> */ B(LdaSmi), U8(1),
                 B(Star), R(0),
   /*   30 S> */ B(JumpIfToBooleanFalse), U8(13),
-  /*   43 S> */ B(AddSmi), U8(1), R(0), U8(1),
+  /*   43 S> */ B(AddSmi), U8(1), R(0), U8(2),
                 B(Mov), R(0), R(1),
                 B(Star), R(0),
                 B(Jump), U8(5),
   /*   66 S> */ B(LdaSmi), U8(2),
   /*   80 S> */ B(Return),
                 B(LdaUndefined),
   /*   80 S> */ B(Return),
 ]
 constant pool: [
 ]
@@ skipping 10 matching lines @@
     }
   };
   f(99);
 "
 frame size: 0
 parameter count: 2
 bytecode array length: 19
 bytecodes: [
   /*   10 E> */ B(StackCheck),
   /*   18 S> */ B(LdaZero),
-  /*   24 E> */ B(TestLessThanOrEqual), R(arg0), U8(1),
+  /*   24 E> */ B(TestLessThanOrEqual), R(arg0), U8(2),
                 B(JumpIfFalse), U8(7),
   /*   36 S> */ B(Wide), B(LdaSmi), U16(200),
   /*   80 S> */ B(Return),
   /*   63 S> */ B(Wide), B(LdaSmi), U16(-200),
   /*   80 S> */ B(Return),
                 B(LdaUndefined),
   /*   80 S> */ B(Return),
 ]
 constant pool: [
 ]
@@ skipping 94 matching lines @@
 frame size: 2
 parameter count: 2
 bytecode array length: 410
 bytecodes: [
   /*   10 E> */ B(StackCheck),
   /*   24 S> */ B(LdaZero),
                 B(Star), R(0),
   /*   35 S> */ B(LdaZero),
                 B(Star), R(1),
   /*   38 S> */ B(LdaConstant), U8(0),
-  /*   44 E> */ B(TestEqualStrict), R(0), U8(1),
+  /*   44 E> */ B(TestEqualStrict), R(0), U8(2),
                 B(JumpIfFalseConstant), U8(1),
   /*   58 S> */ B(Mov), R(0), R(1),
   /*   65 S> */ B(Mov), R(1), R(0),
   /*   74 S> */ B(Mov), R(0), R(1),
   /*   81 S> */ B(Mov), R(1), R(0),
   /*   90 S> */ B(Mov), R(0), R(1),
   /*   97 S> */ B(Mov), R(1), R(0),
   /*  106 S> */ B(Mov), R(0), R(1),
   /*  113 S> */ B(Mov), R(1), R(0),
   /*  122 S> */ B(Mov), R(0), R(1),
@@ skipping 369 matching lines @@
     return 0;
   }
   f(1, 1);
 "
 frame size: 0
 parameter count: 3
 bytecode array length: 81
 bytecodes: [
   /*   10 E> */ B(StackCheck),
   /*   21 S> */ B(Ldar), R(arg1),
-  /*   27 E> */ B(TestEqual), R(arg0), U8(1),
+  /*   27 E> */ B(TestEqual), R(arg0), U8(2),
                 B(JumpIfFalse), U8(5),
   /*   35 S> */ B(LdaSmi), U8(1),
   /*  262 S> */ B(Return),
   /*   49 S> */ B(Ldar), R(arg1),
-  /*   55 E> */ B(TestEqualStrict), R(arg0), U8(2),
+  /*   55 E> */ B(TestEqualStrict), R(arg0), U8(3),
                 B(JumpIfFalse), U8(5),
   /*   64 S> */ B(LdaSmi), U8(1),
   /*  262 S> */ B(Return),
   /*   78 S> */ B(Ldar), R(arg1),
-  /*   84 E> */ B(TestLessThan), R(arg0), U8(3),
+  /*   84 E> */ B(TestLessThan), R(arg0), U8(4),
                 B(JumpIfFalse), U8(5),
   /*   91 S> */ B(LdaSmi), U8(1),
   /*  262 S> */ B(Return),
   /*  105 S> */ B(Ldar), R(arg1),
-  /*  111 E> */ B(TestGreaterThan), R(arg0), U8(4),
+  /*  111 E> */ B(TestGreaterThan), R(arg0), U8(5),
                 B(JumpIfFalse), U8(5),
   /*  118 S> */ B(LdaSmi), U8(1),
   /*  262 S> */ B(Return),
   /*  132 S> */ B(Ldar), R(arg1),
-  /*  138 E> */ B(TestLessThanOrEqual), R(arg0), U8(5),
+  /*  138 E> */ B(TestLessThanOrEqual), R(arg0), U8(6),
                 B(JumpIfFalse), U8(5),
   /*  146 S> */ B(LdaSmi), U8(1),
   /*  262 S> */ B(Return),
   /*  160 S> */ B(Ldar), R(arg1),
-  /*  166 E> */ B(TestGreaterThanOrEqual), R(arg0), U8(6),
+  /*  166 E> */ B(TestGreaterThanOrEqual), R(arg0), U8(7),
                 B(JumpIfFalse), U8(5),
   /*  174 S> */ B(LdaSmi), U8(1),
   /*  262 S> */ B(Return),
   /*  188 S> */ B(Ldar), R(arg1),
   /*  194 E> */ B(TestIn), R(arg0),
                 B(JumpIfFalse), U8(5),
   /*  202 S> */ B(LdaSmi), U8(1),
   /*  262 S> */ B(Return),
   /*  216 S> */ B(Ldar), R(arg1),
   /*  222 E> */ B(TestInstanceOf), R(arg0),
@@ skipping 52 matching lines @@
     }
   };
   f(-1, 1);
 "
 frame size: 0
 parameter count: 3
 bytecode array length: 36
 bytecodes: [
   /*   10 E> */ B(StackCheck),
   /*   21 S> */ B(Ldar), R(arg1),
-  /*   27 E> */ B(TestEqual), R(arg0), U8(1),
+  /*   27 E> */ B(TestEqual), R(arg0), U8(2),
                 B(JumpIfTrue), U8(8),
                 B(LdaZero),
-  /*   37 E> */ B(TestLessThan), R(arg0), U8(2),
+  /*   37 E> */ B(TestLessThan), R(arg0), U8(3),
                 B(JumpIfFalse), U8(5),
   /*   48 S> */ B(LdaSmi), U8(1),
   /*  133 S> */ B(Return),
   /*   67 S> */ B(LdaZero),
-  /*   73 E> */ B(TestGreaterThan), R(arg0), U8(3),
+  /*   73 E> */ B(TestGreaterThan), R(arg0), U8(4),
                 B(JumpIfFalse), U8(10),
                 B(LdaZero),
-  /*   82 E> */ B(TestGreaterThan), R(arg1), U8(4),
+  /*   82 E> */ B(TestGreaterThan), R(arg1), U8(5),
                 B(JumpIfFalse), U8(4),
   /*   93 S> */ B(LdaZero),
   /*  133 S> */ B(Return),
   /*  118 S> */ B(LdaSmi), U8(-1),
   /*  133 S> */ B(Return),
                 B(LdaUndefined),
   /*  133 S> */ B(Return),
 ]
 constant pool: [
 ]
 handlers: [
 ]