⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 frames.cc.svn-base

📁 Google浏览器V8内核代码
💻 SVN-BASE
📖 第 1 页 / 共 2 页
字号:
  return false;}Object* JavaScriptFrame::GetParameter(int index) const {  ASSERT(index >= 0 && index < ComputeParametersCount());  const int offset = JavaScriptFrameConstants::kParam0Offset;  return Memory::Object_at(pp() + offset - (index * kPointerSize));}int JavaScriptFrame::ComputeParametersCount() const {  Address base  = pp() + JavaScriptFrameConstants::kReceiverOffset;  Address limit = fp() + JavaScriptFrameConstants::kSavedRegistersOffset;  return (base - limit) / kPointerSize;}bool JavaScriptFrame::IsConstructor() const {  Address pc = has_adapted_arguments()      ? Memory::Address_at(ComputePCAddress(caller_fp()))      : caller_pc();  return IsConstructTrampolineFrame(pc);}Code* ArgumentsAdaptorFrame::FindCode() const {  return Builtins::builtin(Builtins::ArgumentsAdaptorTrampoline);}Code* InternalFrame::FindCode() const {  const int offset = InternalFrameConstants::kCodeOffset;  Object* code = Memory::Object_at(fp() + offset);  if (code == NULL) {    // The code object isn't set; find it and set it.    code = Heap::FindCodeObject(pc());    ASSERT(!code->IsFailure());    Memory::Object_at(fp() + offset) = code;  }  ASSERT(code != NULL);  return Code::cast(code);}void StackFrame::PrintIndex(StringStream* accumulator,                            PrintMode mode,                            int index) {  accumulator->Add((mode == OVERVIEW) ? "%5d: " : "[%d]: ", index);}void JavaScriptFrame::Print(StringStream* accumulator,                            PrintMode mode,                            int index) const {  HandleScope scope;  Object* receiver = this->receiver();  Object* function = this->function();  accumulator->PrintSecurityTokenIfChanged(function);  PrintIndex(accumulator, mode, index);  Code* code = NULL;  if (IsConstructor()) accumulator->Add("new ");  accumulator->PrintFunction(function, receiver, &code);  accumulator->Add("(this=%o", receiver);  // Get scope information for nicer output, if possible. If code is  // NULL, or doesn't contain scope info, info will return 0 for the  // number of parameters, stack slots, or context slots.  ScopeInfo<PreallocatedStorage> info(code);  // Print the parameters.  int parameters_count = ComputeParametersCount();  for (int i = 0; i < parameters_count; i++) {    accumulator->Add(",");    // If we have a name for the parameter we print it. Nameless    // parameters are either because we have more actual parameters    // than formal parameters or because we have no scope information.    if (i < info.number_of_parameters()) {      accumulator->PrintName(*info.parameter_name(i));      accumulator->Add("=");    }    accumulator->Add("%o", GetParameter(i));  }  accumulator->Add(")");  if (mode == OVERVIEW) {    accumulator->Add("\n");    return;  }  accumulator->Add(" {\n");  // Compute the number of locals and expression stack elements.  int stack_locals_count = info.number_of_stack_slots();  int heap_locals_count = info.number_of_context_slots();  int expressions_count = ComputeExpressionsCount();  // Print stack-allocated local variables.  if (stack_locals_count > 0) {    accumulator->Add("  // stack-allocated locals\n");  }  for (int i = 0; i < stack_locals_count; i++) {    accumulator->Add("  var ");    accumulator->PrintName(*info.stack_slot_name(i));    accumulator->Add(" = ");    if (i < expressions_count) {      accumulator->Add("%o", GetExpression(i));    } else {      accumulator->Add("// no expression found - inconsistent frame?");    }    accumulator->Add("\n");  }  // Try to get hold of the context of this frame.  Context* context = NULL;  if (this->context() != NULL && this->context()->IsContext()) {    context = Context::cast(this->context());  }  // Print heap-allocated local variables.  if (heap_locals_count > Context::MIN_CONTEXT_SLOTS) {    accumulator->Add("  // heap-allocated locals\n");  }  for (int i = Context::MIN_CONTEXT_SLOTS; i < heap_locals_count; i++) {    accumulator->Add("  var ");    accumulator->PrintName(*info.context_slot_name(i));    accumulator->Add(" = ");    if (context != NULL) {      if (i < context->length()) {        accumulator->Add("%o", context->get(i));      } else {        accumulator->Add(            "// warning: missing context slot - inconsistent frame?");      }    } else {      accumulator->Add("// warning: no context found - inconsistent frame?");    }    accumulator->Add("\n");  }  // Print the expression stack.  int expressions_start = stack_locals_count;  if (expressions_start < expressions_count) {    accumulator->Add("  // expression stack (top to bottom)\n");  }  for (int i = expressions_count - 1; i >= expressions_start; i--) {    if (IsExpressionInsideHandler(i)) continue;    accumulator->Add("  [%02d] : %o\n", i, GetExpression(i));  }  // Print details about the function.  if (FLAG_max_stack_trace_source_length != 0 && code != NULL) {    SharedFunctionInfo* shared = JSFunction::cast(function)->shared();    accumulator->Add("--------- s o u r c e   c o d e ---------\n");    shared->SourceCodePrint(accumulator, FLAG_max_stack_trace_source_length);    accumulator->Add("\n-----------------------------------------\n");  }  accumulator->Add("}\n\n");}void ArgumentsAdaptorFrame::Print(StringStream* accumulator,                                  PrintMode mode,                                  int index) const {  int actual = ComputeParametersCount();  int expected = -1;  Object* function = this->function();  if (function->IsJSFunction()) {    expected = JSFunction::cast(function)->shared()->formal_parameter_count();  }  PrintIndex(accumulator, mode, index);  accumulator->Add("arguments adaptor frame: %d->%d", actual, expected);  if (mode == OVERVIEW) {    accumulator->Add("\n");    return;  }  accumulator->Add(" {\n");  // Print actual arguments.  if (actual > 0) accumulator->Add("  // actual arguments\n");  for (int i = 0; i < actual; i++) {    accumulator->Add("  [%02d] : %o", i, GetParameter(i));    if (expected != -1 && i >= expected) {      accumulator->Add("  // not passed to callee");    }    accumulator->Add("\n");  }  accumulator->Add("}\n\n");}void EntryFrame::Iterate(ObjectVisitor* v) const {  StackHandlerIterator it(this, top_handler());  ASSERT(!it.done());  StackHandler* handler = it.handler();  ASSERT(handler->is_entry());  handler->Iterate(v);  // Make sure that there's the entry frame does not contain more than  // one stack handler.  if (kDebug) {    it.Advance();    ASSERT(it.done());  }}void StandardFrame::IterateExpressions(ObjectVisitor* v) const {  const int offset = StandardFrameConstants::kContextOffset;  Object** base = &Memory::Object_at(sp());  Object** limit = &Memory::Object_at(fp() + offset) + 1;  for (StackHandlerIterator it(this, top_handler()); !it.done(); it.Advance()) {    StackHandler* handler = it.handler();    // Traverse pointers down to - but not including - the next    // handler in the handler chain. Update the base to skip the    // handler and allow the handler to traverse its own pointers.    const Address address = handler->address();    v->VisitPointers(base, reinterpret_cast<Object**>(address));    base = reinterpret_cast<Object**>(address + StackHandlerConstants::kSize);    // Traverse the pointers in the handler itself.    handler->Iterate(v);  }  v->VisitPointers(base, limit);}void JavaScriptFrame::Iterate(ObjectVisitor* v) const {  IterateExpressions(v);  // Traverse callee-saved registers, receiver, and parameters.  const int kBaseOffset = JavaScriptFrameConstants::kSavedRegistersOffset;  const int kLimitOffset = JavaScriptFrameConstants::kReceiverOffset;  Object** base = &Memory::Object_at(fp() + kBaseOffset);  Object** limit = &Memory::Object_at(pp() + kLimitOffset) + 1;  v->VisitPointers(base, limit);}void InternalFrame::Iterate(ObjectVisitor* v) const {  // Internal frames only have object pointers on the expression stack  // as they never have any arguments.  IterateExpressions(v);}// -------------------------------------------------------------------------JavaScriptFrame* StackFrameLocator::FindJavaScriptFrame(int n) {  ASSERT(n >= 0);  for (int i = 0; i <= n; i++) {    while (!iterator_.frame()->is_java_script()) iterator_.Advance();    if (i == n) return JavaScriptFrame::cast(iterator_.frame());    iterator_.Advance();  }  UNREACHABLE();  return NULL;}// -------------------------------------------------------------------------int NumRegs(RegList reglist) {  int n = 0;  while (reglist != 0) {    n++;    reglist &= reglist - 1;  // clear one bit  }  return n;}int JSCallerSavedCode(int n) {  static int reg_code[kNumJSCallerSaved];  static bool initialized = false;  if (!initialized) {    initialized = true;    int i = 0;    for (int r = 0; r < kNumRegs; r++)      if ((kJSCallerSaved & (1 << r)) != 0)        reg_code[i++] = r;    ASSERT(i == kNumJSCallerSaved);  }  ASSERT(0 <= n && n < kNumJSCallerSaved);  return reg_code[n];}} }  // namespace v8::internal

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -