mirror of
https://github.com/lua/lua
synced 2024-11-22 04:41:23 +03:00
8047b2d03e
Only tables with some minimum number of entries in their hash part have a 'lastfree' field, kept in a header before the node vector.
76 lines
2.3 KiB
C
76 lines
2.3 KiB
C
/*
|
|
** $Id: ltable.h $
|
|
** 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)
|
|
|
|
|
|
/*
|
|
** Bit BITDUMMY set in 'flags' means the table is using the dummy node
|
|
** for its hash part.
|
|
*/
|
|
|
|
#define BITDUMMY (1 << 6)
|
|
#define NOTBITDUMMY cast_byte(~BITDUMMY)
|
|
#define isdummy(t) ((t)->flags & BITDUMMY)
|
|
|
|
#define setnodummy(t) ((t)->flags &= NOTBITDUMMY)
|
|
#define setdummy(t) ((t)->flags |= BITDUMMY)
|
|
|
|
|
|
|
|
/* 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))
|
|
|
|
|
|
LUAI_FUNC const TValue *luaH_getint (Table *t, lua_Integer key);
|
|
LUAI_FUNC void luaH_setint (lua_State *L, Table *t, lua_Integer key,
|
|
TValue *value);
|
|
LUAI_FUNC const TValue *luaH_getshortstr (Table *t, TString *key);
|
|
LUAI_FUNC const TValue *luaH_getstr (Table *t, TString *key);
|
|
LUAI_FUNC const TValue *luaH_get (Table *t, const TValue *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,
|
|
const TValue *slot, TValue *value);
|
|
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);
|
|
|
|
|
|
#if defined(LUA_DEBUG)
|
|
LUAI_FUNC Node *luaH_mainposition (const Table *t, const TValue *key);
|
|
#endif
|
|
|
|
|
|
#endif
|