Mirrors_Framework/mujs
1
0
Fork 0
mirror of https://github.com/ccxvii/mujs.git synced 2026-09-20 22:23:44 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

Check for value stack overflow.

Browse Source
This commit is contained in:
Tor Andersson
2014-02-05 16:47:36 +01:00
parent 71afe58cc4
commit 591ea21f8f
2 changed files with 23 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
jsi.h
-1
View File
@@ -24,7 +24,6 @@ typedef struct js_Jumpbuf js_Jumpbuf;
/* Limits */
#define JS_STACKSIZE 256 /* value stack size */
#define JS_MINSTACK 20 /* at least this much available when entering a function */
#define JS_TRYLIMIT 64 /* exception stack size */
#define JS_GCLIMIT 10000 /* run gc cycle every N allocations */
jsrun.c
+23
View File
@@ -11,26 +11,40 @@ static void jsR_run(js_State *J, js_Function *F);
#define TOP (J->top)
#define BOT (J->bot)
static void js_stackoverflow(js_State *J)
{
STACK[TOP].type = JS_TSTRING;
STACK[TOP].u.string = "stack overflow";
++TOP;
js_throw(J);
}
#define CHECKSTACK(n) if (TOP + n >= JS_STACKSIZE) js_stackoverflow(J)
void js_pushvalue(js_State *J, js_Value v)
{
CHECKSTACK(1);
STACK[TOP] = v;
++TOP;
}
void js_pushundefined(js_State *J)
{
CHECKSTACK(1);
STACK[TOP].type = JS_TUNDEFINED;
++TOP;
}
void js_pushnull(js_State *J)
{
CHECKSTACK(1);
STACK[TOP].type = JS_TNULL;
++TOP;
}
void js_pushboolean(js_State *J, int v)
{
CHECKSTACK(1);
STACK[TOP].type = JS_TBOOLEAN;
STACK[TOP].u.boolean = !!v;
++TOP;
@@ -38,6 +52,7 @@ void js_pushboolean(js_State *J, int v)
void js_pushnumber(js_State *J, double v)
{
CHECKSTACK(1);
STACK[TOP].type = JS_TNUMBER;
STACK[TOP].u.number = v;
++TOP;
@@ -45,6 +60,7 @@ void js_pushnumber(js_State *J, double v)
void js_pushstring(js_State *J, const char *v)
{
CHECKSTACK(1);
STACK[TOP].type = JS_TSTRING;
STACK[TOP].u.string = js_intern(J, v);
++TOP;
@@ -73,6 +89,7 @@ void js_pushlstring(js_State *J, const char *v, int n)
void js_pushliteral(js_State *J, const char *v)
{
CHECKSTACK(1);
STACK[TOP].type = JS_TSTRING;
STACK[TOP].u.string = v;
++TOP;
@@ -80,6 +97,7 @@ void js_pushliteral(js_State *J, const char *v)
void js_pushobject(js_State *J, js_Object *v)
{
CHECKSTACK(1);
STACK[TOP].type = JS_TOBJECT;
STACK[TOP].u.object = v;
++TOP;
@@ -237,18 +255,21 @@ void js_pop(js_State *J, int n)
void js_copy(js_State *J, int idx)
{
CHECKSTACK(1);
STACK[TOP] = *stackidx(J, idx);
++TOP;
}
void js_dup(js_State *J)
{
CHECKSTACK(1);
STACK[TOP] = STACK[TOP-1];
++TOP;
}
void js_dup2(js_State *J)
{
CHECKSTACK(2);
STACK[TOP] = STACK[TOP-2];
STACK[TOP+1] = STACK[TOP-1];
TOP += 2;
@@ -287,6 +308,7 @@ void js_rot3pop2(js_State *J)
void js_dup1rot3(js_State *J)
{
CHECKSTACK(1);
/* A B -> B A B */
STACK[TOP] = STACK[TOP-1]; /* A B B */
STACK[TOP-1] = STACK[TOP-2]; /* A A B */
@@ -296,6 +318,7 @@ void js_dup1rot3(js_State *J)
void js_dup1rot4(js_State *J)
{
CHECKSTACK(1);
/* A B C -> C A B C */
STACK[TOP] = STACK[TOP-1]; /* A B C C */
STACK[TOP-1] = STACK[TOP-2]; /* A B B C */