cast_int
res = cast_int(gettotalbytes(g) >> 10);
res = cast_int(gettotalbytes(g) & 0x3ff);
: cast_int(L->top - L->ci->func + idx);
return cast_int(L->top - (L->ci->func + 1));
int inuse = cast_int(L->top - L->stack) + EXTRA_STACK;
cast_int(o - ci->u.l.base), &name);
int needed = cast_int(L->top - L->stack) + n + EXTRA_STACK;
return cast_int(lim - L->stack) + 1; /* part of stack in use */
n = cast_int(L->top - func) - 1; /* number of real arguments */
#define GCSWEEPMAX (cast_int((GCSTEPSIZE / GCSWEEPCOST) / 4))
#define GCSTEPSIZE (cast_int(100 * sizeof(TString)))
return ((e+1) << 3) | (cast_int(x) - 8);
for (i = cast_int(fs->nactvar) - 1; i >= 0; i--) {
i = cast_int(n - gnode(t, 0)); /* key index in hash table */
int total = cast_int(top - 1 - (base + b)); /* yet to concatenate */
if (cast_int(equalobj(L, rb, rc)) != GETARG_A(i))
if (n == 0) n = cast_int(L->top - ra) - 1;
int n = cast_int(base - ci->func) - cl->p->numparams - 1;