projects
/
openwrt.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
mac80211: reduce tx queue length of wireless interfaces - improves latency under...
[openwrt.git]
/
package
/
lua
/
patches
/
300-opcode_performance.patch
diff --git
a/package/lua/patches/300-opcode_performance.patch
b/package/lua/patches/300-opcode_performance.patch
index
fb1f9a1
..
e870a25
100644
(file)
--- a/
package/lua/patches/300-opcode_performance.patch
+++ b/
package/lua/patches/300-opcode_performance.patch
@@
-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.
-@@ -56
4,12 +567,63 @@
+@@ -56
2,12 +565,63 @@ static inline int arith_mode( const TVal
ARITH_OP1_END
#endif
ARITH_OP1_END
#endif
@@
-74,7
+74,7
@@
reentry: /* entry point */
lua_assert(isLua(L->ci));
pc = L->savedpc;
reentry: /* entry point */
lua_assert(isLua(L->ci));
pc = L->savedpc;
-@@ -59
4,33 +648,33 @@
+@@ -59
2,33 +646,33 @@ void luaV_execute (lua_State *L, int nex
lua_assert(base == L->base && L->base == L->ci->base);
lua_assert(base <= L->top && L->top <= L->stack + L->stacksize);
lua_assert(L->top == L->ci->top || luaG_checkopenop(i));
lua_assert(base == L->base && L->base == L->ci->base);
lua_assert(base <= L->top && L->top <= L->stack + L->stacksize);
lua_assert(L->top == L->ci->top || luaG_checkopenop(i));
@@
-115,7
+115,7
@@
TValue g;
TValue *rb = KBx(i);
sethvalue(L, &g, cl->env);
TValue g;
TValue *rb = KBx(i);
sethvalue(L, &g, cl->env);
-@@ -62
8,88 +682,88 @@
+@@ -62
6,88 +680,88 @@ void luaV_execute (lua_State *L, int nex
Protect(luaV_gettable(L, &g, rb, ra));
continue;
}
Protect(luaV_gettable(L, &g, rb, ra));
continue;
}
@@
-219,7
+219,7
@@
const TValue *rb = RB(i);
switch (ttype(rb)) {
case LUA_TTABLE: {
const TValue *rb = RB(i);
switch (ttype(rb)) {
case LUA_TTABLE: {
-@@ -72
9,18 +783,18 @@
+@@ -72
7,18 +781,18 @@ void luaV_execute (lua_State *L, int nex
}
continue;
}
}
continue;
}
@@
-241,7
+241,7
@@
TValue *rb = RKB(i);
TValue *rc = RKC(i);
Protect(
TValue *rb = RKB(i);
TValue *rc = RKC(i);
Protect(
-@@ -7
50,7 +804,7 @@
+@@ -7
48,7 +802,7 @@ void luaV_execute (lua_State *L, int nex
pc++;
continue;
}
pc++;
continue;
}
@@
-250,7
+250,7
@@
Protect(
if (luaV_lessthan(L, RKB(i), RKC(i)) == GETARG_A(i))
dojump(L, pc, GETARG_sBx(*pc));
Protect(
if (luaV_lessthan(L, RKB(i), RKC(i)) == GETARG_A(i))
dojump(L, pc, GETARG_sBx(*pc));
-@@ -75
8,7 +812,7 @@
+@@ -75
6,7 +810,7 @@ void luaV_execute (lua_State *L, int nex
pc++;
continue;
}
pc++;
continue;
}
@@
-259,7
+259,7
@@
Protect(
if (lessequal(L, RKB(i), RKC(i)) == GETARG_A(i))
dojump(L, pc, GETARG_sBx(*pc));
Protect(
if (lessequal(L, RKB(i), RKC(i)) == GETARG_A(i))
dojump(L, pc, GETARG_sBx(*pc));
-@@ -76
6,13 +820,13 @@
+@@ -76
4,13 +818,13 @@ void luaV_execute (lua_State *L, int nex
pc++;
continue;
}
pc++;
continue;
}
@@
-275,7
+275,7
@@
TValue *rb = RB(i);
if (l_isfalse(rb) != GETARG_C(i)) {
setobjs2s(L, ra, rb);
TValue *rb = RB(i);
if (l_isfalse(rb) != GETARG_C(i)) {
setobjs2s(L, ra, rb);
-@@ -7
81,7 +835,7 @@
+@@ -7
79,7 +833,7 @@ void luaV_execute (lua_State *L, int nex
pc++;
continue;
}
pc++;
continue;
}
@@
-284,7
+284,7
@@
int b = GETARG_B(i);
int nresults = GETARG_C(i) - 1;
if (b != 0) L->top = ra+b; /* else previous instruction set top */
int b = GETARG_B(i);
int nresults = GETARG_C(i) - 1;
if (b != 0) L->top = ra+b; /* else previous instruction set top */
-@@ -80
2,7 +856,7 @@
+@@ -80
0,7 +854,7 @@ void luaV_execute (lua_State *L, int nex
}
}
}
}
}
}
@@
-293,7
+293,7
@@
int b = GETARG_B(i);
if (b != 0) L->top = ra+b; /* else previous instruction set top */
L->savedpc = pc;
int b = GETARG_B(i);
if (b != 0) L->top = ra+b; /* else previous instruction set top */
L->savedpc = pc;
-@@ -83
4,7 +888,7 @@
+@@ -83
2,7 +886,7 @@ void luaV_execute (lua_State *L, int nex
}
}
}
}
}
}
@@
-302,7
+302,7
@@
int b = GETARG_B(i);
if (b != 0) L->top = ra+b-1;
if (L->openupval) luaF_close(L, base);
int b = GETARG_B(i);
if (b != 0) L->top = ra+b-1;
if (L->openupval) luaF_close(L, base);
-@@ -84
9,7 +903,7 @@
+@@ -84
7,7 +901,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
* against overflow in the looping.
*/
/* If start,step and limit are all integers, we don't need to check
* against overflow in the looping.
*/
-@@ -87
7,7 +931,7 @@
+@@ -87
5,7 +929,7 @@ void luaV_execute (lua_State *L, int nex
}
continue;
}
}
continue;
}
@@
-320,7
+320,7
@@
const TValue *init = ra;
const TValue *plimit = ra+1;
const TValue *pstep = ra+2;
const TValue *init = ra;
const TValue *plimit = ra+1;
const TValue *pstep = ra+2;
-@@ -
900,7 +954,7 @@
+@@ -
898,7 +952,7 @@ void luaV_execute (lua_State *L, int nex
dojump(L, pc, GETARG_sBx(i));
continue;
}
dojump(L, pc, GETARG_sBx(i));
continue;
}
@@
-329,7
+329,7
@@
StkId cb = ra + 3; /* call base */
setobjs2s(L, cb+2, ra+2);
setobjs2s(L, cb+1, ra+1);
StkId cb = ra + 3; /* call base */
setobjs2s(L, cb+2, ra+2);
setobjs2s(L, cb+1, ra+1);
-@@ -91
6,7 +970,7 @@
+@@ -91
4,7 +968,7 @@ void luaV_execute (lua_State *L, int nex
pc++;
continue;
}
pc++;
continue;
}
@@
-338,7
+338,7
@@
int n = GETARG_B(i);
int c = GETARG_C(i);
int last;
int n = GETARG_B(i);
int c = GETARG_C(i);
int last;
-@@ -93
8,11 +992,11 @@
+@@ -93
6,11 +990,11 @@ void luaV_execute (lua_State *L, int nex
}
continue;
}
}
continue;
}
@@
-352,7
+352,7
@@
Proto *p;
Closure *ncl;
int nup, j;
Proto *p;
Closure *ncl;
int nup, j;
-@@ -96
2,7 +1016,7 @@
+@@ -96
0,7 +1014,7 @@ void luaV_execute (lua_State *L, int nex
Protect(luaC_checkGC(L));
continue;
}
Protect(luaC_checkGC(L));
continue;
}
This page took
0.026834 seconds
and
4
git commands to generate.