1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331
|
/*
* Copyright (C) 1999-2001 Harri Porten (porten@kde.org)
* Copyright (C) 2001 Peter Kelly (pmk@post.com)
* Copyright (C) 2003-2017 Apple Inc. All rights reserved.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
*/
#pragma once
#include "AbstractPC.h"
#include "CalleeBits.h"
#include "MacroAssemblerCodeRef.h"
#include "Register.h"
#include "StackVisitor.h"
#include "VM.h"
#include "VMEntryRecord.h"
namespace JSC {
class Arguments;
class ExecState;
class Interpreter;
class JSCallee;
class JSScope;
class SourceOrigin;
struct Instruction;
typedef ExecState CallFrame;
struct CallSiteIndex {
CallSiteIndex()
: m_bits(UINT_MAX)
{
}
explicit CallSiteIndex(uint32_t bits)
: m_bits(bits)
{ }
#if USE(JSVALUE32_64)
explicit CallSiteIndex(Instruction* instruction)
: m_bits(bitwise_cast<uint32_t>(instruction))
{ }
#endif
explicit operator bool() const { return m_bits != UINT_MAX; }
bool operator==(const CallSiteIndex& other) const { return m_bits == other.m_bits; }
inline uint32_t bits() const { return m_bits; }
private:
uint32_t m_bits;
};
struct CallerFrameAndPC {
CallFrame* callerFrame;
Instruction* pc;
static const int sizeInRegisters = 2 * sizeof(void*) / sizeof(Register);
};
static_assert(CallerFrameAndPC::sizeInRegisters == sizeof(CallerFrameAndPC) / sizeof(Register), "CallerFrameAndPC::sizeInRegisters is incorrect.");
struct CallFrameSlot {
static const int codeBlock = CallerFrameAndPC::sizeInRegisters;
static const int callee = codeBlock + 1;
static const int argumentCount = callee + 1;
static const int thisArgument = argumentCount + 1;
static const int firstArgument = thisArgument + 1;
};
// Represents the current state of script execution.
// Passed as the first argument to most functions.
class ExecState : private Register {
public:
static const int headerSizeInRegisters = CallFrameSlot::argumentCount + 1;
// This function should only be called in very specific circumstances
// when you've guaranteed the callee can't be a Wasm callee, and can
// be an arbitrary JSValue. This function should basically never be used.
// Its only use right now is when we are making a call, and we're not
// yet sure if the callee is a cell. In general, a JS callee is guaranteed
// to be a cell, however, there is a brief window where we need to check
// to see if it's a cell, and if it's not, we throw an exception.
JSValue guaranteedJSValueCallee() const
{
ASSERT(!callee().isWasm());
return this[CallFrameSlot::callee].jsValue();
}
JSObject* jsCallee() const
{
ASSERT(!callee().isWasm());
return this[CallFrameSlot::callee].object();
}
CalleeBits callee() const { return CalleeBits(this[CallFrameSlot::callee].pointer()); }
SUPPRESS_ASAN CalleeBits unsafeCallee() const { return CalleeBits(this[CallFrameSlot::callee].pointer()); }
CodeBlock* codeBlock() const { return this[CallFrameSlot::codeBlock].Register::codeBlock(); }
CodeBlock** addressOfCodeBlock() const { return bitwise_cast<CodeBlock**>(this + CallFrameSlot::codeBlock); }
SUPPRESS_ASAN CodeBlock* unsafeCodeBlock() const { return this[CallFrameSlot::codeBlock].Register::asanUnsafeCodeBlock(); }
JSScope* scope(int scopeRegisterOffset) const
{
ASSERT(this[scopeRegisterOffset].Register::scope());
return this[scopeRegisterOffset].Register::scope();
}
// Global object in which execution began.
// This variant is not safe to call from a Wasm frame.
JS_EXPORT_PRIVATE JSGlobalObject* vmEntryGlobalObject();
// This variant is safe to call from a Wasm frame.
JSGlobalObject* vmEntryGlobalObject(VM&);
JSGlobalObject* wasmAwareLexicalGlobalObject(VM&);
bool isAnyWasmCallee();
// Global object in which the currently executing code was defined.
// Differs from vmEntryGlobalObject() during function calls across web browser frames.
JSGlobalObject* lexicalGlobalObject() const;
// Differs from lexicalGlobalObject because this will have DOM window shell rather than
// the actual DOM window, which can't be "this" for security reasons.
JSObject* globalThisValue() const;
VM& vm() const;
// Convenience functions for access to global data.
// It takes a few memory references to get from a call frame to the global data
// pointer, so these are inefficient, and should be used sparingly in new code.
// But they're used in many places in legacy code, so they're not going away any time soon.
AtomicStringTable* atomicStringTable() const { return vm().atomicStringTable(); }
const CommonIdentifiers& propertyNames() const { return *vm().propertyNames; }
const ArgList& emptyList() const { return *vm().emptyList; }
Interpreter* interpreter() { return vm().interpreter; }
Heap* heap() { return &vm().heap; }
static CallFrame* create(Register* callFrameBase) { return static_cast<CallFrame*>(callFrameBase); }
Register* registers() { return this; }
const Register* registers() const { return this; }
CallFrame& operator=(const Register& r) { *static_cast<Register*>(this) = r; return *this; }
CallFrame* callerFrame() const { return static_cast<CallFrame*>(callerFrameOrVMEntryFrame()); }
void* callerFrameOrVMEntryFrame() const { return callerFrameAndPC().callerFrame; }
SUPPRESS_ASAN void* unsafeCallerFrameOrVMEntryFrame() const { return unsafeCallerFrameAndPC().callerFrame; }
CallFrame* unsafeCallerFrame(VMEntryFrame*&);
JS_EXPORT_PRIVATE CallFrame* callerFrame(VMEntryFrame*&);
JS_EXPORT_PRIVATE SourceOrigin callerSourceOrigin();
static ptrdiff_t callerFrameOffset() { return OBJECT_OFFSETOF(CallerFrameAndPC, callerFrame); }
ReturnAddressPtr returnPC() const { return ReturnAddressPtr(callerFrameAndPC().pc); }
bool hasReturnPC() const { return !!callerFrameAndPC().pc; }
void clearReturnPC() { callerFrameAndPC().pc = 0; }
static ptrdiff_t returnPCOffset() { return OBJECT_OFFSETOF(CallerFrameAndPC, pc); }
AbstractPC abstractReturnPC(VM& vm) { return AbstractPC(vm, this); }
bool callSiteBitsAreBytecodeOffset() const;
bool callSiteBitsAreCodeOriginIndex() const;
unsigned callSiteAsRawBits() const;
unsigned unsafeCallSiteAsRawBits() const;
CallSiteIndex callSiteIndex() const;
CallSiteIndex unsafeCallSiteIndex() const;
private:
unsigned callSiteBitsAsBytecodeOffset() const;
public:
// This will try to get you the bytecode offset, but you should be aware that
// this bytecode offset may be bogus in the presence of inlining. This will
// also return 0 if the call frame has no notion of bytecode offsets (for
// example if it's native code).
// https://bugs.webkit.org/show_bug.cgi?id=121754
unsigned bytecodeOffset();
// This will get you a CodeOrigin. It will always succeed. May return
// CodeOrigin(0) if we're in native code.
JS_EXPORT_PRIVATE CodeOrigin codeOrigin();
Register* topOfFrame()
{
if (!codeBlock())
return registers();
return topOfFrameInternal();
}
Instruction* currentVPC() const; // This only makes sense in the LLInt and baseline.
void setCurrentVPC(Instruction* vpc);
void setCallerFrame(CallFrame* frame) { callerFrameAndPC().callerFrame = frame; }
void setScope(int scopeRegisterOffset, JSScope* scope) { static_cast<Register*>(this)[scopeRegisterOffset] = scope; }
static void initGlobalExec(ExecState* globalExec, JSCallee* globalCallee);
// Read a register from the codeframe (or constant from the CodeBlock).
Register& r(int);
Register& r(VirtualRegister);
// Read a register for a non-constant
Register& uncheckedR(int);
Register& uncheckedR(VirtualRegister);
// Access to arguments as passed. (After capture, arguments may move to a different location.)
size_t argumentCount() const { return argumentCountIncludingThis() - 1; }
size_t argumentCountIncludingThis() const { return this[CallFrameSlot::argumentCount].payload(); }
static int argumentOffset(int argument) { return (CallFrameSlot::firstArgument + argument); }
static int argumentOffsetIncludingThis(int argument) { return (CallFrameSlot::thisArgument + argument); }
// In the following (argument() and setArgument()), the 'argument'
// parameter is the index of the arguments of the target function of
// this frame. The index starts at 0 for the first arg, 1 for the
// second, etc.
//
// The arguments (in this case) do not include the 'this' value.
// arguments(0) will not fetch the 'this' value. To get/set 'this',
// use thisValue() and setThisValue() below.
JSValue* addressOfArgumentsStart() const { return bitwise_cast<JSValue*>(this + argumentOffset(0)); }
JSValue argument(size_t argument)
{
if (argument >= argumentCount())
return jsUndefined();
return getArgumentUnsafe(argument);
}
JSValue uncheckedArgument(size_t argument)
{
ASSERT(argument < argumentCount());
return getArgumentUnsafe(argument);
}
void setArgument(size_t argument, JSValue value)
{
this[argumentOffset(argument)] = value;
}
JSValue getArgumentUnsafe(size_t argIndex)
{
// User beware! This method does not verify that there is a valid
// argument at the specified argIndex. This is used for debugging
// and verification code only. The caller is expected to know what
// he/she is doing when calling this method.
return this[argumentOffset(argIndex)].jsValue();
}
static int thisArgumentOffset() { return argumentOffsetIncludingThis(0); }
JSValue thisValue() { return this[thisArgumentOffset()].jsValue(); }
void setThisValue(JSValue value) { this[thisArgumentOffset()] = value; }
// Under the constructor implemented in C++, thisValue holds the newTarget instead of the automatically constructed value.
// The result of this function is only effective under the "construct" context.
JSValue newTarget() { return thisValue(); }
JSValue argumentAfterCapture(size_t argument);
static int offsetFor(size_t argumentCountIncludingThis) { return argumentCountIncludingThis + CallFrameSlot::thisArgument - 1; }
static CallFrame* noCaller() { return 0; }
void setArgumentCountIncludingThis(int count) { static_cast<Register*>(this)[CallFrameSlot::argumentCount].payload() = count; }
void setCallee(JSObject* callee) { static_cast<Register*>(this)[CallFrameSlot::callee] = callee; }
void setCodeBlock(CodeBlock* codeBlock) { static_cast<Register*>(this)[CallFrameSlot::codeBlock] = codeBlock; }
void setReturnPC(void* value) { callerFrameAndPC().pc = reinterpret_cast<Instruction*>(value); }
String friendlyFunctionName();
// CallFrame::iterate() expects a Functor that implements the following method:
// StackVisitor::Status operator()(StackVisitor&) const;
// FIXME: This method is improper. We rely on the fact that we can call it with a null
// receiver. We should always be using StackVisitor directly.
// It's only valid to call this from a non-wasm top frame.
template <typename Functor> void iterate(const Functor& functor)
{
VM* vm;
void* rawThis = this;
if (!!rawThis) {
RELEASE_ASSERT(callee().isCell());
vm = &this->vm();
} else
vm = nullptr;
StackVisitor::visit<Functor>(this, vm, functor);
}
void dump(PrintStream&);
JS_EXPORT_PRIVATE const char* describeFrame();
private:
ExecState();
~ExecState();
Register* topOfFrameInternal();
// The following are for internal use in debugging and verification
// code only and not meant as an API for general usage:
size_t argIndexForRegister(Register* reg)
{
// The register at 'offset' number of slots from the frame pointer
// i.e.
// reg = frame[offset];
// ==> reg = frame + offset;
// ==> offset = reg - frame;
int offset = reg - this->registers();
// The offset is defined (based on argumentOffset()) to be:
// offset = CallFrameSlot::firstArgument - argIndex;
// Hence:
// argIndex = CallFrameSlot::firstArgument - offset;
size_t argIndex = offset - CallFrameSlot::firstArgument;
return argIndex;
}
CallerFrameAndPC& callerFrameAndPC() { return *reinterpret_cast<CallerFrameAndPC*>(this); }
const CallerFrameAndPC& callerFrameAndPC() const { return *reinterpret_cast<const CallerFrameAndPC*>(this); }
SUPPRESS_ASAN const CallerFrameAndPC& unsafeCallerFrameAndPC() const { return *reinterpret_cast<const CallerFrameAndPC*>(this); }
};
} // namespace JSC
|