[Interpreter] Save and restore dispatch table pointer during calls.

src/frames.cc

 // Copyright 2012 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/frames.h"
 
 #include <sstream>
 
 #include "src/ast/ast.h"
 #include "src/ast/scopeinfo.h"
@@ skipping 1124 matching lines @@
 }
 
 int InterpretedFrame::LookupExceptionHandlerInTable(
     int* context_register, HandlerTable::CatchPrediction* prediction) {
   BytecodeArray* bytecode = function()->shared()->bytecode_array();
   HandlerTable* table = HandlerTable::cast(bytecode->handler_table());
   int pc_offset = GetBytecodeOffset() + 1;  // Point after current bytecode.
   return table->LookupRange(pc_offset, context_register, prediction);
 }
 
-
 int InterpretedFrame::GetBytecodeOffset() const {
   const int index = InterpreterFrameConstants::kBytecodeOffsetExpressionIndex;
   DCHECK_EQ(InterpreterFrameConstants::kBytecodeOffsetFromFp,
             StandardFrameConstants::kExpressionsOffset - index * kPointerSize);
   int raw_offset = Smi::cast(GetExpression(index))->value();
   return raw_offset - BytecodeArray::kHeaderSize + kHeapObjectTag;
 }
 
-
 void InterpretedFrame::PatchBytecodeOffset(int new_offset) {
   const int index = InterpreterFrameConstants::kBytecodeOffsetExpressionIndex;
   DCHECK_EQ(InterpreterFrameConstants::kBytecodeOffsetFromFp,
             StandardFrameConstants::kExpressionsOffset - index * kPointerSize);
   int raw_offset = new_offset + BytecodeArray::kHeaderSize - kHeapObjectTag;
   SetExpression(index, Smi::FromInt(raw_offset));
 }
 
 Object* InterpretedFrame::GetInterpreterRegister(int register_index) const {
   const int index = InterpreterFrameConstants::kRegisterFileExpressionIndex;
   DCHECK_EQ(InterpreterFrameConstants::kRegisterFilePointerFromFp,
             StandardFrameConstants::kExpressionsOffset - index * kPointerSize);
   return GetExpression(index + register_index);
 }
 
+Address InterpretedFrame::GetDispatchTable() const {
+  return Memory::Address_at(
+      fp() + InterpreterFrameConstants::kDispatchTableFromFp);
+}
+
+void InterpretedFrame::PatchDispatchTable(Address dispatch_table) {
+  Address* dispatch_table_address = reinterpret_cast<Address*>(
+      fp() + InterpreterFrameConstants::kDispatchTableFromFp);
+  *dispatch_table_address = dispatch_table;
+}
+
 void InterpretedFrame::Summarize(List<FrameSummary>* functions) {
   DCHECK(functions->length() == 0);
   AbstractCode* abstract_code =
       AbstractCode::cast(function()->shared()->bytecode_array());
   FrameSummary summary(receiver(), function(), abstract_code,
                        GetBytecodeOffset(), IsConstructor());
   functions->Add(summary);
 }
 
 int ArgumentsAdaptorFrame::GetNumberOfIncomingArguments() const {
@@ skipping 231 matching lines @@
   Object** limit = &Memory::Object_at(fp() + offset) + 1;
   v->VisitPointers(base, limit);
 }
 
 
 void JavaScriptFrame::Iterate(ObjectVisitor* v) const {
   IterateExpressions(v);
   IteratePc(v, pc_address(), constant_pool_address(), LookupCode());
 }
 
+void InterpretedFrame::Iterate(ObjectVisitor* v) const {
+  // Visit tagged pointers in the fixed frame.
+  Object** fixed_frame_base =
+      &Memory::Object_at(fp() + InterpreterFrameConstants::kNewTargetFromFp);
+  Object** fixed_frame_limit =
+      &Memory::Object_at(fp() + StandardFrameConstants::kLastObjectOffset) + 1;
+  v->VisitPointers(fixed_frame_base, fixed_frame_limit);
+
+  // Visit the expressions.
+  Object** expression_base = &Memory::Object_at(sp());
+  Object** expression_limit = &Memory::Object_at(
+      fp() + InterpreterFrameConstants::kBytecodeOffsetFromFp) + 1;
+  v->VisitPointers(expression_base, expression_limit);
+
+  IteratePc(v, pc_address(), constant_pool_address(), LookupCode());
+}
 
 void InternalFrame::Iterate(ObjectVisitor* v) const {
   // Internal frames only have object pointers on the expression stack
   // as they never have any arguments.
   IterateExpressions(v);
   IteratePc(v, pc_address(), constant_pool_address(), LookupCode());
 }
 
 
 void StubFailureTrampolineFrame::Iterate(ObjectVisitor* v) const {
@@ skipping 207 matching lines @@
   for (StackFrameIterator it(isolate); !it.done(); it.Advance()) {
     StackFrame* frame = AllocateFrameCopy(it.frame(), zone);
     list.Add(frame, zone);
   }
   return list.ToVector();
 }
 
 
 }  // namespace internal
 }  // namespace v8