aboutsummaryrefslogtreecommitdiff
path: root/src/3rdParty/lua/ltable.h
diff options
context:
space:
mode:
authorLi Jin <dragon-fly@qq.com>2021-04-21 09:36:25 +0800
committerLi Jin <dragon-fly@qq.com>2021-04-21 09:36:25 +0800
commitb7bdf7d5d36825a1a750a74641f6d374dec5d67a (patch)
tree6b27eb6590e07c07f378305c51d0f5e0779faa83 /src/3rdParty/lua/ltable.h
parentb86e5af605a170a3559df0165eac3cb6b665dc49 (diff)
downloadyuescript-b7bdf7d5d36825a1a750a74641f6d374dec5d67a.tar.gz
yuescript-b7bdf7d5d36825a1a750a74641f6d374dec5d67a.tar.bz2
yuescript-b7bdf7d5d36825a1a750a74641f6d374dec5d67a.zip
adjust some folder levels.
Diffstat (limited to 'src/3rdParty/lua/ltable.h')
-rw-r--r--src/3rdParty/lua/ltable.h66
1 files changed, 66 insertions, 0 deletions
diff --git a/src/3rdParty/lua/ltable.h b/src/3rdParty/lua/ltable.h
new file mode 100644
index 0000000..7bbbcb2
--- /dev/null
+++ b/src/3rdParty/lua/ltable.h
@@ -0,0 +1,66 @@
1/*
2** $Id: ltable.h $
3** Lua tables (hash)
4** See Copyright Notice in lua.h
5*/
6
7#ifndef ltable_h
8#define ltable_h
9
10#include "lobject.h"
11
12
13#define gnode(t,i) (&(t)->node[i])
14#define gval(n) (&(n)->i_val)
15#define gnext(n) ((n)->u.next)
16
17
18/*
19** Clear all bits of fast-access metamethods, which means that the table
20** may have any of these metamethods. (First access that fails after the
21** clearing will set the bit again.)
22*/
23#define invalidateTMcache(t) ((t)->flags &= ~maskflags)
24
25
26/* true when 't' is using 'dummynode' as its hash part */
27#define isdummy(t) ((t)->lastfree == NULL)
28
29
30/* allocated size for hash nodes */
31#define allocsizenode(t) (isdummy(t) ? 0 : sizenode(t))
32
33
34/* returns the Node, given the value of a table entry */
35#define nodefromval(v) cast(Node *, (v))
36
37
38LUAI_FUNC const TValue *luaH_getint (Table *t, lua_Integer key);
39LUAI_FUNC void luaH_setint (lua_State *L, Table *t, lua_Integer key,
40 TValue *value);
41LUAI_FUNC const TValue *luaH_getshortstr (Table *t, TString *key);
42LUAI_FUNC const TValue *luaH_getstr (Table *t, TString *key);
43LUAI_FUNC const TValue *luaH_get (Table *t, const TValue *key);
44LUAI_FUNC void luaH_newkey (lua_State *L, Table *t, const TValue *key,
45 TValue *value);
46LUAI_FUNC void luaH_set (lua_State *L, Table *t, const TValue *key,
47 TValue *value);
48LUAI_FUNC void luaH_finishset (lua_State *L, Table *t, const TValue *key,
49 const TValue *slot, TValue *value);
50LUAI_FUNC Table *luaH_new (lua_State *L);
51LUAI_FUNC void luaH_resize (lua_State *L, Table *t, unsigned int nasize,
52 unsigned int nhsize);
53LUAI_FUNC void luaH_resizearray (lua_State *L, Table *t, unsigned int nasize);
54LUAI_FUNC void luaH_free (lua_State *L, Table *t);
55LUAI_FUNC int luaH_next (lua_State *L, Table *t, StkId key);
56LUAI_FUNC lua_Unsigned luaH_getn (Table *t);
57LUAI_FUNC unsigned int luaH_realasize (const Table *t);
58
59
60#if defined(LUA_DEBUG)
61LUAI_FUNC Node *luaH_mainposition (const Table *t, const TValue *key);
62LUAI_FUNC int luaH_isdummy (const Table *t);
63#endif
64
65
66#endif