lua/lopcodes.h

232 lines
6.8 KiB
C
Raw Normal View History

1997-09-16 23:25:59 +04:00
/*
2002-03-18 17:49:46 +03:00
** $Id: lopcodes.h,v 1.90 2002/03/08 19:10:32 roberto Exp roberto $
1997-09-16 23:25:59 +04:00
** Opcodes for Lua virtual machine
** See Copyright Notice in lua.h
*/
#ifndef lopcodes_h
#define lopcodes_h
2000-03-24 22:49:23 +03:00
#include "llimits.h"
1997-09-16 23:25:59 +04:00
2000-02-14 19:51:08 +03:00
/*===========================================================================
2000-03-24 20:26:08 +03:00
We assume that instructions are unsigned numbers.
All instructions have an opcode in the first 6 bits.
Instructions can have the following fields:
`A' : 8 bits (25-32)
`B' : 8 bits (17-24)
`C' : 10 bits (7-16)
`Bc' : 18 bits (`B' and `C' together)
`sBc' : signed Bc
2000-03-24 20:26:08 +03:00
2000-04-05 00:48:44 +04:00
A signed argument is represented in excess K; that is, the number
value is the unsigned value minus K. K is exactly the maximum value
for that argument (so that -max is represented by 0, and +max is
represented by 2*max), which is half the maximum for the corresponding
unsigned argument.
2000-02-14 19:51:08 +03:00
===========================================================================*/
1999-03-06 00:16:07 +03:00
2000-03-09 03:19:22 +03:00
enum OpMode {iABC, iABc, iAsBc}; /* basic instruction format */
/*
** size and position of opcode arguments.
*/
#define SIZE_C 10
#define SIZE_B 8
#define SIZE_Bc (SIZE_C + SIZE_B)
#define SIZE_A 8
#define SIZE_OP 6
#define POS_C SIZE_OP
#define POS_B (POS_C + SIZE_C)
#define POS_Bc POS_C
#define POS_A (POS_B + SIZE_B)
/*
** limits for opcode arguments.
** we use (signed) int to manipulate most arguments,
** so they must fit in BITS_INT-1 bits (-1 for sign)
*/
#if SIZE_Bc < BITS_INT-1
#define MAXARG_Bc ((1<<SIZE_Bc)-1)
#define MAXARG_sBc (MAXARG_Bc>>1) /* `sBc' is signed */
#else
#define MAXARG_Bc MAX_INT
#define MAXARG_sBc MAX_INT
#endif
#define MAXARG_A ((1<<SIZE_A)-1)
#define MAXARG_B ((1<<SIZE_B)-1)
#define MAXARG_C ((1<<SIZE_C)-1)
2000-04-05 00:48:44 +04:00
2000-03-09 03:19:22 +03:00
/* creates a mask with `n' 1 bits at position `p' */
#define MASK1(n,p) ((~((~(Instruction)0)<<n))<<p)
2000-03-09 03:19:22 +03:00
/* creates a mask with `n' 0 bits at position `p' */
#define MASK0(n,p) (~MASK1(n,p))
2000-03-03 17:58:26 +03:00
2000-02-14 19:51:08 +03:00
/*
** the following macros help to manipulate instructions
*/
1997-09-16 23:25:59 +04:00
2001-08-31 23:46:07 +04:00
#define GET_OPCODE(i) (cast(OpCode, (i)&MASK1(SIZE_OP,0)))
#define SET_OPCODE(i,o) (((i)&MASK0(SIZE_OP,0)) | cast(Instruction, o))
2000-04-05 00:48:44 +04:00
2001-08-31 23:46:07 +04:00
#define GETARG_A(i) (cast(int, (i)>>POS_A))
#define SETARG_A(i,u) ((i) = (((i)&MASK0(SIZE_A,POS_A)) | \
2001-08-31 23:46:07 +04:00
(cast(Instruction, u)<<POS_A)))
2001-08-31 23:46:07 +04:00
#define GETARG_B(i) (cast(int, ((i)>>POS_B) & MASK1(SIZE_B,0)))
#define SETARG_B(i,b) ((i) = (((i)&MASK0(SIZE_B,POS_B)) | \
2001-08-31 23:46:07 +04:00
(cast(Instruction, b)<<POS_B)))
2001-08-31 23:46:07 +04:00
#define GETARG_C(i) (cast(int, ((i)>>POS_C) & MASK1(SIZE_C,0)))
#define SETARG_C(i,b) ((i) = (((i)&MASK0(SIZE_C,POS_C)) | \
2001-08-31 23:46:07 +04:00
(cast(Instruction, b)<<POS_C)))
2001-08-31 23:46:07 +04:00
#define GETARG_Bc(i) (cast(int, ((i)>>POS_Bc) & MASK1(SIZE_Bc,0)))
#define SETARG_Bc(i,b) ((i) = (((i)&MASK0(SIZE_Bc,POS_Bc)) | \
2001-08-31 23:46:07 +04:00
(cast(Instruction, b)<<POS_Bc)))
#define GETARG_sBc(i) (GETARG_Bc(i)-MAXARG_sBc)
2001-08-31 23:46:07 +04:00
#define SETARG_sBc(i,b) SETARG_Bc((i),cast(unsigned int, (b)+MAXARG_sBc))
2001-08-31 23:46:07 +04:00
#define CREATE_ABC(o,a,b,c) (cast(Instruction, o) \
| (cast(Instruction, a)<<POS_A) \
| (cast(Instruction, b)<<POS_B) \
| (cast(Instruction, c)<<POS_C))
2001-08-31 23:46:07 +04:00
#define CREATE_ABc(o,a,bc) (cast(Instruction, o) \
| (cast(Instruction, a)<<POS_A) \
| (cast(Instruction, bc)<<POS_Bc))
2000-04-05 00:48:44 +04:00
2000-02-22 16:31:43 +03:00
/*
2002-03-18 17:49:46 +03:00
** invalid registers that fits in 8 bits
*/
#define NO_REG MAXARG_A
2002-03-18 17:49:46 +03:00
#define NO_REG1 (NO_REG+1)
/*
** R(x) - register
** Kst(x) - constant (in constant table)
** R/K(x) == if x < MAXSTACK then R(x) else Kst(x-MAXSTACK)
2000-02-22 16:31:43 +03:00
*/
2000-02-14 19:51:08 +03:00
typedef enum {
2000-03-03 17:58:26 +03:00
/*----------------------------------------------------------------------
name args description
2000-03-03 17:58:26 +03:00
------------------------------------------------------------------------*/
OP_MOVE,/* A B R(A) := R(B) */
OP_LOADK,/* A Bc R(A) := Kst(Bc) */
2001-12-12 01:48:44 +03:00
OP_LOADBOOL,/* A B C R(A) := (Bool)B; if (C) PC++ */
OP_LOADNIL,/* A B R(A) := ... := R(B) := nil */
OP_GETUPVAL,/* A B R(A) := UpValue[B] */
OP_GETGLOBAL,/* A Bc R(A) := Gbl[Kst(Bc)] */
OP_GETTABLE,/* A B C R(A) := R(B)[R/K(C)] */
OP_SETGLOBAL,/* A Bc Gbl[Kst(Bc)] := R(A) */
OP_SETUPVAL,/* A B UpValue[B] := R(A) */
OP_SETTABLE,/* A B C R(B)[R/K(C)] := R(A) */
2001-10-25 23:14:14 +04:00
OP_NEWTABLE,/* A B C R(A) := {} (size = B,C) */
1997-09-16 23:25:59 +04:00
OP_SELF,/* A B C R(A+1) := R(B); R(A) := R(B)[R/K(C)] */
OP_ADD,/* A B C R(A) := R(B) + R/K(C) */
OP_SUB,/* A B C R(A) := R(B) - R/K(C) */
OP_MUL,/* A B C R(A) := R(B) * R/K(C) */
OP_DIV,/* A B C R(A) := R(B) / R/K(C) */
OP_POW,/* A B C R(A) := R(B) ^ R/K(C) */
OP_UNM,/* A B R(A) := -R(B) */
OP_NOT,/* A B R(A) := not R(B) */
OP_CONCAT,/* A B C R(A) := R(B).. ... ..R(C) */
OP_JMP,/* sBc PC += sBc */
1997-09-16 23:25:59 +04:00
OP_TESTEQ,/* A C if not (R(A) == R/K(C)) then pc++ */
OP_TESTNE,/* A C if not (R(A) ~= R/K(C)) then pc++ */
OP_TESTLT,/* A C if not (R(A) < R/K(C)) then pc++ */
OP_TESTLE,/* A C if not (R(A) <= R/K(C)) then pc++ */
OP_TESTGT,/* A C if not (R(A) > R/K(C)) then pc++ */
OP_TESTGE,/* A C if not (R(A) >= R/K(C)) then pc++ */
1997-10-06 18:51:11 +04:00
OP_TESTT,/* A B if (R(B)) then R(A) := R(B) else pc++ */
OP_TESTF,/* A B if not (R(B)) then R(A) := R(B) else pc++ */
OP_CALL,/* A B C R(A), ... ,R(A+C-2) := R(A)(R(A+1), ... ,R(A+B-1)) */
2002-01-10 01:02:47 +03:00
OP_RETURN,/* A B return R(A), ... ,R(A+B-2) (see (3)) */
OP_FORLOOP,/* A sBc R(A)+=R(A+2); if R(A) <?= R(A+1) then PC+= sBc */
OP_TFORLOOP,/* A C R(A+1), ... ,R(A+C) := R(A)();
if R(A+1) ~= nil then pc++ */
OP_SETLIST,/* A Bc R(A)[Bc-Bc%FPF+i] := R(A+i), 1 <= i <= Bc%FPF+1 */
OP_SETLISTO,/* A Bc */
1998-01-12 16:35:37 +03:00
OP_CLOSE,/* A close all variables in the stack up to (>=) R(A)*/
2002-01-26 00:50:39 +03:00
OP_CLOSURE/* A Bc R(A) := closure(KPROTO[Bc], R(A), ... ,R(A+n)) */
1997-09-16 23:25:59 +04:00
} OpCode;
2001-08-31 23:46:07 +04:00
#define NUM_OPCODES (cast(int, OP_CLOSURE+1))
1997-09-16 23:25:59 +04:00
/*===========================================================================
Notes:
(1) In OP_CALL, if (B == 0) then B = top. C is the number of returns - 1,
2002-01-10 01:02:47 +03:00
and can be 0: OP_CALL then sets `top' to last_result+1, so
2001-06-11 18:56:42 +04:00
next open instruction (OP_CALL, OP_RETURN, OP_SETLIST) may use `top'.
2000-08-29 18:48:16 +04:00
(2) In OP_RETURN, if (B == 0) then return up to `top'
===========================================================================*/
2000-08-29 18:48:16 +04:00
/*
** masks for instruction properties
*/
enum OpModeMask {
OpModeBreg = 2, /* B is a register */
OpModeCreg, /* C is a register/constant */
OpModesetA, /* instruction set register A */
OpModeK, /* Bc is a constant */
2002-02-06 01:39:12 +03:00
OpModeT, /* operator is a test */
OpModeNoTrace /* operator should not be traced */
};
extern const lu_byte luaP_opmodes[NUM_OPCODES];
2001-08-31 23:46:07 +04:00
#define getOpMode(m) (cast(enum OpMode, luaP_opmodes[m] & 3))
#define testOpMode(m, b) (luaP_opmodes[m] & (1 << (b)))
/*
** opcode names (only included when compiled with LUA_OPNAMES)
*/
extern const char *const luaP_opnames[];
2002-02-15 00:43:01 +03:00
/* number of list items to accumulate before a SETLIST instruction */
/* (must be a power of 2) */
#define LFIELDS_PER_FLUSH 32
1997-09-16 23:25:59 +04:00
#endif