| OLD | NEW |
| (Empty) |
| 1 // Copyright 2006-2008 the V8 project authors. All rights reserved. | |
| 2 // Redistribution and use in source and binary forms, with or without | |
| 3 // modification, are permitted provided that the following conditions are | |
| 4 // met: | |
| 5 // | |
| 6 // * Redistributions of source code must retain the above copyright | |
| 7 // notice, this list of conditions and the following disclaimer. | |
| 8 // * Redistributions in binary form must reproduce the above | |
| 9 // copyright notice, this list of conditions and the following | |
| 10 // disclaimer in the documentation and/or other materials provided | |
| 11 // with the distribution. | |
| 12 // * Neither the name of Google Inc. nor the names of its | |
| 13 // contributors may be used to endorse or promote products derived | |
| 14 // from this software without specific prior written permission. | |
| 15 // | |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
| 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
| 27 | |
| 28 #include "v8.h" | |
| 29 | |
| 30 #include "frames-inl.h" | |
| 31 | |
| 32 namespace v8 { namespace internal { | |
| 33 | |
| 34 | |
| 35 StackFrame::Type StackFrame::ComputeType(State* state) { | |
| 36 ASSERT(state->fp != NULL); | |
| 37 if (StandardFrame::IsArgumentsAdaptorFrame(state->fp)) { | |
| 38 return ARGUMENTS_ADAPTOR; | |
| 39 } | |
| 40 // The marker and function offsets overlap. If the marker isn't a | |
| 41 // smi then the frame is a JavaScript frame -- and the marker is | |
| 42 // really the function. | |
| 43 const int offset = StandardFrameConstants::kMarkerOffset; | |
| 44 Object* marker = Memory::Object_at(state->fp + offset); | |
| 45 if (!marker->IsSmi()) return JAVA_SCRIPT; | |
| 46 return static_cast<StackFrame::Type>(Smi::cast(marker)->value()); | |
| 47 } | |
| 48 | |
| 49 | |
| 50 StackFrame::Type ExitFrame::GetStateForFramePointer(Address fp, State* state) { | |
| 51 if (fp == 0) return NONE; | |
| 52 // Compute the stack pointer. | |
| 53 Address sp = Memory::Address_at(fp + ExitFrameConstants::kSPOffset); | |
| 54 // Fill in the state. | |
| 55 state->fp = fp; | |
| 56 state->sp = sp; | |
| 57 state->pc_address = reinterpret_cast<Address*>(sp - 1 * kPointerSize); | |
| 58 // Determine frame type. | |
| 59 if (Memory::Address_at(fp + ExitFrameConstants::kDebugMarkOffset) != 0) { | |
| 60 return EXIT_DEBUG; | |
| 61 } else { | |
| 62 return EXIT; | |
| 63 } | |
| 64 } | |
| 65 | |
| 66 | |
| 67 void ExitFrame::Iterate(ObjectVisitor* v) const { | |
| 68 // Exit frames on IA-32 do not contain any pointers. The arguments | |
| 69 // are traversed as part of the expression stack of the calling | |
| 70 // frame. | |
| 71 } | |
| 72 | |
| 73 | |
| 74 int JavaScriptFrame::GetProvidedParametersCount() const { | |
| 75 return ComputeParametersCount(); | |
| 76 } | |
| 77 | |
| 78 | |
| 79 Address JavaScriptFrame::GetCallerStackPointer() const { | |
| 80 int arguments; | |
| 81 if (Heap::gc_state() != Heap::NOT_IN_GC || disable_heap_access_) { | |
| 82 // The arguments for cooked frames are traversed as if they were | |
| 83 // expression stack elements of the calling frame. The reason for | |
| 84 // this rather strange decision is that we cannot access the | |
| 85 // function during mark-compact GCs when the stack is cooked. | |
| 86 // In fact accessing heap objects (like function->shared() below) | |
| 87 // at all during GC is problematic. | |
| 88 arguments = 0; | |
| 89 } else { | |
| 90 // Compute the number of arguments by getting the number of formal | |
| 91 // parameters of the function. We must remember to take the | |
| 92 // receiver into account (+1). | |
| 93 JSFunction* function = JSFunction::cast(this->function()); | |
| 94 arguments = function->shared()->formal_parameter_count() + 1; | |
| 95 } | |
| 96 const int offset = StandardFrameConstants::kCallerSPOffset; | |
| 97 return fp() + offset + (arguments * kPointerSize); | |
| 98 } | |
| 99 | |
| 100 | |
| 101 Address ArgumentsAdaptorFrame::GetCallerStackPointer() const { | |
| 102 const int arguments = Smi::cast(GetExpression(0))->value(); | |
| 103 const int offset = StandardFrameConstants::kCallerSPOffset; | |
| 104 return fp() + offset + (arguments + 1) * kPointerSize; | |
| 105 } | |
| 106 | |
| 107 | |
| 108 Address InternalFrame::GetCallerStackPointer() const { | |
| 109 // Internal frames have no arguments. The stack pointer of the | |
| 110 // caller is at a fixed offset from the frame pointer. | |
| 111 return fp() + StandardFrameConstants::kCallerSPOffset; | |
| 112 } | |
| 113 | |
| 114 | |
| 115 } } // namespace v8::internal | |
| OLD | NEW |