mirror of
https://github.com/openwrt/openwrt.git
synced 2024-12-21 06:33:41 +00:00
lua: clean up patch fuzz
Refresh patches to tidy up fuzz. No functional changes Signed-off-by: Kevin Darbyshire-Bryant <ldir@darbyshire-bryant.me.uk>
This commit is contained in:
parent
b61a648e4a
commit
4e800716ac
@ -1009,6 +1009,7 @@
|
|||||||
-#define PI (3.14159265358979323846)
|
-#define PI (3.14159265358979323846)
|
||||||
-#define RADIANS_PER_DEGREE (PI/180.0)
|
-#define RADIANS_PER_DEGREE (PI/180.0)
|
||||||
-
|
-
|
||||||
|
-
|
||||||
+#ifdef LNUM_FLOAT
|
+#ifdef LNUM_FLOAT
|
||||||
+# define PI (3.14159265358979323846F)
|
+# define PI (3.14159265358979323846F)
|
||||||
+#elif defined(M_PI)
|
+#elif defined(M_PI)
|
||||||
@ -1017,7 +1018,7 @@
|
|||||||
+# define PI (3.14159265358979323846264338327950288)
|
+# define PI (3.14159265358979323846264338327950288)
|
||||||
+#endif
|
+#endif
|
||||||
+#define RADIANS_PER_DEGREE (PI/180)
|
+#define RADIANS_PER_DEGREE (PI/180)
|
||||||
|
+
|
||||||
+#undef HUGE
|
+#undef HUGE
|
||||||
+#ifdef LNUM_FLOAT
|
+#ifdef LNUM_FLOAT
|
||||||
+# define HUGE HUGE_VALF
|
+# define HUGE HUGE_VALF
|
||||||
@ -3421,10 +3422,10 @@
|
|||||||
+ case TM_POW: if (try_powint( ri, ib, ic)) return; break;
|
+ case TM_POW: if (try_powint( ri, ib, ic)) return; break;
|
||||||
+ case TM_UNM: if (try_unmint( ri, ib)) return; break;
|
+ case TM_UNM: if (try_unmint( ri, ib)) return; break;
|
||||||
+ default: lua_assert(0);
|
+ default: lua_assert(0);
|
||||||
+ }
|
}
|
||||||
+ }
|
+ }
|
||||||
+ /* Fallback to floating point, when leaving range. */
|
+ /* Fallback to floating point, when leaving range. */
|
||||||
+
|
|
||||||
+#ifdef LNUM_COMPLEX
|
+#ifdef LNUM_COMPLEX
|
||||||
+ if ((nvalue_img(b)!=0) || (nvalue_img(c)!=0)) {
|
+ if ((nvalue_img(b)!=0) || (nvalue_img(c)!=0)) {
|
||||||
+ lua_Complex r;
|
+ lua_Complex r;
|
||||||
@ -3444,7 +3445,7 @@
|
|||||||
+ default: lua_assert(0); r=0;
|
+ default: lua_assert(0); r=0;
|
||||||
+ }
|
+ }
|
||||||
+ setnvalue_complex( ra, r );
|
+ setnvalue_complex( ra, r );
|
||||||
}
|
+ }
|
||||||
+ return;
|
+ return;
|
||||||
+ }
|
+ }
|
||||||
+#endif
|
+#endif
|
||||||
@ -3465,7 +3466,7 @@
|
|||||||
+ if (!call_binTM(L, rb, rc, ra, op))
|
+ if (!call_binTM(L, rb, rc, ra, op))
|
||||||
+ luaG_aritherror(L, rb, rc);
|
+ luaG_aritherror(L, rb, rc);
|
||||||
+}
|
+}
|
||||||
|
+
|
||||||
+/* Helper macro to sort arithmetic operations into four categories:
|
+/* Helper macro to sort arithmetic operations into four categories:
|
||||||
+ * TK_INT: integer - integer operands
|
+ * TK_INT: integer - integer operands
|
||||||
+ * TK_NUMBER: number - number (non complex, either may be integer)
|
+ * TK_NUMBER: number - number (non complex, either may be integer)
|
||||||
|
@ -1,6 +1,6 @@
|
|||||||
--- a/src/lvm.c
|
--- a/src/lvm.c
|
||||||
+++ b/src/lvm.c
|
+++ b/src/lvm.c
|
||||||
@@ -284,7 +284,8 @@ int luaV_lessthan (lua_State *L, const T
|
@@ -281,7 +281,8 @@ int luaV_lessthan (lua_State *L, const T
|
||||||
else
|
else
|
||||||
return luai_numlt( nvalue_fast(l), cast_num(ivalue(r)) );
|
return luai_numlt( nvalue_fast(l), cast_num(ivalue(r)) );
|
||||||
|
|
||||||
@ -10,7 +10,7 @@
|
|||||||
return res;
|
return res;
|
||||||
|
|
||||||
return luaG_ordererror(L, l, r);
|
return luaG_ordererror(L, l, r);
|
||||||
@@ -322,7 +323,8 @@ static int lessequal (lua_State *L, cons
|
@@ -319,7 +320,8 @@ static int lessequal (lua_State *L, cons
|
||||||
else
|
else
|
||||||
return luai_numle( nvalue_fast(l), cast_num(ivalue(r)) );
|
return luai_numle( nvalue_fast(l), cast_num(ivalue(r)) );
|
||||||
|
|
||||||
|
@ -8,4 +8,4 @@
|
|||||||
+ $(CC) -o $@.$(PKG_VERSION) -Wl,-Bsymbolic-functions $(MYLDFLAGS) -shared -Wl,-soname="$@.$(PKG_VERSION)" $?
|
+ $(CC) -o $@.$(PKG_VERSION) -Wl,-Bsymbolic-functions $(MYLDFLAGS) -shared -Wl,-soname="$@.$(PKG_VERSION)" $?
|
||||||
ln -fs $@.$(PKG_VERSION) $@
|
ln -fs $@.$(PKG_VERSION) $@
|
||||||
|
|
||||||
|
$(LUA_T): $(LUA_O) $(LUA_SO)
|
||||||
|
@ -10,7 +10,7 @@
|
|||||||
|
|
||||||
/*
|
/*
|
||||||
* If 'obj' is a string, it is tried to be interpreted as a number.
|
* If 'obj' is a string, it is tried to be interpreted as a number.
|
||||||
@@ -566,12 +569,63 @@ static inline int arith_mode( const TVal
|
@@ -568,12 +571,63 @@ static inline int arith_mode( const TVal
|
||||||
ARITH_OP1_END
|
ARITH_OP1_END
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
@ -74,7 +74,7 @@
|
|||||||
reentry: /* entry point */
|
reentry: /* entry point */
|
||||||
lua_assert(isLua(L->ci));
|
lua_assert(isLua(L->ci));
|
||||||
pc = L->savedpc;
|
pc = L->savedpc;
|
||||||
@@ -596,33 +650,33 @@ void luaV_execute (lua_State *L, int nex
|
@@ -598,33 +652,33 @@ void luaV_execute (lua_State *L, int nex
|
||||||
lua_assert(base == L->base && L->base == L->ci->base);
|
lua_assert(base == L->base && L->base == L->ci->base);
|
||||||
lua_assert(base <= L->top && L->top <= L->stack + L->stacksize);
|
lua_assert(base <= L->top && L->top <= L->stack + L->stacksize);
|
||||||
lua_assert(L->top == L->ci->top || luaG_checkopenop(i));
|
lua_assert(L->top == L->ci->top || luaG_checkopenop(i));
|
||||||
@ -115,7 +115,7 @@
|
|||||||
TValue g;
|
TValue g;
|
||||||
TValue *rb = KBx(i);
|
TValue *rb = KBx(i);
|
||||||
sethvalue(L, &g, cl->env);
|
sethvalue(L, &g, cl->env);
|
||||||
@@ -630,88 +684,88 @@ void luaV_execute (lua_State *L, int nex
|
@@ -632,88 +686,88 @@ void luaV_execute (lua_State *L, int nex
|
||||||
Protect(luaV_gettable(L, &g, rb, ra));
|
Protect(luaV_gettable(L, &g, rb, ra));
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
@ -219,7 +219,7 @@
|
|||||||
const TValue *rb = RB(i);
|
const TValue *rb = RB(i);
|
||||||
switch (ttype(rb)) {
|
switch (ttype(rb)) {
|
||||||
case LUA_TTABLE: {
|
case LUA_TTABLE: {
|
||||||
@@ -731,18 +785,18 @@ void luaV_execute (lua_State *L, int nex
|
@@ -733,18 +787,18 @@ void luaV_execute (lua_State *L, int nex
|
||||||
}
|
}
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
@ -241,7 +241,7 @@
|
|||||||
TValue *rb = RKB(i);
|
TValue *rb = RKB(i);
|
||||||
TValue *rc = RKC(i);
|
TValue *rc = RKC(i);
|
||||||
Protect(
|
Protect(
|
||||||
@@ -752,7 +806,7 @@ void luaV_execute (lua_State *L, int nex
|
@@ -754,7 +808,7 @@ void luaV_execute (lua_State *L, int nex
|
||||||
pc++;
|
pc++;
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
@ -250,7 +250,7 @@
|
|||||||
Protect(
|
Protect(
|
||||||
if (luaV_lessthan(L, RKB(i), RKC(i)) == GETARG_A(i))
|
if (luaV_lessthan(L, RKB(i), RKC(i)) == GETARG_A(i))
|
||||||
dojump(L, pc, GETARG_sBx(*pc));
|
dojump(L, pc, GETARG_sBx(*pc));
|
||||||
@@ -760,7 +814,7 @@ void luaV_execute (lua_State *L, int nex
|
@@ -762,7 +816,7 @@ void luaV_execute (lua_State *L, int nex
|
||||||
pc++;
|
pc++;
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
@ -259,7 +259,7 @@
|
|||||||
Protect(
|
Protect(
|
||||||
if (lessequal(L, RKB(i), RKC(i)) == GETARG_A(i))
|
if (lessequal(L, RKB(i), RKC(i)) == GETARG_A(i))
|
||||||
dojump(L, pc, GETARG_sBx(*pc));
|
dojump(L, pc, GETARG_sBx(*pc));
|
||||||
@@ -768,13 +822,13 @@ void luaV_execute (lua_State *L, int nex
|
@@ -770,13 +824,13 @@ void luaV_execute (lua_State *L, int nex
|
||||||
pc++;
|
pc++;
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
@ -275,7 +275,7 @@
|
|||||||
TValue *rb = RB(i);
|
TValue *rb = RB(i);
|
||||||
if (l_isfalse(rb) != GETARG_C(i)) {
|
if (l_isfalse(rb) != GETARG_C(i)) {
|
||||||
setobjs2s(L, ra, rb);
|
setobjs2s(L, ra, rb);
|
||||||
@@ -783,7 +837,7 @@ void luaV_execute (lua_State *L, int nex
|
@@ -785,7 +839,7 @@ void luaV_execute (lua_State *L, int nex
|
||||||
pc++;
|
pc++;
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
@ -284,7 +284,7 @@
|
|||||||
int b = GETARG_B(i);
|
int b = GETARG_B(i);
|
||||||
int nresults = GETARG_C(i) - 1;
|
int nresults = GETARG_C(i) - 1;
|
||||||
if (b != 0) L->top = ra+b; /* else previous instruction set top */
|
if (b != 0) L->top = ra+b; /* else previous instruction set top */
|
||||||
@@ -804,7 +858,7 @@ void luaV_execute (lua_State *L, int nex
|
@@ -806,7 +860,7 @@ void luaV_execute (lua_State *L, int nex
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@ -293,7 +293,7 @@
|
|||||||
int b = GETARG_B(i);
|
int b = GETARG_B(i);
|
||||||
if (b != 0) L->top = ra+b; /* else previous instruction set top */
|
if (b != 0) L->top = ra+b; /* else previous instruction set top */
|
||||||
L->savedpc = pc;
|
L->savedpc = pc;
|
||||||
@@ -836,7 +890,7 @@ void luaV_execute (lua_State *L, int nex
|
@@ -838,7 +892,7 @@ void luaV_execute (lua_State *L, int nex
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@ -302,7 +302,7 @@
|
|||||||
int b = GETARG_B(i);
|
int b = GETARG_B(i);
|
||||||
if (b != 0) L->top = ra+b-1;
|
if (b != 0) L->top = ra+b-1;
|
||||||
if (L->openupval) luaF_close(L, base);
|
if (L->openupval) luaF_close(L, base);
|
||||||
@@ -851,7 +905,7 @@ void luaV_execute (lua_State *L, int nex
|
@@ -853,7 +907,7 @@ void luaV_execute (lua_State *L, int nex
|
||||||
goto reentry;
|
goto reentry;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@ -311,7 +311,7 @@
|
|||||||
/* If start,step and limit are all integers, we don't need to check
|
/* If start,step and limit are all integers, we don't need to check
|
||||||
* against overflow in the looping.
|
* against overflow in the looping.
|
||||||
*/
|
*/
|
||||||
@@ -879,7 +933,7 @@ void luaV_execute (lua_State *L, int nex
|
@@ -881,7 +935,7 @@ void luaV_execute (lua_State *L, int nex
|
||||||
}
|
}
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
@ -320,7 +320,7 @@
|
|||||||
const TValue *init = ra;
|
const TValue *init = ra;
|
||||||
const TValue *plimit = ra+1;
|
const TValue *plimit = ra+1;
|
||||||
const TValue *pstep = ra+2;
|
const TValue *pstep = ra+2;
|
||||||
@@ -902,7 +956,7 @@ void luaV_execute (lua_State *L, int nex
|
@@ -904,7 +958,7 @@ void luaV_execute (lua_State *L, int nex
|
||||||
dojump(L, pc, GETARG_sBx(i));
|
dojump(L, pc, GETARG_sBx(i));
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
@ -329,7 +329,7 @@
|
|||||||
StkId cb = ra + 3; /* call base */
|
StkId cb = ra + 3; /* call base */
|
||||||
setobjs2s(L, cb+2, ra+2);
|
setobjs2s(L, cb+2, ra+2);
|
||||||
setobjs2s(L, cb+1, ra+1);
|
setobjs2s(L, cb+1, ra+1);
|
||||||
@@ -918,7 +972,7 @@ void luaV_execute (lua_State *L, int nex
|
@@ -920,7 +974,7 @@ void luaV_execute (lua_State *L, int nex
|
||||||
pc++;
|
pc++;
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
@ -338,7 +338,7 @@
|
|||||||
int n = GETARG_B(i);
|
int n = GETARG_B(i);
|
||||||
int c = GETARG_C(i);
|
int c = GETARG_C(i);
|
||||||
int last;
|
int last;
|
||||||
@@ -940,11 +994,11 @@ void luaV_execute (lua_State *L, int nex
|
@@ -942,11 +996,11 @@ void luaV_execute (lua_State *L, int nex
|
||||||
}
|
}
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
@ -352,7 +352,7 @@
|
|||||||
Proto *p;
|
Proto *p;
|
||||||
Closure *ncl;
|
Closure *ncl;
|
||||||
int nup, j;
|
int nup, j;
|
||||||
@@ -964,7 +1018,7 @@ void luaV_execute (lua_State *L, int nex
|
@@ -966,7 +1020,7 @@ void luaV_execute (lua_State *L, int nex
|
||||||
Protect(luaC_checkGC(L));
|
Protect(luaC_checkGC(L));
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
|
Loading…
Reference in New Issue
Block a user