[generators] Implement %GeneratorGetSourcePosition.

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/bytecode-branch-analysis.h"
 #include "src/compiler/linkage.h"
 #include "src/compiler/operator-properties.h"
 #include "src/interpreter/bytecodes.h"
@@ skipping 1401 matching lines @@
   Node* index =
       environment()->LookupRegister(bytecode_iterator().GetRegisterOperand(0));
   index = NewNode(javascript()->ForInStep(), index);
   environment()->BindAccumulator(index, &states);
 }
 
 void BytecodeGraphBuilder::VisitSuspendGenerator() {
   Node* state = environment()->LookupAccumulator();
   Node* generator = environment()->LookupRegister(
       bytecode_iterator().GetRegisterOperand(0));
+  Node* offset = jsgraph()->Constant(bytecode_iterator().current_offset());
 
   int register_count = environment()->register_count();
-  int value_input_count = 2 + register_count;
+  int value_input_count = 3 + register_count;
 
   Node** value_inputs = local_zone()->NewArray<Node*>(value_input_count);
   value_inputs[0] = generator;
   value_inputs[1] = state;
+  value_inputs[2] = offset;
   for (int i = 0; i < register_count; ++i) {
-    value_inputs[2 + i] =
+    value_inputs[3 + i] =
         environment()->LookupRegister(interpreter::Register(i));
   }
 
   MakeNode(javascript()->GeneratorStore(register_count), value_input_count,
            value_inputs, false);
 }
 
 void BytecodeGraphBuilder::VisitResumeGenerator() {
   FrameStateBeforeAndAfter states(this);
 
@@ skipping 299 matching lines @@
     // Phi does not exist yet, introduce one.
     value = NewPhi(inputs, value, control);
     value->ReplaceInput(inputs - 1, other);
   }
   return value;
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8