1
0
mirror of https://github.com/lua/lua.git synced 2025-01-28 06:03:00 +08:00
lua/ltable.h

118 lines
3.7 KiB
C
Raw Normal View History

1997-09-16 16:25:59 -03:00
/*
** $Id: ltable.h $
1997-09-16 16:25:59 -03:00
** Lua tables (hash)
** See Copyright Notice in lua.h
*/
#ifndef ltable_h
#define ltable_h
#include "lobject.h"
#define gnode(t,i) (&(t)->node[i])
#define gval(n) (&(n)->i_val)
#define gnext(n) ((n)->u.next)
/*
** Clear all bits of fast-access metamethods, which means that the table
** may have any of these metamethods. (First access that fails after the
** clearing will set the bit again.)
*/
#define invalidateTMcache(t) ((t)->flags &= ~maskflags)
/* true when 't' is using 'dummynode' as its hash part */
#define isdummy(t) ((t)->lastfree == NULL)
/* allocated size for hash nodes */
#define allocsizenode(t) (isdummy(t) ? 0 : sizenode(t))
/* returns the Node, given the value of a table entry */
#define nodefromval(v) cast(Node *, (v))
2023-05-16 16:53:29 -03:00
/* results from get/pset */
#define HOK 0
#define HNOTFOUND 1
#define HNOTATABLE 2
2023-05-16 14:55:49 -03:00
#define HFIRSTNODE 3
2023-05-16 16:53:29 -03:00
/*
** Besides these values, pset (pre-set) operations may also return an
** encoding of where the value should go (usually called 'hres'). That
** means that there is a slot with that key but with no value. (pset
** cannot set that value because there might be a metamethod.) If the
** slot is in the hash part, the encoding is (HFIRSTNODE + hash index);
** if the slot is in the array part, the encoding is (~array index).
*/
struct ArrayCell {
lu_byte tt;
Value value;
};
/* fast access to components of array values */
#define getArrTag(t,k) (&(t)->array[k - 1].tt)
#define getArrVal(t,k) (&(t)->array[k - 1].value)
#define tagisempty(tag) (novariant(tag) == LUA_TNIL)
#define farr2val(h,k,tag,res) \
((res)->tt_ = tag, (res)->value_ = *getArrVal(h,k))
#define fval2arr(h,k,tag,val) \
2023-05-16 14:55:49 -03:00
(*tag = (val)->tt_, *getArrVal(h,k) = (val)->value_)
#define obj2arr(h,k,val) \
(*getArrTag(h,k) = (val)->tt_, *getArrVal(h,k) = (val)->value_)
#define arr2obj(h,k,val) \
((val)->tt_ = *getArrTag(h,k), (val)->value_ = *getArrVal(h,k))
2023-05-16 16:53:29 -03:00
LUAI_FUNC int luaH_getshortstr (Table *t, TString *key, TValue *res);
LUAI_FUNC int luaH_getstr (Table *t, TString *key, TValue *res);
LUAI_FUNC int luaH_get (Table *t, const TValue *key, TValue *res);
LUAI_FUNC int luaH_getint (Table *t, lua_Integer key, TValue *res);
LUAI_FUNC TString *luaH_getstrkey (Table *t, TString *key);
2023-05-16 16:53:29 -03:00
LUAI_FUNC int luaH_psetint (Table *t, lua_Integer key, TValue *val);
LUAI_FUNC int luaH_psetshortstr (Table *t, TString *key, TValue *val);
LUAI_FUNC int luaH_psetstr (Table *t, TString *key, TValue *val);
LUAI_FUNC int luaH_pset (Table *t, const TValue *key, TValue *val);
2023-05-16 14:55:49 -03:00
LUAI_FUNC void luaH_setint (lua_State *L, Table *t, lua_Integer key,
TValue *value);
2023-05-16 16:53:29 -03:00
LUAI_FUNC const TValue *luaH_Hgetshortstr (Table *t, TString *key);
LUAI_FUNC void luaH_newkey (lua_State *L, Table *t, const TValue *key,
TValue *value);
LUAI_FUNC void luaH_set (lua_State *L, Table *t, const TValue *key,
TValue *value);
LUAI_FUNC void luaH_finishset (lua_State *L, Table *t, const TValue *key,
2023-05-16 14:55:49 -03:00
TValue *value, int aux);
LUAI_FUNC Table *luaH_new (lua_State *L);
LUAI_FUNC void luaH_resize (lua_State *L, Table *t, unsigned int nasize,
unsigned int nhsize);
LUAI_FUNC void luaH_resizearray (lua_State *L, Table *t, unsigned int nasize);
LUAI_FUNC void luaH_free (lua_State *L, Table *t);
LUAI_FUNC int luaH_next (lua_State *L, Table *t, StkId key);
LUAI_FUNC lua_Unsigned luaH_getn (Table *t);
LUAI_FUNC unsigned int luaH_realasize (const Table *t);
2006-01-10 10:51:53 -02:00
2006-01-10 11:13:06 -02:00
#if defined(LUA_DEBUG)
LUAI_FUNC Node *luaH_mainposition (const Table *t, const TValue *key);
#endif
2006-01-10 10:51:53 -02:00
1997-09-16 16:25:59 -03:00
#endif