1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
|
/*
** Lua tables (hash)
** See Copyright Notice in lua.h
*/
#define FORBIDDEN_SYMBOL_EXCEPTION_setjmp
#define FORBIDDEN_SYMBOL_EXCEPTION_longjmp
#include "engines/grim/lua/lauxlib.h"
#include "engines/grim/lua/lmem.h"
#include "engines/grim/lua/lobject.h"
#include "engines/grim/lua/lstate.h"
#include "engines/grim/lua/ltable.h"
#include "engines/grim/lua/lua.h"
namespace Grim {
#define gcsize(n) (1 + (n / 16))
#define nuse(t) ((t)->nuse)
#define nodevector(t) ((t)->node)
#define REHASH_LIMIT 0.70 // avoid more than this % full
#define TagDefault LUA_T_ARRAY;
static intptr hashindex(TObject *ref) {
intptr h;
switch (ttype(ref)) {
case LUA_T_NUMBER:
h = (intptr)nvalue(ref);
break;
case LUA_T_USERDATA:
h = (intptr)ref->value.ud.id;
break;
case LUA_T_STRING:
h = (intptr)tsvalue(ref);
break;
case LUA_T_ARRAY:
h = (intptr)avalue(ref);
break;
case LUA_T_PROTO:
h = (intptr)tfvalue(ref);
break;
case LUA_T_CPROTO:
h = (intptr)fvalue(ref);
break;
case LUA_T_CLOSURE:
h = (intptr)clvalue(ref);
break;
case LUA_T_TASK:
h = (intptr)nvalue(ref);
break;
default:
lua_error("unexpected type to index table");
h = 0; // to avoid warnings
}
return (h >= 0 ? h : -(h + 1));
}
int32 present(Hash *t, TObject *key) {
int32 tsize = nhash(t);
intptr h = hashindex(key);
int32 h1 = int32(h % tsize);
TObject *rf = ref(node(t, h1));
if (ttype(rf) != LUA_T_NIL && !luaO_equalObj(key, rf)) {
int32 h2 = int32(h % (tsize - 2) + 1);
do {
h1 += h2;
if (h1 >= tsize)
h1 -= tsize;
rf = ref(node(t, h1));
} while (ttype(rf) != LUA_T_NIL && !luaO_equalObj(key, rf));
}
return h1;
}
/*
** Alloc a vector node
*/
Node *hashnodecreate(int32 nhash) {
Node *v = luaM_newvector(nhash, Node);
int32 i;
for (i = 0; i < nhash; i++)
ttype(ref(&v[i])) = LUA_T_NIL;
return v;
}
/*
** Delete a hash
*/
static void hashdelete(Hash *t) {
luaM_free(nodevector(t));
luaM_free(t);
}
void luaH_free(Hash *frees) {
while (frees) {
Hash *next = (Hash *)frees->head.next;
nblocks -= gcsize(frees->nhash);
hashdelete(frees);
frees = next;
}
}
Hash *luaH_new(int32 nhash) {
Hash *t = luaM_new(Hash);
nhash = luaO_redimension((int32)((float)nhash / REHASH_LIMIT));
nodevector(t) = hashnodecreate(nhash);
nhash(t) = nhash;
nuse(t) = 0;
t->htag = TagDefault;
luaO_insertlist(&roottable, (GCnode *)t);
nblocks += gcsize(nhash);
return t;
}
/*
** Rehash:
** Check if table has deleted slots. It it has, it does not need to
** grow, since rehash will reuse them.
*/
static int emptyslots(Hash *t) {
int i;
for (i = nhash(t) - 1; i >= 0; i--) {
Node *n = node(t, i);
if (ttype(ref(n)) != LUA_T_NIL && ttype(val(n)) == LUA_T_NIL)
return 1;
}
return 0;
}
static void rehash(Hash *t) {
int32 nold = nhash(t);
Node *vold = nodevector(t);
int32 i;
if (!emptyslots(t))
nhash(t) = luaO_redimension(nhash(t));
nodevector(t) = hashnodecreate(nhash(t));
for (i = 0; i < nold; i++) {
Node *n = vold + i;
if (ttype(ref(n)) != LUA_T_NIL && ttype(val(n)) != LUA_T_NIL)
*node(t, present(t, ref(n))) = *n; // copy old node to luaM_new hash
}
nblocks += gcsize(t->nhash) - gcsize(nold);
luaM_free(vold);
}
/*
** If the hash node is present, return its pointer, otherwise return
** null.
*/
TObject *luaH_get(Hash *t, TObject *r) {
int32 h = present(t, r);
if (ttype(ref(node(t, h))) != LUA_T_NIL)
return val(node(t, h));
else
return nullptr;
}
/*
** If the hash node is present, return its pointer, otherwise create a luaM_new
** node for the given reference and also return its pointer.
*/
TObject *luaH_set(Hash *t, TObject *r) {
Node *n = node(t, present(t, r));
if (ttype(ref(n)) == LUA_T_NIL) {
nuse(t)++;
if ((float)nuse(t) > (float)nhash(t) * REHASH_LIMIT) {
rehash(t);
n = node(t, present(t, r));
}
*ref(n) = *r;
ttype(val(n)) = LUA_T_NIL;
}
return (val(n));
}
static Node *hashnext(Hash *t, int32 i) {
Node *n;
int32 tsize = nhash(t);
if (i >= tsize)
return nullptr;
n = node(t, i);
while (ttype(ref(n)) == LUA_T_NIL || ttype(val(n)) == LUA_T_NIL) {
if (++i >= tsize)
return nullptr;
n = node(t, i);
}
return node(t, i);
}
Node *luaH_next(TObject *o, TObject *r) {
Hash *t = avalue(o);
if (ttype(r) == LUA_T_NIL)
return hashnext(t, 0);
else {
int32 i = present(t, r);
Node *n = node(t, i);
luaL_arg_check(ttype(ref(n)) != LUA_T_NIL && ttype(val(n)) != LUA_T_NIL, 2, "key not found");
return hashnext(t, i + 1);
}
}
} // end of namespace Grim
|
