hirlite 0.0.2 → 0.0.2.1
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +4 -4
- data/ext/hirlite_ext/extconf.rb +2 -2
- data/lib/hirlite/version.rb +1 -1
- data/vendor/rlite/deps/lua/Makefile +128 -0
- data/vendor/rlite/deps/lua/src/fpconv.c +205 -0
- data/vendor/rlite/deps/lua/src/fpconv.h +22 -0
- data/vendor/rlite/deps/lua/src/lapi.c +1087 -0
- data/vendor/rlite/deps/lua/src/lapi.h +16 -0
- data/vendor/rlite/deps/lua/src/lauxlib.c +652 -0
- data/vendor/rlite/deps/lua/src/lauxlib.h +174 -0
- data/vendor/rlite/deps/lua/src/lbaselib.c +653 -0
- data/vendor/rlite/deps/lua/src/lcode.c +831 -0
- data/vendor/rlite/deps/lua/src/lcode.h +76 -0
- data/vendor/rlite/deps/lua/src/ldblib.c +398 -0
- data/vendor/rlite/deps/lua/src/ldebug.c +638 -0
- data/vendor/rlite/deps/lua/src/ldebug.h +33 -0
- data/vendor/rlite/deps/lua/src/ldo.c +519 -0
- data/vendor/rlite/deps/lua/src/ldo.h +57 -0
- data/vendor/rlite/deps/lua/src/ldump.c +164 -0
- data/vendor/rlite/deps/lua/src/lfunc.c +174 -0
- data/vendor/rlite/deps/lua/src/lfunc.h +34 -0
- data/vendor/rlite/deps/lua/src/lgc.c +710 -0
- data/vendor/rlite/deps/lua/src/lgc.h +110 -0
- data/vendor/rlite/deps/lua/src/linit.c +38 -0
- data/vendor/rlite/deps/lua/src/liolib.c +556 -0
- data/vendor/rlite/deps/lua/src/llex.c +463 -0
- data/vendor/rlite/deps/lua/src/llex.h +81 -0
- data/vendor/rlite/deps/lua/src/llimits.h +128 -0
- data/vendor/rlite/deps/lua/src/lmathlib.c +263 -0
- data/vendor/rlite/deps/lua/src/lmem.c +86 -0
- data/vendor/rlite/deps/lua/src/lmem.h +49 -0
- data/vendor/rlite/deps/lua/src/loadlib.c +666 -0
- data/vendor/rlite/deps/lua/src/lobject.c +214 -0
- data/vendor/rlite/deps/lua/src/lobject.h +381 -0
- data/vendor/rlite/deps/lua/src/lopcodes.c +102 -0
- data/vendor/rlite/deps/lua/src/lopcodes.h +268 -0
- data/vendor/rlite/deps/lua/src/loslib.c +243 -0
- data/vendor/rlite/deps/lua/src/lparser.c +1339 -0
- data/vendor/rlite/deps/lua/src/lparser.h +82 -0
- data/vendor/rlite/deps/lua/src/lstate.c +214 -0
- data/vendor/rlite/deps/lua/src/lstate.h +169 -0
- data/vendor/rlite/deps/lua/src/lstring.c +111 -0
- data/vendor/rlite/deps/lua/src/lstring.h +31 -0
- data/vendor/rlite/deps/lua/src/lstrlib.c +871 -0
- data/vendor/rlite/deps/lua/src/ltable.c +588 -0
- data/vendor/rlite/deps/lua/src/ltable.h +40 -0
- data/vendor/rlite/deps/lua/src/ltablib.c +287 -0
- data/vendor/rlite/deps/lua/src/ltm.c +75 -0
- data/vendor/rlite/deps/lua/src/ltm.h +54 -0
- data/vendor/rlite/deps/lua/src/lua.c +392 -0
- data/vendor/rlite/deps/lua/src/lua.h +388 -0
- data/vendor/rlite/deps/lua/src/lua_bit.c +189 -0
- data/vendor/rlite/deps/lua/src/lua_cjson.c +1427 -0
- data/vendor/rlite/deps/lua/src/lua_cmsgpack.c +957 -0
- data/vendor/rlite/deps/lua/src/lua_struct.c +421 -0
- data/vendor/rlite/deps/lua/src/luac.c +200 -0
- data/vendor/rlite/deps/lua/src/luaconf.h +763 -0
- data/vendor/rlite/deps/lua/src/lualib.h +53 -0
- data/vendor/rlite/deps/lua/src/lundump.c +227 -0
- data/vendor/rlite/deps/lua/src/lundump.h +36 -0
- data/vendor/rlite/deps/lua/src/lvm.c +767 -0
- data/vendor/rlite/deps/lua/src/lvm.h +36 -0
- data/vendor/rlite/deps/lua/src/lzio.c +82 -0
- data/vendor/rlite/deps/lua/src/lzio.h +67 -0
- data/vendor/rlite/deps/lua/src/print.c +227 -0
- data/vendor/rlite/deps/lua/src/strbuf.c +251 -0
- data/vendor/rlite/deps/lua/src/strbuf.h +154 -0
- data/vendor/rlite/src/Makefile +97 -25
- data/vendor/rlite/{deps → src}/crc64.c +0 -0
- data/vendor/rlite/{deps → src}/crc64.h +0 -0
- data/vendor/rlite/src/dump.c +2 -2
- data/vendor/rlite/{deps → src}/endianconv.h +0 -0
- data/vendor/rlite/src/hirlite.c +134 -90
- data/vendor/rlite/src/hirlite.h +34 -1
- data/vendor/rlite/{deps → src}/hyperloglog.c +0 -0
- data/vendor/rlite/{deps → src}/hyperloglog.h +0 -0
- data/vendor/rlite/{deps → src}/lzf.h +0 -0
- data/vendor/rlite/{deps → src}/lzfP.h +0 -0
- data/vendor/rlite/{deps → src}/lzf_c.c +0 -0
- data/vendor/rlite/{deps → src}/lzf_d.c +0 -0
- data/vendor/rlite/src/page_btree.c +10 -10
- data/vendor/rlite/src/page_btree.h +2 -2
- data/vendor/rlite/src/page_list.c +3 -3
- data/vendor/rlite/src/page_list.h +1 -1
- data/vendor/rlite/src/page_multi_string.c +1 -1
- data/vendor/rlite/src/page_skiplist.c +1 -1
- data/vendor/rlite/src/page_skiplist.h +1 -1
- data/vendor/rlite/src/rand.c +93 -0
- data/vendor/rlite/src/rand.h +38 -0
- data/vendor/rlite/src/restore.c +286 -155
- data/vendor/rlite/src/restore.h +6 -0
- data/vendor/rlite/src/rlite.c +30 -30
- data/vendor/rlite/src/rlite.h +1 -1
- data/vendor/rlite/src/scripting.c +1138 -0
- data/vendor/rlite/src/scripting.h +10 -0
- data/vendor/rlite/{deps → src}/sha1.c +0 -0
- data/vendor/rlite/{deps → src}/sha1.h +0 -0
- data/vendor/rlite/src/solarisfixes.h +54 -0
- data/vendor/rlite/src/sort.c +4 -2
- data/vendor/rlite/src/sort.h +1 -1
- data/vendor/rlite/src/type_string.c +1 -1
- data/vendor/rlite/src/util.c +4 -4
- data/vendor/rlite/src/util.h +3 -3
- data/vendor/rlite/{deps → src}/utilfromredis.c +0 -0
- data/vendor/rlite/{deps → src}/utilfromredis.h +0 -0
- metadata +84 -15
@@ -0,0 +1,263 @@
|
|
1
|
+
/*
|
2
|
+
** $Id: lmathlib.c,v 1.67.1.1 2007/12/27 13:02:25 roberto Exp $
|
3
|
+
** Standard mathematical library
|
4
|
+
** See Copyright Notice in lua.h
|
5
|
+
*/
|
6
|
+
|
7
|
+
|
8
|
+
#include <stdlib.h>
|
9
|
+
#include <math.h>
|
10
|
+
|
11
|
+
#define lmathlib_c
|
12
|
+
#define LUA_LIB
|
13
|
+
|
14
|
+
#include "lua.h"
|
15
|
+
|
16
|
+
#include "lauxlib.h"
|
17
|
+
#include "lualib.h"
|
18
|
+
|
19
|
+
|
20
|
+
#undef PI
|
21
|
+
#define PI (3.14159265358979323846)
|
22
|
+
#define RADIANS_PER_DEGREE (PI/180.0)
|
23
|
+
|
24
|
+
|
25
|
+
|
26
|
+
static int math_abs (lua_State *L) {
|
27
|
+
lua_pushnumber(L, fabs(luaL_checknumber(L, 1)));
|
28
|
+
return 1;
|
29
|
+
}
|
30
|
+
|
31
|
+
static int math_sin (lua_State *L) {
|
32
|
+
lua_pushnumber(L, sin(luaL_checknumber(L, 1)));
|
33
|
+
return 1;
|
34
|
+
}
|
35
|
+
|
36
|
+
static int math_sinh (lua_State *L) {
|
37
|
+
lua_pushnumber(L, sinh(luaL_checknumber(L, 1)));
|
38
|
+
return 1;
|
39
|
+
}
|
40
|
+
|
41
|
+
static int math_cos (lua_State *L) {
|
42
|
+
lua_pushnumber(L, cos(luaL_checknumber(L, 1)));
|
43
|
+
return 1;
|
44
|
+
}
|
45
|
+
|
46
|
+
static int math_cosh (lua_State *L) {
|
47
|
+
lua_pushnumber(L, cosh(luaL_checknumber(L, 1)));
|
48
|
+
return 1;
|
49
|
+
}
|
50
|
+
|
51
|
+
static int math_tan (lua_State *L) {
|
52
|
+
lua_pushnumber(L, tan(luaL_checknumber(L, 1)));
|
53
|
+
return 1;
|
54
|
+
}
|
55
|
+
|
56
|
+
static int math_tanh (lua_State *L) {
|
57
|
+
lua_pushnumber(L, tanh(luaL_checknumber(L, 1)));
|
58
|
+
return 1;
|
59
|
+
}
|
60
|
+
|
61
|
+
static int math_asin (lua_State *L) {
|
62
|
+
lua_pushnumber(L, asin(luaL_checknumber(L, 1)));
|
63
|
+
return 1;
|
64
|
+
}
|
65
|
+
|
66
|
+
static int math_acos (lua_State *L) {
|
67
|
+
lua_pushnumber(L, acos(luaL_checknumber(L, 1)));
|
68
|
+
return 1;
|
69
|
+
}
|
70
|
+
|
71
|
+
static int math_atan (lua_State *L) {
|
72
|
+
lua_pushnumber(L, atan(luaL_checknumber(L, 1)));
|
73
|
+
return 1;
|
74
|
+
}
|
75
|
+
|
76
|
+
static int math_atan2 (lua_State *L) {
|
77
|
+
lua_pushnumber(L, atan2(luaL_checknumber(L, 1), luaL_checknumber(L, 2)));
|
78
|
+
return 1;
|
79
|
+
}
|
80
|
+
|
81
|
+
static int math_ceil (lua_State *L) {
|
82
|
+
lua_pushnumber(L, ceil(luaL_checknumber(L, 1)));
|
83
|
+
return 1;
|
84
|
+
}
|
85
|
+
|
86
|
+
static int math_floor (lua_State *L) {
|
87
|
+
lua_pushnumber(L, floor(luaL_checknumber(L, 1)));
|
88
|
+
return 1;
|
89
|
+
}
|
90
|
+
|
91
|
+
static int math_fmod (lua_State *L) {
|
92
|
+
lua_pushnumber(L, fmod(luaL_checknumber(L, 1), luaL_checknumber(L, 2)));
|
93
|
+
return 1;
|
94
|
+
}
|
95
|
+
|
96
|
+
static int math_modf (lua_State *L) {
|
97
|
+
double ip;
|
98
|
+
double fp = modf(luaL_checknumber(L, 1), &ip);
|
99
|
+
lua_pushnumber(L, ip);
|
100
|
+
lua_pushnumber(L, fp);
|
101
|
+
return 2;
|
102
|
+
}
|
103
|
+
|
104
|
+
static int math_sqrt (lua_State *L) {
|
105
|
+
lua_pushnumber(L, sqrt(luaL_checknumber(L, 1)));
|
106
|
+
return 1;
|
107
|
+
}
|
108
|
+
|
109
|
+
static int math_pow (lua_State *L) {
|
110
|
+
lua_pushnumber(L, pow(luaL_checknumber(L, 1), luaL_checknumber(L, 2)));
|
111
|
+
return 1;
|
112
|
+
}
|
113
|
+
|
114
|
+
static int math_log (lua_State *L) {
|
115
|
+
lua_pushnumber(L, log(luaL_checknumber(L, 1)));
|
116
|
+
return 1;
|
117
|
+
}
|
118
|
+
|
119
|
+
static int math_log10 (lua_State *L) {
|
120
|
+
lua_pushnumber(L, log10(luaL_checknumber(L, 1)));
|
121
|
+
return 1;
|
122
|
+
}
|
123
|
+
|
124
|
+
static int math_exp (lua_State *L) {
|
125
|
+
lua_pushnumber(L, exp(luaL_checknumber(L, 1)));
|
126
|
+
return 1;
|
127
|
+
}
|
128
|
+
|
129
|
+
static int math_deg (lua_State *L) {
|
130
|
+
lua_pushnumber(L, luaL_checknumber(L, 1)/RADIANS_PER_DEGREE);
|
131
|
+
return 1;
|
132
|
+
}
|
133
|
+
|
134
|
+
static int math_rad (lua_State *L) {
|
135
|
+
lua_pushnumber(L, luaL_checknumber(L, 1)*RADIANS_PER_DEGREE);
|
136
|
+
return 1;
|
137
|
+
}
|
138
|
+
|
139
|
+
static int math_frexp (lua_State *L) {
|
140
|
+
int e;
|
141
|
+
lua_pushnumber(L, frexp(luaL_checknumber(L, 1), &e));
|
142
|
+
lua_pushinteger(L, e);
|
143
|
+
return 2;
|
144
|
+
}
|
145
|
+
|
146
|
+
static int math_ldexp (lua_State *L) {
|
147
|
+
lua_pushnumber(L, ldexp(luaL_checknumber(L, 1), luaL_checkint(L, 2)));
|
148
|
+
return 1;
|
149
|
+
}
|
150
|
+
|
151
|
+
|
152
|
+
|
153
|
+
static int math_min (lua_State *L) {
|
154
|
+
int n = lua_gettop(L); /* number of arguments */
|
155
|
+
lua_Number dmin = luaL_checknumber(L, 1);
|
156
|
+
int i;
|
157
|
+
for (i=2; i<=n; i++) {
|
158
|
+
lua_Number d = luaL_checknumber(L, i);
|
159
|
+
if (d < dmin)
|
160
|
+
dmin = d;
|
161
|
+
}
|
162
|
+
lua_pushnumber(L, dmin);
|
163
|
+
return 1;
|
164
|
+
}
|
165
|
+
|
166
|
+
|
167
|
+
static int math_max (lua_State *L) {
|
168
|
+
int n = lua_gettop(L); /* number of arguments */
|
169
|
+
lua_Number dmax = luaL_checknumber(L, 1);
|
170
|
+
int i;
|
171
|
+
for (i=2; i<=n; i++) {
|
172
|
+
lua_Number d = luaL_checknumber(L, i);
|
173
|
+
if (d > dmax)
|
174
|
+
dmax = d;
|
175
|
+
}
|
176
|
+
lua_pushnumber(L, dmax);
|
177
|
+
return 1;
|
178
|
+
}
|
179
|
+
|
180
|
+
|
181
|
+
static int math_random (lua_State *L) {
|
182
|
+
/* the `%' avoids the (rare) case of r==1, and is needed also because on
|
183
|
+
some systems (SunOS!) `rand()' may return a value larger than RAND_MAX */
|
184
|
+
lua_Number r = (lua_Number)(rand()%RAND_MAX) / (lua_Number)RAND_MAX;
|
185
|
+
switch (lua_gettop(L)) { /* check number of arguments */
|
186
|
+
case 0: { /* no arguments */
|
187
|
+
lua_pushnumber(L, r); /* Number between 0 and 1 */
|
188
|
+
break;
|
189
|
+
}
|
190
|
+
case 1: { /* only upper limit */
|
191
|
+
int u = luaL_checkint(L, 1);
|
192
|
+
luaL_argcheck(L, 1<=u, 1, "interval is empty");
|
193
|
+
lua_pushnumber(L, floor(r*u)+1); /* int between 1 and `u' */
|
194
|
+
break;
|
195
|
+
}
|
196
|
+
case 2: { /* lower and upper limits */
|
197
|
+
int l = luaL_checkint(L, 1);
|
198
|
+
int u = luaL_checkint(L, 2);
|
199
|
+
luaL_argcheck(L, l<=u, 2, "interval is empty");
|
200
|
+
lua_pushnumber(L, floor(r*(u-l+1))+l); /* int between `l' and `u' */
|
201
|
+
break;
|
202
|
+
}
|
203
|
+
default: return luaL_error(L, "wrong number of arguments");
|
204
|
+
}
|
205
|
+
return 1;
|
206
|
+
}
|
207
|
+
|
208
|
+
|
209
|
+
static int math_randomseed (lua_State *L) {
|
210
|
+
srand(luaL_checkint(L, 1));
|
211
|
+
return 0;
|
212
|
+
}
|
213
|
+
|
214
|
+
|
215
|
+
static const luaL_Reg mathlib[] = {
|
216
|
+
{"abs", math_abs},
|
217
|
+
{"acos", math_acos},
|
218
|
+
{"asin", math_asin},
|
219
|
+
{"atan2", math_atan2},
|
220
|
+
{"atan", math_atan},
|
221
|
+
{"ceil", math_ceil},
|
222
|
+
{"cosh", math_cosh},
|
223
|
+
{"cos", math_cos},
|
224
|
+
{"deg", math_deg},
|
225
|
+
{"exp", math_exp},
|
226
|
+
{"floor", math_floor},
|
227
|
+
{"fmod", math_fmod},
|
228
|
+
{"frexp", math_frexp},
|
229
|
+
{"ldexp", math_ldexp},
|
230
|
+
{"log10", math_log10},
|
231
|
+
{"log", math_log},
|
232
|
+
{"max", math_max},
|
233
|
+
{"min", math_min},
|
234
|
+
{"modf", math_modf},
|
235
|
+
{"pow", math_pow},
|
236
|
+
{"rad", math_rad},
|
237
|
+
{"random", math_random},
|
238
|
+
{"randomseed", math_randomseed},
|
239
|
+
{"sinh", math_sinh},
|
240
|
+
{"sin", math_sin},
|
241
|
+
{"sqrt", math_sqrt},
|
242
|
+
{"tanh", math_tanh},
|
243
|
+
{"tan", math_tan},
|
244
|
+
{NULL, NULL}
|
245
|
+
};
|
246
|
+
|
247
|
+
|
248
|
+
/*
|
249
|
+
** Open math library
|
250
|
+
*/
|
251
|
+
LUALIB_API int luaopen_math (lua_State *L) {
|
252
|
+
luaL_register(L, LUA_MATHLIBNAME, mathlib);
|
253
|
+
lua_pushnumber(L, PI);
|
254
|
+
lua_setfield(L, -2, "pi");
|
255
|
+
lua_pushnumber(L, HUGE_VAL);
|
256
|
+
lua_setfield(L, -2, "huge");
|
257
|
+
#if defined(LUA_COMPAT_MOD)
|
258
|
+
lua_getfield(L, -1, "fmod");
|
259
|
+
lua_setfield(L, -2, "mod");
|
260
|
+
#endif
|
261
|
+
return 1;
|
262
|
+
}
|
263
|
+
|
@@ -0,0 +1,86 @@
|
|
1
|
+
/*
|
2
|
+
** $Id: lmem.c,v 1.70.1.1 2007/12/27 13:02:25 roberto Exp $
|
3
|
+
** Interface to Memory Manager
|
4
|
+
** See Copyright Notice in lua.h
|
5
|
+
*/
|
6
|
+
|
7
|
+
|
8
|
+
#include <stddef.h>
|
9
|
+
|
10
|
+
#define lmem_c
|
11
|
+
#define LUA_CORE
|
12
|
+
|
13
|
+
#include "lua.h"
|
14
|
+
|
15
|
+
#include "ldebug.h"
|
16
|
+
#include "ldo.h"
|
17
|
+
#include "lmem.h"
|
18
|
+
#include "lobject.h"
|
19
|
+
#include "lstate.h"
|
20
|
+
|
21
|
+
|
22
|
+
|
23
|
+
/*
|
24
|
+
** About the realloc function:
|
25
|
+
** void * frealloc (void *ud, void *ptr, size_t osize, size_t nsize);
|
26
|
+
** (`osize' is the old size, `nsize' is the new size)
|
27
|
+
**
|
28
|
+
** Lua ensures that (ptr == NULL) iff (osize == 0).
|
29
|
+
**
|
30
|
+
** * frealloc(ud, NULL, 0, x) creates a new block of size `x'
|
31
|
+
**
|
32
|
+
** * frealloc(ud, p, x, 0) frees the block `p'
|
33
|
+
** (in this specific case, frealloc must return NULL).
|
34
|
+
** particularly, frealloc(ud, NULL, 0, 0) does nothing
|
35
|
+
** (which is equivalent to free(NULL) in ANSI C)
|
36
|
+
**
|
37
|
+
** frealloc returns NULL if it cannot create or reallocate the area
|
38
|
+
** (any reallocation to an equal or smaller size cannot fail!)
|
39
|
+
*/
|
40
|
+
|
41
|
+
|
42
|
+
|
43
|
+
#define MINSIZEARRAY 4
|
44
|
+
|
45
|
+
|
46
|
+
void *luaM_growaux_ (lua_State *L, void *block, int *size, size_t size_elems,
|
47
|
+
int limit, const char *errormsg) {
|
48
|
+
void *newblock;
|
49
|
+
int newsize;
|
50
|
+
if (*size >= limit/2) { /* cannot double it? */
|
51
|
+
if (*size >= limit) /* cannot grow even a little? */
|
52
|
+
luaG_runerror(L, errormsg);
|
53
|
+
newsize = limit; /* still have at least one free place */
|
54
|
+
}
|
55
|
+
else {
|
56
|
+
newsize = (*size)*2;
|
57
|
+
if (newsize < MINSIZEARRAY)
|
58
|
+
newsize = MINSIZEARRAY; /* minimum size */
|
59
|
+
}
|
60
|
+
newblock = luaM_reallocv(L, block, *size, newsize, size_elems);
|
61
|
+
*size = newsize; /* update only when everything else is OK */
|
62
|
+
return newblock;
|
63
|
+
}
|
64
|
+
|
65
|
+
|
66
|
+
void *luaM_toobig (lua_State *L) {
|
67
|
+
luaG_runerror(L, "memory allocation error: block too big");
|
68
|
+
return NULL; /* to avoid warnings */
|
69
|
+
}
|
70
|
+
|
71
|
+
|
72
|
+
|
73
|
+
/*
|
74
|
+
** generic allocation routine.
|
75
|
+
*/
|
76
|
+
void *luaM_realloc_ (lua_State *L, void *block, size_t osize, size_t nsize) {
|
77
|
+
global_State *g = G(L);
|
78
|
+
lua_assert((osize == 0) == (block == NULL));
|
79
|
+
block = (*g->frealloc)(g->ud, block, osize, nsize);
|
80
|
+
if (block == NULL && nsize > 0)
|
81
|
+
luaD_throw(L, LUA_ERRMEM);
|
82
|
+
lua_assert((nsize == 0) == (block == NULL));
|
83
|
+
g->totalbytes = (g->totalbytes - osize) + nsize;
|
84
|
+
return block;
|
85
|
+
}
|
86
|
+
|
@@ -0,0 +1,49 @@
|
|
1
|
+
/*
|
2
|
+
** $Id: lmem.h,v 1.31.1.1 2007/12/27 13:02:25 roberto Exp $
|
3
|
+
** Interface to Memory Manager
|
4
|
+
** See Copyright Notice in lua.h
|
5
|
+
*/
|
6
|
+
|
7
|
+
#ifndef lmem_h
|
8
|
+
#define lmem_h
|
9
|
+
|
10
|
+
|
11
|
+
#include <stddef.h>
|
12
|
+
|
13
|
+
#include "llimits.h"
|
14
|
+
#include "lua.h"
|
15
|
+
|
16
|
+
#define MEMERRMSG "not enough memory"
|
17
|
+
|
18
|
+
|
19
|
+
#define luaM_reallocv(L,b,on,n,e) \
|
20
|
+
((cast(size_t, (n)+1) <= MAX_SIZET/(e)) ? /* +1 to avoid warnings */ \
|
21
|
+
luaM_realloc_(L, (b), (on)*(e), (n)*(e)) : \
|
22
|
+
luaM_toobig(L))
|
23
|
+
|
24
|
+
#define luaM_freemem(L, b, s) luaM_realloc_(L, (b), (s), 0)
|
25
|
+
#define luaM_free(L, b) luaM_realloc_(L, (b), sizeof(*(b)), 0)
|
26
|
+
#define luaM_freearray(L, b, n, t) luaM_reallocv(L, (b), n, 0, sizeof(t))
|
27
|
+
|
28
|
+
#define luaM_malloc(L,t) luaM_realloc_(L, NULL, 0, (t))
|
29
|
+
#define luaM_new(L,t) cast(t *, luaM_malloc(L, sizeof(t)))
|
30
|
+
#define luaM_newvector(L,n,t) \
|
31
|
+
cast(t *, luaM_reallocv(L, NULL, 0, n, sizeof(t)))
|
32
|
+
|
33
|
+
#define luaM_growvector(L,v,nelems,size,t,limit,e) \
|
34
|
+
if ((nelems)+1 > (size)) \
|
35
|
+
((v)=cast(t *, luaM_growaux_(L,v,&(size),sizeof(t),limit,e)))
|
36
|
+
|
37
|
+
#define luaM_reallocvector(L, v,oldn,n,t) \
|
38
|
+
((v)=cast(t *, luaM_reallocv(L, v, oldn, n, sizeof(t))))
|
39
|
+
|
40
|
+
|
41
|
+
LUAI_FUNC void *luaM_realloc_ (lua_State *L, void *block, size_t oldsize,
|
42
|
+
size_t size);
|
43
|
+
LUAI_FUNC void *luaM_toobig (lua_State *L);
|
44
|
+
LUAI_FUNC void *luaM_growaux_ (lua_State *L, void *block, int *size,
|
45
|
+
size_t size_elem, int limit,
|
46
|
+
const char *errormsg);
|
47
|
+
|
48
|
+
#endif
|
49
|
+
|