/src/testdir/build/lua-master/source/lauxlib.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* |
2 | | ** $Id: lauxlib.c $ |
3 | | ** Auxiliary functions for building Lua libraries |
4 | | ** See Copyright Notice in lua.h |
5 | | */ |
6 | | |
7 | | #define lauxlib_c |
8 | | #define LUA_LIB |
9 | | |
10 | | #include "lprefix.h" |
11 | | |
12 | | |
13 | | #include <errno.h> |
14 | | #include <stdarg.h> |
15 | | #include <stdio.h> |
16 | | #include <stdlib.h> |
17 | | #include <string.h> |
18 | | |
19 | | |
20 | | /* |
21 | | ** This file uses only the official API of Lua. |
22 | | ** Any function declared here could be written as an application function. |
23 | | */ |
24 | | |
25 | | #include "lua.h" |
26 | | |
27 | | #include "lauxlib.h" |
28 | | #include "llimits.h" |
29 | | |
30 | | |
31 | | /* |
32 | | ** {====================================================== |
33 | | ** Traceback |
34 | | ** ======================================================= |
35 | | */ |
36 | | |
37 | | |
38 | 139k | #define LEVELS1 10 /* size of the first part of the stack */ |
39 | 139k | #define LEVELS2 11 /* size of the second part of the stack */ |
40 | | |
41 | | |
42 | | |
43 | | /* |
44 | | ** Search for 'objidx' in table at index -1. ('objidx' must be an |
45 | | ** absolute index.) Return 1 + string at top if it found a good name. |
46 | | */ |
47 | 199M | static int findfield (lua_State *L, int objidx, int level) { |
48 | 199M | if (level == 0 || !lua_istable(L, -1)) |
49 | 184M | return 0; /* not found */ |
50 | 14.9M | lua_pushnil(L); /* start 'next' loop */ |
51 | 317M | while (lua_next(L, -2)) { /* for each pair in table */ |
52 | 306M | if (lua_type(L, -2) == LUA_TSTRING) { /* ignore non-string keys */ |
53 | 199M | if (lua_rawequal(L, objidx, -1)) { /* found object? */ |
54 | 1.82M | lua_pop(L, 1); /* remove value (but keep name) */ |
55 | 1.82M | return 1; |
56 | 1.82M | } |
57 | 197M | else if (findfield(L, objidx, level - 1)) { /* try recursively */ |
58 | | /* stack: lib_name, lib_table, field_name (top) */ |
59 | 1.82M | lua_pushliteral(L, "."); /* place '.' between the two names */ |
60 | 1.82M | lua_replace(L, -3); /* (in the slot occupied by table) */ |
61 | 1.82M | lua_concat(L, 3); /* lib_name.field_name */ |
62 | 1.82M | return 1; |
63 | 1.82M | } |
64 | 199M | } |
65 | 302M | lua_pop(L, 1); /* remove value */ |
66 | 302M | } |
67 | 11.2M | return 0; /* not found */ |
68 | 14.9M | } |
69 | | |
70 | | |
71 | | /* |
72 | | ** Search for a name for a function in all loaded modules |
73 | | */ |
74 | 2.11M | static int pushglobalfuncname (lua_State *L, lua_Debug *ar) { |
75 | 2.11M | int top = lua_gettop(L); |
76 | 2.11M | lua_getinfo(L, "f", ar); /* push function */ |
77 | 2.11M | lua_getfield(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); |
78 | 2.11M | luaL_checkstack(L, 6, "not enough stack"); /* slots for 'findfield' */ |
79 | 2.11M | if (findfield(L, top + 1, 2)) { |
80 | 1.82M | const char *name = lua_tostring(L, -1); |
81 | 1.82M | if (strncmp(name, LUA_GNAME ".", 3) == 0) { /* name start with '_G.'? */ |
82 | 1.80M | lua_pushstring(L, name + 3); /* push name without prefix */ |
83 | 1.80M | lua_remove(L, -2); /* remove original name */ |
84 | 1.80M | } |
85 | 1.82M | lua_copy(L, -1, top + 1); /* copy name to proper place */ |
86 | 1.82M | lua_settop(L, top + 1); /* remove table "loaded" and name copy */ |
87 | 1.82M | return 1; |
88 | 1.82M | } |
89 | 286k | else { |
90 | 286k | lua_settop(L, top); /* remove function and global table */ |
91 | 286k | return 0; |
92 | 286k | } |
93 | 2.11M | } |
94 | | |
95 | | |
96 | 870k | static void pushfuncname (lua_State *L, lua_Debug *ar) { |
97 | 870k | if (*ar->namewhat != '\0') /* is there a name from code? */ |
98 | 505k | lua_pushfstring(L, "%s '%s'", ar->namewhat, ar->name); /* use it */ |
99 | 364k | else if (*ar->what == 'm') /* main? */ |
100 | 112k | lua_pushliteral(L, "main chunk"); |
101 | 252k | else if (pushglobalfuncname(L, ar)) { /* try a global name */ |
102 | 667 | lua_pushfstring(L, "function '%s'", lua_tostring(L, -1)); |
103 | 667 | lua_remove(L, -2); /* remove name */ |
104 | 667 | } |
105 | 251k | else if (*ar->what != 'C') /* for Lua functions, use <file:line> */ |
106 | 251k | lua_pushfstring(L, "function <%s:%d>", ar->short_src, ar->linedefined); |
107 | 254 | else /* nothing left... */ |
108 | 254 | lua_pushliteral(L, "?"); |
109 | 870k | } |
110 | | |
111 | | |
112 | 112k | static int lastlevel (lua_State *L) { |
113 | 112k | lua_Debug ar; |
114 | 112k | int li = 1, le = 1; |
115 | | /* find an upper bound */ |
116 | 460k | while (lua_getstack(L, le, &ar)) { li = le; le *= 2; } |
117 | | /* do a binary search */ |
118 | 415k | while (li < le) { |
119 | 302k | int m = (li + le)/2; |
120 | 302k | if (lua_getstack(L, m, &ar)) li = m + 1; |
121 | 112k | else le = m; |
122 | 302k | } |
123 | 112k | return le - 1; |
124 | 112k | } |
125 | | |
126 | | |
127 | | LUALIB_API void luaL_traceback (lua_State *L, lua_State *L1, |
128 | 112k | const char *msg, int level) { |
129 | 112k | luaL_Buffer b; |
130 | 112k | lua_Debug ar; |
131 | 112k | int last = lastlevel(L1); |
132 | 112k | int limit2show = (last - level > LEVELS1 + LEVELS2) ? LEVELS1 : -1; |
133 | 112k | luaL_buffinit(L, &b); |
134 | 112k | if (msg) { |
135 | 112k | luaL_addstring(&b, msg); |
136 | 112k | luaL_addchar(&b, '\n'); |
137 | 112k | } |
138 | 112k | luaL_addstring(&b, "stack traceback:"); |
139 | 1.00M | while (lua_getstack(L1, level++, &ar)) { |
140 | 897k | if (limit2show-- == 0) { /* too many levels? */ |
141 | 26.8k | int n = last - level - LEVELS2 + 1; /* number of levels to skip */ |
142 | 26.8k | lua_pushfstring(L, "\n\t...\t(skipping %d levels)", n); |
143 | 26.8k | luaL_addvalue(&b); /* add warning about skip */ |
144 | 26.8k | level += n; /* and skip to last levels */ |
145 | 26.8k | } |
146 | 870k | else { |
147 | 870k | lua_getinfo(L1, "Slnt", &ar); |
148 | 870k | if (ar.currentline <= 0) |
149 | 176k | lua_pushfstring(L, "\n\t%s: in ", ar.short_src); |
150 | 693k | else |
151 | 693k | lua_pushfstring(L, "\n\t%s:%d: in ", ar.short_src, ar.currentline); |
152 | 870k | luaL_addvalue(&b); |
153 | 870k | pushfuncname(L, &ar); |
154 | 870k | luaL_addvalue(&b); |
155 | 870k | if (ar.istailcall) |
156 | 90.7k | luaL_addstring(&b, "\n\t(...tail calls...)"); |
157 | 870k | } |
158 | 897k | } |
159 | 112k | luaL_pushresult(&b); |
160 | 112k | } |
161 | | |
162 | | /* }====================================================== */ |
163 | | |
164 | | |
165 | | /* |
166 | | ** {====================================================== |
167 | | ** Error-report functions |
168 | | ** ======================================================= |
169 | | */ |
170 | | |
171 | 2.05M | LUALIB_API int luaL_argerror (lua_State *L, int arg, const char *extramsg) { |
172 | 2.05M | lua_Debug ar; |
173 | 2.05M | const char *argword; |
174 | 2.05M | if (!lua_getstack(L, 0, &ar)) /* no stack frame? */ |
175 | 0 | return luaL_error(L, "bad argument #%d (%s)", arg, extramsg); |
176 | 2.05M | lua_getinfo(L, "nt", &ar); |
177 | 2.05M | if (arg <= ar.extraargs) /* error in an extra argument? */ |
178 | 0 | argword = "extra argument"; |
179 | 2.05M | else { |
180 | 2.05M | arg -= ar.extraargs; /* do not count extra arguments */ |
181 | 2.05M | if (strcmp(ar.namewhat, "method") == 0) { /* colon syntax? */ |
182 | 63.3k | arg--; /* do not count (extra) self argument */ |
183 | 63.3k | if (arg == 0) /* error in self argument? */ |
184 | 1.79k | return luaL_error(L, "calling '%s' on bad self (%s)", |
185 | 1.79k | ar.name, extramsg); |
186 | | /* else go through; error in a regular argument */ |
187 | 63.3k | } |
188 | 2.05M | argword = "argument"; |
189 | 2.05M | } |
190 | 2.05M | if (ar.name == NULL) |
191 | 1.85M | ar.name = (pushglobalfuncname(L, &ar)) ? lua_tostring(L, -1) : "?"; |
192 | 2.05M | return luaL_error(L, "bad %s #%d to '%s' (%s)", |
193 | 2.05M | argword, arg, ar.name, extramsg); |
194 | 2.05M | } |
195 | | |
196 | | |
197 | 1.69M | LUALIB_API int luaL_typeerror (lua_State *L, int arg, const char *tname) { |
198 | 1.69M | const char *msg; |
199 | 1.69M | const char *typearg; /* name for the type of the actual argument */ |
200 | 1.69M | if (luaL_getmetafield(L, arg, "__name") == LUA_TSTRING) |
201 | 370 | typearg = lua_tostring(L, -1); /* use the given type name */ |
202 | 1.69M | else if (lua_type(L, arg) == LUA_TLIGHTUSERDATA) |
203 | 0 | typearg = "light userdata"; /* special name for messages */ |
204 | 1.69M | else |
205 | 1.69M | typearg = luaL_typename(L, arg); /* standard name */ |
206 | 1.69M | msg = lua_pushfstring(L, "%s expected, got %s", tname, typearg); |
207 | 1.69M | return luaL_argerror(L, arg, msg); |
208 | 1.69M | } |
209 | | |
210 | | |
211 | 1.62M | static void tag_error (lua_State *L, int arg, int tag) { |
212 | 1.62M | luaL_typeerror(L, arg, lua_typename(L, tag)); |
213 | 1.62M | } |
214 | | |
215 | | |
216 | | /* |
217 | | ** The use of 'lua_pushfstring' ensures this function does not |
218 | | ** need reserved stack space when called. |
219 | | */ |
220 | 2.55M | LUALIB_API void luaL_where (lua_State *L, int level) { |
221 | 2.55M | lua_Debug ar; |
222 | 2.55M | if (lua_getstack(L, level, &ar)) { /* check function at level */ |
223 | 2.55M | lua_getinfo(L, "Sl", &ar); /* get info about it */ |
224 | 2.55M | if (ar.currentline > 0) { /* is there info? */ |
225 | 587k | lua_pushfstring(L, "%s:%d: ", ar.short_src, ar.currentline); |
226 | 587k | return; |
227 | 587k | } |
228 | 2.55M | } |
229 | 1.97M | lua_pushfstring(L, ""); /* else, no information available... */ |
230 | 1.97M | } |
231 | | |
232 | | |
233 | | /* |
234 | | ** Again, the use of 'lua_pushvfstring' ensures this function does |
235 | | ** not need reserved stack space when called. (At worst, it generates |
236 | | ** a memory error instead of the given message.) |
237 | | */ |
238 | 2.53M | LUALIB_API int luaL_error (lua_State *L, const char *fmt, ...) { |
239 | 2.53M | va_list argp; |
240 | 2.53M | va_start(argp, fmt); |
241 | 2.53M | luaL_where(L, 1); |
242 | 2.53M | lua_pushvfstring(L, fmt, argp); |
243 | 2.53M | va_end(argp); |
244 | 2.53M | lua_concat(L, 2); |
245 | 2.53M | return lua_error(L); |
246 | 2.53M | } |
247 | | |
248 | | |
249 | 1.56M | LUALIB_API int luaL_fileresult (lua_State *L, int stat, const char *fname) { |
250 | 1.56M | int en = errno; /* calls to Lua API may change this value */ |
251 | 1.56M | if (stat) { |
252 | 1.06M | lua_pushboolean(L, 1); |
253 | 1.06M | return 1; |
254 | 1.06M | } |
255 | 501k | else { |
256 | 501k | const char *msg; |
257 | 501k | luaL_pushfail(L); |
258 | 501k | msg = (en != 0) ? strerror(en) : "(no extra info)"; |
259 | 501k | if (fname) |
260 | 496k | lua_pushfstring(L, "%s: %s", fname, msg); |
261 | 4.80k | else |
262 | 4.80k | lua_pushstring(L, msg); |
263 | 501k | lua_pushinteger(L, en); |
264 | 501k | return 3; |
265 | 501k | } |
266 | 1.56M | } |
267 | | |
268 | | |
269 | | #if !defined(l_inspectstat) /* { */ |
270 | | |
271 | | #if defined(LUA_USE_POSIX) |
272 | | |
273 | | #include <sys/wait.h> |
274 | | |
275 | | /* |
276 | | ** use appropriate macros to interpret 'pclose' return status |
277 | | */ |
278 | | #define l_inspectstat(stat,what) \ |
279 | 549 | if (WIFEXITED(stat)) { stat = WEXITSTATUS(stat); } \ |
280 | 549 | else if (WIFSIGNALED(stat)) { stat = WTERMSIG(stat); what = "signal"; } |
281 | | |
282 | | #else |
283 | | |
284 | | #define l_inspectstat(stat,what) /* no op */ |
285 | | |
286 | | #endif |
287 | | |
288 | | #endif /* } */ |
289 | | |
290 | | |
291 | 549 | LUALIB_API int luaL_execresult (lua_State *L, int stat) { |
292 | 549 | if (stat != 0 && errno != 0) /* error with an 'errno'? */ |
293 | 0 | return luaL_fileresult(L, 0, NULL); |
294 | 549 | else { |
295 | 549 | const char *what = "exit"; /* type of termination */ |
296 | 549 | l_inspectstat(stat, what); /* interpret result */ |
297 | 549 | if (*what == 'e' && stat == 0) /* successful termination? */ |
298 | 47 | lua_pushboolean(L, 1); |
299 | 502 | else |
300 | 502 | luaL_pushfail(L); |
301 | 549 | lua_pushstring(L, what); |
302 | 549 | lua_pushinteger(L, stat); |
303 | 549 | return 3; /* return true/fail,what,code */ |
304 | 549 | } |
305 | 549 | } |
306 | | |
307 | | /* }====================================================== */ |
308 | | |
309 | | |
310 | | |
311 | | /* |
312 | | ** {====================================================== |
313 | | ** Userdata's metatable manipulation |
314 | | ** ======================================================= |
315 | | */ |
316 | | |
317 | 1.06M | LUALIB_API int luaL_newmetatable (lua_State *L, const char *tname) { |
318 | 1.06M | if (luaL_getmetatable(L, tname) != LUA_TNIL) /* name already in use? */ |
319 | 1.01M | return 0; /* leave previous value on top, but return 0 */ |
320 | 48.0k | lua_pop(L, 1); |
321 | 48.0k | lua_createtable(L, 0, 2); /* create metatable */ |
322 | 48.0k | lua_pushstring(L, tname); |
323 | 48.0k | lua_setfield(L, -2, "__name"); /* metatable.__name = tname */ |
324 | 48.0k | lua_pushvalue(L, -1); |
325 | 48.0k | lua_setfield(L, LUA_REGISTRYINDEX, tname); /* registry.name = metatable */ |
326 | 48.0k | return 1; |
327 | 1.06M | } |
328 | | |
329 | | |
330 | 1.65M | LUALIB_API void luaL_setmetatable (lua_State *L, const char *tname) { |
331 | 1.65M | luaL_getmetatable(L, tname); |
332 | 1.65M | lua_setmetatable(L, -2); |
333 | 1.65M | } |
334 | | |
335 | | |
336 | 4.93M | LUALIB_API void *luaL_testudata (lua_State *L, int ud, const char *tname) { |
337 | 4.93M | void *p = lua_touserdata(L, ud); |
338 | 4.93M | if (p != NULL) { /* value is a userdata? */ |
339 | 4.74M | if (lua_getmetatable(L, ud)) { /* does it have a metatable? */ |
340 | 4.73M | luaL_getmetatable(L, tname); /* get correct metatable */ |
341 | 4.73M | if (!lua_rawequal(L, -1, -2)) /* not the same? */ |
342 | 1.72k | p = NULL; /* value is a userdata with wrong metatable */ |
343 | 4.73M | lua_pop(L, 2); /* remove both metatables */ |
344 | 4.73M | return p; |
345 | 4.73M | } |
346 | 4.74M | } |
347 | 196k | return NULL; /* value is not a userdata with a metatable */ |
348 | 4.93M | } |
349 | | |
350 | | |
351 | 4.70M | LUALIB_API void *luaL_checkudata (lua_State *L, int ud, const char *tname) { |
352 | 4.70M | void *p = luaL_testudata(L, ud, tname); |
353 | 4.70M | luaL_argexpected(L, p != NULL, ud, tname); |
354 | 4.70M | return p; |
355 | 4.70M | } |
356 | | |
357 | | /* }====================================================== */ |
358 | | |
359 | | |
360 | | /* |
361 | | ** {====================================================== |
362 | | ** Argument check functions |
363 | | ** ======================================================= |
364 | | */ |
365 | | |
366 | | LUALIB_API int luaL_checkoption (lua_State *L, int arg, const char *def, |
367 | 860k | const char *const lst[]) { |
368 | 860k | const char *name = (def) ? luaL_optstring(L, arg, def) : |
369 | 860k | luaL_checkstring(L, arg); |
370 | 860k | int i; |
371 | 5.36M | for (i=0; lst[i]; i++) |
372 | 5.08M | if (strcmp(lst[i], name) == 0) |
373 | 579k | return i; |
374 | 280k | return luaL_argerror(L, arg, |
375 | 280k | lua_pushfstring(L, "invalid option '%s'", name)); |
376 | 860k | } |
377 | | |
378 | | |
379 | | /* |
380 | | ** Ensures the stack has at least 'space' extra slots, raising an error |
381 | | ** if it cannot fulfill the request. (The error handling needs a few |
382 | | ** extra slots to format the error message. In case of an error without |
383 | | ** this extra space, Lua will generate the same 'stack overflow' error, |
384 | | ** but without 'msg'.) |
385 | | */ |
386 | 6.84M | LUALIB_API void luaL_checkstack (lua_State *L, int space, const char *msg) { |
387 | 6.84M | if (l_unlikely(!lua_checkstack(L, space))) { |
388 | 0 | if (msg) |
389 | 0 | luaL_error(L, "stack overflow (%s)", msg); |
390 | 0 | else |
391 | 0 | luaL_error(L, "stack overflow"); |
392 | 0 | } |
393 | 6.84M | } |
394 | | |
395 | | |
396 | 7.76M | LUALIB_API void luaL_checktype (lua_State *L, int arg, int t) { |
397 | 7.76M | if (l_unlikely(lua_type(L, arg) != t)) |
398 | 1.23M | tag_error(L, arg, t); |
399 | 7.76M | } |
400 | | |
401 | | |
402 | 43.8M | LUALIB_API void luaL_checkany (lua_State *L, int arg) { |
403 | 43.8M | if (l_unlikely(lua_type(L, arg) == LUA_TNONE)) |
404 | 4.23k | luaL_argerror(L, arg, "value expected"); |
405 | 43.8M | } |
406 | | |
407 | | |
408 | 49.0M | LUALIB_API const char *luaL_checklstring (lua_State *L, int arg, size_t *len) { |
409 | 49.0M | const char *s = lua_tolstring(L, arg, len); |
410 | 49.0M | if (l_unlikely(!s)) tag_error(L, arg, LUA_TSTRING); |
411 | 49.0M | return s; |
412 | 49.0M | } |
413 | | |
414 | | |
415 | | LUALIB_API const char *luaL_optlstring (lua_State *L, int arg, |
416 | 26.5M | const char *def, size_t *len) { |
417 | 26.5M | if (lua_isnoneornil(L, arg)) { |
418 | 24.8M | if (len) |
419 | 110k | *len = (def ? strlen(def) : 0); |
420 | 24.8M | return def; |
421 | 24.8M | } |
422 | 1.64M | else return luaL_checklstring(L, arg, len); |
423 | 26.5M | } |
424 | | |
425 | | |
426 | 307k | LUALIB_API lua_Number luaL_checknumber (lua_State *L, int arg) { |
427 | 307k | int isnum; |
428 | 307k | lua_Number d = lua_tonumberx(L, arg, &isnum); |
429 | 307k | if (l_unlikely(!isnum)) |
430 | 9.39k | tag_error(L, arg, LUA_TNUMBER); |
431 | 307k | return d; |
432 | 307k | } |
433 | | |
434 | | |
435 | 27 | LUALIB_API lua_Number luaL_optnumber (lua_State *L, int arg, lua_Number def) { |
436 | 27 | return luaL_opt(L, luaL_checknumber, arg, def); |
437 | 27 | } |
438 | | |
439 | | |
440 | 390k | static void interror (lua_State *L, int arg) { |
441 | 390k | if (lua_isnumber(L, arg)) |
442 | 13.7k | luaL_argerror(L, arg, "number has no integer representation"); |
443 | 376k | else |
444 | 376k | tag_error(L, arg, LUA_TNUMBER); |
445 | 390k | } |
446 | | |
447 | | |
448 | 18.1M | LUALIB_API lua_Integer luaL_checkinteger (lua_State *L, int arg) { |
449 | 18.1M | int isnum; |
450 | 18.1M | lua_Integer d = lua_tointegerx(L, arg, &isnum); |
451 | 18.1M | if (l_unlikely(!isnum)) { |
452 | 390k | interror(L, arg); |
453 | 390k | } |
454 | 18.1M | return d; |
455 | 18.1M | } |
456 | | |
457 | | |
458 | | LUALIB_API lua_Integer luaL_optinteger (lua_State *L, int arg, |
459 | 9.42M | lua_Integer def) { |
460 | 9.42M | return luaL_opt(L, luaL_checkinteger, arg, def); |
461 | 9.42M | } |
462 | | |
463 | | /* }====================================================== */ |
464 | | |
465 | | |
466 | | /* |
467 | | ** {====================================================== |
468 | | ** Generic Buffer manipulation |
469 | | ** ======================================================= |
470 | | */ |
471 | | |
472 | | /* userdata to box arbitrary data */ |
473 | | typedef struct UBox { |
474 | | void *box; |
475 | | size_t bsize; |
476 | | } UBox; |
477 | | |
478 | | |
479 | | /* Resize the buffer used by a box. Optimize for the common case of |
480 | | ** resizing to the old size. (For instance, __gc will resize the box |
481 | | ** to 0 even after it was closed. 'pushresult' may also resize it to a |
482 | | ** final size that is equal to the one set when the buffer was created.) |
483 | | */ |
484 | 4.79M | static void *resizebox (lua_State *L, int idx, size_t newsize) { |
485 | 4.79M | UBox *box = (UBox *)lua_touserdata(L, idx); |
486 | 4.79M | if (box->bsize == newsize) /* not changing size? */ |
487 | 2.30M | return box->box; /* keep the buffer */ |
488 | 2.48M | else { |
489 | 2.48M | void *ud; |
490 | 2.48M | lua_Alloc allocf = lua_getallocf(L, &ud); |
491 | 2.48M | void *temp = allocf(ud, box->box, box->bsize, newsize); |
492 | 2.48M | if (l_unlikely(temp == NULL && newsize > 0)) { /* allocation error? */ |
493 | 288 | lua_pushliteral(L, "not enough memory"); |
494 | 288 | lua_error(L); /* raise a memory error */ |
495 | 288 | } |
496 | 2.48M | box->box = temp; |
497 | 2.48M | box->bsize = newsize; |
498 | 2.48M | return temp; |
499 | 2.48M | } |
500 | 4.79M | } |
501 | | |
502 | | |
503 | 2.05M | static int boxgc (lua_State *L) { |
504 | 2.05M | resizebox(L, 1, 0); |
505 | 2.05M | return 0; |
506 | 2.05M | } |
507 | | |
508 | | |
509 | | static const luaL_Reg boxmt[] = { /* box metamethods */ |
510 | | {"__gc", boxgc}, |
511 | | {"__close", boxgc}, |
512 | | {NULL, NULL} |
513 | | }; |
514 | | |
515 | | |
516 | 1.02M | static void newbox (lua_State *L) { |
517 | 1.02M | UBox *box = (UBox *)lua_newuserdatauv(L, sizeof(UBox), 0); |
518 | 1.02M | box->box = NULL; |
519 | 1.02M | box->bsize = 0; |
520 | 1.02M | if (luaL_newmetatable(L, "_UBOX*")) /* creating metatable? */ |
521 | 15.7k | luaL_setfuncs(L, boxmt, 0); /* set its metamethods */ |
522 | 1.02M | lua_setmetatable(L, -2); |
523 | 1.02M | } |
524 | | |
525 | | |
526 | | /* |
527 | | ** check whether buffer is using a userdata on the stack as a temporary |
528 | | ** buffer |
529 | | */ |
530 | 6.24M | #define buffonstack(B) ((B)->b != (B)->init.b) |
531 | | |
532 | | |
533 | | /* |
534 | | ** Whenever buffer is accessed, slot 'idx' must either be a box (which |
535 | | ** cannot be NULL) or it is a placeholder for the buffer. |
536 | | */ |
537 | | #define checkbufferlevel(B,idx) \ |
538 | 63.9M | lua_assert(buffonstack(B) ? lua_touserdata(B->L, idx) != NULL \ |
539 | 63.9M | : lua_touserdata(B->L, idx) == (void*)B) |
540 | | |
541 | | |
542 | | /* |
543 | | ** Compute new size for buffer 'B', enough to accommodate extra 'sz' |
544 | | ** bytes plus one for a terminating zero. |
545 | | */ |
546 | 1.74M | static size_t newbuffsize (luaL_Buffer *B, size_t sz) { |
547 | 1.74M | size_t newsize = B->size; |
548 | 1.74M | if (l_unlikely(sz >= MAX_SIZE - B->n)) |
549 | 31 | return cast_sizet(luaL_error(B->L, "resulting string too large")); |
550 | | /* else B->n + sz + 1 <= MAX_SIZE */ |
551 | 1.74M | if (newsize <= MAX_SIZE/3 * 2) /* no overflow? */ |
552 | 1.74M | newsize += (newsize >> 1); /* new size *= 1.5 */ |
553 | 1.74M | if (newsize < B->n + sz + 1) /* not big enough? */ |
554 | 554k | newsize = B->n + sz + 1; |
555 | 1.74M | return newsize; |
556 | 1.74M | } |
557 | | |
558 | | |
559 | | /* |
560 | | ** Returns a pointer to a free area with at least 'sz' bytes in buffer |
561 | | ** 'B'. 'boxidx' is the relative position in the stack where is the |
562 | | ** buffer's box or its placeholder. |
563 | | */ |
564 | 59.4M | static char *prepbuffsize (luaL_Buffer *B, size_t sz, int boxidx) { |
565 | 59.4M | checkbufferlevel(B, boxidx); |
566 | 59.4M | if (B->size - B->n >= sz) /* enough space? */ |
567 | 57.7M | return B->b + B->n; |
568 | 1.74M | else { |
569 | 1.74M | lua_State *L = B->L; |
570 | 1.74M | char *newbuff; |
571 | 1.74M | size_t newsize = newbuffsize(B, sz); |
572 | | /* create larger buffer */ |
573 | 1.74M | if (buffonstack(B)) /* buffer already has a box? */ |
574 | 712k | newbuff = (char *)resizebox(L, boxidx, newsize); /* resize it */ |
575 | 1.02M | else { /* no box yet */ |
576 | 1.02M | lua_remove(L, boxidx); /* remove placeholder */ |
577 | 1.02M | newbox(L); /* create a new box */ |
578 | 1.02M | lua_insert(L, boxidx); /* move box to its intended position */ |
579 | 1.02M | lua_toclose(L, boxidx); |
580 | 1.02M | newbuff = (char *)resizebox(L, boxidx, newsize); |
581 | 1.02M | memcpy(newbuff, B->b, B->n * sizeof(char)); /* copy original content */ |
582 | 1.02M | } |
583 | 1.74M | B->b = newbuff; |
584 | 1.74M | B->size = newsize; |
585 | 1.74M | return newbuff + B->n; |
586 | 1.74M | } |
587 | 59.4M | } |
588 | | |
589 | | /* |
590 | | ** returns a pointer to a free area with at least 'sz' bytes |
591 | | */ |
592 | 1.44M | LUALIB_API char *luaL_prepbuffsize (luaL_Buffer *B, size_t sz) { |
593 | 1.44M | return prepbuffsize(B, sz, -1); |
594 | 1.44M | } |
595 | | |
596 | | |
597 | 67.1M | LUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) { |
598 | 67.1M | if (l > 0) { /* avoid 'memcpy' when 's' can be NULL */ |
599 | 51.7M | char *b = prepbuffsize(B, l, -1); |
600 | 51.7M | memcpy(b, s, l * sizeof(char)); |
601 | 51.7M | luaL_addsize(B, l); |
602 | 51.7M | } |
603 | 67.1M | } |
604 | | |
605 | | |
606 | 20.2M | LUALIB_API void luaL_addstring (luaL_Buffer *B, const char *s) { |
607 | 20.2M | luaL_addlstring(B, s, strlen(s)); |
608 | 20.2M | } |
609 | | |
610 | | |
611 | 4.50M | LUALIB_API void luaL_pushresult (luaL_Buffer *B) { |
612 | 4.50M | lua_State *L = B->L; |
613 | 4.50M | checkbufferlevel(B, -1); |
614 | 4.50M | if (!buffonstack(B)) /* using static buffer? */ |
615 | 3.50M | lua_pushlstring(L, B->b, B->n); /* save result as regular string */ |
616 | 999k | else { /* reuse buffer already allocated */ |
617 | 999k | UBox *box = (UBox *)lua_touserdata(L, -1); |
618 | 999k | void *ud; |
619 | 999k | lua_Alloc allocf = lua_getallocf(L, &ud); /* function to free buffer */ |
620 | 999k | size_t len = B->n; /* final string length */ |
621 | 999k | char *s; |
622 | 999k | resizebox(L, -1, len + 1); /* adjust box size to content size */ |
623 | 999k | s = (char*)box->box; /* final buffer address */ |
624 | 999k | s[len] = '\0'; /* add ending zero */ |
625 | | /* clear box, as Lua will take control of the buffer */ |
626 | 999k | box->bsize = 0; box->box = NULL; |
627 | 999k | lua_pushexternalstring(L, s, len, allocf, ud); |
628 | 999k | lua_closeslot(L, -2); /* close the box */ |
629 | 999k | lua_gc(L, LUA_GCSTEP, len); |
630 | 999k | } |
631 | 4.50M | lua_remove(L, -2); /* remove box or placeholder from the stack */ |
632 | 4.50M | } |
633 | | |
634 | | |
635 | 1.02M | LUALIB_API void luaL_pushresultsize (luaL_Buffer *B, size_t sz) { |
636 | 1.02M | luaL_addsize(B, sz); |
637 | 1.02M | luaL_pushresult(B); |
638 | 1.02M | } |
639 | | |
640 | | |
641 | | /* |
642 | | ** 'luaL_addvalue' is the only function in the Buffer system where the |
643 | | ** box (if existent) is not on the top of the stack. So, instead of |
644 | | ** calling 'luaL_addlstring', it replicates the code using -2 as the |
645 | | ** last argument to 'prepbuffsize', signaling that the box is (or will |
646 | | ** be) below the string being added to the buffer. (Box creation can |
647 | | ** trigger an emergency GC, so we should not remove the string from the |
648 | | ** stack before we have the space guaranteed.) |
649 | | */ |
650 | 5.23M | LUALIB_API void luaL_addvalue (luaL_Buffer *B) { |
651 | 5.23M | lua_State *L = B->L; |
652 | 5.23M | size_t len; |
653 | 5.23M | const char *s = lua_tolstring(L, -1, &len); |
654 | 5.23M | char *b = prepbuffsize(B, len, -2); |
655 | 5.23M | memcpy(b, s, len * sizeof(char)); |
656 | 5.23M | luaL_addsize(B, len); |
657 | 5.23M | lua_pop(L, 1); /* pop string */ |
658 | 5.23M | } |
659 | | |
660 | | |
661 | 4.96M | LUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B) { |
662 | 4.96M | B->L = L; |
663 | 4.96M | B->b = B->init.b; |
664 | 4.96M | B->n = 0; |
665 | 4.96M | B->size = LUAL_BUFFERSIZE; |
666 | 4.96M | lua_pushlightuserdata(L, (void*)B); /* push placeholder */ |
667 | 4.96M | } |
668 | | |
669 | | |
670 | 1.02M | LUALIB_API char *luaL_buffinitsize (lua_State *L, luaL_Buffer *B, size_t sz) { |
671 | 1.02M | luaL_buffinit(L, B); |
672 | 1.02M | return prepbuffsize(B, sz, -1); |
673 | 1.02M | } |
674 | | |
675 | | /* }====================================================== */ |
676 | | |
677 | | |
678 | | /* |
679 | | ** {====================================================== |
680 | | ** Reference system |
681 | | ** ======================================================= |
682 | | */ |
683 | | |
684 | | /* |
685 | | ** The previously freed references form a linked list: t[1] is the index |
686 | | ** of a first free index, t[t[1]] is the index of the second element, |
687 | | ** etc. A zero signals the end of the list. |
688 | | */ |
689 | 20 | LUALIB_API int luaL_ref (lua_State *L, int t) { |
690 | 20 | int ref; |
691 | 20 | if (lua_isnil(L, -1)) { |
692 | 2 | lua_pop(L, 1); /* remove from stack */ |
693 | 2 | return LUA_REFNIL; /* 'nil' has a unique fixed reference */ |
694 | 2 | } |
695 | 18 | t = lua_absindex(L, t); |
696 | 18 | if (lua_rawgeti(L, t, 1) == LUA_TNUMBER) /* already initialized? */ |
697 | 0 | ref = (int)lua_tointeger(L, -1); /* ref = t[1] */ |
698 | 18 | else { /* first access */ |
699 | 18 | lua_assert(!lua_toboolean(L, -1)); /* must be nil or false */ |
700 | 18 | ref = 0; /* list is empty */ |
701 | 18 | lua_pushinteger(L, 0); /* initialize as an empty list */ |
702 | 18 | lua_rawseti(L, t, 1); /* ref = t[1] = 0 */ |
703 | 18 | } |
704 | 18 | lua_pop(L, 1); /* remove element from stack */ |
705 | 18 | if (ref != 0) { /* any free element? */ |
706 | 0 | lua_rawgeti(L, t, ref); /* remove it from list */ |
707 | 0 | lua_rawseti(L, t, 1); /* (t[1] = t[ref]) */ |
708 | 0 | } |
709 | 18 | else /* no free elements */ |
710 | 18 | ref = (int)lua_rawlen(L, t) + 1; /* get a new reference */ |
711 | 18 | lua_rawseti(L, t, ref); |
712 | 18 | return ref; |
713 | 18 | } |
714 | | |
715 | | |
716 | 0 | LUALIB_API void luaL_unref (lua_State *L, int t, int ref) { |
717 | 0 | if (ref >= 0) { |
718 | 0 | t = lua_absindex(L, t); |
719 | 0 | lua_rawgeti(L, t, 1); |
720 | 0 | lua_assert(lua_isinteger(L, -1)); |
721 | 0 | lua_rawseti(L, t, ref); /* t[ref] = t[1] */ |
722 | 0 | lua_pushinteger(L, ref); |
723 | 0 | lua_rawseti(L, t, 1); /* t[1] = ref */ |
724 | 0 | } |
725 | 0 | } |
726 | | |
727 | | /* }====================================================== */ |
728 | | |
729 | | |
730 | | /* |
731 | | ** {====================================================== |
732 | | ** Load functions |
733 | | ** ======================================================= |
734 | | */ |
735 | | |
736 | | typedef struct LoadF { |
737 | | unsigned n; /* number of pre-read characters */ |
738 | | FILE *f; /* file being read */ |
739 | | char buff[BUFSIZ]; /* area for reading file */ |
740 | | } LoadF; |
741 | | |
742 | | |
743 | 59.7k | static const char *getF (lua_State *L, void *ud, size_t *size) { |
744 | 59.7k | LoadF *lf = (LoadF *)ud; |
745 | 59.7k | (void)L; /* not used */ |
746 | 59.7k | if (lf->n > 0) { /* are there pre-read characters to be read? */ |
747 | 324 | *size = lf->n; /* return them (chars already in buffer) */ |
748 | 324 | lf->n = 0; /* no more pre-read characters */ |
749 | 324 | } |
750 | 59.4k | else { /* read a block from file */ |
751 | | /* 'fread' can return > 0 *and* set the EOF flag. If next call to |
752 | | 'getF' called 'fread', it might still wait for user input. |
753 | | The next check avoids this problem. */ |
754 | 59.4k | if (feof(lf->f)) return NULL; |
755 | 21.1k | *size = fread(lf->buff, 1, sizeof(lf->buff), lf->f); /* read block */ |
756 | 21.1k | } |
757 | 21.5k | return lf->buff; |
758 | 59.7k | } |
759 | | |
760 | | |
761 | 47.0k | static int errfile (lua_State *L, const char *what, int fnameindex) { |
762 | 47.0k | int err = errno; |
763 | 47.0k | const char *filename = lua_tostring(L, fnameindex) + 1; |
764 | 47.0k | if (err != 0) |
765 | 45.1k | lua_pushfstring(L, "cannot %s %s: %s", what, filename, strerror(err)); |
766 | 1.86k | else |
767 | 1.86k | lua_pushfstring(L, "cannot %s %s", what, filename); |
768 | 47.0k | lua_remove(L, fnameindex); |
769 | 47.0k | return LUA_ERRFILE; |
770 | 47.0k | } |
771 | | |
772 | | |
773 | | /* |
774 | | ** Skip an optional BOM at the start of a stream. If there is an |
775 | | ** incomplete BOM (the first character is correct but the rest is |
776 | | ** not), returns the first character anyway to force an error |
777 | | ** (as no chunk can start with 0xEF). |
778 | | */ |
779 | 40.3k | static int skipBOM (FILE *f) { |
780 | 40.3k | int c = getc(f); /* read first character */ |
781 | 40.3k | if (c == 0xEF && getc(f) == 0xBB && getc(f) == 0xBF) /* correct BOM? */ |
782 | 0 | return getc(f); /* ignore BOM and return next char */ |
783 | 40.3k | else /* no (valid) BOM */ |
784 | 40.3k | return c; /* return first character */ |
785 | 40.3k | } |
786 | | |
787 | | |
788 | | /* |
789 | | ** reads the first character of file 'f' and skips an optional BOM mark |
790 | | ** in its beginning plus its first line if it starts with '#'. Returns |
791 | | ** true if it skipped the first line. In any case, '*cp' has the |
792 | | ** first "valid" character of the file (after the optional BOM and |
793 | | ** a first-line comment). |
794 | | */ |
795 | 40.3k | static int skipcomment (FILE *f, int *cp) { |
796 | 40.3k | int c = *cp = skipBOM(f); |
797 | 40.3k | if (c == '#') { /* first line is a comment (Unix exec. file)? */ |
798 | 0 | do { /* skip first line */ |
799 | 0 | c = getc(f); |
800 | 0 | } while (c != EOF && c != '\n'); |
801 | 0 | *cp = getc(f); /* next character after comment, if present */ |
802 | 0 | return 1; /* there was a comment */ |
803 | 0 | } |
804 | 40.3k | else return 0; /* no comment */ |
805 | 40.3k | } |
806 | | |
807 | | |
808 | | LUALIB_API int luaL_loadfilex (lua_State *L, const char *filename, |
809 | 85.5k | const char *mode) { |
810 | 85.5k | LoadF lf; |
811 | 85.5k | int status, readstatus; |
812 | 85.5k | int c; |
813 | 85.5k | int fnameindex = lua_gettop(L) + 1; /* index of filename on the stack */ |
814 | 85.5k | if (filename == NULL) { |
815 | 38.1k | lua_pushliteral(L, "=stdin"); |
816 | 38.1k | lf.f = stdin; |
817 | 38.1k | } |
818 | 47.3k | else { |
819 | 47.3k | lua_pushfstring(L, "@%s", filename); |
820 | 47.3k | errno = 0; |
821 | 47.3k | lf.f = fopen(filename, "r"); |
822 | 47.3k | if (lf.f == NULL) return errfile(L, "open", fnameindex); |
823 | 47.3k | } |
824 | 40.3k | lf.n = 0; |
825 | 40.3k | if (skipcomment(lf.f, &c)) /* read initial portion */ |
826 | 0 | lf.buff[lf.n++] = '\n'; /* add newline to correct line numbers */ |
827 | 40.3k | if (c == LUA_SIGNATURE[0]) { /* binary file? */ |
828 | 1 | lf.n = 0; /* remove possible newline */ |
829 | 1 | if (filename) { /* "real" file? */ |
830 | 1 | errno = 0; |
831 | 1 | lf.f = freopen(filename, "rb", lf.f); /* reopen in binary mode */ |
832 | 1 | if (lf.f == NULL) return errfile(L, "reopen", fnameindex); |
833 | 1 | skipcomment(lf.f, &c); /* re-read initial portion */ |
834 | 1 | } |
835 | 1 | } |
836 | 40.3k | if (c != EOF) |
837 | 324 | lf.buff[lf.n++] = cast_char(c); /* 'c' is the first character */ |
838 | 40.3k | status = lua_load(L, getF, &lf, lua_tostring(L, -1), mode); |
839 | 40.3k | readstatus = ferror(lf.f); |
840 | 40.3k | errno = 0; /* no useful error number until here */ |
841 | 40.3k | if (filename) fclose(lf.f); /* close file (even in case of errors) */ |
842 | 40.3k | if (readstatus) { |
843 | 1.86k | lua_settop(L, fnameindex); /* ignore results from 'lua_load' */ |
844 | 1.86k | return errfile(L, "read", fnameindex); |
845 | 1.86k | } |
846 | 38.4k | lua_remove(L, fnameindex); |
847 | 38.4k | return status; |
848 | 40.3k | } |
849 | | |
850 | | |
851 | | typedef struct LoadS { |
852 | | const char *s; |
853 | | size_t size; |
854 | | } LoadS; |
855 | | |
856 | | |
857 | 10.6M | static const char *getS (lua_State *L, void *ud, size_t *size) { |
858 | 10.6M | LoadS *ls = (LoadS *)ud; |
859 | 10.6M | (void)L; /* not used */ |
860 | 10.6M | if (ls->size == 0) return NULL; |
861 | 6.77M | *size = ls->size; |
862 | 6.77M | ls->size = 0; |
863 | 6.77M | return ls->s; |
864 | 10.6M | } |
865 | | |
866 | | |
867 | | LUALIB_API int luaL_loadbufferx (lua_State *L, const char *buff, size_t size, |
868 | 7.56M | const char *name, const char *mode) { |
869 | 7.56M | LoadS ls; |
870 | 7.56M | ls.s = buff; |
871 | 7.56M | ls.size = size; |
872 | 7.56M | return lua_load(L, getS, &ls, name, mode); |
873 | 7.56M | } |
874 | | |
875 | | |
876 | 35.9k | LUALIB_API int luaL_loadstring (lua_State *L, const char *s) { |
877 | 35.9k | return luaL_loadbuffer(L, s, strlen(s), s); |
878 | 35.9k | } |
879 | | |
880 | | /* }====================================================== */ |
881 | | |
882 | | |
883 | | |
884 | 6.76M | LUALIB_API int luaL_getmetafield (lua_State *L, int obj, const char *event) { |
885 | 6.76M | if (!lua_getmetatable(L, obj)) /* no metatable? */ |
886 | 2.83M | return LUA_TNIL; |
887 | 3.92M | else { |
888 | 3.92M | int tt; |
889 | 3.92M | lua_pushstring(L, event); |
890 | 3.92M | tt = lua_rawget(L, -2); |
891 | 3.92M | if (tt == LUA_TNIL) /* is metafield nil? */ |
892 | 3.92M | lua_pop(L, 2); /* remove metatable and metafield */ |
893 | 4.69k | else |
894 | 4.69k | lua_remove(L, -2); /* remove only metatable */ |
895 | 3.92M | return tt; /* return metafield type */ |
896 | 3.92M | } |
897 | 6.76M | } |
898 | | |
899 | | |
900 | 1.77M | LUALIB_API int luaL_callmeta (lua_State *L, int obj, const char *event) { |
901 | 1.77M | obj = lua_absindex(L, obj); |
902 | 1.77M | if (luaL_getmetafield(L, obj, event) == LUA_TNIL) /* no metafield? */ |
903 | 1.77M | return 0; |
904 | 4.09k | lua_pushvalue(L, obj); |
905 | 4.09k | lua_call(L, 1, 1); |
906 | 4.09k | return 1; |
907 | 1.77M | } |
908 | | |
909 | | |
910 | 95.5k | LUALIB_API lua_Integer luaL_len (lua_State *L, int idx) { |
911 | 95.5k | lua_Integer l; |
912 | 95.5k | int isnum; |
913 | 95.5k | lua_len(L, idx); |
914 | 95.5k | l = lua_tointegerx(L, -1, &isnum); |
915 | 95.5k | if (l_unlikely(!isnum)) |
916 | 0 | luaL_error(L, "object length is not an integer"); |
917 | 95.5k | lua_pop(L, 1); /* remove object */ |
918 | 95.5k | return l; |
919 | 95.5k | } |
920 | | |
921 | | |
922 | 1.77M | LUALIB_API const char *luaL_tolstring (lua_State *L, int idx, size_t *len) { |
923 | 1.77M | idx = lua_absindex(L,idx); |
924 | 1.77M | if (luaL_callmeta(L, idx, "__tostring")) { /* metafield? */ |
925 | 4.09k | if (!lua_isstring(L, -1)) |
926 | 0 | luaL_error(L, "'__tostring' must return a string"); |
927 | 4.09k | } |
928 | 1.77M | else { |
929 | 1.77M | switch (lua_type(L, idx)) { |
930 | 250k | case LUA_TNUMBER: { |
931 | 250k | char buff[LUA_N2SBUFFSZ]; |
932 | 250k | lua_numbertocstring(L, idx, buff); |
933 | 250k | lua_pushstring(L, buff); |
934 | 250k | break; |
935 | 0 | } |
936 | 727k | case LUA_TSTRING: |
937 | 727k | lua_pushvalue(L, idx); |
938 | 727k | break; |
939 | 101k | case LUA_TBOOLEAN: |
940 | 101k | lua_pushstring(L, (lua_toboolean(L, idx) ? "true" : "false")); |
941 | 101k | break; |
942 | 306k | case LUA_TNIL: |
943 | 306k | lua_pushliteral(L, "nil"); |
944 | 306k | break; |
945 | 384k | default: { |
946 | 384k | int tt = luaL_getmetafield(L, idx, "__name"); /* try name */ |
947 | 384k | const char *kind = (tt == LUA_TSTRING) ? lua_tostring(L, -1) : |
948 | 384k | luaL_typename(L, idx); |
949 | 384k | lua_pushfstring(L, "%s: %p", kind, lua_topointer(L, idx)); |
950 | 384k | if (tt != LUA_TNIL) |
951 | 8 | lua_remove(L, -2); /* remove '__name' */ |
952 | 384k | break; |
953 | 0 | } |
954 | 1.77M | } |
955 | 1.77M | } |
956 | 1.77M | return lua_tolstring(L, -1, len); |
957 | 1.77M | } |
958 | | |
959 | | |
960 | | /* |
961 | | ** set functions from list 'l' into table at top - 'nup'; each |
962 | | ** function gets the 'nup' elements at the top as upvalues. |
963 | | ** Returns with only the table at the stack. |
964 | | */ |
965 | 467k | LUALIB_API void luaL_setfuncs (lua_State *L, const luaL_Reg *l, int nup) { |
966 | 467k | luaL_checkstack(L, nup, "too many upvalues"); |
967 | 5.26M | for (; l->name != NULL; l++) { /* fill the table with given functions */ |
968 | 4.80M | if (l->func == NULL) /* placeholder? */ |
969 | 479k | lua_pushboolean(L, 0); |
970 | 4.32M | else { |
971 | 4.32M | int i; |
972 | 4.41M | for (i = 0; i < nup; i++) /* copy upvalues to the top */ |
973 | 89.9k | lua_pushvalue(L, -nup); |
974 | 4.32M | lua_pushcclosure(L, l->func, nup); /* closure with those upvalues */ |
975 | 4.32M | } |
976 | 4.80M | lua_setfield(L, -(nup + 2), l->name); |
977 | 4.80M | } |
978 | 467k | lua_pop(L, nup); /* remove upvalues */ |
979 | 467k | } |
980 | | |
981 | | |
982 | | /* |
983 | | ** ensure that stack[idx][fname] has a table and push that table |
984 | | ** into the stack |
985 | | */ |
986 | 928k | LUALIB_API int luaL_getsubtable (lua_State *L, int idx, const char *fname) { |
987 | 928k | if (lua_getfield(L, idx, fname) == LUA_TTABLE) |
988 | 836k | return 1; /* table already there */ |
989 | 91.4k | else { |
990 | 91.4k | lua_pop(L, 1); /* remove previous result */ |
991 | 91.4k | idx = lua_absindex(L, idx); |
992 | 91.4k | lua_newtable(L); |
993 | 91.4k | lua_pushvalue(L, -1); /* copy to be left at top */ |
994 | 91.4k | lua_setfield(L, idx, fname); /* assign new table to field */ |
995 | 91.4k | return 0; /* false, because did not find table there */ |
996 | 91.4k | } |
997 | 928k | } |
998 | | |
999 | | |
1000 | | /* |
1001 | | ** Stripped-down 'require': After checking "loaded" table, calls 'openf' |
1002 | | ** to open a module, registers the result in 'package.loaded' table and, |
1003 | | ** if 'glb' is true, also registers the result in the global table. |
1004 | | ** Leaves resulting module on the top. |
1005 | | */ |
1006 | | LUALIB_API void luaL_requiref (lua_State *L, const char *modname, |
1007 | 299k | lua_CFunction openf, int glb) { |
1008 | 299k | luaL_getsubtable(L, LUA_REGISTRYINDEX, LUA_LOADED_TABLE); |
1009 | 299k | lua_getfield(L, -1, modname); /* LOADED[modname] */ |
1010 | 299k | if (!lua_toboolean(L, -1)) { /* package not already loaded? */ |
1011 | 299k | lua_pop(L, 1); /* remove field */ |
1012 | 299k | lua_pushcfunction(L, openf); |
1013 | 299k | lua_pushstring(L, modname); /* argument to open function */ |
1014 | 299k | lua_call(L, 1, 1); /* call 'openf' to open module */ |
1015 | 299k | lua_pushvalue(L, -1); /* make copy of module (call result) */ |
1016 | 299k | lua_setfield(L, -3, modname); /* LOADED[modname] = module */ |
1017 | 299k | } |
1018 | 299k | lua_remove(L, -2); /* remove LOADED table */ |
1019 | 299k | if (glb) { |
1020 | 299k | lua_pushvalue(L, -1); /* copy of module */ |
1021 | 299k | lua_setglobal(L, modname); /* _G[modname] = module */ |
1022 | 299k | } |
1023 | 299k | } |
1024 | | |
1025 | | |
1026 | | LUALIB_API void luaL_addgsub (luaL_Buffer *b, const char *s, |
1027 | 1.07M | const char *p, const char *r) { |
1028 | 1.07M | const char *wild; |
1029 | 1.07M | size_t l = strlen(p); |
1030 | 13.3M | while ((wild = strstr(s, p)) != NULL) { |
1031 | 12.2M | luaL_addlstring(b, s, ct_diff2sz(wild - s)); /* push prefix */ |
1032 | 12.2M | luaL_addstring(b, r); /* push replacement in place of pattern */ |
1033 | 12.2M | s = wild + l; /* continue after 'p' */ |
1034 | 12.2M | } |
1035 | 1.07M | luaL_addstring(b, s); /* push last suffix */ |
1036 | 1.07M | } |
1037 | | |
1038 | | |
1039 | | LUALIB_API const char *luaL_gsub (lua_State *L, const char *s, |
1040 | 170k | const char *p, const char *r) { |
1041 | 170k | luaL_Buffer b; |
1042 | 170k | luaL_buffinit(L, &b); |
1043 | 170k | luaL_addgsub(&b, s, p, r); |
1044 | 170k | luaL_pushresult(&b); |
1045 | 170k | return lua_tostring(L, -1); |
1046 | 170k | } |
1047 | | |
1048 | | |
1049 | 682M | static void *l_alloc (void *ud, void *ptr, size_t osize, size_t nsize) { |
1050 | 682M | (void)ud; (void)osize; /* not used */ |
1051 | 682M | if (nsize == 0) { |
1052 | 368M | free(ptr); |
1053 | 368M | return NULL; |
1054 | 368M | } |
1055 | 314M | else |
1056 | 314M | return realloc(ptr, nsize); |
1057 | 682M | } |
1058 | | |
1059 | | |
1060 | | /* |
1061 | | ** Standard panic function just prints an error message. The test |
1062 | | ** with 'lua_type' avoids possible memory errors in 'lua_tostring'. |
1063 | | */ |
1064 | 0 | static int panic (lua_State *L) { |
1065 | 0 | const char *msg = (lua_type(L, -1) == LUA_TSTRING) |
1066 | 0 | ? lua_tostring(L, -1) |
1067 | 0 | : "error object is not a string"; |
1068 | 0 | lua_writestringerror("PANIC: unprotected error in call to Lua API (%s)\n", |
1069 | 0 | msg); |
1070 | 0 | return 0; /* return to Lua to abort */ |
1071 | 0 | } |
1072 | | |
1073 | | |
1074 | | /* |
1075 | | ** Warning functions: |
1076 | | ** warnfoff: warning system is off |
1077 | | ** warnfon: ready to start a new message |
1078 | | ** warnfcont: previous message is to be continued |
1079 | | */ |
1080 | | static void warnfoff (void *ud, const char *message, int tocont); |
1081 | | static void warnfon (void *ud, const char *message, int tocont); |
1082 | | static void warnfcont (void *ud, const char *message, int tocont); |
1083 | | |
1084 | | |
1085 | | /* |
1086 | | ** Check whether message is a control message. If so, execute the |
1087 | | ** control or ignore it if unknown. |
1088 | | */ |
1089 | 158k | static int checkcontrol (lua_State *L, const char *message, int tocont) { |
1090 | 158k | if (tocont || *(message++) != '@') /* not a control message? */ |
1091 | 80.2k | return 0; |
1092 | 78.5k | else { |
1093 | 78.5k | if (strcmp(message, "off") == 0) |
1094 | 3.61k | lua_setwarnf(L, warnfoff, L); /* turn warnings off */ |
1095 | 74.9k | else if (strcmp(message, "on") == 0) |
1096 | 20.2k | lua_setwarnf(L, warnfon, L); /* turn warnings on */ |
1097 | 78.5k | return 1; /* it was a control message */ |
1098 | 78.5k | } |
1099 | 158k | } |
1100 | | |
1101 | | |
1102 | 112k | static void warnfoff (void *ud, const char *message, int tocont) { |
1103 | 112k | checkcontrol((lua_State *)ud, message, tocont); |
1104 | 112k | } |
1105 | | |
1106 | | |
1107 | | /* |
1108 | | ** Writes the message and handle 'tocont', finishing the message |
1109 | | ** if needed and setting the next warn function. |
1110 | | */ |
1111 | 16.0k | static void warnfcont (void *ud, const char *message, int tocont) { |
1112 | 16.0k | lua_State *L = (lua_State *)ud; |
1113 | 16.0k | lua_writestringerror("%s", message); /* write message */ |
1114 | 16.0k | if (tocont) /* not the last part? */ |
1115 | 5.00k | lua_setwarnf(L, warnfcont, L); /* to be continued */ |
1116 | 11.0k | else { /* last part */ |
1117 | 11.0k | lua_writestringerror("%s", "\n"); /* finish message with end-of-line */ |
1118 | 11.0k | lua_setwarnf(L, warnfon, L); /* next call is a new message */ |
1119 | 11.0k | } |
1120 | 16.0k | } |
1121 | | |
1122 | | |
1123 | 46.2k | static void warnfon (void *ud, const char *message, int tocont) { |
1124 | 46.2k | if (checkcontrol((lua_State *)ud, message, tocont)) /* control message? */ |
1125 | 35.2k | return; /* nothing else to be done */ |
1126 | 11.0k | lua_writestringerror("%s", "Lua warning: "); /* start a new warning */ |
1127 | 11.0k | warnfcont(ud, message, tocont); /* finish processing */ |
1128 | 11.0k | } |
1129 | | |
1130 | | |
1131 | | |
1132 | | /* |
1133 | | ** A function to compute an unsigned int with some level of |
1134 | | ** randomness. Rely on Address Space Layout Randomization (if present) |
1135 | | ** and the current time. |
1136 | | */ |
1137 | | #if !defined(luai_makeseed) |
1138 | | |
1139 | | #include <time.h> |
1140 | | |
1141 | | |
1142 | | /* Size for the buffer, in bytes */ |
1143 | 447k | #define BUFSEEDB (sizeof(void*) + sizeof(time_t)) |
1144 | | |
1145 | | /* Size for the buffer in int's, rounded up */ |
1146 | 358k | #define BUFSEED ((BUFSEEDB + sizeof(int) - 1) / sizeof(int)) |
1147 | | |
1148 | | /* |
1149 | | ** Copy the contents of variable 'v' into the buffer pointed by 'b'. |
1150 | | ** (The '&b[0]' disguises 'b' to fix an absurd warning from clang.) |
1151 | | */ |
1152 | 179k | #define addbuff(b,v) (memcpy(&b[0], &(v), sizeof(v)), b += sizeof(v)) |
1153 | | |
1154 | | |
1155 | 89.5k | static unsigned int luai_makeseed (void) { |
1156 | 89.5k | unsigned int buff[BUFSEED]; |
1157 | 89.5k | unsigned int res; |
1158 | 89.5k | unsigned int i; |
1159 | 89.5k | time_t t = time(NULL); |
1160 | 89.5k | char *b = (char*)buff; |
1161 | 89.5k | addbuff(b, b); /* local variable's address */ |
1162 | 89.5k | addbuff(b, t); /* time */ |
1163 | | /* fill (rare but possible) remain of the buffer with zeros */ |
1164 | 89.5k | memset(b, 0, sizeof(buff) - BUFSEEDB); |
1165 | 89.5k | res = buff[0]; |
1166 | 358k | for (i = 1; i < BUFSEED; i++) |
1167 | 268k | res ^= (res >> 3) + (res << 7) + buff[i]; |
1168 | 89.5k | return res; |
1169 | 89.5k | } |
1170 | | |
1171 | | #endif |
1172 | | |
1173 | | |
1174 | 29.9k | LUALIB_API unsigned int luaL_makeseed (lua_State *L) { |
1175 | 29.9k | (void)L; /* unused */ |
1176 | 29.9k | return luai_makeseed(); |
1177 | 29.9k | } |
1178 | | |
1179 | | |
1180 | 59.5k | LUALIB_API lua_State *luaL_newstate (void) { |
1181 | 59.5k | lua_State *L = lua_newstate(l_alloc, NULL, luai_makeseed()); |
1182 | 59.5k | if (l_likely(L)) { |
1183 | 59.5k | lua_atpanic(L, &panic); |
1184 | 59.5k | lua_setwarnf(L, warnfoff, L); /* default is warnings off */ |
1185 | 59.5k | } |
1186 | 59.5k | return L; |
1187 | 59.5k | } |
1188 | | |
1189 | | |
1190 | 269k | LUALIB_API void luaL_checkversion_ (lua_State *L, lua_Number ver, size_t sz) { |
1191 | 269k | lua_Number v = lua_version(L); |
1192 | 269k | if (sz != LUAL_NUMSIZES) /* check numeric types */ |
1193 | 0 | luaL_error(L, "core and library have incompatible numeric types"); |
1194 | 269k | else if (v != ver) |
1195 | 0 | luaL_error(L, "version mismatch: app. needs %f, Lua core provides %f", |
1196 | 0 | (LUAI_UACNUMBER)ver, (LUAI_UACNUMBER)v); |
1197 | 269k | } |
1198 | | |