cast
return Program.File.class.cast(p);
#define CAST_PTRINT(cast, value) ((cast)(uintptr_t)value)
#define CAST_PTRINT(cast, value) ((cast)value)
#define ABI_CALL_REAL(lib, sym, cast) \
(cast __abi_ ## lib ## _ ## sym ## _sym.a_real)
Record r = Record.class.cast(o);
SymbolValueRecord symbol = SymbolValueRecord.class.cast(rec);
KernelSymbolRecord.class.cast(symbol).setSymbol(lookupString);
UserSymbolRecord.class.cast(symbol).setSymbol(lookupString);
StackValueRecord stack = StackValueRecord.class.cast(rec);
KernelStackRecord.class.cast(stack).setStackFrames(frames);
UserStackRecord.class.cast(stack).setStackFrames(frames);
printa = PrintaRecord.class.cast(record);
ScalarRecord scalar = ScalarRecord.class.cast(rec);
Integer exitStatus = Integer.class.cast(scalar.getValue());
PrintfRecord printf = PrintfRecord.class.cast(record);
printf.addUnformattedElement(ScalarRecord.class.cast(e));
PrintfRecord printf = PrintfRecord.class.cast(record);
int i1 = Integer.class.cast(v1);
int i2 = Integer.class.cast(v2);
long i1 = Long.class.cast(v1);
long i2 = Long.class.cast(v2);
ScalarRecord t1 = ScalarRecord.class.cast(r1);
ScalarRecord t2 = ScalarRecord.class.cast(r2);
Comparable v1 = Comparable.class.cast(o1);
Comparable v2 = Comparable.class.cast(o2);
Comparable v1 = Comparable.class.cast(r1);
Comparable v2 = Comparable.class.cast(r2);
ExitRecord e1 = ExitRecord.class.cast(r1);
ExitRecord e2 = ExitRecord.class.cast(r2);
r1.getClass().cast(r2);
value = ValueRecord.class.cast(record).getValue();
buf.append(String.class.cast(value));
cmp = ProbeData.compareUnsigned(Comparable.class.cast(o1),
Comparable.class.cast(o2));
struct expression *cast = alloc_expression(p->pos, EXPR_CAST);
cast->cast_type = expr->cast_type;
expr->cast_expression = cast;
token = initializer(&cast->cast_expression, token);
token = postfix_expression(token, &expr->cast_expression, cast);
struct expression *cast = alloc_expression(next->pos, EXPR_CAST);
cast->cast_type = sym;
token = initializer(&cast->cast_expression, token);
return postfix_expression(token, tree, cast);
*tree = cast;
cast->type = EXPR_FORCE_CAST;
cast->cast_expression = v;
struct expression *cast = expr->cast_expression;
expr->cast_expression = copy_expression(cast);
struct expression *cast = copy_expression(expr->cast_expression);
if (cast == expr->cast_expression)
expr->cast_expression = cast;
goto cast;
goto cast;
goto cast;
goto cast;
goto cast;
cast:
lu_mem debt = cast(lu_mem, data) * 1024 - GCSTEPSIZE;
luaV_arith(L, o1, o1, o2, cast(TMS, op - LUA_OPADD + TM_ADD));
#define NONVALIDVALUE cast(TValue *, luaO_nilobject)
case LUA_TLCF: return cast(void *, cast(size_t, fvalue(o)));
setpvalue(&k, cast(void *, p));
setpvalue(&k, cast(void *, p));
struct CallS *c = cast(struct CallS *, ud);
codearith(fs, cast(OpCode, op - OPR_ADD + OP_ADD), e1, e2, line);
codecomp(fs, cast(OpCode, op - OPR_EQ + OP_EQ), 1, e1, e2);
codecomp(fs, cast(OpCode, op - OPR_NE + OP_EQ), 0, e1, e2);
#define pcRel(pc, p) (cast(int, (pc) - (p)->code) - 1)
StkId firstArg = cast(StkId, ud);
struct SParser *p = cast(struct SParser *, ud);
#define sizeCclosure(n) (cast(int, sizeof(CClosure)) + \
cast(int, sizeof(TValue)*((n)-1)))
#define sizeLclosure(n) (cast(int, sizeof(LClosure)) + \
cast(int, sizeof(TValue *)*((n)-1)))
l_mem work = -cast(l_mem, g->GCmemtrav); /* start counting work */
char *raw = cast(char *, luaM_newobject(L, novariant(tt), sz));
sizeof(Node) * cast(size_t, sizenode(h));
if (g->strt.nuse < cast(lu_int32, hs)) /* using less than that half? */
debt = -cast(l_mem, threshold - gettotalbytes(g));
#define gnodelast(h) gnode(h, cast(size_t, sizenode(h)))
#define luaC_white(g) cast(lu_byte, (g)->currentwhite & WHITEBITS)
#define resetbits(x,m) ((x) &= cast(lu_byte, ~(m)))
b->buffer[luaZ_bufflen(b)++] = cast(char, c);
lua_assert(token == cast(unsigned char, token));
#define NUM_RESERVED (cast(int, TK_WHILE-FIRST_RESERVED+1))
#define cast_byte(i) cast(lu_byte, (i))
#define cast_num(i) cast(lua_Number, (i))
#define cast_int(i) cast(int, (i))
#define cast_uchar(i) cast(unsigned char, (i))
(cast(void, \
(cast(size_t, (n)+1) > MAX_SIZET/(e)) ? (luaM_toobig(L), 0) : 0), \
#define luaM_new(L,t) cast(t *, luaM_malloc(L, sizeof(t)))
cast(t *, luaM_reallocv(L, NULL, 0, n, sizeof(t)))
((v)=cast(t *, luaM_growaux_(L,v,&(size),sizeof(t),limit,e)))
((v)=cast(t *, luaM_reallocv(L, v, oldn, n, sizeof(t))))
*endptr = cast(char *, s); /* nothing is valid yet */
*endptr = cast(char *, s); /* valid up to here */
*endptr = cast(char *, s); /* valid up to here */
buff = cast(char, va_arg(argp, int));
#define deadvalue(o) check_exp(ttisdeadkey(o), cast(void *, val_(o).gc))
val_(io).gc=cast(GCObject *, x_); settt_(io, ctb(x_->tsv.tt)); \
val_(io).gc=cast(GCObject *, (x)); settt_(io, ctb(LUA_TUSERDATA)); \
val_(io).gc=cast(GCObject *, (x)); settt_(io, ctb(LUA_TTHREAD)); \
val_(io).gc=cast(GCObject *, (x)); settt_(io, ctb(LUA_TLCL)); \
val_(io).gc=cast(GCObject *, (x)); settt_(io, ctb(LUA_TCCL)); \
val_(io).gc=cast(GCObject *, (x)); settt_(io, ctb(LUA_TTABLE)); \
#define getstr(ts) cast(const char *, (ts) + 1)
(check_exp((size&(size-1))==0, (cast(int, (s) & ((size)-1)))))
#define SETARG_sBx(i,b) SETARG_Bx((i),cast(unsigned int, (b)+MAXARG_sBx))
#define CREATE_ABC(o,a,b,c) ((cast(Instruction, o)<<POS_OP) \
| (cast(Instruction, a)<<POS_A) \
| (cast(Instruction, b)<<POS_B) \
| (cast(Instruction, c)<<POS_C))
#define CREATE_ABx(o,a,bc) ((cast(Instruction, o)<<POS_OP) \
| (cast(Instruction, a)<<POS_A) \
| (cast(Instruction, bc)<<POS_Bx))
#define CREATE_Ax(o,a) ((cast(Instruction, o)<<POS_OP) \
| (cast(Instruction, a)<<POS_Ax))
#define NUM_OPCODES (cast(int, OP_EXTRAARG) + 1)
#define getOpMode(m) (cast(enum OpMode, luaP_opmodes[m] & 3))
#define getBMode(m) (cast(enum OpArgMask, (luaP_opmodes[m] >> 4) & 3))
#define getCMode(m) (cast(enum OpArgMask, (luaP_opmodes[m] >> 2) & 3))
#define GET_OPCODE(i) (cast(OpCode, ((i)>>POS_OP) & MASK1(SIZE_OP,0)))
((cast(Instruction, o)<<POS_OP)&MASK1(SIZE_OP,POS_OP))))
#define getarg(i,pos,size) (cast(int, ((i)>>pos) & MASK1(size,0)))
((cast(Instruction, v)<<pos)&MASK1(size,pos))))
dyd->actvar.arr[dyd->actvar.n++].idx = cast(short, reg);
LG *l = cast(LG *, (*f)(ud, NULL, LUA_TTHREAD, sizeof(LG)));
#define luai_makeseed() cast(unsigned int, gethrtime())
#define fromstate(L) (cast(LX *, cast(lu_byte *, (L)) - offsetof(LX, l)))
{ size_t t = cast(size_t, e); \
#define obj2gco(v) (cast(GCObject *, (v)))
if (tb->nuse >= cast(lu_int32, tb->size) && tb->size <= MAX_INT/2)
unsigned int h = seed ^ cast(unsigned int, l);
t->node = cast(Node *, dummynode); /* use common `dummynode' */
luaM_freearray(L, nold, cast(size_t, twoto(oldhsize))); /* free old array */
luaM_freearray(L, t->node, cast(size_t, sizenode(t)));
if (cast(unsigned int, key-1) < cast(unsigned int, t->sizearray))
return cast(TValue *, p);
cell = cast(TValue *, p);
if (j > cast(unsigned int, MAX_INT)) { /* overflow? */
if (cast(unsigned int, i) == 0u - i) /* use unsigned to avoid overflows */
(gkey(cast(Node *, cast(char *, (v)) - offsetof(Node, i_val))))
TValue *oldval = cast(TValue *, luaH_get(h, key));
#define ECORE_LIST_FIRST_ENTRY(head, cast, link) \
(cast *)d_list_peek_head(head)
#define ECORE_LIST_NEXT(pos, link, cast) \
(cast *)d_list_next_entry(&((pos)->link))
#define ECORE_LIST_FOR_EACH_ENTRY(pos, _head, _link, cast) \
for (pos = (cast *)d_list_peek_head(_head); \
pos = (cast *)d_list_next_entry(&pos->_link))
#define ECORE_LIST_FOR_EACH_ENTRY_SAFE(pos, n, head, member, cast) \
for (pos = (cast *)d_list_peek_head(head), \
n = (pos) ? (cast *)d_list_next_entry(&pos->member) : NULL; \
pos = (cast *)n, \
n = (pos) ? (cast *)d_list_next_entry(&pos->member) : NULL)