2007-03-22 10:30:00 -07:00
|
|
|
/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
|
|
|
|
* vim: set sw=4 ts=8 et tw=78:
|
|
|
|
*
|
|
|
|
* ***** 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 Communicator client code, released
|
|
|
|
* March 31, 1998.
|
|
|
|
*
|
|
|
|
* The Initial Developer of the Original Code is
|
|
|
|
* Netscape Communications Corporation.
|
|
|
|
* Portions created by the Initial Developer are Copyright (C) 1998
|
|
|
|
* the Initial Developer. All Rights Reserved.
|
|
|
|
*
|
|
|
|
* Contributor(s):
|
|
|
|
*
|
|
|
|
* 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 ***** */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* JS bytecode descriptors, disassemblers, and decompilers.
|
|
|
|
*/
|
|
|
|
#include "jsstddef.h"
|
|
|
|
#ifdef HAVE_MEMORY_H
|
|
|
|
#include <memory.h>
|
|
|
|
#endif
|
|
|
|
#include <stdarg.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include "jstypes.h"
|
|
|
|
#include "jsarena.h" /* Added by JSIFY */
|
|
|
|
#include "jsutil.h" /* Added by JSIFY */
|
|
|
|
#include "jsdtoa.h"
|
|
|
|
#include "jsprf.h"
|
|
|
|
#include "jsapi.h"
|
|
|
|
#include "jsarray.h"
|
|
|
|
#include "jsatom.h"
|
|
|
|
#include "jscntxt.h"
|
|
|
|
#include "jsconfig.h"
|
|
|
|
#include "jsdbgapi.h"
|
|
|
|
#include "jsemit.h"
|
|
|
|
#include "jsfun.h"
|
|
|
|
#include "jslock.h"
|
|
|
|
#include "jsobj.h"
|
|
|
|
#include "jsopcode.h"
|
|
|
|
#include "jsregexp.h"
|
|
|
|
#include "jsscan.h"
|
|
|
|
#include "jsscope.h"
|
|
|
|
#include "jsscript.h"
|
|
|
|
#include "jsstr.h"
|
|
|
|
|
|
|
|
#if JS_HAS_DESTRUCTURING
|
|
|
|
# include "jsnum.h"
|
|
|
|
#endif
|
|
|
|
|
|
|
|
static const char js_incop_strs[][3] = {"++", "--"};
|
|
|
|
|
2007-05-06 03:50:07 -07:00
|
|
|
const JSCodeSpec js_CodeSpec[] = {
|
|
|
|
#define OPDEF(op,val,name,token,length,nuses,ndefs,prec,format) \
|
|
|
|
{length,nuses,ndefs,prec,format},
|
|
|
|
#include "jsopcode.tbl"
|
|
|
|
#undef OPDEF
|
|
|
|
};
|
2007-03-22 10:30:00 -07:00
|
|
|
|
2007-05-06 03:50:07 -07:00
|
|
|
uintN js_NumCodeSpecs = JS_ARRAY_LENGTH(js_CodeSpec);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Each element of the array is either a source literal associated with JS
|
|
|
|
* bytecode or null.
|
|
|
|
*/
|
|
|
|
static const char *CodeToken[] = {
|
2007-03-22 10:30:00 -07:00
|
|
|
#define OPDEF(op,val,name,token,length,nuses,ndefs,prec,format) \
|
2007-05-06 03:50:07 -07:00
|
|
|
token,
|
2007-03-22 10:30:00 -07:00
|
|
|
#include "jsopcode.tbl"
|
|
|
|
#undef OPDEF
|
|
|
|
};
|
|
|
|
|
2007-05-06 03:50:07 -07:00
|
|
|
#ifdef DEBUG
|
|
|
|
/*
|
|
|
|
* Array of JS bytecode names used by DEBUG-only js_Disassemble.
|
|
|
|
*/
|
|
|
|
static const char *CodeName[] = {
|
|
|
|
#define OPDEF(op,val,name,token,length,nuses,ndefs,prec,format) \
|
|
|
|
name,
|
|
|
|
#include "jsopcode.tbl"
|
|
|
|
#undef OPDEF
|
|
|
|
};
|
|
|
|
#endif
|
2007-03-22 10:30:00 -07:00
|
|
|
|
|
|
|
/************************************************************************/
|
|
|
|
|
|
|
|
static ptrdiff_t
|
|
|
|
GetJumpOffset(jsbytecode *pc, jsbytecode *pc2)
|
|
|
|
{
|
|
|
|
uint32 type;
|
|
|
|
|
|
|
|
type = (js_CodeSpec[*pc].format & JOF_TYPEMASK);
|
|
|
|
if (JOF_TYPE_IS_EXTENDED_JUMP(type))
|
|
|
|
return GET_JUMPX_OFFSET(pc2);
|
|
|
|
return GET_JUMP_OFFSET(pc2);
|
|
|
|
}
|
|
|
|
|
|
|
|
JSAtom *
|
|
|
|
js_GetAtomFromBytecode(JSScript *script, jsbytecode *pc, ptrdiff_t pcoff)
|
|
|
|
{
|
|
|
|
JSOp op;
|
|
|
|
uintN span, atomBase;
|
|
|
|
|
|
|
|
op = (JSOp)*pc;
|
|
|
|
JS_ASSERT(js_CodeSpec[op].length >= 1 + pcoff + ATOM_INDEX_LEN);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We need to detect atom base prefix. It presents when resetbase
|
|
|
|
* follows the bytecode.
|
|
|
|
*/
|
|
|
|
span = js_CodeSpec[op].length;
|
|
|
|
atomBase = 0;
|
|
|
|
if (pc - script->code + span < script->length) {
|
|
|
|
if (pc[span] == JSOP_RESETBASE) {
|
|
|
|
atomBase = GET_ATOMBASE(pc - JSOP_ATOMBASE_LENGTH);
|
|
|
|
} else if (pc[span] == JSOP_RESETBASE0) {
|
|
|
|
JS_ASSERT(JSOP_ATOMBASE1 <= pc[-1] || pc[-1] <= JSOP_ATOMBASE3);
|
|
|
|
atomBase = (pc[-1] - JSOP_ATOMBASE1 + 1) << 16;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
JS_ASSERT(atomBase < script->atomMap.length);
|
|
|
|
return GET_ATOM(script, script->atomMap.vector + atomBase, pc + pcoff);
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef DEBUG
|
|
|
|
|
|
|
|
JS_FRIEND_API(JSBool)
|
|
|
|
js_Disassemble(JSContext *cx, JSScript *script, JSBool lines, FILE *fp)
|
|
|
|
{
|
|
|
|
jsbytecode *pc, *end;
|
|
|
|
uintN len;
|
|
|
|
|
|
|
|
pc = script->code;
|
|
|
|
end = pc + script->length;
|
|
|
|
while (pc < end) {
|
|
|
|
if (pc == script->main)
|
|
|
|
fputs("main:\n", fp);
|
|
|
|
len = js_Disassemble1(cx, script, pc,
|
|
|
|
PTRDIFF(pc, script->code, jsbytecode),
|
|
|
|
lines, fp);
|
|
|
|
if (!len)
|
|
|
|
return JS_FALSE;
|
|
|
|
pc += len;
|
|
|
|
}
|
|
|
|
return JS_TRUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
const char *
|
|
|
|
ToDisassemblySource(JSContext *cx, jsval v)
|
|
|
|
{
|
|
|
|
JSObject *obj;
|
|
|
|
JSScopeProperty *sprop;
|
|
|
|
char *source;
|
|
|
|
const char *bytes;
|
|
|
|
JSString *str;
|
|
|
|
|
|
|
|
if (!JSVAL_IS_PRIMITIVE(v)) {
|
|
|
|
obj = JSVAL_TO_OBJECT(v);
|
|
|
|
if (OBJ_GET_CLASS(cx, obj) == &js_BlockClass) {
|
|
|
|
source = JS_sprintf_append(NULL, "depth %d {",
|
|
|
|
OBJ_BLOCK_DEPTH(cx, obj));
|
|
|
|
for (sprop = OBJ_SCOPE(obj)->lastProp; sprop;
|
|
|
|
sprop = sprop->parent) {
|
|
|
|
bytes = js_AtomToPrintableString(cx, JSID_TO_ATOM(sprop->id));
|
|
|
|
if (!bytes)
|
|
|
|
return NULL;
|
|
|
|
source = JS_sprintf_append(source, "%s: %d%s",
|
|
|
|
bytes, sprop->shortid,
|
|
|
|
sprop->parent ? ", " : "");
|
|
|
|
}
|
|
|
|
source = JS_sprintf_append(source, "}");
|
|
|
|
if (!source)
|
|
|
|
return NULL;
|
|
|
|
str = JS_NewString(cx, source, strlen(source));
|
|
|
|
if (!str)
|
|
|
|
return NULL;
|
|
|
|
return js_GetStringBytes(cx, str);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return js_ValueToPrintableSource(cx, v);
|
|
|
|
}
|
|
|
|
|
|
|
|
JS_FRIEND_API(uintN)
|
|
|
|
js_Disassemble1(JSContext *cx, JSScript *script, jsbytecode *pc,
|
|
|
|
uintN loc, JSBool lines, FILE *fp)
|
|
|
|
{
|
|
|
|
JSOp op;
|
|
|
|
const JSCodeSpec *cs;
|
|
|
|
ptrdiff_t len, off, jmplen;
|
|
|
|
uint32 type;
|
|
|
|
JSAtom *atom;
|
|
|
|
const char *bytes;
|
|
|
|
|
|
|
|
op = (JSOp)*pc;
|
|
|
|
if (op >= JSOP_LIMIT) {
|
|
|
|
char numBuf1[12], numBuf2[12];
|
|
|
|
JS_snprintf(numBuf1, sizeof numBuf1, "%d", op);
|
|
|
|
JS_snprintf(numBuf2, sizeof numBuf2, "%d", JSOP_LIMIT);
|
|
|
|
JS_ReportErrorNumber(cx, js_GetErrorMessage, NULL,
|
|
|
|
JSMSG_BYTECODE_TOO_BIG, numBuf1, numBuf2);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
cs = &js_CodeSpec[op];
|
|
|
|
len = (ptrdiff_t) cs->length;
|
|
|
|
fprintf(fp, "%05u:", loc);
|
|
|
|
if (lines)
|
|
|
|
fprintf(fp, "%4u", JS_PCToLineNumber(cx, script, pc));
|
2007-05-06 03:50:07 -07:00
|
|
|
fprintf(fp, " %s", CodeName[op]);
|
2007-03-22 10:30:00 -07:00
|
|
|
type = cs->format & JOF_TYPEMASK;
|
|
|
|
switch (type) {
|
|
|
|
case JOF_BYTE:
|
|
|
|
if (op == JSOP_TRAP) {
|
|
|
|
op = JS_GetTrapOpcode(cx, script, pc);
|
|
|
|
if (op == JSOP_LIMIT)
|
|
|
|
return 0;
|
|
|
|
len = (ptrdiff_t) js_CodeSpec[op].length;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JOF_JUMP:
|
|
|
|
case JOF_JUMPX:
|
|
|
|
off = GetJumpOffset(pc, pc);
|
|
|
|
fprintf(fp, " %u (%d)", loc + off, off);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JOF_CONST:
|
|
|
|
atom = js_GetAtomFromBytecode(script, pc, 0);
|
|
|
|
bytes = ToDisassemblySource(cx, ATOM_KEY(atom));
|
|
|
|
if (!bytes)
|
|
|
|
return 0;
|
|
|
|
fprintf(fp, " %s", bytes);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JOF_UINT16:
|
|
|
|
case JOF_LOCAL:
|
|
|
|
fprintf(fp, " %u", GET_UINT16(pc));
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JOF_2BYTE:
|
|
|
|
fprintf(fp, " %u", (uintN)pc[1]);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JOF_TABLESWITCH:
|
|
|
|
case JOF_TABLESWITCHX:
|
|
|
|
{
|
|
|
|
jsbytecode *pc2;
|
|
|
|
jsint i, low, high;
|
|
|
|
|
|
|
|
jmplen = (type == JOF_TABLESWITCH) ? JUMP_OFFSET_LEN
|
|
|
|
: JUMPX_OFFSET_LEN;
|
|
|
|
pc2 = pc;
|
|
|
|
off = GetJumpOffset(pc, pc2);
|
|
|
|
pc2 += jmplen;
|
|
|
|
low = GET_JUMP_OFFSET(pc2);
|
|
|
|
pc2 += JUMP_OFFSET_LEN;
|
|
|
|
high = GET_JUMP_OFFSET(pc2);
|
|
|
|
pc2 += JUMP_OFFSET_LEN;
|
|
|
|
fprintf(fp, " defaultOffset %d low %d high %d", off, low, high);
|
|
|
|
for (i = low; i <= high; i++) {
|
|
|
|
off = GetJumpOffset(pc, pc2);
|
|
|
|
fprintf(fp, "\n\t%d: %d", i, off);
|
|
|
|
pc2 += jmplen;
|
|
|
|
}
|
|
|
|
len = 1 + pc2 - pc;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case JOF_LOOKUPSWITCH:
|
|
|
|
case JOF_LOOKUPSWITCHX:
|
|
|
|
{
|
|
|
|
jsbytecode *pc2;
|
|
|
|
jsatomid npairs;
|
|
|
|
|
|
|
|
jmplen = (type == JOF_LOOKUPSWITCH) ? JUMP_OFFSET_LEN
|
|
|
|
: JUMPX_OFFSET_LEN;
|
|
|
|
pc2 = pc;
|
|
|
|
off = GetJumpOffset(pc, pc2);
|
|
|
|
pc2 += jmplen;
|
|
|
|
npairs = GET_UINT16(pc2);
|
|
|
|
pc2 += UINT16_LEN;
|
|
|
|
fprintf(fp, " offset %d npairs %u", off, (uintN) npairs);
|
|
|
|
while (npairs) {
|
|
|
|
atom = GET_ATOM(script, script->atomMap.vector, pc2);
|
|
|
|
pc2 += ATOM_INDEX_LEN;
|
|
|
|
off = GetJumpOffset(pc, pc2);
|
|
|
|
pc2 += jmplen;
|
|
|
|
|
|
|
|
bytes = ToDisassemblySource(cx, ATOM_KEY(atom));
|
|
|
|
if (!bytes)
|
|
|
|
return 0;
|
|
|
|
fprintf(fp, "\n\t%s: %d", bytes, off);
|
|
|
|
npairs--;
|
|
|
|
}
|
|
|
|
len = 1 + pc2 - pc;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case JOF_QARG:
|
|
|
|
fprintf(fp, " %u", GET_ARGNO(pc));
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JOF_QVAR:
|
|
|
|
fprintf(fp, " %u", GET_VARNO(pc));
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JOF_INDEXCONST:
|
|
|
|
fprintf(fp, " %u", GET_VARNO(pc));
|
|
|
|
atom = js_GetAtomFromBytecode(script, pc, VARNO_LEN);
|
|
|
|
bytes = ToDisassemblySource(cx, ATOM_KEY(atom));
|
|
|
|
if (!bytes)
|
|
|
|
return 0;
|
|
|
|
fprintf(fp, " %s", bytes);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JOF_UINT24:
|
|
|
|
JS_ASSERT(op == JSOP_UINT24);
|
|
|
|
fprintf(fp, " %u", GET_UINT24(pc));
|
|
|
|
break;
|
|
|
|
|
|
|
|
default: {
|
|
|
|
char numBuf[12];
|
|
|
|
JS_snprintf(numBuf, sizeof numBuf, "%lx", (unsigned long) cs->format);
|
|
|
|
JS_ReportErrorNumber(cx, js_GetErrorMessage, NULL,
|
|
|
|
JSMSG_UNKNOWN_FORMAT, numBuf);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
fputs("\n", fp);
|
|
|
|
return len;
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif /* DEBUG */
|
|
|
|
|
|
|
|
/************************************************************************/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Sprintf, but with unlimited and automatically allocated buffering.
|
|
|
|
*/
|
|
|
|
typedef struct Sprinter {
|
|
|
|
JSContext *context; /* context executing the decompiler */
|
|
|
|
JSArenaPool *pool; /* string allocation pool */
|
|
|
|
char *base; /* base address of buffer in pool */
|
|
|
|
size_t size; /* size of buffer allocated at base */
|
|
|
|
ptrdiff_t offset; /* offset of next free char in buffer */
|
|
|
|
} Sprinter;
|
|
|
|
|
|
|
|
#define INIT_SPRINTER(cx, sp, ap, off) \
|
|
|
|
((sp)->context = cx, (sp)->pool = ap, (sp)->base = NULL, (sp)->size = 0, \
|
|
|
|
(sp)->offset = off)
|
|
|
|
|
|
|
|
#define OFF2STR(sp,off) ((sp)->base + (off))
|
|
|
|
#define STR2OFF(sp,str) ((str) - (sp)->base)
|
|
|
|
#define RETRACT(sp,str) ((sp)->offset = STR2OFF(sp, str))
|
|
|
|
|
|
|
|
static JSBool
|
|
|
|
SprintAlloc(Sprinter *sp, size_t nb)
|
|
|
|
{
|
|
|
|
if (!sp->base) {
|
|
|
|
JS_ARENA_ALLOCATE_CAST(sp->base, char *, sp->pool, nb);
|
|
|
|
} else {
|
|
|
|
JS_ARENA_GROW_CAST(sp->base, char *, sp->pool, sp->size, nb);
|
|
|
|
}
|
|
|
|
if (!sp->base) {
|
|
|
|
JS_ReportOutOfMemory(sp->context);
|
|
|
|
return JS_FALSE;
|
|
|
|
}
|
|
|
|
sp->size += nb;
|
|
|
|
return JS_TRUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static ptrdiff_t
|
|
|
|
SprintPut(Sprinter *sp, const char *s, size_t len)
|
|
|
|
{
|
|
|
|
ptrdiff_t nb, offset;
|
|
|
|
char *bp;
|
|
|
|
|
|
|
|
/* Allocate space for s, including the '\0' at the end. */
|
|
|
|
nb = (sp->offset + len + 1) - sp->size;
|
|
|
|
if (nb > 0 && !SprintAlloc(sp, nb))
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
/* Advance offset and copy s into sp's buffer. */
|
|
|
|
offset = sp->offset;
|
|
|
|
sp->offset += len;
|
|
|
|
bp = sp->base + offset;
|
|
|
|
memmove(bp, s, len);
|
|
|
|
bp[len] = 0;
|
|
|
|
return offset;
|
|
|
|
}
|
|
|
|
|
|
|
|
static ptrdiff_t
|
|
|
|
SprintCString(Sprinter *sp, const char *s)
|
|
|
|
{
|
|
|
|
return SprintPut(sp, s, strlen(s));
|
|
|
|
}
|
|
|
|
|
|
|
|
static ptrdiff_t
|
|
|
|
SprintString(Sprinter *sp, JSString *str)
|
|
|
|
{
|
|
|
|
jschar *chars;
|
|
|
|
size_t length, size;
|
|
|
|
ptrdiff_t offset;
|
|
|
|
|
|
|
|
chars = JSSTRING_CHARS(str);
|
|
|
|
length = JSSTRING_LENGTH(str);
|
|
|
|
if (length == 0)
|
|
|
|
return sp->offset;
|
|
|
|
|
|
|
|
size = js_GetDeflatedStringLength(sp->context, chars, length);
|
|
|
|
if (size == (size_t)-1 || !SprintAlloc(sp, size + 1))
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
offset = sp->offset;
|
|
|
|
sp->offset += size;
|
|
|
|
js_DeflateStringToBuffer(sp->context, chars, length, sp->base + offset,
|
|
|
|
&size);
|
|
|
|
sp->base[sp->offset] = 0;
|
|
|
|
return offset;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static ptrdiff_t
|
|
|
|
Sprint(Sprinter *sp, const char *format, ...)
|
|
|
|
{
|
|
|
|
va_list ap;
|
|
|
|
char *bp;
|
|
|
|
ptrdiff_t offset;
|
|
|
|
|
|
|
|
va_start(ap, format);
|
|
|
|
bp = JS_vsmprintf(format, ap); /* XXX vsaprintf */
|
|
|
|
va_end(ap);
|
|
|
|
if (!bp) {
|
|
|
|
JS_ReportOutOfMemory(sp->context);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
offset = SprintCString(sp, bp);
|
|
|
|
free(bp);
|
|
|
|
return offset;
|
|
|
|
}
|
|
|
|
|
|
|
|
const char js_EscapeMap[] = {
|
|
|
|
'\b', 'b',
|
|
|
|
'\f', 'f',
|
|
|
|
'\n', 'n',
|
|
|
|
'\r', 'r',
|
|
|
|
'\t', 't',
|
|
|
|
'\v', 'v',
|
|
|
|
'"', '"',
|
|
|
|
'\'', '\'',
|
|
|
|
'\\', '\\',
|
|
|
|
0
|
|
|
|
};
|
|
|
|
|
|
|
|
#define DONT_ESCAPE 0x10000
|
|
|
|
|
|
|
|
static char *
|
|
|
|
QuoteString(Sprinter *sp, JSString *str, uint32 quote)
|
|
|
|
{
|
|
|
|
JSBool dontEscape, ok;
|
|
|
|
jschar qc, c;
|
|
|
|
ptrdiff_t off, len, nb;
|
|
|
|
const jschar *s, *t, *z;
|
|
|
|
const char *e;
|
|
|
|
char *bp;
|
|
|
|
|
|
|
|
/* Sample off first for later return value pointer computation. */
|
|
|
|
dontEscape = (quote & DONT_ESCAPE) != 0;
|
|
|
|
qc = (jschar) quote;
|
|
|
|
off = sp->offset;
|
|
|
|
if (qc && Sprint(sp, "%c", (char)qc) < 0)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
/* Loop control variables: z points at end of string sentinel. */
|
|
|
|
s = JSSTRING_CHARS(str);
|
|
|
|
z = s + JSSTRING_LENGTH(str);
|
|
|
|
for (t = s; t < z; s = ++t) {
|
|
|
|
/* Move t forward from s past un-quote-worthy characters. */
|
|
|
|
c = *t;
|
|
|
|
while (JS_ISPRINT(c) && c != qc && c != '\\' && !(c >> 8)) {
|
|
|
|
c = *++t;
|
|
|
|
if (t == z)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
len = PTRDIFF(t, s, jschar);
|
|
|
|
|
|
|
|
/* Allocate space for s, including the '\0' at the end. */
|
|
|
|
nb = (sp->offset + len + 1) - sp->size;
|
|
|
|
if (nb > 0 && !SprintAlloc(sp, nb))
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
/* Advance sp->offset and copy s into sp's buffer. */
|
|
|
|
bp = sp->base + sp->offset;
|
|
|
|
sp->offset += len;
|
|
|
|
while (--len >= 0)
|
|
|
|
*bp++ = (char) *s++;
|
|
|
|
*bp = '\0';
|
|
|
|
|
|
|
|
if (t == z)
|
|
|
|
break;
|
|
|
|
|
|
|
|
/* Use js_EscapeMap, \u, or \x only if necessary. */
|
|
|
|
if (!(c >> 8) && (e = strchr(js_EscapeMap, (int)c)) != NULL) {
|
|
|
|
ok = dontEscape
|
|
|
|
? Sprint(sp, "%c", (char)c) >= 0
|
|
|
|
: Sprint(sp, "\\%c", e[1]) >= 0;
|
|
|
|
} else {
|
|
|
|
#ifdef JS_C_STRINGS_ARE_UTF8
|
|
|
|
/* If this is a surrogate pair, make sure to print the pair. */
|
|
|
|
if (c >= 0xD800 && c <= 0xDBFF) {
|
|
|
|
jschar buffer[3];
|
|
|
|
buffer[0] = c;
|
|
|
|
buffer[1] = *++t;
|
|
|
|
buffer[2] = 0;
|
|
|
|
if (t == z) {
|
|
|
|
char numbuf[10];
|
|
|
|
JS_snprintf(numbuf, sizeof numbuf, "0x%x", c);
|
2007-03-26 14:13:57 -07:00
|
|
|
JS_ReportErrorFlagsAndNumber(sp->context, JSREPORT_ERROR,
|
2007-03-22 10:30:00 -07:00
|
|
|
js_GetErrorMessage, NULL,
|
|
|
|
JSMSG_BAD_SURROGATE_CHAR,
|
|
|
|
numbuf);
|
|
|
|
ok = JS_FALSE;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
ok = Sprint(sp, "%hs", buffer) >= 0;
|
|
|
|
} else {
|
|
|
|
/* Print as UTF-8 string. */
|
|
|
|
ok = Sprint(sp, "%hc", c) >= 0;
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
/* Use \uXXXX or \xXX if the string can't be displayed as UTF-8. */
|
|
|
|
ok = Sprint(sp, (c >> 8) ? "\\u%04X" : "\\x%02X", c) >= 0;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
if (!ok)
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Sprint the closing quote and return the quoted string. */
|
|
|
|
if (qc && Sprint(sp, "%c", (char)qc) < 0)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If we haven't Sprint'd anything yet, Sprint an empty string so that
|
|
|
|
* the OFF2STR below gives a valid result.
|
|
|
|
*/
|
|
|
|
if (off == sp->offset && Sprint(sp, "") < 0)
|
|
|
|
return NULL;
|
|
|
|
return OFF2STR(sp, off);
|
|
|
|
}
|
|
|
|
|
|
|
|
JSString *
|
|
|
|
js_QuoteString(JSContext *cx, JSString *str, jschar quote)
|
|
|
|
{
|
|
|
|
void *mark;
|
|
|
|
Sprinter sprinter;
|
|
|
|
char *bytes;
|
|
|
|
JSString *escstr;
|
|
|
|
|
|
|
|
mark = JS_ARENA_MARK(&cx->tempPool);
|
|
|
|
INIT_SPRINTER(cx, &sprinter, &cx->tempPool, 0);
|
|
|
|
bytes = QuoteString(&sprinter, str, quote);
|
|
|
|
escstr = bytes ? JS_NewStringCopyZ(cx, bytes) : NULL;
|
|
|
|
JS_ARENA_RELEASE(&cx->tempPool, mark);
|
|
|
|
return escstr;
|
|
|
|
}
|
|
|
|
|
|
|
|
/************************************************************************/
|
|
|
|
|
|
|
|
#if JS_HAS_BLOCK_SCOPE
|
|
|
|
typedef enum JSBraceState {
|
|
|
|
ALWAYS_BRACE,
|
|
|
|
MAYBE_BRACE,
|
|
|
|
DONT_BRACE
|
|
|
|
} JSBraceState;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
struct JSPrinter {
|
|
|
|
Sprinter sprinter; /* base class state */
|
|
|
|
JSArenaPool pool; /* string allocation pool */
|
|
|
|
uintN indent; /* indentation in spaces */
|
|
|
|
JSPackedBool pretty; /* pretty-print: indent, use newlines */
|
|
|
|
JSPackedBool grouped; /* in parenthesized expression context */
|
|
|
|
JSScript *script; /* script being printed */
|
|
|
|
jsbytecode *dvgfence; /* js_DecompileValueGenerator fencepost */
|
|
|
|
JSScope *scope; /* script function scope */
|
|
|
|
#if JS_HAS_BLOCK_SCOPE
|
|
|
|
JSBraceState braceState; /* remove braces around let declaration */
|
|
|
|
ptrdiff_t spaceOffset; /* -1 or offset of space before maybe-{ */
|
|
|
|
#endif
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Hack another flag, a la JS_DONT_PRETTY_PRINT, into uintN indent parameters
|
|
|
|
* to functions such as js_DecompileFunction and js_NewPrinter. This time, as
|
|
|
|
* opposed to JS_DONT_PRETTY_PRINT back in the dark ages, we can assume that a
|
|
|
|
* uintN is at least 32 bits.
|
|
|
|
*/
|
|
|
|
#define JS_IN_GROUP_CONTEXT 0x10000
|
|
|
|
|
|
|
|
JSPrinter *
|
2007-04-10 06:29:10 -07:00
|
|
|
JS_NEW_PRINTER(JSContext *cx, const char *name, uintN indent, JSBool pretty)
|
2007-03-22 10:30:00 -07:00
|
|
|
{
|
|
|
|
JSPrinter *jp;
|
|
|
|
|
|
|
|
jp = (JSPrinter *) JS_malloc(cx, sizeof(JSPrinter));
|
|
|
|
if (!jp)
|
|
|
|
return NULL;
|
|
|
|
INIT_SPRINTER(cx, &jp->sprinter, &jp->pool, 0);
|
2007-04-10 06:29:10 -07:00
|
|
|
JS_INIT_ARENA_POOL(&jp->pool, name, 256, 1);
|
2007-03-22 10:30:00 -07:00
|
|
|
jp->indent = indent & ~JS_IN_GROUP_CONTEXT;
|
|
|
|
jp->pretty = pretty;
|
|
|
|
jp->grouped = (indent & JS_IN_GROUP_CONTEXT) != 0;
|
|
|
|
jp->script = NULL;
|
|
|
|
jp->dvgfence = NULL;
|
|
|
|
jp->scope = NULL;
|
|
|
|
#if JS_HAS_BLOCK_SCOPE
|
|
|
|
jp->braceState = ALWAYS_BRACE;
|
|
|
|
jp->spaceOffset = -1;
|
|
|
|
#endif
|
|
|
|
return jp;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
js_DestroyPrinter(JSPrinter *jp)
|
|
|
|
{
|
|
|
|
JS_FinishArenaPool(&jp->pool);
|
|
|
|
JS_free(jp->sprinter.context, jp);
|
|
|
|
}
|
|
|
|
|
|
|
|
JSString *
|
|
|
|
js_GetPrinterOutput(JSPrinter *jp)
|
|
|
|
{
|
|
|
|
JSContext *cx;
|
|
|
|
JSString *str;
|
|
|
|
|
|
|
|
cx = jp->sprinter.context;
|
|
|
|
if (!jp->sprinter.base)
|
|
|
|
return cx->runtime->emptyString;
|
|
|
|
str = JS_NewStringCopyZ(cx, jp->sprinter.base);
|
|
|
|
if (!str)
|
|
|
|
return NULL;
|
|
|
|
JS_FreeArenaPool(&jp->pool);
|
|
|
|
INIT_SPRINTER(cx, &jp->sprinter, &jp->pool, 0);
|
|
|
|
return str;
|
|
|
|
}
|
|
|
|
|
|
|
|
#if !JS_HAS_BLOCK_SCOPE
|
|
|
|
# define SET_MAYBE_BRACE(jp) jp
|
|
|
|
# define CLEAR_MAYBE_BRACE(jp) jp
|
|
|
|
#else
|
|
|
|
# define SET_MAYBE_BRACE(jp) ((jp)->braceState = MAYBE_BRACE, (jp))
|
|
|
|
# define CLEAR_MAYBE_BRACE(jp) ((jp)->braceState = ALWAYS_BRACE, (jp))
|
|
|
|
|
|
|
|
static void
|
|
|
|
SetDontBrace(JSPrinter *jp)
|
|
|
|
{
|
|
|
|
ptrdiff_t offset;
|
|
|
|
const char *bp;
|
|
|
|
|
|
|
|
/* When not pretty-printing, newline after brace is chopped. */
|
|
|
|
JS_ASSERT(jp->spaceOffset < 0);
|
|
|
|
offset = jp->sprinter.offset - (jp->pretty ? 3 : 2);
|
|
|
|
|
|
|
|
/* The shortest case is "if (x) {". */
|
|
|
|
JS_ASSERT(offset >= 6);
|
|
|
|
bp = jp->sprinter.base;
|
|
|
|
if (bp[offset+0] == ' ' && bp[offset+1] == '{') {
|
|
|
|
JS_ASSERT(!jp->pretty || bp[offset+2] == '\n');
|
|
|
|
jp->spaceOffset = offset;
|
|
|
|
jp->braceState = DONT_BRACE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
int
|
|
|
|
js_printf(JSPrinter *jp, const char *format, ...)
|
|
|
|
{
|
|
|
|
va_list ap;
|
|
|
|
char *bp, *fp;
|
|
|
|
int cc;
|
|
|
|
|
|
|
|
if (*format == '\0')
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
va_start(ap, format);
|
|
|
|
|
|
|
|
/* If pretty-printing, expand magic tab into a run of jp->indent spaces. */
|
|
|
|
if (*format == '\t') {
|
|
|
|
format++;
|
|
|
|
|
|
|
|
#if JS_HAS_BLOCK_SCOPE
|
|
|
|
if (*format == '}' && jp->braceState != ALWAYS_BRACE) {
|
|
|
|
JSBraceState braceState;
|
|
|
|
|
|
|
|
braceState = jp->braceState;
|
|
|
|
jp->braceState = ALWAYS_BRACE;
|
|
|
|
if (braceState == DONT_BRACE) {
|
|
|
|
ptrdiff_t offset, delta, from;
|
|
|
|
|
|
|
|
JS_ASSERT(format[1] == '\n' || format[1] == ' ');
|
|
|
|
offset = jp->spaceOffset;
|
|
|
|
JS_ASSERT(offset >= 6);
|
|
|
|
|
|
|
|
/* Replace " {\n" at the end of jp->sprinter with "\n". */
|
|
|
|
bp = jp->sprinter.base;
|
|
|
|
if (bp[offset+0] == ' ' && bp[offset+1] == '{') {
|
|
|
|
delta = 2;
|
|
|
|
if (jp->pretty) {
|
|
|
|
/* If pretty, we don't have to worry about 'else'. */
|
|
|
|
JS_ASSERT(bp[offset+2] == '\n');
|
|
|
|
} else if (bp[offset-1] != ')') {
|
|
|
|
/* Must keep ' ' to avoid 'dolet' or 'elselet'. */
|
|
|
|
++offset;
|
|
|
|
delta = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
from = offset + delta;
|
|
|
|
memmove(bp + offset, bp + from, jp->sprinter.offset - from);
|
|
|
|
jp->sprinter.offset -= delta;
|
|
|
|
jp->spaceOffset = -1;
|
|
|
|
|
|
|
|
format += 2;
|
|
|
|
if (*format == '\0')
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
if (jp->pretty && Sprint(&jp->sprinter, "%*s", jp->indent, "") < 0)
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Suppress newlines (must be once per format, at the end) if not pretty. */
|
|
|
|
fp = NULL;
|
|
|
|
if (!jp->pretty && format[cc = strlen(format) - 1] == '\n') {
|
|
|
|
fp = JS_strdup(jp->sprinter.context, format);
|
|
|
|
if (!fp)
|
|
|
|
return -1;
|
|
|
|
fp[cc] = '\0';
|
|
|
|
format = fp;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Allocate temp space, convert format, and put. */
|
|
|
|
bp = JS_vsmprintf(format, ap); /* XXX vsaprintf */
|
|
|
|
if (fp) {
|
|
|
|
JS_free(jp->sprinter.context, fp);
|
|
|
|
format = NULL;
|
|
|
|
}
|
|
|
|
if (!bp) {
|
|
|
|
JS_ReportOutOfMemory(jp->sprinter.context);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
cc = strlen(bp);
|
|
|
|
if (SprintPut(&jp->sprinter, bp, (size_t)cc) < 0)
|
|
|
|
cc = -1;
|
|
|
|
free(bp);
|
|
|
|
|
|
|
|
va_end(ap);
|
|
|
|
return cc;
|
|
|
|
}
|
|
|
|
|
|
|
|
JSBool
|
|
|
|
js_puts(JSPrinter *jp, const char *s)
|
|
|
|
{
|
|
|
|
return SprintCString(&jp->sprinter, s) >= 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/************************************************************************/
|
|
|
|
|
|
|
|
typedef struct SprintStack {
|
|
|
|
Sprinter sprinter; /* sprinter for postfix to infix buffering */
|
|
|
|
ptrdiff_t *offsets; /* stack of postfix string offsets */
|
|
|
|
jsbytecode *opcodes; /* parallel stack of JS opcodes */
|
|
|
|
uintN top; /* top of stack index */
|
|
|
|
uintN inArrayInit; /* array initialiser/comprehension level */
|
2007-05-17 18:41:17 -07:00
|
|
|
JSBool inGenExp; /* in generator expression */
|
2007-03-22 10:30:00 -07:00
|
|
|
JSPrinter *printer; /* permanent output goes here */
|
|
|
|
} SprintStack;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Get a stacked offset from ss->sprinter.base, or if the stacked value |off|
|
|
|
|
* is negative, lazily fetch the generating pc at |spindex = 1 + off| and try
|
|
|
|
* to decompile the code that generated the missing value. This is used when
|
|
|
|
* reporting errors, where the model stack will lack |pcdepth| non-negative
|
|
|
|
* offsets (see js_DecompileValueGenerator and js_DecompileCode).
|
|
|
|
*
|
|
|
|
* If the stacked offset is -1, return 0 to index the NUL padding at the start
|
|
|
|
* of ss->sprinter.base. If this happens, it means there is a decompiler bug
|
|
|
|
* to fix, but it won't violate memory safety.
|
|
|
|
*/
|
|
|
|
static ptrdiff_t
|
|
|
|
GetOff(SprintStack *ss, uintN i)
|
|
|
|
{
|
|
|
|
ptrdiff_t off;
|
|
|
|
char *bytes;
|
|
|
|
|
|
|
|
off = ss->offsets[i];
|
|
|
|
if (off < 0) {
|
|
|
|
#if defined DEBUG_brendan || defined DEBUG_mrbkap || defined DEBUG_crowder
|
|
|
|
JS_ASSERT(off < -1);
|
|
|
|
#endif
|
|
|
|
if (++off == 0) {
|
|
|
|
if (!ss->sprinter.base && SprintPut(&ss->sprinter, "", 0) >= 0)
|
|
|
|
memset(ss->sprinter.base, 0, ss->sprinter.offset);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
bytes = js_DecompileValueGenerator(ss->sprinter.context, off,
|
|
|
|
JSVAL_NULL, NULL);
|
|
|
|
if (!bytes)
|
|
|
|
return 0;
|
|
|
|
off = SprintCString(&ss->sprinter, bytes);
|
|
|
|
if (off < 0)
|
|
|
|
off = 0;
|
|
|
|
ss->offsets[i] = off;
|
|
|
|
JS_free(ss->sprinter.context, bytes);
|
|
|
|
}
|
|
|
|
return off;
|
|
|
|
}
|
|
|
|
|
|
|
|
static const char *
|
|
|
|
GetStr(SprintStack *ss, uintN i)
|
|
|
|
{
|
|
|
|
ptrdiff_t off;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Must call GetOff before using ss->sprinter.base, since it may be null
|
|
|
|
* until bootstrapped by GetOff.
|
|
|
|
*/
|
|
|
|
off = GetOff(ss, i);
|
|
|
|
return OFF2STR(&ss->sprinter, off);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Gap between stacked strings to allow for insertion of parens and commas. */
|
|
|
|
#define PAREN_SLOP (2 + 1)
|
|
|
|
|
|
|
|
/*
|
|
|
|
* These pseudo-ops help js_DecompileValueGenerator decompile JSOP_SETNAME,
|
|
|
|
* JSOP_SETPROP, and JSOP_SETELEM, respectively. They are never stored in
|
|
|
|
* bytecode, so they don't preempt valid opcodes.
|
|
|
|
*/
|
|
|
|
#define JSOP_GETPROP2 256
|
|
|
|
#define JSOP_GETELEM2 257
|
|
|
|
|
2007-05-17 18:41:17 -07:00
|
|
|
static void
|
|
|
|
AddParenSlop(SprintStack *ss)
|
|
|
|
{
|
|
|
|
memset(OFF2STR(&ss->sprinter, ss->sprinter.offset), 0, PAREN_SLOP);
|
|
|
|
ss->sprinter.offset += PAREN_SLOP;
|
|
|
|
}
|
|
|
|
|
2007-03-22 10:30:00 -07:00
|
|
|
static JSBool
|
|
|
|
PushOff(SprintStack *ss, ptrdiff_t off, JSOp op)
|
|
|
|
{
|
|
|
|
uintN top;
|
|
|
|
|
|
|
|
if (!SprintAlloc(&ss->sprinter, PAREN_SLOP))
|
|
|
|
return JS_FALSE;
|
|
|
|
|
|
|
|
/* ss->top points to the next free slot; be paranoid about overflow. */
|
|
|
|
top = ss->top;
|
|
|
|
JS_ASSERT(top < ss->printer->script->depth);
|
|
|
|
if (top >= ss->printer->script->depth) {
|
|
|
|
JS_ReportOutOfMemory(ss->sprinter.context);
|
|
|
|
return JS_FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* The opcodes stack must contain real bytecodes that index js_CodeSpec. */
|
|
|
|
ss->offsets[top] = off;
|
|
|
|
ss->opcodes[top] = (op == JSOP_GETPROP2) ? JSOP_GETPROP
|
|
|
|
: (op == JSOP_GETELEM2) ? JSOP_GETELEM
|
|
|
|
: (jsbytecode) op;
|
|
|
|
ss->top = ++top;
|
2007-05-17 18:41:17 -07:00
|
|
|
AddParenSlop(ss);
|
2007-03-22 10:30:00 -07:00
|
|
|
return JS_TRUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static ptrdiff_t
|
|
|
|
PopOff(SprintStack *ss, JSOp op)
|
|
|
|
{
|
|
|
|
uintN top;
|
|
|
|
const JSCodeSpec *cs, *topcs;
|
|
|
|
ptrdiff_t off;
|
|
|
|
|
|
|
|
/* ss->top points to the next free slot; be paranoid about underflow. */
|
|
|
|
top = ss->top;
|
|
|
|
JS_ASSERT(top != 0);
|
|
|
|
if (top == 0)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
ss->top = --top;
|
|
|
|
off = GetOff(ss, top);
|
|
|
|
topcs = &js_CodeSpec[ss->opcodes[top]];
|
|
|
|
cs = &js_CodeSpec[op];
|
|
|
|
if (topcs->prec != 0 && topcs->prec < cs->prec) {
|
|
|
|
ss->sprinter.offset = ss->offsets[top] = off - 2;
|
|
|
|
off = Sprint(&ss->sprinter, "(%s)", OFF2STR(&ss->sprinter, off));
|
|
|
|
} else {
|
|
|
|
ss->sprinter.offset = off;
|
|
|
|
}
|
|
|
|
return off;
|
|
|
|
}
|
|
|
|
|
|
|
|
static const char *
|
|
|
|
PopStr(SprintStack *ss, JSOp op)
|
|
|
|
{
|
|
|
|
ptrdiff_t off;
|
|
|
|
|
|
|
|
off = PopOff(ss, op);
|
|
|
|
return OFF2STR(&ss->sprinter, off);
|
|
|
|
}
|
|
|
|
|
|
|
|
typedef struct TableEntry {
|
|
|
|
jsval key;
|
|
|
|
ptrdiff_t offset;
|
|
|
|
JSAtom *label;
|
|
|
|
jsint order; /* source order for stable tableswitch sort */
|
|
|
|
} TableEntry;
|
|
|
|
|
|
|
|
static JSBool
|
|
|
|
CompareOffsets(void *arg, const void *v1, const void *v2, int *result)
|
|
|
|
{
|
|
|
|
ptrdiff_t offset_diff;
|
|
|
|
const TableEntry *te1 = (const TableEntry *) v1,
|
|
|
|
*te2 = (const TableEntry *) v2;
|
|
|
|
|
|
|
|
offset_diff = te1->offset - te2->offset;
|
|
|
|
*result = (offset_diff == 0 ? te1->order - te2->order
|
|
|
|
: offset_diff < 0 ? -1
|
|
|
|
: 1);
|
|
|
|
return JS_TRUE;
|
|
|
|
}
|
|
|
|
|
2007-04-01 19:01:50 -07:00
|
|
|
static ptrdiff_t
|
|
|
|
SprintDoubleValue(Sprinter *sp, jsval v, JSOp *opp)
|
|
|
|
{
|
|
|
|
jsdouble d;
|
|
|
|
ptrdiff_t todo;
|
|
|
|
char *s, buf[DTOSTR_STANDARD_BUFFER_SIZE];
|
|
|
|
|
|
|
|
JS_ASSERT(JSVAL_IS_DOUBLE(v));
|
|
|
|
d = *JSVAL_TO_DOUBLE(v);
|
|
|
|
if (JSDOUBLE_IS_NEGZERO(d)) {
|
|
|
|
todo = SprintCString(sp, "-0");
|
|
|
|
*opp = JSOP_NEG;
|
|
|
|
} else if (!JSDOUBLE_IS_FINITE(d)) {
|
|
|
|
/* Don't use Infinity and NaN, they're mutable. */
|
|
|
|
todo = SprintCString(sp,
|
|
|
|
JSDOUBLE_IS_NaN(d)
|
|
|
|
? "0 / 0"
|
|
|
|
: (d < 0)
|
|
|
|
? "1 / -0"
|
|
|
|
: "1 / 0");
|
|
|
|
*opp = JSOP_DIV;
|
|
|
|
} else {
|
|
|
|
s = JS_dtostr(buf, sizeof buf, DTOSTR_STANDARD, 0, d);
|
|
|
|
if (!s) {
|
|
|
|
JS_ReportOutOfMemory(sp->context);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
JS_ASSERT(strcmp(s, js_Infinity_str) &&
|
|
|
|
(*s != '-' ||
|
|
|
|
strcmp(s + 1, js_Infinity_str)) &&
|
|
|
|
strcmp(s, js_NaN_str));
|
|
|
|
todo = Sprint(sp, s);
|
|
|
|
}
|
|
|
|
return todo;
|
|
|
|
}
|
|
|
|
|
2007-03-22 10:30:00 -07:00
|
|
|
static jsbytecode *
|
|
|
|
Decompile(SprintStack *ss, jsbytecode *pc, intN nb);
|
|
|
|
|
|
|
|
static JSBool
|
|
|
|
DecompileSwitch(SprintStack *ss, TableEntry *table, uintN tableLength,
|
|
|
|
jsbytecode *pc, ptrdiff_t switchLength,
|
|
|
|
ptrdiff_t defaultOffset, JSBool isCondSwitch)
|
|
|
|
{
|
|
|
|
JSContext *cx;
|
|
|
|
JSPrinter *jp;
|
2007-04-01 19:01:50 -07:00
|
|
|
ptrdiff_t off, off2, diff, caseExprOff, todo;
|
2007-03-22 10:30:00 -07:00
|
|
|
char *lval, *rval;
|
|
|
|
uintN i;
|
|
|
|
jsval key;
|
|
|
|
JSString *str;
|
|
|
|
|
|
|
|
cx = ss->sprinter.context;
|
|
|
|
jp = ss->printer;
|
|
|
|
|
|
|
|
/* JSOP_CONDSWITCH doesn't pop, unlike JSOP_{LOOKUP,TABLE}SWITCH. */
|
|
|
|
off = isCondSwitch ? GetOff(ss, ss->top-1) : PopOff(ss, JSOP_NOP);
|
|
|
|
lval = OFF2STR(&ss->sprinter, off);
|
|
|
|
|
|
|
|
js_printf(CLEAR_MAYBE_BRACE(jp), "\tswitch (%s) {\n", lval);
|
|
|
|
|
|
|
|
if (tableLength) {
|
|
|
|
diff = table[0].offset - defaultOffset;
|
|
|
|
if (diff > 0) {
|
|
|
|
jp->indent += 2;
|
|
|
|
js_printf(jp, "\t%s:\n", js_default_str);
|
|
|
|
jp->indent += 2;
|
|
|
|
if (!Decompile(ss, pc + defaultOffset, diff))
|
|
|
|
return JS_FALSE;
|
|
|
|
jp->indent -= 4;
|
|
|
|
}
|
|
|
|
|
|
|
|
caseExprOff = isCondSwitch ? JSOP_CONDSWITCH_LENGTH : 0;
|
|
|
|
|
|
|
|
for (i = 0; i < tableLength; i++) {
|
|
|
|
off = table[i].offset;
|
|
|
|
off2 = (i + 1 < tableLength) ? table[i + 1].offset : switchLength;
|
|
|
|
|
|
|
|
key = table[i].key;
|
|
|
|
if (isCondSwitch) {
|
|
|
|
ptrdiff_t nextCaseExprOff;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* key encodes the JSOP_CASE bytecode's offset from switchtop.
|
|
|
|
* The next case expression follows immediately, unless we are
|
|
|
|
* at the last case.
|
|
|
|
*/
|
|
|
|
nextCaseExprOff = (ptrdiff_t)JSVAL_TO_INT(key);
|
|
|
|
nextCaseExprOff += js_CodeSpec[pc[nextCaseExprOff]].length;
|
|
|
|
jp->indent += 2;
|
|
|
|
if (!Decompile(ss, pc + caseExprOff,
|
|
|
|
nextCaseExprOff - caseExprOff)) {
|
|
|
|
return JS_FALSE;
|
|
|
|
}
|
|
|
|
caseExprOff = nextCaseExprOff;
|
|
|
|
|
|
|
|
/* Balance the stack as if this JSOP_CASE matched. */
|
|
|
|
--ss->top;
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* key comes from an atom, not the decompiler, so we need to
|
|
|
|
* quote it if it's a string literal. But if table[i].label
|
|
|
|
* is non-null, key was constant-propagated and label is the
|
|
|
|
* name of the const we should show as the case label. We set
|
|
|
|
* key to undefined so this identifier is escaped, if required
|
|
|
|
* by non-ASCII characters, but not quoted, by QuoteString.
|
|
|
|
*/
|
2007-04-01 19:01:50 -07:00
|
|
|
todo = -1;
|
2007-03-22 10:30:00 -07:00
|
|
|
if (table[i].label) {
|
|
|
|
str = ATOM_TO_STRING(table[i].label);
|
|
|
|
key = JSVAL_VOID;
|
2007-04-01 19:01:50 -07:00
|
|
|
} else if (JSVAL_IS_DOUBLE(key)) {
|
|
|
|
JSOp junk;
|
|
|
|
|
|
|
|
todo = SprintDoubleValue(&ss->sprinter, key, &junk);
|
|
|
|
str = NULL;
|
2007-03-22 10:30:00 -07:00
|
|
|
} else {
|
|
|
|
str = js_ValueToString(cx, key);
|
|
|
|
if (!str)
|
|
|
|
return JS_FALSE;
|
|
|
|
}
|
2007-04-01 19:01:50 -07:00
|
|
|
if (todo >= 0) {
|
|
|
|
rval = OFF2STR(&ss->sprinter, todo);
|
|
|
|
} else {
|
|
|
|
rval = QuoteString(&ss->sprinter, str, (jschar)
|
|
|
|
(JSVAL_IS_STRING(key) ? '"' : 0));
|
|
|
|
if (!rval)
|
|
|
|
return JS_FALSE;
|
|
|
|
}
|
2007-03-22 10:30:00 -07:00
|
|
|
RETRACT(&ss->sprinter, rval);
|
|
|
|
jp->indent += 2;
|
|
|
|
js_printf(jp, "\tcase %s:\n", rval);
|
|
|
|
}
|
|
|
|
|
|
|
|
jp->indent += 2;
|
|
|
|
if (off <= defaultOffset && defaultOffset < off2) {
|
|
|
|
diff = defaultOffset - off;
|
|
|
|
if (diff != 0) {
|
|
|
|
if (!Decompile(ss, pc + off, diff))
|
|
|
|
return JS_FALSE;
|
|
|
|
off = defaultOffset;
|
|
|
|
}
|
|
|
|
jp->indent -= 2;
|
|
|
|
js_printf(jp, "\t%s:\n", js_default_str);
|
|
|
|
jp->indent += 2;
|
|
|
|
}
|
|
|
|
if (!Decompile(ss, pc + off, off2 - off))
|
|
|
|
return JS_FALSE;
|
|
|
|
jp->indent -= 4;
|
|
|
|
|
|
|
|
/* Re-balance as if last JSOP_CASE or JSOP_DEFAULT mismatched. */
|
|
|
|
if (isCondSwitch)
|
|
|
|
++ss->top;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (defaultOffset == switchLength) {
|
|
|
|
jp->indent += 2;
|
|
|
|
js_printf(jp, "\t%s:;\n", js_default_str);
|
|
|
|
jp->indent -= 2;
|
|
|
|
}
|
|
|
|
js_printf(jp, "\t}\n");
|
|
|
|
|
|
|
|
/* By the end of a JSOP_CONDSWITCH, the discriminant has been popped. */
|
|
|
|
if (isCondSwitch)
|
|
|
|
--ss->top;
|
|
|
|
return JS_TRUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static JSAtom *
|
|
|
|
GetSlotAtom(JSPrinter *jp, JSPropertyOp getter, uintN slot)
|
|
|
|
{
|
|
|
|
JSScope *scope;
|
|
|
|
JSScopeProperty *sprop;
|
|
|
|
JSObject *obj, *proto;
|
|
|
|
|
|
|
|
scope = jp->scope;
|
|
|
|
while (scope) {
|
|
|
|
for (sprop = SCOPE_LAST_PROP(scope); sprop; sprop = sprop->parent) {
|
|
|
|
if (sprop->getter != getter)
|
|
|
|
continue;
|
|
|
|
JS_ASSERT(sprop->flags & SPROP_HAS_SHORTID);
|
|
|
|
JS_ASSERT(JSID_IS_ATOM(sprop->id));
|
|
|
|
if ((uintN) sprop->shortid == slot)
|
|
|
|
return JSID_TO_ATOM(sprop->id);
|
|
|
|
}
|
|
|
|
obj = scope->object;
|
|
|
|
if (!obj)
|
|
|
|
break;
|
|
|
|
proto = OBJ_GET_PROTO(jp->sprinter.context, obj);
|
|
|
|
if (!proto)
|
|
|
|
break;
|
|
|
|
scope = OBJ_SCOPE(proto);
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
static JSBool
|
|
|
|
PushSlotAtom(SprintStack *ss, JSPropertyOp getter, uintN slot, JSOp op)
|
|
|
|
{
|
|
|
|
JSAtom *atom;
|
|
|
|
char *lval;
|
|
|
|
|
|
|
|
atom = GetSlotAtom(ss->printer, getter, slot);
|
|
|
|
if (!atom)
|
|
|
|
return JS_FALSE;
|
|
|
|
JS_ASSERT(ATOM_IS_STRING(atom));
|
|
|
|
lval = QuoteString(&ss->sprinter, ATOM_TO_STRING(atom), 0);
|
|
|
|
if (!lval)
|
|
|
|
return JS_FALSE;
|
|
|
|
return PushOff(ss, STR2OFF(&ss->sprinter, lval), op);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* NB: Indexed by SRC_DECL_* defines from jsemit.h.
|
|
|
|
*/
|
|
|
|
static const char * const var_prefix[] = {"var ", "const ", "let "};
|
|
|
|
|
|
|
|
static const char *
|
|
|
|
VarPrefix(jssrcnote *sn)
|
|
|
|
{
|
|
|
|
if (sn && (SN_TYPE(sn) == SRC_DECL || SN_TYPE(sn) == SRC_GROUPASSIGN)) {
|
|
|
|
ptrdiff_t type = js_GetSrcNoteOffset(sn, 0);
|
|
|
|
if ((uintN)type <= SRC_DECL_LET)
|
|
|
|
return var_prefix[type];
|
|
|
|
}
|
|
|
|
return "";
|
|
|
|
}
|
|
|
|
#define LOCAL_ASSERT_RV(expr, rv) \
|
|
|
|
JS_BEGIN_MACRO \
|
|
|
|
JS_ASSERT(expr); \
|
|
|
|
if (!(expr)) return (rv); \
|
|
|
|
JS_END_MACRO
|
|
|
|
|
|
|
|
const char *
|
|
|
|
GetLocal(SprintStack *ss, jsint i)
|
|
|
|
{
|
|
|
|
ptrdiff_t off;
|
|
|
|
JSContext *cx;
|
|
|
|
JSScript *script;
|
|
|
|
jsatomid j, n;
|
|
|
|
JSAtom *atom;
|
|
|
|
JSObject *obj;
|
|
|
|
jsint depth, count;
|
|
|
|
JSScopeProperty *sprop;
|
|
|
|
const char *rval;
|
|
|
|
|
|
|
|
#define LOCAL_ASSERT(expr) LOCAL_ASSERT_RV(expr, "")
|
|
|
|
|
|
|
|
off = ss->offsets[i];
|
|
|
|
if (off >= 0)
|
|
|
|
return OFF2STR(&ss->sprinter, off);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We must be called from js_DecompileValueGenerator (via Decompile) when
|
|
|
|
* dereferencing a local that's undefined or null. Search script->atomMap
|
|
|
|
* for the block containing this local by its stack index, i.
|
|
|
|
*/
|
|
|
|
cx = ss->sprinter.context;
|
|
|
|
script = ss->printer->script;
|
|
|
|
for (j = 0, n = script->atomMap.length; j < n; j++) {
|
|
|
|
atom = script->atomMap.vector[j];
|
|
|
|
if (ATOM_IS_OBJECT(atom)) {
|
|
|
|
obj = ATOM_TO_OBJECT(atom);
|
|
|
|
if (OBJ_GET_CLASS(cx, obj) == &js_BlockClass) {
|
|
|
|
depth = OBJ_BLOCK_DEPTH(cx, obj);
|
|
|
|
count = OBJ_BLOCK_COUNT(cx, obj);
|
|
|
|
if ((jsuint)(i - depth) < (jsuint)count)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
LOCAL_ASSERT(j < n);
|
|
|
|
i -= depth;
|
|
|
|
for (sprop = OBJ_SCOPE(obj)->lastProp; sprop; sprop = sprop->parent) {
|
|
|
|
if (sprop->shortid == i)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
LOCAL_ASSERT(sprop && JSID_IS_ATOM(sprop->id));
|
|
|
|
atom = JSID_TO_ATOM(sprop->id);
|
|
|
|
rval = QuoteString(&ss->sprinter, ATOM_TO_STRING(atom), 0);
|
|
|
|
if (!rval)
|
|
|
|
return NULL;
|
|
|
|
RETRACT(&ss->sprinter, rval);
|
|
|
|
return rval;
|
|
|
|
|
|
|
|
#undef LOCAL_ASSERT
|
|
|
|
}
|
|
|
|
|
|
|
|
#if JS_HAS_DESTRUCTURING
|
|
|
|
|
|
|
|
#define LOCAL_ASSERT(expr) LOCAL_ASSERT_RV(expr, NULL)
|
|
|
|
#define LOAD_OP_DATA(pc) (oplen = (cs = &js_CodeSpec[op = *pc])->length)
|
|
|
|
|
|
|
|
static jsbytecode *
|
|
|
|
DecompileDestructuring(SprintStack *ss, jsbytecode *pc, jsbytecode *endpc);
|
|
|
|
|
|
|
|
static jsbytecode *
|
|
|
|
DecompileDestructuringLHS(SprintStack *ss, jsbytecode *pc, jsbytecode *endpc,
|
|
|
|
JSBool *hole)
|
|
|
|
{
|
|
|
|
JSContext *cx;
|
|
|
|
JSPrinter *jp;
|
|
|
|
JSOp op;
|
|
|
|
const JSCodeSpec *cs;
|
|
|
|
uintN oplen, i;
|
|
|
|
const char *lval, *xval;
|
|
|
|
ptrdiff_t todo;
|
|
|
|
JSAtom *atom;
|
|
|
|
|
|
|
|
*hole = JS_FALSE;
|
|
|
|
cx = ss->sprinter.context;
|
|
|
|
jp = ss->printer;
|
|
|
|
LOAD_OP_DATA(pc);
|
|
|
|
|
|
|
|
switch (op) {
|
|
|
|
case JSOP_POP:
|
|
|
|
*hole = JS_TRUE;
|
|
|
|
todo = SprintPut(&ss->sprinter, ", ", 2);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_DUP:
|
|
|
|
pc = DecompileDestructuring(ss, pc, endpc);
|
|
|
|
if (!pc)
|
|
|
|
return NULL;
|
|
|
|
if (pc == endpc)
|
|
|
|
return pc;
|
|
|
|
LOAD_OP_DATA(pc);
|
|
|
|
lval = PopStr(ss, JSOP_NOP);
|
|
|
|
todo = SprintCString(&ss->sprinter, lval);
|
2007-05-08 12:04:13 -07:00
|
|
|
if (op == JSOP_POPN)
|
2007-03-22 10:30:00 -07:00
|
|
|
return pc;
|
|
|
|
LOCAL_ASSERT(*pc == JSOP_POP);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_SETARG:
|
|
|
|
case JSOP_SETVAR:
|
|
|
|
case JSOP_SETGVAR:
|
|
|
|
case JSOP_SETLOCAL:
|
2007-05-08 12:04:13 -07:00
|
|
|
LOCAL_ASSERT(pc[oplen] == JSOP_POP || pc[oplen] == JSOP_POPN);
|
2007-03-22 10:30:00 -07:00
|
|
|
/* FALL THROUGH */
|
|
|
|
|
|
|
|
case JSOP_SETLOCALPOP:
|
|
|
|
i = GET_UINT16(pc);
|
|
|
|
atom = NULL;
|
|
|
|
lval = NULL;
|
|
|
|
if (op == JSOP_SETARG)
|
|
|
|
atom = GetSlotAtom(jp, js_GetArgument, i);
|
|
|
|
else if (op == JSOP_SETVAR)
|
|
|
|
atom = GetSlotAtom(jp, js_GetLocalVariable, i);
|
|
|
|
else if (op == JSOP_SETGVAR)
|
|
|
|
atom = js_GetAtomFromBytecode(jp->script, pc, 0);
|
|
|
|
else
|
|
|
|
lval = GetLocal(ss, i);
|
|
|
|
if (atom)
|
|
|
|
lval = js_AtomToPrintableString(cx, atom);
|
|
|
|
LOCAL_ASSERT(lval);
|
|
|
|
todo = SprintCString(&ss->sprinter, lval);
|
|
|
|
if (op != JSOP_SETLOCALPOP) {
|
|
|
|
pc += oplen;
|
|
|
|
if (pc == endpc)
|
|
|
|
return pc;
|
|
|
|
LOAD_OP_DATA(pc);
|
2007-05-08 12:04:13 -07:00
|
|
|
if (op == JSOP_POPN)
|
2007-03-22 10:30:00 -07:00
|
|
|
return pc;
|
|
|
|
LOCAL_ASSERT(op == JSOP_POP);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
/*
|
|
|
|
* We may need to auto-parenthesize the left-most value decompiled
|
|
|
|
* here, so add back PAREN_SLOP temporarily. Then decompile until the
|
|
|
|
* opcode that would reduce the stack depth to (ss->top-1), which we
|
|
|
|
* pass to Decompile encoded as -(ss->top-1) - 1 or just -ss->top for
|
|
|
|
* the nb parameter.
|
|
|
|
*/
|
|
|
|
todo = ss->sprinter.offset;
|
|
|
|
ss->sprinter.offset = todo + PAREN_SLOP;
|
|
|
|
pc = Decompile(ss, pc, -ss->top);
|
|
|
|
if (!pc)
|
|
|
|
return NULL;
|
|
|
|
if (pc == endpc)
|
|
|
|
return pc;
|
|
|
|
LOAD_OP_DATA(pc);
|
|
|
|
LOCAL_ASSERT(op == JSOP_ENUMELEM || op == JSOP_ENUMCONSTELEM);
|
|
|
|
xval = PopStr(ss, JSOP_NOP);
|
|
|
|
lval = PopStr(ss, JSOP_GETPROP);
|
|
|
|
ss->sprinter.offset = todo;
|
|
|
|
if (*lval == '\0') {
|
|
|
|
/* lval is from JSOP_BINDNAME, so just print xval. */
|
|
|
|
todo = SprintCString(&ss->sprinter, xval);
|
|
|
|
} else if (*xval == '\0') {
|
|
|
|
/* xval is from JSOP_SETCALL or JSOP_BINDXMLNAME, print lval. */
|
|
|
|
todo = SprintCString(&ss->sprinter, lval);
|
|
|
|
} else {
|
|
|
|
todo = Sprint(&ss->sprinter,
|
|
|
|
(js_CodeSpec[ss->opcodes[ss->top+1]].format
|
|
|
|
& JOF_XMLNAME)
|
|
|
|
? "%s.%s"
|
|
|
|
: "%s[%s]",
|
|
|
|
lval, xval);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (todo < 0)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
LOCAL_ASSERT(pc < endpc);
|
|
|
|
pc += oplen;
|
|
|
|
return pc;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Starting with a SRC_DESTRUCT-annotated JSOP_DUP, decompile a destructuring
|
|
|
|
* left-hand side object or array initialiser, including nested destructuring
|
|
|
|
* initialisers. On successful return, the decompilation will be pushed on ss
|
|
|
|
* and the return value will point to the POP or GROUP bytecode following the
|
|
|
|
* destructuring expression.
|
|
|
|
*
|
|
|
|
* At any point, if pc is equal to endpc and would otherwise advance, we stop
|
|
|
|
* immediately and return endpc.
|
|
|
|
*/
|
|
|
|
static jsbytecode *
|
|
|
|
DecompileDestructuring(SprintStack *ss, jsbytecode *pc, jsbytecode *endpc)
|
|
|
|
{
|
|
|
|
ptrdiff_t head, todo;
|
|
|
|
JSContext *cx;
|
|
|
|
JSPrinter *jp;
|
|
|
|
JSOp op, saveop;
|
|
|
|
const JSCodeSpec *cs;
|
|
|
|
uintN oplen;
|
|
|
|
jsint i, lasti;
|
|
|
|
jsdouble d;
|
|
|
|
const char *lval;
|
|
|
|
JSAtom *atom;
|
|
|
|
jssrcnote *sn;
|
|
|
|
JSString *str;
|
|
|
|
JSBool hole;
|
|
|
|
|
|
|
|
LOCAL_ASSERT(*pc == JSOP_DUP);
|
|
|
|
pc += JSOP_DUP_LENGTH;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Set head so we can rewrite '[' to '{' as needed. Back up PAREN_SLOP
|
|
|
|
* chars so the destructuring decompilation accumulates contiguously in
|
|
|
|
* ss->sprinter starting with "[".
|
|
|
|
*/
|
|
|
|
head = SprintPut(&ss->sprinter, "[", 1);
|
|
|
|
if (head < 0 || !PushOff(ss, head, JSOP_NOP))
|
|
|
|
return NULL;
|
|
|
|
ss->sprinter.offset -= PAREN_SLOP;
|
|
|
|
LOCAL_ASSERT(head == ss->sprinter.offset - 1);
|
|
|
|
LOCAL_ASSERT(*OFF2STR(&ss->sprinter, head) == '[');
|
|
|
|
|
|
|
|
cx = ss->sprinter.context;
|
|
|
|
jp = ss->printer;
|
|
|
|
lasti = -1;
|
|
|
|
|
|
|
|
while (pc < endpc) {
|
|
|
|
LOAD_OP_DATA(pc);
|
|
|
|
saveop = op;
|
|
|
|
|
|
|
|
switch (op) {
|
|
|
|
case JSOP_POP:
|
|
|
|
pc += oplen;
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
/* Handle the optimized number-pushing opcodes. */
|
|
|
|
case JSOP_ZERO: d = i = 0; goto do_getelem;
|
|
|
|
case JSOP_ONE: d = i = 1; goto do_getelem;
|
|
|
|
case JSOP_UINT16: d = i = GET_UINT16(pc); goto do_getelem;
|
|
|
|
case JSOP_UINT24: d = i = GET_UINT24(pc); goto do_getelem;
|
|
|
|
|
|
|
|
case JSOP_NUMBER:
|
|
|
|
atom = js_GetAtomFromBytecode(jp->script, pc, 0);
|
|
|
|
d = *ATOM_TO_DOUBLE(atom);
|
|
|
|
LOCAL_ASSERT(JSDOUBLE_IS_FINITE(d) && !JSDOUBLE_IS_NEGZERO(d));
|
|
|
|
i = (jsint)d;
|
|
|
|
|
|
|
|
do_getelem:
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
pc += oplen;
|
|
|
|
if (pc == endpc)
|
|
|
|
return pc;
|
|
|
|
LOAD_OP_DATA(pc);
|
|
|
|
LOCAL_ASSERT(op == JSOP_GETELEM);
|
|
|
|
|
|
|
|
/* Distinguish object from array by opcode or source note. */
|
|
|
|
if (sn && SN_TYPE(sn) == SRC_INITPROP) {
|
|
|
|
*OFF2STR(&ss->sprinter, head) = '{';
|
|
|
|
if (Sprint(&ss->sprinter, "%g: ", d) < 0)
|
|
|
|
return NULL;
|
|
|
|
} else {
|
|
|
|
/* Sanity check for the gnarly control flow above. */
|
|
|
|
LOCAL_ASSERT(i == d);
|
|
|
|
|
|
|
|
/* Fill in any holes (holes at the end don't matter). */
|
|
|
|
while (++lasti < i) {
|
|
|
|
if (SprintPut(&ss->sprinter, ", ", 2) < 0)
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_CALLPROP:
|
|
|
|
case JSOP_GETPROP:
|
|
|
|
*OFF2STR(&ss->sprinter, head) = '{';
|
|
|
|
atom = js_GetAtomFromBytecode(jp->script, pc, 0);
|
|
|
|
str = ATOM_TO_STRING(atom);
|
|
|
|
if (!QuoteString(&ss->sprinter, str,
|
|
|
|
js_IsIdentifier(str) ? 0 : (jschar)'\'')) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
if (SprintPut(&ss->sprinter, ": ", 2) < 0)
|
|
|
|
return NULL;
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
LOCAL_ASSERT(0);
|
|
|
|
}
|
|
|
|
|
|
|
|
pc += oplen;
|
|
|
|
if (pc == endpc)
|
|
|
|
return pc;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Decompile the left-hand side expression whose bytecode starts at pc
|
|
|
|
* and continues for a bounded number of bytecodes or stack operations
|
|
|
|
* (and which in any event stops before endpc).
|
|
|
|
*/
|
|
|
|
pc = DecompileDestructuringLHS(ss, pc, endpc, &hole);
|
|
|
|
if (!pc)
|
|
|
|
return NULL;
|
|
|
|
if (pc == endpc || *pc != JSOP_DUP)
|
|
|
|
break;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check for SRC_DESTRUCT on this JSOP_DUP, which would mean another
|
|
|
|
* destructuring initialiser abuts this one, and we should stop. This
|
|
|
|
* happens with source of the form '[a] = [b] = c'.
|
|
|
|
*/
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
if (sn && SN_TYPE(sn) == SRC_DESTRUCT)
|
|
|
|
break;
|
|
|
|
|
|
|
|
if (!hole && SprintPut(&ss->sprinter, ", ", 2) < 0)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
pc += JSOP_DUP_LENGTH;
|
|
|
|
}
|
|
|
|
|
|
|
|
out:
|
|
|
|
lval = OFF2STR(&ss->sprinter, head);
|
|
|
|
todo = SprintPut(&ss->sprinter, (*lval == '[') ? "]" : "}", 1);
|
|
|
|
if (todo < 0)
|
|
|
|
return NULL;
|
|
|
|
return pc;
|
|
|
|
}
|
|
|
|
|
|
|
|
static jsbytecode *
|
|
|
|
DecompileGroupAssignment(SprintStack *ss, jsbytecode *pc, jsbytecode *endpc,
|
|
|
|
jssrcnote *sn, ptrdiff_t *todop)
|
|
|
|
{
|
|
|
|
JSOp op;
|
|
|
|
const JSCodeSpec *cs;
|
|
|
|
uintN oplen, start, end, i;
|
|
|
|
ptrdiff_t todo;
|
|
|
|
JSBool hole;
|
|
|
|
const char *rval;
|
|
|
|
|
|
|
|
LOAD_OP_DATA(pc);
|
|
|
|
LOCAL_ASSERT(op == JSOP_PUSH || op == JSOP_GETLOCAL);
|
|
|
|
|
|
|
|
todo = Sprint(&ss->sprinter, "%s[", VarPrefix(sn));
|
|
|
|
if (todo < 0 || !PushOff(ss, todo, JSOP_NOP))
|
|
|
|
return NULL;
|
|
|
|
ss->sprinter.offset -= PAREN_SLOP;
|
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
pc += oplen;
|
|
|
|
if (pc == endpc)
|
|
|
|
return pc;
|
|
|
|
pc = DecompileDestructuringLHS(ss, pc, endpc, &hole);
|
|
|
|
if (!pc)
|
|
|
|
return NULL;
|
|
|
|
if (pc == endpc)
|
|
|
|
return pc;
|
|
|
|
LOAD_OP_DATA(pc);
|
|
|
|
if (op != JSOP_PUSH && op != JSOP_GETLOCAL)
|
|
|
|
break;
|
|
|
|
if (!hole && SprintPut(&ss->sprinter, ", ", 2) < 0)
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2007-05-06 23:40:10 -07:00
|
|
|
LOCAL_ASSERT(op == JSOP_POPN);
|
2007-03-22 10:30:00 -07:00
|
|
|
if (SprintPut(&ss->sprinter, "] = [", 5) < 0)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
end = ss->top - 1;
|
2007-05-08 12:04:13 -07:00
|
|
|
start = end - GET_UINT16(pc);
|
2007-03-22 10:30:00 -07:00
|
|
|
for (i = start; i < end; i++) {
|
|
|
|
rval = GetStr(ss, i);
|
2007-05-08 12:04:13 -07:00
|
|
|
if (Sprint(&ss->sprinter,
|
|
|
|
(i == start) ? "%s" : ", %s",
|
2007-03-22 10:30:00 -07:00
|
|
|
(i == end - 1 && *rval == '\0') ? ", " : rval) < 0) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (SprintPut(&ss->sprinter, "]", 1) < 0)
|
|
|
|
return NULL;
|
|
|
|
ss->sprinter.offset = ss->offsets[i];
|
|
|
|
ss->top = start;
|
|
|
|
*todop = todo;
|
|
|
|
return pc;
|
|
|
|
}
|
|
|
|
|
|
|
|
#undef LOCAL_ASSERT
|
|
|
|
#undef LOAD_OP_DATA
|
|
|
|
|
|
|
|
#endif /* JS_HAS_DESTRUCTURING */
|
|
|
|
|
2007-05-17 18:41:17 -07:00
|
|
|
static JSBool
|
|
|
|
InitSprintStack(JSContext *cx, SprintStack *ss, JSPrinter *jp, uintN depth)
|
|
|
|
{
|
|
|
|
size_t offsetsz, opcodesz;
|
|
|
|
void *space;
|
|
|
|
|
|
|
|
INIT_SPRINTER(cx, &ss->sprinter, &cx->tempPool, PAREN_SLOP);
|
|
|
|
|
|
|
|
/* Allocate the parallel (to avoid padding) offset and opcode stacks. */
|
|
|
|
offsetsz = depth * sizeof(ptrdiff_t);
|
|
|
|
opcodesz = depth * sizeof(jsbytecode);
|
|
|
|
JS_ARENA_ALLOCATE(space, &cx->tempPool, offsetsz + opcodesz);
|
|
|
|
if (!space)
|
|
|
|
return JS_FALSE;
|
|
|
|
ss->offsets = (ptrdiff_t *) space;
|
|
|
|
ss->opcodes = (jsbytecode *) ((char *)space + offsetsz);
|
|
|
|
|
|
|
|
ss->top = ss->inArrayInit = 0;
|
|
|
|
ss->inGenExp = JS_FALSE;
|
|
|
|
ss->printer = jp;
|
|
|
|
return JS_TRUE;
|
|
|
|
}
|
|
|
|
|
2007-03-22 10:30:00 -07:00
|
|
|
/*
|
|
|
|
* If nb is non-negative, decompile nb bytecodes starting at pc. Otherwise
|
|
|
|
* the decompiler starts at pc and continues until it reaches an opcode for
|
|
|
|
* which decompiling would result in the stack depth equaling -(nb + 1).
|
|
|
|
*/
|
|
|
|
static jsbytecode *
|
|
|
|
Decompile(SprintStack *ss, jsbytecode *pc, intN nb)
|
|
|
|
{
|
|
|
|
JSContext *cx;
|
|
|
|
JSPrinter *jp, *jp2;
|
|
|
|
jsbytecode *startpc, *endpc, *pc2, *done, *forelem_tail, *forelem_done;
|
|
|
|
ptrdiff_t tail, todo, len, oplen, cond, next;
|
|
|
|
JSOp op, lastop, saveop;
|
|
|
|
const JSCodeSpec *cs;
|
|
|
|
jssrcnote *sn, *sn2;
|
2007-05-06 03:50:07 -07:00
|
|
|
const char *lval, *rval, *xval, *fmt, *token;
|
2007-03-22 10:30:00 -07:00
|
|
|
jsint i, argc;
|
|
|
|
char **argv;
|
|
|
|
JSAtom *atom;
|
|
|
|
JSObject *obj;
|
|
|
|
JSFunction *fun;
|
|
|
|
JSString *str;
|
|
|
|
JSBool ok;
|
|
|
|
#if JS_HAS_XML_SUPPORT
|
|
|
|
JSBool foreach, inXML, quoteAttr;
|
|
|
|
#else
|
|
|
|
#define inXML JS_FALSE
|
|
|
|
#endif
|
|
|
|
jsval val;
|
|
|
|
int stackDummy;
|
|
|
|
|
|
|
|
static const char exception_cookie[] = "/*EXCEPTION*/";
|
|
|
|
static const char retsub_pc_cookie[] = "/*RETSUB_PC*/";
|
|
|
|
static const char forelem_cookie[] = "/*FORELEM*/";
|
|
|
|
static const char with_cookie[] = "/*WITH*/";
|
|
|
|
static const char dot_format[] = "%s.%s";
|
|
|
|
static const char index_format[] = "%s[%s]";
|
|
|
|
static const char predot_format[] = "%s%s.%s";
|
|
|
|
static const char postdot_format[] = "%s.%s%s";
|
|
|
|
static const char preindex_format[] = "%s%s[%s]";
|
|
|
|
static const char postindex_format[] = "%s[%s]%s";
|
|
|
|
static const char ss_format[] = "%s%s";
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Local macros
|
|
|
|
*/
|
|
|
|
#define DECOMPILE_CODE(pc,nb) if (!Decompile(ss, pc, nb)) return NULL
|
|
|
|
#define POP_STR() PopStr(ss, op)
|
|
|
|
#define LOCAL_ASSERT(expr) LOCAL_ASSERT_RV(expr, JS_FALSE)
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Callers know that ATOM_IS_STRING(atom), and we leave it to the optimizer to
|
|
|
|
* common ATOM_TO_STRING(atom) here and near the call sites.
|
|
|
|
*/
|
|
|
|
#define ATOM_IS_IDENTIFIER(atom) js_IsIdentifier(ATOM_TO_STRING(atom))
|
2007-05-01 11:07:44 -07:00
|
|
|
#define ATOM_IS_KEYWORD(atom) \
|
2007-05-02 00:09:27 -07:00
|
|
|
(js_CheckKeyword(JSSTRING_CHARS(ATOM_TO_STRING(atom)), \
|
|
|
|
JSSTRING_LENGTH(ATOM_TO_STRING(atom))) != TOK_EOF)
|
2007-03-22 10:30:00 -07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Given an atom already fetched from jp->script's atom map, quote/escape its
|
|
|
|
* string appropriately into rval, and select fmt from the quoted and unquoted
|
|
|
|
* alternatives.
|
|
|
|
*/
|
|
|
|
#define GET_QUOTE_AND_FMT(qfmt, ufmt, rval) \
|
|
|
|
JS_BEGIN_MACRO \
|
|
|
|
jschar quote_; \
|
|
|
|
if (!ATOM_IS_IDENTIFIER(atom)) { \
|
|
|
|
quote_ = '\''; \
|
|
|
|
fmt = qfmt; \
|
|
|
|
} else { \
|
|
|
|
quote_ = 0; \
|
|
|
|
fmt = ufmt; \
|
|
|
|
} \
|
|
|
|
rval = QuoteString(&ss->sprinter, ATOM_TO_STRING(atom), quote_); \
|
|
|
|
if (!rval) \
|
|
|
|
return NULL; \
|
|
|
|
JS_END_MACRO
|
|
|
|
|
|
|
|
#define LOAD_ATOM(PCOFF) \
|
|
|
|
(atom = js_GetAtomFromBytecode(jp->script, pc, (PCOFF)))
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Get atom from jp->script's atom map, quote/escape its string appropriately
|
|
|
|
* into rval, and select fmt from the quoted and unquoted alternatives.
|
|
|
|
*/
|
|
|
|
#define GET_ATOM_QUOTE_AND_FMT(qfmt, ufmt, rval) \
|
|
|
|
JS_BEGIN_MACRO \
|
|
|
|
LOAD_ATOM(0); \
|
|
|
|
GET_QUOTE_AND_FMT(qfmt, ufmt, rval); \
|
|
|
|
JS_END_MACRO
|
|
|
|
|
|
|
|
cx = ss->sprinter.context;
|
|
|
|
if (!JS_CHECK_STACK_SIZE(cx, stackDummy)) {
|
|
|
|
JS_ReportErrorNumber(cx, js_GetErrorMessage, NULL, JSMSG_OVER_RECURSED);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
jp = ss->printer;
|
|
|
|
startpc = pc;
|
|
|
|
endpc = (nb < 0) ? jp->script->code + jp->script->length : pc + nb;
|
|
|
|
forelem_tail = forelem_done = NULL;
|
|
|
|
tail = -1;
|
|
|
|
todo = -2; /* NB: different from Sprint() error return. */
|
|
|
|
saveop = JSOP_NOP;
|
|
|
|
sn = NULL;
|
|
|
|
rval = NULL;
|
|
|
|
#if JS_HAS_XML_SUPPORT
|
|
|
|
foreach = inXML = quoteAttr = JS_FALSE;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
while (nb < 0 || pc < endpc) {
|
|
|
|
/*
|
|
|
|
* Move saveop to lastop so prefixed bytecodes can take special action
|
|
|
|
* while sharing maximal code. Set op and saveop to the new bytecode,
|
|
|
|
* use op in POP_STR to trigger automatic parenthesization, but push
|
|
|
|
* saveop at the bottom of the loop if this op pushes. Thus op may be
|
|
|
|
* set to nop or otherwise mutated to suppress auto-parens.
|
|
|
|
*/
|
|
|
|
lastop = saveop;
|
|
|
|
op = (JSOp) *pc;
|
|
|
|
cs = &js_CodeSpec[op];
|
|
|
|
if (cs->format & JOF_ATOMBASE) {
|
|
|
|
/*
|
|
|
|
* The decompiler uses js_GetAtomFromBytecode to get atoms and
|
|
|
|
* ignores these suffix/prefix bytecodes, thus simplifying code
|
|
|
|
* that must process JSOP_GETTER/JSOP_SETTER prefixes.
|
|
|
|
*/
|
|
|
|
pc += cs->length;
|
|
|
|
if (pc >= endpc)
|
|
|
|
break;
|
|
|
|
op = (JSOp) *pc;
|
|
|
|
cs = &js_CodeSpec[op];
|
|
|
|
}
|
|
|
|
saveop = op;
|
|
|
|
len = oplen = cs->length;
|
|
|
|
|
|
|
|
if (nb < 0 && -(nb + 1) == (intN)ss->top - cs->nuses + cs->ndefs)
|
|
|
|
return pc;
|
|
|
|
|
2007-05-09 14:40:36 -07:00
|
|
|
/*
|
|
|
|
* Save source literal associated with JS now before the following
|
|
|
|
* rewrite changes op. See bug 380197.
|
|
|
|
*/
|
|
|
|
token = CodeToken[op];
|
|
|
|
|
2007-03-22 10:30:00 -07:00
|
|
|
if (pc + oplen == jp->dvgfence) {
|
|
|
|
JSStackFrame *fp;
|
|
|
|
uint32 format, mode, type;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Rewrite non-get ops to their "get" format if the error is in
|
|
|
|
* the bytecode at pc, so we don't decompile more than the error
|
|
|
|
* expression.
|
|
|
|
*/
|
|
|
|
for (fp = cx->fp; fp && !fp->script; fp = fp->down)
|
|
|
|
continue;
|
|
|
|
format = cs->format;
|
|
|
|
if (((fp && pc == fp->pc) ||
|
|
|
|
(pc == startpc && cs->nuses != 0)) &&
|
|
|
|
format & (JOF_SET|JOF_DEL|JOF_INCDEC|JOF_IMPORT|JOF_FOR|
|
|
|
|
JOF_VARPROP)) {
|
|
|
|
mode = (format & JOF_MODEMASK);
|
|
|
|
if (mode == JOF_NAME) {
|
|
|
|
/*
|
|
|
|
* JOF_NAME does not imply JOF_CONST, so we must check for
|
|
|
|
* the QARG and QVAR format types, and translate those to
|
|
|
|
* JSOP_GETARG or JSOP_GETVAR appropriately, instead of to
|
|
|
|
* JSOP_NAME.
|
|
|
|
*/
|
|
|
|
type = format & JOF_TYPEMASK;
|
|
|
|
op = (type == JOF_QARG)
|
|
|
|
? JSOP_GETARG
|
|
|
|
: (type == JOF_QVAR)
|
|
|
|
? JSOP_GETVAR
|
|
|
|
: (type == JOF_LOCAL)
|
|
|
|
? JSOP_GETLOCAL
|
|
|
|
: JSOP_NAME;
|
|
|
|
|
|
|
|
i = cs->nuses - js_CodeSpec[op].nuses;
|
|
|
|
while (--i >= 0)
|
|
|
|
PopOff(ss, JSOP_NOP);
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* We must replace the faulting pc's bytecode with a
|
|
|
|
* corresponding JSOP_GET* code. For JSOP_SET{PROP,ELEM},
|
|
|
|
* we must use the "2nd" form of JSOP_GET{PROP,ELEM}, to
|
|
|
|
* throw away the assignment op's right-hand operand and
|
|
|
|
* decompile it as if it were a GET of its left-hand
|
|
|
|
* operand.
|
|
|
|
*/
|
|
|
|
if (mode == JOF_PROP) {
|
|
|
|
op = (format & JOF_SET) ? JSOP_GETPROP2 : JSOP_GETPROP;
|
|
|
|
} else if (mode == JOF_ELEM) {
|
|
|
|
op = (format & JOF_SET) ? JSOP_GETELEM2 : JSOP_GETELEM;
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* Zero mode means precisely that op is uncategorized
|
|
|
|
* for our purposes, so we must write per-op special
|
|
|
|
* case code here.
|
|
|
|
*/
|
|
|
|
switch (op) {
|
|
|
|
case JSOP_ENUMELEM:
|
|
|
|
case JSOP_ENUMCONSTELEM:
|
|
|
|
op = JSOP_GETELEM;
|
|
|
|
break;
|
|
|
|
#if JS_HAS_LVALUE_RETURN
|
|
|
|
case JSOP_SETCALL:
|
|
|
|
op = JSOP_CALL;
|
|
|
|
break;
|
|
|
|
#endif
|
|
|
|
case JSOP_GETARGPROP:
|
|
|
|
op = JSOP_GETARG;
|
|
|
|
break;
|
|
|
|
case JSOP_GETVARPROP:
|
|
|
|
op = JSOP_GETVAR;
|
|
|
|
break;
|
|
|
|
case JSOP_GETLOCALPROP:
|
|
|
|
op = JSOP_GETLOCAL;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
LOCAL_ASSERT(0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
saveop = op;
|
|
|
|
if (op >= JSOP_LIMIT) {
|
|
|
|
switch (op) {
|
|
|
|
case JSOP_GETPROP2:
|
|
|
|
saveop = JSOP_GETPROP;
|
|
|
|
break;
|
|
|
|
case JSOP_GETELEM2:
|
|
|
|
saveop = JSOP_GETELEM;
|
|
|
|
break;
|
|
|
|
default:;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
LOCAL_ASSERT(js_CodeSpec[saveop].length == oplen ||
|
|
|
|
(format & JOF_TYPEMASK) == JOF_INDEXCONST);
|
|
|
|
|
|
|
|
jp->dvgfence = NULL;
|
|
|
|
}
|
|
|
|
|
2007-05-06 03:50:07 -07:00
|
|
|
if (token) {
|
2007-03-22 10:30:00 -07:00
|
|
|
switch (cs->nuses) {
|
|
|
|
case 2:
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
if (sn && SN_TYPE(sn) == SRC_ASSIGNOP) {
|
|
|
|
/*
|
|
|
|
* Avoid over-parenthesizing y in x op= y based on its
|
|
|
|
* expansion: x = x op y (replace y by z = w to see the
|
|
|
|
* problem).
|
|
|
|
*/
|
|
|
|
op = pc[oplen];
|
|
|
|
LOCAL_ASSERT(op != saveop);
|
|
|
|
}
|
|
|
|
rval = POP_STR();
|
|
|
|
lval = POP_STR();
|
|
|
|
if (op != saveop) {
|
|
|
|
/* Print only the right operand of the assignment-op. */
|
|
|
|
todo = SprintCString(&ss->sprinter, rval);
|
|
|
|
op = saveop;
|
|
|
|
} else if (!inXML) {
|
|
|
|
todo = Sprint(&ss->sprinter, "%s %s %s",
|
2007-05-06 03:50:07 -07:00
|
|
|
lval, token, rval);
|
2007-03-22 10:30:00 -07:00
|
|
|
} else {
|
|
|
|
/* In XML, just concatenate the two operands. */
|
|
|
|
LOCAL_ASSERT(op == JSOP_ADD);
|
|
|
|
todo = Sprint(&ss->sprinter, ss_format, lval, rval);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 1:
|
|
|
|
rval = POP_STR();
|
2007-05-06 03:50:07 -07:00
|
|
|
todo = Sprint(&ss->sprinter, ss_format, token, rval);
|
2007-03-22 10:30:00 -07:00
|
|
|
break;
|
|
|
|
|
|
|
|
case 0:
|
2007-05-06 03:50:07 -07:00
|
|
|
todo = SprintCString(&ss->sprinter, token);
|
2007-03-22 10:30:00 -07:00
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
switch (op) {
|
|
|
|
#define BEGIN_LITOPX_CASE(OP,PCOFF) \
|
|
|
|
case OP: \
|
|
|
|
LOAD_ATOM(PCOFF);
|
|
|
|
|
|
|
|
#define END_LITOPX_CASE \
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_NOP:
|
|
|
|
/*
|
|
|
|
* Check for a do-while loop, a for-loop with an empty
|
|
|
|
* initializer part, a labeled statement, a function
|
|
|
|
* definition, or try/finally.
|
|
|
|
*/
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
todo = -2;
|
|
|
|
switch (sn ? SN_TYPE(sn) : SRC_NULL) {
|
|
|
|
case SRC_WHILE:
|
|
|
|
++pc;
|
|
|
|
tail = js_GetSrcNoteOffset(sn, 0) - 1;
|
|
|
|
LOCAL_ASSERT(pc[tail] == JSOP_IFNE ||
|
|
|
|
pc[tail] == JSOP_IFNEX);
|
|
|
|
js_printf(SET_MAYBE_BRACE(jp), "\tdo {\n");
|
|
|
|
jp->indent += 4;
|
|
|
|
DECOMPILE_CODE(pc, tail);
|
|
|
|
jp->indent -= 4;
|
|
|
|
js_printf(jp, "\t} while (%s);\n", POP_STR());
|
|
|
|
pc += tail;
|
|
|
|
len = js_CodeSpec[*pc].length;
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SRC_FOR:
|
|
|
|
rval = "";
|
|
|
|
|
|
|
|
do_forloop:
|
|
|
|
/* Skip the JSOP_NOP or JSOP_POP bytecode. */
|
|
|
|
pc++;
|
|
|
|
|
|
|
|
/* Get the cond, next, and loop-closing tail offsets. */
|
|
|
|
cond = js_GetSrcNoteOffset(sn, 0);
|
|
|
|
next = js_GetSrcNoteOffset(sn, 1);
|
|
|
|
tail = js_GetSrcNoteOffset(sn, 2);
|
|
|
|
LOCAL_ASSERT(tail + GetJumpOffset(pc+tail, pc+tail) == 0);
|
|
|
|
|
|
|
|
/* Print the keyword and the possibly empty init-part. */
|
|
|
|
js_printf(jp, "\tfor (%s;", rval);
|
|
|
|
|
|
|
|
if (pc[cond] == JSOP_IFEQ || pc[cond] == JSOP_IFEQX) {
|
|
|
|
/* Decompile the loop condition. */
|
|
|
|
DECOMPILE_CODE(pc, cond);
|
|
|
|
js_printf(jp, " %s", POP_STR());
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Need a semicolon whether or not there was a cond. */
|
|
|
|
js_puts(jp, ";");
|
|
|
|
|
|
|
|
if (pc[next] != JSOP_GOTO && pc[next] != JSOP_GOTOX) {
|
|
|
|
/* Decompile the loop updater. */
|
|
|
|
DECOMPILE_CODE(pc + next, tail - next - 1);
|
|
|
|
js_printf(jp, " %s", POP_STR());
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Do the loop body. */
|
|
|
|
js_printf(SET_MAYBE_BRACE(jp), ") {\n");
|
|
|
|
jp->indent += 4;
|
|
|
|
oplen = (cond) ? js_CodeSpec[pc[cond]].length : 0;
|
|
|
|
DECOMPILE_CODE(pc + cond + oplen, next - cond - oplen);
|
|
|
|
jp->indent -= 4;
|
|
|
|
js_printf(jp, "\t}\n");
|
|
|
|
|
|
|
|
/* Set len so pc skips over the entire loop. */
|
|
|
|
len = tail + js_CodeSpec[pc[tail]].length;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SRC_LABEL:
|
|
|
|
atom = js_GetAtom(cx, &jp->script->atomMap,
|
|
|
|
(jsatomid) js_GetSrcNoteOffset(sn, 0));
|
|
|
|
jp->indent -= 4;
|
|
|
|
rval = QuoteString(&ss->sprinter, ATOM_TO_STRING(atom), 0);
|
|
|
|
if (!rval)
|
|
|
|
return NULL;
|
|
|
|
RETRACT(&ss->sprinter, rval);
|
|
|
|
js_printf(CLEAR_MAYBE_BRACE(jp), "\t%s:\n", rval);
|
|
|
|
jp->indent += 4;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SRC_LABELBRACE:
|
|
|
|
atom = js_GetAtom(cx, &jp->script->atomMap,
|
|
|
|
(jsatomid) js_GetSrcNoteOffset(sn, 0));
|
|
|
|
rval = QuoteString(&ss->sprinter, ATOM_TO_STRING(atom), 0);
|
|
|
|
if (!rval)
|
|
|
|
return NULL;
|
|
|
|
RETRACT(&ss->sprinter, rval);
|
|
|
|
js_printf(CLEAR_MAYBE_BRACE(jp), "\t%s: {\n", rval);
|
|
|
|
jp->indent += 4;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SRC_ENDBRACE:
|
|
|
|
jp->indent -= 4;
|
|
|
|
js_printf(jp, "\t}\n");
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SRC_FUNCDEF:
|
|
|
|
atom = js_GetAtom(cx, &jp->script->atomMap,
|
|
|
|
(jsatomid) js_GetSrcNoteOffset(sn, 0));
|
|
|
|
LOCAL_ASSERT(ATOM_IS_OBJECT(atom));
|
|
|
|
do_function:
|
|
|
|
obj = ATOM_TO_OBJECT(atom);
|
|
|
|
fun = (JSFunction *) JS_GetPrivate(cx, obj);
|
2007-04-10 06:29:10 -07:00
|
|
|
jp2 = JS_NEW_PRINTER(cx, "nested_function",
|
|
|
|
jp->indent, jp->pretty);
|
2007-03-22 10:30:00 -07:00
|
|
|
if (!jp2)
|
|
|
|
return NULL;
|
|
|
|
jp2->scope = jp->scope;
|
|
|
|
js_puts(jp2, "\n");
|
|
|
|
ok = js_DecompileFunction(jp2, fun);
|
|
|
|
if (ok && jp2->sprinter.base) {
|
|
|
|
js_puts(jp, jp2->sprinter.base);
|
|
|
|
js_puts(jp, "\n");
|
|
|
|
}
|
|
|
|
js_DestroyPrinter(jp2);
|
|
|
|
if (!ok)
|
|
|
|
return NULL;
|
|
|
|
js_puts(jp, "\n");
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SRC_BRACE:
|
|
|
|
js_printf(CLEAR_MAYBE_BRACE(jp), "\t{\n");
|
|
|
|
jp->indent += 4;
|
|
|
|
len = js_GetSrcNoteOffset(sn, 0);
|
|
|
|
DECOMPILE_CODE(pc + oplen, len - oplen);
|
|
|
|
jp->indent -= 4;
|
|
|
|
js_printf(jp, "\t}\n");
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_GROUP:
|
|
|
|
cs = &js_CodeSpec[lastop];
|
|
|
|
if ((cs->prec != 0 &&
|
|
|
|
cs->prec == js_CodeSpec[pc[JSOP_GROUP_LENGTH]].prec) ||
|
|
|
|
pc[JSOP_GROUP_LENGTH] == JSOP_NULL ||
|
2007-03-29 00:24:14 -07:00
|
|
|
pc[JSOP_GROUP_LENGTH] == JSOP_DUP ||
|
|
|
|
pc[JSOP_GROUP_LENGTH] == JSOP_IFEQ ||
|
|
|
|
pc[JSOP_GROUP_LENGTH] == JSOP_IFNE) {
|
2007-03-22 10:30:00 -07:00
|
|
|
/*
|
|
|
|
* Force parens if this JSOP_GROUP forced re-association
|
|
|
|
* against precedence, or if this is a call or constructor
|
2007-03-29 00:24:14 -07:00
|
|
|
* expression, or if it is destructured (JSOP_DUP), or if
|
|
|
|
* it is an if or loop condition test.
|
2007-03-22 10:30:00 -07:00
|
|
|
*
|
|
|
|
* This is necessary to handle the operator new grammar,
|
|
|
|
* by which new x(y).z means (new x(y))).z. For example
|
|
|
|
* new (x(y).z) must decompile with the constructor
|
|
|
|
* parenthesized, but normal precedence has JSOP_GETPROP
|
|
|
|
* (for the final .z) higher than JSOP_NEW. In general,
|
|
|
|
* if the call or constructor expression is parenthesized,
|
|
|
|
* we preserve parens.
|
|
|
|
*/
|
|
|
|
op = JSOP_NAME;
|
|
|
|
rval = POP_STR();
|
|
|
|
todo = SprintCString(&ss->sprinter, rval);
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* Don't explicitly parenthesize -- just fix the top
|
|
|
|
* opcode so that the auto-parens magic in PopOff can do
|
|
|
|
* its thing.
|
|
|
|
*/
|
|
|
|
LOCAL_ASSERT(ss->top != 0);
|
|
|
|
ss->opcodes[ss->top-1] = saveop = lastop;
|
|
|
|
todo = -2;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_PUSH:
|
|
|
|
#if JS_HAS_DESTRUCTURING
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
if (sn && SN_TYPE(sn) == SRC_GROUPASSIGN) {
|
|
|
|
pc = DecompileGroupAssignment(ss, pc, endpc, sn, &todo);
|
|
|
|
if (!pc)
|
|
|
|
return NULL;
|
2007-05-06 23:40:10 -07:00
|
|
|
LOCAL_ASSERT(*pc == JSOP_POPN);
|
|
|
|
len = oplen = JSOP_POPN_LENGTH;
|
2007-03-22 10:30:00 -07:00
|
|
|
goto end_groupassignment;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
/* FALL THROUGH */
|
|
|
|
|
|
|
|
case JSOP_BINDNAME:
|
|
|
|
todo = Sprint(&ss->sprinter, "");
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_TRY:
|
|
|
|
js_printf(CLEAR_MAYBE_BRACE(jp), "\ttry {\n");
|
|
|
|
jp->indent += 4;
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_FINALLY:
|
|
|
|
jp->indent -= 4;
|
|
|
|
js_printf(CLEAR_MAYBE_BRACE(jp), "\t} finally {\n");
|
|
|
|
jp->indent += 4;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We must push an empty string placeholder for gosub's return
|
|
|
|
* address, popped by JSOP_RETSUB and counted by script->depth
|
|
|
|
* but not by ss->top (see JSOP_SETSP, below).
|
|
|
|
*/
|
|
|
|
todo = Sprint(&ss->sprinter, exception_cookie);
|
|
|
|
if (todo < 0 || !PushOff(ss, todo, op))
|
|
|
|
return NULL;
|
|
|
|
todo = Sprint(&ss->sprinter, retsub_pc_cookie);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_RETSUB:
|
|
|
|
rval = POP_STR();
|
|
|
|
LOCAL_ASSERT(strcmp(rval, retsub_pc_cookie) == 0);
|
|
|
|
lval = POP_STR();
|
|
|
|
LOCAL_ASSERT(strcmp(lval, exception_cookie) == 0);
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_SWAP:
|
|
|
|
/*
|
|
|
|
* We don't generate this opcode currently, and previously we
|
|
|
|
* did not need to decompile it. If old, serialized bytecode
|
|
|
|
* uses it still, we should fall through and set todo = -2.
|
|
|
|
*/
|
|
|
|
/* FALL THROUGH */
|
|
|
|
|
|
|
|
case JSOP_GOSUB:
|
|
|
|
case JSOP_GOSUBX:
|
|
|
|
/*
|
|
|
|
* JSOP_GOSUB and GOSUBX have no effect on the decompiler's
|
|
|
|
* string stack because the next op in bytecode order finds
|
|
|
|
* the stack balanced by a JSOP_RETSUB executed elsewhere.
|
|
|
|
*/
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_SETSP:
|
2007-05-06 23:40:10 -07:00
|
|
|
case JSOP_POPN:
|
2007-03-22 10:30:00 -07:00
|
|
|
{
|
|
|
|
uintN newtop, oldtop, i;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The compiler models operand stack depth and fixes the stack
|
|
|
|
* pointer on entry to a catch clause based on its depth model.
|
|
|
|
* The decompiler must match the code generator's model, which
|
|
|
|
* is why JSOP_FINALLY pushes a cookie that JSOP_RETSUB pops.
|
|
|
|
*/
|
2007-05-06 23:40:10 -07:00
|
|
|
newtop = GET_UINT16(pc);
|
2007-03-22 10:30:00 -07:00
|
|
|
oldtop = ss->top;
|
2007-05-06 23:40:10 -07:00
|
|
|
if (op == JSOP_POPN)
|
|
|
|
newtop = oldtop - newtop;
|
2007-03-22 10:30:00 -07:00
|
|
|
LOCAL_ASSERT(newtop <= oldtop);
|
|
|
|
todo = -2;
|
|
|
|
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
2007-05-06 23:40:10 -07:00
|
|
|
if (sn && SN_TYPE(sn) == SRC_HIDDEN)
|
|
|
|
break;
|
|
|
|
#if JS_HAS_DESTRUCTURING
|
2007-03-22 10:30:00 -07:00
|
|
|
if (sn && SN_TYPE(sn) == SRC_GROUPASSIGN) {
|
|
|
|
todo = Sprint(&ss->sprinter, "%s[] = [",
|
|
|
|
VarPrefix(sn));
|
|
|
|
if (todo < 0)
|
|
|
|
return NULL;
|
|
|
|
for (i = newtop; i < oldtop; i++) {
|
|
|
|
rval = OFF2STR(&ss->sprinter, ss->offsets[i]);
|
|
|
|
if (Sprint(&ss->sprinter, ss_format,
|
|
|
|
(i == newtop) ? "" : ", ",
|
|
|
|
(i == oldtop - 1 && *rval == '\0')
|
|
|
|
? ", " : rval) < 0) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (SprintPut(&ss->sprinter, "]", 1) < 0)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Kill newtop before the end_groupassignment: label by
|
|
|
|
* retracting/popping early. Control will either jump to
|
|
|
|
* do_forloop: or do_letheadbody: or else break from our
|
|
|
|
* case JSOP_SETSP: after the switch (*pc2) below.
|
|
|
|
*/
|
|
|
|
if (newtop < oldtop) {
|
|
|
|
ss->sprinter.offset = GetOff(ss, newtop);
|
|
|
|
ss->top = newtop;
|
|
|
|
}
|
|
|
|
|
|
|
|
end_groupassignment:
|
|
|
|
/*
|
|
|
|
* Thread directly to the next opcode if we can, to handle
|
|
|
|
* the special cases of a group assignment in the first or
|
|
|
|
* last part of a for(;;) loop head, or in a let block or
|
|
|
|
* expression head.
|
|
|
|
*
|
|
|
|
* NB: todo at this point indexes space in ss->sprinter
|
|
|
|
* that is liable to be overwritten. The code below knows
|
|
|
|
* exactly how long rval lives, or else copies it down via
|
|
|
|
* SprintCString.
|
|
|
|
*/
|
|
|
|
rval = OFF2STR(&ss->sprinter, todo);
|
|
|
|
todo = -2;
|
|
|
|
pc2 = pc + oplen;
|
|
|
|
switch (*pc2) {
|
|
|
|
case JSOP_NOP:
|
|
|
|
/* First part of for(;;) or let block/expr head. */
|
|
|
|
sn = js_GetSrcNote(jp->script, pc2);
|
|
|
|
if (sn) {
|
|
|
|
if (SN_TYPE(sn) == SRC_FOR) {
|
|
|
|
pc = pc2;
|
|
|
|
goto do_forloop;
|
|
|
|
}
|
|
|
|
if (SN_TYPE(sn) == SRC_DECL) {
|
|
|
|
if (ss->top == jp->script->depth) {
|
|
|
|
/*
|
|
|
|
* This must be an empty destructuring
|
|
|
|
* in the head of a let whose body block
|
|
|
|
* is also empty.
|
|
|
|
*/
|
|
|
|
pc = pc2 + 1;
|
|
|
|
len = js_GetSrcNoteOffset(sn, 0);
|
|
|
|
LOCAL_ASSERT(pc[len] == JSOP_LEAVEBLOCK);
|
|
|
|
js_printf(jp, "\tlet (%s) {\n", rval);
|
|
|
|
js_printf(jp, "\t}\n");
|
|
|
|
goto end_setsp;
|
|
|
|
}
|
|
|
|
todo = SprintCString(&ss->sprinter, rval);
|
|
|
|
if (todo < 0 || !PushOff(ss, todo, JSOP_NOP))
|
|
|
|
return NULL;
|
|
|
|
op = JSOP_POP;
|
|
|
|
pc = pc2 + 1;
|
|
|
|
goto do_letheadbody;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_GOTO:
|
|
|
|
case JSOP_GOTOX:
|
|
|
|
/* Third part of for(;;) loop head. */
|
|
|
|
cond = GetJumpOffset(pc2, pc2);
|
|
|
|
sn = js_GetSrcNote(jp->script, pc2 + cond - 1);
|
|
|
|
if (sn && SN_TYPE(sn) == SRC_FOR) {
|
|
|
|
todo = SprintCString(&ss->sprinter, rval);
|
|
|
|
saveop = JSOP_NOP;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If control flow reaches this point with todo still -2,
|
|
|
|
* just print rval as an expression statement.
|
|
|
|
*/
|
|
|
|
if (todo == -2)
|
|
|
|
js_printf(jp, "\t%s;\n", rval);
|
|
|
|
end_setsp:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
if (newtop < oldtop) {
|
|
|
|
ss->sprinter.offset = GetOff(ss, newtop);
|
|
|
|
ss->top = newtop;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case JSOP_EXCEPTION:
|
|
|
|
/* The catch decompiler handles this op itself. */
|
|
|
|
LOCAL_ASSERT(JS_FALSE);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_POP:
|
|
|
|
/*
|
|
|
|
* By default, do not automatically parenthesize when popping
|
|
|
|
* a stacked expression decompilation. We auto-parenthesize
|
|
|
|
* only when JSOP_POP is annotated with SRC_PCDELTA, meaning
|
|
|
|
* comma operator.
|
|
|
|
*/
|
|
|
|
op = JSOP_POPV;
|
|
|
|
/* FALL THROUGH */
|
|
|
|
|
|
|
|
case JSOP_POPV:
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
switch (sn ? SN_TYPE(sn) : SRC_NULL) {
|
|
|
|
case SRC_FOR:
|
|
|
|
/* Force parens around 'in' expression at 'for' front. */
|
|
|
|
if (ss->opcodes[ss->top-1] == JSOP_IN)
|
|
|
|
op = JSOP_LSH;
|
|
|
|
rval = POP_STR();
|
|
|
|
todo = -2;
|
|
|
|
goto do_forloop;
|
|
|
|
|
|
|
|
case SRC_PCDELTA:
|
|
|
|
/* Comma operator: use JSOP_POP for correct precedence. */
|
|
|
|
op = JSOP_POP;
|
|
|
|
|
|
|
|
/* Pop and save to avoid blowing stack depth budget. */
|
|
|
|
lval = JS_strdup(cx, POP_STR());
|
|
|
|
if (!lval)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The offset tells distance to the end of the right-hand
|
|
|
|
* operand of the comma operator.
|
|
|
|
*/
|
|
|
|
done = pc + len;
|
|
|
|
pc += js_GetSrcNoteOffset(sn, 0);
|
|
|
|
len = 0;
|
|
|
|
|
|
|
|
if (!Decompile(ss, done, pc - done)) {
|
|
|
|
JS_free(cx, (char *)lval);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Pop Decompile result and print comma expression. */
|
|
|
|
rval = POP_STR();
|
|
|
|
todo = Sprint(&ss->sprinter, "%s, %s", lval, rval);
|
|
|
|
JS_free(cx, (char *)lval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SRC_HIDDEN:
|
|
|
|
/* Hide this pop, it's from a goto in a with or for/in. */
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SRC_DECL:
|
|
|
|
/* This pop is at the end of the let block/expr head. */
|
|
|
|
pc += JSOP_POP_LENGTH;
|
|
|
|
#if JS_HAS_DESTRUCTURING
|
|
|
|
do_letheadbody:
|
|
|
|
#endif
|
|
|
|
len = js_GetSrcNoteOffset(sn, 0);
|
|
|
|
if (pc[len] == JSOP_LEAVEBLOCK) {
|
|
|
|
js_printf(CLEAR_MAYBE_BRACE(jp), "\tlet (%s) {\n",
|
|
|
|
POP_STR());
|
|
|
|
jp->indent += 4;
|
|
|
|
DECOMPILE_CODE(pc, len);
|
|
|
|
jp->indent -= 4;
|
|
|
|
js_printf(jp, "\t}\n");
|
|
|
|
todo = -2;
|
|
|
|
} else {
|
|
|
|
LOCAL_ASSERT(pc[len] == JSOP_LEAVEBLOCKEXPR);
|
|
|
|
|
|
|
|
lval = JS_strdup(cx, POP_STR());
|
|
|
|
if (!lval)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
if (!Decompile(ss, pc, len)) {
|
|
|
|
JS_free(cx, (char *)lval);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
rval = POP_STR();
|
|
|
|
todo = Sprint(&ss->sprinter,
|
|
|
|
(*rval == '{')
|
|
|
|
? "let (%s) (%s)"
|
|
|
|
: "let (%s) %s",
|
|
|
|
lval, rval);
|
|
|
|
JS_free(cx, (char *)lval);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
/* Turn off parens around a yield statement. */
|
|
|
|
if (ss->opcodes[ss->top-1] == JSOP_YIELD)
|
|
|
|
op = JSOP_NOP;
|
|
|
|
|
|
|
|
rval = POP_STR();
|
2007-05-17 16:56:17 -07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Don't emit decompiler-pushed strings that are not
|
|
|
|
* handled by other opcodes. They are pushed onto the
|
|
|
|
* stack to help model the interpreter stack and should
|
|
|
|
* not appear in the decompiler's output.
|
|
|
|
*/
|
|
|
|
if (*rval != '\0' && (rval[0] != '/' || rval[1] != '*')) {
|
2007-03-22 10:30:00 -07:00
|
|
|
#if JS_HAS_BLOCK_SCOPE
|
|
|
|
/*
|
|
|
|
* If a let declaration is the only child of a control
|
|
|
|
* structure that does not require braces, it must not
|
|
|
|
* be braced. If it were braced explicitly, it would
|
|
|
|
* be bracketed by JSOP_ENTERBLOCK/JSOP_LEAVEBLOCK.
|
|
|
|
*/
|
|
|
|
if (jp->braceState == MAYBE_BRACE &&
|
|
|
|
pc + JSOP_POP_LENGTH == endpc &&
|
|
|
|
!strncmp(rval, var_prefix[SRC_DECL_LET], 4) &&
|
|
|
|
rval[4] != '(') {
|
|
|
|
SetDontBrace(jp);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
js_printf(jp,
|
|
|
|
(*rval == '{' ||
|
|
|
|
(strncmp(rval, js_function_str, 8) == 0 &&
|
|
|
|
rval[8] == ' '))
|
|
|
|
? "\t(%s);\n"
|
|
|
|
: "\t%s;\n",
|
|
|
|
rval);
|
2007-05-17 16:56:17 -07:00
|
|
|
} else {
|
|
|
|
LOCAL_ASSERT(*rval == '\0' ||
|
|
|
|
strcmp(rval, exception_cookie) == 0);
|
2007-03-22 10:30:00 -07:00
|
|
|
}
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
}
|
2007-04-04 16:35:30 -07:00
|
|
|
sn = NULL;
|
2007-03-22 10:30:00 -07:00
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_ENDITER:
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
todo = -2;
|
|
|
|
if (sn && SN_TYPE(sn) == SRC_HIDDEN)
|
|
|
|
break;
|
|
|
|
(void) PopOff(ss, op);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_ENTERWITH:
|
|
|
|
LOCAL_ASSERT(!js_GetSrcNote(jp->script, pc));
|
|
|
|
rval = POP_STR();
|
|
|
|
js_printf(SET_MAYBE_BRACE(jp), "\twith (%s) {\n", rval);
|
|
|
|
jp->indent += 4;
|
|
|
|
todo = Sprint(&ss->sprinter, with_cookie);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_LEAVEWITH:
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
todo = -2;
|
|
|
|
if (sn && SN_TYPE(sn) == SRC_HIDDEN)
|
|
|
|
break;
|
|
|
|
rval = POP_STR();
|
|
|
|
LOCAL_ASSERT(strcmp(rval, with_cookie) == 0);
|
|
|
|
jp->indent -= 4;
|
|
|
|
js_printf(jp, "\t}\n");
|
|
|
|
break;
|
|
|
|
|
|
|
|
BEGIN_LITOPX_CASE(JSOP_ENTERBLOCK, 0)
|
|
|
|
{
|
|
|
|
JSAtom **atomv, *smallv[5];
|
|
|
|
JSScopeProperty *sprop;
|
|
|
|
|
|
|
|
obj = ATOM_TO_OBJECT(atom);
|
|
|
|
argc = OBJ_BLOCK_COUNT(cx, obj);
|
|
|
|
if ((size_t)argc <= sizeof smallv / sizeof smallv[0]) {
|
|
|
|
atomv = smallv;
|
|
|
|
} else {
|
|
|
|
atomv = (JSAtom **) JS_malloc(cx, argc * sizeof(JSAtom *));
|
|
|
|
if (!atomv)
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* From here on, control must flow through enterblock_out. */
|
|
|
|
for (sprop = OBJ_SCOPE(obj)->lastProp; sprop;
|
|
|
|
sprop = sprop->parent) {
|
|
|
|
if (!(sprop->flags & SPROP_HAS_SHORTID))
|
|
|
|
continue;
|
|
|
|
LOCAL_ASSERT(sprop->shortid < argc);
|
|
|
|
atomv[sprop->shortid] = JSID_TO_ATOM(sprop->id);
|
|
|
|
}
|
|
|
|
ok = JS_TRUE;
|
|
|
|
for (i = 0; i < argc; i++) {
|
|
|
|
atom = atomv[i];
|
|
|
|
rval = QuoteString(&ss->sprinter, ATOM_TO_STRING(atom), 0);
|
|
|
|
if (!rval ||
|
|
|
|
!PushOff(ss, STR2OFF(&ss->sprinter, rval), op)) {
|
|
|
|
ok = JS_FALSE;
|
|
|
|
goto enterblock_out;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
switch (sn ? SN_TYPE(sn) : SRC_NULL) {
|
|
|
|
#if JS_HAS_BLOCK_SCOPE
|
|
|
|
case SRC_BRACE:
|
|
|
|
js_printf(CLEAR_MAYBE_BRACE(jp), "\t{\n");
|
|
|
|
jp->indent += 4;
|
|
|
|
len = js_GetSrcNoteOffset(sn, 0);
|
|
|
|
ok = Decompile(ss, pc + oplen, len - oplen) != NULL;
|
|
|
|
if (!ok)
|
|
|
|
goto enterblock_out;
|
|
|
|
jp->indent -= 4;
|
|
|
|
js_printf(jp, "\t}\n");
|
|
|
|
break;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
case SRC_CATCH:
|
|
|
|
jp->indent -= 4;
|
|
|
|
js_printf(CLEAR_MAYBE_BRACE(jp), "\t} catch (");
|
|
|
|
|
|
|
|
pc2 = pc;
|
|
|
|
pc += oplen;
|
|
|
|
LOCAL_ASSERT(*pc == JSOP_EXCEPTION);
|
|
|
|
pc += JSOP_EXCEPTION_LENGTH;
|
2007-05-02 00:09:27 -07:00
|
|
|
todo = Sprint(&ss->sprinter, exception_cookie);
|
|
|
|
if (todo < 0 || !PushOff(ss, todo, JSOP_EXCEPTION)) {
|
|
|
|
ok = JS_FALSE;
|
|
|
|
goto enterblock_out;
|
|
|
|
}
|
|
|
|
|
2007-03-22 10:30:00 -07:00
|
|
|
if (*pc == JSOP_DUP) {
|
|
|
|
sn2 = js_GetSrcNote(jp->script, pc);
|
2007-05-02 00:09:27 -07:00
|
|
|
if (!sn2 || SN_TYPE(sn2) != SRC_DESTRUCT) {
|
2007-03-22 10:30:00 -07:00
|
|
|
/*
|
2007-05-02 00:09:27 -07:00
|
|
|
* This is a dup to save the exception for later.
|
|
|
|
* It is emitted only when the catch head contains
|
2007-03-27 23:49:49 -07:00
|
|
|
* an exception guard.
|
2007-03-22 10:30:00 -07:00
|
|
|
*/
|
2007-03-27 23:49:49 -07:00
|
|
|
LOCAL_ASSERT(js_GetSrcNoteOffset(sn, 0) != 0);
|
2007-03-22 10:30:00 -07:00
|
|
|
pc += JSOP_DUP_LENGTH;
|
2007-05-02 00:09:27 -07:00
|
|
|
todo = Sprint(&ss->sprinter, exception_cookie);
|
|
|
|
if (todo < 0 ||
|
|
|
|
!PushOff(ss, todo, JSOP_EXCEPTION)) {
|
|
|
|
ok = JS_FALSE;
|
|
|
|
goto enterblock_out;
|
|
|
|
}
|
2007-03-22 10:30:00 -07:00
|
|
|
}
|
|
|
|
}
|
2007-05-02 00:09:27 -07:00
|
|
|
|
2007-03-22 10:30:00 -07:00
|
|
|
#if JS_HAS_DESTRUCTURING
|
|
|
|
if (*pc == JSOP_DUP) {
|
|
|
|
pc = DecompileDestructuring(ss, pc, endpc);
|
|
|
|
if (!pc) {
|
|
|
|
ok = JS_FALSE;
|
|
|
|
goto enterblock_out;
|
|
|
|
}
|
|
|
|
LOCAL_ASSERT(*pc == JSOP_POP);
|
|
|
|
pc += JSOP_POP_LENGTH;
|
|
|
|
lval = PopStr(ss, JSOP_NOP);
|
|
|
|
js_puts(jp, lval);
|
|
|
|
} else {
|
|
|
|
#endif
|
|
|
|
LOCAL_ASSERT(*pc == JSOP_SETLOCALPOP);
|
|
|
|
i = GET_UINT16(pc);
|
|
|
|
pc += JSOP_SETLOCALPOP_LENGTH;
|
|
|
|
atom = atomv[i - OBJ_BLOCK_DEPTH(cx, obj)];
|
|
|
|
str = ATOM_TO_STRING(atom);
|
|
|
|
if (!QuoteString(&jp->sprinter, str, 0)) {
|
|
|
|
ok = JS_FALSE;
|
|
|
|
goto enterblock_out;
|
|
|
|
}
|
|
|
|
#if JS_HAS_DESTRUCTURING
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2007-05-02 23:39:44 -07:00
|
|
|
/*
|
|
|
|
* Pop the exception_cookie (or its dup in the case of a
|
|
|
|
* guarded catch head) off the stack now.
|
|
|
|
*/
|
|
|
|
rval = PopStr(ss, JSOP_NOP);
|
|
|
|
LOCAL_ASSERT(strcmp(rval, exception_cookie) == 0);
|
|
|
|
|
2007-03-22 10:30:00 -07:00
|
|
|
len = js_GetSrcNoteOffset(sn, 0);
|
|
|
|
if (len) {
|
|
|
|
len -= PTRDIFF(pc, pc2, jsbytecode);
|
|
|
|
LOCAL_ASSERT(len > 0);
|
|
|
|
js_printf(jp, " if ");
|
|
|
|
ok = Decompile(ss, pc, len) != NULL;
|
|
|
|
if (!ok)
|
|
|
|
goto enterblock_out;
|
|
|
|
js_printf(jp, "%s", POP_STR());
|
|
|
|
pc += len;
|
|
|
|
LOCAL_ASSERT(*pc == JSOP_IFEQ || *pc == JSOP_IFEQX);
|
|
|
|
pc += js_CodeSpec[*pc].length;
|
|
|
|
}
|
|
|
|
|
|
|
|
js_printf(jp, ") {\n");
|
|
|
|
jp->indent += 4;
|
|
|
|
len = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
todo = -2;
|
|
|
|
|
|
|
|
enterblock_out:
|
|
|
|
if (atomv != smallv)
|
|
|
|
JS_free(cx, atomv);
|
|
|
|
if (!ok)
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
END_LITOPX_CASE
|
|
|
|
|
|
|
|
case JSOP_LEAVEBLOCK:
|
|
|
|
case JSOP_LEAVEBLOCKEXPR:
|
|
|
|
{
|
|
|
|
uintN top, depth;
|
|
|
|
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
todo = -2;
|
|
|
|
if (op == JSOP_LEAVEBLOCKEXPR) {
|
|
|
|
LOCAL_ASSERT(SN_TYPE(sn) == SRC_PCBASE);
|
|
|
|
rval = POP_STR();
|
|
|
|
} else if (sn) {
|
|
|
|
LOCAL_ASSERT(op == JSOP_LEAVEBLOCK);
|
|
|
|
if (SN_TYPE(sn) == SRC_HIDDEN)
|
|
|
|
break;
|
2007-05-02 00:09:27 -07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* This JSOP_LEAVEBLOCK must be for a catch block. If sn's
|
|
|
|
* offset does not equal the model stack depth, there must
|
|
|
|
* be a copy of the exception value on the stack due to a
|
|
|
|
* catch guard (see above, the JSOP_ENTERBLOCK + SRC_CATCH
|
|
|
|
* case code).
|
|
|
|
*/
|
2007-03-22 10:30:00 -07:00
|
|
|
LOCAL_ASSERT(SN_TYPE(sn) == SRC_CATCH);
|
2007-05-02 00:09:27 -07:00
|
|
|
if ((uintN)js_GetSrcNoteOffset(sn, 0) != ss->top) {
|
|
|
|
LOCAL_ASSERT((uintN)js_GetSrcNoteOffset(sn, 0)
|
|
|
|
== ss->top - 1);
|
|
|
|
rval = POP_STR();
|
|
|
|
LOCAL_ASSERT(strcmp(rval, exception_cookie) == 0);
|
|
|
|
}
|
2007-03-22 10:30:00 -07:00
|
|
|
}
|
|
|
|
top = ss->top;
|
|
|
|
depth = GET_UINT16(pc);
|
|
|
|
LOCAL_ASSERT(top >= depth);
|
|
|
|
top -= depth;
|
|
|
|
ss->top = top;
|
|
|
|
ss->sprinter.offset = GetOff(ss, top);
|
|
|
|
if (op == JSOP_LEAVEBLOCKEXPR)
|
|
|
|
todo = SprintCString(&ss->sprinter, rval);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case JSOP_CALLLOCAL:
|
|
|
|
case JSOP_GETLOCAL:
|
|
|
|
i = GET_UINT16(pc);
|
|
|
|
LOCAL_ASSERT((uintN)i < ss->top);
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
|
|
|
|
#if JS_HAS_DESTRUCTURING
|
|
|
|
if (sn && SN_TYPE(sn) == SRC_GROUPASSIGN) {
|
|
|
|
pc = DecompileGroupAssignment(ss, pc, endpc, sn, &todo);
|
|
|
|
if (!pc)
|
|
|
|
return NULL;
|
2007-05-06 23:40:10 -07:00
|
|
|
LOCAL_ASSERT(*pc == JSOP_POPN);
|
|
|
|
len = oplen = JSOP_POPN_LENGTH;
|
2007-03-22 10:30:00 -07:00
|
|
|
goto end_groupassignment;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
rval = GetLocal(ss, i);
|
|
|
|
todo = Sprint(&ss->sprinter, ss_format, VarPrefix(sn), rval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_SETLOCAL:
|
|
|
|
case JSOP_SETLOCALPOP:
|
|
|
|
i = GET_UINT16(pc);
|
|
|
|
lval = GetStr(ss, i);
|
|
|
|
rval = POP_STR();
|
|
|
|
goto do_setlval;
|
|
|
|
|
|
|
|
case JSOP_INCLOCAL:
|
|
|
|
case JSOP_DECLOCAL:
|
|
|
|
i = GET_UINT16(pc);
|
|
|
|
lval = GetLocal(ss, i);
|
|
|
|
goto do_inclval;
|
|
|
|
|
|
|
|
case JSOP_LOCALINC:
|
|
|
|
case JSOP_LOCALDEC:
|
|
|
|
i = GET_UINT16(pc);
|
|
|
|
lval = GetLocal(ss, i);
|
|
|
|
goto do_lvalinc;
|
|
|
|
|
|
|
|
case JSOP_FORLOCAL:
|
|
|
|
i = GET_UINT16(pc);
|
|
|
|
lval = GetStr(ss, i);
|
|
|
|
atom = NULL;
|
|
|
|
goto do_forlvalinloop;
|
|
|
|
|
|
|
|
case JSOP_RETRVAL:
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_SETRVAL:
|
|
|
|
case JSOP_RETURN:
|
|
|
|
rval = POP_STR();
|
|
|
|
if (*rval != '\0')
|
|
|
|
js_printf(jp, "\t%s %s;\n", js_return_str, rval);
|
|
|
|
else
|
|
|
|
js_printf(jp, "\t%s;\n", js_return_str);
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
|
|
|
|
#if JS_HAS_GENERATORS
|
|
|
|
case JSOP_YIELD:
|
|
|
|
op = JSOP_SETNAME; /* turn off most parens */
|
2007-05-17 18:41:17 -07:00
|
|
|
|
|
|
|
if (!ss->inGenExp || !(sn = js_GetSrcNote(jp->script, pc))) {
|
|
|
|
rval = POP_STR();
|
|
|
|
todo = (*rval != '\0')
|
|
|
|
? Sprint(&ss->sprinter,
|
|
|
|
(strncmp(rval, js_yield_str, 5) == 0 &&
|
|
|
|
(rval[5] == ' ' || rval[5] == '\0'))
|
|
|
|
? "%s (%s)"
|
|
|
|
: "%s %s",
|
|
|
|
js_yield_str, rval)
|
|
|
|
: SprintCString(&ss->sprinter, js_yield_str);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
LOCAL_ASSERT(SN_TYPE(sn) == SRC_HIDDEN);
|
|
|
|
/* FALL THROUGH */
|
2007-03-22 10:30:00 -07:00
|
|
|
|
|
|
|
case JSOP_ARRAYPUSH:
|
|
|
|
{
|
2007-05-17 18:41:17 -07:00
|
|
|
uintN pos, forpos;
|
2007-03-22 10:30:00 -07:00
|
|
|
ptrdiff_t start;
|
|
|
|
|
2007-05-17 18:41:17 -07:00
|
|
|
/* Pop the expression being pushed or yielded. */
|
2007-03-22 10:30:00 -07:00
|
|
|
rval = POP_STR();
|
2007-05-17 18:41:17 -07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Skip down over iterables left stacked by JSOP_FOR* until
|
|
|
|
* we hit a block-local or the new Array initialiser (empty
|
|
|
|
* destructuring patterns yield zero-count blocks).
|
|
|
|
*/
|
2007-03-22 10:30:00 -07:00
|
|
|
pos = ss->top;
|
|
|
|
while ((op = ss->opcodes[--pos]) != JSOP_ENTERBLOCK &&
|
|
|
|
op != JSOP_NEWINIT) {
|
2007-05-17 18:41:17 -07:00
|
|
|
if (pos == 0)
|
|
|
|
break;
|
2007-03-22 10:30:00 -07:00
|
|
|
}
|
2007-05-17 18:41:17 -07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Make forpos index the space before the left-most |for| in
|
|
|
|
* the single string of accumulated |for| heads and optional
|
|
|
|
* final |if (condition)|.
|
|
|
|
*/
|
|
|
|
forpos = pos + (op == JSOP_ENTERBLOCK || op == JSOP_NEWINIT);
|
|
|
|
LOCAL_ASSERT(forpos < ss->top);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Now skip down over the block's local slots, if any. There
|
|
|
|
* may be no locals for an empty destructuring pattern.
|
|
|
|
*/
|
2007-03-22 10:30:00 -07:00
|
|
|
while (ss->opcodes[pos] == JSOP_ENTERBLOCK) {
|
|
|
|
if (pos == 0)
|
|
|
|
break;
|
|
|
|
--pos;
|
|
|
|
}
|
2007-05-17 18:41:17 -07:00
|
|
|
|
|
|
|
if (saveop == JSOP_YIELD) {
|
|
|
|
/*
|
|
|
|
* Generator expression: decompile just rval followed by
|
|
|
|
* the string starting at forpos. Leave the result string
|
|
|
|
* in ss->offsets[0] so it can be recovered by our caller
|
|
|
|
* (the JSOP_ANONFUNOBJ with SRC_GENEXP case). Bump the
|
|
|
|
* top of stack to balance yield, which is an expression
|
|
|
|
* (so has neutral stack balance).
|
|
|
|
*/
|
|
|
|
LOCAL_ASSERT(pos == 0);
|
|
|
|
xval = OFF2STR(&ss->sprinter, ss->offsets[forpos]);
|
|
|
|
ss->sprinter.offset = PAREN_SLOP;
|
|
|
|
todo = Sprint(&ss->sprinter, ss_format, rval, xval);
|
|
|
|
if (todo < 0)
|
|
|
|
return NULL;
|
|
|
|
ss->offsets[0] = todo;
|
|
|
|
++ss->top;
|
|
|
|
return pc;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Array comprehension: retract the sprinter to the beginning
|
|
|
|
* of the array initialiser and decompile "[<rval> for ...]".
|
|
|
|
*/
|
2007-03-22 10:30:00 -07:00
|
|
|
LOCAL_ASSERT(ss->opcodes[pos] == JSOP_NEWINIT);
|
|
|
|
start = ss->offsets[pos];
|
|
|
|
LOCAL_ASSERT(ss->sprinter.base[start] == '[' ||
|
|
|
|
ss->sprinter.base[start] == '#');
|
2007-05-17 18:41:17 -07:00
|
|
|
LOCAL_ASSERT(forpos < ss->top);
|
|
|
|
xval = OFF2STR(&ss->sprinter, ss->offsets[forpos]);
|
2007-03-22 10:30:00 -07:00
|
|
|
lval = OFF2STR(&ss->sprinter, start);
|
|
|
|
RETRACT(&ss->sprinter, lval);
|
2007-05-17 18:41:17 -07:00
|
|
|
|
2007-03-22 10:30:00 -07:00
|
|
|
todo = Sprint(&ss->sprinter, "%s%s%.*s",
|
|
|
|
lval, rval, rval - xval, xval);
|
|
|
|
if (todo < 0)
|
|
|
|
return NULL;
|
2007-05-17 18:41:17 -07:00
|
|
|
ss->offsets[pos] = todo;
|
2007-03-22 10:30:00 -07:00
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
case JSOP_THROWING:
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_THROW:
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
todo = -2;
|
|
|
|
if (sn && SN_TYPE(sn) == SRC_HIDDEN)
|
|
|
|
break;
|
|
|
|
rval = POP_STR();
|
2007-05-06 03:50:07 -07:00
|
|
|
js_printf(jp, "\t%s %s;\n", js_throw_str, rval);
|
2007-03-22 10:30:00 -07:00
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_GOTO:
|
|
|
|
case JSOP_GOTOX:
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
switch (sn ? SN_TYPE(sn) : SRC_NULL) {
|
|
|
|
case SRC_WHILE:
|
|
|
|
cond = GetJumpOffset(pc, pc);
|
|
|
|
tail = js_GetSrcNoteOffset(sn, 0);
|
|
|
|
DECOMPILE_CODE(pc + cond, tail - cond);
|
|
|
|
rval = POP_STR();
|
|
|
|
js_printf(SET_MAYBE_BRACE(jp), "\twhile (%s) {\n", rval);
|
|
|
|
jp->indent += 4;
|
|
|
|
DECOMPILE_CODE(pc + oplen, cond - oplen);
|
|
|
|
jp->indent -= 4;
|
|
|
|
js_printf(jp, "\t}\n");
|
|
|
|
pc += tail;
|
|
|
|
LOCAL_ASSERT(*pc == JSOP_IFNE || *pc == JSOP_IFNEX);
|
|
|
|
len = js_CodeSpec[*pc].length;
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SRC_CONT2LABEL:
|
|
|
|
atom = js_GetAtom(cx, &jp->script->atomMap,
|
|
|
|
(jsatomid) js_GetSrcNoteOffset(sn, 0));
|
|
|
|
rval = QuoteString(&ss->sprinter, ATOM_TO_STRING(atom), 0);
|
|
|
|
if (!rval)
|
|
|
|
return NULL;
|
|
|
|
RETRACT(&ss->sprinter, rval);
|
|
|
|
js_printf(jp, "\tcontinue %s;\n", rval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SRC_CONTINUE:
|
|
|
|
js_printf(jp, "\tcontinue;\n");
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SRC_BREAK2LABEL:
|
|
|
|
atom = js_GetAtom(cx, &jp->script->atomMap,
|
|
|
|
(jsatomid) js_GetSrcNoteOffset(sn, 0));
|
|
|
|
rval = QuoteString(&ss->sprinter, ATOM_TO_STRING(atom), 0);
|
|
|
|
if (!rval)
|
|
|
|
return NULL;
|
|
|
|
RETRACT(&ss->sprinter, rval);
|
|
|
|
js_printf(jp, "\tbreak %s;\n", rval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SRC_HIDDEN:
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
js_printf(jp, "\tbreak;\n");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_IFEQ:
|
|
|
|
case JSOP_IFEQX:
|
|
|
|
{
|
|
|
|
JSBool elseif = JS_FALSE;
|
|
|
|
|
|
|
|
if_again:
|
|
|
|
len = GetJumpOffset(pc, pc);
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
|
|
|
|
switch (sn ? SN_TYPE(sn) : SRC_NULL) {
|
|
|
|
case SRC_IF:
|
|
|
|
case SRC_IF_ELSE:
|
|
|
|
op = JSOP_NOP; /* turn off parens */
|
|
|
|
rval = POP_STR();
|
2007-05-17 18:41:17 -07:00
|
|
|
if (ss->inArrayInit || ss->inGenExp) {
|
2007-03-22 10:30:00 -07:00
|
|
|
LOCAL_ASSERT(SN_TYPE(sn) == SRC_IF);
|
2007-05-17 18:41:17 -07:00
|
|
|
ss->sprinter.offset -= PAREN_SLOP;
|
2007-03-22 10:30:00 -07:00
|
|
|
if (Sprint(&ss->sprinter, " if (%s)", rval) < 0)
|
|
|
|
return NULL;
|
2007-05-17 18:41:17 -07:00
|
|
|
AddParenSlop(ss);
|
2007-03-22 10:30:00 -07:00
|
|
|
} else {
|
|
|
|
js_printf(SET_MAYBE_BRACE(jp),
|
|
|
|
elseif ? " if (%s) {\n" : "\tif (%s) {\n",
|
|
|
|
rval);
|
|
|
|
jp->indent += 4;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (SN_TYPE(sn) == SRC_IF) {
|
|
|
|
DECOMPILE_CODE(pc + oplen, len - oplen);
|
|
|
|
} else {
|
2007-05-17 18:41:17 -07:00
|
|
|
LOCAL_ASSERT(!ss->inArrayInit && !ss->inGenExp);
|
2007-03-22 10:30:00 -07:00
|
|
|
tail = js_GetSrcNoteOffset(sn, 0);
|
|
|
|
DECOMPILE_CODE(pc + oplen, tail - oplen);
|
|
|
|
jp->indent -= 4;
|
|
|
|
pc += tail;
|
|
|
|
LOCAL_ASSERT(*pc == JSOP_GOTO || *pc == JSOP_GOTOX);
|
|
|
|
oplen = js_CodeSpec[*pc].length;
|
|
|
|
len = GetJumpOffset(pc, pc);
|
|
|
|
js_printf(jp, "\t} else");
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If the second offset for sn is non-zero, it tells
|
|
|
|
* the distance from the goto around the else, to the
|
|
|
|
* ifeq for the if inside the else that forms an "if
|
|
|
|
* else if" chain. Thus cond spans the condition of
|
|
|
|
* the second if, so we simply decompile it and start
|
|
|
|
* over at label if_again.
|
|
|
|
*/
|
|
|
|
cond = js_GetSrcNoteOffset(sn, 1);
|
|
|
|
if (cond != 0) {
|
|
|
|
DECOMPILE_CODE(pc + oplen, cond - oplen);
|
|
|
|
pc += cond;
|
|
|
|
elseif = JS_TRUE;
|
|
|
|
goto if_again;
|
|
|
|
}
|
|
|
|
|
|
|
|
js_printf(SET_MAYBE_BRACE(jp), " {\n");
|
|
|
|
jp->indent += 4;
|
|
|
|
DECOMPILE_CODE(pc + oplen, len - oplen);
|
|
|
|
}
|
|
|
|
|
2007-05-17 18:41:17 -07:00
|
|
|
if (!ss->inArrayInit && !ss->inGenExp) {
|
2007-03-22 10:30:00 -07:00
|
|
|
jp->indent -= 4;
|
|
|
|
js_printf(jp, "\t}\n");
|
|
|
|
}
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SRC_COND:
|
|
|
|
xval = JS_strdup(cx, POP_STR());
|
|
|
|
if (!xval)
|
|
|
|
return NULL;
|
|
|
|
len = js_GetSrcNoteOffset(sn, 0);
|
|
|
|
DECOMPILE_CODE(pc + oplen, len - oplen);
|
|
|
|
lval = JS_strdup(cx, POP_STR());
|
|
|
|
if (!lval) {
|
|
|
|
JS_free(cx, (void *)xval);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
pc += len;
|
|
|
|
LOCAL_ASSERT(*pc == JSOP_GOTO || *pc == JSOP_GOTOX);
|
|
|
|
oplen = js_CodeSpec[*pc].length;
|
|
|
|
len = GetJumpOffset(pc, pc);
|
|
|
|
DECOMPILE_CODE(pc + oplen, len - oplen);
|
|
|
|
rval = POP_STR();
|
|
|
|
todo = Sprint(&ss->sprinter, "%s ? %s : %s",
|
|
|
|
xval, lval, rval);
|
|
|
|
JS_free(cx, (void *)xval);
|
|
|
|
JS_free(cx, (void *)lval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case JSOP_IFNE:
|
|
|
|
case JSOP_IFNEX:
|
|
|
|
LOCAL_ASSERT(0);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_OR:
|
|
|
|
case JSOP_ORX:
|
|
|
|
xval = "||";
|
|
|
|
|
|
|
|
do_logical_connective:
|
|
|
|
/* Top of stack is the first clause in a disjunction (||). */
|
|
|
|
lval = JS_strdup(cx, POP_STR());
|
|
|
|
if (!lval)
|
|
|
|
return NULL;
|
|
|
|
done = pc + GetJumpOffset(pc, pc);
|
|
|
|
pc += len;
|
|
|
|
len = PTRDIFF(done, pc, jsbytecode);
|
|
|
|
DECOMPILE_CODE(pc, len);
|
|
|
|
rval = POP_STR();
|
|
|
|
if (jp->pretty &&
|
|
|
|
jp->indent + 4 + strlen(lval) + 4 + strlen(rval) > 75) {
|
|
|
|
rval = JS_strdup(cx, rval);
|
|
|
|
if (!rval) {
|
|
|
|
tail = -1;
|
|
|
|
} else {
|
|
|
|
todo = Sprint(&ss->sprinter, "%s %s\n", lval, xval);
|
|
|
|
tail = Sprint(&ss->sprinter, "%*s%s",
|
|
|
|
jp->indent + 4, "", rval);
|
|
|
|
JS_free(cx, (char *)rval);
|
|
|
|
}
|
|
|
|
if (tail < 0)
|
|
|
|
todo = -1;
|
|
|
|
} else {
|
|
|
|
todo = Sprint(&ss->sprinter, "%s %s %s", lval, xval, rval);
|
|
|
|
}
|
|
|
|
JS_free(cx, (char *)lval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_AND:
|
|
|
|
case JSOP_ANDX:
|
|
|
|
xval = "&&";
|
|
|
|
goto do_logical_connective;
|
|
|
|
|
|
|
|
case JSOP_FORARG:
|
|
|
|
atom = GetSlotAtom(jp, js_GetArgument, GET_ARGNO(pc));
|
|
|
|
LOCAL_ASSERT(atom);
|
|
|
|
goto do_fornameinloop;
|
|
|
|
|
|
|
|
case JSOP_FORVAR:
|
|
|
|
case JSOP_FORCONST:
|
|
|
|
atom = GetSlotAtom(jp, js_GetLocalVariable, GET_VARNO(pc));
|
|
|
|
LOCAL_ASSERT(atom);
|
|
|
|
goto do_fornameinloop;
|
|
|
|
|
|
|
|
case JSOP_FORNAME:
|
|
|
|
LOAD_ATOM(0);
|
|
|
|
|
|
|
|
do_fornameinloop:
|
|
|
|
lval = "";
|
|
|
|
do_forlvalinloop:
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
xval = NULL;
|
|
|
|
goto do_forinloop;
|
|
|
|
|
|
|
|
case JSOP_FORPROP:
|
|
|
|
xval = NULL;
|
|
|
|
LOAD_ATOM(0);
|
|
|
|
if (!ATOM_IS_IDENTIFIER(atom)) {
|
|
|
|
xval = QuoteString(&ss->sprinter, ATOM_TO_STRING(atom),
|
|
|
|
(jschar)'\'');
|
|
|
|
if (!xval)
|
|
|
|
return NULL;
|
|
|
|
atom = NULL;
|
|
|
|
}
|
|
|
|
lval = POP_STR();
|
|
|
|
sn = NULL;
|
|
|
|
|
|
|
|
do_forinloop:
|
|
|
|
pc += oplen;
|
|
|
|
LOCAL_ASSERT(*pc == JSOP_IFEQ || *pc == JSOP_IFEQX);
|
|
|
|
oplen = js_CodeSpec[*pc].length;
|
|
|
|
len = GetJumpOffset(pc, pc);
|
|
|
|
sn2 = js_GetSrcNote(jp->script, pc);
|
|
|
|
tail = js_GetSrcNoteOffset(sn2, 0);
|
|
|
|
|
|
|
|
do_forinhead:
|
|
|
|
if (!atom && xval) {
|
|
|
|
/*
|
|
|
|
* If xval is not a dummy empty string, we have to strdup
|
|
|
|
* it to save it from being clobbered by the first Sprint
|
|
|
|
* below. Standard dumb decompiler operating procedure!
|
|
|
|
*/
|
|
|
|
if (*xval == '\0') {
|
|
|
|
xval = NULL;
|
|
|
|
} else {
|
|
|
|
xval = JS_strdup(cx, xval);
|
|
|
|
if (!xval)
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#if JS_HAS_XML_SUPPORT
|
|
|
|
if (foreach) {
|
|
|
|
foreach = JS_FALSE;
|
|
|
|
todo = Sprint(&ss->sprinter, "for %s (%s%s",
|
|
|
|
js_each_str, VarPrefix(sn), lval);
|
|
|
|
} else
|
|
|
|
#endif
|
|
|
|
{
|
|
|
|
todo = Sprint(&ss->sprinter, "for (%s%s",
|
|
|
|
VarPrefix(sn), lval);
|
|
|
|
}
|
|
|
|
if (atom) {
|
|
|
|
if (*lval && SprintPut(&ss->sprinter, ".", 1) < 0)
|
|
|
|
return NULL;
|
|
|
|
xval = QuoteString(&ss->sprinter, ATOM_TO_STRING(atom), 0);
|
|
|
|
if (!xval)
|
|
|
|
return NULL;
|
|
|
|
} else if (xval) {
|
|
|
|
LOCAL_ASSERT(*xval != '\0');
|
|
|
|
ok = (Sprint(&ss->sprinter,
|
|
|
|
(js_CodeSpec[lastop].format & JOF_XMLNAME)
|
|
|
|
? ".%s"
|
|
|
|
: "[%s]",
|
|
|
|
xval)
|
|
|
|
>= 0);
|
|
|
|
JS_free(cx, (char *)xval);
|
|
|
|
if (!ok)
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
if (todo < 0)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
lval = OFF2STR(&ss->sprinter, todo);
|
|
|
|
rval = GetStr(ss, ss->top-1);
|
|
|
|
RETRACT(&ss->sprinter, rval);
|
2007-05-17 18:41:17 -07:00
|
|
|
if (ss->inArrayInit || ss->inGenExp) {
|
|
|
|
if (ss->top > 1 &&
|
|
|
|
(js_CodeSpec[ss->opcodes[ss->top-2]].format &
|
|
|
|
JOF_FOR)) {
|
|
|
|
ss->sprinter.offset -= PAREN_SLOP;
|
|
|
|
}
|
2007-03-22 10:30:00 -07:00
|
|
|
todo = Sprint(&ss->sprinter, " %s in %s)", lval, rval);
|
|
|
|
if (todo < 0)
|
|
|
|
return NULL;
|
|
|
|
ss->offsets[ss->top-1] = todo;
|
2007-05-17 18:41:17 -07:00
|
|
|
ss->opcodes[ss->top-1] = op;
|
|
|
|
AddParenSlop(ss);
|
2007-03-22 10:30:00 -07:00
|
|
|
DECOMPILE_CODE(pc + oplen, tail - oplen);
|
|
|
|
} else {
|
|
|
|
js_printf(SET_MAYBE_BRACE(jp), "\t%s in %s) {\n",
|
|
|
|
lval, rval);
|
|
|
|
jp->indent += 4;
|
|
|
|
DECOMPILE_CODE(pc + oplen, tail - oplen);
|
|
|
|
jp->indent -= 4;
|
|
|
|
js_printf(jp, "\t}\n");
|
|
|
|
}
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_FORELEM:
|
|
|
|
pc++;
|
|
|
|
LOCAL_ASSERT(*pc == JSOP_IFEQ || *pc == JSOP_IFEQX);
|
|
|
|
len = js_CodeSpec[*pc].length;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Arrange for the JSOP_ENUMELEM case to set tail for use by
|
|
|
|
* do_forinhead: code that uses on it to find the loop-closing
|
|
|
|
* jump (whatever its format, normal or extended), in order to
|
|
|
|
* bound the recursively decompiled loop body.
|
|
|
|
*/
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
LOCAL_ASSERT(!forelem_tail);
|
|
|
|
forelem_tail = pc + js_GetSrcNoteOffset(sn, 0);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This gets a little wacky. Only the length of the for loop
|
|
|
|
* body PLUS the element-indexing expression is known here, so
|
|
|
|
* we pass the after-loop pc to the JSOP_ENUMELEM case, which
|
|
|
|
* is immediately below, to decompile that helper bytecode via
|
|
|
|
* the 'forelem_done' local.
|
|
|
|
*
|
|
|
|
* Since a for..in loop can't nest in the head of another for
|
|
|
|
* loop, we can use forelem_{tail,done} singletons to remember
|
|
|
|
* state from JSOP_FORELEM to JSOP_ENUMELEM, thence (via goto)
|
|
|
|
* to label do_forinhead.
|
|
|
|
*/
|
|
|
|
LOCAL_ASSERT(!forelem_done);
|
|
|
|
forelem_done = pc + GetJumpOffset(pc, pc);
|
|
|
|
|
|
|
|
/* Our net stack balance after forelem;ifeq is +1. */
|
|
|
|
todo = SprintCString(&ss->sprinter, forelem_cookie);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_ENUMELEM:
|
|
|
|
case JSOP_ENUMCONSTELEM:
|
|
|
|
/*
|
|
|
|
* The stack has the object under the (top) index expression.
|
|
|
|
* The "rval" property id is underneath those two on the stack.
|
|
|
|
* The for loop body net and gross lengths can now be adjusted
|
|
|
|
* to account for the length of the indexing expression that
|
|
|
|
* came after JSOP_FORELEM and before JSOP_ENUMELEM.
|
|
|
|
*/
|
|
|
|
atom = NULL;
|
2007-04-04 16:35:30 -07:00
|
|
|
op = JSOP_NOP; /* turn off parens around xval */
|
2007-03-22 10:30:00 -07:00
|
|
|
xval = POP_STR();
|
|
|
|
op = JSOP_GETELEM; /* lval must have high precedence */
|
|
|
|
lval = POP_STR();
|
|
|
|
op = saveop;
|
|
|
|
rval = POP_STR();
|
|
|
|
LOCAL_ASSERT(strcmp(rval, forelem_cookie) == 0);
|
|
|
|
LOCAL_ASSERT(forelem_tail > pc);
|
|
|
|
tail = forelem_tail - pc;
|
|
|
|
forelem_tail = NULL;
|
|
|
|
LOCAL_ASSERT(forelem_done > pc);
|
|
|
|
len = forelem_done - pc;
|
|
|
|
forelem_done = NULL;
|
|
|
|
goto do_forinhead;
|
|
|
|
|
|
|
|
#if JS_HAS_GETTER_SETTER
|
|
|
|
case JSOP_GETTER:
|
|
|
|
case JSOP_SETTER:
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
case JSOP_DUP2:
|
|
|
|
rval = GetStr(ss, ss->top-2);
|
|
|
|
todo = SprintCString(&ss->sprinter, rval);
|
|
|
|
if (todo < 0 || !PushOff(ss, todo, ss->opcodes[ss->top-2]))
|
|
|
|
return NULL;
|
|
|
|
/* FALL THROUGH */
|
|
|
|
|
|
|
|
case JSOP_DUP:
|
|
|
|
#if JS_HAS_DESTRUCTURING
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
if (sn) {
|
|
|
|
LOCAL_ASSERT(SN_TYPE(sn) == SRC_DESTRUCT);
|
|
|
|
pc = DecompileDestructuring(ss, pc, endpc);
|
|
|
|
if (!pc)
|
|
|
|
return NULL;
|
|
|
|
len = 0;
|
|
|
|
lval = POP_STR();
|
|
|
|
op = saveop = JSOP_ENUMELEM;
|
|
|
|
rval = POP_STR();
|
|
|
|
|
|
|
|
if (strcmp(rval, forelem_cookie) == 0) {
|
|
|
|
LOCAL_ASSERT(forelem_tail > pc);
|
|
|
|
tail = forelem_tail - pc;
|
|
|
|
forelem_tail = NULL;
|
|
|
|
LOCAL_ASSERT(forelem_done > pc);
|
|
|
|
len = forelem_done - pc;
|
|
|
|
forelem_done = NULL;
|
|
|
|
xval = NULL;
|
|
|
|
atom = NULL;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Null sn if this is a 'for (var [k, v] = i in o)'
|
|
|
|
* loop, because 'var [k, v = i;' has already been
|
|
|
|
* hoisted.
|
|
|
|
*/
|
|
|
|
if (js_GetSrcNoteOffset(sn, 0) == SRC_DECL_VAR)
|
|
|
|
sn = NULL;
|
|
|
|
goto do_forinhead;
|
|
|
|
}
|
|
|
|
|
|
|
|
todo = Sprint(&ss->sprinter, "%s%s = %s",
|
|
|
|
VarPrefix(sn), lval, rval);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
rval = GetStr(ss, ss->top-1);
|
|
|
|
saveop = ss->opcodes[ss->top-1];
|
|
|
|
todo = SprintCString(&ss->sprinter, rval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_SETARG:
|
|
|
|
atom = GetSlotAtom(jp, js_GetArgument, GET_ARGNO(pc));
|
|
|
|
LOCAL_ASSERT(atom);
|
|
|
|
goto do_setname;
|
|
|
|
|
|
|
|
case JSOP_SETVAR:
|
|
|
|
atom = GetSlotAtom(jp, js_GetLocalVariable, GET_VARNO(pc));
|
|
|
|
LOCAL_ASSERT(atom);
|
|
|
|
goto do_setname;
|
|
|
|
|
|
|
|
case JSOP_SETCONST:
|
|
|
|
case JSOP_SETNAME:
|
|
|
|
case JSOP_SETGVAR:
|
|
|
|
LOAD_ATOM(0);
|
|
|
|
|
|
|
|
do_setname:
|
|
|
|
lval = QuoteString(&ss->sprinter, ATOM_TO_STRING(atom), 0);
|
|
|
|
if (!lval)
|
|
|
|
return NULL;
|
|
|
|
rval = POP_STR();
|
|
|
|
if (op == JSOP_SETNAME)
|
|
|
|
(void) PopOff(ss, op);
|
|
|
|
|
|
|
|
do_setlval:
|
|
|
|
sn = js_GetSrcNote(jp->script, pc - 1);
|
|
|
|
if (sn && SN_TYPE(sn) == SRC_ASSIGNOP) {
|
|
|
|
todo = Sprint(&ss->sprinter, "%s %s= %s",
|
|
|
|
lval,
|
|
|
|
(lastop == JSOP_GETTER)
|
|
|
|
? js_getter_str
|
|
|
|
: (lastop == JSOP_SETTER)
|
|
|
|
? js_setter_str
|
2007-05-06 03:50:07 -07:00
|
|
|
: CodeToken[lastop],
|
2007-03-22 10:30:00 -07:00
|
|
|
rval);
|
|
|
|
} else {
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
todo = Sprint(&ss->sprinter, "%s%s = %s",
|
|
|
|
VarPrefix(sn), lval, rval);
|
|
|
|
}
|
|
|
|
if (op == JSOP_SETLOCALPOP) {
|
|
|
|
if (!PushOff(ss, todo, saveop))
|
|
|
|
return NULL;
|
|
|
|
rval = POP_STR();
|
|
|
|
LOCAL_ASSERT(*rval != '\0');
|
|
|
|
js_printf(jp, "\t%s;\n", rval);
|
|
|
|
todo = -2;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_NEW:
|
|
|
|
case JSOP_CALL:
|
|
|
|
case JSOP_EVAL:
|
|
|
|
#if JS_HAS_LVALUE_RETURN
|
|
|
|
case JSOP_SETCALL:
|
|
|
|
#endif
|
|
|
|
op = JSOP_SETNAME; /* turn off most parens */
|
|
|
|
argc = GET_ARGC(pc);
|
|
|
|
argv = (char **)
|
|
|
|
JS_malloc(cx, (size_t)(argc + 1) * sizeof *argv);
|
|
|
|
if (!argv)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
ok = JS_TRUE;
|
|
|
|
for (i = argc; i > 0; i--) {
|
|
|
|
argv[i] = JS_strdup(cx, POP_STR());
|
|
|
|
if (!argv[i]) {
|
|
|
|
ok = JS_FALSE;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Skip the JSOP_PUSHOBJ-created empty string. */
|
|
|
|
LOCAL_ASSERT(ss->top >= 2);
|
|
|
|
(void) PopOff(ss, op);
|
|
|
|
|
2007-04-04 16:32:33 -07:00
|
|
|
/*
|
|
|
|
* Special case: new (x(y)(z)) must be parenthesized like so.
|
|
|
|
* Same for new (x(y).z) -- contrast with new x(y).z.
|
|
|
|
*/
|
|
|
|
op = ss->opcodes[ss->top-1];
|
|
|
|
lval = PopStr(ss,
|
|
|
|
(saveop == JSOP_NEW &&
|
2007-04-04 20:24:41 -07:00
|
|
|
(op == JSOP_CALL || op == JSOP_EVAL ||
|
2007-04-04 16:32:33 -07:00
|
|
|
(js_CodeSpec[op].format & JOF_CALLOP)))
|
|
|
|
? JSOP_NAME
|
|
|
|
: saveop);
|
2007-03-22 10:30:00 -07:00
|
|
|
op = saveop;
|
2007-04-04 16:32:33 -07:00
|
|
|
|
|
|
|
argv[0] = JS_strdup(cx, lval);
|
2007-03-22 10:30:00 -07:00
|
|
|
if (!argv[i])
|
|
|
|
ok = JS_FALSE;
|
|
|
|
|
|
|
|
lval = "(", rval = ")";
|
|
|
|
if (op == JSOP_NEW) {
|
|
|
|
if (argc == 0)
|
|
|
|
lval = rval = "";
|
|
|
|
todo = Sprint(&ss->sprinter, "%s %s%s",
|
|
|
|
js_new_str, argv[0], lval);
|
|
|
|
} else {
|
|
|
|
todo = Sprint(&ss->sprinter, ss_format,
|
|
|
|
argv[0], lval);
|
|
|
|
}
|
|
|
|
if (todo < 0)
|
|
|
|
ok = JS_FALSE;
|
|
|
|
|
|
|
|
for (i = 1; i <= argc; i++) {
|
|
|
|
if (!argv[i] ||
|
|
|
|
Sprint(&ss->sprinter, ss_format,
|
|
|
|
argv[i], (i < argc) ? ", " : "") < 0) {
|
|
|
|
ok = JS_FALSE;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (Sprint(&ss->sprinter, rval) < 0)
|
|
|
|
ok = JS_FALSE;
|
|
|
|
|
|
|
|
for (i = 0; i <= argc; i++) {
|
|
|
|
if (argv[i])
|
|
|
|
JS_free(cx, argv[i]);
|
|
|
|
}
|
|
|
|
JS_free(cx, argv);
|
|
|
|
if (!ok)
|
|
|
|
return NULL;
|
|
|
|
#if JS_HAS_LVALUE_RETURN
|
|
|
|
if (op == JSOP_SETCALL) {
|
|
|
|
if (!PushOff(ss, todo, op))
|
|
|
|
return NULL;
|
|
|
|
todo = Sprint(&ss->sprinter, "");
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_DELNAME:
|
|
|
|
LOAD_ATOM(0);
|
|
|
|
lval = QuoteString(&ss->sprinter, ATOM_TO_STRING(atom), 0);
|
|
|
|
if (!lval)
|
|
|
|
return NULL;
|
|
|
|
RETRACT(&ss->sprinter, lval);
|
|
|
|
do_delete_lval:
|
|
|
|
todo = Sprint(&ss->sprinter, "%s %s", js_delete_str, lval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_DELPROP:
|
|
|
|
GET_ATOM_QUOTE_AND_FMT("%s %s[%s]", "%s %s.%s", rval);
|
|
|
|
lval = POP_STR();
|
|
|
|
todo = Sprint(&ss->sprinter, fmt, js_delete_str, lval, rval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_DELELEM:
|
|
|
|
op = JSOP_NOP; /* turn off parens */
|
|
|
|
xval = POP_STR();
|
|
|
|
op = saveop;
|
|
|
|
lval = POP_STR();
|
|
|
|
if (*xval == '\0')
|
|
|
|
goto do_delete_lval;
|
|
|
|
todo = Sprint(&ss->sprinter,
|
|
|
|
(js_CodeSpec[lastop].format & JOF_XMLNAME)
|
|
|
|
? "%s %s.%s"
|
|
|
|
: "%s %s[%s]",
|
|
|
|
js_delete_str, lval, xval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
#if JS_HAS_XML_SUPPORT
|
|
|
|
case JSOP_DELDESC:
|
|
|
|
xval = POP_STR();
|
|
|
|
lval = POP_STR();
|
|
|
|
todo = Sprint(&ss->sprinter, "%s %s..%s",
|
|
|
|
js_delete_str, lval, xval);
|
|
|
|
break;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
case JSOP_TYPEOFEXPR:
|
|
|
|
case JSOP_TYPEOF:
|
|
|
|
case JSOP_VOID:
|
|
|
|
rval = POP_STR();
|
2007-05-06 03:50:07 -07:00
|
|
|
todo = Sprint(&ss->sprinter, "%s %s",
|
|
|
|
(op == JSOP_VOID) ? js_void_str : js_typeof_str,
|
|
|
|
rval);
|
2007-03-22 10:30:00 -07:00
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_INCARG:
|
|
|
|
case JSOP_DECARG:
|
|
|
|
atom = GetSlotAtom(jp, js_GetArgument, GET_ARGNO(pc));
|
|
|
|
LOCAL_ASSERT(atom);
|
|
|
|
goto do_incatom;
|
|
|
|
|
|
|
|
case JSOP_INCVAR:
|
|
|
|
case JSOP_DECVAR:
|
|
|
|
atom = GetSlotAtom(jp, js_GetLocalVariable, GET_VARNO(pc));
|
|
|
|
LOCAL_ASSERT(atom);
|
|
|
|
goto do_incatom;
|
|
|
|
|
|
|
|
case JSOP_INCNAME:
|
|
|
|
case JSOP_DECNAME:
|
|
|
|
case JSOP_INCGVAR:
|
|
|
|
case JSOP_DECGVAR:
|
|
|
|
LOAD_ATOM(0);
|
|
|
|
do_incatom:
|
|
|
|
lval = QuoteString(&ss->sprinter, ATOM_TO_STRING(atom), 0);
|
|
|
|
if (!lval)
|
|
|
|
return NULL;
|
|
|
|
RETRACT(&ss->sprinter, lval);
|
|
|
|
do_inclval:
|
|
|
|
todo = Sprint(&ss->sprinter, ss_format,
|
|
|
|
js_incop_strs[!(cs->format & JOF_INC)], lval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_INCPROP:
|
|
|
|
case JSOP_DECPROP:
|
|
|
|
GET_ATOM_QUOTE_AND_FMT(preindex_format, predot_format, rval);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Force precedence below the numeric literal opcodes, so that
|
|
|
|
* 42..foo or 10000..toString(16), e.g., decompile with parens
|
|
|
|
* around the left-hand side of dot.
|
|
|
|
*/
|
|
|
|
op = JSOP_GETPROP;
|
|
|
|
lval = POP_STR();
|
|
|
|
todo = Sprint(&ss->sprinter, fmt,
|
|
|
|
js_incop_strs[!(cs->format & JOF_INC)],
|
|
|
|
lval, rval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_INCELEM:
|
|
|
|
case JSOP_DECELEM:
|
|
|
|
op = JSOP_NOP; /* turn off parens */
|
|
|
|
xval = POP_STR();
|
|
|
|
op = JSOP_GETELEM;
|
|
|
|
lval = POP_STR();
|
|
|
|
if (*xval != '\0') {
|
|
|
|
todo = Sprint(&ss->sprinter,
|
|
|
|
(js_CodeSpec[lastop].format & JOF_XMLNAME)
|
|
|
|
? predot_format
|
|
|
|
: preindex_format,
|
|
|
|
js_incop_strs[!(cs->format & JOF_INC)],
|
|
|
|
lval, xval);
|
|
|
|
} else {
|
|
|
|
todo = Sprint(&ss->sprinter, ss_format,
|
|
|
|
js_incop_strs[!(cs->format & JOF_INC)], lval);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_ARGINC:
|
|
|
|
case JSOP_ARGDEC:
|
|
|
|
atom = GetSlotAtom(jp, js_GetArgument, GET_ARGNO(pc));
|
|
|
|
LOCAL_ASSERT(atom);
|
|
|
|
goto do_atominc;
|
|
|
|
|
|
|
|
case JSOP_VARINC:
|
|
|
|
case JSOP_VARDEC:
|
|
|
|
atom = GetSlotAtom(jp, js_GetLocalVariable, GET_VARNO(pc));
|
|
|
|
LOCAL_ASSERT(atom);
|
|
|
|
goto do_atominc;
|
|
|
|
|
|
|
|
case JSOP_NAMEINC:
|
|
|
|
case JSOP_NAMEDEC:
|
|
|
|
case JSOP_GVARINC:
|
|
|
|
case JSOP_GVARDEC:
|
|
|
|
LOAD_ATOM(0);
|
|
|
|
do_atominc:
|
|
|
|
lval = QuoteString(&ss->sprinter, ATOM_TO_STRING(atom), 0);
|
|
|
|
if (!lval)
|
|
|
|
return NULL;
|
|
|
|
RETRACT(&ss->sprinter, lval);
|
|
|
|
do_lvalinc:
|
|
|
|
todo = Sprint(&ss->sprinter, ss_format,
|
|
|
|
lval, js_incop_strs[!(cs->format & JOF_INC)]);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_PROPINC:
|
|
|
|
case JSOP_PROPDEC:
|
|
|
|
GET_ATOM_QUOTE_AND_FMT(postindex_format, postdot_format, rval);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Force precedence below the numeric literal opcodes, so that
|
|
|
|
* 42..foo or 10000..toString(16), e.g., decompile with parens
|
|
|
|
* around the left-hand side of dot.
|
|
|
|
*/
|
|
|
|
op = JSOP_GETPROP;
|
|
|
|
lval = POP_STR();
|
|
|
|
todo = Sprint(&ss->sprinter, fmt, lval, rval,
|
|
|
|
js_incop_strs[!(cs->format & JOF_INC)]);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_ELEMINC:
|
|
|
|
case JSOP_ELEMDEC:
|
|
|
|
op = JSOP_NOP; /* turn off parens */
|
|
|
|
xval = POP_STR();
|
|
|
|
op = JSOP_GETELEM;
|
|
|
|
lval = POP_STR();
|
|
|
|
if (*xval != '\0') {
|
|
|
|
todo = Sprint(&ss->sprinter,
|
|
|
|
(js_CodeSpec[lastop].format & JOF_XMLNAME)
|
|
|
|
? postdot_format
|
|
|
|
: postindex_format,
|
|
|
|
lval, xval,
|
|
|
|
js_incop_strs[!(cs->format & JOF_INC)]);
|
|
|
|
} else {
|
|
|
|
todo = Sprint(&ss->sprinter, ss_format,
|
|
|
|
lval, js_incop_strs[!(cs->format & JOF_INC)]);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_GETPROP2:
|
|
|
|
op = JSOP_GETPROP;
|
|
|
|
(void) PopOff(ss, lastop);
|
|
|
|
/* FALL THROUGH */
|
|
|
|
|
|
|
|
#if JS_HAS_XML_SUPPORT
|
|
|
|
case JSOP_CALLPROP:
|
|
|
|
#endif
|
|
|
|
case JSOP_GETPROP:
|
|
|
|
case JSOP_GETXPROP:
|
|
|
|
LOAD_ATOM(0);
|
|
|
|
|
|
|
|
do_getprop:
|
|
|
|
GET_QUOTE_AND_FMT(index_format, dot_format, rval);
|
|
|
|
lval = POP_STR();
|
|
|
|
todo = Sprint(&ss->sprinter, fmt, lval, rval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
BEGIN_LITOPX_CASE(JSOP_GETTHISPROP, 0)
|
|
|
|
GET_QUOTE_AND_FMT(index_format, dot_format, rval);
|
|
|
|
todo = Sprint(&ss->sprinter, fmt, js_this_str, rval);
|
|
|
|
END_LITOPX_CASE
|
|
|
|
|
|
|
|
BEGIN_LITOPX_CASE(JSOP_GETARGPROP, ARGNO_LEN)
|
|
|
|
if (!PushSlotAtom(ss, js_GetArgument, GET_ARGNO(pc), op))
|
|
|
|
return NULL;
|
|
|
|
goto do_getprop;
|
|
|
|
|
|
|
|
BEGIN_LITOPX_CASE(JSOP_GETVARPROP, VARNO_LEN)
|
|
|
|
if (!PushSlotAtom(ss, js_GetLocalVariable, GET_VARNO(pc), op))
|
|
|
|
return NULL;
|
|
|
|
goto do_getprop;
|
|
|
|
|
|
|
|
BEGIN_LITOPX_CASE(JSOP_GETLOCALPROP, 2)
|
|
|
|
i = GET_UINT16(pc);
|
|
|
|
LOCAL_ASSERT((uintN)i < ss->top);
|
|
|
|
lval = GetLocal(ss, i);
|
|
|
|
if (!lval)
|
|
|
|
return NULL;
|
|
|
|
todo = SprintCString(&ss->sprinter, lval);
|
|
|
|
if (todo < 0 || !PushOff(ss, todo, op))
|
|
|
|
return NULL;
|
|
|
|
goto do_getprop;
|
|
|
|
|
|
|
|
case JSOP_SETPROP:
|
|
|
|
LOAD_ATOM(0);
|
|
|
|
GET_QUOTE_AND_FMT("%s[%s] %s= %s", "%s.%s %s= %s", xval);
|
|
|
|
rval = POP_STR();
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Force precedence below the numeric literal opcodes, so that
|
|
|
|
* 42..foo or 10000..toString(16), e.g., decompile with parens
|
|
|
|
* around the left-hand side of dot.
|
|
|
|
*/
|
|
|
|
op = JSOP_GETPROP;
|
|
|
|
lval = POP_STR();
|
|
|
|
sn = js_GetSrcNote(jp->script, pc - 1);
|
|
|
|
todo = Sprint(&ss->sprinter, fmt, lval, xval,
|
|
|
|
(sn && SN_TYPE(sn) == SRC_ASSIGNOP)
|
|
|
|
? (lastop == JSOP_GETTER)
|
|
|
|
? js_getter_str
|
|
|
|
: (lastop == JSOP_SETTER)
|
|
|
|
? js_setter_str
|
2007-05-06 03:50:07 -07:00
|
|
|
: CodeToken[lastop]
|
2007-03-22 10:30:00 -07:00
|
|
|
: "",
|
|
|
|
rval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_GETELEM2:
|
|
|
|
op = JSOP_GETELEM;
|
|
|
|
(void) PopOff(ss, lastop);
|
|
|
|
/* FALL THROUGH */
|
|
|
|
|
|
|
|
case JSOP_CALLELEM:
|
|
|
|
case JSOP_GETELEM:
|
|
|
|
op = JSOP_NOP; /* turn off parens */
|
|
|
|
xval = POP_STR();
|
|
|
|
op = saveop;
|
|
|
|
lval = POP_STR();
|
|
|
|
if (*xval == '\0') {
|
|
|
|
todo = Sprint(&ss->sprinter, "%s", lval);
|
|
|
|
} else {
|
|
|
|
todo = Sprint(&ss->sprinter,
|
|
|
|
(js_CodeSpec[lastop].format & JOF_XMLNAME)
|
|
|
|
? dot_format
|
|
|
|
: index_format,
|
|
|
|
lval, xval);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_SETELEM:
|
|
|
|
rval = POP_STR();
|
|
|
|
op = JSOP_NOP; /* turn off parens */
|
|
|
|
xval = POP_STR();
|
|
|
|
cs = &js_CodeSpec[ss->opcodes[ss->top]];
|
|
|
|
op = JSOP_GETELEM; /* lval must have high precedence */
|
|
|
|
lval = POP_STR();
|
|
|
|
op = saveop;
|
|
|
|
if (*xval == '\0')
|
|
|
|
goto do_setlval;
|
|
|
|
sn = js_GetSrcNote(jp->script, pc - 1);
|
|
|
|
todo = Sprint(&ss->sprinter,
|
|
|
|
(cs->format & JOF_XMLNAME)
|
|
|
|
? "%s.%s %s= %s"
|
|
|
|
: "%s[%s] %s= %s",
|
|
|
|
lval, xval,
|
|
|
|
(sn && SN_TYPE(sn) == SRC_ASSIGNOP)
|
|
|
|
? (lastop == JSOP_GETTER)
|
|
|
|
? js_getter_str
|
|
|
|
: (lastop == JSOP_SETTER)
|
|
|
|
? js_setter_str
|
2007-05-06 03:50:07 -07:00
|
|
|
: CodeToken[lastop]
|
2007-03-22 10:30:00 -07:00
|
|
|
: "",
|
|
|
|
rval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_ARGSUB:
|
|
|
|
i = (jsint) GET_ARGNO(pc);
|
|
|
|
todo = Sprint(&ss->sprinter, "%s[%d]",
|
|
|
|
js_arguments_str, (int) i);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_ARGCNT:
|
|
|
|
todo = Sprint(&ss->sprinter, dot_format,
|
|
|
|
js_arguments_str, js_length_str);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_CALLARG:
|
|
|
|
case JSOP_GETARG:
|
|
|
|
i = GET_ARGNO(pc);
|
|
|
|
atom = GetSlotAtom(jp, js_GetArgument, i);
|
|
|
|
#if JS_HAS_DESTRUCTURING
|
|
|
|
if (!atom) {
|
|
|
|
todo = Sprint(&ss->sprinter, "%s[%d]", js_arguments_str, i);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
LOCAL_ASSERT(atom);
|
|
|
|
#endif
|
|
|
|
goto do_name;
|
|
|
|
|
|
|
|
case JSOP_CALLVAR:
|
|
|
|
case JSOP_GETVAR:
|
|
|
|
atom = GetSlotAtom(jp, js_GetLocalVariable, GET_VARNO(pc));
|
|
|
|
LOCAL_ASSERT(atom);
|
|
|
|
goto do_name;
|
|
|
|
|
|
|
|
case JSOP_CALLNAME:
|
|
|
|
case JSOP_NAME:
|
|
|
|
case JSOP_GETGVAR:
|
|
|
|
case JSOP_CALLGVAR:
|
|
|
|
LOAD_ATOM(0);
|
|
|
|
do_name:
|
|
|
|
lval = "";
|
|
|
|
do_qname:
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
rval = QuoteString(&ss->sprinter, ATOM_TO_STRING(atom),
|
|
|
|
inXML ? DONT_ESCAPE : 0);
|
|
|
|
if (!rval)
|
|
|
|
return NULL;
|
|
|
|
RETRACT(&ss->sprinter, rval);
|
|
|
|
todo = Sprint(&ss->sprinter, "%s%s%s",
|
|
|
|
VarPrefix(sn), lval, rval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_UINT16:
|
|
|
|
i = (jsint) GET_UINT16(pc);
|
|
|
|
goto do_sprint_int;
|
|
|
|
|
|
|
|
case JSOP_UINT24:
|
|
|
|
i = (jsint) GET_UINT24(pc);
|
|
|
|
do_sprint_int:
|
|
|
|
todo = Sprint(&ss->sprinter, "%u", (unsigned) i);
|
|
|
|
break;
|
|
|
|
|
|
|
|
BEGIN_LITOPX_CASE(JSOP_NUMBER, 0)
|
|
|
|
val = ATOM_KEY(atom);
|
2007-04-01 19:01:50 -07:00
|
|
|
todo = JSVAL_IS_INT(val)
|
|
|
|
? Sprint(&ss->sprinter, "%ld", (long) JSVAL_TO_INT(val))
|
|
|
|
: SprintDoubleValue(&ss->sprinter, val, &saveop);
|
2007-03-22 10:30:00 -07:00
|
|
|
END_LITOPX_CASE
|
|
|
|
|
|
|
|
BEGIN_LITOPX_CASE(JSOP_STRING, 0)
|
|
|
|
rval = QuoteString(&ss->sprinter, ATOM_TO_STRING(atom),
|
|
|
|
inXML ? DONT_ESCAPE : '"');
|
|
|
|
if (!rval)
|
|
|
|
return NULL;
|
|
|
|
todo = STR2OFF(&ss->sprinter, rval);
|
|
|
|
END_LITOPX_CASE
|
|
|
|
|
2007-05-17 18:41:17 -07:00
|
|
|
case JSOP_ANONFUNOBJ:
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
if (sn && SN_TYPE(sn) == SRC_GENEXP) {
|
|
|
|
JSScript *inner, *outer;
|
|
|
|
void *mark;
|
|
|
|
SprintStack ss2;
|
|
|
|
|
|
|
|
LOAD_ATOM(0);
|
|
|
|
obj = ATOM_TO_OBJECT(atom);
|
|
|
|
fun = (JSFunction *) JS_GetPrivate(cx, obj);
|
|
|
|
LOCAL_ASSERT(FUN_INTERPRETED(fun));
|
|
|
|
inner = fun->u.i.script;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* All allocation when decompiling is LIFO, using malloc
|
|
|
|
* or, more commonly, arena-alloocating from cx->tempPool.
|
|
|
|
* After InitSprintStack succeeds, we must release to mark
|
|
|
|
* before returning.
|
|
|
|
*/
|
|
|
|
mark = JS_ARENA_MARK(&cx->tempPool);
|
|
|
|
if (!InitSprintStack(cx, &ss2, jp, inner->depth))
|
|
|
|
return NULL;
|
|
|
|
ss2.inGenExp = JS_TRUE;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Recursively decompile this generator function as an
|
|
|
|
* un-parenthesized generator expression. The ss->inGenExp
|
|
|
|
* special case of JSOP_YIELD shares array comprehension
|
|
|
|
* decompilation code that leaves the result as the single
|
|
|
|
* string pushed on ss2.
|
|
|
|
*/
|
|
|
|
outer = jp->script;
|
|
|
|
LOCAL_ASSERT(JS_UPTRDIFF(pc, outer->code) <= outer->length);
|
|
|
|
jp->script = inner;
|
|
|
|
if (!Decompile(&ss2, inner->code, inner->length)) {
|
|
|
|
JS_ARENA_RELEASE(&cx->tempPool, mark);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
jp->script = outer;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Advance over this op and its null |this| push, and
|
|
|
|
* arrange to advance over the call to this lambda.
|
|
|
|
*/
|
|
|
|
pc2 = pc;
|
|
|
|
pc += len;
|
|
|
|
LOCAL_ASSERT(*pc == JSOP_NULL);
|
|
|
|
pc += JSOP_NULL_LENGTH;
|
|
|
|
LOCAL_ASSERT(*pc == JSOP_CALL);
|
|
|
|
LOCAL_ASSERT(GET_ARGC(pc) == 0);
|
|
|
|
len = JSOP_CALL_LENGTH;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Arrange to parenthesize this genexp unless:
|
|
|
|
*
|
|
|
|
* 1. It is consumed by a control flow bytecode such
|
|
|
|
* as JSOP_TABLESWITCH (the syntax from which such ops
|
|
|
|
* come always parenthesizes the controlling expression).
|
|
|
|
* 2. It is the sole argument to a function call.
|
|
|
|
* 3. It is the condition of an if statement and not of a
|
|
|
|
* ?: expression.
|
|
|
|
*
|
|
|
|
* But always parenthesize if this genexp is an operand in
|
|
|
|
* a comma expression (i.e. if JSOP_ANONFUNOBJ is preceded
|
|
|
|
* immediately by JSOP_POP with SRC_PCDELTA).
|
|
|
|
*/
|
|
|
|
LOCAL_ASSERT(ss2.top == 1);
|
|
|
|
ss2.opcodes[0] = JSOP_POP;
|
|
|
|
op = (JSOp) pc[len];
|
|
|
|
op = (((js_CodeSpec[op].format & JOF_PARENHEAD) ||
|
|
|
|
((js_CodeSpec[op].format & JOF_INVOKE) &&
|
|
|
|
GET_ARGC(pc + len) == 1) ||
|
|
|
|
(((op == JSOP_IFEQ || op == JSOP_IFEQX) &&
|
|
|
|
(sn2 = js_GetSrcNote(outer, pc + len)) &&
|
|
|
|
SN_TYPE(sn2) != SRC_COND))) &&
|
|
|
|
!(pc2 > outer->main &&
|
|
|
|
pc2[-1] == JSOP_POP &&
|
|
|
|
(sn2 = js_GetSrcNote(outer, pc2 - 1)) &&
|
|
|
|
SN_TYPE(sn2) == SRC_PCDELTA))
|
|
|
|
? JSOP_POP
|
|
|
|
: JSOP_SETNAME;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Alas, we have to malloc a copy of the result left on
|
|
|
|
* the top of ss2 because both ss and ss2 arena-allocate
|
|
|
|
* from cx's tempPool.
|
|
|
|
*/
|
|
|
|
rval = JS_strdup(cx, PopStr(&ss2, op));
|
|
|
|
JS_ARENA_RELEASE(&cx->tempPool, mark);
|
|
|
|
if (!rval)
|
|
|
|
return NULL;
|
|
|
|
todo = SprintCString(&ss->sprinter, rval);
|
|
|
|
JS_free(cx, (void *)rval);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
/* FALL THROUGH */
|
|
|
|
|
2007-03-22 10:30:00 -07:00
|
|
|
case JSOP_OBJECT:
|
|
|
|
case JSOP_REGEXP:
|
|
|
|
case JSOP_NAMEDFUNOBJ:
|
|
|
|
LOAD_ATOM(0);
|
|
|
|
if (op == JSOP_OBJECT || op == JSOP_REGEXP) {
|
|
|
|
if (!js_regexp_toString(cx, ATOM_TO_OBJECT(atom), 0, NULL,
|
|
|
|
&val)) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (!js_fun_toString(cx, ATOM_TO_OBJECT(atom),
|
|
|
|
JS_IN_GROUP_CONTEXT |
|
|
|
|
JS_DONT_PRETTY_PRINT,
|
|
|
|
0, NULL, &val)) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
str = JSVAL_TO_STRING(val);
|
|
|
|
todo = SprintString(&ss->sprinter, str);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_TABLESWITCH:
|
|
|
|
case JSOP_TABLESWITCHX:
|
|
|
|
{
|
|
|
|
ptrdiff_t jmplen, off, off2;
|
|
|
|
jsint j, n, low, high;
|
|
|
|
TableEntry *table, *tmp;
|
|
|
|
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
LOCAL_ASSERT(sn && SN_TYPE(sn) == SRC_SWITCH);
|
|
|
|
len = js_GetSrcNoteOffset(sn, 0);
|
|
|
|
jmplen = (op == JSOP_TABLESWITCH) ? JUMP_OFFSET_LEN
|
|
|
|
: JUMPX_OFFSET_LEN;
|
|
|
|
pc2 = pc;
|
|
|
|
off = GetJumpOffset(pc, pc2);
|
|
|
|
pc2 += jmplen;
|
|
|
|
low = GET_JUMP_OFFSET(pc2);
|
|
|
|
pc2 += JUMP_OFFSET_LEN;
|
|
|
|
high = GET_JUMP_OFFSET(pc2);
|
|
|
|
pc2 += JUMP_OFFSET_LEN;
|
|
|
|
|
|
|
|
n = high - low + 1;
|
|
|
|
if (n == 0) {
|
|
|
|
table = NULL;
|
|
|
|
j = 0;
|
|
|
|
ok = JS_TRUE;
|
|
|
|
} else {
|
|
|
|
table = (TableEntry *)
|
|
|
|
JS_malloc(cx, (size_t)n * sizeof *table);
|
|
|
|
if (!table)
|
|
|
|
return NULL;
|
|
|
|
for (i = j = 0; i < n; i++) {
|
|
|
|
table[j].label = NULL;
|
|
|
|
off2 = GetJumpOffset(pc, pc2);
|
|
|
|
if (off2) {
|
|
|
|
sn = js_GetSrcNote(jp->script, pc2);
|
|
|
|
if (sn) {
|
|
|
|
LOCAL_ASSERT(SN_TYPE(sn) == SRC_LABEL);
|
|
|
|
table[j].label =
|
|
|
|
js_GetAtom(cx, &jp->script->atomMap,
|
|
|
|
(jsatomid)
|
|
|
|
js_GetSrcNoteOffset(sn, 0));
|
|
|
|
}
|
|
|
|
table[j].key = INT_TO_JSVAL(low + i);
|
|
|
|
table[j].offset = off2;
|
|
|
|
table[j].order = j;
|
|
|
|
j++;
|
|
|
|
}
|
|
|
|
pc2 += jmplen;
|
|
|
|
}
|
|
|
|
tmp = (TableEntry *)
|
|
|
|
JS_malloc(cx, (size_t)j * sizeof *table);
|
|
|
|
if (tmp) {
|
|
|
|
ok = js_MergeSort(table, (size_t)j, sizeof(TableEntry),
|
|
|
|
CompareOffsets, NULL, tmp);
|
|
|
|
JS_free(cx, tmp);
|
|
|
|
} else {
|
|
|
|
ok = JS_FALSE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (ok) {
|
|
|
|
ok = DecompileSwitch(ss, table, (uintN)j, pc, len, off,
|
|
|
|
JS_FALSE);
|
|
|
|
}
|
|
|
|
JS_free(cx, table);
|
|
|
|
if (!ok)
|
|
|
|
return NULL;
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case JSOP_LOOKUPSWITCH:
|
|
|
|
case JSOP_LOOKUPSWITCHX:
|
|
|
|
{
|
|
|
|
ptrdiff_t jmplen, off, off2;
|
|
|
|
jsatomid npairs, k;
|
|
|
|
TableEntry *table;
|
|
|
|
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
LOCAL_ASSERT(sn && SN_TYPE(sn) == SRC_SWITCH);
|
|
|
|
len = js_GetSrcNoteOffset(sn, 0);
|
|
|
|
jmplen = (op == JSOP_LOOKUPSWITCH) ? JUMP_OFFSET_LEN
|
|
|
|
: JUMPX_OFFSET_LEN;
|
|
|
|
pc2 = pc;
|
|
|
|
off = GetJumpOffset(pc, pc2);
|
|
|
|
pc2 += jmplen;
|
|
|
|
npairs = GET_UINT16(pc2);
|
|
|
|
pc2 += UINT16_LEN;
|
|
|
|
|
|
|
|
table = (TableEntry *)
|
|
|
|
JS_malloc(cx, (size_t)npairs * sizeof *table);
|
|
|
|
if (!table)
|
|
|
|
return NULL;
|
|
|
|
for (k = 0; k < npairs; k++) {
|
|
|
|
sn = js_GetSrcNote(jp->script, pc2);
|
|
|
|
if (sn) {
|
|
|
|
LOCAL_ASSERT(SN_TYPE(sn) == SRC_LABEL);
|
|
|
|
table[k].label =
|
|
|
|
js_GetAtom(cx, &jp->script->atomMap, (jsatomid)
|
|
|
|
js_GetSrcNoteOffset(sn, 0));
|
|
|
|
} else {
|
|
|
|
table[k].label = NULL;
|
|
|
|
}
|
|
|
|
atom = GET_ATOM(jp->script, jp->script->atomMap.vector,
|
|
|
|
pc2);
|
|
|
|
pc2 += ATOM_INDEX_LEN;
|
|
|
|
off2 = GetJumpOffset(pc, pc2);
|
|
|
|
pc2 += jmplen;
|
|
|
|
table[k].key = ATOM_KEY(atom);
|
|
|
|
table[k].offset = off2;
|
|
|
|
}
|
|
|
|
|
|
|
|
ok = DecompileSwitch(ss, table, (uintN)npairs, pc, len, off,
|
|
|
|
JS_FALSE);
|
|
|
|
JS_free(cx, table);
|
|
|
|
if (!ok)
|
|
|
|
return NULL;
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case JSOP_CONDSWITCH:
|
|
|
|
{
|
|
|
|
ptrdiff_t off, off2, caseOff;
|
|
|
|
jsint ncases;
|
|
|
|
TableEntry *table;
|
|
|
|
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
LOCAL_ASSERT(sn && SN_TYPE(sn) == SRC_SWITCH);
|
|
|
|
len = js_GetSrcNoteOffset(sn, 0);
|
|
|
|
off = js_GetSrcNoteOffset(sn, 1);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Count the cases using offsets from switch to first case,
|
|
|
|
* and case to case, stored in srcnote immediates.
|
|
|
|
*/
|
|
|
|
pc2 = pc;
|
|
|
|
off2 = off;
|
|
|
|
for (ncases = 0; off2 != 0; ncases++) {
|
|
|
|
pc2 += off2;
|
|
|
|
LOCAL_ASSERT(*pc2 == JSOP_CASE || *pc2 == JSOP_DEFAULT ||
|
|
|
|
*pc2 == JSOP_CASEX || *pc2 == JSOP_DEFAULTX);
|
|
|
|
if (*pc2 == JSOP_DEFAULT || *pc2 == JSOP_DEFAULTX) {
|
|
|
|
/* End of cases, but count default as a case. */
|
|
|
|
off2 = 0;
|
|
|
|
} else {
|
|
|
|
sn = js_GetSrcNote(jp->script, pc2);
|
|
|
|
LOCAL_ASSERT(sn && SN_TYPE(sn) == SRC_PCDELTA);
|
|
|
|
off2 = js_GetSrcNoteOffset(sn, 0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Allocate table and rescan the cases using their srcnotes,
|
|
|
|
* stashing each case's delta from switch top in table[i].key,
|
|
|
|
* and the distance to its statements in table[i].offset.
|
|
|
|
*/
|
|
|
|
table = (TableEntry *)
|
|
|
|
JS_malloc(cx, (size_t)ncases * sizeof *table);
|
|
|
|
if (!table)
|
|
|
|
return NULL;
|
|
|
|
pc2 = pc;
|
|
|
|
off2 = off;
|
|
|
|
for (i = 0; i < ncases; i++) {
|
|
|
|
pc2 += off2;
|
|
|
|
LOCAL_ASSERT(*pc2 == JSOP_CASE || *pc2 == JSOP_DEFAULT ||
|
|
|
|
*pc2 == JSOP_CASEX || *pc2 == JSOP_DEFAULTX);
|
|
|
|
caseOff = pc2 - pc;
|
|
|
|
table[i].key = INT_TO_JSVAL((jsint) caseOff);
|
|
|
|
table[i].offset = caseOff + GetJumpOffset(pc2, pc2);
|
|
|
|
if (*pc2 == JSOP_CASE || *pc2 == JSOP_CASEX) {
|
|
|
|
sn = js_GetSrcNote(jp->script, pc2);
|
|
|
|
LOCAL_ASSERT(sn && SN_TYPE(sn) == SRC_PCDELTA);
|
|
|
|
off2 = js_GetSrcNoteOffset(sn, 0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Find offset of default code by fetching the default offset
|
|
|
|
* from the end of table. JSOP_CONDSWITCH always has a default
|
|
|
|
* case at the end.
|
|
|
|
*/
|
|
|
|
off = JSVAL_TO_INT(table[ncases-1].key);
|
|
|
|
pc2 = pc + off;
|
|
|
|
off += GetJumpOffset(pc2, pc2);
|
|
|
|
|
|
|
|
ok = DecompileSwitch(ss, table, (uintN)ncases, pc, len, off,
|
|
|
|
JS_TRUE);
|
|
|
|
JS_free(cx, table);
|
|
|
|
if (!ok)
|
|
|
|
return NULL;
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case JSOP_CASE:
|
|
|
|
case JSOP_CASEX:
|
|
|
|
{
|
|
|
|
lval = POP_STR();
|
|
|
|
if (!lval)
|
|
|
|
return NULL;
|
|
|
|
js_printf(jp, "\tcase %s:\n", lval);
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case JSOP_STRICTEQ:
|
|
|
|
case JSOP_STRICTNE:
|
|
|
|
rval = POP_STR();
|
|
|
|
lval = POP_STR();
|
|
|
|
todo = Sprint(&ss->sprinter, "%s %c== %s",
|
|
|
|
lval, (op == JSOP_STRICTEQ) ? '=' : '!', rval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
BEGIN_LITOPX_CASE(JSOP_CLOSURE, 0)
|
|
|
|
LOCAL_ASSERT(ATOM_IS_OBJECT(atom));
|
|
|
|
todo = -2;
|
|
|
|
goto do_function;
|
|
|
|
END_LITOPX_CASE
|
|
|
|
|
|
|
|
#if JS_HAS_EXPORT_IMPORT
|
|
|
|
case JSOP_EXPORTALL:
|
|
|
|
js_printf(jp, "\texport *;\n");
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
|
|
|
|
BEGIN_LITOPX_CASE(JSOP_EXPORTNAME, 0)
|
|
|
|
rval = QuoteString(&ss->sprinter, ATOM_TO_STRING(atom), 0);
|
|
|
|
if (!rval)
|
|
|
|
return NULL;
|
|
|
|
RETRACT(&ss->sprinter, rval);
|
|
|
|
js_printf(jp, "\texport %s;\n", rval);
|
|
|
|
todo = -2;
|
|
|
|
END_LITOPX_CASE
|
|
|
|
|
|
|
|
case JSOP_IMPORTALL:
|
|
|
|
lval = POP_STR();
|
|
|
|
js_printf(jp, "\timport %s.*;\n", lval);
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_IMPORTPROP:
|
|
|
|
do_importprop:
|
|
|
|
GET_ATOM_QUOTE_AND_FMT("\timport %s[%s];\n",
|
|
|
|
"\timport %s.%s;\n",
|
|
|
|
rval);
|
|
|
|
lval = POP_STR();
|
|
|
|
js_printf(jp, fmt, lval, rval);
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_IMPORTELEM:
|
|
|
|
xval = POP_STR();
|
|
|
|
op = JSOP_GETELEM;
|
|
|
|
if (js_CodeSpec[lastop].format & JOF_XMLNAME)
|
|
|
|
goto do_importprop;
|
|
|
|
lval = POP_STR();
|
|
|
|
js_printf(jp, "\timport %s[%s];\n", lval, xval);
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
#endif /* JS_HAS_EXPORT_IMPORT */
|
|
|
|
|
|
|
|
case JSOP_TRAP:
|
|
|
|
op = JS_GetTrapOpcode(cx, jp->script, pc);
|
|
|
|
if (op == JSOP_LIMIT)
|
|
|
|
return NULL;
|
|
|
|
saveop = op;
|
|
|
|
*pc = op;
|
|
|
|
cs = &js_CodeSpec[op];
|
|
|
|
len = cs->length;
|
|
|
|
DECOMPILE_CODE(pc, len);
|
|
|
|
*pc = JSOP_TRAP;
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_NEWINIT:
|
|
|
|
{
|
|
|
|
JSBool isArray;
|
|
|
|
|
|
|
|
LOCAL_ASSERT(ss->top >= 2);
|
|
|
|
(void) PopOff(ss, op);
|
|
|
|
lval = POP_STR();
|
|
|
|
isArray = (*lval == 'A');
|
|
|
|
todo = ss->sprinter.offset;
|
|
|
|
#if JS_HAS_SHARP_VARS
|
|
|
|
op = (JSOp)pc[len];
|
|
|
|
if (op == JSOP_DEFSHARP) {
|
|
|
|
pc += len;
|
|
|
|
cs = &js_CodeSpec[op];
|
|
|
|
len = cs->length;
|
|
|
|
i = (jsint) GET_UINT16(pc);
|
|
|
|
if (Sprint(&ss->sprinter, "#%u=", (unsigned) i) < 0)
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
#endif /* JS_HAS_SHARP_VARS */
|
|
|
|
if (isArray) {
|
|
|
|
++ss->inArrayInit;
|
|
|
|
if (SprintCString(&ss->sprinter, "[") < 0)
|
|
|
|
return NULL;
|
|
|
|
} else {
|
|
|
|
if (SprintCString(&ss->sprinter, "{") < 0)
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case JSOP_ENDINIT:
|
|
|
|
op = JSOP_NOP; /* turn off parens */
|
|
|
|
rval = POP_STR();
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
|
|
|
|
|
|
|
/* Skip any #n= prefix to find the opening bracket. */
|
|
|
|
for (xval = rval; *xval != '[' && *xval != '{'; xval++)
|
|
|
|
continue;
|
|
|
|
if (*xval == '[')
|
|
|
|
--ss->inArrayInit;
|
|
|
|
todo = Sprint(&ss->sprinter, "%s%s%c",
|
|
|
|
rval,
|
|
|
|
(sn && SN_TYPE(sn) == SRC_CONTINUE) ? ", " : "",
|
|
|
|
(*xval == '[') ? ']' : '}');
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_INITPROP:
|
|
|
|
LOAD_ATOM(0);
|
|
|
|
xval = QuoteString(&ss->sprinter, ATOM_TO_STRING(atom),
|
|
|
|
(jschar)
|
|
|
|
(ATOM_IS_IDENTIFIER(atom) ? 0 : '\''));
|
|
|
|
if (!xval)
|
|
|
|
return NULL;
|
|
|
|
rval = POP_STR();
|
|
|
|
lval = POP_STR();
|
|
|
|
do_initprop:
|
|
|
|
#ifdef OLD_GETTER_SETTER
|
|
|
|
todo = Sprint(&ss->sprinter, "%s%s%s%s%s:%s",
|
|
|
|
lval,
|
|
|
|
(lval[1] != '\0') ? ", " : "",
|
|
|
|
xval,
|
|
|
|
(lastop == JSOP_GETTER || lastop == JSOP_SETTER)
|
|
|
|
? " " : "",
|
|
|
|
(lastop == JSOP_GETTER) ? js_getter_str :
|
|
|
|
(lastop == JSOP_SETTER) ? js_setter_str :
|
|
|
|
"",
|
|
|
|
rval);
|
|
|
|
#else
|
|
|
|
if (lastop == JSOP_GETTER || lastop == JSOP_SETTER) {
|
2007-05-21 12:33:33 -07:00
|
|
|
if (!atom || !ATOM_IS_STRING(atom) ||
|
2007-05-09 08:21:32 -07:00
|
|
|
!ATOM_IS_IDENTIFIER(atom) ||
|
2007-05-01 11:07:44 -07:00
|
|
|
ATOM_IS_KEYWORD(atom) ||
|
2007-05-17 17:48:18 -07:00
|
|
|
((ss->opcodes[ss->top+1] != JSOP_ANONFUNOBJ ||
|
|
|
|
strncmp(rval, js_function_str, 8) != 0) &&
|
|
|
|
ss->opcodes[ss->top+1] != JSOP_NAMEDFUNOBJ)) {
|
|
|
|
todo = Sprint(&ss->sprinter, "%s%s%s %s: %s", lval,
|
2007-03-22 10:30:00 -07:00
|
|
|
(lval[1] != '\0') ? ", " : "", xval,
|
|
|
|
(lastop == JSOP_GETTER) ? js_getter_str :
|
|
|
|
(lastop == JSOP_SETTER) ? js_setter_str :
|
|
|
|
"",
|
|
|
|
rval);
|
|
|
|
} else {
|
|
|
|
rval += 8 + 1;
|
|
|
|
LOCAL_ASSERT(rval[strlen(rval)-1] == '}');
|
2007-04-13 17:13:02 -07:00
|
|
|
todo = Sprint(&ss->sprinter, "%s%s%s %s%s%s",
|
2007-03-22 10:30:00 -07:00
|
|
|
lval,
|
|
|
|
(lval[1] != '\0') ? ", " : "",
|
|
|
|
(lastop == JSOP_GETTER)
|
|
|
|
? js_get_str : js_set_str,
|
|
|
|
xval,
|
2007-04-13 17:13:02 -07:00
|
|
|
(rval[0] != '(') ? " " : "",
|
2007-03-22 10:30:00 -07:00
|
|
|
rval);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
todo = Sprint(&ss->sprinter, "%s%s%s:%s",
|
|
|
|
lval,
|
|
|
|
(lval[1] != '\0') ? ", " : "",
|
|
|
|
xval,
|
|
|
|
rval);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_INITELEM:
|
2007-05-17 18:41:17 -07:00
|
|
|
op = JSOP_SETNAME; /* turn off most parens */
|
2007-03-22 10:30:00 -07:00
|
|
|
rval = POP_STR();
|
|
|
|
xval = POP_STR();
|
|
|
|
lval = POP_STR();
|
|
|
|
sn = js_GetSrcNote(jp->script, pc);
|
2007-05-02 12:55:07 -07:00
|
|
|
if (sn && SN_TYPE(sn) == SRC_INITPROP) {
|
|
|
|
atom = NULL;
|
2007-03-22 10:30:00 -07:00
|
|
|
goto do_initprop;
|
2007-05-02 12:55:07 -07:00
|
|
|
}
|
2007-03-22 10:30:00 -07:00
|
|
|
todo = Sprint(&ss->sprinter, "%s%s%s",
|
|
|
|
lval,
|
|
|
|
(lval[1] != '\0' || *xval != '0') ? ", " : "",
|
|
|
|
rval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
#if JS_HAS_SHARP_VARS
|
|
|
|
case JSOP_DEFSHARP:
|
|
|
|
i = (jsint) GET_UINT16(pc);
|
|
|
|
rval = POP_STR();
|
|
|
|
todo = Sprint(&ss->sprinter, "#%u=%s", (unsigned) i, rval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_USESHARP:
|
|
|
|
i = (jsint) GET_UINT16(pc);
|
|
|
|
todo = Sprint(&ss->sprinter, "#%u#", (unsigned) i);
|
|
|
|
break;
|
|
|
|
#endif /* JS_HAS_SHARP_VARS */
|
|
|
|
|
|
|
|
#if JS_HAS_DEBUGGER_KEYWORD
|
|
|
|
case JSOP_DEBUGGER:
|
|
|
|
js_printf(jp, "\tdebugger;\n");
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
#endif /* JS_HAS_DEBUGGER_KEYWORD */
|
|
|
|
|
|
|
|
#if JS_HAS_XML_SUPPORT
|
|
|
|
case JSOP_STARTXML:
|
|
|
|
case JSOP_STARTXMLEXPR:
|
|
|
|
inXML = op == JSOP_STARTXML;
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_DEFXMLNS:
|
|
|
|
rval = POP_STR();
|
|
|
|
js_printf(jp, "\t%s %s %s = %s;\n",
|
|
|
|
js_default_str, js_xml_str, js_namespace_str, rval);
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_ANYNAME:
|
|
|
|
if (pc[JSOP_ANYNAME_LENGTH] == JSOP_TOATTRNAME) {
|
|
|
|
len += JSOP_TOATTRNAME_LENGTH;
|
|
|
|
todo = SprintPut(&ss->sprinter, "@*", 2);
|
|
|
|
} else {
|
|
|
|
todo = SprintPut(&ss->sprinter, "*", 1);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
BEGIN_LITOPX_CASE(JSOP_QNAMEPART, 0)
|
|
|
|
if (pc[JSOP_QNAMEPART_LENGTH] == JSOP_TOATTRNAME) {
|
|
|
|
saveop = JSOP_TOATTRNAME;
|
|
|
|
len += JSOP_TOATTRNAME_LENGTH;
|
|
|
|
lval = "@";
|
|
|
|
goto do_qname;
|
|
|
|
}
|
|
|
|
goto do_name;
|
|
|
|
END_LITOPX_CASE
|
|
|
|
|
|
|
|
BEGIN_LITOPX_CASE(JSOP_QNAMECONST, 0)
|
|
|
|
rval = QuoteString(&ss->sprinter, ATOM_TO_STRING(atom), 0);
|
|
|
|
if (!rval)
|
|
|
|
return NULL;
|
|
|
|
RETRACT(&ss->sprinter, rval);
|
|
|
|
lval = POP_STR();
|
|
|
|
todo = Sprint(&ss->sprinter, "%s::%s", lval, rval);
|
|
|
|
END_LITOPX_CASE
|
|
|
|
|
|
|
|
case JSOP_QNAME:
|
|
|
|
rval = POP_STR();
|
|
|
|
lval = POP_STR();
|
|
|
|
todo = Sprint(&ss->sprinter, "%s::[%s]", lval, rval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_TOATTRNAME:
|
|
|
|
op = JSOP_NOP; /* turn off parens */
|
|
|
|
rval = POP_STR();
|
|
|
|
todo = Sprint(&ss->sprinter, "@[%s]", rval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_TOATTRVAL:
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_ADDATTRNAME:
|
|
|
|
rval = POP_STR();
|
|
|
|
lval = POP_STR();
|
|
|
|
todo = Sprint(&ss->sprinter, "%s %s", lval, rval);
|
|
|
|
/* This gets reset by all XML tag expressions. */
|
|
|
|
quoteAttr = JS_TRUE;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_ADDATTRVAL:
|
|
|
|
rval = POP_STR();
|
|
|
|
lval = POP_STR();
|
|
|
|
if (quoteAttr)
|
|
|
|
todo = Sprint(&ss->sprinter, "%s=\"%s\"", lval, rval);
|
|
|
|
else
|
|
|
|
todo = Sprint(&ss->sprinter, "%s=%s", lval, rval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_BINDXMLNAME:
|
|
|
|
/* Leave the name stacked and push a dummy string. */
|
|
|
|
todo = Sprint(&ss->sprinter, "");
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_SETXMLNAME:
|
|
|
|
/* Pop the r.h.s., the dummy string, and the name. */
|
|
|
|
rval = POP_STR();
|
|
|
|
(void) PopOff(ss, op);
|
|
|
|
lval = POP_STR();
|
|
|
|
goto do_setlval;
|
|
|
|
|
|
|
|
case JSOP_XMLELTEXPR:
|
|
|
|
case JSOP_XMLTAGEXPR:
|
|
|
|
todo = Sprint(&ss->sprinter, "{%s}", POP_STR());
|
|
|
|
inXML = JS_TRUE;
|
|
|
|
/* If we're an attribute value, we shouldn't quote this. */
|
|
|
|
quoteAttr = JS_FALSE;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_TOXMLLIST:
|
|
|
|
op = JSOP_NOP; /* turn off parens */
|
|
|
|
todo = Sprint(&ss->sprinter, "<>%s</>", POP_STR());
|
|
|
|
inXML = JS_FALSE;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_FOREACH:
|
|
|
|
foreach = JS_TRUE;
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_TOXML:
|
|
|
|
case JSOP_CALLXMLNAME:
|
|
|
|
case JSOP_XMLNAME:
|
|
|
|
case JSOP_FILTER:
|
|
|
|
/* These ops indicate the end of XML expressions. */
|
|
|
|
inXML = JS_FALSE;
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_ENDFILTER:
|
|
|
|
rval = POP_STR();
|
|
|
|
lval = POP_STR();
|
|
|
|
todo = Sprint(&ss->sprinter, "%s.(%s)", lval, rval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case JSOP_DESCENDANTS:
|
|
|
|
rval = POP_STR();
|
|
|
|
lval = POP_STR();
|
|
|
|
todo = Sprint(&ss->sprinter, "%s..%s", lval, rval);
|
|
|
|
break;
|
|
|
|
|
|
|
|
BEGIN_LITOPX_CASE(JSOP_XMLOBJECT, 0)
|
|
|
|
todo = Sprint(&ss->sprinter, "<xml address='%p'>",
|
|
|
|
ATOM_TO_OBJECT(atom));
|
|
|
|
END_LITOPX_CASE
|
|
|
|
|
|
|
|
BEGIN_LITOPX_CASE(JSOP_XMLCDATA, 0)
|
|
|
|
todo = SprintPut(&ss->sprinter, "<![CDATA[", 9);
|
|
|
|
if (!QuoteString(&ss->sprinter, ATOM_TO_STRING(atom),
|
|
|
|
DONT_ESCAPE))
|
|
|
|
return NULL;
|
|
|
|
SprintPut(&ss->sprinter, "]]>", 3);
|
|
|
|
END_LITOPX_CASE
|
|
|
|
|
|
|
|
BEGIN_LITOPX_CASE(JSOP_XMLCOMMENT, 0)
|
|
|
|
todo = SprintPut(&ss->sprinter, "<!--", 4);
|
|
|
|
if (!QuoteString(&ss->sprinter, ATOM_TO_STRING(atom),
|
|
|
|
DONT_ESCAPE))
|
|
|
|
return NULL;
|
|
|
|
SprintPut(&ss->sprinter, "-->", 3);
|
|
|
|
END_LITOPX_CASE
|
|
|
|
|
|
|
|
BEGIN_LITOPX_CASE(JSOP_XMLPI, 0)
|
|
|
|
rval = JS_strdup(cx, POP_STR());
|
|
|
|
if (!rval)
|
|
|
|
return NULL;
|
|
|
|
todo = SprintPut(&ss->sprinter, "<?", 2);
|
|
|
|
ok = QuoteString(&ss->sprinter, ATOM_TO_STRING(atom), 0) &&
|
|
|
|
(*rval == '\0' ||
|
|
|
|
(SprintPut(&ss->sprinter, " ", 1) >= 0 &&
|
|
|
|
SprintCString(&ss->sprinter, rval)));
|
|
|
|
JS_free(cx, (char *)rval);
|
|
|
|
if (!ok)
|
|
|
|
return NULL;
|
|
|
|
SprintPut(&ss->sprinter, "?>", 2);
|
|
|
|
END_LITOPX_CASE
|
|
|
|
|
|
|
|
case JSOP_GETFUNNS:
|
|
|
|
todo = SprintPut(&ss->sprinter, js_function_str, 8);
|
|
|
|
break;
|
|
|
|
#endif /* JS_HAS_XML_SUPPORT */
|
|
|
|
|
|
|
|
default:
|
|
|
|
todo = -2;
|
|
|
|
break;
|
|
|
|
|
|
|
|
#undef BEGIN_LITOPX_CASE
|
|
|
|
#undef END_LITOPX_CASE
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (todo < 0) {
|
|
|
|
/* -2 means "don't push", -1 means reported error. */
|
|
|
|
if (todo == -1)
|
|
|
|
return NULL;
|
|
|
|
} else {
|
|
|
|
if (!PushOff(ss, todo, saveop))
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (cs->format & JOF_CALLOP) {
|
|
|
|
todo = Sprint(&ss->sprinter, "");
|
|
|
|
if (todo < 0 || !PushOff(ss, todo, saveop))
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
pc += len;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Undefine local macros.
|
|
|
|
*/
|
|
|
|
#undef inXML
|
|
|
|
#undef DECOMPILE_CODE
|
|
|
|
#undef POP_STR
|
|
|
|
#undef LOCAL_ASSERT
|
|
|
|
#undef ATOM_IS_IDENTIFIER
|
|
|
|
#undef GET_QUOTE_AND_FMT
|
|
|
|
#undef GET_ATOM_QUOTE_AND_FMT
|
|
|
|
|
|
|
|
return pc;
|
|
|
|
}
|
|
|
|
|
|
|
|
JSBool
|
|
|
|
js_DecompileCode(JSPrinter *jp, JSScript *script, jsbytecode *pc, uintN len,
|
|
|
|
uintN pcdepth)
|
|
|
|
{
|
|
|
|
uintN depth, i;
|
|
|
|
SprintStack ss;
|
|
|
|
JSContext *cx;
|
|
|
|
void *mark;
|
|
|
|
JSBool ok;
|
|
|
|
JSScript *oldscript;
|
|
|
|
char *last;
|
|
|
|
|
|
|
|
depth = script->depth;
|
|
|
|
JS_ASSERT(pcdepth <= depth);
|
|
|
|
|
|
|
|
/* Initialize a sprinter for use with the offset stack. */
|
|
|
|
cx = jp->sprinter.context;
|
|
|
|
mark = JS_ARENA_MARK(&cx->tempPool);
|
|
|
|
ok = InitSprintStack(cx, &ss, jp, depth);
|
|
|
|
if (!ok)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If we are called from js_DecompileValueGenerator with a portion of
|
|
|
|
* script's bytecode that starts with a non-zero model stack depth given
|
|
|
|
* by pcdepth, attempt to initialize the missing string offsets in ss to
|
|
|
|
* |spindex| negative indexes from fp->sp for the activation fp in which
|
|
|
|
* the error arose.
|
|
|
|
*
|
|
|
|
* See js_DecompileValueGenerator for how its |spindex| parameter is used,
|
|
|
|
* and see also GetOff, which makes use of the ss.offsets[i] < -1 that are
|
|
|
|
* potentially stored below.
|
|
|
|
*/
|
|
|
|
ss.top = pcdepth;
|
|
|
|
if (pcdepth != 0) {
|
|
|
|
JSStackFrame *fp;
|
|
|
|
ptrdiff_t top;
|
|
|
|
|
|
|
|
for (fp = cx->fp; fp && !fp->script; fp = fp->down)
|
|
|
|
continue;
|
|
|
|
top = fp ? fp->sp - fp->spbase : 0;
|
|
|
|
for (i = 0; i < pcdepth; i++) {
|
|
|
|
ss.offsets[i] = -1;
|
|
|
|
ss.opcodes[i] = JSOP_NOP;
|
|
|
|
}
|
|
|
|
if (fp && fp->pc == pc && (uintN)top == pcdepth) {
|
|
|
|
for (i = 0; i < pcdepth; i++) {
|
|
|
|
ptrdiff_t off;
|
|
|
|
jsbytecode *genpc;
|
|
|
|
|
|
|
|
off = (intN)i - (intN)depth;
|
|
|
|
genpc = (jsbytecode *) fp->spbase[off];
|
|
|
|
if (JS_UPTRDIFF(genpc, script->code) < script->length) {
|
|
|
|
ss.offsets[i] += (ptrdiff_t)i - top;
|
|
|
|
ss.opcodes[i] = *genpc;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Call recursive subroutine to do the hard work. */
|
|
|
|
oldscript = jp->script;
|
|
|
|
jp->script = script;
|
|
|
|
ok = Decompile(&ss, pc, len) != NULL;
|
|
|
|
jp->script = oldscript;
|
|
|
|
|
|
|
|
/* If the given code didn't empty the stack, do it now. */
|
|
|
|
if (ss.top) {
|
|
|
|
do {
|
|
|
|
last = OFF2STR(&ss.sprinter, PopOff(&ss, JSOP_POP));
|
|
|
|
} while (ss.top > pcdepth);
|
|
|
|
js_printf(jp, "%s", last);
|
|
|
|
}
|
|
|
|
|
|
|
|
out:
|
|
|
|
/* Free all temporary stuff allocated under this call. */
|
|
|
|
JS_ARENA_RELEASE(&cx->tempPool, mark);
|
|
|
|
return ok;
|
|
|
|
}
|
|
|
|
|
|
|
|
JSBool
|
|
|
|
js_DecompileScript(JSPrinter *jp, JSScript *script)
|
|
|
|
{
|
|
|
|
return js_DecompileCode(jp, script, script->code, (uintN)script->length, 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static const char native_code_str[] = "\t[native code]\n";
|
|
|
|
|
|
|
|
JSBool
|
|
|
|
js_DecompileFunctionBody(JSPrinter *jp, JSFunction *fun)
|
|
|
|
{
|
|
|
|
JSScript *script;
|
|
|
|
JSScope *scope, *save;
|
|
|
|
JSBool ok;
|
|
|
|
|
|
|
|
if (!FUN_INTERPRETED(fun)) {
|
|
|
|
js_printf(jp, native_code_str);
|
|
|
|
return JS_TRUE;
|
|
|
|
}
|
|
|
|
script = fun->u.i.script;
|
|
|
|
scope = fun->object ? OBJ_SCOPE(fun->object) : NULL;
|
|
|
|
save = jp->scope;
|
|
|
|
jp->scope = scope;
|
|
|
|
ok = js_DecompileCode(jp, script, script->code, (uintN)script->length, 0);
|
|
|
|
jp->scope = save;
|
|
|
|
return ok;
|
|
|
|
}
|
|
|
|
|
|
|
|
JSBool
|
|
|
|
js_DecompileFunction(JSPrinter *jp, JSFunction *fun)
|
|
|
|
{
|
|
|
|
JSContext *cx;
|
|
|
|
uintN i, nargs, indent;
|
|
|
|
void *mark;
|
|
|
|
JSAtom **params;
|
|
|
|
JSScope *scope, *oldscope;
|
|
|
|
JSScopeProperty *sprop;
|
|
|
|
jsbytecode *pc, *endpc;
|
|
|
|
ptrdiff_t len;
|
|
|
|
JSBool ok;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If pretty, conform to ECMA-262 Edition 3, 15.3.4.2, by decompiling a
|
|
|
|
* FunctionDeclaration. Otherwise, check the JSFUN_LAMBDA flag and force
|
|
|
|
* an expression by parenthesizing.
|
|
|
|
*/
|
|
|
|
if (jp->pretty) {
|
|
|
|
js_printf(jp, "\t");
|
|
|
|
} else {
|
|
|
|
if (!jp->grouped && (fun->flags & JSFUN_LAMBDA))
|
|
|
|
js_puts(jp, "(");
|
|
|
|
}
|
|
|
|
if (JSFUN_GETTER_TEST(fun->flags))
|
|
|
|
js_printf(jp, "%s ", js_getter_str);
|
|
|
|
else if (JSFUN_SETTER_TEST(fun->flags))
|
|
|
|
js_printf(jp, "%s ", js_setter_str);
|
|
|
|
|
|
|
|
js_printf(jp, "%s ", js_function_str);
|
|
|
|
if (fun->atom && !QuoteString(&jp->sprinter, ATOM_TO_STRING(fun->atom), 0))
|
|
|
|
return JS_FALSE;
|
|
|
|
js_puts(jp, "(");
|
|
|
|
|
|
|
|
if (FUN_INTERPRETED(fun) && fun->object) {
|
|
|
|
size_t paramsize;
|
|
|
|
#ifdef JS_HAS_DESTRUCTURING
|
|
|
|
SprintStack ss;
|
|
|
|
JSScript *oldscript;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Print the parameters.
|
|
|
|
*
|
|
|
|
* This code is complicated by the need to handle duplicate parameter
|
|
|
|
* names, as required by ECMA (bah!). A duplicate parameter is stored
|
|
|
|
* as another node with the same id (the parameter name) but different
|
|
|
|
* shortid (the argument index) along the property tree ancestor line
|
|
|
|
* starting at SCOPE_LAST_PROP(scope). Only the last duplicate param
|
|
|
|
* is mapped by the scope's hash table.
|
|
|
|
*/
|
|
|
|
cx = jp->sprinter.context;
|
|
|
|
nargs = fun->nargs;
|
|
|
|
mark = JS_ARENA_MARK(&cx->tempPool);
|
|
|
|
paramsize = nargs * sizeof(JSAtom *);
|
|
|
|
JS_ARENA_ALLOCATE_CAST(params, JSAtom **, &cx->tempPool, paramsize);
|
|
|
|
if (!params) {
|
|
|
|
JS_ReportOutOfMemory(cx);
|
|
|
|
return JS_FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
memset(params, 0, paramsize);
|
|
|
|
scope = OBJ_SCOPE(fun->object);
|
|
|
|
for (sprop = SCOPE_LAST_PROP(scope); sprop; sprop = sprop->parent) {
|
|
|
|
if (sprop->getter != js_GetArgument)
|
|
|
|
continue;
|
|
|
|
JS_ASSERT(sprop->flags & SPROP_HAS_SHORTID);
|
|
|
|
JS_ASSERT((uint16) sprop->shortid < nargs);
|
|
|
|
JS_ASSERT(JSID_IS_ATOM(sprop->id));
|
|
|
|
params[(uint16) sprop->shortid] = JSID_TO_ATOM(sprop->id);
|
|
|
|
}
|
|
|
|
|
|
|
|
pc = fun->u.i.script->main;
|
|
|
|
endpc = pc + fun->u.i.script->length;
|
|
|
|
ok = JS_TRUE;
|
|
|
|
|
|
|
|
#ifdef JS_HAS_DESTRUCTURING
|
|
|
|
/* Skip JSOP_GENERATOR in case of destructuring parameters. */
|
|
|
|
if (*pc == JSOP_GENERATOR)
|
|
|
|
pc += JSOP_GENERATOR_LENGTH;
|
|
|
|
|
|
|
|
ss.printer = NULL;
|
|
|
|
oldscript = jp->script;
|
|
|
|
jp->script = fun->u.i.script;
|
|
|
|
oldscope = jp->scope;
|
|
|
|
jp->scope = scope;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
for (i = 0; i < nargs; i++) {
|
|
|
|
if (i > 0)
|
|
|
|
js_puts(jp, ", ");
|
|
|
|
|
|
|
|
#if JS_HAS_DESTRUCTURING
|
|
|
|
#define LOCAL_ASSERT(expr) LOCAL_ASSERT_RV(expr, JS_FALSE)
|
|
|
|
|
|
|
|
if (!params[i]) {
|
|
|
|
ptrdiff_t todo;
|
|
|
|
const char *lval;
|
|
|
|
|
|
|
|
LOCAL_ASSERT(*pc == JSOP_GETARG);
|
|
|
|
pc += JSOP_GETARG_LENGTH;
|
|
|
|
LOCAL_ASSERT(*pc == JSOP_DUP);
|
|
|
|
if (!ss.printer) {
|
|
|
|
ok = InitSprintStack(cx, &ss, jp, fun->u.i.script->depth);
|
|
|
|
if (!ok)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
pc = DecompileDestructuring(&ss, pc, endpc);
|
|
|
|
if (!pc) {
|
|
|
|
ok = JS_FALSE;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
LOCAL_ASSERT(*pc == JSOP_POP);
|
|
|
|
pc += JSOP_POP_LENGTH;
|
|
|
|
lval = PopStr(&ss, JSOP_NOP);
|
|
|
|
todo = SprintCString(&jp->sprinter, lval);
|
|
|
|
if (todo < 0) {
|
|
|
|
ok = JS_FALSE;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
#undef LOCAL_ASSERT
|
|
|
|
#endif
|
|
|
|
|
|
|
|
if (!QuoteString(&jp->sprinter, ATOM_TO_STRING(params[i]), 0)) {
|
|
|
|
ok = JS_FALSE;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef JS_HAS_DESTRUCTURING
|
|
|
|
jp->script = oldscript;
|
|
|
|
jp->scope = oldscope;
|
|
|
|
#endif
|
|
|
|
JS_ARENA_RELEASE(&cx->tempPool, mark);
|
|
|
|
if (!ok)
|
|
|
|
return JS_FALSE;
|
|
|
|
#ifdef __GNUC__
|
|
|
|
} else {
|
|
|
|
scope = NULL;
|
|
|
|
pc = NULL;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
js_printf(jp, ") {\n");
|
|
|
|
indent = jp->indent;
|
|
|
|
jp->indent += 4;
|
|
|
|
if (FUN_INTERPRETED(fun) && fun->object) {
|
|
|
|
oldscope = jp->scope;
|
|
|
|
jp->scope = scope;
|
|
|
|
len = fun->u.i.script->code + fun->u.i.script->length - pc;
|
|
|
|
ok = js_DecompileCode(jp, fun->u.i.script, pc, (uintN)len, 0);
|
|
|
|
jp->scope = oldscope;
|
|
|
|
if (!ok) {
|
|
|
|
jp->indent = indent;
|
|
|
|
return JS_FALSE;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
js_printf(jp, native_code_str);
|
|
|
|
}
|
|
|
|
jp->indent -= 4;
|
|
|
|
js_printf(jp, "\t}");
|
|
|
|
|
|
|
|
if (!jp->pretty) {
|
|
|
|
if (!jp->grouped && (fun->flags & JSFUN_LAMBDA))
|
|
|
|
js_puts(jp, ")");
|
|
|
|
}
|
|
|
|
return JS_TRUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
#undef LOCAL_ASSERT_RV
|
|
|
|
|
|
|
|
char *
|
|
|
|
js_DecompileValueGenerator(JSContext *cx, intN spindex, jsval v,
|
|
|
|
JSString *fallback)
|
|
|
|
{
|
|
|
|
JSStackFrame *fp, *down;
|
|
|
|
jsbytecode *pc, *begin, *end;
|
|
|
|
jsval *sp, *spbase, *base, *limit;
|
|
|
|
intN depth, pcdepth;
|
|
|
|
JSScript *script;
|
|
|
|
JSOp op;
|
|
|
|
const JSCodeSpec *cs;
|
|
|
|
jssrcnote *sn;
|
|
|
|
ptrdiff_t len, oplen;
|
|
|
|
JSPrinter *jp;
|
|
|
|
char *name;
|
|
|
|
|
|
|
|
for (fp = cx->fp; fp && !fp->script; fp = fp->down)
|
|
|
|
continue;
|
|
|
|
if (!fp)
|
|
|
|
goto do_fallback;
|
|
|
|
|
|
|
|
/* Try to find sp's generating pc depth slots under it on the stack. */
|
|
|
|
pc = fp->pc;
|
|
|
|
sp = fp->sp;
|
|
|
|
spbase = fp->spbase;
|
|
|
|
if ((uintN)(sp - spbase) > fp->script->depth) {
|
|
|
|
/*
|
|
|
|
* Preparing to make an internal invocation, using an argv stack
|
|
|
|
* segment pushed just above fp's operand stack space. Such an argv
|
|
|
|
* stack has no generating pc "basement", so we must fall back.
|
|
|
|
*/
|
|
|
|
goto do_fallback;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (spindex == JSDVG_SEARCH_STACK) {
|
|
|
|
if (!pc) {
|
|
|
|
/*
|
|
|
|
* Current frame is native: look under it for a scripted call
|
|
|
|
* in which a decompilable bytecode string that generated the
|
|
|
|
* value as an actual argument might exist.
|
|
|
|
*/
|
|
|
|
JS_ASSERT(!fp->script && !(fp->fun && FUN_INTERPRETED(fp->fun)));
|
|
|
|
down = fp->down;
|
|
|
|
if (!down)
|
|
|
|
goto do_fallback;
|
|
|
|
script = down->script;
|
|
|
|
spbase = down->spbase;
|
|
|
|
base = fp->argv;
|
|
|
|
limit = base + fp->argc;
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* This should be a script activation, either a top-level
|
|
|
|
* script or a scripted function. But be paranoid about calls
|
|
|
|
* to js_DecompileValueGenerator from code that hasn't fully
|
|
|
|
* initialized a (default-all-zeroes) frame.
|
|
|
|
*/
|
|
|
|
script = fp->script;
|
|
|
|
spbase = base = fp->spbase;
|
|
|
|
limit = fp->sp;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Pure paranoia about default-zeroed frames being active while
|
|
|
|
* js_DecompileValueGenerator is called. It can't hurt much now;
|
|
|
|
* error reporting performance is not an issue.
|
|
|
|
*/
|
|
|
|
if (!script || !base || !limit)
|
|
|
|
goto do_fallback;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Try to find operand-generating pc depth slots below sp.
|
|
|
|
*
|
|
|
|
* In the native case, we know the arguments have generating pc's
|
|
|
|
* under them, on account of fp->down->script being non-null: all
|
|
|
|
* compiled scripts get depth slots for generating pc's allocated
|
|
|
|
* upon activation, at the top of js_Interpret.
|
|
|
|
*
|
|
|
|
* In the script or scripted function case, the same reasoning
|
|
|
|
* applies to fp rather than to fp->down.
|
|
|
|
*
|
|
|
|
* We search from limit to base to find the most recently calculated
|
|
|
|
* value matching v under assumption that it is it that caused
|
|
|
|
* exception, see bug 328664.
|
|
|
|
*/
|
|
|
|
for (sp = limit;;) {
|
|
|
|
if (sp <= base)
|
|
|
|
goto do_fallback;
|
|
|
|
--sp;
|
|
|
|
if (*sp == v) {
|
|
|
|
depth = (intN)script->depth;
|
|
|
|
sp -= depth;
|
|
|
|
pc = (jsbytecode *) *sp;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* At this point, pc may or may not be null, i.e., we could be in
|
|
|
|
* a script activation, or we could be in a native frame that was
|
|
|
|
* called by another native function. Check pc and script.
|
|
|
|
*/
|
|
|
|
if (!pc)
|
|
|
|
goto do_fallback;
|
|
|
|
script = fp->script;
|
|
|
|
if (!script)
|
|
|
|
goto do_fallback;
|
|
|
|
|
|
|
|
if (spindex != JSDVG_IGNORE_STACK) {
|
|
|
|
JS_ASSERT(spindex < 0);
|
|
|
|
depth = (intN)script->depth;
|
|
|
|
#if !JS_HAS_NO_SUCH_METHOD
|
|
|
|
JS_ASSERT(-depth <= spindex);
|
|
|
|
#endif
|
|
|
|
spindex -= depth;
|
|
|
|
|
|
|
|
base = (jsval *) cx->stackPool.current->base;
|
|
|
|
limit = (jsval *) cx->stackPool.current->avail;
|
|
|
|
sp = fp->sp + spindex;
|
|
|
|
if (JS_UPTRDIFF(sp, base) < JS_UPTRDIFF(limit, base))
|
|
|
|
pc = (jsbytecode *) *sp;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Again, be paranoid, this time about possibly loading an invalid pc
|
|
|
|
* from fp->sp[-(1+depth)].
|
|
|
|
*/
|
|
|
|
if (JS_UPTRDIFF(pc, script->code) >= (jsuword)script->length) {
|
|
|
|
pc = fp->pc;
|
|
|
|
if (!pc)
|
|
|
|
goto do_fallback;
|
|
|
|
}
|
|
|
|
op = (JSOp) *pc;
|
|
|
|
if (op == JSOP_TRAP)
|
|
|
|
op = JS_GetTrapOpcode(cx, script, pc);
|
|
|
|
|
|
|
|
/* None of these stack-writing ops generates novel values. */
|
|
|
|
JS_ASSERT(op != JSOP_CASE && op != JSOP_CASEX &&
|
|
|
|
op != JSOP_DUP && op != JSOP_DUP2 &&
|
|
|
|
op != JSOP_SWAP);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* |this| could convert to a very long object initialiser, so cite it by
|
|
|
|
* its keyword name instead.
|
|
|
|
*/
|
|
|
|
if (op == JSOP_THIS)
|
|
|
|
return JS_strdup(cx, js_this_str);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* JSOP_BINDNAME is special: it generates a value, the base object of a
|
|
|
|
* reference. But if it is the generating op for a diagnostic produced by
|
|
|
|
* js_DecompileValueGenerator, the name being bound is irrelevant. Just
|
|
|
|
* fall back to the base object.
|
|
|
|
*/
|
|
|
|
if (op == JSOP_BINDNAME)
|
|
|
|
goto do_fallback;
|
|
|
|
|
|
|
|
/* NAME ops are self-contained, others require left or right context. */
|
|
|
|
cs = &js_CodeSpec[op];
|
|
|
|
begin = pc;
|
|
|
|
end = pc + cs->length;
|
|
|
|
switch (cs->format & JOF_MODEMASK) {
|
|
|
|
case JOF_PROP:
|
|
|
|
case JOF_ELEM:
|
|
|
|
case JOF_XMLNAME:
|
|
|
|
case 0:
|
|
|
|
sn = js_GetSrcNote(script, pc);
|
|
|
|
if (!sn)
|
|
|
|
goto do_fallback;
|
|
|
|
switch (SN_TYPE(sn)) {
|
|
|
|
case SRC_PCBASE:
|
|
|
|
begin -= js_GetSrcNoteOffset(sn, 0);
|
|
|
|
break;
|
|
|
|
case SRC_PCDELTA:
|
|
|
|
end = begin + js_GetSrcNoteOffset(sn, 0);
|
|
|
|
begin += cs->length;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
goto do_fallback;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
default:;
|
|
|
|
}
|
|
|
|
len = PTRDIFF(end, begin, jsbytecode);
|
|
|
|
if (len <= 0)
|
|
|
|
goto do_fallback;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Walk forward from script->main and compute starting stack depth.
|
|
|
|
* FIXME: Code to compute oplen copied from js_Disassemble1 and reduced.
|
|
|
|
* FIXME: Optimize to use last empty-stack sequence point.
|
|
|
|
*/
|
|
|
|
pcdepth = 0;
|
|
|
|
for (pc = script->main; pc < begin; pc += oplen) {
|
|
|
|
uint32 type;
|
|
|
|
intN nuses, ndefs;
|
|
|
|
|
|
|
|
op = (JSOp) *pc;
|
|
|
|
if (op == JSOP_TRAP)
|
|
|
|
op = JS_GetTrapOpcode(cx, script, pc);
|
|
|
|
cs = &js_CodeSpec[op];
|
|
|
|
oplen = cs->length;
|
|
|
|
|
|
|
|
if (op == JSOP_SETSP) {
|
|
|
|
pcdepth = GET_UINT16(pc);
|
|
|
|
continue;
|
|
|
|
}
|
2007-05-06 23:40:10 -07:00
|
|
|
if (op == JSOP_POPN) {
|
|
|
|
pcdepth -= GET_UINT16(pc);
|
|
|
|
continue;
|
|
|
|
}
|
2007-03-22 10:30:00 -07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* A (C ? T : E) expression requires skipping either T (if begin is in
|
|
|
|
* E) or both T and E (if begin is after the whole expression) before
|
|
|
|
* adjusting pcdepth based on the JSOP_IFEQ or JSOP_IFEQX at pc that
|
|
|
|
* tests condition C. We know that the stack depth can't change from
|
|
|
|
* what it was with C on top of stack.
|
|
|
|
*/
|
|
|
|
sn = js_GetSrcNote(script, pc);
|
|
|
|
if (sn && SN_TYPE(sn) == SRC_COND) {
|
|
|
|
ptrdiff_t jmpoff, jmplen;
|
|
|
|
|
|
|
|
jmpoff = js_GetSrcNoteOffset(sn, 0);
|
|
|
|
if (pc + jmpoff < begin) {
|
|
|
|
pc += jmpoff;
|
|
|
|
op = *pc;
|
|
|
|
JS_ASSERT(op == JSOP_GOTO || op == JSOP_GOTOX);
|
|
|
|
cs = &js_CodeSpec[op];
|
|
|
|
oplen = cs->length;
|
|
|
|
jmplen = GetJumpOffset(pc, pc);
|
|
|
|
if (pc + jmplen < begin) {
|
|
|
|
oplen = (uintN) jmplen;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Ok, begin lies in E. Manually pop C off the model stack,
|
|
|
|
* since we have moved beyond the IFEQ now.
|
|
|
|
*/
|
|
|
|
--pcdepth;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
type = cs->format & JOF_TYPEMASK;
|
|
|
|
switch (type) {
|
|
|
|
case JOF_TABLESWITCH:
|
|
|
|
case JOF_TABLESWITCHX:
|
|
|
|
{
|
|
|
|
jsint jmplen, i, low, high;
|
|
|
|
jsbytecode *pc2;
|
|
|
|
|
|
|
|
jmplen = (type == JOF_TABLESWITCH) ? JUMP_OFFSET_LEN
|
|
|
|
: JUMPX_OFFSET_LEN;
|
|
|
|
pc2 = pc;
|
|
|
|
pc2 += jmplen;
|
|
|
|
low = GET_JUMP_OFFSET(pc2);
|
|
|
|
pc2 += JUMP_OFFSET_LEN;
|
|
|
|
high = GET_JUMP_OFFSET(pc2);
|
|
|
|
pc2 += JUMP_OFFSET_LEN;
|
|
|
|
for (i = low; i <= high; i++)
|
|
|
|
pc2 += jmplen;
|
|
|
|
oplen = 1 + pc2 - pc;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case JOF_LOOKUPSWITCH:
|
|
|
|
case JOF_LOOKUPSWITCHX:
|
|
|
|
{
|
|
|
|
jsint jmplen;
|
|
|
|
jsbytecode *pc2;
|
|
|
|
jsatomid npairs;
|
|
|
|
|
|
|
|
jmplen = (type == JOF_LOOKUPSWITCH) ? JUMP_OFFSET_LEN
|
|
|
|
: JUMPX_OFFSET_LEN;
|
|
|
|
pc2 = pc;
|
|
|
|
pc2 += jmplen;
|
|
|
|
npairs = GET_UINT16(pc2);
|
|
|
|
pc2 += ATOM_INDEX_LEN;
|
|
|
|
while (npairs) {
|
|
|
|
pc2 += ATOM_INDEX_LEN;
|
|
|
|
pc2 += jmplen;
|
|
|
|
npairs--;
|
|
|
|
}
|
|
|
|
oplen = 1 + pc2 - pc;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
default:;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (sn && SN_TYPE(sn) == SRC_HIDDEN)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
nuses = cs->nuses;
|
|
|
|
if (nuses < 0) {
|
|
|
|
/* Call opcode pushes [callee, this, argv...]. */
|
|
|
|
nuses = 2 + GET_ARGC(pc);
|
|
|
|
} else if (op == JSOP_RETSUB) {
|
|
|
|
/* Pop [exception or hole, retsub pc-index]. */
|
|
|
|
JS_ASSERT(nuses == 0);
|
|
|
|
nuses = 2;
|
|
|
|
} else if (op == JSOP_LEAVEBLOCK || op == JSOP_LEAVEBLOCKEXPR) {
|
|
|
|
JS_ASSERT(nuses == 0);
|
|
|
|
nuses = GET_UINT16(pc);
|
|
|
|
}
|
|
|
|
pcdepth -= nuses;
|
|
|
|
JS_ASSERT(pcdepth >= 0);
|
|
|
|
|
|
|
|
ndefs = cs->ndefs;
|
|
|
|
if (op == JSOP_FINALLY) {
|
|
|
|
/* Push [exception or hole, retsub pc-index]. */
|
|
|
|
JS_ASSERT(ndefs == 0);
|
|
|
|
ndefs = 2;
|
|
|
|
} else if (op == JSOP_ENTERBLOCK) {
|
|
|
|
JSAtom *atom;
|
|
|
|
JSObject *obj;
|
|
|
|
|
|
|
|
JS_ASSERT(ndefs == 0);
|
|
|
|
atom = js_GetAtomFromBytecode(script, pc, 0);
|
|
|
|
obj = ATOM_TO_OBJECT(atom);
|
|
|
|
JS_ASSERT(OBJ_BLOCK_DEPTH(cx, obj) == pcdepth);
|
|
|
|
ndefs = OBJ_BLOCK_COUNT(cx, obj);
|
|
|
|
}
|
|
|
|
pcdepth += ndefs;
|
|
|
|
}
|
|
|
|
|
|
|
|
name = NULL;
|
2007-04-10 06:29:10 -07:00
|
|
|
jp = JS_NEW_PRINTER(cx, "js_DecompileValueGenerator", 0, JS_FALSE);
|
2007-03-22 10:30:00 -07:00
|
|
|
if (jp) {
|
|
|
|
if (fp->fun && fp->fun->object) {
|
|
|
|
JS_ASSERT(OBJ_IS_NATIVE(fp->fun->object));
|
|
|
|
jp->scope = OBJ_SCOPE(fp->fun->object);
|
|
|
|
}
|
|
|
|
jp->dvgfence = end;
|
|
|
|
if (js_DecompileCode(jp, script, begin, (uintN)len, (uintN)pcdepth)) {
|
|
|
|
name = (jp->sprinter.base) ? jp->sprinter.base : "";
|
|
|
|
name = JS_strdup(cx, name);
|
|
|
|
}
|
|
|
|
js_DestroyPrinter(jp);
|
|
|
|
}
|
|
|
|
return name;
|
|
|
|
|
|
|
|
do_fallback:
|
|
|
|
if (!fallback) {
|
|
|
|
fallback = js_ValueToSource(cx, v);
|
|
|
|
if (!fallback)
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
return js_DeflateString(cx, JSSTRING_CHARS(fallback),
|
|
|
|
JSSTRING_LENGTH(fallback));
|
|
|
|
}
|