C:\JS_KRESREAL\HBP_konverzia\lua\lvm.c		C:\JS_LUA\lua-5.2.0\src\lvm.c
	/*		/*
	** $Id: lvm.c,v 2.147 2011/12/07 14:43:55 roberto Exp $		** $Id: lvm.c,v 2.147 2011/12/07 14:43:55 roberto Exp $
	** Lua virtual machine		** Lua virtual machine
	** See Copyright Notice in lua.h		** See Copyright Notice in lua.h
	*/		*/
	#include <stdio.h>		#include <stdio.h>
	#include <stdlib.h>		#include <stdlib.h>
	#include <string.h>		#include <string.h>
	#define lvm_c		#define lvm_c
	#define LUA_CORE		#define LUA_CORE
	#include "lua.h"		#include "lua.h"
	#include "ldebug.h"		#include "ldebug.h"
	#include "ldo.h"		#include "ldo.h"
	#include "lfunc.h"		#include "lfunc.h"
	#include "lgc.h"		#include "lgc.h"
	#include "lobject.h"		#include "lobject.h"
	#include "lopcodes.h"		#include "lopcodes.h"
	#include "lstate.h"		#include "lstate.h"
	#include "lstring.h"		#include "lstring.h"
	#include "ltable.h"		#include "ltable.h"
	#include "ltm.h"		#include "ltm.h"
	#include "lvm.h"		#include "lvm.h"
	#ifdef GCW_BIT
	#include "lubit.h"
	#endif
	/* limit for table tag-method chains (to avoid loops) */		/* limit for table tag-method chains (to avoid loops) */
	#define MAXTAGLOOP  100		#define MAXTAGLOOP  100
	const TValue *luaV_tonumber (const TValue *obj, TValue *n) {		const TValue *luaV_tonumber (const TValue *obj, TValue *n) {
	lua_Number num;		lua_Number num;
	if (ttisnumber(obj)) return obj;		if (ttisnumber(obj)) return obj;
	//#ifdef GCW_BIT  //allow use boolean in numerical operations !!!
	//  if (ttisboolean(obj)) {
	//  setnvalue(n,bvalue(obj));
	//  return n;
	// }
	//#endif
	if (ttisstring(obj) && luaO_str2d(svalue(obj), tsvalue(obj)->len, &num)) {
	setnvalue(n, num);
	return n;
	}
	else
	return NULL;
	}
	#ifdef GCW_BIT  //allow use boolean in numerical operations !!!
	const TValue *luaV_toboolnumber (const TValue *obj, TValue *n) {
	lua_Number num;
	if (ttisnumber(obj)) return obj;
	if (ttisboolean(obj)) {
	setnvalue(n,bvalue(obj));
	return n;
	}
	if (ttisstring(obj) && luaO_str2d(svalue(obj), tsvalue(obj)->len, &num)) {		if (ttisstring(obj) && luaO_str2d(svalue(obj), tsvalue(obj)->len, &num)) {
	setnvalue(n, num);		setnvalue(n, num);
	return n;		return n;
	}		}
	else		else
	return NULL;		return NULL;
	}		}
	#endif
	int luaV_tostring (lua_State *L, StkId obj) {		int luaV_tostring (lua_State *L, StkId obj) {
	if (!ttisnumber(obj))		if (!ttisnumber(obj))
	return 0;		return 0;
	else {		else {
	char s[LUAI_MAXNUMBER2STR];		char s[LUAI_MAXNUMBER2STR];
	lua_Number n = nvalue(obj);		lua_Number n = nvalue(obj);
	int l = lua_number2str(s, n);		int l = lua_number2str(s, n);
	setsvalue2s(L, obj, luaS_newlstr(L, s, l));		setsvalue2s(L, obj, luaS_newlstr(L, s, l));
	return 1;		return 1;
	}		}
	}		}
	static void traceexec (lua_State *L) {		static void traceexec (lua_State *L) {
	CallInfo *ci = L->ci;		CallInfo *ci = L->ci;
	lu_byte mask = L->hookmask;		lu_byte mask = L->hookmask;
	if ((mask & LUA_MASKCOUNT) && L->hookcount == 0) {		if ((mask & LUA_MASKCOUNT) && L->hookcount == 0) {
	resethookcount(L);		resethookcount(L);
	luaD_hook(L, LUA_HOOKCOUNT, -1);		luaD_hook(L, LUA_HOOKCOUNT, -1);
	}		}
	if (mask & LUA_MASKLINE) {		if (mask & LUA_MASKLINE) {
	Proto *p = ci_func(ci)->p;		Proto *p = ci_func(ci)->p;
	int npc = pcRel(ci->u.l.savedpc, p);		int npc = pcRel(ci->u.l.savedpc, p);
	int newline = getfuncline(p, npc);		int newline = getfuncline(p, npc);
	if (npc == 0 ||  /* call linehook when enter a new function, */		if (npc == 0 ||  /* call linehook when enter a new function, */
	ci->u.l.savedpc <= L->oldpc ||  /* when jump back (loop), or when */		ci->u.l.savedpc <= L->oldpc ||  /* when jump back (loop), or when */
	newline != getfuncline(p, pcRel(L->oldpc, p)))  /* enter a new line */		newline != getfuncline(p, pcRel(L->oldpc, p)))  /* enter a new line */
	luaD_hook(L, LUA_HOOKLINE, newline);		luaD_hook(L, LUA_HOOKLINE, newline);
	}		}
	L->oldpc = ci->u.l.savedpc;		L->oldpc = ci->u.l.savedpc;
	if (L->status == LUA_YIELD) {  /* did hook yield? */		if (L->status == LUA_YIELD) {  /* did hook yield? */
	ci->u.l.savedpc--;  /* undo increment (resume will increment it again) */		ci->u.l.savedpc--;  /* undo increment (resume will increment it again) */
	luaD_throw(L, LUA_YIELD);		luaD_throw(L, LUA_YIELD);
	}		}
	}		}
	static void callTM (lua_State *L, const TValue *f, const TValue *p1,		static void callTM (lua_State *L, const TValue *f, const TValue *p1,
	const TValue *p2, TValue *p3, int hasres) {		const TValue *p2, TValue *p3, int hasres) {
	ptrdiff_t result = savestack(L, p3);		ptrdiff_t result = savestack(L, p3);
	setobj2s(L, L->top++, f);  /* push function */		setobj2s(L, L->top++, f);  /* push function */
	setobj2s(L, L->top++, p1);  /* 1st argument */		setobj2s(L, L->top++, p1);  /* 1st argument */
	setobj2s(L, L->top++, p2);  /* 2nd argument */		setobj2s(L, L->top++, p2);  /* 2nd argument */
	if (!hasres)  /* no result? 'p3' is third argument */		if (!hasres)  /* no result? 'p3' is third argument */
	setobj2s(L, L->top++, p3);  /* 3rd argument */		setobj2s(L, L->top++, p3);  /* 3rd argument */
	luaD_checkstack(L, 0);		luaD_checkstack(L, 0);
	/* metamethod may yield only when called from Lua code */		/* metamethod may yield only when called from Lua code */
	luaD_call(L, L->top - (4 - hasres), hasres, isLua(L->ci));		luaD_call(L, L->top - (4 - hasres), hasres, isLua(L->ci));
	if (hasres) {  /* if has result, move it to its place */		if (hasres) {  /* if has result, move it to its place */
	p3 = restorestack(L, result);		p3 = restorestack(L, result);
	setobjs2s(L, p3, --L->top);		setobjs2s(L, p3, --L->top);
	}		}
	}		}
	void luaV_gettable (lua_State *L, const TValue *t, TValue *key, StkId val) {		void luaV_gettable (lua_State *L, const TValue *t, TValue *key, StkId val) {
	int loop;		int loop;
	for (loop = 0; loop < MAXTAGLOOP; loop++) {		for (loop = 0; loop < MAXTAGLOOP; loop++) {
	const TValue *tm;		const TValue *tm;
	if (ttistable(t)) {  /* `t' is a table? */		if (ttistable(t)) {  /* `t' is a table? */
	Table *h = hvalue(t);		Table *h = hvalue(t);
	const TValue *res = luaH_get(h, key); /* do a primitive get */		const TValue *res = luaH_get(h, key); /* do a primitive get */
	if (!ttisnil(res) ||  /* result is not nil? */		if (!ttisnil(res) ||  /* result is not nil? */
	(tm = fasttm(L, h->metatable, TM_INDEX)) == NULL) { /* or no TM? */		(tm = fasttm(L, h->metatable, TM_INDEX)) == NULL) { /* or no TM? */
	setobj2s(L, val, res);		setobj2s(L, val, res);
	return;		return;
	}		}
	/* else will try the tag method */		/* else will try the tag method */
	}		}
	else if (ttisnil(tm = luaT_gettmbyobj(L, t, TM_INDEX)))		else if (ttisnil(tm = luaT_gettmbyobj(L, t, TM_INDEX)))
	luaG_typeerror(L, t, "index");		luaG_typeerror(L, t, "index");
	if (ttisfunction(tm)) {		if (ttisfunction(tm)) {
	callTM(L, tm, t, key, val, 1);		callTM(L, tm, t, key, val, 1);
	return;		return;
	}		}
	t = tm;  /* else repeat with 'tm' */		t = tm;  /* else repeat with 'tm' */
	}		}
	luaG_runerror(L, "loop in gettable");		luaG_runerror(L, "loop in gettable");
	}		}
	void luaV_settable (lua_State *L, const TValue *t, TValue *key, StkId val) {		void luaV_settable (lua_State *L, const TValue *t, TValue *key, StkId val) {
	int loop;		int loop;
	for (loop = 0; loop < MAXTAGLOOP; loop++) {		for (loop = 0; loop < MAXTAGLOOP; loop++) {
	const TValue *tm;		const TValue *tm;
	if (ttistable(t)) {  /* `t' is a table? */		if (ttistable(t)) {  /* `t' is a table? */
	Table *h = hvalue(t);		Table *h = hvalue(t);
	TValue *oldval = cast(TValue *, luaH_get(h, key));		TValue *oldval = cast(TValue *, luaH_get(h, key));
	/* if previous value is not nil, there must be a previous entry		/* if previous value is not nil, there must be a previous entry
	in the table; moreover, a metamethod has no relevance */		in the table; moreover, a metamethod has no relevance */
	if (!ttisnil(oldval) ||		if (!ttisnil(oldval) ||
	/* previous value is nil; must check the metamethod */		/* previous value is nil; must check the metamethod */
	((tm = fasttm(L, h->metatable, TM_NEWINDEX)) == NULL &&		((tm = fasttm(L, h->metatable, TM_NEWINDEX)) == NULL &&
	/* no metamethod; is there a previous entry in the table? */		/* no metamethod; is there a previous entry in the table? */
	(oldval != luaO_nilobject ||		(oldval != luaO_nilobject ||
	/* no previous entry; must create one. (The next test is		/* no previous entry; must create one. (The next test is
	always true; we only need the assignment.) */		always true; we only need the assignment.) */
	(oldval = luaH_newkey(L, h, key), 1)))) {		(oldval = luaH_newkey(L, h, key), 1)))) {
	/* no metamethod and (now) there is an entry with given key */		/* no metamethod and (now) there is an entry with given key */
	setobj2t(L, oldval, val);  /* assign new value to that entry */		setobj2t(L, oldval, val);  /* assign new value to that entry */
	invalidateTMcache(h);		invalidateTMcache(h);
	luaC_barrierback(L, obj2gco(h), val);		luaC_barrierback(L, obj2gco(h), val);
	return;		return;
	}		}
	/* else will try the metamethod */		/* else will try the metamethod */
	}		}
	else  /* not a table; check metamethod */		else  /* not a table; check metamethod */
	if (ttisnil(tm = luaT_gettmbyobj(L, t, TM_NEWINDEX)))		if (ttisnil(tm = luaT_gettmbyobj(L, t, TM_NEWINDEX)))
	luaG_typeerror(L, t, "index");		luaG_typeerror(L, t, "index");
	/* there is a metamethod */		/* there is a metamethod */
	if (ttisfunction(tm)) {		if (ttisfunction(tm)) {
	callTM(L, tm, t, key, val, 0);		callTM(L, tm, t, key, val, 0);
	return;		return;
	}		}
	t = tm;  /* else repeat with 'tm' */		t = tm;  /* else repeat with 'tm' */
	}		}
	luaG_runerror(L, "loop in settable");		luaG_runerror(L, "loop in settable");
	}		}
	static int call_binTM (lua_State *L, const TValue *p1, const TValue *p2,		static int call_binTM (lua_State *L, const TValue *p1, const TValue *p2,
	StkId res, TMS event) {		StkId res, TMS event) {
	const TValue *tm = luaT_gettmbyobj(L, p1, event);  /* try first operand */		const TValue *tm = luaT_gettmbyobj(L, p1, event);  /* try first operand */
	if (ttisnil(tm))		if (ttisnil(tm))
	tm = luaT_gettmbyobj(L, p2, event);  /* try second operand */		tm = luaT_gettmbyobj(L, p2, event);  /* try second operand */
	if (ttisnil(tm)) return 0;		if (ttisnil(tm)) return 0;
	callTM(L, tm, p1, p2, res, 1);		callTM(L, tm, p1, p2, res, 1);
	return 1;		return 1;
	}		}
	static const TValue *get_equalTM (lua_State *L, Table *mt1, Table *mt2,		static const TValue *get_equalTM (lua_State *L, Table *mt1, Table *mt2,
	TMS event) {		TMS event) {
	const TValue *tm1 = fasttm(L, mt1, event);		const TValue *tm1 = fasttm(L, mt1, event);
	const TValue *tm2;		const TValue *tm2;
	if (tm1 == NULL) return NULL;  /* no metamethod */		if (tm1 == NULL) return NULL;  /* no metamethod */
	if (mt1 == mt2) return tm1;  /* same metatables => same metamethods */		if (mt1 == mt2) return tm1;  /* same metatables => same metamethods */
	tm2 = fasttm(L, mt2, event);		tm2 = fasttm(L, mt2, event);
	if (tm2 == NULL) return NULL;  /* no metamethod */		if (tm2 == NULL) return NULL;  /* no metamethod */
	if (luaV_rawequalobj(tm1, tm2))  /* same metamethods? */		if (luaV_rawequalobj(tm1, tm2))  /* same metamethods? */
	return tm1;		return tm1;
	return NULL;		return NULL;
	}		}
	static int call_orderTM (lua_State *L, const TValue *p1, const TValue *p2,		static int call_orderTM (lua_State *L, const TValue *p1, const TValue *p2,
	TMS event) {		TMS event) {
	if (!call_binTM(L, p1, p2, L->top, event))		if (!call_binTM(L, p1, p2, L->top, event))
	return -1;  /* no metamethod */		return -1;  /* no metamethod */
	else		else
	return !l_isfalse(L->top);		return !l_isfalse(L->top);
	}		}
	static int l_strcmp (const TString *ls, const TString *rs) {		static int l_strcmp (const TString *ls, const TString *rs) {
	const char *l = getstr(ls);		const char *l = getstr(ls);
	size_t ll = ls->tsv.len;		size_t ll = ls->tsv.len;
	const char *r = getstr(rs);		const char *r = getstr(rs);
	size_t lr = rs->tsv.len;		size_t lr = rs->tsv.len;
	for (;;) {		for (;;) {
	int temp = strcoll(l, r);		int temp = strcoll(l, r);
	if (temp != 0) return temp;		if (temp != 0) return temp;
	else {  /* strings are equal up to a `\0' */		else {  /* strings are equal up to a `\0' */
	size_t len = strlen(l);  /* index of first `\0' in both strings */		size_t len = strlen(l);  /* index of first `\0' in both strings */
	if (len == lr)  /* r is finished? */		if (len == lr)  /* r is finished? */
	return (len == ll) ? 0 : 1;		return (len == ll) ? 0 : 1;
	else if (len == ll)  /* l is finished? */		else if (len == ll)  /* l is finished? */
	return -1;  /* l is smaller than r (because r is not finished) */		return -1;  /* l is smaller than r (because r is not finished) */
	/* both strings longer than `len'; go on comparing (after the `\0') */		/* both strings longer than `len'; go on comparing (after the `\0') */
	len++;		len++;
	l += len; ll -= len; r += len; lr -= len;		l += len; ll -= len; r += len; lr -= len;
	}		}
	}		}
	}		}
	int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r) {		int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r) {
	int res;		int res;
	if (ttisnumber(l) && ttisnumber(r))		if (ttisnumber(l) && ttisnumber(r))
	return luai_numlt(L, nvalue(l), nvalue(r));		return luai_numlt(L, nvalue(l), nvalue(r));
	else if (ttisstring(l) && ttisstring(r))		else if (ttisstring(l) && ttisstring(r))
	return l_strcmp(rawtsvalue(l), rawtsvalue(r)) < 0;		return l_strcmp(rawtsvalue(l), rawtsvalue(r)) < 0;
	else if ((res = call_orderTM(L, l, r, TM_LT)) < 0)		else if ((res = call_orderTM(L, l, r, TM_LT)) < 0)
	luaG_ordererror(L, l, r);		luaG_ordererror(L, l, r);
	return res;		return res;
	}		}
	int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r) {		int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r) {
	int res;		int res;
	if (ttisnumber(l) && ttisnumber(r))		if (ttisnumber(l) && ttisnumber(r))
	return luai_numle(L, nvalue(l), nvalue(r));		return luai_numle(L, nvalue(l), nvalue(r));
	else if (ttisstring(l) && ttisstring(r))		else if (ttisstring(l) && ttisstring(r))
	return l_strcmp(rawtsvalue(l), rawtsvalue(r)) <= 0;		return l_strcmp(rawtsvalue(l), rawtsvalue(r)) <= 0;
	else if ((res = call_orderTM(L, l, r, TM_LE)) >= 0)  /* first try `le' */		else if ((res = call_orderTM(L, l, r, TM_LE)) >= 0)  /* first try `le' */
	return res;		return res;
	else if ((res = call_orderTM(L, r, l, TM_LT)) < 0)  /* else try `lt' */		else if ((res = call_orderTM(L, r, l, TM_LT)) < 0)  /* else try `lt' */
	luaG_ordererror(L, l, r);		luaG_ordererror(L, l, r);
	return !res;		return !res;
	}		}
	/*		/*
	** equality of Lua values. L == NULL means raw equality (no metamethods)		** equality of Lua values. L == NULL means raw equality (no metamethods)
	*/		*/
	int luaV_equalobj_ (lua_State *L, const TValue *t1, const TValue *t2) {		int luaV_equalobj_ (lua_State *L, const TValue *t1, const TValue *t2) {
	const TValue *tm;		const TValue *tm;
	lua_assert(ttisequal(t1, t2));		lua_assert(ttisequal(t1, t2));
	switch (ttype(t1)) {		switch (ttype(t1)) {
	case LUA_TNIL: return 1;		case LUA_TNIL: return 1;
	case LUA_TNUMBER: return luai_numeq(nvalue(t1), nvalue(t2));		case LUA_TNUMBER: return luai_numeq(nvalue(t1), nvalue(t2));
	case LUA_TBOOLEAN: return bvalue(t1) == bvalue(t2);  /* true must be 1 !! */		case LUA_TBOOLEAN: return bvalue(t1) == bvalue(t2);  /* true must be 1 !! */
	case LUA_TLIGHTUSERDATA: return pvalue(t1) == pvalue(t2);		case LUA_TLIGHTUSERDATA: return pvalue(t1) == pvalue(t2);
	case LUA_TLCF: return fvalue(t1) == fvalue(t2);		case LUA_TLCF: return fvalue(t1) == fvalue(t2);
	case LUA_TSTRING: return eqstr(rawtsvalue(t1), rawtsvalue(t2));		case LUA_TSTRING: return eqstr(rawtsvalue(t1), rawtsvalue(t2));
	case LUA_TUSERDATA: {		case LUA_TUSERDATA: {
	if (uvalue(t1) == uvalue(t2)) return 1;		if (uvalue(t1) == uvalue(t2)) return 1;
	else if (L == NULL) return 0;		else if (L == NULL) return 0;
	tm = get_equalTM(L, uvalue(t1)->metatable, uvalue(t2)->metatable, TM_EQ);		tm = get_equalTM(L, uvalue(t1)->metatable, uvalue(t2)->metatable, TM_EQ);
	break;  /* will try TM */		break;  /* will try TM */
	}		}
	case LUA_TTABLE: {		case LUA_TTABLE: {
	if (hvalue(t1) == hvalue(t2)) return 1;		if (hvalue(t1) == hvalue(t2)) return 1;
	else if (L == NULL) return 0;		else if (L == NULL) return 0;
	tm = get_equalTM(L, hvalue(t1)->metatable, hvalue(t2)->metatable, TM_EQ);		tm = get_equalTM(L, hvalue(t1)->metatable, hvalue(t2)->metatable, TM_EQ);
	break;  /* will try TM */		break;  /* will try TM */
	}		}
	default:		default:
	lua_assert(iscollectable(t1));		lua_assert(iscollectable(t1));
	return gcvalue(t1) == gcvalue(t2);		return gcvalue(t1) == gcvalue(t2);
	}		}
	if (tm == NULL) return 0;  /* no TM? */		if (tm == NULL) return 0;  /* no TM? */
	callTM(L, tm, t1, t2, L->top, 1);  /* call TM */		callTM(L, tm, t1, t2, L->top, 1);  /* call TM */
	return !l_isfalse(L->top);		return !l_isfalse(L->top);
	}		}
	void luaV_concat (lua_State *L, int total) {		void luaV_concat (lua_State *L, int total) {
	lua_assert(total >= 2);		lua_assert(total >= 2);
	do {		do {
	StkId top = L->top;		StkId top = L->top;
	int n = 2;  /* number of elements handled in this pass (at least 2) */		int n = 2;  /* number of elements handled in this pass (at least 2) */
	if (!(ttisstring(top-2) || ttisnumber(top-2)) || !tostring(L, top-1)) {		if (!(ttisstring(top-2) || ttisnumber(top-2)) || !tostring(L, top-1)) {
	if (!call_binTM(L, top-2, top-1, top-2, TM_CONCAT))		if (!call_binTM(L, top-2, top-1, top-2, TM_CONCAT))
	luaG_concaterror(L, top-2, top-1);		luaG_concaterror(L, top-2, top-1);
	}		}
	else if (tsvalue(top-1)->len == 0)  /* second operand is empty? */		else if (tsvalue(top-1)->len == 0)  /* second operand is empty? */
	(void)tostring(L, top - 2);  /* result is first operand */		(void)tostring(L, top - 2);  /* result is first operand */
	else if (ttisstring(top-2) && tsvalue(top-2)->len == 0) {		else if (ttisstring(top-2) && tsvalue(top-2)->len == 0) {
	setsvalue2s(L, top-2, rawtsvalue(top-1));  /* result is second op. */		setsvalue2s(L, top-2, rawtsvalue(top-1));  /* result is second op. */
	}		}
	else {		else {
	/* at least two non-empty string values; get as many as possible */		/* at least two non-empty string values; get as many as possible */
	size_t tl = tsvalue(top-1)->len;		size_t tl = tsvalue(top-1)->len;
	char *buffer;		char *buffer;
	int i;		int i;
	/* collect total length */		/* collect total length */
	for (i = 1; i < total && tostring(L, top-i-1); i++) {		for (i = 1; i < total && tostring(L, top-i-1); i++) {
	size_t l = tsvalue(top-i-1)->len;		size_t l = tsvalue(top-i-1)->len;
	if (l >= (MAX_SIZET/sizeof(char)) - tl)		if (l >= (MAX_SIZET/sizeof(char)) - tl)
	luaG_runerror(L, "string length overflow");		luaG_runerror(L, "string length overflow");
	tl += l;		tl += l;
	}		}
	buffer = luaZ_openspace(L, &G(L)->buff, tl);		buffer = luaZ_openspace(L, &G(L)->buff, tl);
	tl = 0;		tl = 0;
	n = i;		n = i;
	do {  /* concat all strings */		do {  /* concat all strings */
	size_t l = tsvalue(top-i)->len;		size_t l = tsvalue(top-i)->len;
	memcpy(buffer+tl, svalue(top-i), l * sizeof(char));		memcpy(buffer+tl, svalue(top-i), l * sizeof(char));
	tl += l;		tl += l;
	} while (--i > 0);		} while (--i > 0);
	setsvalue2s(L, top-n, luaS_newlstr(L, buffer, tl));		setsvalue2s(L, top-n, luaS_newlstr(L, buffer, tl));
	}		}
	total -= n-1;  /* got 'n' strings to create 1 new */		total -= n-1;  /* got 'n' strings to create 1 new */
	L->top -= n-1;  /* popped 'n' strings and pushed one */		L->top -= n-1;  /* popped 'n' strings and pushed one */
	} while (total > 1);  /* repeat until only 1 result left */		} while (total > 1);  /* repeat until only 1 result left */
	}		}
	void luaV_objlen (lua_State *L, StkId ra, const TValue *rb) {		void luaV_objlen (lua_State *L, StkId ra, const TValue *rb) {
	const TValue *tm;		const TValue *tm;
	switch (ttypenv(rb)) {		switch (ttypenv(rb)) {
	case LUA_TTABLE: {		case LUA_TTABLE: {
	Table *h = hvalue(rb);		Table *h = hvalue(rb);
	tm = fasttm(L, h->metatable, TM_LEN);		tm = fasttm(L, h->metatable, TM_LEN);
	if (tm) break;  /* metamethod? break switch to call it */		if (tm) break;  /* metamethod? break switch to call it */
	setnvalue(ra, cast_num(luaH_getn(h)));  /* else primitive len */		setnvalue(ra, cast_num(luaH_getn(h)));  /* else primitive len */
	return;		return;
	}		}
	case LUA_TSTRING: {		case LUA_TSTRING: {
	setnvalue(ra, cast_num(tsvalue(rb)->len));		setnvalue(ra, cast_num(tsvalue(rb)->len));
	return;		return;
	}		}
	default: {  /* try metamethod */		default: {  /* try metamethod */
	tm = luaT_gettmbyobj(L, rb, TM_LEN);		tm = luaT_gettmbyobj(L, rb, TM_LEN);
	if (ttisnil(tm))  /* no metamethod? */		if (ttisnil(tm))  /* no metamethod? */
	luaG_typeerror(L, rb, "get length of");		luaG_typeerror(L, rb, "get length of");
	break;		break;
	}		}
	}		}
	callTM(L, tm, rb, rb, ra, 1);		callTM(L, tm, rb, rb, ra, 1);
	}		}
	void luaV_arith (lua_State *L, StkId ra, const TValue *rb,		void luaV_arith (lua_State *L, StkId ra, const TValue *rb,
	const TValue *rc, TMS op) {		const TValue *rc, TMS op) {
	TValue tempb, tempc;		TValue tempb, tempc;
	const TValue *b, *c;		const TValue *b, *c;
	if ( ( ((b = luaV_tonumber(rb, &tempb)) != NULL) &&		if ((b = luaV_tonumber(rb, &tempb)) != NULL &&
	((c = luaV_tonumber(rc, &tempc)) != NULL) )		(c = luaV_tonumber(rc, &tempc)) != NULL) {
	#ifdef  GCW_BIT
	||(    //allow boolean in numeric operations only especially for BITWISE operators
	#ifndef GCW_ALLOW_BOOL_IN_ARITHMETIC     // !! if not defined ALLOW for all !!
	(op >= TM_BAND) && (op <= TM_LNOT) &&        // or for every arith operations (if rem-ed) (I don't know if it may cause problem somewhere else in code ?!)
	#endif
	(b = luaV_toboolnumber(rb, &tempb)) != NULL &&
	(c = luaV_toboolnumber(rc, &tempc)) != NULL
	)
	#endif
	){
	lua_Number res = luaO_arith(op - TM_ADD + LUA_OPADD, nvalue(b), nvalue(c));		lua_Number res = luaO_arith(op - TM_ADD + LUA_OPADD, nvalue(b), nvalue(c));
	setnvalue(ra, res);		setnvalue(ra, res);
	}		}
	else if (!call_binTM(L, rb, rc, ra, op))		else if (!call_binTM(L, rb, rc, ra, op))
	luaG_aritherror(L, rb, rc);		luaG_aritherror(L, rb, rc);
	}		}
	/*		/*
	** check whether cached closure in prototype 'p' may be reused, that is,		** check whether cached closure in prototype 'p' may be reused, that is,
	** whether there is a cached closure with the same upvalues needed by		** whether there is a cached closure with the same upvalues needed by
	** new closure to be created.		** new closure to be created.
	*/		*/
	static Closure *getcached (Proto *p, UpVal **encup, StkId base) {		static Closure *getcached (Proto *p, UpVal **encup, StkId base) {
	Closure *c = p->cache;		Closure *c = p->cache;
	if (c != NULL) {  /* is there a cached closure? */		if (c != NULL) {  /* is there a cached closure? */
	int nup = p->sizeupvalues;		int nup = p->sizeupvalues;
	Upvaldesc *uv = p->upvalues;		Upvaldesc *uv = p->upvalues;
	int i;		int i;
	for (i = 0; i < nup; i++) {  /* check whether it has right upvalues */		for (i = 0; i < nup; i++) {  /* check whether it has right upvalues */
	TValue *v = uv[i].instack ? base + uv[i].idx : encup[uv[i].idx]->v;		TValue *v = uv[i].instack ? base + uv[i].idx : encup[uv[i].idx]->v;
	if (c->l.upvals[i]->v != v)		if (c->l.upvals[i]->v != v)
	return NULL;  /* wrong upvalue; cannot reuse closure */		return NULL;  /* wrong upvalue; cannot reuse closure */
	}		}
	}		}
	return c;  /* return cached closure (or NULL if no cached closure) */		return c;  /* return cached closure (or NULL if no cached closure) */
	}		}
	/*		/*
	** create a new Lua closure, push it in the stack, and initialize		** create a new Lua closure, push it in the stack, and initialize
	** its upvalues. Note that the call to 'luaC_barrierproto' must come		** its upvalues. Note that the call to 'luaC_barrierproto' must come
	** before the assignment to 'p->cache', as the function needs the		** before the assignment to 'p->cache', as the function needs the
	** original value of that field.		** original value of that field.
	*/		*/
	static void pushclosure (lua_State *L, Proto *p, UpVal **encup, StkId base,		static void pushclosure (lua_State *L, Proto *p, UpVal **encup, StkId base,
	StkId ra) {		StkId ra) {
	int nup = p->sizeupvalues;		int nup = p->sizeupvalues;
	Upvaldesc *uv = p->upvalues;		Upvaldesc *uv = p->upvalues;
	int i;		int i;
	Closure *ncl = luaF_newLclosure(L, p);		Closure *ncl = luaF_newLclosure(L, p);
	setclLvalue(L, ra, ncl);  /* anchor new closure in stack */		setclLvalue(L, ra, ncl);  /* anchor new closure in stack */
	for (i = 0; i < nup; i++) {  /* fill in its upvalues */		for (i = 0; i < nup; i++) {  /* fill in its upvalues */
	if (uv[i].instack)  /* upvalue refers to local variable? */		if (uv[i].instack)  /* upvalue refers to local variable? */
	ncl->l.upvals[i] = luaF_findupval(L, base + uv[i].idx);		ncl->l.upvals[i] = luaF_findupval(L, base + uv[i].idx);
	else  /* get upvalue from enclosing function */		else  /* get upvalue from enclosing function */
	ncl->l.upvals[i] = encup[uv[i].idx];		ncl->l.upvals[i] = encup[uv[i].idx];
	}		}
	luaC_barrierproto(L, p, ncl);		luaC_barrierproto(L, p, ncl);
	p->cache = ncl;  /* save it on cache for reuse */		p->cache = ncl;  /* save it on cache for reuse */
	}		}
	/*		/*
	** finish execution of an opcode interrupted by an yield		** finish execution of an opcode interrupted by an yield
	*/		*/
	void luaV_finishOp (lua_State *L) {		void luaV_finishOp (lua_State *L) {
	CallInfo *ci = L->ci;		CallInfo *ci = L->ci;
	StkId base = ci->u.l.base;		StkId base = ci->u.l.base;
	Instruction inst = *(ci->u.l.savedpc - 1);  /* interrupted instruction */		Instruction inst = *(ci->u.l.savedpc - 1);  /* interrupted instruction */
	OpCode op = GET_OPCODE(inst);		OpCode op = GET_OPCODE(inst);
	switch (op) {  /* finish its execution */		switch (op) {  /* finish its execution */
	case OP_ADD: case OP_SUB: case OP_MUL: case OP_DIV:		case OP_ADD: case OP_SUB: case OP_MUL: case OP_DIV:
	case OP_MOD: case OP_POW:		case OP_MOD: case OP_POW: case OP_UNM: case OP_LEN:
	#ifdef GCW_BIT
	case OP_BAND: case OP_BOR: case OP_BXOR:
	case OP_BLSH: case OP_BRSH:
	case OP_LAND: case OP_LOR:
	case OP_BNOT: case OP_LNOT:
	#endif
	case OP_UNM: case OP_LEN:
	case OP_GETTABUP: case OP_GETTABLE: case OP_SELF: {		case OP_GETTABUP: case OP_GETTABLE: case OP_SELF: {
	setobjs2s(L, base + GETARG_A(inst), --L->top);		setobjs2s(L, base + GETARG_A(inst), --L->top);
	break;		break;
	}		}
	case OP_LE: case OP_LT: case OP_EQ: {		case OP_LE: case OP_LT: case OP_EQ: {
	int res = !l_isfalse(L->top - 1);		int res = !l_isfalse(L->top - 1);
	L->top--;		L->top--;
	/* metamethod should not be called when operand is K */		/* metamethod should not be called when operand is K */
	lua_assert(!ISK(GETARG_B(inst)));		lua_assert(!ISK(GETARG_B(inst)));
	if (op == OP_LE &&  /* "<=" using "<" instead? */		if (op == OP_LE &&  /* "<=" using "<" instead? */
	ttisnil(luaT_gettmbyobj(L, base + GETARG_B(inst), TM_LE)))		ttisnil(luaT_gettmbyobj(L, base + GETARG_B(inst), TM_LE)))
	res = !res;  /* invert result */		res = !res;  /* invert result */
	lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_JMP);		lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_JMP);
	if (res != GETARG_A(inst))  /* condition failed? */		if (res != GETARG_A(inst))  /* condition failed? */
	ci->u.l.savedpc++;  /* skip jump instruction */		ci->u.l.savedpc++;  /* skip jump instruction */
	break;		break;
	}		}
	case OP_CONCAT: {		case OP_CONCAT: {
	StkId top = L->top - 1;  /* top when 'call_binTM' was called */		StkId top = L->top - 1;  /* top when 'call_binTM' was called */
	int b = GETARG_B(inst);      /* first element to concatenate */		int b = GETARG_B(inst);      /* first element to concatenate */
	int total = cast_int(top - 1 - (base + b));  /* yet to concatenate */		int total = cast_int(top - 1 - (base + b));  /* yet to concatenate */
	setobj2s(L, top - 2, top);  /* put TM result in proper position */		setobj2s(L, top - 2, top);  /* put TM result in proper position */
	if (total > 1) {  /* are there elements to concat? */		if (total > 1) {  /* are there elements to concat? */
	L->top = top - 1;  /* top is one after last element (at top-2) */		L->top = top - 1;  /* top is one after last element (at top-2) */
	luaV_concat(L, total);  /* concat them (may yield again) */		luaV_concat(L, total);  /* concat them (may yield again) */
	}		}
	/* move final result to final position */		/* move final result to final position */
	setobj2s(L, ci->u.l.base + GETARG_A(inst), L->top - 1);		setobj2s(L, ci->u.l.base + GETARG_A(inst), L->top - 1);
	L->top = ci->top;  /* restore top */		L->top = ci->top;  /* restore top */
	break;		break;
	}		}
	case OP_TFORCALL: {		case OP_TFORCALL: {
	lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_TFORLOOP);		lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_TFORLOOP);
	L->top = ci->top;  /* correct top */		L->top = ci->top;  /* correct top */
	break;		break;
	}		}
	case OP_CALL: {		case OP_CALL: {
	if (GETARG_C(inst) - 1 >= 0)  /* nresults >= 0? */		if (GETARG_C(inst) - 1 >= 0)  /* nresults >= 0? */
	L->top = ci->top;  /* adjust results */		L->top = ci->top;  /* adjust results */
	break;		break;
	}		}
	case OP_TAILCALL: case OP_SETTABUP:  case OP_SETTABLE:		case OP_TAILCALL: case OP_SETTABUP:  case OP_SETTABLE:
	break;		break;
	default: lua_assert(0);		default: lua_assert(0);
	}		}
	}		}
	/*		/*
	** some macros for common tasks in `luaV_execute'		** some macros for common tasks in `luaV_execute'
	*/		*/
	#if !defined luai_runtimecheck		#if !defined luai_runtimecheck
	#define luai_runtimecheck(L, c)     /* void */		#define luai_runtimecheck(L, c)     /* void */
	#endif		#endif
	#define RA(i)   (base+GETARG_A(i))		#define RA(i)   (base+GETARG_A(i))
	/* to be used after possible stack reallocation */		/* to be used after possible stack reallocation */
	#define RB(i)   check_exp(getBMode(GET_OPCODE(i)) == OpArgR, base+GETARG_B(i))		#define RB(i)   check_exp(getBMode(GET_OPCODE(i)) == OpArgR, base+GETARG_B(i))
	#define RC(i)   check_exp(getCMode(GET_OPCODE(i)) == OpArgR, base+GETARG_C(i))		#define RC(i)   check_exp(getCMode(GET_OPCODE(i)) == OpArgR, base+GETARG_C(i))
	#define RKB(i)  check_exp(getBMode(GET_OPCODE(i)) == OpArgK, \		#define RKB(i)  check_exp(getBMode(GET_OPCODE(i)) == OpArgK, \
	ISK(GETARG_B(i)) ? k+INDEXK(GETARG_B(i)) : base+GETARG_B(i))		ISK(GETARG_B(i)) ? k+INDEXK(GETARG_B(i)) : base+GETARG_B(i))
	#define RKC(i)  check_exp(getCMode(GET_OPCODE(i)) == OpArgK, \		#define RKC(i)  check_exp(getCMode(GET_OPCODE(i)) == OpArgK, \
	ISK(GETARG_C(i)) ? k+INDEXK(GETARG_C(i)) : base+GETARG_C(i))		ISK(GETARG_C(i)) ? k+INDEXK(GETARG_C(i)) : base+GETARG_C(i))
	#define KBx(i)  \		#define KBx(i)  \
	(k + (GETARG_Bx(i) != 0 ? GETARG_Bx(i) - 1 : GETARG_Ax(*ci->u.l.savedpc++)))		(k + (GETARG_Bx(i) != 0 ? GETARG_Bx(i) - 1 : GETARG_Ax(*ci->u.l.savedpc++)))
	/* execute a jump instruction */		/* execute a jump instruction */
	#define dojump(ci,i,e) \		#define dojump(ci,i,e) \
	{ int a = GETARG_A(i); \		{ int a = GETARG_A(i); \
	if (a > 0) luaF_close(L, ci->u.l.base + a - 1); \		if (a > 0) luaF_close(L, ci->u.l.base + a - 1); \
	ci->u.l.savedpc += GETARG_sBx(i) + e; }		ci->u.l.savedpc += GETARG_sBx(i) + e; }
	/* for test instructions, execute the jump instruction that follows it */		/* for test instructions, execute the jump instruction that follows it */
	#define donextjump(ci)  { i = *ci->u.l.savedpc; dojump(ci, i, 1); }		#define donextjump(ci)  { i = *ci->u.l.savedpc; dojump(ci, i, 1); }
	#define Protect(x)  { {x;}; base = ci->u.l.base; }		#define Protect(x)  { {x;}; base = ci->u.l.base; }
	#define checkGC(L,c)    Protect(luaC_condGC(L, c); luai_threadyield(L);)		#define checkGC(L,c)    Protect(luaC_condGC(L, c); luai_threadyield(L);)
	#define arith_op(op,tm) { \		#define arith_op(op,tm) { \
	TValue *rb = RKB(i); \		TValue *rb = RKB(i); \
	TValue *rc = RKC(i); \		TValue *rc = RKC(i); \
	if (ttisnumber(rb) && ttisnumber(rc)) { \		if (ttisnumber(rb) && ttisnumber(rc)) { \
	lua_Number nb = nvalue(rb), nc = nvalue(rc); \		lua_Number nb = nvalue(rb), nc = nvalue(rc); \
	setnvalue(ra, op(L, nb, nc)); \		setnvalue(ra, op(L, nb, nc)); \
	} \		} \
	else { Protect(luaV_arith(L, ra, rb, rc, tm)); } }		else { Protect(luaV_arith(L, ra, rb, rc, tm)); } }
	#define vmdispatch(o)   switch(o)		#define vmdispatch(o)   switch(o)
	#define vmcase(l,b) case l: {b}  break;		#define vmcase(l,b) case l: {b}  break;
	#define vmcasenb(l,b)   case l: {b}     /* nb = no break */		#define vmcasenb(l,b)   case l: {b}     /* nb = no break */
	void luaV_execute (lua_State *L) {		void luaV_execute (lua_State *L) {
	CallInfo *ci = L->ci;		CallInfo *ci = L->ci;
	LClosure *cl;		LClosure *cl;
	TValue *k;		TValue *k;
	StkId base;		StkId base;
	newframe:  /* reentry point when frame changes (call/return) */		newframe:  /* reentry point when frame changes (call/return) */
	lua_assert(ci == L->ci);		lua_assert(ci == L->ci);
	cl = clLvalue(ci->func);		cl = clLvalue(ci->func);
	k = cl->p->k;		k = cl->p->k;
	base = ci->u.l.base;		base = ci->u.l.base;
	/* main loop of interpreter */		/* main loop of interpreter */
	for (;;) {		for (;;) {
	Instruction i = *(ci->u.l.savedpc++);		Instruction i = *(ci->u.l.savedpc++);
	StkId ra;		StkId ra;
	if ((L->hookmask & (LUA_MASKLINE | LUA_MASKCOUNT)) &&		if ((L->hookmask & (LUA_MASKLINE | LUA_MASKCOUNT)) &&
	(--L->hookcount == 0 || L->hookmask & LUA_MASKLINE)) {		(--L->hookcount == 0 || L->hookmask & LUA_MASKLINE)) {
	Protect(traceexec(L));		Protect(traceexec(L));
	}		}
	/* WARNING: several calls may realloc the stack and invalidate `ra' */		/* WARNING: several calls may realloc the stack and invalidate `ra' */
	ra = RA(i);		ra = RA(i);
	lua_assert(base == ci->u.l.base);		lua_assert(base == ci->u.l.base);
	lua_assert(base <= L->top && L->top < L->stack + L->stacksize);		lua_assert(base <= L->top && L->top < L->stack + L->stacksize);
	vmdispatch (GET_OPCODE(i)) {		vmdispatch (GET_OPCODE(i)) {
	vmcase(OP_MOVE,		vmcase(OP_MOVE,
	setobjs2s(L, ra, RB(i));		setobjs2s(L, ra, RB(i));
	)		)
	vmcase(OP_LOADK,		vmcase(OP_LOADK,
	TValue *rb = k + GETARG_Bx(i);		TValue *rb = k + GETARG_Bx(i);
	setobj2s(L, ra, rb);		setobj2s(L, ra, rb);
	)		)
	vmcase(OP_LOADKX,		vmcase(OP_LOADKX,
	TValue *rb;		TValue *rb;
	lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_EXTRAARG);		lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_EXTRAARG);
	rb = k + GETARG_Ax(*ci->u.l.savedpc++);		rb = k + GETARG_Ax(*ci->u.l.savedpc++);
	setobj2s(L, ra, rb);		setobj2s(L, ra, rb);
	)		)
	vmcase(OP_LOADBOOL,		vmcase(OP_LOADBOOL,
	setbvalue(ra, GETARG_B(i));		setbvalue(ra, GETARG_B(i));
	if (GETARG_C(i)) ci->u.l.savedpc++;  /* skip next instruction (if C) */		if (GETARG_C(i)) ci->u.l.savedpc++;  /* skip next instruction (if C) */
	)		)
	vmcase(OP_LOADNIL,		vmcase(OP_LOADNIL,
	int b = GETARG_B(i);		int b = GETARG_B(i);
	do {		do {
	setnilvalue(ra++);		setnilvalue(ra++);
	} while (b--);		} while (b--);
	)		)
	vmcase(OP_GETUPVAL,		vmcase(OP_GETUPVAL,
	int b = GETARG_B(i);		int b = GETARG_B(i);
	setobj2s(L, ra, cl->upvals[b]->v);		setobj2s(L, ra, cl->upvals[b]->v);
	)		)
	vmcase(OP_GETTABUP,		vmcase(OP_GETTABUP,
	int b = GETARG_B(i);		int b = GETARG_B(i);
	Protect(luaV_gettable(L, cl->upvals[b]->v, RKC(i), ra));		Protect(luaV_gettable(L, cl->upvals[b]->v, RKC(i), ra));
	)		)
	vmcase(OP_GETTABLE,		vmcase(OP_GETTABLE,
	Protect(luaV_gettable(L, RB(i), RKC(i), ra));		Protect(luaV_gettable(L, RB(i), RKC(i), ra));
	)		)
	vmcase(OP_SETTABUP,		vmcase(OP_SETTABUP,
	int a = GETARG_A(i);		int a = GETARG_A(i);
	Protect(luaV_settable(L, cl->upvals[a]->v, RKB(i), RKC(i)));		Protect(luaV_settable(L, cl->upvals[a]->v, RKB(i), RKC(i)));
	)		)
	vmcase(OP_SETUPVAL,		vmcase(OP_SETUPVAL,
	UpVal *uv = cl->upvals[GETARG_B(i)];		UpVal *uv = cl->upvals[GETARG_B(i)];
	setobj(L, uv->v, ra);		setobj(L, uv->v, ra);
	luaC_barrier(L, uv, ra);		luaC_barrier(L, uv, ra);
	)		)
	vmcase(OP_SETTABLE,		vmcase(OP_SETTABLE,
	Protect(luaV_settable(L, ra, RKB(i), RKC(i)));		Protect(luaV_settable(L, ra, RKB(i), RKC(i)));
	)		)
	vmcase(OP_NEWTABLE,		vmcase(OP_NEWTABLE,
	int b = GETARG_B(i);		int b = GETARG_B(i);
	int c = GETARG_C(i);		int c = GETARG_C(i);
	Table *t = luaH_new(L);		Table *t = luaH_new(L);
	sethvalue(L, ra, t);		sethvalue(L, ra, t);
	if (b != 0 || c != 0)		if (b != 0 || c != 0)
	luaH_resize(L, t, luaO_fb2int(b), luaO_fb2int(c));		luaH_resize(L, t, luaO_fb2int(b), luaO_fb2int(c));
	checkGC(L,		checkGC(L,
	L->top = ra + 1;  /* limit of live values */		L->top = ra + 1;  /* limit of live values */
	luaC_step(L);		luaC_step(L);
	L->top = ci->top;  /* restore top */		L->top = ci->top;  /* restore top */
	)		)
	)		)
	vmcase(OP_SELF,		vmcase(OP_SELF,
	StkId rb = RB(i);		StkId rb = RB(i);
	setobjs2s(L, ra+1, rb);		setobjs2s(L, ra+1, rb);
	Protect(luaV_gettable(L, rb, RKC(i), ra));		Protect(luaV_gettable(L, rb, RKC(i), ra));
	)		)
	vmcase(OP_ADD,		vmcase(OP_ADD,
	arith_op(luai_numadd, TM_ADD);		arith_op(luai_numadd, TM_ADD);
	)		)
	vmcase(OP_SUB,		vmcase(OP_SUB,
	arith_op(luai_numsub, TM_SUB);		arith_op(luai_numsub, TM_SUB);
	)		)
	vmcase(OP_MUL,		vmcase(OP_MUL,
	arith_op(luai_nummul, TM_MUL);		arith_op(luai_nummul, TM_MUL);
	)		)
	vmcase(OP_DIV,		vmcase(OP_DIV,
	arith_op(luai_numdiv, TM_DIV);		arith_op(luai_numdiv, TM_DIV);
	)		)
	vmcase(OP_MOD,		vmcase(OP_MOD,
	arith_op(luai_nummod, TM_MOD);		arith_op(luai_nummod, TM_MOD);
	)		)
	vmcase(OP_POW,		vmcase(OP_POW,
	arith_op(luai_numpow, TM_POW);		arith_op(luai_numpow, TM_POW);
	)		)
	#ifdef GCW_BIT
	vmcase(OP_BAND,
	arith_op(bit_and, TM_BAND);
	)
	vmcase(OP_BOR,
	arith_op(bit_or, TM_BOR);
	)
	vmcase(OP_BXOR,
	arith_op(bit_xor, TM_BXOR);
	)
	vmcase(OP_BLSH,
	arith_op(bit_lshift, TM_BLSH);
	)
	vmcase(OP_BRSH,
	arith_op(bit_rshift, TM_BRSH);
	)
	vmcase(OP_LAND,
	arith_op(log_and, TM_LAND);
	)
	vmcase(OP_LOR,
	arith_op(log_or, TM_LOR);
	)
	vmcase(OP_BNOT,
	TValue *rb = RB(i);
	if (ttisnumber(rb)) {
	lua_Number nb = nvalue(rb);
	setnvalue(ra,bit_not(L,nb));
	}
	else {
	Protect(luaV_arith(L,ra,rb,rb, TM_BNOT));
	}
	)
	vmcase(OP_LNOT,
	TValue *rb = RB(i);
	if (ttisnumber(rb)) {
	lua_Number nb = nvalue(rb);
	setnvalue(ra,log_not(L,nb));
	}
	else {
	Protect(luaV_arith(L,ra,rb,rb, TM_LNOT));
	}
	)
	#endif
	vmcase(OP_UNM,		vmcase(OP_UNM,
	TValue *rb = RB(i);		TValue *rb = RB(i);
	if (ttisnumber(rb)) {		if (ttisnumber(rb)) {
	lua_Number nb = nvalue(rb);		lua_Number nb = nvalue(rb);
	setnvalue(ra, luai_numunm(L, nb));		setnvalue(ra, luai_numunm(L, nb));
	}		}
	else {		else {
	Protect(luaV_arith(L, ra, rb, rb, TM_UNM));		Protect(luaV_arith(L, ra, rb, rb, TM_UNM));
	}		}
	)		)
	vmcase(OP_NOT,		vmcase(OP_NOT,
	TValue *rb = RB(i);		TValue *rb = RB(i);
	int res = l_isfalse(rb);  /* next assignment may change this value */		int res = l_isfalse(rb);  /* next assignment may change this value */
	setbvalue(ra, res);		setbvalue(ra, res);
	)		)
	vmcase(OP_LEN,		vmcase(OP_LEN,
	Protect(luaV_objlen(L, ra, RB(i)));		Protect(luaV_objlen(L, ra, RB(i)));
	)		)
	vmcase(OP_CONCAT,		vmcase(OP_CONCAT,
	int b = GETARG_B(i);		int b = GETARG_B(i);
	int c = GETARG_C(i);		int c = GETARG_C(i);
	StkId rb;		StkId rb;
	L->top = base + c + 1;  /* mark the end of concat operands */		L->top = base + c + 1;  /* mark the end of concat operands */
	Protect(luaV_concat(L, c - b + 1));		Protect(luaV_concat(L, c - b + 1));
	ra = RA(i);  /* 'luav_concat' may invoke TMs and move the stack */		ra = RA(i);  /* 'luav_concat' may invoke TMs and move the stack */
	rb = b + base;		rb = b + base;
	setobjs2s(L, ra, rb);		setobjs2s(L, ra, rb);
	checkGC(L,		checkGC(L,
	L->top = (ra >= rb ? ra + 1 : rb);  /* limit of live values */		L->top = (ra >= rb ? ra + 1 : rb);  /* limit of live values */
	luaC_step(L);		luaC_step(L);
	)		)
	L->top = ci->top;  /* restore top */		L->top = ci->top;  /* restore top */
	)		)
	vmcase(OP_JMP,		vmcase(OP_JMP,
	dojump(ci, i, 0);		dojump(ci, i, 0);
	)		)
	vmcase(OP_EQ,		vmcase(OP_EQ,
	TValue *rb = RKB(i);		TValue *rb = RKB(i);
	TValue *rc = RKC(i);		TValue *rc = RKC(i);
	Protect(		Protect(
	if (cast_int(equalobj(L, rb, rc)) != GETARG_A(i))		if (cast_int(equalobj(L, rb, rc)) != GETARG_A(i))
	ci->u.l.savedpc++;		ci->u.l.savedpc++;
	else		else
	donextjump(ci);		donextjump(ci);
	)		)
	)		)
	vmcase(OP_LT,		vmcase(OP_LT,
	Protect(		Protect(
	if (luaV_lessthan(L, RKB(i), RKC(i)) != GETARG_A(i))		if (luaV_lessthan(L, RKB(i), RKC(i)) != GETARG_A(i))
	ci->u.l.savedpc++;		ci->u.l.savedpc++;
	else		else
	donextjump(ci);		donextjump(ci);
	)		)
	)		)
	vmcase(OP_LE,		vmcase(OP_LE,
	Protect(		Protect(
	if (luaV_lessequal(L, RKB(i), RKC(i)) != GETARG_A(i))		if (luaV_lessequal(L, RKB(i), RKC(i)) != GETARG_A(i))
	ci->u.l.savedpc++;		ci->u.l.savedpc++;
	else		else
	donextjump(ci);		donextjump(ci);
	)		)
	)		)
	vmcase(OP_TEST,		vmcase(OP_TEST,
	if (GETARG_C(i) ? l_isfalse(ra) : !l_isfalse(ra))		if (GETARG_C(i) ? l_isfalse(ra) : !l_isfalse(ra))
	ci->u.l.savedpc++;		ci->u.l.savedpc++;
	else		else
	donextjump(ci);		donextjump(ci);
	)		)
	vmcase(OP_TESTSET,		vmcase(OP_TESTSET,
	TValue *rb = RB(i);		TValue *rb = RB(i);
	if (GETARG_C(i) ? l_isfalse(rb) : !l_isfalse(rb))		if (GETARG_C(i) ? l_isfalse(rb) : !l_isfalse(rb))
	ci->u.l.savedpc++;		ci->u.l.savedpc++;
	else {		else {
	setobjs2s(L, ra, rb);		setobjs2s(L, ra, rb);
	donextjump(ci);		donextjump(ci);
	}		}
	)		)
	vmcase(OP_CALL,		vmcase(OP_CALL,
	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 */
	if (luaD_precall(L, ra, nresults)) {  /* C function? */		if (luaD_precall(L, ra, nresults)) {  /* C function? */
	if (nresults >= 0) L->top = ci->top;  /* adjust results */		if (nresults >= 0) L->top = ci->top;  /* adjust results */
	base = ci->u.l.base;		base = ci->u.l.base;
	}		}
	else {  /* Lua function */		else {  /* Lua function */
	ci = L->ci;		ci = L->ci;
	ci->callstatus |= CIST_REENTRY;		ci->callstatus |= CIST_REENTRY;
	goto newframe;  /* restart luaV_execute over new Lua function */		goto newframe;  /* restart luaV_execute over new Lua function */
	}		}
	)		)
	vmcase(OP_TAILCALL,		vmcase(OP_TAILCALL,
	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 */
	lua_assert(GETARG_C(i) - 1 == LUA_MULTRET);		lua_assert(GETARG_C(i) - 1 == LUA_MULTRET);
	if (luaD_precall(L, ra, LUA_MULTRET))  /* C function? */		if (luaD_precall(L, ra, LUA_MULTRET))  /* C function? */
	base = ci->u.l.base;		base = ci->u.l.base;
	else {		else {
	/* tail call: put called frame (n) in place of caller one (o) */		/* tail call: put called frame (n) in place of caller one (o) */
	CallInfo *nci = L->ci;  /* called frame */		CallInfo *nci = L->ci;  /* called frame */
	CallInfo *oci = nci->previous;  /* caller frame */		CallInfo *oci = nci->previous;  /* caller frame */
	StkId nfunc = nci->func;  /* called function */		StkId nfunc = nci->func;  /* called function */
	StkId ofunc = oci->func;  /* caller function */		StkId ofunc = oci->func;  /* caller function */
	/* last stack slot filled by 'precall' */		/* last stack slot filled by 'precall' */
	StkId lim = nci->u.l.base + getproto(nfunc)->numparams;		StkId lim = nci->u.l.base + getproto(nfunc)->numparams;
	int aux;		int aux;
	/* close all upvalues from previous call */		/* close all upvalues from previous call */
	if (cl->p->sizep > 0) luaF_close(L, oci->u.l.base);		if (cl->p->sizep > 0) luaF_close(L, oci->u.l.base);
	/* move new frame into old one */		/* move new frame into old one */
	for (aux = 0; nfunc + aux < lim; aux++)		for (aux = 0; nfunc + aux < lim; aux++)
	setobjs2s(L, ofunc + aux, nfunc + aux);		setobjs2s(L, ofunc + aux, nfunc + aux);
	oci->u.l.base = ofunc + (nci->u.l.base - nfunc);  /* correct base */		oci->u.l.base = ofunc + (nci->u.l.base - nfunc);  /* correct base */
	oci->top = L->top = ofunc + (L->top - nfunc);  /* correct top */		oci->top = L->top = ofunc + (L->top - nfunc);  /* correct top */
	oci->u.l.savedpc = nci->u.l.savedpc;		oci->u.l.savedpc = nci->u.l.savedpc;
	oci->callstatus |= CIST_TAIL;  /* function was tail called */		oci->callstatus |= CIST_TAIL;  /* function was tail called */
	ci = L->ci = oci;  /* remove new frame */		ci = L->ci = oci;  /* remove new frame */
	lua_assert(L->top == oci->u.l.base + getproto(ofunc)->maxstacksize);		lua_assert(L->top == oci->u.l.base + getproto(ofunc)->maxstacksize);
	goto newframe;  /* restart luaV_execute over new Lua function */		goto newframe;  /* restart luaV_execute over new Lua function */
	}		}
	)		)
	vmcasenb(OP_RETURN,		vmcasenb(OP_RETURN,
	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 (cl->p->sizep > 0) luaF_close(L, base);		if (cl->p->sizep > 0) luaF_close(L, base);
	b = luaD_poscall(L, ra);		b = luaD_poscall(L, ra);
	if (!(ci->callstatus & CIST_REENTRY))  /* 'ci' still the called one */		if (!(ci->callstatus & CIST_REENTRY))  /* 'ci' still the called one */
	return;  /* external invocation: return */		return;  /* external invocation: return */
	else {  /* invocation via reentry: continue execution */		else {  /* invocation via reentry: continue execution */
	ci = L->ci;		ci = L->ci;
	if (b) L->top = ci->top;		if (b) L->top = ci->top;
	lua_assert(isLua(ci));		lua_assert(isLua(ci));
	lua_assert(GET_OPCODE(*((ci)->u.l.savedpc - 1)) == OP_CALL);		lua_assert(GET_OPCODE(*((ci)->u.l.savedpc - 1)) == OP_CALL);
	goto newframe;  /* restart luaV_execute over new Lua function */		goto newframe;  /* restart luaV_execute over new Lua function */
	}		}
	)		)
	vmcase(OP_FORLOOP,		vmcase(OP_FORLOOP,
	lua_Number step = nvalue(ra+2);		lua_Number step = nvalue(ra+2);
	lua_Number idx = luai_numadd(L, nvalue(ra), step); /* increment index */		lua_Number idx = luai_numadd(L, nvalue(ra), step); /* increment index */
	lua_Number limit = nvalue(ra+1);		lua_Number limit = nvalue(ra+1);
	if (luai_numlt(L, 0, step) ? luai_numle(L, idx, limit)		if (luai_numlt(L, 0, step) ? luai_numle(L, idx, limit)
	: luai_numle(L, limit, idx)) {		: luai_numle(L, limit, idx)) {
	ci->u.l.savedpc += GETARG_sBx(i);  /* jump back */		ci->u.l.savedpc += GETARG_sBx(i);  /* jump back */
	setnvalue(ra, idx);  /* update internal index... */		setnvalue(ra, idx);  /* update internal index... */
	setnvalue(ra+3, idx);  /* ...and external index */		setnvalue(ra+3, idx);  /* ...and external index */
	}		}
	)		)
	vmcase(OP_FORPREP,		vmcase(OP_FORPREP,
	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;
	if (!tonumber(init, ra))		if (!tonumber(init, ra))
	luaG_runerror(L, LUA_QL("for") " initial value must be a number");		luaG_runerror(L, LUA_QL("for") " initial value must be a number");
	else if (!tonumber(plimit, ra+1))		else if (!tonumber(plimit, ra+1))
	luaG_runerror(L, LUA_QL("for") " limit must be a number");		luaG_runerror(L, LUA_QL("for") " limit must be a number");
	else if (!tonumber(pstep, ra+2))		else if (!tonumber(pstep, ra+2))
	luaG_runerror(L, LUA_QL("for") " step must be a number");		luaG_runerror(L, LUA_QL("for") " step must be a number");
	setnvalue(ra, luai_numsub(L, nvalue(ra), nvalue(pstep)));		setnvalue(ra, luai_numsub(L, nvalue(ra), nvalue(pstep)));
	ci->u.l.savedpc += GETARG_sBx(i);		ci->u.l.savedpc += GETARG_sBx(i);
	)		)
	vmcasenb(OP_TFORCALL,		vmcasenb(OP_TFORCALL,
	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);
	setobjs2s(L, cb, ra);		setobjs2s(L, cb, ra);
	L->top = cb + 3;  /* func. + 2 args (state and index) */		L->top = cb + 3;  /* func. + 2 args (state and index) */
	Protect(luaD_call(L, cb, GETARG_C(i), 1));		Protect(luaD_call(L, cb, GETARG_C(i), 1));
	L->top = ci->top;		L->top = ci->top;
	i = *(ci->u.l.savedpc++);  /* go to next instruction */		i = *(ci->u.l.savedpc++);  /* go to next instruction */
	ra = RA(i);		ra = RA(i);
	lua_assert(GET_OPCODE(i) == OP_TFORLOOP);		lua_assert(GET_OPCODE(i) == OP_TFORLOOP);
	goto l_tforloop;		goto l_tforloop;
	)		)
	vmcase(OP_TFORLOOP,		vmcase(OP_TFORLOOP,
	l_tforloop:		l_tforloop:
	if (!ttisnil(ra + 1)) {  /* continue loop? */		if (!ttisnil(ra + 1)) {  /* continue loop? */
	setobjs2s(L, ra, ra + 1);  /* save control variable */		setobjs2s(L, ra, ra + 1);  /* save control variable */
	ci->u.l.savedpc += GETARG_sBx(i);  /* jump back */		ci->u.l.savedpc += GETARG_sBx(i);  /* jump back */
	}		}
	)		)
	vmcase(OP_SETLIST,		vmcase(OP_SETLIST,
	int n = GETARG_B(i);		int n = GETARG_B(i);
	int c = GETARG_C(i);		int c = GETARG_C(i);
	int last;		int last;
	Table *h;		Table *h;
	if (n == 0) n = cast_int(L->top - ra) - 1;		if (n == 0) n = cast_int(L->top - ra) - 1;
	if (c == 0) {		if (c == 0) {
	lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_EXTRAARG);		lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_EXTRAARG);
	c = GETARG_Ax(*ci->u.l.savedpc++);		c = GETARG_Ax(*ci->u.l.savedpc++);
	}		}
	luai_runtimecheck(L, ttistable(ra));		luai_runtimecheck(L, ttistable(ra));
	h = hvalue(ra);		h = hvalue(ra);
	last = ((c-1)*LFIELDS_PER_FLUSH) + n;		last = ((c-1)*LFIELDS_PER_FLUSH) + n;
	if (last > h->sizearray)  /* needs more space? */		if (last > h->sizearray)  /* needs more space? */
	luaH_resizearray(L, h, last);  /* pre-allocate it at once */		luaH_resizearray(L, h, last);  /* pre-allocate it at once */
	for (; n > 0; n--) {		for (; n > 0; n--) {
	TValue *val = ra+n;		TValue *val = ra+n;
	luaH_setint(L, h, last--, val);		luaH_setint(L, h, last--, val);
	luaC_barrierback(L, obj2gco(h), val);		luaC_barrierback(L, obj2gco(h), val);
	}		}
	L->top = ci->top;  /* correct top (in case of previous open call) */		L->top = ci->top;  /* correct top (in case of previous open call) */
	)		)
	vmcase(OP_CLOSURE,		vmcase(OP_CLOSURE,
	Proto *p = cl->p->p[GETARG_Bx(i)];		Proto *p = cl->p->p[GETARG_Bx(i)];
	Closure *ncl = getcached(p, cl->upvals, base);  /* cached closure */		Closure *ncl = getcached(p, cl->upvals, base);  /* cached closure */
	if (ncl == NULL)  /* no match? */		if (ncl == NULL)  /* no match? */
	pushclosure(L, p, cl->upvals, base, ra);  /* create a new one */		pushclosure(L, p, cl->upvals, base, ra);  /* create a new one */
	else		else
	setclLvalue(L, ra, ncl);  /* push cashed closure */		setclLvalue(L, ra, ncl);  /* push cashed closure */
	checkGC(L,		checkGC(L,
	L->top = ra + 1;  /* limit of live values */		L->top = ra + 1;  /* limit of live values */
	luaC_step(L);		luaC_step(L);
	L->top = ci->top;  /* restore top */		L->top = ci->top;  /* restore top */
	)		)
	)		)
	vmcase(OP_VARARG,		vmcase(OP_VARARG,
	int b = GETARG_B(i) - 1;		int b = GETARG_B(i) - 1;
	int j;		int j;
	int n = cast_int(base - ci->func) - cl->p->numparams - 1;		int n = cast_int(base - ci->func) - cl->p->numparams - 1;
	if (b < 0) {  /* B == 0? */		if (b < 0) {  /* B == 0? */
	b = n;  /* get all var. arguments */		b = n;  /* get all var. arguments */
	Protect(luaD_checkstack(L, n));		Protect(luaD_checkstack(L, n));
	ra = RA(i);  /* previous call may change the stack */		ra = RA(i);  /* previous call may change the stack */
	L->top = ra + n;		L->top = ra + n;
	}		}
	for (j = 0; j < b; j++) {		for (j = 0; j < b; j++) {
	if (j < n) {		if (j < n) {
	setobjs2s(L, ra + j, base - n + j);		setobjs2s(L, ra + j, base - n + j);
	}		}
	else {		else {
	setnilvalue(ra + j);		setnilvalue(ra + j);
	}		}
	}		}
	)		)
	vmcase(OP_EXTRAARG,		vmcase(OP_EXTRAARG,
	lua_assert(0);		lua_assert(0);
	)		)
	}		}
	}		}
	}		}