[Interpreter] Implement ForIn in bytecode graph builder.

test/unittests/interpreter/bytecode-array-builder-unittest.cc

 // Copyright 2014 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "src/v8.h"
 
 #include "src/interpreter/bytecode-array-builder.h"
 #include "src/interpreter/bytecode-array-iterator.h"
 #include "test/unittests/test-utils.h"
 
@@ skipping 198 matching lines @@
       .BinaryOperation(Token::Value::ADD, reg, Strength::WEAK)
       .JumpIfFalse(&start);
 
   // Emit throw in it's own basic block so that the rest of the code isn't
   // omitted due to being dead.
   BytecodeLabel after_throw;
   builder.Jump(&after_throw)
     .Throw()
     .Bind(&after_throw);
 
-  builder.ForInPrepare(reg).ForInDone(reg).ForInNext(reg, reg);
+  builder.ForInPrepare(reg, reg, reg)
+      .ForInDone(reg, reg)
+      .ForInNext(reg, reg, reg, reg)
+      .ForInStep(reg);
 
   // Wide constant pool loads
   for (int i = 0; i < 256; i++) {
     // Emit junk in constant pool to force wide constant pool index.
     builder.GetConstantPoolEntry(handle(Smi::FromInt(i), isolate()));
   }
   builder.LoadLiteral(Smi::FromInt(20000000));
 
   // CreateClosureWide
   Handle<SharedFunctionInfo> shared_info2 = factory->NewSharedFunctionInfo(
@@ skipping 436 matching lines @@
     iterator.Advance();
   }
   CHECK_EQ(iterator.current_bytecode(), Bytecode::kReturn);
   iterator.Advance();
   CHECK(iterator.done());
 }
 
 }  // namespace interpreter
 }  // namespace internal
 }  // namespace v8