1997-09-16 23:25:59 +04:00
|
|
|
/*
|
2018-08-23 20:26:12 +03:00
|
|
|
** $Id: lobject.c $
|
1997-09-16 23:25:59 +04:00
|
|
|
** Some generic functions over Lua objects
|
|
|
|
** See Copyright Notice in lua.h
|
|
|
|
*/
|
|
|
|
|
2014-11-02 22:19:04 +03:00
|
|
|
#define lobject_c
|
|
|
|
#define LUA_CORE
|
|
|
|
|
|
|
|
#include "lprefix.h"
|
|
|
|
|
|
|
|
|
2024-08-02 21:09:30 +03:00
|
|
|
#include <float.h>
|
2015-04-11 21:30:08 +03:00
|
|
|
#include <locale.h>
|
2015-02-05 20:15:33 +03:00
|
|
|
#include <math.h>
|
2000-09-12 00:29:27 +04:00
|
|
|
#include <stdarg.h>
|
2005-03-08 21:09:16 +03:00
|
|
|
#include <stdio.h>
|
1997-09-16 23:25:59 +04:00
|
|
|
#include <stdlib.h>
|
2000-09-12 00:29:27 +04:00
|
|
|
#include <string.h>
|
1997-09-16 23:25:59 +04:00
|
|
|
|
|
|
|
#include "lua.h"
|
|
|
|
|
2009-02-19 20:33:51 +03:00
|
|
|
#include "lctype.h"
|
2007-12-19 20:24:38 +03:00
|
|
|
#include "ldebug.h"
|
2001-01-24 18:45:33 +03:00
|
|
|
#include "ldo.h"
|
2000-09-11 21:38:42 +04:00
|
|
|
#include "lmem.h"
|
2000-06-12 17:52:05 +04:00
|
|
|
#include "lobject.h"
|
2000-09-11 21:38:42 +04:00
|
|
|
#include "lstate.h"
|
2002-05-07 21:36:56 +04:00
|
|
|
#include "lstring.h"
|
|
|
|
#include "lvm.h"
|
2000-06-12 17:52:05 +04:00
|
|
|
|
1997-09-16 23:25:59 +04:00
|
|
|
|
2015-04-11 21:30:08 +03:00
|
|
|
/*
|
|
|
|
** Computes ceil(log2(x))
|
|
|
|
*/
|
2024-07-27 19:32:59 +03:00
|
|
|
lu_byte luaO_ceillog2 (unsigned int x) {
|
2023-12-20 22:25:20 +03:00
|
|
|
static const lu_byte log_2[256] = { /* log_2[i - 1] = ceil(log2(i)) */
|
2008-01-30 21:05:23 +03:00
|
|
|
0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
|
|
|
|
6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
|
|
|
|
7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
|
|
|
|
7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
|
|
|
|
8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
|
|
|
|
8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
|
|
|
|
8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
|
|
|
|
8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8
|
|
|
|
};
|
|
|
|
int l = 0;
|
|
|
|
x--;
|
|
|
|
while (x >= 256) { l += 8; x >>= 8; }
|
2024-07-27 19:32:59 +03:00
|
|
|
return cast_byte(l + log_2[x]);
|
2008-01-30 21:05:23 +03:00
|
|
|
}
|
|
|
|
|
2023-12-20 22:25:20 +03:00
|
|
|
/*
|
2023-12-27 18:09:11 +03:00
|
|
|
** Encodes 'p'% as a floating-point byte, represented as (eeeexxxx).
|
2023-12-20 22:25:20 +03:00
|
|
|
** The exponent is represented using excess-7. Mimicking IEEE 754, the
|
|
|
|
** representation normalizes the number when possible, assuming an extra
|
2023-12-27 18:09:11 +03:00
|
|
|
** 1 before the mantissa (xxxx) and adding one to the exponent (eeee)
|
|
|
|
** to signal that. So, the real value is (1xxxx) * 2^(eeee - 7 - 1) if
|
|
|
|
** eeee != 0, and (xxxx) * 2^-7 otherwise (subnormal numbers).
|
2023-12-20 22:25:20 +03:00
|
|
|
*/
|
2024-07-27 19:32:59 +03:00
|
|
|
lu_byte luaO_codeparam (unsigned int p) {
|
2023-12-27 18:09:11 +03:00
|
|
|
if (p >= (cast(lu_mem, 0x1F) << (0xF - 7 - 1)) * 100u) /* overflow? */
|
2023-12-20 22:25:20 +03:00
|
|
|
return 0xFF; /* return maximum value */
|
|
|
|
else {
|
2023-12-27 18:09:11 +03:00
|
|
|
p = (cast(l_uint32, p) * 128 + 99) / 100; /* round up the division */
|
2024-07-27 19:32:59 +03:00
|
|
|
if (p < 0x10) { /* subnormal number? */
|
|
|
|
/* exponent bits are already zero; nothing else to do */
|
|
|
|
return cast_byte(p);
|
|
|
|
}
|
|
|
|
else { /* p >= 0x10 implies ceil(log2(p + 1)) >= 5 */
|
|
|
|
/* preserve 5 bits in 'p' */
|
|
|
|
unsigned log = luaO_ceillog2(p + 1) - 5u;
|
|
|
|
return cast_byte(((p >> log) - 0x10) | ((log + 1) << 4));
|
2023-12-20 22:25:20 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
2024-01-29 20:29:24 +03:00
|
|
|
** Computes 'p' times 'x', where 'p' is a floating-point byte. Roughly,
|
|
|
|
** we have to multiply 'x' by the mantissa and then shift accordingly to
|
|
|
|
** the exponent. If the exponent is positive, both the multiplication
|
|
|
|
** and the shift increase 'x', so we have to care only about overflows.
|
|
|
|
** For negative exponents, however, multiplying before the shift keeps
|
|
|
|
** more significant bits, as long as the multiplication does not
|
|
|
|
** overflow, so we check which order is best.
|
2023-12-20 22:25:20 +03:00
|
|
|
*/
|
2024-07-27 19:32:59 +03:00
|
|
|
l_obj luaO_applyparam (lu_byte p, l_obj x) {
|
2023-12-20 22:25:20 +03:00
|
|
|
unsigned int m = p & 0xF; /* mantissa */
|
|
|
|
int e = (p >> 4); /* exponent */
|
|
|
|
if (e > 0) { /* normalized? */
|
2024-01-29 20:29:24 +03:00
|
|
|
e--; /* correct exponent */
|
|
|
|
m += 0x10; /* correct mantissa; maximum value is 0x1F */
|
2023-12-20 22:25:20 +03:00
|
|
|
}
|
|
|
|
e -= 7; /* correct excess-7 */
|
2024-01-29 20:29:24 +03:00
|
|
|
if (e >= 0) {
|
|
|
|
if (x < (MAX_LOBJ / 0x1F) >> e) /* no overflow? */
|
|
|
|
return (x * m) << e; /* order doesn't matter here */
|
|
|
|
else /* real overflow */
|
|
|
|
return MAX_LOBJ;
|
|
|
|
}
|
|
|
|
else { /* negative exponent */
|
2023-12-20 22:25:20 +03:00
|
|
|
e = -e;
|
|
|
|
if (x < MAX_LOBJ / 0x1F) /* multiplication cannot overflow? */
|
|
|
|
return (x * m) >> e; /* multiplying first gives more precision */
|
|
|
|
else if ((x >> e) < MAX_LOBJ / 0x1F) /* cannot overflow after shift? */
|
|
|
|
return (x >> e) * m;
|
|
|
|
else /* real overflow */
|
|
|
|
return MAX_LOBJ;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-01-30 21:05:23 +03:00
|
|
|
|
2013-05-02 16:37:24 +04:00
|
|
|
static lua_Integer intarith (lua_State *L, int op, lua_Integer v1,
|
|
|
|
lua_Integer v2) {
|
|
|
|
switch (op) {
|
|
|
|
case LUA_OPADD: return intop(+, v1, v2);
|
|
|
|
case LUA_OPSUB:return intop(-, v1, v2);
|
|
|
|
case LUA_OPMUL:return intop(*, v1, v2);
|
|
|
|
case LUA_OPMOD: return luaV_mod(L, v1, v2);
|
2018-11-05 21:10:42 +03:00
|
|
|
case LUA_OPIDIV: return luaV_idiv(L, v1, v2);
|
2013-12-18 18:12:03 +04:00
|
|
|
case LUA_OPBAND: return intop(&, v1, v2);
|
|
|
|
case LUA_OPBOR: return intop(|, v1, v2);
|
|
|
|
case LUA_OPBXOR: return intop(^, v1, v2);
|
2013-12-31 00:47:58 +04:00
|
|
|
case LUA_OPSHL: return luaV_shiftl(v1, v2);
|
2022-09-23 17:08:10 +03:00
|
|
|
case LUA_OPSHR: return luaV_shiftr(v1, v2);
|
2013-07-10 21:15:12 +04:00
|
|
|
case LUA_OPUNM: return intop(-, 0, v1);
|
2014-04-15 20:32:49 +04:00
|
|
|
case LUA_OPBNOT: return intop(^, ~l_castS2U(0), v1);
|
2013-05-02 16:37:24 +04:00
|
|
|
default: lua_assert(0); return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-03-06 20:15:18 +04:00
|
|
|
static lua_Number numarith (lua_State *L, int op, lua_Number v1,
|
|
|
|
lua_Number v2) {
|
2009-06-17 21:48:34 +04:00
|
|
|
switch (op) {
|
2014-03-06 20:15:18 +04:00
|
|
|
case LUA_OPADD: return luai_numadd(L, v1, v2);
|
|
|
|
case LUA_OPSUB: return luai_numsub(L, v1, v2);
|
|
|
|
case LUA_OPMUL: return luai_nummul(L, v1, v2);
|
|
|
|
case LUA_OPDIV: return luai_numdiv(L, v1, v2);
|
|
|
|
case LUA_OPPOW: return luai_numpow(L, v1, v2);
|
2014-11-21 15:15:57 +03:00
|
|
|
case LUA_OPIDIV: return luai_numidiv(L, v1, v2);
|
2014-03-06 20:15:18 +04:00
|
|
|
case LUA_OPUNM: return luai_numunm(L, v1);
|
2018-08-28 18:36:58 +03:00
|
|
|
case LUA_OPMOD: return luaV_modf(L, v1, v2);
|
2009-06-17 21:48:34 +04:00
|
|
|
default: lua_assert(0); return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-06-29 18:06:44 +03:00
|
|
|
int luaO_rawarith (lua_State *L, int op, const TValue *p1, const TValue *p2,
|
|
|
|
TValue *res) {
|
2013-12-18 18:12:03 +04:00
|
|
|
switch (op) {
|
2014-11-21 15:15:57 +03:00
|
|
|
case LUA_OPBAND: case LUA_OPBOR: case LUA_OPBXOR:
|
|
|
|
case LUA_OPSHL: case LUA_OPSHR:
|
|
|
|
case LUA_OPBNOT: { /* operate only on integers */
|
2013-12-18 18:12:03 +04:00
|
|
|
lua_Integer i1; lua_Integer i2;
|
2017-11-08 17:50:23 +03:00
|
|
|
if (tointegerns(p1, &i1) && tointegerns(p2, &i2)) {
|
2013-12-18 18:12:03 +04:00
|
|
|
setivalue(res, intarith(L, op, i1, i2));
|
2017-06-29 18:06:44 +03:00
|
|
|
return 1;
|
2013-12-18 18:12:03 +04:00
|
|
|
}
|
2017-06-29 18:06:44 +03:00
|
|
|
else return 0; /* fail */
|
2013-05-02 16:37:24 +04:00
|
|
|
}
|
2014-05-13 01:22:05 +04:00
|
|
|
case LUA_OPDIV: case LUA_OPPOW: { /* operate only on floats */
|
2013-12-18 18:12:03 +04:00
|
|
|
lua_Number n1; lua_Number n2;
|
2017-10-10 23:05:40 +03:00
|
|
|
if (tonumberns(p1, n1) && tonumberns(p2, n2)) {
|
2014-04-29 22:14:16 +04:00
|
|
|
setfltvalue(res, numarith(L, op, n1, n2));
|
2017-06-29 18:06:44 +03:00
|
|
|
return 1;
|
2013-12-18 18:12:03 +04:00
|
|
|
}
|
2017-06-29 18:06:44 +03:00
|
|
|
else return 0; /* fail */
|
2013-05-02 16:37:24 +04:00
|
|
|
}
|
2013-12-18 18:12:03 +04:00
|
|
|
default: { /* other operations */
|
|
|
|
lua_Number n1; lua_Number n2;
|
2014-05-13 01:22:05 +04:00
|
|
|
if (ttisinteger(p1) && ttisinteger(p2)) {
|
2013-12-18 18:12:03 +04:00
|
|
|
setivalue(res, intarith(L, op, ivalue(p1), ivalue(p2)));
|
2017-06-29 18:06:44 +03:00
|
|
|
return 1;
|
2013-12-18 18:12:03 +04:00
|
|
|
}
|
2017-07-07 19:34:32 +03:00
|
|
|
else if (tonumberns(p1, n1) && tonumberns(p2, n2)) {
|
2014-04-29 22:14:16 +04:00
|
|
|
setfltvalue(res, numarith(L, op, n1, n2));
|
2017-06-29 18:06:44 +03:00
|
|
|
return 1;
|
2013-12-18 18:12:03 +04:00
|
|
|
}
|
2017-06-29 18:06:44 +03:00
|
|
|
else return 0; /* fail */
|
2013-05-02 16:37:24 +04:00
|
|
|
}
|
|
|
|
}
|
2017-06-29 18:06:44 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void luaO_arith (lua_State *L, int op, const TValue *p1, const TValue *p2,
|
|
|
|
StkId res) {
|
|
|
|
if (!luaO_rawarith(L, op, p1, p2, s2v(res))) {
|
|
|
|
/* could not perform raw operation; try metamethod */
|
|
|
|
luaT_trybinTM(L, p1, p2, res, cast(TMS, (op - LUA_OPADD) + TM_ADD));
|
|
|
|
}
|
2013-05-02 16:37:24 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2024-07-27 19:32:59 +03:00
|
|
|
lu_byte luaO_hexavalue (int c) {
|
|
|
|
if (lisdigit(c)) return cast_byte(c - '0');
|
|
|
|
else return cast_byte((ltolower(c) - 'a') + 10);
|
2010-10-28 19:39:03 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-12-10 22:03:46 +03:00
|
|
|
static int isneg (const char **s) {
|
|
|
|
if (**s == '-') { (*s)++; return 1; }
|
|
|
|
else if (**s == '+') (*s)++;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-10-28 21:41:38 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
** {==================================================================
|
|
|
|
** Lua's implementation for 'lua_strx2number'
|
|
|
|
** ===================================================================
|
|
|
|
*/
|
2015-04-11 21:30:08 +03:00
|
|
|
|
2014-10-28 21:41:38 +03:00
|
|
|
#if !defined(lua_strx2number)
|
2013-05-14 19:59:04 +04:00
|
|
|
|
2013-05-27 21:42:38 +04:00
|
|
|
/* maximum number of significant digits to read (to avoid overflows
|
|
|
|
even with single floats) */
|
|
|
|
#define MAXSIGDIG 30
|
2010-12-10 22:03:46 +03:00
|
|
|
|
|
|
|
/*
|
2017-12-30 23:46:18 +03:00
|
|
|
** convert a hexadecimal numeric string to a number, following
|
2010-12-10 22:03:46 +03:00
|
|
|
** C99 specification for 'strtod'
|
|
|
|
*/
|
|
|
|
static lua_Number lua_strx2number (const char *s, char **endptr) {
|
2015-04-11 21:30:08 +03:00
|
|
|
int dot = lua_getlocaledecpoint();
|
2022-01-03 15:12:17 +03:00
|
|
|
lua_Number r = l_mathop(0.0); /* result (accumulator) */
|
2013-05-27 21:42:38 +04:00
|
|
|
int sigdig = 0; /* number of significant digits */
|
|
|
|
int nosigdig = 0; /* number of non-significant digits */
|
|
|
|
int e = 0; /* exponent correction */
|
2014-12-26 17:43:45 +03:00
|
|
|
int neg; /* 1 if number is negative */
|
2015-04-11 21:30:08 +03:00
|
|
|
int hasdot = 0; /* true after seen a dot */
|
2018-01-28 18:13:26 +03:00
|
|
|
*endptr = cast_charp(s); /* nothing is valid yet */
|
2010-12-10 22:03:46 +03:00
|
|
|
while (lisspace(cast_uchar(*s))) s++; /* skip initial spaces */
|
2017-11-16 16:19:06 +03:00
|
|
|
neg = isneg(&s); /* check sign */
|
2010-12-10 22:03:46 +03:00
|
|
|
if (!(*s == '0' && (*(s + 1) == 'x' || *(s + 1) == 'X'))) /* check '0x' */
|
2022-01-03 15:12:17 +03:00
|
|
|
return l_mathop(0.0); /* invalid format (no '0x') */
|
2013-05-27 21:42:38 +04:00
|
|
|
for (s += 2; ; s++) { /* skip '0x' and read numeral */
|
2015-04-11 21:30:08 +03:00
|
|
|
if (*s == dot) {
|
|
|
|
if (hasdot) break; /* second dot? stop loop */
|
|
|
|
else hasdot = 1;
|
2013-05-27 21:42:38 +04:00
|
|
|
}
|
|
|
|
else if (lisxdigit(cast_uchar(*s))) {
|
2014-10-28 21:41:38 +03:00
|
|
|
if (sigdig == 0 && *s == '0') /* non-significant digit (zero)? */
|
2013-05-27 21:42:38 +04:00
|
|
|
nosigdig++;
|
2014-10-28 21:41:38 +03:00
|
|
|
else if (++sigdig <= MAXSIGDIG) /* can read it without overflow? */
|
2022-01-03 15:12:17 +03:00
|
|
|
r = (r * l_mathop(16.0)) + luaO_hexavalue(*s);
|
2014-10-28 21:41:38 +03:00
|
|
|
else e++; /* too many digits; ignore, but still count for exponent */
|
2015-04-11 21:30:08 +03:00
|
|
|
if (hasdot) e--; /* decimal digit? correct exponent */
|
2013-05-27 21:42:38 +04:00
|
|
|
}
|
|
|
|
else break; /* neither a dot nor a digit */
|
2010-12-10 22:03:46 +03:00
|
|
|
}
|
2013-05-27 21:42:38 +04:00
|
|
|
if (nosigdig + sigdig == 0) /* no digits? */
|
2022-01-03 15:12:17 +03:00
|
|
|
return l_mathop(0.0); /* invalid format */
|
2018-01-28 18:13:26 +03:00
|
|
|
*endptr = cast_charp(s); /* valid up to here */
|
2013-05-27 21:42:38 +04:00
|
|
|
e *= 4; /* each digit multiplies/divides value by 2^4 */
|
2010-12-10 22:03:46 +03:00
|
|
|
if (*s == 'p' || *s == 'P') { /* exponent part? */
|
2013-05-27 21:42:38 +04:00
|
|
|
int exp1 = 0; /* exponent value */
|
2017-11-16 16:19:06 +03:00
|
|
|
int neg1; /* exponent sign */
|
2010-12-10 22:03:46 +03:00
|
|
|
s++; /* skip 'p' */
|
2017-11-16 16:19:06 +03:00
|
|
|
neg1 = isneg(&s); /* sign */
|
2010-12-10 22:03:46 +03:00
|
|
|
if (!lisdigit(cast_uchar(*s)))
|
2022-01-03 15:12:17 +03:00
|
|
|
return l_mathop(0.0); /* invalid; must have at least one digit */
|
2010-12-10 22:03:46 +03:00
|
|
|
while (lisdigit(cast_uchar(*s))) /* read exponent */
|
|
|
|
exp1 = exp1 * 10 + *(s++) - '0';
|
|
|
|
if (neg1) exp1 = -exp1;
|
|
|
|
e += exp1;
|
2018-01-28 18:13:26 +03:00
|
|
|
*endptr = cast_charp(s); /* valid up to here */
|
2010-12-10 22:03:46 +03:00
|
|
|
}
|
|
|
|
if (neg) r = -r;
|
2013-02-20 18:08:56 +04:00
|
|
|
return l_mathop(ldexp)(r, e);
|
2010-12-10 22:03:46 +03:00
|
|
|
}
|
|
|
|
|
2014-10-28 21:41:38 +03:00
|
|
|
#endif
|
2014-02-26 19:27:56 +04:00
|
|
|
/* }====================================================== */
|
2010-12-10 22:03:46 +03:00
|
|
|
|
|
|
|
|
2020-07-03 17:36:56 +03:00
|
|
|
/* maximum length of a numeral to be converted to a number */
|
2016-05-02 17:00:32 +03:00
|
|
|
#if !defined (L_MAXLENNUM)
|
|
|
|
#define L_MAXLENNUM 200
|
|
|
|
#endif
|
|
|
|
|
2020-07-03 19:02:41 +03:00
|
|
|
/*
|
|
|
|
** Convert string 's' to a Lua number (put in 'result'). Return NULL on
|
|
|
|
** fail or the address of the ending '\0' on success. ('mode' == 'x')
|
|
|
|
** means a hexadecimal numeral.
|
|
|
|
*/
|
2016-05-02 17:00:32 +03:00
|
|
|
static const char *l_str2dloc (const char *s, lua_Number *result, int mode) {
|
2001-11-28 23:13:13 +03:00
|
|
|
char *endptr;
|
2016-05-02 17:00:32 +03:00
|
|
|
*result = (mode == 'x') ? lua_strx2number(s, &endptr) /* try to convert */
|
|
|
|
: lua_str2number(s, &endptr);
|
|
|
|
if (endptr == s) return NULL; /* nothing recognized? */
|
|
|
|
while (lisspace(cast_uchar(*endptr))) endptr++; /* skip trailing spaces */
|
2020-07-03 19:02:41 +03:00
|
|
|
return (*endptr == '\0') ? endptr : NULL; /* OK iff no trailing chars */
|
2016-05-02 17:00:32 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
2020-07-03 19:02:41 +03:00
|
|
|
** Convert string 's' to a Lua number (put in 'result') handling the
|
|
|
|
** current locale.
|
2016-05-02 17:00:32 +03:00
|
|
|
** This function accepts both the current locale or a dot as the radix
|
2017-11-23 22:29:04 +03:00
|
|
|
** mark. If the conversion fails, it may mean number has a dot but
|
2016-05-02 17:00:32 +03:00
|
|
|
** locale accepts something else. In that case, the code copies 's'
|
|
|
|
** to a buffer (because 's' is read-only), changes the dot to the
|
|
|
|
** current locale radix mark, and tries to convert again.
|
2020-07-03 19:02:41 +03:00
|
|
|
** The variable 'mode' checks for special characters in the string:
|
|
|
|
** - 'n' means 'inf' or 'nan' (which should be rejected)
|
|
|
|
** - 'x' means a hexadecimal numeral
|
|
|
|
** - '.' just optimizes the search for the common case (no special chars)
|
2016-05-02 17:00:32 +03:00
|
|
|
*/
|
|
|
|
static const char *l_str2d (const char *s, lua_Number *result) {
|
|
|
|
const char *endptr;
|
2020-07-03 19:02:41 +03:00
|
|
|
const char *pmode = strpbrk(s, ".xXnN"); /* look for special chars */
|
2016-05-02 17:00:32 +03:00
|
|
|
int mode = pmode ? ltolower(cast_uchar(*pmode)) : 0;
|
|
|
|
if (mode == 'n') /* reject 'inf' and 'nan' */
|
2014-05-01 22:18:06 +04:00
|
|
|
return NULL;
|
2016-05-02 17:00:32 +03:00
|
|
|
endptr = l_str2dloc(s, result, mode); /* try to convert */
|
|
|
|
if (endptr == NULL) { /* failed? may be a different locale */
|
|
|
|
char buff[L_MAXLENNUM + 1];
|
2016-06-27 16:15:08 +03:00
|
|
|
const char *pdot = strchr(s, '.');
|
2020-11-03 22:34:36 +03:00
|
|
|
if (pdot == NULL || strlen(s) > L_MAXLENNUM)
|
2016-05-02 17:00:32 +03:00
|
|
|
return NULL; /* string too long or no dot; fail */
|
|
|
|
strcpy(buff, s); /* copy string to buffer */
|
|
|
|
buff[pdot - s] = lua_getlocaledecpoint(); /* correct decimal point */
|
|
|
|
endptr = l_str2dloc(buff, result, mode); /* try again */
|
|
|
|
if (endptr != NULL)
|
|
|
|
endptr = s + (endptr - buff); /* make relative to 's' */
|
|
|
|
}
|
|
|
|
return endptr;
|
1998-12-27 23:25:20 +03:00
|
|
|
}
|
|
|
|
|
2000-09-12 00:29:27 +04:00
|
|
|
|
2016-05-20 17:07:48 +03:00
|
|
|
#define MAXBY10 cast(lua_Unsigned, LUA_MAXINTEGER / 10)
|
|
|
|
#define MAXLASTD cast_int(LUA_MAXINTEGER % 10)
|
|
|
|
|
2014-05-01 22:18:06 +04:00
|
|
|
static const char *l_str2int (const char *s, lua_Integer *result) {
|
2013-04-16 22:46:28 +04:00
|
|
|
lua_Unsigned a = 0;
|
2013-05-14 19:59:04 +04:00
|
|
|
int empty = 1;
|
|
|
|
int neg;
|
|
|
|
while (lisspace(cast_uchar(*s))) s++; /* skip initial spaces */
|
|
|
|
neg = isneg(&s);
|
2013-04-16 22:46:28 +04:00
|
|
|
if (s[0] == '0' &&
|
2014-06-30 23:48:08 +04:00
|
|
|
(s[1] == 'x' || s[1] == 'X')) { /* hex? */
|
2013-04-16 22:46:28 +04:00
|
|
|
s += 2; /* skip '0x' */
|
2013-05-14 19:59:04 +04:00
|
|
|
for (; lisxdigit(cast_uchar(*s)); s++) {
|
2014-11-04 22:16:25 +03:00
|
|
|
a = a * 16 + luaO_hexavalue(*s);
|
2013-05-14 19:59:04 +04:00
|
|
|
empty = 0;
|
|
|
|
}
|
2013-04-16 22:46:28 +04:00
|
|
|
}
|
|
|
|
else { /* decimal */
|
2013-05-14 19:59:04 +04:00
|
|
|
for (; lisdigit(cast_uchar(*s)); s++) {
|
2016-05-20 17:07:48 +03:00
|
|
|
int d = *s - '0';
|
|
|
|
if (a >= MAXBY10 && (a > MAXBY10 || d > MAXLASTD + neg)) /* overflow? */
|
|
|
|
return NULL; /* do not accept it (as integer) */
|
2024-07-27 19:32:59 +03:00
|
|
|
a = a * 10 + cast_uint(d);
|
2013-05-14 19:59:04 +04:00
|
|
|
empty = 0;
|
|
|
|
}
|
2013-04-16 22:46:28 +04:00
|
|
|
}
|
2013-05-14 19:59:04 +04:00
|
|
|
while (lisspace(cast_uchar(*s))) s++; /* skip trailing spaces */
|
2014-05-01 22:18:06 +04:00
|
|
|
if (empty || *s != '\0') return NULL; /* something wrong in the numeral */
|
2013-04-16 22:46:28 +04:00
|
|
|
else {
|
2014-04-15 20:32:49 +04:00
|
|
|
*result = l_castU2S((neg) ? 0u - a : a);
|
2014-05-01 22:18:06 +04:00
|
|
|
return s;
|
2013-04-16 22:46:28 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2000-10-20 20:36:32 +04:00
|
|
|
|
2014-05-01 22:18:06 +04:00
|
|
|
size_t luaO_str2num (const char *s, TValue *o) {
|
2014-04-30 20:48:44 +04:00
|
|
|
lua_Integer i; lua_Number n;
|
2014-05-01 22:18:06 +04:00
|
|
|
const char *e;
|
|
|
|
if ((e = l_str2int(s, &i)) != NULL) { /* try as an integer */
|
2014-04-30 20:48:44 +04:00
|
|
|
setivalue(o, i);
|
|
|
|
}
|
2014-05-01 22:18:06 +04:00
|
|
|
else if ((e = l_str2d(s, &n)) != NULL) { /* else try as a float */
|
2014-04-30 20:48:44 +04:00
|
|
|
setfltvalue(o, n);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
return 0; /* conversion failed */
|
2024-07-27 19:32:59 +03:00
|
|
|
return ct_diff2sz(e - s) + 1; /* success; return string size */
|
2014-04-30 20:48:44 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-10-01 15:52:33 +04:00
|
|
|
int luaO_utf8esc (char *buff, unsigned long x) {
|
2014-02-06 19:59:24 +04:00
|
|
|
int n = 1; /* number of bytes put in buffer (backwards) */
|
2019-03-15 19:14:17 +03:00
|
|
|
lua_assert(x <= 0x7FFFFFFFu);
|
2014-02-06 19:59:24 +04:00
|
|
|
if (x < 0x80) /* ascii? */
|
2018-01-28 18:13:26 +03:00
|
|
|
buff[UTF8BUFFSZ - 1] = cast_char(x);
|
2014-02-06 19:59:24 +04:00
|
|
|
else { /* need continuation bytes */
|
|
|
|
unsigned int mfb = 0x3f; /* maximum that fits in first byte */
|
2014-10-24 15:42:29 +04:00
|
|
|
do { /* add continuation bytes */
|
2018-01-28 18:13:26 +03:00
|
|
|
buff[UTF8BUFFSZ - (n++)] = cast_char(0x80 | (x & 0x3f));
|
2014-02-06 19:59:24 +04:00
|
|
|
x >>= 6; /* remove added bits */
|
|
|
|
mfb >>= 1; /* now there is one less bit available in first byte */
|
|
|
|
} while (x > mfb); /* still needs continuation byte? */
|
2018-01-28 18:13:26 +03:00
|
|
|
buff[UTF8BUFFSZ - n] = cast_char((~mfb << 1) | x); /* add first byte */
|
2014-02-06 19:59:24 +04:00
|
|
|
}
|
|
|
|
return n;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2020-07-03 17:36:56 +03:00
|
|
|
/*
|
|
|
|
** Maximum length of the conversion of a number to a string. Must be
|
|
|
|
** enough to accommodate both LUA_INTEGER_FMT and LUA_NUMBER_FMT.
|
2024-08-02 21:09:30 +03:00
|
|
|
** For a long long int, this is 19 digits plus a sign and a final '\0',
|
|
|
|
** adding to 21. For a long double, it can go to a sign, the dot, an
|
|
|
|
** exponent letter, an exponent sign, 4 exponent digits, the final
|
|
|
|
** '\0', plus the significant digits, which are approximately the *_DIG
|
|
|
|
** attribute.
|
2020-07-03 17:36:56 +03:00
|
|
|
*/
|
2024-08-02 21:09:30 +03:00
|
|
|
#define MAXNUMBER2STR (20 + l_floatatt(DIG))
|
2014-07-30 18:00:14 +04:00
|
|
|
|
|
|
|
|
|
|
|
/*
|
2024-08-02 21:09:30 +03:00
|
|
|
** Convert a float to a string, adding it to a buffer. First try with
|
|
|
|
** a not too large number of digits, to avoid noise (for instance,
|
|
|
|
** 1.1 going to "1.1000000000000001"). If that lose precision, so
|
|
|
|
** that reading the result back gives a different number, then do the
|
|
|
|
** conversion again with extra precision. Moreover, if the numeral looks
|
|
|
|
** like an integer (without a decimal point or an exponent), add ".0" to
|
|
|
|
** its end.
|
|
|
|
*/
|
|
|
|
static int tostringbuffFloat (lua_Number n, char *buff) {
|
|
|
|
/* first conversion */
|
|
|
|
int len = l_sprintf(buff, MAXNUMBER2STR, LUA_NUMBER_FMT,
|
|
|
|
(LUAI_UACNUMBER)n);
|
|
|
|
lua_Number check = lua_str2number(buff, NULL); /* read it back */
|
|
|
|
if (check != n) { /* not enough precision? */
|
|
|
|
/* convert again with more precision */
|
|
|
|
len = l_sprintf(buff, MAXNUMBER2STR, LUA_NUMBER_FMT_N,
|
|
|
|
(LUAI_UACNUMBER)n);
|
|
|
|
}
|
|
|
|
/* looks like an integer? */
|
|
|
|
if (buff[strspn(buff, "-0123456789")] == '\0') {
|
|
|
|
buff[len++] = lua_getlocaledecpoint();
|
|
|
|
buff[len++] = '0'; /* adds '.0' to result */
|
|
|
|
}
|
|
|
|
return len;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
** Convert a number object to a string, adding it to a buffer.
|
2014-07-30 18:00:14 +04:00
|
|
|
*/
|
2024-07-27 19:32:59 +03:00
|
|
|
static unsigned tostringbuff (TValue *obj, char *buff) {
|
2019-06-03 17:36:42 +03:00
|
|
|
int len;
|
2014-07-30 18:00:14 +04:00
|
|
|
lua_assert(ttisnumber(obj));
|
|
|
|
if (ttisinteger(obj))
|
2019-04-24 20:01:20 +03:00
|
|
|
len = lua_integer2str(buff, MAXNUMBER2STR, ivalue(obj));
|
2024-08-02 21:09:30 +03:00
|
|
|
else
|
|
|
|
len = tostringbuffFloat(fltvalue(obj), buff);
|
|
|
|
lua_assert(len < MAXNUMBER2STR);
|
2024-07-27 19:32:59 +03:00
|
|
|
return cast_uint(len);
|
2019-04-24 20:01:20 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
** Convert a number object to a Lua string, replacing the value at 'obj'
|
|
|
|
*/
|
|
|
|
void luaO_tostring (lua_State *L, TValue *obj) {
|
|
|
|
char buff[MAXNUMBER2STR];
|
2024-07-27 19:32:59 +03:00
|
|
|
unsigned len = tostringbuff(obj, buff);
|
2017-06-29 18:06:44 +03:00
|
|
|
setsvalue(L, obj, luaS_newlstr(L, buff, len));
|
2014-07-30 18:00:14 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2019-05-03 16:18:44 +03:00
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
** {==================================================================
|
|
|
|
** 'luaO_pushvfstring'
|
|
|
|
** ===================================================================
|
|
|
|
*/
|
|
|
|
|
2022-05-26 21:14:54 +03:00
|
|
|
/*
|
|
|
|
** Size for buffer space used by 'luaO_pushvfstring'. It should be
|
|
|
|
** (LUA_IDSIZE + MAXNUMBER2STR) + a minimal space for basic messages,
|
|
|
|
** so that 'luaG_addinfo' can work directly on the buffer.
|
|
|
|
*/
|
2024-07-27 19:32:59 +03:00
|
|
|
#define BUFVFS cast_uint(LUA_IDSIZE + MAXNUMBER2STR + 95)
|
2019-04-24 20:01:20 +03:00
|
|
|
|
|
|
|
/* buffer used by 'luaO_pushvfstring' */
|
|
|
|
typedef struct BuffFS {
|
2019-05-03 16:18:44 +03:00
|
|
|
lua_State *L;
|
2022-05-26 21:14:54 +03:00
|
|
|
int pushed; /* true if there is a part of the result on the stack */
|
2024-07-27 19:32:59 +03:00
|
|
|
unsigned blen; /* length of partial string in 'space' */
|
2019-04-26 17:24:39 +03:00
|
|
|
char space[BUFVFS]; /* holds last part of the result */
|
2019-04-24 20:01:20 +03:00
|
|
|
} BuffFS;
|
|
|
|
|
|
|
|
|
2019-04-26 17:24:39 +03:00
|
|
|
/*
|
2022-05-26 21:14:54 +03:00
|
|
|
** Push given string to the stack, as part of the result, and
|
|
|
|
** join it to previous partial result if there is one.
|
|
|
|
** It may call 'luaV_concat' while using one slot from EXTRA_STACK.
|
|
|
|
** This call cannot invoke metamethods, as both operands must be
|
|
|
|
** strings. It can, however, raise an error if the result is too
|
|
|
|
** long. In that case, 'luaV_concat' frees the extra slot before
|
|
|
|
** raising the error.
|
2019-04-26 17:24:39 +03:00
|
|
|
*/
|
2022-05-26 21:14:54 +03:00
|
|
|
static void pushstr (BuffFS *buff, const char *str, size_t lstr) {
|
2019-05-03 16:18:44 +03:00
|
|
|
lua_State *L = buff->L;
|
2022-10-29 18:06:37 +03:00
|
|
|
setsvalue2s(L, L->top.p, luaS_newlstr(L, str, lstr));
|
|
|
|
L->top.p++; /* may use one slot from EXTRA_STACK */
|
2022-05-26 21:14:54 +03:00
|
|
|
if (!buff->pushed) /* no previous string on the stack? */
|
|
|
|
buff->pushed = 1; /* now there is one */
|
|
|
|
else /* join previous string with new one */
|
|
|
|
luaV_concat(L, 2);
|
2002-05-07 21:36:56 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2019-04-24 20:01:20 +03:00
|
|
|
/*
|
2019-04-26 17:24:39 +03:00
|
|
|
** empty the buffer space into the stack
|
2019-04-24 20:01:20 +03:00
|
|
|
*/
|
2019-05-03 16:18:44 +03:00
|
|
|
static void clearbuff (BuffFS *buff) {
|
|
|
|
pushstr(buff, buff->space, buff->blen); /* push buffer contents */
|
2019-04-26 17:24:39 +03:00
|
|
|
buff->blen = 0; /* space now is empty */
|
2019-04-24 20:01:20 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
2019-04-26 17:24:39 +03:00
|
|
|
** Get a space of size 'sz' in the buffer. If buffer has not enough
|
2019-06-03 17:36:42 +03:00
|
|
|
** space, empty it. 'sz' must fit in an empty buffer.
|
2019-04-24 20:01:20 +03:00
|
|
|
*/
|
2024-07-27 19:32:59 +03:00
|
|
|
static char *getbuff (BuffFS *buff, unsigned sz) {
|
2019-04-26 17:24:39 +03:00
|
|
|
lua_assert(buff->blen <= BUFVFS); lua_assert(sz <= BUFVFS);
|
2019-06-03 17:36:42 +03:00
|
|
|
if (sz > BUFVFS - buff->blen) /* not enough space? */
|
2019-05-03 16:18:44 +03:00
|
|
|
clearbuff(buff);
|
2019-04-26 17:24:39 +03:00
|
|
|
return buff->space + buff->blen;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#define addsize(b,sz) ((b)->blen += (sz))
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
** Add 'str' to the buffer. If string is larger than the buffer space,
|
|
|
|
** push the string directly to the stack.
|
|
|
|
*/
|
2019-05-03 16:18:44 +03:00
|
|
|
static void addstr2buff (BuffFS *buff, const char *str, size_t slen) {
|
2019-04-26 17:24:39 +03:00
|
|
|
if (slen <= BUFVFS) { /* does string fit into buffer? */
|
2024-07-27 19:32:59 +03:00
|
|
|
char *bf = getbuff(buff, cast_uint(slen));
|
2019-04-26 17:24:39 +03:00
|
|
|
memcpy(bf, str, slen); /* add string to buffer */
|
2024-07-27 19:32:59 +03:00
|
|
|
addsize(buff, cast_uint(slen));
|
2019-04-26 17:24:39 +03:00
|
|
|
}
|
|
|
|
else { /* string larger than buffer */
|
2019-05-03 16:18:44 +03:00
|
|
|
clearbuff(buff); /* string comes after buffer's content */
|
|
|
|
pushstr(buff, str, slen); /* push string */
|
2019-04-24 20:01:20 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
2022-05-26 21:14:54 +03:00
|
|
|
** Add a numeral to the buffer.
|
2019-04-24 20:01:20 +03:00
|
|
|
*/
|
2019-05-03 16:18:44 +03:00
|
|
|
static void addnum2buff (BuffFS *buff, TValue *num) {
|
|
|
|
char *numbuff = getbuff(buff, MAXNUMBER2STR);
|
2024-07-27 19:32:59 +03:00
|
|
|
unsigned len = tostringbuff(num, numbuff); /* format number into 'numbuff' */
|
2019-04-26 17:24:39 +03:00
|
|
|
addsize(buff, len);
|
2019-04-24 20:01:20 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-12-14 14:53:27 +03:00
|
|
|
/*
|
2019-04-26 17:24:39 +03:00
|
|
|
** this function handles only '%d', '%c', '%f', '%p', '%s', and '%%'
|
2015-12-14 14:53:27 +03:00
|
|
|
conventional formats, plus Lua-specific '%I' and '%U'
|
|
|
|
*/
|
2002-05-16 22:39:46 +04:00
|
|
|
const char *luaO_pushvfstring (lua_State *L, const char *fmt, va_list argp) {
|
2019-04-24 20:01:20 +03:00
|
|
|
BuffFS buff; /* holds last part of the result */
|
|
|
|
const char *e; /* points to next '%' */
|
2024-07-27 19:32:59 +03:00
|
|
|
buff.pushed = 0; buff.blen = 0;
|
2019-05-03 16:18:44 +03:00
|
|
|
buff.L = L;
|
2018-04-25 19:26:20 +03:00
|
|
|
while ((e = strchr(fmt, '%')) != NULL) {
|
2024-07-27 19:32:59 +03:00
|
|
|
addstr2buff(&buff, fmt, ct_diff2sz(e - fmt)); /* add 'fmt' up to '%' */
|
2019-04-24 20:01:20 +03:00
|
|
|
switch (*(e + 1)) { /* conversion specifier */
|
2015-12-14 14:53:27 +03:00
|
|
|
case 's': { /* zero-terminated string */
|
2005-07-11 22:48:02 +04:00
|
|
|
const char *s = va_arg(argp, char *);
|
|
|
|
if (s == NULL) s = "(null)";
|
2019-05-03 16:18:44 +03:00
|
|
|
addstr2buff(&buff, s, strlen(s));
|
2002-05-07 21:36:56 +04:00
|
|
|
break;
|
2004-07-09 20:01:38 +04:00
|
|
|
}
|
2015-12-14 14:53:27 +03:00
|
|
|
case 'c': { /* an 'int' as a character */
|
2024-07-27 19:32:59 +03:00
|
|
|
char c = cast_char(va_arg(argp, int));
|
2019-05-03 16:18:44 +03:00
|
|
|
addstr2buff(&buff, &c, sizeof(char));
|
2002-05-07 21:36:56 +04:00
|
|
|
break;
|
|
|
|
}
|
2015-12-14 14:53:27 +03:00
|
|
|
case 'd': { /* an 'int' */
|
2019-04-24 20:01:20 +03:00
|
|
|
TValue num;
|
|
|
|
setivalue(&num, va_arg(argp, int));
|
2019-05-03 16:18:44 +03:00
|
|
|
addnum2buff(&buff, &num);
|
2019-04-24 20:01:20 +03:00
|
|
|
break;
|
2004-07-09 20:01:38 +04:00
|
|
|
}
|
2015-12-14 14:53:27 +03:00
|
|
|
case 'I': { /* a 'lua_Integer' */
|
2019-04-24 20:01:20 +03:00
|
|
|
TValue num;
|
|
|
|
setivalue(&num, cast(lua_Integer, va_arg(argp, l_uacInt)));
|
2019-05-03 16:18:44 +03:00
|
|
|
addnum2buff(&buff, &num);
|
2019-04-24 20:01:20 +03:00
|
|
|
break;
|
2013-04-25 17:53:13 +04:00
|
|
|
}
|
2015-12-14 14:53:27 +03:00
|
|
|
case 'f': { /* a 'lua_Number' */
|
2019-04-24 20:01:20 +03:00
|
|
|
TValue num;
|
|
|
|
setfltvalue(&num, cast_num(va_arg(argp, l_uacNumber)));
|
2019-05-03 16:18:44 +03:00
|
|
|
addnum2buff(&buff, &num);
|
2002-05-07 21:36:56 +04:00
|
|
|
break;
|
2004-07-09 20:01:38 +04:00
|
|
|
}
|
2015-12-14 14:53:27 +03:00
|
|
|
case 'p': { /* a pointer */
|
2024-07-27 19:32:59 +03:00
|
|
|
const unsigned sz = 3 * sizeof(void*) + 8; /* enough space for '%p' */
|
2019-05-03 16:18:44 +03:00
|
|
|
char *bf = getbuff(&buff, sz);
|
2017-04-19 19:34:35 +03:00
|
|
|
void *p = va_arg(argp, void *);
|
2019-05-03 16:18:44 +03:00
|
|
|
int len = lua_pointer2str(bf, sz, p);
|
2024-07-27 19:32:59 +03:00
|
|
|
addsize(&buff, cast_uint(len));
|
2004-07-09 20:01:38 +04:00
|
|
|
break;
|
|
|
|
}
|
2024-07-27 19:32:59 +03:00
|
|
|
case 'U': { /* an 'unsigned long' as a UTF-8 sequence */
|
2019-04-24 20:01:20 +03:00
|
|
|
char bf[UTF8BUFFSZ];
|
2024-07-27 19:32:59 +03:00
|
|
|
int len = luaO_utf8esc(bf, va_arg(argp, unsigned long));
|
|
|
|
addstr2buff(&buff, bf + UTF8BUFFSZ - len, cast_uint(len));
|
2014-02-06 19:59:24 +04:00
|
|
|
break;
|
|
|
|
}
|
2004-07-09 20:01:38 +04:00
|
|
|
case '%': {
|
2019-05-03 16:18:44 +03:00
|
|
|
addstr2buff(&buff, "%", 1);
|
2002-05-07 21:36:56 +04:00
|
|
|
break;
|
2004-07-09 20:01:38 +04:00
|
|
|
}
|
2003-06-10 16:36:26 +04:00
|
|
|
default: {
|
2014-10-17 20:28:21 +04:00
|
|
|
luaG_runerror(L, "invalid option '%%%c' to 'lua_pushfstring'",
|
|
|
|
*(e + 1));
|
2003-06-10 16:36:26 +04:00
|
|
|
}
|
2002-05-07 21:36:56 +04:00
|
|
|
}
|
2019-04-24 20:01:20 +03:00
|
|
|
fmt = e + 2; /* skip '%' and the specifier */
|
2002-05-07 21:36:56 +04:00
|
|
|
}
|
2019-05-03 16:18:44 +03:00
|
|
|
addstr2buff(&buff, fmt, strlen(fmt)); /* rest of 'fmt' */
|
|
|
|
clearbuff(&buff); /* empty buffer into the stack */
|
2020-07-03 17:36:56 +03:00
|
|
|
lua_assert(buff.pushed == 1);
|
2023-08-17 21:59:28 +03:00
|
|
|
return getstr(tsvalue(s2v(L->top.p - 1)));
|
2002-05-07 21:36:56 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-05-16 22:39:46 +04:00
|
|
|
const char *luaO_pushfstring (lua_State *L, const char *fmt, ...) {
|
2002-05-07 21:36:56 +04:00
|
|
|
const char *msg;
|
|
|
|
va_list argp;
|
|
|
|
va_start(argp, fmt);
|
2002-05-16 22:39:46 +04:00
|
|
|
msg = luaO_pushvfstring(L, fmt, argp);
|
2002-05-07 21:36:56 +04:00
|
|
|
va_end(argp);
|
|
|
|
return msg;
|
|
|
|
}
|
|
|
|
|
2019-05-03 16:18:44 +03:00
|
|
|
/* }================================================================== */
|
|
|
|
|
2002-05-07 21:36:56 +04:00
|
|
|
|
2007-11-09 21:54:25 +03:00
|
|
|
#define RETS "..."
|
|
|
|
#define PRE "[string \""
|
|
|
|
#define POS "\"]"
|
|
|
|
|
2011-05-03 20:01:57 +04:00
|
|
|
#define addstr(a,b,l) ( memcpy(a,b,(l) * sizeof(char)), a += (l) )
|
2007-11-09 21:54:25 +03:00
|
|
|
|
2019-04-04 17:45:26 +03:00
|
|
|
void luaO_chunkid (char *out, const char *source, size_t srclen) {
|
|
|
|
size_t bufflen = LUA_IDSIZE; /* free space in buffer */
|
2007-11-09 21:54:25 +03:00
|
|
|
if (*source == '=') { /* 'literal' source */
|
2019-04-04 17:45:26 +03:00
|
|
|
if (srclen <= bufflen) /* small enough? */
|
|
|
|
memcpy(out, source + 1, srclen * sizeof(char));
|
2007-11-09 21:54:25 +03:00
|
|
|
else { /* truncate it */
|
|
|
|
addstr(out, source + 1, bufflen - 1);
|
|
|
|
*out = '\0';
|
|
|
|
}
|
2000-10-20 20:36:32 +04:00
|
|
|
}
|
2007-11-09 21:54:25 +03:00
|
|
|
else if (*source == '@') { /* file name */
|
2019-04-04 17:45:26 +03:00
|
|
|
if (srclen <= bufflen) /* small enough? */
|
|
|
|
memcpy(out, source + 1, srclen * sizeof(char));
|
2007-11-09 21:54:25 +03:00
|
|
|
else { /* add '...' before rest of name */
|
|
|
|
addstr(out, RETS, LL(RETS));
|
|
|
|
bufflen -= LL(RETS);
|
2019-04-04 17:45:26 +03:00
|
|
|
memcpy(out, source + 1 + srclen - bufflen, bufflen * sizeof(char));
|
2000-10-09 17:47:32 +04:00
|
|
|
}
|
2007-11-09 21:54:25 +03:00
|
|
|
}
|
|
|
|
else { /* string; format as [string "source"] */
|
|
|
|
const char *nl = strchr(source, '\n'); /* find first new line (if any) */
|
|
|
|
addstr(out, PRE, LL(PRE)); /* add prefix */
|
2010-10-29 19:54:55 +04:00
|
|
|
bufflen -= LL(PRE RETS POS) + 1; /* save space for prefix+suffix+'\0' */
|
2019-04-04 17:45:26 +03:00
|
|
|
if (srclen < bufflen && nl == NULL) { /* small one-line source? */
|
|
|
|
addstr(out, source, srclen); /* keep it */
|
2007-11-09 21:54:25 +03:00
|
|
|
}
|
|
|
|
else {
|
2024-07-27 19:32:59 +03:00
|
|
|
if (nl != NULL)
|
|
|
|
srclen = ct_diff2sz(nl - source); /* stop at first newline */
|
2019-04-04 17:45:26 +03:00
|
|
|
if (srclen > bufflen) srclen = bufflen;
|
|
|
|
addstr(out, source, srclen);
|
2007-11-09 21:54:25 +03:00
|
|
|
addstr(out, RETS, LL(RETS));
|
2000-09-12 00:29:27 +04:00
|
|
|
}
|
2011-05-03 20:01:57 +04:00
|
|
|
memcpy(out, POS, (LL(POS) + 1) * sizeof(char));
|
2000-09-12 00:29:27 +04:00
|
|
|
}
|
|
|
|
}
|
2011-05-03 20:01:57 +04:00
|
|
|
|