gecko/js/src/jstracer.cpp

4025 lines
118 KiB
C++
Raw Normal View History

/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
* vim: set ts=8 sw=4 et tw=99:
*
* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Mozilla SpiderMonkey JavaScript 1.9 code, released
* May 28, 2008.
*
* The Initial Developer of the Original Code is
* Brendan Eich <brendan@mozilla.org>
*
* Contributor(s):
* Andreas Gal <gal@mozilla.com>
2008-07-15 15:05:16 -07:00
* Mike Shaver <shaver@mozilla.org>
* David Anderson <danderson@mozilla.com>
*
* Alternatively, the contents of this file may be used under the terms of
* either of the GNU General Public License Version 2 or later (the "GPL"),
* or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
* in which case the provisions of the GPL or the LGPL are applicable instead
* of those above. If you wish to allow use of your version of this file only
* under the terms of either the GPL or the LGPL, and not to allow others to
* use your version of this file under the terms of the MPL, indicate your
* decision by deleting the provisions above and replace them with the notice
* and other provisions required by the GPL or the LGPL. If you do not delete
* the provisions above, a recipient may use your version of this file under
* the terms of any one of the MPL, the GPL or the LGPL.
*
* ***** END LICENSE BLOCK ***** */
#include "jsstddef.h" // always first
#include "jsbit.h" // low-level (NSPR-based) headers next
#include "jsprf.h"
#include <math.h> // standard headers next
#ifdef _MSC_VER
#include <malloc.h>
#define alloca _alloca
#endif
#include "nanojit/avmplus.h" // nanojit
#include "nanojit/nanojit.h"
#include "jsarray.h" // higher-level library and API headers
#include "jsbool.h"
#include "jscntxt.h"
#include "jsfun.h"
#include "jsinterp.h"
#include "jsiter.h"
#include "jsobj.h"
#include "jsopcode.h"
#include "jsscript.h"
#include "jsscope.h"
#include "jsemit.h"
#include "jsdbgapi.h"
#include "jstracer.h"
#include "jsautooplen.h" // generated headers last
2008-07-10 18:37:49 -07:00
/* Number of iterations of a loop before we start tracing. */
#define HOTLOOP 2
/* Number of times we wait to exit on a side exit before we try to extend the tree. */
#define HOTEXIT 0
/* Number of backedges permitted before a loop is terminated */
#define MAX_XJUMPS 5
2008-07-27 16:28:09 -07:00
/* Max call depths or inlining */
#define MAX_CALLDEPTH 5
#ifdef DEBUG
#define ABORT_TRACE(msg) do { fprintf(stdout, "abort: %d: %s\n", __LINE__, msg); return false; } while(0)
#else
#define ABORT_TRACE(msg) return false
#endif
#ifdef DEBUG
static struct {
uint64 recorderStarted, recorderAborted, traceCompleted, sideExitIntoInterpreter,
typeMapMismatchAtEntry, returnToDifferentLoopHeader, traceTriggered,
globalShapeMismatchAtEntry, treesTrashed, slotPromoted,
unstableLoopVariable;
} stat = { 0LL, };
#define AUDIT(x) (stat.x++)
#else
#define AUDIT(x) ((void)0)
#endif DEBUG
#define INS_CONST(c) addName(lir->insImm(c), #c)
using namespace avmplus;
using namespace nanojit;
static GC gc = GC();
static avmplus::AvmCore* core = new (&gc) avmplus::AvmCore();
Tracker::Tracker()
{
pagelist = 0;
}
Tracker::~Tracker()
{
clear();
}
jsuword
Tracker::getPageBase(const void* v) const
{
return jsuword(v) & ~jsuword(NJ_PAGE_SIZE-1);
2008-06-04 00:09:57 -07:00
}
2008-06-11 11:29:35 -07:00
struct Tracker::Page*
Tracker::findPage(const void* v) const
2008-06-11 11:29:35 -07:00
{
jsuword base = getPageBase(v);
struct Tracker::Page* p = pagelist;
while (p) {
if (p->base == base) {
return p;
}
p = p->next;
}
return 0;
}
struct Tracker::Page*
Tracker::addPage(const void* v) {
jsuword base = getPageBase(v);
2008-06-26 20:44:23 -07:00
struct Tracker::Page* p = (struct Tracker::Page*)
GC::Alloc(sizeof(*p) - sizeof(p->map) + (NJ_PAGE_SIZE >> 2) * sizeof(LIns*));
p->base = base;
p->next = pagelist;
pagelist = p;
return p;
2008-06-11 11:29:35 -07:00
}
void
Tracker::clear()
2008-06-11 11:29:35 -07:00
{
while (pagelist) {
Page* p = pagelist;
pagelist = pagelist->next;
GC::Free(p);
}
2008-06-11 11:29:35 -07:00
}
bool
Tracker::has(const void *v) const
{
return get(v) != NULL;
}
LIns*
Tracker::get(const void* v) const
{
struct Tracker::Page* p = findPage(v);
if (!p)
return NULL;
return p->map[(jsuword(v) & 0xfff) >> 2];
}
void
Tracker::set(const void* v, LIns* i)
{
struct Tracker::Page* p = findPage(v);
2008-06-22 23:42:54 -07:00
if (!p)
p = addPage(v);
p->map[(jsuword(v) & 0xfff) >> 2] = i;
}
static inline bool isNumber(jsval v)
{
return JSVAL_IS_INT(v) || JSVAL_IS_DOUBLE(v);
}
static inline jsdouble asNumber(jsval v)
{
JS_ASSERT(isNumber(v));
if (JSVAL_IS_DOUBLE(v))
return *JSVAL_TO_DOUBLE(v);
return (jsdouble)JSVAL_TO_INT(v);
}
static inline bool isInt32(jsval v)
{
if (!isNumber(v))
return false;
jsdouble d = asNumber(v);
jsint i;
return JSDOUBLE_IS_INT(d, i);
}
static inline uint8 getCoercedType(jsval v)
{
return isInt32(v) ? JSVAL_INT : JSVAL_TAG(v);
}
static LIns* demote(LirWriter *out, LInsp i)
{
if (i->isCall())
return callArgN(i,0);
if (i->isop(LIR_i2f) || i->isop(LIR_u2f))
return i->oprnd1();
AvmAssert(i->isconstq());
double cf = i->constvalf();
int32_t ci = cf > 0x7fffffff ? uint32_t(cf) : int32_t(cf);
return out->insImm(ci);
}
static bool isPromoteInt(LIns* i)
{
jsdouble d;
return i->isop(LIR_i2f) || (i->isconstq() && ((d = i->constvalf()) == (jsdouble)(jsint)d));
}
static bool isPromoteUint(LIns* i)
{
jsdouble d;
return i->isop(LIR_u2f) || (i->isconstq() && ((d = i->constvalf()) == (jsdouble)(jsuint)d));
}
static bool isPromote(LIns* i)
{
return isPromoteInt(i) || isPromoteUint(i);
}
static bool isconst(LIns* i, int32_t c)
{
return i->isconst() && i->constval() == c;
}
static bool overflowSafe(LIns* i)
{
LIns* c;
return (i->isop(LIR_and) && ((c = i->oprnd2())->isconst()) &&
((c->constval() & 0xc0000000) == 0)) ||
(i->isop(LIR_rsh) && ((c = i->oprnd2())->isconst()) &&
((c->constval() > 0)));
}
class FuncFilter: public LirWriter
{
TraceRecorder& recorder;
public:
FuncFilter(LirWriter* out, TraceRecorder& _recorder):
LirWriter(out), recorder(_recorder)
{
}
LInsp ins1(LOpcode v, LInsp s0)
{
switch (v) {
case LIR_fneg:
if (isPromoteInt(s0)) {
LIns* result = out->ins1(LIR_neg, demote(out, s0));
out->insGuard(LIR_xt, out->ins1(LIR_ov, result),
recorder.snapshot(OVERFLOW_EXIT));
return out->ins1(LIR_i2f, result);
}
break;
default:;
}
return out->ins1(v, s0);
}
LInsp ins2(LOpcode v, LInsp s0, LInsp s1)
{
if (s0 == s1 && v == LIR_feq) {
if (isPromote(s0)) {
// double(int) and double(uint) cannot be nan
return insImm(1);
}
if (s0->isop(LIR_fmul) || s0->isop(LIR_fsub) || s0->isop(LIR_fadd)) {
LInsp lhs = s0->oprnd1();
LInsp rhs = s0->oprnd2();
if (isPromote(lhs) && isPromote(rhs)) {
// add/sub/mul promoted ints can't be nan
return insImm(1);
}
}
} else if (LIR_feq <= v && v <= LIR_fge) {
if (isPromoteInt(s0) && isPromoteInt(s1)) {
// demote fcmp to cmp
v = LOpcode(v + (LIR_eq - LIR_feq));
return out->ins2(v, demote(out, s0), demote(out, s1));
} else if (isPromoteUint(s0) && isPromoteUint(s1)) {
// uint compare
v = LOpcode(v + (LIR_eq - LIR_feq));
if (v != LIR_eq)
v = LOpcode(v + (LIR_ult - LIR_lt)); // cmp -> ucmp
return out->ins2(v, demote(out, s0), demote(out, s1));
}
} else if (v == LIR_fadd || v == LIR_fsub) {
/* demoting multiplication seems to be tricky since it can quickly overflow the
value range of int32 */
if (isPromoteInt(s0) && isPromoteInt(s1)) {
// demote fop to op
v = (LOpcode)((int)v & ~LIR64);
LIns* d0;
LIns* d1;
LIns* result = out->ins2(v, d0 = demote(out, s0), d1 = demote(out, s1));
if (!overflowSafe(d0) || !overflowSafe(d1))
out->insGuard(LIR_xt, out->ins1(LIR_ov, result),
recorder.snapshot(OVERFLOW_EXIT));
return out->ins1(LIR_i2f, result);
}
} else if (v == LIR_or &&
s0->isop(LIR_lsh) && isconst(s0->oprnd2(), 16) &&
s1->isop(LIR_and) && isconst(s1->oprnd2(), 0xffff)) {
LIns* msw = s0->oprnd1();
LIns* lsw = s1->oprnd1();
LIns* x;
LIns* y;
if (lsw->isop(LIR_add) &&
lsw->oprnd1()->isop(LIR_and) &&
lsw->oprnd2()->isop(LIR_and) &&
isconst(lsw->oprnd1()->oprnd2(), 0xffff) &&
isconst(lsw->oprnd2()->oprnd2(), 0xffff) &&
msw->isop(LIR_add) &&
msw->oprnd1()->isop(LIR_add) &&
msw->oprnd2()->isop(LIR_rsh) &&
msw->oprnd1()->oprnd1()->isop(LIR_rsh) &&
msw->oprnd1()->oprnd2()->isop(LIR_rsh) &&
isconst(msw->oprnd2()->oprnd2(), 16) &&
isconst(msw->oprnd1()->oprnd1()->oprnd2(), 16) &&
isconst(msw->oprnd1()->oprnd2()->oprnd2(), 16) &&
(x = lsw->oprnd1()->oprnd1()) == msw->oprnd1()->oprnd1()->oprnd1() &&
(y = lsw->oprnd2()->oprnd1()) == msw->oprnd1()->oprnd2()->oprnd1() &&
lsw == msw->oprnd2()->oprnd1()) {
return out->ins2(LIR_add, x, y);
}
}
return out->ins2(v, s0, s1);
}
LInsp insCall(uint32_t fid, LInsp args[])
{
LInsp s0 = args[0];
switch (fid) {
case F_doubleToUint32:
if (s0->isconstq())
return out->insImm(js_DoubleToECMAUint32(s0->constvalf()));
if (s0->isop(LIR_i2f) || s0->isop(LIR_u2f)) {
return s0->oprnd1();
}
break;
case F_doubleToInt32:
2008-07-10 16:55:37 -07:00
if (s0->isconstq())
return out->insImm(js_DoubleToECMAInt32(s0->constvalf()));
if (s0->isop(LIR_fadd) || s0->isop(LIR_fsub) || s0->isop(LIR_fmul)) {
LInsp lhs = s0->oprnd1();
LInsp rhs = s0->oprnd2();
if (isPromote(lhs) && isPromote(rhs)) {
LOpcode op = LOpcode(s0->opcode() & ~LIR64);
return out->ins2(op, demote(out, lhs), demote(out, rhs));
}
}
if (s0->isop(LIR_i2f) || s0->isop(LIR_u2f)) {
return s0->oprnd1();
}
if (s0->isCall() && s0->fid() == F_UnboxDouble) {
LIns* args2[] = { callArgN(s0, 0) };
return out->insCall(F_UnboxInt32, args2);
}
if (s0->isCall() && s0->fid() == F_StringToNumber) {
// callArgN's ordering is that as seen by the builtin, not as stored in args here.
// True story!
LIns* args2[] = { callArgN(s0, 1), callArgN(s0, 0) };
return out->insCall(F_StringToInt32, args2);
}
break;
case F_BoxDouble:
JS_ASSERT(s0->isQuad());
if (s0->isop(LIR_i2f)) {
LIns* args2[] = { s0->oprnd1(), args[1] };
return out->insCall(F_BoxInt32, args2);
}
break;
}
return out->insCall(fid, args);
}
};
/* In debug mode vpname contains a textual description of the type of the
slot during the forall iteration over al slots. */
#ifdef DEBUG
#define DEF_VPNAME const char* vpname; unsigned vpnum
#define SET_VPNAME(name) do { vpname = name; vpnum = 0; } while(0)
#define INC_VPNUM() do { ++vpnum; } while(0)
#else
#define DEF_VPNAME do {} while (0)
#define vpname ""
#define vpnum 0
#define SET_VPNAME(name) ((void)0)
#define INC_VPNUM() ((void)0)
#endif
/* This macro can be used to iterate over all interned global variables. */
#define FORALL_GLOBAL_SLOTS(cx, ngslots, gslots, code) \
JS_BEGIN_MACRO \
DEF_VPNAME; \
JSObject* globalObj = JS_GetGlobalForObject(cx, cx->fp->scopeChain); \
unsigned n; \
jsval* vp; \
SET_VPNAME("global"); \
for (n = 0; n < ngslots; ++n) { \
vp = &STOBJ_GET_SLOT(globalObj, gslots[n]); \
{ code; } \
INC_VPNUM(); \
} \
JS_END_MACRO
/*
* This macro can be used to iterate over all slots in currently pending
* frames that make up the native frame, consisting of args, vars, and stack
* (except for the top-level frame which does not have args or vars
*/
#define FORALL_SLOTS_IN_PENDING_FRAMES(cx, callDepth, code) \
JS_BEGIN_MACRO \
DEF_VPNAME; \
unsigned n; \
jsval* vp; \
JSStackFrame* currentFrame = cx->fp; \
JSStackFrame* entryFrame; \
JSStackFrame* fp = currentFrame; \
for (n = 0; n < callDepth; ++n) { fp = fp->down; } \
entryFrame = fp; \
unsigned frames = callDepth+1; \
JSStackFrame** fstack = (JSStackFrame **)alloca(frames * sizeof (JSStackFrame *)); \
JSStackFrame** fspstop = &fstack[frames]; \
JSStackFrame** fsp = fspstop-1; \
fp = currentFrame; \
for (;; fp = fp->down) { *fsp-- = fp; if (fp == entryFrame) break; } \
for (fsp = fstack; fsp < fspstop; ++fsp) { \
JSStackFrame* f = *fsp; \
jsval* vpstop; \
if (f->callee) { \
if (fsp == fstack) { \
SET_VPNAME("this"); \
vp = &f->argv[-1]; \
code; \
SET_VPNAME("argv"); \
vp = &f->argv[0]; vpstop = &f->argv[f->fun->nargs]; \
while (vp < vpstop) { code; ++vp; INC_VPNUM(); } \
} \
SET_VPNAME("vars"); \
vp = f->slots; vpstop = &f->slots[f->script->nfixed]; \
while (vp < vpstop) { code; ++vp; INC_VPNUM(); } \
} \
SET_VPNAME("stack"); \
2008-07-22 21:20:29 -07:00
vp = StackBase(f); vpstop = f->regs->sp; \
while (vp < vpstop) { code; ++vp; INC_VPNUM(); } \
} \
JS_END_MACRO
#define FORALL_SLOTS(cx, ngslots, gslots, callDepth, code) \
JS_BEGIN_MACRO \
FORALL_GLOBAL_SLOTS(cx, ngslots, gslots, code); \
FORALL_SLOTS_IN_PENDING_FRAMES(cx, callDepth, code); \
JS_END_MACRO
TraceRecorder::TraceRecorder(JSContext* cx, GuardRecord* _anchor,
Fragment* _fragment, unsigned ngslots, uint8* globalTypeMap, uint8* stackTypeMap)
{
this->cx = cx;
this->globalObj = JS_GetGlobalForObject(cx, cx->fp->scopeChain);
2008-07-17 17:12:28 -07:00
this->anchor = _anchor;
this->fragment = _fragment;
this->lirbuf = _fragment->lirbuf;
2008-07-21 12:41:43 -07:00
this->treeInfo = (TreeInfo*)_fragment->root->vmprivate;
JS_ASSERT(treeInfo);
this->callDepth = _fragment->calldepth;
JS_ASSERT(!_anchor || _anchor->calldepth == _fragment->calldepth);
this->atoms = cx->fp->script->atomMap.vector;
#ifdef DEBUG
2008-07-20 12:42:19 -07:00
printf("recording starting from %s:%u@%u\n", cx->fp->script->filename,
js_PCToLineNumber(cx, cx->fp->script, cx->fp->regs->pc),
cx->fp->regs->pc - cx->fp->script->code);
#endif
lir = lir_buf_writer = new (&gc) LirBufWriter(lirbuf);
#ifdef DEBUG
lir = verbose_filter = new (&gc) VerboseWriter(&gc, lir, lirbuf->names);
#endif
lir = cse_filter = new (&gc) CseFilter(lir, &gc);
lir = expr_filter = new (&gc) ExprFilter(lir);
lir = func_filter = new (&gc) FuncFilter(lir, *this);
lir->ins0(LIR_trace);
if (!nanojit::AvmCore::config.tree_opt || fragment->root == fragment) {
lirbuf->state = addName(lir->insParam(0), "state");
lirbuf->param1 = addName(lir->insParam(1), "param1");
}
lirbuf->sp = addName(lir->insLoadi(lirbuf->state, offsetof(InterpState, sp)), "sp");
lirbuf->rp = addName(lir->insLoadi(lirbuf->state, offsetof(InterpState, rp)), "rp");
cx_ins = addName(lir->insLoadi(lirbuf->state, offsetof(InterpState, cx)), "cx");
gp_ins = addName(lir->insLoadi(lirbuf->state, offsetof(InterpState, gp)), "gp");
/* the first time we compile a tree this will be empty as we add entries lazily */
uint16* gslots = treeInfo->globalSlots.data();
uint8* m = globalTypeMap;
FORALL_GLOBAL_SLOTS(cx, ngslots, gslots,
import(gp_ins, nativeGlobalOffset(vp), vp, *m, vpname, vpnum, NULL);
m++;
);
ptrdiff_t offset = -treeInfo->nativeStackBase + 8;
m = stackTypeMap;
FORALL_SLOTS_IN_PENDING_FRAMES(cx, callDepth,
import(lirbuf->sp, offset, vp, *m, vpname, vpnum, f);
m++; offset += sizeof(double);
);
recompileFlag = false;
backEdgeCount = 0;
}
TraceRecorder::~TraceRecorder()
{
#ifdef DEBUG
delete verbose_filter;
#endif
delete cse_filter;
delete expr_filter;
delete func_filter;
delete lir_buf_writer;
}
/* Add debug information to a LIR instruction as we emit it. */
inline LIns*
TraceRecorder::addName(LIns* ins, const char* name)
{
#ifdef DEBUG
lirbuf->names->addName(ins, name);
#endif
return ins;
}
/* Determine the current call depth (starting with the entry frame.) */
unsigned
TraceRecorder::getCallDepth() const
{
return callDepth;
}
/* Calculate the total number of native frame slots we need from this frame
all the way back to the entry frame, including the current stack usage. */
static unsigned
nativeStackSlots(unsigned callDepth, JSStackFrame* fp)
{
unsigned slots = 0;
for (;;) {
unsigned operands = fp->regs->sp - StackBase(fp);
JS_ASSERT(operands <= fp->script->nslots - fp->script->nfixed);
slots += operands;
if (fp->callee)
slots += fp->script->nfixed;
if (callDepth-- == 0) {
if (fp->callee)
slots += 1/*this*/ + fp->fun->nargs;
return slots;
}
fp = fp->down;
}
JS_NOT_REACHED("nativeStackSlots");
}
/* Determine the offset in the native global frame for a jsval we track */
ptrdiff_t
TraceRecorder::nativeGlobalOffset(jsval* p) const
{
JS_ASSERT(isGlobal(p));
if (size_t(p - globalObj->fslots) < JS_INITIAL_NSLOTS)
return size_t(p - globalObj->fslots) * sizeof(double);
return ((p - globalObj->dslots) + JS_INITIAL_NSLOTS) * sizeof(double);
}
/* Determine whether a value is a global stack slot */
bool
TraceRecorder::isGlobal(jsval* p) const
{
return ((size_t(p - globalObj->fslots) < JS_INITIAL_NSLOTS) ||
(size_t(p - globalObj->dslots) < (STOBJ_NSLOTS(globalObj) - JS_INITIAL_NSLOTS)));
}
/* Determine the offset in the native stack for a jsval we track */
ptrdiff_t
TraceRecorder::nativeStackOffset(jsval* p) const
{
#ifdef DEBUG
size_t slow_offset = 0;
FORALL_SLOTS_IN_PENDING_FRAMES(cx, callDepth,
if (vp == p) goto done;
slow_offset += sizeof(double)
);
/*
* If it's not in a pending frame, it must be on the stack of the current frame above
* sp but below fp->slots + script->nslots.
*/
JS_ASSERT(size_t(p - cx->fp->slots) < cx->fp->script->nslots);
slow_offset += size_t(p - cx->fp->regs->sp) * sizeof(double);
done:
#define RETURN(offset) { JS_ASSERT((offset) == slow_offset); return offset; }
#else
#define RETURN(offset) { return offset; }
#endif
size_t offset = 0;
JSStackFrame* currentFrame = cx->fp;
JSStackFrame* entryFrame;
JSStackFrame* fp = currentFrame;
for (unsigned n = 0; n < callDepth; ++n) { fp = fp->down; }
entryFrame = fp;
unsigned frames = callDepth+1;
JSStackFrame** fstack = (JSStackFrame **)alloca(frames * sizeof (JSStackFrame *));
JSStackFrame** fspstop = &fstack[frames];
JSStackFrame** fsp = fspstop-1;
fp = currentFrame;
for (;; fp = fp->down) { *fsp-- = fp; if (fp == entryFrame) break; }
for (fsp = fstack; fsp < fspstop; ++fsp) {
JSStackFrame* f = *fsp;
if (f->callee) {
if (fsp == fstack) {
unsigned nargs = JS_MAX(f->fun->nargs, f->argc);
if (size_t(p - &f->argv[-1]) < nargs + 1)
RETURN(offset + size_t(p - &f->argv[-1]) * sizeof(double));
offset += (nargs + 1) * sizeof(double);
}
if (size_t(p - &f->slots[0]) < f->script->nfixed)
RETURN(offset + size_t(p - &f->slots[0]) * sizeof(double));
offset += f->script->nfixed * sizeof(double);
}
jsval* spbase = StackBase(f);
if (size_t(p - spbase) < size_t(f->regs->sp - spbase))
RETURN(offset + size_t(p - spbase) * sizeof(double));
offset += size_t(f->regs->sp - spbase) * sizeof(double);
}
/*
* If it's not in a pending frame, it must be on the stack of the current frame above
* sp but below fp->slots + script->nslots.
*/
JS_ASSERT(size_t(p - currentFrame->slots) < currentFrame->script->nslots);
offset += size_t(p - currentFrame->regs->sp) * sizeof(double);
RETURN(offset);
#undef RETURN
}
/* Track the maximum number of native frame slots we need during
execution. */
void
TraceRecorder::trackNativeStackUse(unsigned slots)
{
if (slots > treeInfo->maxNativeStackSlots)
treeInfo->maxNativeStackSlots = slots;
}
/* Unbox a jsval into a slot. Slots are wide enough to hold double values
directly (instead of storing a pointer to them). */
static bool
ValueToNative(jsval v, uint8 type, double* slot)
{
if (type == JSVAL_INT) {
jsint i;
if (JSVAL_IS_INT(v))
*(jsint*)slot = JSVAL_TO_INT(v);
else if (JSVAL_IS_DOUBLE(v) && JSDOUBLE_IS_INT(*JSVAL_TO_DOUBLE(v), i))
*(jsint*)slot = i;
else {
debug_only(printf("int != tag%lu(value=%lu) ", JSVAL_TAG(v), v);)
return false;
}
debug_only(printf("int<%d> ", *(jsint*)slot);)
return true;
}
if (type == JSVAL_DOUBLE) {
jsdouble d;
if (JSVAL_IS_INT(v))
d = JSVAL_TO_INT(v);
else if (JSVAL_IS_DOUBLE(v))
d = *JSVAL_TO_DOUBLE(v);
else {
debug_only(printf("double != tag%lu ", JSVAL_TAG(v));)
return false;
}
*(jsdouble*)slot = d;
debug_only(printf("double<%g> ", d);)
return true;
}
if (JSVAL_TAG(v) != type) {
debug_only(printf("%d != tag%lu ", type, JSVAL_TAG(v));)
return false;
}
switch (JSVAL_TAG(v)) {
case JSVAL_BOOLEAN:
*(JSBool*)slot = JSVAL_TO_BOOLEAN(v);
debug_only(printf("boolean<%d> ", *(bool*)slot);)
break;
case JSVAL_STRING:
*(JSString**)slot = JSVAL_TO_STRING(v);
debug_only(printf("string<%p> ", *(JSString**)slot);)
break;
default:
JS_ASSERT(JSVAL_IS_OBJECT(v));
*(JSObject**)slot = JSVAL_TO_OBJECT(v);
debug_only(printf("object<%p:%s> ", JSVAL_TO_OBJECT(v),
JSVAL_IS_NULL(v)
? "null"
: STOBJ_GET_CLASS(JSVAL_TO_OBJECT(v))->name);)
}
return true;
}
/* Box a value from the native stack back into the jsval format. Integers
that are too large to fit into a jsval are automatically boxed into
heap-allocated doubles. */
static bool
NativeToValue(JSContext* cx, jsval& v, uint8 type, double* slot)
{
jsint i;
jsdouble d;
switch (type) {
case JSVAL_BOOLEAN:
v = BOOLEAN_TO_JSVAL(*(bool*)slot);
debug_only(printf("boolean<%d> ", *(bool*)slot);)
break;
case JSVAL_INT:
i = *(jsint*)slot;
debug_only(printf("int<%d> ", i);)
store_int:
if (INT_FITS_IN_JSVAL(i)) {
v = INT_TO_JSVAL(i);
break;
}
d = (jsdouble)i;
goto store_double;
case JSVAL_DOUBLE:
d = *slot;
debug_only(printf("double<%g> ", d);)
if (JSDOUBLE_IS_INT(d, i))
goto store_int;
store_double:
/* Its safe to trigger the GC here since we rooted all strings/objects and all the
doubles we already processed. */
return js_NewDoubleInRootedValue(cx, d, &v) ? true : false;
case JSVAL_STRING:
v = STRING_TO_JSVAL(*(JSString**)slot);
debug_only(printf("string<%p> ", *(JSString**)slot);)
break;
default:
JS_ASSERT(type == JSVAL_OBJECT);
v = OBJECT_TO_JSVAL(*(JSObject**)slot);
debug_only(printf("object<%p:%s> ", JSVAL_TO_OBJECT(v),
JSVAL_IS_NULL(v)
? "null"
: STOBJ_GET_CLASS(JSVAL_TO_OBJECT(v))->name);)
break;
}
return true;
}
/* Attempt to unbox the given list of interned globals onto the native global frame, checking
along the way that the supplied type-mao holds. */
static bool
BuildNativeGlobalFrame(JSContext* cx, unsigned ngslots, uint16* gslots, uint8* mp, double* np)
{
debug_only(printf("global: ");)
FORALL_GLOBAL_SLOTS(cx, ngslots, gslots,
if (!ValueToNative(*vp, *mp, np + gslots[n]))
return false;
++mp;
);
debug_only(printf("\n");)
return true;
}
/* Attempt to unbox the given JS frame onto a native frame, checking along the way that the
supplied type-map holds. */
static bool
BuildNativeStackFrame(JSContext* cx, unsigned callDepth, uint8* mp, double* np)
{
debug_only(printf("stack: ");)
FORALL_SLOTS_IN_PENDING_FRAMES(cx, callDepth,
if (!ValueToNative(*vp, *mp, np))
return false;
++mp; ++np;
);
debug_only(printf("\n");)
return true;
}
/* Box the given native frame into a JS frame. This only fails due to a hard error
(out of memory for example). */
static bool
FlushNativeGlobalFrame(JSContext* cx, unsigned ngslots, uint16* gslots, uint8* mp, double* np)
{
uint8* mp_base = mp;
/* Root all string and object references first (we don't need to call the GC for this). */
FORALL_GLOBAL_SLOTS(cx, ngslots, gslots,
if ((*mp == JSVAL_STRING || *mp == JSVAL_OBJECT) &&
!NativeToValue(cx, *vp, *mp, np + gslots[n]))
return false;
++mp;
);
/* Now do this again but this time for all values (properly quicker than actually checking
the type and excluding strings and objects). The GC might kick in when we store doubles,
but everything is rooted now (all strings/objects and all doubles we already boxed). */
mp = mp_base;
FORALL_GLOBAL_SLOTS(cx, ngslots, gslots,
if (!NativeToValue(cx, *vp, *mp, np + gslots[n]))
return false;
++mp;
);
debug_only(printf("\n");)
return true;
}
/* Box the given native global frame into the global object. This only fails due to a hard error
(out of memory for example). */
static bool
FlushNativeStackFrame(JSContext* cx, unsigned callDepth, uint8* mp, double* np)
{
uint8* mp_base = mp;
double* np_base = np;
/* Root all string and object references first (we don't need to call the GC for this). */
FORALL_SLOTS_IN_PENDING_FRAMES(cx, callDepth,
if ((*mp == JSVAL_STRING || *mp == JSVAL_OBJECT) && !NativeToValue(cx, *vp, *mp, np))
return false;
++mp; ++np
);
// Restore thisp from the now-restored argv[-1] in each pending frame.
unsigned n = callDepth;
for (JSStackFrame* f = cx->fp; n-- != 0; f = f->down)
f->thisp = JSVAL_TO_OBJECT(f->argv[-1]);
/* Now do this again but this time for all values (properly quicker than actually checking
the type and excluding strings and objects). The GC might kick in when we store doubles,
but everything is rooted now (all strings/objects and all doubles we already boxed). */
mp = mp_base;
np = np_base;
FORALL_SLOTS_IN_PENDING_FRAMES(cx, callDepth,
if (!NativeToValue(cx, *vp, *mp, np))
return false;
++mp; ++np
);
debug_only(printf("\n");)
return true;
}
/* Emit load instructions onto the trace that read the initial stack state. */
void
TraceRecorder::import(LIns* base, ptrdiff_t offset, jsval* p, uint8& t,
const char *prefix, int index, JSStackFrame *fp)
{
LIns* ins;
if (t == JSVAL_INT) { /* demoted */
JS_ASSERT(isInt32(*p));
/* Ok, we have a valid demotion attempt pending, so insert an integer
read and promote it to double since all arithmetic operations expect
to see doubles on entry. The first op to use this slot will emit a
f2i cast which will cancel out the i2f we insert here. */
ins = lir->insLoadi(base, offset);
nativeFrameTracker.set(p, ins);
ins = lir->ins1(LIR_i2f, ins);
} else {
JS_ASSERT(isNumber(*p) == (t == JSVAL_DOUBLE));
ins = lir->insLoad(t == JSVAL_DOUBLE ? LIR_ldq : LIR_ld, base, offset);
nativeFrameTracker.set(p, ins);
}
tracker.set(p, ins);
#ifdef DEBUG
char name[64];
2008-07-10 16:55:37 -07:00
JS_ASSERT(strlen(prefix) < 10);
void* mark = NULL;
jsuword* localNames = NULL;
if (*prefix == 'a' || *prefix == 'v') {
mark = JS_ARENA_MARK(&cx->tempPool);
localNames = js_GetLocalNameArray(cx, fp->fun, &cx->tempPool);
}
if (!strcmp(prefix, "argv")) {
JSAtom *atom = JS_LOCAL_NAME_TO_ATOM(localNames[index]);
JS_snprintf(name, sizeof name, "$%s.%s", js_AtomToPrintableString(cx, fp->fun->atom),
js_AtomToPrintableString(cx, atom));
} else if (!strcmp(prefix, "vars")) {
JSAtom *atom = JS_LOCAL_NAME_TO_ATOM(localNames[fp->fun->nargs + index]);
JS_snprintf(name, sizeof name, "$%s.%s", js_AtomToPrintableString(cx, fp->fun->atom),
js_AtomToPrintableString(cx, atom));
} else {
JS_snprintf(name, sizeof name, "$%s%d", prefix, index);
}
if (mark)
JS_ARENA_RELEASE(&cx->tempPool, mark);
addName(ins, name);
2008-07-10 16:55:37 -07:00
static const char* typestr[] = {
"object", "int", "double", "3", "string", "5", "boolean", "any"
};
2008-07-14 17:52:38 -07:00
printf("import vp=%p name=%s type=%s flags=%d\n", p, name, typestr[t & 7], t >> 3);
#endif
}
/* Lazily import a global slot if we don't already have it in the tracker. */
bool
TraceRecorder::lazilyImportGlobalSlot(unsigned slot)
{
if (slot != (uint16)slot) /* we use a table of 16-bit ints, bail out if thats not enough */
return false;
jsval* vp = &STOBJ_GET_SLOT(globalObj, slot);
if (tracker.has(vp))
return true; /* we already have it */
unsigned index = treeInfo->globalSlots.length();
treeInfo->globalSlots.add(slot);
treeInfo->globalTypeMap.add(getCoercedType(*vp));
import(gp_ins, slot*sizeof(double), vp, treeInfo->globalTypeMap.data()[index],
"global", index, NULL);
return true;
}
2008-07-21 12:57:02 -07:00
/* Update the tracker, then issue a write back store. */
void
2008-07-21 12:57:02 -07:00
TraceRecorder::set(jsval* p, LIns* i, bool initializing)
{
2008-07-21 12:57:02 -07:00
JS_ASSERT(initializing || tracker.has(p));
tracker.set(p, i);
/* Sink all type casts targeting the stack into the side exit by simply storing the original
(uncasted) value. Each guard generates the side exit map based on the types of the
last stores to every stack location, so its safe to not perform them on-trace. */
if (isPromoteInt(i))
i = ::demote(lir, i);
/* If we are writing to this location for the first time, calculate the offset into the
native frame manually, otherwise just look up the last load or store associated with
the same source address (p) and use the same offset/base. */
LIns* x;
if ((x = nativeFrameTracker.get(p)) == NULL) {
nativeFrameTracker.set(p, !isGlobal(p) /* not a global */
? lir->insStorei(i, lirbuf->sp,
-treeInfo->nativeStackBase + nativeStackOffset(p) + 8)
: lir->insStorei(i, gp_ins,
nativeGlobalOffset(p)));
} else {
#define ASSERT_VALID_CACHE_HIT(base, offset) \
JS_ASSERT(base == lirbuf->sp || base == gp_ins); \
JS_ASSERT(offset == ((base == lirbuf->sp) \
? -treeInfo->nativeStackBase + nativeStackOffset(p) + 8 \
: nativeGlobalOffset(p))); \
if (x->isop(LIR_ld) || x->isop(LIR_ldq)) {
ASSERT_VALID_CACHE_HIT(x->oprnd1(), x->oprnd2()->constval());
lir->insStorei(i, x->oprnd1(), x->oprnd2()->constval());
} else if (x->isop(LIR_st) || x->isop(LIR_stq)) {
ASSERT_VALID_CACHE_HIT(x->oprnd2(), x->oprnd3()->constval());
lir->insStorei(i, x->oprnd2(), x->oprnd3()->constval());
} else {
JS_ASSERT(x->isop(LIR_sti) || x->isop(LIR_stqi));
ASSERT_VALID_CACHE_HIT(x->oprnd2(), x->immdisp());
lir->insStorei(i, x->oprnd2(), x->immdisp());
}
}
#undef ASSERT_VALID_CACHE_HIT
}
LIns*
TraceRecorder::get(jsval* p)
{
return tracker.get(p);
}
/* Determine whether a bytecode location (pc) terminates a loop or is a path within the loop. */
static bool
js_IsLoopExit(JSContext* cx, JSScript* script, jsbytecode* pc)
{
switch (*pc) {
case JSOP_LT:
case JSOP_GT:
case JSOP_LE:
case JSOP_GE:
case JSOP_NE:
case JSOP_EQ:
JS_ASSERT(js_CodeSpec[*pc].length == 1);
pc++;
/* FALL THROUGH */
case JSOP_IFNE:
case JSOP_IFNEX:
return GET_JUMP_OFFSET(pc) < 0;
default:;
}
return false;
}
struct FrameInfo {
JSObject* callee; // callee function object
jsbytecode* callpc; // pc of JSOP_CALL in caller script
union {
struct {
uint16 spdist; // distance from fp->slots to fp->regs->sp at JSOP_CALL
uint16 argc; // actual argument count, may be < fun->nargs
} s;
uint32 word; // for spdist/argc LIR store in record_JSOP_CALL
};
};
SideExit*
TraceRecorder::snapshot(ExitType exitType)
{
JSStackFrame* fp = cx->fp;
if (exitType == BRANCH_EXIT && js_IsLoopExit(cx, fp->script, fp->regs->pc))
exitType = LOOP_EXIT;
/* generate the entry map and stash it in the trace */
unsigned stackSlots = nativeStackSlots(callDepth, fp);
trackNativeStackUse(stackSlots);
/* reserve space for the type map */
unsigned ngslots = treeInfo->globalSlots.length();
LIns* data = lir_buf_writer->skip((stackSlots + ngslots) * sizeof(uint8));
/* setup side exit structure */
memset(&exit, 0, sizeof(exit));
exit.from = fragment;
exit.calldepth = callDepth;
exit.numGlobalSlots = ngslots;
exit.exitType = exitType;
exit.ip_adj = fp->regs->pc - (jsbytecode*)fragment->root->ip;
exit.sp_adj = (stackSlots - treeInfo->entryNativeStackSlots) * sizeof(double);
exit.rp_adj = exit.calldepth * sizeof(FrameInfo);
uint8* m = exit.typeMap = (uint8 *)data->payload();
/* Determine the type of a store by looking at the current type of the actual value the
interpreter is using. For numbers we have to check what kind of store we used last
(integer or double) to figure out what the side exit show reflect in its typemap. */
FORALL_SLOTS(cx, ngslots, treeInfo->globalSlots.data(), callDepth,
LIns* i = get(vp);
*m++ = isNumber(*vp)
? (isPromoteInt(i) ? JSVAL_INT : JSVAL_DOUBLE)
: JSVAL_TAG(*vp);
);
return &exit;
}
/* Emit a guard for condition (cond), expecting to evaluate to boolean result (expected). */
LIns*
TraceRecorder::guard(bool expected, LIns* cond, ExitType exitType)
{
return lir->insGuard(expected ? LIR_xf : LIR_xt,
cond,
snapshot(exitType));
}
/* Try to match the type of a slot to type t. checkType is used to verify that the type of
values flowing into the loop edge is compatible with the type we expect in the loop header. */
bool
TraceRecorder::checkType(jsval& v, uint8& t)
{
if (t == JSVAL_INT) { /* initially all whole numbers cause the slot to be demoted */
if (!isNumber(v))
return false; /* not a number? type mismatch */
LIns* i = get(&v);
if (!isInt32(v) || (!i->isop(LIR_i2f) &&
!(i->isop(LIR_fadd) && i->oprnd2()->isconstq() &&
fabs(i->oprnd2()->constvalf()) == 1.0))) {
#ifdef DEBUG
printf("int slot is !isInt32, slot #%d, triggering re-compilation\n",
!isGlobal(&v)
? nativeStackOffset(&v)
: nativeGlobalOffset(&v));
#endif
AUDIT(slotPromoted);
if (fragment->root == fragment) /* BUG! can't fix miss-speculation without
recompiling root fragment as well */
t = JSVAL_DOUBLE; /* next time make this slot a double */
recompileFlag = true;
return true; /* keep checking types, but request re-compilation */
}
/* looks good, slot is an int32, the last instruction should be i2f */
JS_ASSERT(i->isop(LIR_i2f));
/* we got the final LIR_i2f as we expected. Overwrite the value in that
slot with the argument of i2f since we want the integer store to flow along
the loop edge, not the casted value. */
set(&v, i->oprnd1());
return true;
}
if (t == JSVAL_DOUBLE)
return isNumber(v);
/* for non-number types we expect a precise match of the type */
#ifdef DEBUG
if (JSVAL_TAG(v) != t) {
printf("Type mismatch: val %c, map %c ", "OID?S?B"[JSVAL_TAG(v)],
"OID?S?B"[t]);
}
#endif
return JSVAL_TAG(v) == t;
}
/* Make sure that the current values in the given stack frame and all stack frames
up and including entryFrame are type-compatible with the entry map. */
bool
TraceRecorder::verifyTypeStability()
{
unsigned ngslots = treeInfo->globalSlots.length();
uint16* gslots = treeInfo->globalSlots.data();
uint8* m = treeInfo->globalTypeMap.data();
JS_ASSERT(treeInfo->globalTypeMap.length() == ngslots);
FORALL_GLOBAL_SLOTS(cx, ngslots, gslots,
if (!checkType(*vp, *m))
return false;
++m
);
m = treeInfo->stackTypeMap.data();
FORALL_SLOTS_IN_PENDING_FRAMES(cx, callDepth,
if (!checkType(*vp, *m))
return false;
++m
);
/* BUG: We can't recompile if this is not the root fragment. */
if (recompileFlag && fragment->root != fragment) {
fragment->blacklist();
return false;
}
return !recompileFlag;
}
/* Check whether the current pc location is the loop header of the loop this recorder records. */
bool
TraceRecorder::isLoopHeader(JSContext* cx) const
{
return cx->fp->regs->pc == fragment->root->ip;
}
/* Complete and compile a trace and link it to the existing tree if appropriate. */
void
TraceRecorder::closeLoop(Fragmento* fragmento)
{
if (!verifyTypeStability()) {
AUDIT(unstableLoopVariable);
debug_only(printf("Trace rejected: unstable loop variables.\n");)
return;
}
SideExit *exit = snapshot(LOOP_EXIT);
exit->target = fragment->root;
if (fragment == fragment->root) {
fragment->lastIns = lir->insGuard(LIR_loop, lir->insImm(1), exit);
} else {
fragment->lastIns = lir->insGuard(LIR_x, lir->insImm(1), exit);
2008-07-17 17:12:28 -07:00
}
compile(fragmento->assm(), fragment);
if (anchor) {
fragment->addLink(anchor);
2008-07-17 17:12:28 -07:00
fragmento->assm()->patch(anchor);
}
/* :TODO: windows support */
#if defined DEBUG && !defined WIN32
char* label;
asprintf(&label, "%s:%u", cx->fp->script->filename,
js_PCToLineNumber(cx, cx->fp->script, cx->fp->regs->pc));
fragmento->labels->add(fragment, sizeof(Fragment), 0, label);
#endif
}
int
nanojit::StackFilter::getTop(LInsp guard)
{
2008-07-16 14:21:31 -07:00
if (sp == frag->lirbuf->sp)
return guard->exit()->sp_adj + sizeof(double);
2008-07-16 14:21:31 -07:00
JS_ASSERT(sp == frag->lirbuf->rp);
return guard->exit()->rp_adj + sizeof(FrameInfo);
}
#if defined NJ_VERBOSE
void
nanojit::LirNameMap::formatGuard(LIns *i, char *out)
{
uint32_t ip;
SideExit *x;
x = (SideExit *)i->exit();
ip = intptr_t(x->from->ip) + x->ip_adj;
sprintf(out,
"%s: %s %s -> %s sp%+ld rp%+ld",
formatRef(i),
lirNames[i->opcode()],
i->oprnd1()->isCond() ? formatRef(i->oprnd1()) : "",
labels->format((void *)ip),
x->sp_adj,
x->rp_adj
);
}
#endif
void
nanojit::Assembler::initGuardRecord(LIns *guard, GuardRecord *rec)
{
SideExit *exit;
exit = guard->exit();
rec->guard = guard;
rec->calldepth = exit->calldepth;
rec->exit = exit;
verbose_only(rec->sid = exit->sid);
}
void
nanojit::Assembler::asm_bailout(LIns *guard, Register state)
{
/* we adjust ip/sp/rp when exiting from the tree in the recovery code */
}
void
js_DeleteRecorder(JSContext* cx)
{
JSTraceMonitor* tm = &JS_TRACE_MONITOR(cx);
delete tm->recorder;
tm->recorder = NULL;
}
static bool
js_StartRecorder(JSContext* cx, GuardRecord* anchor, Fragment* f,
unsigned ngslots, uint8* globalTypeMap, uint8* stackTypeMap)
{
/* start recording if no exception during construction */
JS_TRACE_MONITOR(cx).recorder = new (&gc) TraceRecorder(cx, anchor, f,
ngslots, globalTypeMap, stackTypeMap);
if (cx->throwing) {
2008-07-20 12:42:19 -07:00
js_AbortRecording(cx, NULL, "setting up recorder failed");
return false;
}
return true;
}
static void
js_TrashTree(JSContext* cx, Fragment* f)
{
AUDIT(treesTrashed);
debug_only(printf("Trashing tree info.\n");)
delete (TreeInfo*)f->vmprivate;
f->vmprivate = NULL;
f->releaseCode(JS_TRACE_MONITOR(cx).fragmento);
}
static JSInlineFrame*
js_SynthesizeFrame(JSContext* cx, const FrameInfo& fi)
{
JS_ASSERT(HAS_FUNCTION_CLASS(fi.callee));
JSFunction* fun = GET_FUNCTION_PRIVATE(cx, fi.callee);
JS_ASSERT(FUN_INTERPRETED(fun));
JSArena* a = cx->stackPool.current;
void* newmark = (void*) a->avail;
JSScript* script = fun->u.i.script;
// Assert that we have a correct sp distance from cx->fp->slots in fi.
JS_ASSERT(js_ReconstructStackDepth(cx, cx->fp->script, fi.callpc) ==
uintN(fi.s.spdist -
((fun->nargs > fi.s.argc) ? fun->nargs - fi.s.argc : 0) -
cx->fp->script->nfixed));
uintN nframeslots = JS_HOWMANY(sizeof(JSInlineFrame), sizeof(jsval));
size_t nbytes = (nframeslots + script->nslots) * sizeof(jsval);
/* Allocate the inline frame with its vars and operands. */
jsval* newsp;
if (a->avail + nbytes <= a->limit) {
newsp = (jsval *) a->avail;
a->avail += nbytes;
} else {
JS_ARENA_ALLOCATE_CAST(newsp, jsval *, &cx->stackPool, nbytes);
if (!newsp) {
js_ReportOutOfScriptQuota(cx);
return NULL;
}
}
/* Claim space for the stack frame and initialize it. */
JSInlineFrame* newifp = (JSInlineFrame *) newsp;
newsp += nframeslots;
newifp->frame.callobj = NULL;
newifp->frame.argsobj = NULL;
newifp->frame.varobj = NULL;
newifp->frame.script = script;
newifp->frame.callee = fi.callee;
newifp->frame.fun = fun;
newifp->frame.argc = fi.s.argc;
newifp->callerRegs.pc = fi.callpc;
newifp->callerRegs.sp = cx->fp->slots + fi.s.spdist;
newifp->frame.argv = newifp->callerRegs.sp - JS_MAX(fun->nargs, fi.s.argc);
JS_ASSERT(newifp->frame.argv >= StackBase(cx->fp));
newifp->frame.rval = JSVAL_VOID;
newifp->frame.down = cx->fp;
newifp->frame.annotation = NULL;
newifp->frame.scopeChain = OBJ_GET_PARENT(cx, fi.callee);
newifp->frame.sharpDepth = 0;
newifp->frame.sharpArray = NULL;
newifp->frame.flags = 0;
newifp->frame.dormantNext = NULL;
newifp->frame.xmlNamespace = NULL;
newifp->frame.blockChain = NULL;
newifp->mark = newmark;
newifp->frame.thisp = NULL; // will be set by js_ExecuteTree -> FlushNativeStackFrame
newifp->frame.regs = cx->fp->regs;
newifp->frame.regs->pc = script->code;
newifp->frame.regs->sp = newsp + script->nfixed;
newifp->frame.slots = newsp;
#ifdef DEBUG
newifp->frame.pcDisabledSave = 0;
#endif
cx->fp->regs = &newifp->callerRegs;
cx->fp = &newifp->frame;
return newifp;
}
2008-07-25 02:00:02 -07:00
static GuardRecord*
js_ExecuteTree(JSContext* cx, Fragment* f)
{
AUDIT(traceTriggered);
/* execute previously recorded trace */
TreeInfo* ti = (TreeInfo*)f->vmprivate;
JSObject* globalObj = JS_GetGlobalForObject(cx, cx->fp->scopeChain);
if (OBJ_SCOPE(globalObj)->shape != ti->globalShape) {
AUDIT(globalShapeMismatchAtEntry);
debug_only(printf("global shape mismatch, discarding trace (started pc %u line %u).\n",
(jsbytecode*)f->root->ip - cx->fp->script->code,
js_PCToLineNumber(cx, cx->fp->script, (jsbytecode*)f->root->ip));)
js_TrashTree(cx, f);
return NULL;
}
unsigned ngslots = ti->globalSlots.length();
uint16* gslots = ti->globalSlots.data();
unsigned globalFrameSize = STOBJ_NSLOTS(globalObj);
double* global = (double *)alloca((globalFrameSize+1) * sizeof(double));
debug_only(*(uint64*)&global[globalFrameSize] = 0xdeadbeefdeadbeefLL;)
double* stack = (double *)alloca((ti->maxNativeStackSlots+1) * sizeof(double));
debug_only(*(uint64*)&stack[ti->maxNativeStackSlots] = 0xdeadbeefdeadbeefLL;)
#ifdef DEBUG
printf("entering trace at %s:%u@%u\n",
cx->fp->script->filename, js_PCToLineNumber(cx, cx->fp->script, cx->fp->regs->pc),
cx->fp->regs->pc - cx->fp->script->code);
#endif
if (!BuildNativeGlobalFrame(cx, ngslots, gslots, ti->globalTypeMap.data(), global) ||
!BuildNativeStackFrame(cx, 0/*callDepth*/, ti->stackTypeMap.data(), stack)) {
AUDIT(typeMapMismatchAtEntry);
debug_only(printf("type-map mismatch, skipping trace.\n");)
return NULL;
}
double* entry_sp = &stack[ti->nativeStackBase/sizeof(double) +
(cx->fp->regs->sp - StackBase(cx->fp) - 1)];
FrameInfo* callstack = (FrameInfo*) alloca(ti->maxCallDepth * sizeof(FrameInfo));
InterpState state;
state.ip = cx->fp->regs->pc;
state.sp = (void*)entry_sp;
state.rp = callstack;
state.gp = global;
state.cx = cx;
union { NIns *code; GuardRecord* (FASTCALL *func)(InterpState*, Fragment*); } u;
u.code = f->code();
#if defined(DEBUG) && defined(NANOJIT_IA32)
uint64 start = rdtsc();
#endif
GuardRecord* lr = u.func(&state, NULL);
for (int32 i = 0; i < lr->calldepth; i++)
js_SynthesizeFrame(cx, callstack[i]);
SideExit* e = lr->exit;
JSStackFrame* fp = cx->fp;
JS_ASSERT((e->sp_adj / sizeof(double)) + ti->entryNativeStackSlots >=
nativeStackSlots(lr->calldepth, fp));
fp->regs->sp += (e->sp_adj / sizeof(double)) + ti->entryNativeStackSlots -
nativeStackSlots(lr->calldepth, fp);
fp->regs->pc = (jsbytecode*)state.ip + e->ip_adj;
#if defined(DEBUG) && defined(NANOJIT_IA32)
printf("leaving trace at %s:%u@%u, sp=%p, ip=%p, cycles=%llu\n",
fp->script->filename, js_PCToLineNumber(cx, fp->script, fp->regs->pc),
fp->regs->pc - fp->script->code,
state.sp, lr->jmp,
(rdtsc() - start));
#endif
FlushNativeGlobalFrame(cx, e->numGlobalSlots, ti->globalSlots.data(), e->typeMap, global);
FlushNativeStackFrame(cx, e->calldepth, e->typeMap + e->numGlobalSlots, stack);
JS_ASSERT(ti->globalSlots.length() >= e->numGlobalSlots);
JS_ASSERT(globalFrameSize == STOBJ_NSLOTS(globalObj));
JS_ASSERT(*(uint64*)&stack[ti->maxNativeStackSlots] == 0xdeadbeefdeadbeefLL);
JS_ASSERT(*(uint64*)&global[globalFrameSize] == 0xdeadbeefdeadbeefLL);
AUDIT(sideExitIntoInterpreter);
return lr;
}
2008-07-25 02:00:02 -07:00
static bool
js_AttemptToExtendTree(JSContext* cx, GuardRecord* lr, Fragment* f)
2008-07-25 02:00:02 -07:00
{
JS_ASSERT(lr->from->root == f);
2008-07-25 02:00:02 -07:00
debug_only(printf("trying to attach another branch to the tree\n");)
Fragment* c;
if (!(c = lr->target)) {
c = JS_TRACE_MONITOR(cx).fragmento->createBranch(lr, lr->exit);
c->spawnedFrom = lr->guard;
c->parent = f;
2008-07-25 02:00:02 -07:00
lr->exit->target = c;
lr->target = c;
c->root = f;
2008-07-25 02:00:02 -07:00
}
if (++c->hits() >= HOTEXIT) {
/* start tracing secondary trace from this point */
c->lirbuf = f->lirbuf;
SideExit* e = lr->exit;
unsigned ngslots = e->numGlobalSlots;
uint8* globalTypeMap = e->typeMap;
uint8* stackTypeMap = globalTypeMap + ngslots;
return js_StartRecorder(cx, lr, c, ngslots, globalTypeMap, stackTypeMap);
2008-07-25 02:00:02 -07:00
}
return false;
}
bool
js_LoopEdge(JSContext* cx, jsbytecode* oldpc, uintN& inlineCallCount)
{
2008-06-22 23:42:54 -07:00
JSTraceMonitor* tm = &JS_TRACE_MONITOR(cx);
/* is the recorder currently active? */
if (tm->recorder) {
2008-07-17 01:29:41 -07:00
TraceRecorder* r = tm->recorder;
#ifdef JS_THREADSAFE
/* XXX should this test not be earlier, to avoid even recording? */
if (OBJ_SCOPE(JS_GetGlobalForObject(cx, cx->fp->scopeChain))->title.ownercx != cx) {
#ifdef DEBUG
printf("Global object not owned by this context.\n");
#endif
return false; /* we stay away from shared global objects */
}
#endif
if (r->isLoopHeader(cx)) { /* did we hit the start point? */
AUDIT(traceCompleted);
r->closeLoop(JS_TRACE_MONITOR(cx).fragmento);
2008-07-17 01:29:41 -07:00
js_DeleteRecorder(cx);
return false; /* done recording */
}
if (++r->backEdgeCount >= MAX_XJUMPS) {
AUDIT(returnToDifferentLoopHeader);
2008-07-20 12:42:19 -07:00
debug_only(printf("loop edge %d -> %d, header %d\n",
oldpc - cx->fp->script->code,
cx->fp->regs->pc - cx->fp->script->code,
(jsbytecode*)r->getFragment()->root->ip - cx->fp->script->code));
js_AbortRecording(cx, oldpc, "Loop edge does not return to header");
return false; /* done recording */
}
return true; /* keep recording (attempting to unroll inner loop) */
}
2008-07-07 02:47:40 -07:00
Fragment* f = tm->fragmento->getLoop(cx->fp->regs->pc);
if (!f->code()) {
if (++f->hits() >= HOTLOOP) {
AUDIT(recorderStarted);
f->calldepth = 0;
f->root = f;
/* allocate space to store the LIR for this tree */
if (!f->lirbuf) {
f->lirbuf = new (&gc) LirBuffer(tm->fragmento, builtins);
#ifdef DEBUG
f->lirbuf->names = new (&gc) LirNameMap(&gc, builtins, tm->fragmento->labels);
#endif
}
/* create the tree anchor structure */
TreeInfo* ti = (TreeInfo*)f->vmprivate;
if (!ti) {
2008-07-21 12:41:43 -07:00
/* setup the VM-private treeInfo structure for this fragment */
ti = new TreeInfo(); // TODO: deallocate when fragment dies
f->vmprivate = ti;
/* determine the native frame layout at the entry point */
unsigned entryNativeStackSlots = nativeStackSlots(0/*callDepth*/, cx->fp);
ti->entryNativeStackSlots = entryNativeStackSlots;
ti->nativeStackBase = (entryNativeStackSlots -
2008-07-22 21:20:29 -07:00
(cx->fp->regs->sp - StackBase(cx->fp))) * sizeof(double);
ti->maxNativeStackSlots = entryNativeStackSlots;
ti->maxCallDepth = 0;
/* create the list of global properties we want to intern */
ti->globalShape = OBJ_SCOPE(JS_GetGlobalForObject(cx, cx->fp->scopeChain))->shape;
/* remember the coerced type of each active slot in the stack type map */
ti->stackTypeMap.setLength(entryNativeStackSlots);
uint8* m = ti->stackTypeMap.data();
FORALL_SLOTS_IN_PENDING_FRAMES(cx, 0/*callDepth*/,
*m++ = getCoercedType(*vp);
);
}
JS_ASSERT(ti->entryNativeStackSlots == nativeStackSlots(0/*callDepth*/, cx->fp));
/* recording primary trace */
return js_StartRecorder(cx, NULL, f, ti->globalSlots.length(),
ti->globalTypeMap.data(), ti->stackTypeMap.data());
}
return false;
}
GuardRecord* lr = js_ExecuteTree(cx, f);
if (!lr) /* did the tree actually execute? */
return false;
inlineCallCount += lr->exit->calldepth;
switch (lr->exit->exitType) {
case BRANCH_EXIT:
/* if its a branch, try to extend the tree */
return js_AttemptToExtendTree(cx, lr, f);
case LOOP_EXIT:
/* if this exits the loop, resume interpretation */
return false;
default:
JS_ASSERT(lr->exit->exitType == DONT_GROW);
/* We ran out of heap, or an unsupported instruction. Exit for now and re-enter once the
GC ran. */
return false;
}
}
2008-06-28 18:19:21 -07:00
void
2008-07-20 12:42:19 -07:00
js_AbortRecording(JSContext* cx, jsbytecode* abortpc, const char* reason)
2008-06-28 18:19:21 -07:00
{
AUDIT(recorderAborted);
2008-07-20 12:42:19 -07:00
debug_only(if (!abortpc) abortpc = cx->fp->regs->pc;
printf("Abort recording (line %d, pc %d): %s.\n",
js_PCToLineNumber(cx, cx->fp->script, abortpc),
abortpc - cx->fp->script->code, reason);)
2008-07-17 01:29:41 -07:00
JS_ASSERT(JS_TRACE_MONITOR(cx).recorder != NULL);
Fragment* f = JS_TRACE_MONITOR(cx).recorder->getFragment();
f->blacklist();
js_DeleteRecorder(cx);
if (f->root == f)
js_TrashTree(cx, f);
2008-06-28 18:19:21 -07:00
}
extern void
js_InitJIT(JSContext* cx)
{
JSTraceMonitor* tm = &JS_TRACE_MONITOR(cx);
if (!tm->fragmento) {
2008-07-16 23:47:57 -07:00
Fragmento* fragmento = new (&gc) Fragmento(core, 24);
verbose_only(fragmento->labels = new (&gc) LabelMap(core, NULL);)
fragmento->assm()->setCallTable(builtins);
fragmento->pageFree(fragmento->pageAlloc()); // FIXME: prime page cache
tm->fragmento = fragmento;
}
#if !defined XP_WIN
debug_only(memset(&stat, 0, sizeof(stat)));
#endif
}
extern void
js_DestroyJIT(JSContext* cx)
{
#ifdef DEBUG
printf("recorder: started(%llu), aborted(%llu), completed(%llu), different header(%llu), "
"trees trashed(%llu), slot promoted(%llu), "
"unstable loop variable(%llu)\n", stat.recorderStarted, stat.recorderAborted,
stat.traceCompleted, stat.returnToDifferentLoopHeader, stat.treesTrashed,
stat.slotPromoted, stat.unstableLoopVariable);
printf("monitor: triggered(%llu), exits (%llu), type mismatch(%llu), "
"global mismatch(%llu)\n", stat.traceTriggered, stat.sideExitIntoInterpreter,
stat.typeMapMismatchAtEntry, stat.globalShapeMismatchAtEntry);
#endif
}
jsval&
TraceRecorder::argval(unsigned n) const
{
JS_ASSERT(n < cx->fp->fun->nargs);
return cx->fp->argv[n];
}
jsval&
TraceRecorder::varval(unsigned n) const
{
JS_ASSERT(n < cx->fp->script->nfixed);
2008-07-22 21:20:29 -07:00
return cx->fp->slots[n];
}
jsval&
TraceRecorder::stackval(int n) const
{
jsval* sp = cx->fp->regs->sp;
JS_ASSERT(size_t((sp + n) - StackBase(cx->fp)) < StackDepth(cx->fp->script));
return sp[n];
}
LIns*
TraceRecorder::arg(unsigned n)
{
return get(&argval(n));
}
void
TraceRecorder::arg(unsigned n, LIns* i)
{
set(&argval(n), i);
}
LIns*
TraceRecorder::var(unsigned n)
{
return get(&varval(n));
}
void
TraceRecorder::var(unsigned n, LIns* i)
{
set(&varval(n), i);
}
LIns*
TraceRecorder::stack(int n)
{
return get(&stackval(n));
}
void
TraceRecorder::stack(int n, LIns* i)
{
2008-07-21 12:57:02 -07:00
set(&stackval(n), i, n >= 0);
}
LIns* TraceRecorder::f2i(LIns* f)
{
return lir->insCall(F_doubleToInt32, &f);
}
bool TraceRecorder::ifop()
2008-07-05 22:23:34 -07:00
{
jsval& v = stackval(-1);
if (JSVAL_IS_BOOLEAN(v)) {
guard(!JSVAL_TO_BOOLEAN(v), lir->ins_eq0(get(&v)), BRANCH_EXIT);
2008-07-18 08:01:51 -07:00
} else if (JSVAL_IS_OBJECT(v)) {
guard(!JSVAL_IS_NULL(v), lir->ins_eq0(get(&v)), BRANCH_EXIT);
2008-07-18 08:01:51 -07:00
} else if (isNumber(v)) {
jsdouble d = asNumber(v);
jsdpun u;
u.d = 0;
/* XXX need to handle NaN! */
guard(d == 0, lir->ins2(LIR_feq, get(&v), lir->insImmq(u.u64)), BRANCH_EXIT);
2008-07-18 08:01:51 -07:00
} else if (JSVAL_IS_STRING(v)) {
ABORT_TRACE("strings not supported");
2008-07-05 22:23:34 -07:00
} else {
2008-07-18 08:01:51 -07:00
ABORT_TRACE("unknown type, wtf");
2008-07-05 22:23:34 -07:00
}
return true;
}
bool
TraceRecorder::inc(jsval& v, jsint incr, bool pre)
{
LIns* v_ins = get(&v);
if (!inc(v, v_ins, incr, pre))
return false;
set(&v, v_ins);
return true;
}
/*
* On exit, v_ins is the incremented unboxed value, and the appropriate
* value (pre- or post-increment as described by pre) is stacked.
*/
bool
TraceRecorder::inc(jsval& v, LIns*& v_ins, jsint incr, bool pre)
{
if (!isNumber(v))
ABORT_TRACE("can only inc numbers");
jsdpun u;
u.d = jsdouble(incr);
LIns* v_after = lir->ins2(LIR_fadd, v_ins, lir->insImmq(u.u64));
const JSCodeSpec& cs = js_CodeSpec[*cx->fp->regs->pc];
JS_ASSERT(cs.ndefs == 1);
stack(-cs.nuses, pre ? v_after : v_ins);
v_ins = v_after;
return true;
}
bool
TraceRecorder::incProp(jsint incr, bool pre)
{
jsval& l = stackval(-1);
if (JSVAL_IS_PRIMITIVE(l))
ABORT_TRACE("incProp on primitive");
JSObject* obj = JSVAL_TO_OBJECT(l);
LIns* obj_ins = get(&l);
uint32 slot;
LIns* v_ins;
if (!prop(obj, obj_ins, slot, v_ins))
return false;
jsval& v = STOBJ_GET_SLOT(obj, slot);
if (!inc(v, v_ins, incr, pre))
return false;
if (!box_jsval(v, v_ins))
return false;
LIns* dslots_ins = NULL;
stobj_set_slot(obj_ins, slot, dslots_ins, v_ins);
return true;
}
bool
TraceRecorder::incElem(jsint incr, bool pre)
{
jsval& r = stackval(-1);
jsval& l = stackval(-2);
jsval* vp;
LIns* v_ins;
LIns* addr_ins;
if (!elem(l, r, vp, v_ins, addr_ins))
return false;
if (!inc(*vp, v_ins, incr, pre))
return false;
if (!box_jsval(*vp, v_ins))
return false;
lir->insStorei(v_ins, addr_ins, 0);
return true;
}
bool
TraceRecorder::cmp(LOpcode op, bool negate)
{
jsval& r = stackval(-1);
jsval& l = stackval(-2);
if (isNumber(l) && isNumber(r)) {
LIns* x = lir->ins2(op, get(&l), get(&r));
if (negate)
x = lir->ins_eq0(x);
bool cond;
switch (op) {
case LIR_flt:
cond = asNumber(l) < asNumber(r);
break;
case LIR_fgt:
cond = asNumber(l) > asNumber(r);
break;
case LIR_fle:
cond = asNumber(l) <= asNumber(r);
break;
case LIR_fge:
cond = asNumber(l) >= asNumber(r);
break;
default:
JS_ASSERT(op == LIR_feq);
cond = (asNumber(l) == asNumber(r)) ^ negate;
break;
}
2008-07-04 13:23:42 -07:00
/* The interpreter fuses comparisons and the following branch,
so we have to do that here as well. */
if (cx->fp->regs->pc[1] == JSOP_IFEQ || cx->fp->regs->pc[1] == JSOP_IFNE)
guard(cond, x, BRANCH_EXIT);
2008-07-04 13:23:42 -07:00
/* We update the stack after the guard. This is safe since
the guard bails out at the comparison and the interpreter
will this re-execute the comparison. This way the
value of the condition doesn't have to be calculated and
saved on the stack in most cases. */
set(&l, x);
return true;
}
return false;
}
bool
TraceRecorder::unary(LOpcode op)
{
jsval& v = stackval(-1);
bool intop = !(op & LIR64);
if (isNumber(v)) {
LIns* a = get(&v);
if (intop)
a = f2i(a);
a = lir->ins1(op, a);
if (intop)
a = lir->ins1(LIR_i2f, a);
set(&v, a);
return true;
}
return false;
}
bool
TraceRecorder::binary(LOpcode op)
{
jsval& r = stackval(-1);
jsval& l = stackval(-2);
bool intop = !(op & LIR64);
LIns* a = get(&l);
LIns* b = get(&r);
bool leftNumber = isNumber(l), rightNumber = isNumber(r);
if ((op >= LIR_sub && op <= LIR_ush) || // sub, mul, (callh), or, xor, (not,) lsh, rsh, ush
(op >= LIR_fsub && op <= LIR_fdiv)) { // fsub, fmul, fdiv
LIns* args[] = { NULL, cx_ins };
JS_ASSERT(op != LIR_callh);
if (JSVAL_IS_STRING(l)) {
args[0] = a;
a = lir->insCall(F_StringToNumber, args);
leftNumber = true;
}
if (JSVAL_IS_STRING(r)) {
args[0] = b;
b = lir->insCall(F_StringToNumber, args);
rightNumber = true;
}
}
if (leftNumber && rightNumber) {
if (intop) {
a = lir->insCall(op == LIR_ush ? F_doubleToUint32 : F_doubleToInt32, &a);
b = f2i(b);
}
a = lir->ins2(op, a, b);
if (intop)
a = lir->ins1(op == LIR_ush ? LIR_u2f : LIR_i2f, a);
set(&l, a);
return true;
}
return false;
}
bool
TraceRecorder::map_is_native(JSObjectMap* map, LIns* map_ins, LIns*& ops_ins)
{
ops_ins = addName(lir->insLoadi(map_ins, offsetof(JSObjectMap, ops)), "ops");
if (map->ops == &js_ObjectOps) {
guard(true, addName(lir->ins2(LIR_eq, ops_ins, lir->insImmPtr(&js_ObjectOps)),
"guard(native-ops)"));
return true;
}
LIns* n = lir->insLoadi(ops_ins, offsetof(JSObjectOps, newObjectMap));
if (map->ops->newObjectMap == js_ObjectOps.newObjectMap) {
guard(true, addName(lir->ins2(LIR_eq, n, lir->insImmPtr((void*)js_ObjectOps.newObjectMap)),
"guard(native-map)"));
return true;
}
ABORT_TRACE("non-native map");
}
bool
TraceRecorder::test_property_cache(JSObject* obj, LIns* obj_ins, JSObject*& obj2, jsuword& pcval)
{
LIns* map_ins = lir->insLoadi(obj_ins, offsetof(JSObject, map));
LIns* ops_ins;
if (!map_is_native(obj->map, map_ins, ops_ins))
return false;
JSAtom* atom;
JSPropCacheEntry* entry;
PROPERTY_CACHE_TEST(cx, cx->fp->regs->pc, obj, obj2, entry, atom);
if (!atom) {
pcval = entry->vword;
return true;
}
2008-07-29 16:01:00 -07:00
// FIXME: suppressed exceptions from js_FindPropertyHelper and js_LookupPropertyWithFlags
JSProperty* prop;
JSScopeProperty* sprop;
jsid id = ATOM_TO_JSID(atom);
if (JOF_OPMODE(*cx->fp->regs->pc) == JOF_NAME) {
2008-07-29 16:01:00 -07:00
if (js_FindPropertyHelper(cx, id, &obj, &obj2, &prop, &entry) < 0)
ABORT_TRACE("failed to find name");
} else {
2008-07-29 16:01:00 -07:00
int protoIndex = js_LookupPropertyWithFlags(cx, obj, id, 0, &obj2, &prop);
if (protoIndex < 0)
ABORT_TRACE("failed to lookup property");
2008-07-29 16:01:00 -07:00
sprop = (JSScopeProperty*) prop;
js_FillPropertyCache(cx, obj, OBJ_SCOPE(obj)->shape, 0, protoIndex, obj2, sprop, &entry);
}
2008-07-29 16:01:00 -07:00
if (!entry)
ABORT_TRACE("failed to fill property cache");
if (obj != globalObj) {
if (PCVCAP_TAG(entry->vcap) > 1)
ABORT_TRACE("can't (yet) trace multi-level property cache hit");
LIns* shape_ins = addName(lir->insLoadi(map_ins, offsetof(JSScope, shape)), "shape");
guard(true, addName(lir->ins2i(LIR_eq, shape_ins, entry->kshape), "guard(shape)"));
if (PCVCAP_TAG(entry->vcap) == 1) {
JS_ASSERT(OBJ_SCOPE(obj2)->shape == PCVCAP_SHAPE(entry->vcap));
LIns* obj2_ins = stobj_get_fslot(obj_ins, JSSLOT_PROTO);
2008-07-29 16:01:00 -07:00
map_ins = lir->insLoadi(obj2_ins, offsetof(JSObject, map));
LIns* ops_ins;
if (!map_is_native(obj2->map, map_ins, ops_ins))
2008-07-29 16:01:00 -07:00
return false;
shape_ins = addName(lir->insLoadi(map_ins, offsetof(JSScope, shape)), "shape");
guard(true, addName(lir->ins2i(LIR_eq, shape_ins, PCVCAP_SHAPE(entry->vcap)),
"guard(vcap_shape)"));
}
}
sprop = (JSScopeProperty*) prop;
JSScope* scope = OBJ_SCOPE(obj2);
jsval v;
const JSCodeSpec *cs = &js_CodeSpec[*cx->fp->regs->pc];
if (cs->format & JOF_CALLOP) {
if (SPROP_HAS_STUB_GETTER(sprop) && SPROP_HAS_VALID_SLOT(sprop, scope) &&
VALUE_IS_FUNCTION(cx, (v = STOBJ_GET_SLOT(obj2, sprop->slot))) &&
SCOPE_IS_BRANDED(scope)) {
/* Call op, "pure" sprop, function value, branded scope: cache method. */
pcval = JSVAL_OBJECT_TO_PCVAL(v);
OBJ_DROP_PROPERTY(cx, obj2, prop);
return true;
}
OBJ_DROP_PROPERTY(cx, obj2, prop);
2008-07-18 08:01:51 -07:00
ABORT_TRACE("can't fast method value for call op");
}
if ((((cs->format & JOF_SET) && SPROP_HAS_STUB_SETTER(sprop)) ||
SPROP_HAS_STUB_GETTER(sprop)) &&
SPROP_HAS_VALID_SLOT(sprop, scope)) {
/* Stub accessor of appropriate form and valid slot: cache slot. */
pcval = SLOT_TO_PCVAL(sprop->slot);
OBJ_DROP_PROPERTY(cx, obj2, prop);
return true;
}
2008-07-29 16:01:00 -07:00
ABORT_TRACE("no cacheable property found");
}
bool
TraceRecorder::test_property_cache_direct_slot(JSObject* obj, LIns* obj_ins, uint32& slot)
{
JSObject* obj2;
jsuword pcval;
/*
* Property cache ensures that we are dealing with an existing property,
* and guards the shape for us.
*/
if (!test_property_cache(obj, obj_ins, obj2, pcval))
return false;
/* Handle only gets and sets on the directly addressed object. */
if (obj2 != obj)
ABORT_TRACE("PC hit on prototype chain");
/* Don't trace setter calls, our caller wants a direct slot. */
if (PCVAL_IS_SPROP(pcval)) {
JS_ASSERT(js_CodeSpec[*cx->fp->regs->pc].format & JOF_SET);
JSScopeProperty* sprop = PCVAL_TO_SPROP(pcval);
if (!SPROP_HAS_STUB_SETTER(sprop))
ABORT_TRACE("non-stub setter");
if (!SPROP_HAS_VALID_SLOT(sprop, OBJ_SCOPE(obj)))
ABORT_TRACE("no valid slot");
slot = sprop->slot;
} else {
if (!PCVAL_IS_SLOT(pcval))
ABORT_TRACE("PCE is not a slot");
slot = PCVAL_TO_SLOT(pcval);
}
return true;
}
2008-07-05 13:44:48 -07:00
void
TraceRecorder::stobj_set_slot(LIns* obj_ins, unsigned slot, LIns*& dslots_ins, LIns* v_ins)
{
if (slot < JS_INITIAL_NSLOTS) {
addName(lir->insStorei(v_ins, obj_ins,
offsetof(JSObject, fslots) + slot * sizeof(jsval)),
"set_slot(fslots)");
} else {
2008-07-05 13:44:48 -07:00
if (!dslots_ins)
dslots_ins = lir->insLoadi(obj_ins, offsetof(JSObject, dslots));
addName(lir->insStorei(v_ins, dslots_ins,
(slot - JS_INITIAL_NSLOTS) * sizeof(jsval)),
"set_slot(dslots");
2008-07-05 13:44:48 -07:00
}
}
LIns*
TraceRecorder::stobj_get_fslot(LIns* obj_ins, unsigned slot)
{
JS_ASSERT(slot < JS_INITIAL_NSLOTS);
return lir->insLoadi(obj_ins, offsetof(JSObject, fslots) + slot * sizeof(jsval));
}
LIns*
TraceRecorder::stobj_get_slot(LIns* obj_ins, unsigned slot, LIns*& dslots_ins)
{
if (slot < JS_INITIAL_NSLOTS)
return stobj_get_fslot(obj_ins, slot);
if (!dslots_ins)
dslots_ins = lir->insLoadi(obj_ins, offsetof(JSObject, dslots));
return lir->insLoadi(dslots_ins, (slot - JS_INITIAL_NSLOTS) * sizeof(jsval));
}
bool
2008-07-05 13:44:48 -07:00
TraceRecorder::native_set(LIns* obj_ins, JSScopeProperty* sprop, LIns*& dslots_ins, LIns* v_ins)
{
if (SPROP_HAS_STUB_SETTER(sprop) && sprop->slot != SPROP_INVALID_SLOT) {
2008-07-05 13:44:48 -07:00
stobj_set_slot(obj_ins, sprop->slot, dslots_ins, v_ins);
return true;
}
ABORT_TRACE("unallocated or non-stub sprop");
}
bool
TraceRecorder::native_get(LIns* obj_ins, LIns* pobj_ins, JSScopeProperty* sprop,
2008-07-05 13:44:48 -07:00
LIns*& dslots_ins, LIns*& v_ins)
{
if (!SPROP_HAS_STUB_GETTER(sprop))
return false;
if (sprop->slot != SPROP_INVALID_SLOT)
v_ins = stobj_get_slot(pobj_ins, sprop->slot, dslots_ins);
else
v_ins = lir->insImm(JSVAL_TO_BOOLEAN(JSVAL_VOID));
return true;
}
bool
TraceRecorder::box_jsval(jsval v, LIns*& v_ins)
{
if (isNumber(v)) {
LIns* args[] = { v_ins, cx_ins };
v_ins = lir->insCall(F_BoxDouble, args);
guard(false, lir->ins2(LIR_eq, v_ins, lir->insImmPtr((void*)JSVAL_ERROR_COOKIE)),
OOM_EXIT);
return true;
}
switch (JSVAL_TAG(v)) {
case JSVAL_BOOLEAN:
v_ins = lir->ins2i(LIR_or, lir->ins2i(LIR_lsh, v_ins, JSVAL_TAGBITS), JSVAL_BOOLEAN);
return true;
case JSVAL_STRING:
v_ins = lir->ins2(LIR_or, v_ins, INS_CONST(JSVAL_STRING));
return true;
}
return false;
}
bool
TraceRecorder::unbox_jsval(jsval v, LIns*& v_ins)
{
if (isNumber(v)) {
// JSVAL_IS_NUMBER(v)
guard(false,
lir->ins_eq0(lir->ins2(LIR_or,
lir->ins2(LIR_and, v_ins, lir->insImmPtr((void*)JSVAL_INT)),
lir->ins2i(LIR_eq,
lir->ins2(LIR_and, v_ins,
lir->insImmPtr((void*)JSVAL_TAGMASK)),
JSVAL_DOUBLE))));
v_ins = lir->insCall(F_UnboxDouble, &v_ins);
return true;
}
switch (JSVAL_TAG(v)) {
case JSVAL_BOOLEAN:
guard(true,
lir->ins2i(LIR_eq,
lir->ins2(LIR_and, v_ins, lir->insImmPtr((void*)JSVAL_TAGMASK)),
JSVAL_BOOLEAN));
v_ins = lir->ins2i(LIR_ush, v_ins, JSVAL_TAGBITS);
return true;
case JSVAL_OBJECT:
guard(true,
lir->ins2i(LIR_eq,
lir->ins2(LIR_and, v_ins, lir->insImmPtr((void*)JSVAL_TAGMASK)),
JSVAL_OBJECT));
return true;
case JSVAL_STRING:
guard(true,
lir->ins2i(LIR_eq,
lir->ins2(LIR_and, v_ins, lir->insImmPtr((void*)JSVAL_TAGMASK)),
JSVAL_STRING));
v_ins = lir->ins2(LIR_and, v_ins, lir->insImmPtr((void*)~JSVAL_TAGMASK));
return true;
}
return false;
}
bool
TraceRecorder::getThis(LIns*& this_ins)
{
if (cx->fp->callee) { /* in a function */
if (JSVAL_IS_NULL(cx->fp->argv[-1]))
return false;
this_ins = get(&cx->fp->argv[-1]);
guard(false, lir->ins_eq0(this_ins));
} else { /* in global code */
JS_ASSERT(!JSVAL_IS_NULL(cx->fp->argv[-1]));
this_ins = lir->insLoadi(lir->insLoadi(cx_ins, offsetof(JSContext, fp)),
offsetof(JSStackFrame, thisp));
}
return true;
}
bool
TraceRecorder::guardClass(JSObject* obj, LIns* obj_ins, JSClass* clasp)
2008-07-05 13:44:48 -07:00
{
if (STOBJ_GET_CLASS(obj) != clasp)
2008-07-05 13:44:48 -07:00
return false;
LIns* class_ins = stobj_get_fslot(obj_ins, JSSLOT_CLASS);
2008-07-05 13:44:48 -07:00
class_ins = lir->ins2(LIR_and, class_ins, lir->insImmPtr((void*)~3));
char namebuf[32];
JS_snprintf(namebuf, sizeof namebuf, "guard(class is %s)", clasp->name);
guard(true, addName(lir->ins2(LIR_eq, class_ins, lir->insImmPtr(clasp)), namebuf));
2008-07-05 13:44:48 -07:00
return true;
}
bool TraceRecorder::guardDenseArray(JSObject* obj, LIns* obj_ins)
{
return guardClass(obj, obj_ins, &js_ArrayClass);
}
bool TraceRecorder::guardDenseArrayIndex(JSObject* obj, jsint idx, LIns* obj_ins,
LIns* dslots_ins, LIns* idx_ins)
2008-07-05 13:44:48 -07:00
{
jsuint length = ARRAY_DENSE_LENGTH(obj);
if (!((jsuint)idx < length && idx < obj->fslots[JSSLOT_ARRAY_LENGTH]))
return false;
LIns* length_ins = stobj_get_fslot(obj_ins, JSSLOT_ARRAY_LENGTH);
// guard(index >= 0)
guard(true, lir->ins2i(LIR_ge, idx_ins, 0));
2008-07-05 13:44:48 -07:00
// guard(index < length)
guard(true, lir->ins2(LIR_lt, idx_ins, length_ins));
// guard(index < capacity)
guard(false, lir->ins_eq0(dslots_ins));
guard(true, lir->ins2(LIR_lt, idx_ins,
lir->insLoadi(dslots_ins, 0 - sizeof(jsval))));
return true;
}
void
TraceRecorder::clearFrameSlotsFromCache()
{
/* Clear out all slots of this frame in the nativeFrameTracker. Different locations on the
VM stack might map to different locations on the native stack depending on the
number of arguments (i.e.) of the next call, so we have to make sure we map
those in to the cache with the right offsets. */
JSStackFrame* fp = cx->fp;
jsval* vp;
jsval* vpstop;
for (vp = &fp->argv[-1], vpstop = &fp->argv[JS_MAX(fp->fun->nargs,fp->argc)]; vp < vpstop; ++vp)
nativeFrameTracker.set(vp, (LIns*)0);
for (vp = &fp->slots[0], vpstop = &fp->slots[fp->script->nslots]; vp < vpstop; ++vp)
nativeFrameTracker.set(vp, (LIns*)0);
}
bool
TraceRecorder::record_EnterFrame()
{
2008-07-27 16:28:09 -07:00
if (++callDepth >= MAX_CALLDEPTH)
ABORT_TRACE("exceeded maximum call depth");
JSStackFrame* fp = cx->fp;
LIns* void_ins = lir->insImm(JSVAL_TO_BOOLEAN(JSVAL_VOID));
unsigned n;
for (n = 0; n < fp->script->nfixed; ++n)
set(&fp->slots[n], void_ins, true);
return true;
}
bool
TraceRecorder::record_LeaveFrame()
{
if (callDepth-- <= 0)
return false;
atoms = cx->fp->script->atomMap.vector;
stack(-1, rval_ins); // LeaveFrame gets called after the interpreter stored rval, so -1 not 0
return true;
}
bool TraceRecorder::record_JSOP_INTERRUPT()
{
return false;
}
bool TraceRecorder::record_JSOP_PUSH()
{
stack(0, lir->insImm(JSVAL_TO_BOOLEAN(JSVAL_VOID)));
2008-07-06 06:52:50 -07:00
return true;
}
bool TraceRecorder::record_JSOP_POPV()
{
// If we implement this, we need to update JSOP_STOP.
return false;
}
bool TraceRecorder::record_JSOP_ENTERWITH()
{
return false;
}
bool TraceRecorder::record_JSOP_LEAVEWITH()
{
return false;
}
bool TraceRecorder::record_JSOP_RETURN()
{
rval_ins = stack(-1);
clearFrameSlotsFromCache();
return true;
}
bool TraceRecorder::record_JSOP_GOTO()
{
return true;
}
bool TraceRecorder::record_JSOP_IFEQ()
{
return ifop();
}
bool TraceRecorder::record_JSOP_IFNE()
{
return ifop();
}
bool TraceRecorder::record_JSOP_ARGUMENTS()
{
return false;
}
bool TraceRecorder::record_JSOP_DUP()
{
stack(0, get(&stackval(-1)));
return true;
}
bool TraceRecorder::record_JSOP_DUP2()
{
stack(0, get(&stackval(-2)));
stack(1, get(&stackval(-1)));
return true;
}
bool TraceRecorder::record_JSOP_SETCONST()
{
return false;
}
bool TraceRecorder::record_JSOP_BITOR()
{
return binary(LIR_or);
}
bool TraceRecorder::record_JSOP_BITXOR()
{
return binary(LIR_xor);
}
bool TraceRecorder::record_JSOP_BITAND()
{
return binary(LIR_and);
}
bool TraceRecorder::record_JSOP_EQ()
{
jsval& r = stackval(-1);
jsval& l = stackval(-2);
if (JSVAL_IS_STRING(l) && JSVAL_IS_STRING(r)) {
LIns* args[] = { get(&r), get(&l) };
bool cond = js_EqualStrings(JSVAL_TO_STRING(l), JSVAL_TO_STRING(r));
LIns* x = lir->ins_eq0(lir->ins_eq0(lir->insCall(F_EqualStrings, args))); // pretty gross!
/* The interpreter fuses comparisons and the following branch,
so we have to do that here as well. */
if (cx->fp->regs->pc[1] == JSOP_IFEQ || cx->fp->regs->pc[1] == JSOP_IFNE)
guard(cond, x, BRANCH_EXIT);
/* We update the stack after the guard. This is safe since
the guard bails out at the comparison and the interpreter
will this re-execute the comparison. This way the
value of the condition doesn't have to be calculated and
saved on the stack in most cases. */
set(&l, x);
return true;
}
return cmp(LIR_feq);
}
bool TraceRecorder::record_JSOP_NE()
{
jsval& r = stackval(-1);
jsval& l = stackval(-2);
if (JSVAL_IS_STRING(l) && JSVAL_IS_STRING(r)) {
LIns* args[] = { get(&r), get(&l) };
bool cond = !js_EqualStrings(JSVAL_TO_STRING(l), JSVAL_TO_STRING(r));
LIns* x = lir->ins_eq0(lir->insCall(F_EqualStrings, args));
/* The interpreter fuses comparisons and the following branch,
so we have to do that here as well. */
if (cx->fp->regs->pc[1] == JSOP_IFEQ || cx->fp->regs->pc[1] == JSOP_IFNE)
guard(cond, x, BRANCH_EXIT);
/* We update the stack after the guard. This is safe since
the guard bails out at the comparison and the interpreter
will this re-execute the comparison. This way the
value of the condition doesn't have to be calculated and
saved on the stack in most cases. */
set(&l, x);
return true;
}
return cmp(LIR_feq, true);
}
bool TraceRecorder::record_JSOP_LT()
{
return cmp(LIR_flt);
}
bool TraceRecorder::record_JSOP_LE()
{
return cmp(LIR_fle);
}
bool TraceRecorder::record_JSOP_GT()
{
return cmp(LIR_fgt);
}
bool TraceRecorder::record_JSOP_GE()
{
return cmp(LIR_fge);
}
bool TraceRecorder::record_JSOP_LSH()
{
return binary(LIR_lsh);
}
bool TraceRecorder::record_JSOP_RSH()
{
return binary(LIR_rsh);
}
bool TraceRecorder::record_JSOP_URSH()
{
return binary(LIR_ush);
}
bool TraceRecorder::record_JSOP_ADD()
{
2008-07-29 07:53:31 -07:00
jsval& r = stackval(-1);
jsval& l = stackval(-2);
if (JSVAL_IS_STRING(l) && JSVAL_IS_STRING(r)) {
LIns* args[] = { get(&r), get(&l), cx_ins };
LIns* concat = lir->insCall(F_ConcatStrings, args);
guard(false, lir->ins_eq0(concat), OOM_EXIT);
2008-07-29 07:53:31 -07:00
set(&l, concat);
return true;
}
return binary(LIR_fadd);
}
bool TraceRecorder::record_JSOP_SUB()
{
return binary(LIR_fsub);
}
bool TraceRecorder::record_JSOP_MUL()
{
return binary(LIR_fmul);
}
bool TraceRecorder::record_JSOP_DIV()
{
return binary(LIR_fdiv);
}
bool TraceRecorder::record_JSOP_MOD()
{
2008-07-15 20:19:29 -07:00
jsval& r = stackval(-1);
jsval& l = stackval(-2);
if (isNumber(l) && isNumber(r)) {
LIns* args[] = { get(&r), get(&l) };
set(&l, lir->insCall(F_dmod, args));
return true;
}
return false;
}
bool TraceRecorder::record_JSOP_NOT()
{
jsval& v = stackval(-1);
if (JSVAL_IS_BOOLEAN(v)) {
set(&v, lir->ins_eq0(get(&v)));
return true;
}
return false;
}
bool TraceRecorder::record_JSOP_BITNOT()
{
return unary(LIR_not);
}
bool TraceRecorder::record_JSOP_NEG()
{
2008-07-11 21:20:48 -07:00
return unary(LIR_fneg);
}
bool TraceRecorder::record_JSOP_NEW()
{
return false;
}
bool TraceRecorder::record_JSOP_DELNAME()
{
return false;
}
bool TraceRecorder::record_JSOP_DELPROP()
{
return false;
}
bool TraceRecorder::record_JSOP_DELELEM()
{
return false;
}
bool TraceRecorder::record_JSOP_TYPEOF()
{
return false;
}
bool TraceRecorder::record_JSOP_VOID()
{
stack(0, lir->insImm(JSVAL_TO_BOOLEAN(JSVAL_VOID)));
return true;
}
bool TraceRecorder::record_JSOP_INCNAME()
{
return false;
}
bool TraceRecorder::record_JSOP_INCPROP()
{
return incProp(1);
}
bool TraceRecorder::record_JSOP_INCELEM()
{
return incElem(1);
}
bool TraceRecorder::record_JSOP_DECNAME()
{
return false;
}
bool TraceRecorder::record_JSOP_DECPROP()
{
return incProp(-1);
}
bool TraceRecorder::record_JSOP_DECELEM()
{
return incElem(-1);
}
bool TraceRecorder::record_JSOP_NAMEINC()
{
return false;
}
bool TraceRecorder::record_JSOP_PROPINC()
{
return incProp(1, false);
}
// XXX consolidate with record_JSOP_GETELEM code...
bool TraceRecorder::record_JSOP_ELEMINC()
{
return incElem(1, false);
}
bool TraceRecorder::record_JSOP_NAMEDEC()
{
return false;
}
bool TraceRecorder::record_JSOP_PROPDEC()
{
return incProp(-1, false);
}
bool TraceRecorder::record_JSOP_ELEMDEC()
{
return incElem(-1, false);
}
bool TraceRecorder::record_JSOP_GETPROP()
{
return getProp(stackval(-1));
}
bool TraceRecorder::record_JSOP_SETPROP()
{
jsval& r = stackval(-1);
jsval& l = stackval(-2);
if (JSVAL_IS_PRIMITIVE(l))
ABORT_TRACE("primitive this for SETPROP");
JSObject* obj = JSVAL_TO_OBJECT(l);
if (obj->map->ops->setProperty != js_SetProperty)
ABORT_TRACE("non-native setProperty");
LIns* obj_ins = get(&l);
JSPropertyCache* cache = &JS_PROPERTY_CACHE(cx);
uint32 kshape = OBJ_SCOPE(obj)->shape;
jsbytecode* pc = cx->fp->regs->pc;
JSPropCacheEntry* entry = &cache->table[PROPERTY_CACHE_HASH_PC(pc, kshape)];
if (entry->kpc != pc || entry->kshape != kshape)
ABORT_TRACE("cache miss");
LIns* map_ins = lir->insLoadi(obj_ins, offsetof(JSObject, map));
LIns* ops_ins;
if (!map_is_native(obj->map, map_ins, ops_ins))
return false;
if (obj != globalObj) { // global object's shape is guarded at trace entry
LIns* shape_ins = addName(lir->insLoadi(map_ins, offsetof(JSScope, shape)), "shape");
guard(true, addName(lir->ins2i(LIR_eq, shape_ins, kshape), "guard(shape)"));
}
JSScope* scope = OBJ_SCOPE(obj);
if (scope->object != obj)
ABORT_TRACE("not scope owner");
JSScopeProperty* sprop = PCVAL_TO_SPROP(entry->vword);
if (!SCOPE_HAS_PROPERTY(scope, sprop))
ABORT_TRACE("sprop not in scope");
LIns* dslots_ins = NULL;
LIns* v_ins = get(&r);
LIns* boxed_ins = v_ins;
if (!box_jsval(r, boxed_ins))
return false;
if (!native_set(obj_ins, sprop, dslots_ins, boxed_ins))
return false;
if (pc[JSOP_SETPROP_LENGTH] != JSOP_POP)
stack(-2, v_ins);
return true;
}
bool TraceRecorder::record_JSOP_GETELEM()
{
jsval& r = stackval(-1);
jsval& l = stackval(-2);
if (JSVAL_IS_STRING(l) && JSVAL_IS_INT(r)) {
LIns* args[] = { f2i(get(&r)), get(&l), cx_ins };
LIns* unitstr_ins = lir->insCall(F_String_getelem, args);
guard(false, lir->ins_eq0(unitstr_ins));
set(&l, unitstr_ins);
return true;
}
jsval* vp;
LIns* v_ins;
LIns* addr_ins;
if (!elem(l, r, vp, v_ins, addr_ins))
return false;
2008-07-05 13:44:48 -07:00
set(&l, v_ins);
return true;
}
bool TraceRecorder::record_JSOP_SETELEM()
{
jsval& v = stackval(-1);
jsval& r = stackval(-2);
jsval& l = stackval(-3);
/* no guards for type checks, trace specialized this already */
if (!JSVAL_IS_INT(r) || JSVAL_IS_PRIMITIVE(l))
ABORT_TRACE("not array[int]");
JSObject* obj = JSVAL_TO_OBJECT(l);
LIns* obj_ins = get(&l);
/* make sure the object is actually a dense array */
if (!guardDenseArray(obj, obj_ins))
ABORT_TRACE("not a dense array");
/* check that the index is within bounds */
LIns* idx_ins = f2i(get(&r));
/* we have to check that its really an integer, but this check will to go away
once we peel the loop type down to integer for this slot */
guard(true, lir->ins2(LIR_feq, get(&r), lir->ins1(LIR_i2f, idx_ins)));
/* ok, box the value we are storing, store it and we are done */
LIns* v_ins = get(&v);
LIns* boxed_ins = v_ins;
if (!box_jsval(v, boxed_ins))
ABORT_TRACE("boxing failed");
LIns* args[] = { boxed_ins, idx_ins, obj_ins, cx_ins };
LIns* res_ins = lir->insCall(F_Array_dense_setelem, args);
guard(false, lir->ins_eq0(res_ins));
set(&l, v_ins);
return true;
}
bool TraceRecorder::record_JSOP_CALLNAME()
{
JSObject* obj = cx->fp->scopeChain;
if (obj != globalObj)
ABORT_TRACE("fp->scopeChain is not global object");
LIns* obj_ins = lir->insLoadi(lir->insLoadi(cx_ins, offsetof(JSContext, fp)),
offsetof(JSStackFrame, scopeChain));
JSObject* obj2;
jsuword pcval;
if (!test_property_cache(obj, obj_ins, obj2, pcval))
ABORT_TRACE("missed prop");
if (!PCVAL_IS_OBJECT(pcval))
ABORT_TRACE("PCE not object");
stack(0, lir->insImmPtr(PCVAL_TO_OBJECT(pcval)));
stack(1, obj_ins);
return true;
}
JSBool
js_math_sin(JSContext* cx, uintN argc, jsval* vp);
JSBool
js_math_cos(JSContext* cx, uintN argc, jsval* vp);
JSBool
js_math_pow(JSContext* cx, uintN argc, jsval* vp);
JSBool
js_math_sqrt(JSContext* cx, uintN argc, jsval* vp);
JSBool
js_str_substring(JSContext* cx, uintN argc, jsval* vp);
JSBool
js_str_fromCharCode(JSContext* cx, uintN argc, jsval* vp);
JSBool
js_str_charCodeAt(JSContext* cx, uintN argc, jsval* vp);
2008-07-30 15:51:44 -07:00
JSBool
js_math_random(JSContext* cx, uintN argc, jsval* vp);
bool TraceRecorder::record_JSOP_CALL()
{
JSStackFrame* fp = cx->fp;
uintN argc = GET_ARGC(fp->regs->pc);
2008-07-28 21:17:43 -07:00
jsval& fval = stackval(0 - (argc + 2));
LIns* thisval_ins = stack(0 - (argc + 1));
if (!VALUE_IS_FUNCTION(cx, fval))
ABORT_TRACE("CALL on non-function");
JSFunction* fun = GET_FUNCTION_PRIVATE(cx, JSVAL_TO_OBJECT(fval));
if (FUN_INTERPRETED(fun)) {
// TODO: make sure args are not copied, or track the copying via the tracker
if (argc < fun->nargs &&
jsuword(fp->regs->sp + (fun->nargs - argc)) > cx->stackPool.current->limit) {
ABORT_TRACE("can't trace calls with too few args requiring argv move");
}
FrameInfo fi = {
JSVAL_TO_OBJECT(fval),
fp->regs->pc,
fp->regs->sp + (fun->nargs - argc) - fp->slots,
argc
};
unsigned callDepth = getCallDepth();
if (callDepth >= treeInfo->maxCallDepth)
treeInfo->maxCallDepth = callDepth + 1;
lir->insStorei(lir->insImmPtr(fi.callee), lirbuf->rp,
callDepth * sizeof(FrameInfo) + offsetof(FrameInfo, callee));
lir->insStorei(lir->insImmPtr(fi.callpc), lirbuf->rp,
callDepth * sizeof(FrameInfo) + offsetof(FrameInfo, callpc));
lir->insStorei(lir->insImm(fi.word), lirbuf->rp,
callDepth * sizeof(FrameInfo) + offsetof(FrameInfo, word));
atoms = fun->u.i.script->atomMap.vector;
return true;
}
if (FUN_SLOW_NATIVE(fun))
ABORT_TRACE("slow native");
enum JSTNErrType { INFALLIBLE, FAIL_NULL, FAIL_NEG };
static struct JSTraceableNative {
JSFastNative native;
int builtin;
const char *prefix;
const char *argtypes;
JSTNErrType errtype;
} knownNatives[] = {
{ js_math_sin, F_Math_sin, "", "d", INFALLIBLE, },
{ js_math_cos, F_Math_cos, "", "d", INFALLIBLE, },
{ js_math_pow, F_Math_pow, "", "dd", INFALLIBLE, },
{ js_math_sqrt, F_Math_sqrt, "", "d", INFALLIBLE, },
{ js_str_substring, F_String_p_substring, "TC", "ii", FAIL_NULL, },
{ js_str_substring, F_String_p_substring_1, "TC", "i", FAIL_NULL, },
{ js_str_fromCharCode, F_String_fromCharCode, "C", "i", FAIL_NULL, },
2008-07-30 15:51:44 -07:00
{ js_str_charCodeAt, F_String_p_charCodeAt, "T", "i", FAIL_NEG, },
{ js_math_random, F_Math_random, "R", "", INFALLIBLE, }
};
for (uintN i = 0; i < JS_ARRAY_LENGTH(knownNatives); i++) {
JSTraceableNative* known = &knownNatives[i];
if ((JSFastNative)fun->u.n.native != known->native)
continue;
2008-07-29 07:38:04 -07:00
uintN knownargc = strlen(known->argtypes);
if (argc != knownargc)
continue; // might have another specialization for this argc
intN prefixc = strlen(known->prefix);
LIns* args[5];
LIns** argp = &args[argc + prefixc - 1];
char argtype;
#define HANDLE_PREFIX(i) \
argtype = known->prefix[i]; \
if (argtype == 'C') { \
*argp = cx_ins; \
} else if (argtype == 'T') { \
*argp = thisval_ins; \
2008-07-30 15:51:44 -07:00
} else if (argtype == 'R') { \
*argp = lir->insImmPtr((void*)cx->runtime); \
} else { \
JS_ASSERT(0 && "unknown prefix arg type"); \
} \
argp--;
switch (prefixc) {
case 2:
HANDLE_PREFIX(1);
/* FALL THROUGH */
case 1:
HANDLE_PREFIX(0);
/* FALL THROUGH */
case 0:
break;
default:
JS_ASSERT(0 && "illegal number of prefix args");
}
#undef HANDLE_PREFIX
2008-07-29 16:01:00 -07:00
#define HANDLE_ARG(i) \
argtype = known->argtypes[i]; \
if (argtype == 'd' || argtype == 'i') { \
if (!isNumber(stackval(-(i + 1)))) \
ABORT_TRACE("arg in position " #i " must be numeric"); \
*argp = get(&stackval(-(i + 1))); \
if (argtype == 'i') \
*argp = f2i(*argp); \
} else { \
JS_ASSERT(0 && "unknown arg type"); \
} \
argp--;
switch (strlen(known->argtypes)) {
case 4:
HANDLE_ARG(3);
/* FALL THROUGH */
case 3:
HANDLE_ARG(2);
/* FALL THROUGH */
case 2:
HANDLE_ARG(1);
/* FALL THROUGH */
case 1:
HANDLE_ARG(0);
/* FALL THROUGH */
case 0:
break;
default:
JS_ASSERT(0 && "illegal number of args to traceable native");
}
#undef HANDLE_ARG
LIns* res_ins = lir->insCall(known->builtin, args);
if (known->errtype == FAIL_NULL) {
guard(false, lir->ins_eq0(res_ins), OOM_EXIT);
} else if (known->errtype == FAIL_NEG) {
res_ins = lir->ins1(LIR_i2f, res_ins);
jsdpun u;
u.d = 0.0;
guard(false, lir->ins2(LIR_flt, res_ins, lir->insImmq(u.u64)), OOM_EXIT);
}
set(&fval, res_ins);
return true;
}
/* Didn't find it. */
ABORT_TRACE("unknown native");
}
2008-07-15 10:17:51 -07:00
bool
TraceRecorder::prop(JSObject* obj, LIns* obj_ins, uint32& slot, LIns*& v_ins)
2008-07-15 10:17:51 -07:00
{
/*
* Can't specialize to assert obj != global, must guard to avoid aliasing
* stale homes of stacked global variables.
*/
if (obj == globalObj)
ABORT_TRACE("prop op aliases global");
guard(false, lir->ins2(LIR_eq, obj_ins, lir->insImmPtr((void*)globalObj)));
2008-07-15 10:17:51 -07:00
if (!test_property_cache_direct_slot(obj, obj_ins, slot))
return false;
2008-07-15 10:40:11 -07:00
LIns* dslots_ins = NULL;
v_ins = stobj_get_slot(obj_ins, slot, dslots_ins);
if (!unbox_jsval(STOBJ_GET_SLOT(obj, slot), v_ins))
2008-07-15 10:17:51 -07:00
ABORT_TRACE("unboxing");
return true;
}
bool
TraceRecorder::elem(jsval& l, jsval& r, jsval*& vp, LIns*& v_ins, LIns*& addr_ins)
{
/* no guards for type checks, trace specialized this already */
if (!JSVAL_IS_INT(r) || JSVAL_IS_PRIMITIVE(l))
return false;
/*
* Can't specialize to assert obj != global, must guard to avoid aliasing
* stale homes of stacked global variables.
*/
JSObject* obj = JSVAL_TO_OBJECT(l);
if (obj == globalObj)
ABORT_TRACE("elem op aliases global");
LIns* obj_ins = get(&l);
guard(false, lir->ins2(LIR_eq, obj_ins, lir->insImmPtr((void*)globalObj)));
/* make sure the object is actually a dense array */
if (!guardDenseArray(obj, obj_ins))
return false;
/* check that the index is within bounds */
jsint idx = JSVAL_TO_INT(r);
LIns* idx_ins = f2i(get(&r));
/* we have to check that its really an integer, but this check will to go away
once we peel the loop type down to integer for this slot */
guard(true, lir->ins2(LIR_feq, get(&r), lir->ins1(LIR_i2f, idx_ins)));
LIns* dslots_ins = lir->insLoadi(obj_ins, offsetof(JSObject, dslots));
if (!guardDenseArrayIndex(obj, idx, obj_ins, dslots_ins, idx_ins))
return false;
vp = &obj->dslots[idx];
addr_ins = lir->ins2(LIR_add, dslots_ins,
lir->ins2i(LIR_lsh, idx_ins, (sizeof(jsval) == 4) ? 2 : 3));
/* load the value, check the type (need to check JSVAL_HOLE only for booleans) */
v_ins = lir->insLoad(LIR_ld, addr_ins, 0);
return unbox_jsval(*vp, v_ins);
}
bool
TraceRecorder::getProp(JSObject* obj, LIns* obj_ins)
{
uint32 slot;
LIns* v_ins;
if (!prop(obj, obj_ins, slot, v_ins))
return false;
const JSCodeSpec& cs = js_CodeSpec[*cx->fp->regs->pc];
JS_ASSERT(cs.ndefs == 1);
stack(-cs.nuses, v_ins);
2008-07-15 10:17:51 -07:00
return true;
}
bool
TraceRecorder::getProp(jsval& v)
2008-07-15 10:17:51 -07:00
{
if (JSVAL_IS_PRIMITIVE(v))
ABORT_TRACE("primitive lhs");
return getProp(JSVAL_TO_OBJECT(v), get(&v));
2008-07-15 10:17:51 -07:00
}
bool TraceRecorder::record_JSOP_NAME()
{
JSObject* obj = cx->fp->scopeChain;
if (obj != globalObj)
return false;
LIns* obj_ins = lir->insLoadi(lir->insLoadi(cx_ins, offsetof(JSContext, fp)),
offsetof(JSStackFrame, scopeChain));
/* Can't use getProp here, because we don't want unboxing. */
uint32 slot;
if (!test_property_cache_direct_slot(obj, obj_ins, slot))
return false;
if (!lazilyImportGlobalSlot(slot))
ABORT_TRACE("lazy import of global slot failed");
stack(0, get(&STOBJ_GET_SLOT(obj, slot)));
return true;
}
bool TraceRecorder::record_JSOP_DOUBLE()
{
jsval v = jsval(atoms[GET_INDEX(cx->fp->regs->pc)]);
jsdpun u;
u.d = *JSVAL_TO_DOUBLE(v);
stack(0, lir->insImmq(u.u64));
return true;
}
bool TraceRecorder::record_JSOP_STRING()
{
JSAtom* atom = atoms[GET_INDEX(cx->fp->regs->pc)];
JS_ASSERT(ATOM_IS_STRING(atom));
stack(0, lir->insImmPtr((void*)ATOM_TO_STRING(atom)));
return true;
}
bool TraceRecorder::record_JSOP_ZERO()
{
jsdpun u;
u.d = 0.0;
stack(0, lir->insImmq(u.u64));
2008-07-05 06:15:33 -07:00
return true;
}
bool TraceRecorder::record_JSOP_ONE()
{
jsdpun u;
u.d = 1.0;
stack(0, lir->insImmq(u.u64));
2008-07-05 06:15:33 -07:00
return true;
}
bool TraceRecorder::record_JSOP_NULL()
{
stack(0, lir->insImmPtr(NULL));
2008-07-05 06:15:33 -07:00
return true;
}
bool TraceRecorder::record_JSOP_THIS()
{
LIns* this_ins;
if (!getThis(this_ins))
return false;
stack(0, this_ins);
return true;
}
bool TraceRecorder::record_JSOP_FALSE()
{
2008-07-05 06:15:33 -07:00
stack(0, lir->insImm(0));
return true;
}
bool TraceRecorder::record_JSOP_TRUE()
{
2008-07-05 06:15:33 -07:00
stack(0, lir->insImm(1));
return true;
}
bool TraceRecorder::record_JSOP_OR()
{
return false;
}
bool TraceRecorder::record_JSOP_AND()
{
return false;
}
bool TraceRecorder::record_JSOP_TABLESWITCH()
{
return false;
}
bool TraceRecorder::record_JSOP_LOOKUPSWITCH()
{
return false;
}
bool TraceRecorder::record_JSOP_STRICTEQ()
{
return false;
}
bool TraceRecorder::record_JSOP_STRICTNE()
{
return false;
}
bool TraceRecorder::record_JSOP_CLOSURE()
{
return false;
}
bool TraceRecorder::record_JSOP_EXPORTALL()
{
return false;
}
bool TraceRecorder::record_JSOP_EXPORTNAME()
{
return false;
}
bool TraceRecorder::record_JSOP_IMPORTALL()
{
return false;
}
bool TraceRecorder::record_JSOP_IMPORTPROP()
{
return false;
}
bool TraceRecorder::record_JSOP_IMPORTELEM()
{
return false;
}
bool TraceRecorder::record_JSOP_OBJECT()
{
return false;
}
bool TraceRecorder::record_JSOP_POP()
{
2008-07-06 06:52:50 -07:00
return true;
}
bool TraceRecorder::record_JSOP_POS()
{
jsval& r = stackval(-1);
return isNumber(r);
}
bool TraceRecorder::record_JSOP_TRAP()
{
return false;
}
bool TraceRecorder::record_JSOP_GETARG()
{
stack(0, arg(GET_ARGNO(cx->fp->regs->pc)));
return true;
}
bool TraceRecorder::record_JSOP_SETARG()
{
arg(GET_ARGNO(cx->fp->regs->pc), stack(-1));
return true;
}
bool TraceRecorder::record_JSOP_GETVAR()
{
2008-07-22 21:20:29 -07:00
stack(0, var(GET_SLOTNO(cx->fp->regs->pc)));
return true;
}
bool TraceRecorder::record_JSOP_SETVAR()
{
2008-07-22 21:20:29 -07:00
var(GET_SLOTNO(cx->fp->regs->pc), stack(-1));
return true;
}
bool TraceRecorder::record_JSOP_UINT16()
{
jsdpun u;
u.d = (jsdouble)GET_UINT16(cx->fp->regs->pc);
stack(0, lir->insImmq(u.u64));
return true;
}
bool TraceRecorder::record_JSOP_NEWINIT()
{
return false;
}
bool TraceRecorder::record_JSOP_ENDINIT()
{
return false;
}
bool TraceRecorder::record_JSOP_INITPROP()
{
return false;
}
bool TraceRecorder::record_JSOP_INITELEM()
{
return false;
}
bool TraceRecorder::record_JSOP_DEFSHARP()
{
return false;
}
bool TraceRecorder::record_JSOP_USESHARP()
{
return false;
}
bool TraceRecorder::record_JSOP_INCARG()
{
return inc(argval(GET_ARGNO(cx->fp->regs->pc)), 1);
}
bool TraceRecorder::record_JSOP_INCVAR()
{
2008-07-22 21:20:29 -07:00
return inc(varval(GET_SLOTNO(cx->fp->regs->pc)), 1);
}
bool TraceRecorder::record_JSOP_DECARG()
{
return inc(argval(GET_ARGNO(cx->fp->regs->pc)), -1);
}
bool TraceRecorder::record_JSOP_DECVAR()
{
2008-07-22 21:20:29 -07:00
return inc(varval(GET_SLOTNO(cx->fp->regs->pc)), -1);
}
bool TraceRecorder::record_JSOP_ARGINC()
{
return inc(argval(GET_ARGNO(cx->fp->regs->pc)), 1, false);
}
bool TraceRecorder::record_JSOP_VARINC()
{
2008-07-22 21:20:29 -07:00
return inc(varval(GET_SLOTNO(cx->fp->regs->pc)), 1, false);
}
bool TraceRecorder::record_JSOP_ARGDEC()
{
return inc(argval(GET_ARGNO(cx->fp->regs->pc)), -1, false);
}
bool TraceRecorder::record_JSOP_VARDEC()
{
2008-07-22 21:20:29 -07:00
return inc(varval(GET_SLOTNO(cx->fp->regs->pc)), -1, false);
}
bool TraceRecorder::record_JSOP_ITER()
{
return true;
}
bool TraceRecorder::forInProlog(LIns*& iterobj_ins)
{
jsval& iterval = stackval(-1);
JS_ASSERT(!JSVAL_IS_PRIMITIVE(iterval));
JSObject* iterobj = JSVAL_TO_OBJECT(iterval);
iterobj_ins = get(&iterval);
if (guardClass(iterobj, iterobj_ins, &js_IteratorClass)) {
uintN flags = JSVAL_TO_INT(iterobj->fslots[JSSLOT_ITER_FLAGS]);
if (flags & ~JSITER_ENUMERATE)
ABORT_TRACE("for-each-in or destructuring JSOP_ITER not traced");
guard(true,
addName(lir->ins_eq0(lir->ins2(LIR_and,
lir->insLoadi(iterobj_ins,
offsetof(JSObject, fslots) +
JSSLOT_ITER_FLAGS * sizeof(jsval)),
lir->insImm(~JSITER_ENUMERATE))),
"guard(iter flags is JSITER_ENUMERATE)"));
JSObject* obj = STOBJ_GET_PARENT(iterobj);
LIns* obj_ins = stobj_get_fslot(iterobj_ins, JSSLOT_PARENT);
LIns* map_ins = lir->insLoadi(obj_ins, offsetof(JSObject, map));
LIns* ops_ins;
if (!map_is_native(obj->map, map_ins, ops_ins))
return false;
LIns* n = lir->insLoadi(ops_ins, offsetof(JSObjectOps, enumerate));
if (obj->map->ops->enumerate == js_ObjectOps.enumerate) {
guard(true, addName(lir->ins2(LIR_eq, n, lir->insImmPtr((void*)js_ObjectOps.enumerate)),
"guard(native-enumerate)"));
return true;
}
}
return false;
}
bool TraceRecorder::record_JSOP_ENDITER()
{
return true;
}
bool TraceRecorder::record_JSOP_FORNAME()
{
return false;
}
bool TraceRecorder::record_JSOP_FORPROP()
{
return false;
}
bool TraceRecorder::record_JSOP_FORELEM()
{
return false;
}
bool TraceRecorder::record_JSOP_FORARG()
{
return false;
}
bool TraceRecorder::record_JSOP_FORVAR()
{
LIns* iterobj_ins;
if (!forInProlog(iterobj_ins))
return false;
LIns* stateval_ins = stobj_get_fslot(iterobj_ins, JSSLOT_ITER_STATE);
guard(false,
addName(lir->ins2(LIR_eq, stateval_ins, lir->insImmPtr((void*) JSVAL_ZERO)),
"guard(non-empty iter state)"));
LIns* state_ins = lir->ins2(LIR_and, stateval_ins, lir->insImmPtr((void*) ~3));
LIns* cursor_ins = lir->insLoadi(state_ins, offsetof(JSNativeEnumerator, cursor));
guard(false, addName(lir->ins_eq0(cursor_ins), "guard(ne->cursor != 0)"));
cursor_ins = lir->ins2i(LIR_sub, cursor_ins, 1);
lir->insStorei(cursor_ins, state_ins, offsetof(JSNativeEnumerator, cursor));
LIns* ids_ins = lir->ins2i(LIR_add, state_ins, offsetof(JSNativeEnumerator, ids));
LIns* id_addr_ins = lir->ins2(LIR_add, ids_ins,
lir->ins2i(LIR_lsh, cursor_ins, (sizeof(jsid) == 4) ? 2 : 3));
LIns* id_ins = lir->insLoadi(id_addr_ins, 0);
var(GET_SLOTNO(cx->fp->regs->pc), id_ins);
// Stack an unboxed true to make JSOP_IFEQ loop.
stack(0, lir->insImm(1));
return true;
}
bool TraceRecorder::record_JSOP_FORLOCAL()
{
return false;
}
bool TraceRecorder::record_JSOP_FORCONST()
{
return false;
}
bool TraceRecorder::record_JSOP_POPN()
{
2008-07-06 06:52:50 -07:00
return true;
}
bool TraceRecorder::record_JSOP_BINDNAME()
{
JSObject* obj = cx->fp->scopeChain;
if (obj != globalObj)
return false;
LIns* obj_ins = lir->insLoadi(lir->insLoadi(cx_ins, offsetof(JSContext, fp)),
offsetof(JSStackFrame, scopeChain));
JSObject* obj2;
jsuword pcval;
if (!test_property_cache(obj, obj_ins, obj2, pcval))
return false;
stack(0, obj_ins);
return true;
}
bool TraceRecorder::record_JSOP_SETNAME()
{
jsval& r = stackval(-1);
jsval& l = stackval(-2);
2008-07-08 18:07:27 -07:00
if (JSVAL_IS_PRIMITIVE(l))
return false;
/*
* Trace cases that are global code or in lightweight functions scoped by
* the global object only.
2008-07-08 18:07:27 -07:00
*/
JSObject* obj = JSVAL_TO_OBJECT(l);
if (obj != cx->fp->scopeChain || obj != globalObj)
2008-07-08 18:07:27 -07:00
return false;
LIns* obj_ins = get(&l);
uint32 slot;
if (!test_property_cache_direct_slot(obj, obj_ins, slot))
2008-07-08 18:07:27 -07:00
return false;
if (!lazilyImportGlobalSlot(slot))
ABORT_TRACE("lazy import of global slot failed");
LIns* r_ins = get(&r);
set(&STOBJ_GET_SLOT(obj, slot), r_ins);
if (cx->fp->regs->pc[JSOP_SETNAME_LENGTH] != JSOP_POP)
stack(-2, r_ins);
2008-07-08 18:07:27 -07:00
return true;
}
2008-07-08 18:07:27 -07:00
bool TraceRecorder::record_JSOP_THROW()
{
return false;
}
bool TraceRecorder::record_JSOP_IN()
{
return false;
}
bool TraceRecorder::record_JSOP_INSTANCEOF()
{
return false;
}
bool TraceRecorder::record_JSOP_DEBUGGER()
{
return false;
}
bool TraceRecorder::record_JSOP_GOSUB()
{
return false;
}
bool TraceRecorder::record_JSOP_RETSUB()
{
return false;
}
bool TraceRecorder::record_JSOP_EXCEPTION()
{
return false;
}
bool TraceRecorder::record_JSOP_LINENO()
{
2008-07-06 06:52:50 -07:00
return true;
}
bool TraceRecorder::record_JSOP_CONDSWITCH()
{
2008-07-06 06:52:50 -07:00
return true;
}
bool TraceRecorder::record_JSOP_CASE()
{
return false;
}
bool TraceRecorder::record_JSOP_DEFAULT()
{
return false;
}
bool TraceRecorder::record_JSOP_EVAL()
{
return false;
}
bool TraceRecorder::record_JSOP_ENUMELEM()
{
return false;
}
bool TraceRecorder::record_JSOP_GETTER()
{
return false;
}
bool TraceRecorder::record_JSOP_SETTER()
{
return false;
}
bool TraceRecorder::record_JSOP_DEFFUN()
{
return false;
}
bool TraceRecorder::record_JSOP_DEFCONST()
{
return false;
}
bool TraceRecorder::record_JSOP_DEFVAR()
{
return false;
}
bool TraceRecorder::record_JSOP_ANONFUNOBJ()
{
return false;
}
bool TraceRecorder::record_JSOP_NAMEDFUNOBJ()
{
return false;
}
bool TraceRecorder::record_JSOP_SETLOCALPOP()
{
return false;
}
bool TraceRecorder::record_JSOP_GROUP()
{
2008-07-05 06:15:33 -07:00
return true; // no-op
}
bool TraceRecorder::record_JSOP_SETCALL()
{
return false;
}
bool TraceRecorder::record_JSOP_TRY()
{
2008-07-06 06:52:50 -07:00
return true;
}
bool TraceRecorder::record_JSOP_FINALLY()
{
2008-07-06 06:52:50 -07:00
return true;
}
bool TraceRecorder::record_JSOP_NOP()
{
2008-07-06 06:52:50 -07:00
return true;
}
bool TraceRecorder::record_JSOP_ARGSUB()
{
return false;
}
bool TraceRecorder::record_JSOP_ARGCNT()
{
return false;
}
2008-07-19 15:42:31 -07:00
/*
* XXX could hoist out to jsinterp.h and share with jsinterp.cpp, but
* XXX jsopcode.cpp has different definitions of same-named macros.
*/
#define GET_FULL_INDEX(PCOFF) \
(atoms - script->atomMap.vector + GET_INDEX(regs.pc + PCOFF))
#define LOAD_FUNCTION(PCOFF) \
JS_GET_SCRIPT_FUNCTION(script, GET_FULL_INDEX(PCOFF), fun)
2008-07-19 15:42:31 -07:00
bool TraceRecorder::record_JSOP_DEFLOCALFUN()
{
JSFunction* fun;
JSFrameRegs& regs = *cx->fp->regs;
JSScript* script = cx->fp->script;
2008-07-22 21:20:29 -07:00
LOAD_FUNCTION(SLOTNO_LEN);
JSObject* obj = FUN_OBJECT(fun);
if (OBJ_GET_PARENT(cx, obj) != cx->fp->scopeChain)
ABORT_TRACE("can't trace with activation object on scopeChain");
2008-07-22 21:20:29 -07:00
var(GET_SLOTNO(regs.pc), lir->insImmPtr(obj));
return true;
}
2008-07-19 15:42:31 -07:00
bool TraceRecorder::record_JSOP_GOTOX()
{
return false;
}
bool TraceRecorder::record_JSOP_IFEQX()
{
return record_JSOP_IFEQ();
}
bool TraceRecorder::record_JSOP_IFNEX()
{
return record_JSOP_IFNE();
}
bool TraceRecorder::record_JSOP_ORX()
{
return record_JSOP_OR();
}
bool TraceRecorder::record_JSOP_ANDX()
{
return record_JSOP_AND();
}
bool TraceRecorder::record_JSOP_GOSUBX()
{
return record_JSOP_GOSUB();
}
bool TraceRecorder::record_JSOP_CASEX()
{
return record_JSOP_CASE();
}
bool TraceRecorder::record_JSOP_DEFAULTX()
{
return record_JSOP_DEFAULT();
}
bool TraceRecorder::record_JSOP_TABLESWITCHX()
{
return record_JSOP_TABLESWITCH();
}
bool TraceRecorder::record_JSOP_LOOKUPSWITCHX()
{
return record_JSOP_LOOKUPSWITCH();
}
bool TraceRecorder::record_JSOP_BACKPATCH()
{
2008-07-06 06:52:50 -07:00
return true;
}
bool TraceRecorder::record_JSOP_BACKPATCH_POP()
{
2008-07-06 06:52:50 -07:00
return true;
}
bool TraceRecorder::record_JSOP_THROWING()
{
return false;
}
bool TraceRecorder::record_JSOP_SETRVAL()
{
// If we implement this, we need to update JSOP_STOP.
return false;
}
bool TraceRecorder::record_JSOP_RETRVAL()
{
return false;
}
bool TraceRecorder::record_JSOP_GETGVAR()
{
2008-07-22 21:20:29 -07:00
jsval slotval = cx->fp->slots[GET_SLOTNO(cx->fp->regs->pc)];
if (JSVAL_IS_NULL(slotval))
return true; // We will see JSOP_NAME from the interpreter's jump, so no-op here.
uint32 slot = JSVAL_TO_INT(slotval);
if (!lazilyImportGlobalSlot(slot))
ABORT_TRACE("lazy import of global slot failed");
stack(0, get(&STOBJ_GET_SLOT(cx->fp->scopeChain, slot)));
return true;
}
bool TraceRecorder::record_JSOP_SETGVAR()
{
2008-07-22 21:20:29 -07:00
jsval slotval = cx->fp->slots[GET_SLOTNO(cx->fp->regs->pc)];
if (JSVAL_IS_NULL(slotval))
return true; // We will see JSOP_NAME from the interpreter's jump, so no-op here.
uint32 slot = JSVAL_TO_INT(slotval);
if (!lazilyImportGlobalSlot(slot))
ABORT_TRACE("lazy import of global slot failed");
set(&STOBJ_GET_SLOT(cx->fp->scopeChain, slot), stack(-1));
return true;
}
bool TraceRecorder::record_JSOP_INCGVAR()
{
2008-07-22 21:20:29 -07:00
jsval slotval = cx->fp->slots[GET_SLOTNO(cx->fp->regs->pc)];
if (JSVAL_IS_NULL(slotval))
return true; // We will see JSOP_INCNAME from the interpreter's jump, so no-op here.
uint32 slot = JSVAL_TO_INT(slotval);
if (!lazilyImportGlobalSlot(slot))
ABORT_TRACE("lazy import of global slot failed");
return inc(STOBJ_GET_SLOT(cx->fp->scopeChain, slot), 1);
}
bool TraceRecorder::record_JSOP_DECGVAR()
{
2008-07-22 21:20:29 -07:00
jsval slotval = cx->fp->slots[GET_SLOTNO(cx->fp->regs->pc)];
if (JSVAL_IS_NULL(slotval))
return true; // We will see JSOP_INCNAME from the interpreter's jump, so no-op here.
uint32 slot = JSVAL_TO_INT(slotval);
if (!lazilyImportGlobalSlot(slot))
ABORT_TRACE("lazy import of global slot failed");
return inc(STOBJ_GET_SLOT(cx->fp->scopeChain, slot), -1);
}
bool TraceRecorder::record_JSOP_GVARINC()
{
2008-07-22 21:20:29 -07:00
jsval slotval = cx->fp->slots[GET_SLOTNO(cx->fp->regs->pc)];
if (JSVAL_IS_NULL(slotval))
return true; // We will see JSOP_INCNAME from the interpreter's jump, so no-op here.
uint32 slot = JSVAL_TO_INT(slotval);
if (!lazilyImportGlobalSlot(slot))
ABORT_TRACE("lazy import of global slot failed");
return inc(STOBJ_GET_SLOT(cx->fp->scopeChain, slot), 1, false);
}
bool TraceRecorder::record_JSOP_GVARDEC()
{
2008-07-22 21:20:29 -07:00
jsval slotval = cx->fp->slots[GET_SLOTNO(cx->fp->regs->pc)];
if (JSVAL_IS_NULL(slotval))
return true; // We will see JSOP_INCNAME from the interpreter's jump, so no-op here.
uint32 slot = JSVAL_TO_INT(slotval);
if (!lazilyImportGlobalSlot(slot))
ABORT_TRACE("lazy import of global slot failed");
return inc(STOBJ_GET_SLOT(cx->fp->scopeChain, slot), -1, false);
}
bool TraceRecorder::record_JSOP_REGEXP()
{
return false;
}
bool TraceRecorder::record_JSOP_DEFXMLNS()
{
return false;
}
bool TraceRecorder::record_JSOP_ANYNAME()
{
return false;
}
bool TraceRecorder::record_JSOP_QNAMEPART()
{
return false;
}
bool TraceRecorder::record_JSOP_QNAMECONST()
{
return false;
}
bool TraceRecorder::record_JSOP_QNAME()
{
return false;
}
bool TraceRecorder::record_JSOP_TOATTRNAME()
{
return false;
}
bool TraceRecorder::record_JSOP_TOATTRVAL()
{
return false;
}
bool TraceRecorder::record_JSOP_ADDATTRNAME()
{
return false;
}
bool TraceRecorder::record_JSOP_ADDATTRVAL()
{
return false;
}
bool TraceRecorder::record_JSOP_BINDXMLNAME()
{
return false;
}
bool TraceRecorder::record_JSOP_SETXMLNAME()
{
return false;
}
bool TraceRecorder::record_JSOP_XMLNAME()
{
return false;
}
bool TraceRecorder::record_JSOP_DESCENDANTS()
{
return false;
}
bool TraceRecorder::record_JSOP_FILTER()
{
return false;
}
bool TraceRecorder::record_JSOP_ENDFILTER()
{
return false;
}
bool TraceRecorder::record_JSOP_TOXML()
{
return false;
}
bool TraceRecorder::record_JSOP_TOXMLLIST()
{
return false;
}
bool TraceRecorder::record_JSOP_XMLTAGEXPR()
{
return false;
}
bool TraceRecorder::record_JSOP_XMLELTEXPR()
{
return false;
}
bool TraceRecorder::record_JSOP_XMLOBJECT()
{
return false;
}
bool TraceRecorder::record_JSOP_XMLCDATA()
{
return false;
}
bool TraceRecorder::record_JSOP_XMLCOMMENT()
{
return false;
}
bool TraceRecorder::record_JSOP_XMLPI()
{
return false;
}
bool TraceRecorder::record_JSOP_CALLPROP()
{
jsval& l = stackval(-1);
JSObject* obj;
LIns* obj_ins;
if (!JSVAL_IS_PRIMITIVE(l)) {
obj = JSVAL_TO_OBJECT(l);
obj_ins = get(&l);
stack(0, obj_ins); // |this| for subsequent call
} else {
jsint i;
#ifdef DEBUG
const char* protoname = NULL;
#endif
if (JSVAL_IS_STRING(l)) {
i = JSProto_String;
#ifdef DEBUG
protoname = "String.prototype";
#endif
} else if (JSVAL_IS_NUMBER(l)) {
i = JSProto_Number;
#ifdef DEBUG
protoname = "Number.prototype";
#endif
} else if (JSVAL_IS_BOOLEAN(l)) {
i = JSProto_Boolean;
#ifdef DEBUG
protoname = "Boolean.prototype";
#endif
} else {
JS_ASSERT(JSVAL_IS_NULL(l) || JSVAL_IS_VOID(l));
ABORT_TRACE("callprop on null or void");
}
if (!js_GetClassPrototype(cx, NULL, INT_TO_JSID(i), &obj))
ABORT_TRACE("GetClassPrototype failed!");
2008-07-29 16:01:00 -07:00
obj_ins = lir->insImmPtr((void*)obj);
#ifdef DEBUG
obj_ins = addName(obj_ins, protoname);
#endif
stack(0, get(&l)); // use primitive as |this|
}
2008-07-29 16:01:00 -07:00
JSObject* obj2;
jsuword pcval;
if (!test_property_cache(obj, obj_ins, obj2, pcval))
ABORT_TRACE("missed prop");
if (!PCVAL_IS_OBJECT(pcval))
ABORT_TRACE("PCE not object");
stack(-1, lir->insImmPtr(PCVAL_TO_OBJECT(pcval)));
return true;
}
bool TraceRecorder::record_JSOP_GETFUNNS()
{
return false;
}
bool TraceRecorder::record_JSOP_UNUSED186()
{
return false;
}
bool TraceRecorder::record_JSOP_DELDESC()
{
return false;
}
bool TraceRecorder::record_JSOP_UINT24()
{
jsdpun u;
u.d = (jsdouble)GET_UINT24(cx->fp->regs->pc);
stack(0, lir->insImmq(u.u64));
return true;
}
bool TraceRecorder::record_JSOP_INDEXBASE()
{
atoms += GET_INDEXBASE(cx->fp->regs->pc);
return true;
}
bool TraceRecorder::record_JSOP_RESETBASE()
{
atoms = cx->fp->script->atomMap.vector;
return true;
}
bool TraceRecorder::record_JSOP_RESETBASE0()
{
atoms = cx->fp->script->atomMap.vector;
return true;
}
bool TraceRecorder::record_JSOP_STARTXML()
{
return false;
}
bool TraceRecorder::record_JSOP_STARTXMLEXPR()
{
return false;
}
bool TraceRecorder::record_JSOP_CALLELEM()
{
return false;
}
bool TraceRecorder::record_JSOP_STOP()
{
2008-07-29 10:53:58 -07:00
// We know falling off the end of a function returns undefined, and we do
// not support script rval (eval, API users who want the result of the last
// expression-statement, debugger API calls).
rval_ins = lir->insImm(JSVAL_TO_BOOLEAN(JSVAL_VOID));
clearFrameSlotsFromCache();
return true;
}
bool TraceRecorder::record_JSOP_GETXPROP()
{
jsval& l = stackval(-1);
if (JSVAL_IS_PRIMITIVE(l))
ABORT_TRACE("primitive-this for GETXPROP?");
JSObject* obj = JSVAL_TO_OBJECT(l);
JS_ASSERT(obj == cx->fp->scopeChain);
LIns* obj_ins = get(&l);
/* Can't use get_prop here, because we don't want unboxing. */
uint32 slot;
if (!test_property_cache_direct_slot(obj, obj_ins, slot))
return false;
if (!lazilyImportGlobalSlot(slot))
ABORT_TRACE("lazy import of global slot failed");
stack(-1, get(&STOBJ_GET_SLOT(obj, slot)));
return true;
}
bool TraceRecorder::record_JSOP_CALLXMLNAME()
{
return false;
}
bool TraceRecorder::record_JSOP_TYPEOFEXPR()
{
return false;
}
bool TraceRecorder::record_JSOP_ENTERBLOCK()
{
return false;
}
bool TraceRecorder::record_JSOP_LEAVEBLOCK()
{
return false;
}
bool TraceRecorder::record_JSOP_GETLOCAL()
{
return false;
}
bool TraceRecorder::record_JSOP_SETLOCAL()
{
return false;
}
bool TraceRecorder::record_JSOP_INCLOCAL()
{
return false;
}
bool TraceRecorder::record_JSOP_DECLOCAL()
{
return false;
}
bool TraceRecorder::record_JSOP_LOCALINC()
{
return false;
}
bool TraceRecorder::record_JSOP_LOCALDEC()
{
return false;
}
bool TraceRecorder::record_JSOP_GENERATOR()
{
return false;
}
bool TraceRecorder::record_JSOP_YIELD()
{
return false;
}
bool TraceRecorder::record_JSOP_ARRAYPUSH()
{
return false;
}
bool TraceRecorder::record_JSOP_UNUSED213()
{
return false;
}
bool TraceRecorder::record_JSOP_ENUMCONSTELEM()
{
return false;
}
bool TraceRecorder::record_JSOP_LEAVEBLOCKEXPR()
{
return false;
}
bool TraceRecorder::record_JSOP_GETTHISPROP()
{
LIns* this_ins;
/* its safe to just use cx->fp->thisp here because getThis() returns false if thisp
is not available */
return getThis(this_ins) && getProp(cx->fp->thisp, this_ins);
}
bool TraceRecorder::record_JSOP_GETARGPROP()
{
return getProp(argval(GET_ARGNO(cx->fp->regs->pc)));
}
bool TraceRecorder::record_JSOP_GETVARPROP()
{
2008-07-22 21:20:29 -07:00
return getProp(varval(GET_SLOTNO(cx->fp->regs->pc)));
}
bool TraceRecorder::record_JSOP_GETLOCALPROP()
{
return false;
}
bool TraceRecorder::record_JSOP_INDEXBASE1()
{
atoms += 1 << 16;
return true;
}
bool TraceRecorder::record_JSOP_INDEXBASE2()
{
atoms += 2 << 16;
return true;
}
bool TraceRecorder::record_JSOP_INDEXBASE3()
{
atoms += 3 << 16;
return true;
}
bool TraceRecorder::record_JSOP_CALLGVAR()
{
return record_JSOP_GETGVAR();
}
bool TraceRecorder::record_JSOP_CALLVAR()
{
stack(1, lir->insImmPtr(0));
2008-07-15 20:37:57 -07:00
return record_JSOP_GETVAR();
}
bool TraceRecorder::record_JSOP_CALLARG()
{
stack(1, lir->insImmPtr(0));
2008-07-15 20:37:57 -07:00
return record_JSOP_GETARG();
}
bool TraceRecorder::record_JSOP_CALLLOCAL()
{
return false;
}
bool TraceRecorder::record_JSOP_INT8()
{
jsdpun u;
u.d = (jsdouble)GET_INT8(cx->fp->regs->pc);
stack(0, lir->insImmq(u.u64));
return true;
}
bool TraceRecorder::record_JSOP_INT32()
{
jsdpun u;
u.d = (jsdouble)GET_INT32(cx->fp->regs->pc);
stack(0, lir->insImmq(u.u64));
return true;
}
bool TraceRecorder::record_JSOP_LENGTH()
{
2008-07-16 23:53:14 -07:00
jsval& l = stackval(-1);
if (JSVAL_IS_PRIMITIVE(l)) {
if (!JSVAL_IS_STRING(l))
ABORT_TRACE("non-string primitives unsupported");
LIns* str_ins = get(&l);
LIns* len_ins = lir->insLoadi(str_ins, offsetof(JSString, length));
2008-07-29 10:53:58 -07:00
// We support only flat strings at present.
guard(true, addName(lir->ins_eq0(lir->ins2(LIR_and, len_ins,
INS_CONST(JSSTRFLAG_DEPENDENT))),
"guard(flat-string)"));
2008-07-29 16:01:00 -07:00
set(&l, lir->ins1(LIR_i2f,
lir->ins2(LIR_and, len_ins, INS_CONST(JSSTRING_LENGTH_MASK))));
return true;
}
JSObject* obj = JSVAL_TO_OBJECT(l);
if (!OBJ_IS_DENSE_ARRAY(cx, obj))
2008-07-16 23:53:14 -07:00
ABORT_TRACE("only dense arrays supported");
if (!guardDenseArray(obj, get(&l)))
2008-07-16 23:53:14 -07:00
ABORT_TRACE("OBJ_IS_DENSE_ARRAY but not?!?");
LIns* v_ins = lir->ins1(LIR_i2f, stobj_get_fslot(get(&l), JSSLOT_ARRAY_LENGTH));
2008-07-16 23:53:14 -07:00
set(&l, v_ins);
return true;
}
bool TraceRecorder::record_JSOP_NEWARRAY()
{
return false;
}
bool TraceRecorder::record_JSOP_HOLE()
{
stack(0, lir->insImm(JSVAL_TO_BOOLEAN(JSVAL_HOLE)));
2008-07-06 06:52:50 -07:00
return true;
}