[interpreter] Introduce fused bytecodes for common sequences.

test/cctest/interpreter/bytecode_expectations/Switch.golden

 #
 # Autogenerated by generate-bytecode-expectations.
 #
 
 ---
 pool type: number
 execute: yes
 wrap: yes
 
 ---
 snippet: "
   var a = 1;
   switch(a) {
    case 1: return 2;
    case 2: return 3;
   }
 "
 frame size: 3
 parameter count: 1
-bytecode array length: 31
+bytecode array length: 33
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaSmi), U8(1),
   /*   42 E> */ B(Star), R(1),
+  /*   52 E> */ B(Ldar), R(1),
   /*   52 E> */ B(Star), R(0),
   /*   45 S> */ B(Star), R(2),
                 B(LdaSmi), U8(1),
                 B(TestEqualStrict), R(2),
                 B(JumpIfTrue), U8(10),
                 B(LdaSmi), U8(2),
                 B(TestEqualStrict), R(2),
                 B(JumpIfTrue), U8(7),
                 B(Jump), U8(8),
   /*   66 S> */ B(LdaSmi), U8(2),
@@ skipping 11 matching lines @@
 ---
 snippet: "
   var a = 1;
   switch(a) {
    case 1: a = 2; break;
    case 2: a = 3; break;
   }
 "
 frame size: 3
 parameter count: 1
-bytecode array length: 37
+bytecode array length: 39
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaSmi), U8(1),
   /*   42 E> */ B(Star), R(1),
+  /*   52 E> */ B(Ldar), R(1),
   /*   52 E> */ B(Star), R(0),
   /*   45 S> */ B(Star), R(2),
                 B(LdaSmi), U8(1),
                 B(TestEqualStrict), R(2),
                 B(JumpIfTrue), U8(10),
                 B(LdaSmi), U8(2),
                 B(TestEqualStrict), R(2),
                 B(JumpIfTrue), U8(10),
                 B(Jump), U8(14),
   /*   66 S> */ B(LdaSmi), U8(2),
@@ skipping 13 matching lines @@
 ---
 snippet: "
   var a = 1;
   switch(a) {
    case 1: a = 2; // fall-through
    case 2: a = 3; break;
   }
 "
 frame size: 3
 parameter count: 1
-bytecode array length: 35
+bytecode array length: 37
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaSmi), U8(1),
   /*   42 E> */ B(Star), R(1),
+  /*   52 E> */ B(Ldar), R(1),
   /*   52 E> */ B(Star), R(0),
   /*   45 S> */ B(Star), R(2),
                 B(LdaSmi), U8(1),
                 B(TestEqualStrict), R(2),
                 B(JumpIfTrue), U8(10),
                 B(LdaSmi), U8(2),
                 B(TestEqualStrict), R(2),
                 B(JumpIfTrue), U8(8),
                 B(Jump), U8(12),
   /*   66 S> */ B(LdaSmi), U8(2),
@@ skipping 13 matching lines @@
 snippet: "
   var a = 1;
   switch(a) {
    case 2: break;
    case 3: break;
    default: a = 1; break;
   }
 "
 frame size: 3
 parameter count: 1
-bytecode array length: 35
+bytecode array length: 37
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaSmi), U8(1),
   /*   42 E> */ B(Star), R(1),
+  /*   52 E> */ B(Ldar), R(1),
   /*   52 E> */ B(Star), R(0),
   /*   45 S> */ B(Star), R(2),
                 B(LdaSmi), U8(2),
                 B(TestEqualStrict), R(2),
                 B(JumpIfTrue), U8(10),
                 B(LdaSmi), U8(3),
                 B(TestEqualStrict), R(2),
                 B(JumpIfTrue), U8(6),
                 B(Jump), U8(6),
   /*   66 S> */ B(Jump), U8(10),
@@ skipping 55 matching lines @@
 ---
 snippet: "
   var a = 1;
   switch(a) {
    case typeof(a): a = 1; break;
    default: a = 2; break;
   }
 "
 frame size: 3
 parameter count: 1
-bytecode array length: 32
+bytecode array length: 34
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaSmi), U8(1),
   /*   42 E> */ B(Star), R(1),
+  /*   52 E> */ B(Ldar), R(1),
   /*   52 E> */ B(Star), R(0),
   /*   45 S> */ B(Star), R(2),
                 B(Ldar), R(1),
                 B(TypeOf),
                 B(TestEqualStrict), R(2),
                 B(JumpIfTrue), U8(4),
                 B(Jump), U8(8),
   /*   74 S> */ B(LdaSmi), U8(1),
   /*   76 E> */ B(Star), R(1),
   /*   81 S> */ B(Jump), U8(8),
@@ skipping 78 matching lines @@
     a = 2;
     a = 2;
     break;
    case 2:
     a = 3;
     break;
   }
 "
 frame size: 3
 parameter count: 1
-bytecode array length: 289
+bytecode array length: 291
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaSmi), U8(1),
   /*   42 E> */ B(Star), R(1),
+  /*   52 E> */ B(Ldar), R(1),
   /*   52 E> */ B(Star), R(0),
   /*   45 S> */ B(Star), R(2),
                 B(LdaSmi), U8(1),
                 B(TestEqualStrict), R(2),
                 B(JumpIfTrue), U8(10),
                 B(LdaSmi), U8(2),
                 B(TestEqualStrict), R(2),
                 B(JumpIfTrueConstant), U8(0),
                 B(JumpConstant), U8(1),
   /*   68 S> */ B(LdaSmi), U8(2),
@@ skipping 145 matching lines @@
    case 1: 
      switch(a + 1) {
         case 2 : a = 1; break;
         default : a = 2; break;
      }  // fall-through
    case 2: a = 3;
   }
 "
 frame size: 5
 parameter count: 1
-bytecode array length: 61
+bytecode array length: 63
 bytecodes: [
   /*   30 E> */ B(StackCheck),
   /*   42 S> */ B(LdaSmi), U8(1),
   /*   42 E> */ B(Star), R(2),
+  /*   52 E> */ B(Ldar), R(2),
   /*   52 E> */ B(Star), R(0),
   /*   45 S> */ B(Star), R(3),
                 B(LdaSmi), U8(1),
                 B(TestEqualStrict), R(3),
                 B(JumpIfTrue), U8(10),
                 B(LdaSmi), U8(2),
                 B(TestEqualStrict), R(3),
                 B(JumpIfTrue), U8(36),
                 B(Jump), U8(38),
   /*   77 E> */ B(Ldar), R(2),
@@ skipping 15 matching lines @@
   /*  176 S> */ B(LdaSmi), U8(3),
   /*  178 E> */ B(Star), R(2),
                 B(LdaUndefined),
   /*  185 S> */ B(Return),
 ]
 constant pool: [
 ]
 handlers: [
 ]