[Interpreter] Adds wide variant of CreateLiterals. Adds CreateLiterals to BytecodeGraphBuilder.

src/compiler/bytecode-graph-builder.cc

 // Copyright 2015 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/compiler/bytecode-graph-builder.h"
 
 #include "src/compiler/linkage.h"
 #include "src/compiler/operator-properties.h"
 #include "src/interpreter/bytecode-array-iterator.h"
 #include "src/interpreter/bytecodes.h"
@@ skipping 686 matching lines @@
 
 
 void BytecodeGraphBuilder::VisitCreateUnmappedArguments(
     const interpreter::BytecodeArrayIterator& iterator) {
   UNIMPLEMENTED();
 }
 
 
 void BytecodeGraphBuilder::VisitCreateRegExpLiteral(
     const interpreter::BytecodeArrayIterator& iterator) {
-  UNIMPLEMENTED();
+  Node* closure = GetFunctionClosure();
+  const Operator* op = javascript()->CreateLiteralRegExp(
+      Handle<String>::cast(iterator.GetConstantForIndexOperand(0)),
+      iterator.GetImmediateOperand(2), iterator.GetIndexOperand(1));

[rmcilroy, 2015/12/07 14:33:22]

Could you pull out the iterator.GetXXX() to named local variables so that it is
more clear what is being passed to each parameter here (also for the visitors
below). 

[mythria, 2015/12/07 15:11:18]

Done.

+  Node* literal = NewNode(op, closure);
+  AddEmptyFrameStateInputs(literal);
+  environment()->BindAccumulator(literal);
 }
 
 
 void BytecodeGraphBuilder::VisitCreateArrayLiteral(
     const interpreter::BytecodeArrayIterator& iterator) {
-  UNIMPLEMENTED();
+  Node* closure = GetFunctionClosure();
+  const Operator* op = javascript()->CreateLiteralArray(
+      Handle<FixedArray>::cast(iterator.GetConstantForIndexOperand(0)),
+      iterator.GetImmediateOperand(2), iterator.GetIndexOperand(1));
+  Node* literal = NewNode(op, closure);
+  AddEmptyFrameStateInputs(literal);
+  environment()->BindAccumulator(literal);
 }
 
 
 void BytecodeGraphBuilder::VisitCreateObjectLiteral(
     const interpreter::BytecodeArrayIterator& iterator) {
-  UNIMPLEMENTED();
+  Node* closure = GetFunctionClosure();
+  const Operator* op = javascript()->CreateLiteralObject(
+      Handle<FixedArray>::cast(iterator.GetConstantForIndexOperand(0)),
+      iterator.GetImmediateOperand(2), iterator.GetIndexOperand(1));
+  Node* literal = NewNode(op, closure);
+  AddEmptyFrameStateInputs(literal);
+  environment()->BindAccumulator(literal);
 }
 
 
 Node* BytecodeGraphBuilder::ProcessCallArguments(const Operator* call_op,
                                                  Node* callee,
                                                  interpreter::Register receiver,
                                                  size_t arity) {
   Node** all = info()->zone()->NewArray<Node*>(static_cast<int>(arity));
   all[0] = callee;
   all[1] = environment()->LookupRegister(receiver);
@@ skipping 592 matching lines @@
 
 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) {
   if (environment()->IsMarkedAsUnreachable()) return;
   environment()->MarkAsUnreachable();
   exit_controls_.push_back(exit);
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8