lua/lobject.h

267 lines
5.6 KiB
C
Raw Normal View History

1997-09-16 23:25:59 +04:00
/*
2001-12-05 23:15:18 +03:00
** $Id: lobject.h,v 1.1 2001/11/29 22:14:34 rieru Exp rieru $
1997-09-16 23:25:59 +04:00
** Type definitions for Lua objects
** See Copyright Notice in lua.h
*/
#ifndef lobject_h
#define lobject_h
2000-03-24 22:49:23 +03:00
#include "llimits.h"
1997-12-26 21:38:16 +03:00
#include "lua.h"
1997-12-23 22:24:19 +03:00
#ifndef lua_assert
#define lua_assert(c) /* empty */
1998-03-10 00:49:52 +03:00
#endif
#ifndef UNUSED
2000-03-31 20:28:45 +04:00
#define UNUSED(x) ((void)(x)) /* to avoid warnings */
#endif
1997-09-16 23:25:59 +04:00
2001-08-31 23:46:07 +04:00
#ifndef cast
#define cast(t, exp) ((t)(exp))
#endif
1997-09-16 23:25:59 +04:00
/* tags for values visible from Lua */
2000-10-05 16:14:08 +04:00
#define NUM_TAGS 6
typedef union {
union TString *ts;
union Udata *u;
2001-10-02 20:45:03 +04:00
union Closure *cl;
2001-10-25 23:14:14 +04:00
struct Table *h;
struct lua_TObject *v;
2001-12-12 01:48:44 +03:00
lua_Number n;
int b;
} Value;
1997-09-16 23:25:59 +04:00
typedef struct lua_TObject {
int tt;
Value value;
} TObject;
/* Macros to access values */
#define ttype(o) ((o)->tt)
#define nvalue(o) ((o)->value.n)
#define tsvalue(o) ((o)->value.ts)
#define uvalue(o) ((o)->value.u)
#define clvalue(o) ((o)->value.cl)
#define hvalue(o) ((o)->value.h)
#define vvalue(o) ((o)->value.v)
2001-12-12 01:48:44 +03:00
#define bvalue(o) ((o)->value.b)
2001-12-12 01:48:44 +03:00
#define l_isfalse(o) (ttype(o) == LUA_TNIL || \
(ttype(o) == LUA_TBOOLEAN && bvalue(o) == 0))
/* Macros to set values */
#define setnvalue(obj,x) \
{ TObject *_o=(obj); _o->tt=LUA_TNUMBER; _o->value.n=(x); }
2001-06-28 18:48:44 +04:00
#define chgnvalue(obj,x) ((obj)->value.n=(x))
2001-12-12 01:48:44 +03:00
#define setbvalue(obj,x) \
{ TObject *_o=(obj); _o->tt=LUA_TBOOLEAN; _o->value.b=(x); }
#define setsvalue(obj,x) \
{ TObject *_o=(obj); _o->tt=LUA_TSTRING; _o->value.ts=(x); }
#define setuvalue(obj,x) \
{ TObject *_o=(obj); _o->tt=LUA_TUSERDATA; _o->value.u=(x); }
#define setclvalue(obj,x) \
{ TObject *_o=(obj); _o->tt=LUA_TFUNCTION; _o->value.cl=(x); }
#define sethvalue(obj,x) \
{ TObject *_o=(obj); _o->tt=LUA_TTABLE; _o->value.h=(x); }
#define setnilvalue(obj) ((obj)->tt=LUA_TNIL)
#define setupvalue(obj,x,t) \
{ TObject *_o=(obj); _o->tt=(t); _o->value.v=(x); }
#define setobj(obj1,obj2) \
{ TObject *o1=(obj1); const TObject *o2=(obj2); \
o1->tt=o2->tt; o1->value = o2->value; }
#define setttype(obj, tt) (ttype(obj) = (tt))
1997-09-16 23:25:59 +04:00
typedef TObject *StkId; /* index to stack elements */
1997-09-16 23:25:59 +04:00
/*
** String headers for string table
*/
typedef union TString {
union L_Umaxalign dummy; /* ensures maximum alignment for strings */
struct {
lu_hash hash;
size_t len;
int marked;
union TString *nexthash; /* chain for hash table */
} tsv;
} TString;
#define getstr(ts) cast(char *, (ts) + 1)
#define svalue(o) getstr(tsvalue(o))
typedef union Udata {
union L_Umaxalign dummy; /* ensures maximum alignment for `local' udata */
struct {
2001-12-05 23:15:18 +03:00
struct Table *eventtable;
void *value;
2001-12-05 23:15:18 +03:00
size_t len; /* least bit reserved for gc mark */
union Udata *next; /* chain for list of all udata */
} uv;
} Udata;
1997-09-16 23:25:59 +04:00
/*
** Function Prototypes
*/
2000-03-10 21:37:44 +03:00
typedef struct Proto {
TObject *k; /* constants used by the function */
int sizek; /* size of `k' */
2001-06-28 18:57:17 +04:00
struct Proto **p; /* functions defined inside the function */
int sizep; /* size of `p' */
Instruction *code;
int sizecode;
2001-02-20 21:28:11 +03:00
short nupvalues;
short numparams;
short is_vararg;
short maxstacksize;
short marked;
struct Proto *next;
2000-08-21 18:34:43 +04:00
/* debug information */
2000-08-08 22:26:05 +04:00
int *lineinfo; /* map from opcodes to source lines */
int sizelineinfo; /* size of `lineinfo' */
struct LocVar *locvars; /* information about local variables */
int sizelocvars;
1997-09-16 23:25:59 +04:00
int lineDefined;
2000-03-10 21:37:44 +03:00
TString *source;
} Proto;
1997-09-16 23:25:59 +04:00
1997-09-16 23:25:59 +04:00
typedef struct LocVar {
TString *varname;
int startpc; /* first point where variable is active */
int endpc; /* first point where variable is dead */
1997-09-16 23:25:59 +04:00
} LocVar;
/*
** Upvalues
*/
typedef struct UpVal {
TObject *v; /* points to stack or to its own value */
struct UpVal *next;
TObject value; /* the value (when closed) */
} UpVal;
1997-09-16 23:25:59 +04:00
/*
** Closures
*/
2001-10-02 20:45:03 +04:00
typedef struct CClosure {
lu_byte isC; /* 0 for Lua functions, 1 for C functions */
lu_byte nupvalues;
lu_byte marked;
union Closure *next;
lua_CFunction f;
TObject upvalue[1];
} CClosure;
typedef struct LClosure {
lu_byte isC;
lu_byte nupvalues;
lu_byte marked;
union Closure *next; /* first four fields must be equal to CClosure!! */
struct Proto *p;
UpVal *upvals[1];
2001-10-02 20:45:03 +04:00
} LClosure;
2001-10-02 20:45:03 +04:00
typedef union Closure {
CClosure c;
LClosure l;
1997-09-16 23:25:59 +04:00
} Closure;
2001-10-02 20:45:03 +04:00
#define iscfunction(o) (ttype(o) == LUA_TFUNCTION && clvalue(o)->c.isC)
2000-10-05 16:14:08 +04:00
/*
2001-10-25 23:14:14 +04:00
** Tables
*/
2000-03-10 21:37:44 +03:00
typedef struct Node {
TObject _key;
TObject _val;
2002-01-10 00:50:35 +03:00
struct Node *next; /* for chaining */
1997-09-16 23:25:59 +04:00
} Node;
2001-10-25 23:14:14 +04:00
typedef struct Table {
2001-12-05 23:15:18 +03:00
struct Table *eventtable;
2001-10-25 23:14:14 +04:00
TObject *array; /* array part */
1999-10-14 23:13:31 +04:00
Node *node;
2001-10-25 23:14:14 +04:00
int sizearray; /* size of `array' array */
lu_byte lsizenode; /* log2 of size of `node' array */
2001-12-05 23:15:18 +03:00
unsigned short flags; /* 1<<p means tagmethod(p) is not present */
1999-10-14 23:13:31 +04:00
Node *firstfree; /* this position is free; all positions after it are full */
2001-10-25 23:14:14 +04:00
struct Table *next;
struct Table *mark; /* marked tables (point to itself when not marked) */
} Table;
1997-09-16 23:25:59 +04:00
2001-10-02 20:45:03 +04:00
/* unmarked tables are represented by pointing `mark' to themselves */
#define ismarked(x) ((x)->mark != (x))
2001-01-26 18:58:50 +03:00
/*
2001-02-23 20:17:25 +03:00
** `module' operation for hashing (size is always a power of 2)
2001-02-20 21:15:33 +03:00
*/
2001-08-31 23:46:07 +04:00
#define lmod(s,size) (cast(int, (s) & ((size)-1)))
2001-01-26 18:58:50 +03:00
2001-10-25 23:14:14 +04:00
#define twoto(x) (1<<(x))
#define sizenode(t) (twoto((t)->lsizenode))
#define sizearray(t) ((t)->sizearray)
2000-06-26 23:28:31 +04:00
2000-03-03 17:58:26 +03:00
extern const TObject luaO_nilobject;
1997-09-16 23:25:59 +04:00
2001-10-25 23:14:14 +04:00
int luaO_log2 (unsigned int x);
1998-07-12 20:11:55 +04:00
2001-08-31 23:46:07 +04:00
#define luaO_openspace(L,n,t) cast(t *, luaO_openspaceaux(L,(n)*sizeof(t)))
void *luaO_openspaceaux (lua_State *L, size_t n);
1998-07-12 20:11:55 +04:00
2000-04-25 20:55:09 +04:00
int luaO_equalObj (const TObject *t1, const TObject *t2);
int luaO_str2d (const char *s, lua_Number *result);
1997-09-16 23:25:59 +04:00
void luaO_verror (lua_State *L, const char *fmt, ...);
void luaO_chunkid (char *out, const char *source, int len);
1997-09-16 23:25:59 +04:00
#endif