lobject.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663
  1. /*
  2. ** $Id: lobject.c $
  3. ** Some generic functions over Lua objects
  4. ** See Copyright Notice in lua.h
  5. */
  6. #define lobject_c
  7. #define LUA_CORE
  8. #include "lprefix.h"
  9. #include <locale.h>
  10. #include <math.h>
  11. #include <stdarg.h>
  12. #include <stdio.h>
  13. #include <stdlib.h>
  14. #include <string.h>
  15. #include "lua.h"
  16. #include "lctype.h"
  17. #include "ldebug.h"
  18. #include "ldo.h"
  19. #include "lmem.h"
  20. #include "lobject.h"
  21. #include "lstate.h"
  22. #include "lstring.h"
  23. #include "lvm.h"
  24. /*
  25. ** Computes ceil(log2(x))
  26. */
  27. lu_byte luaO_ceillog2 (unsigned int x) {
  28. static const lu_byte log_2[256] = { /* log_2[i - 1] = ceil(log2(i)) */
  29. 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,
  30. 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,
  31. 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,
  32. 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,
  33. 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,
  34. 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,
  35. 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,
  36. 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
  37. };
  38. int l = 0;
  39. x--;
  40. while (x >= 256) { l += 8; x >>= 8; }
  41. return cast_byte(l + log_2[x]);
  42. }
  43. /*
  44. ** Encodes 'p'% as a floating-point byte, represented as (eeeexxxx).
  45. ** The exponent is represented using excess-7. Mimicking IEEE 754, the
  46. ** representation normalizes the number when possible, assuming an extra
  47. ** 1 before the mantissa (xxxx) and adding one to the exponent (eeee)
  48. ** to signal that. So, the real value is (1xxxx) * 2^(eeee - 7 - 1) if
  49. ** eeee != 0, and (xxxx) * 2^-7 otherwise (subnormal numbers).
  50. */
  51. lu_byte luaO_codeparam (unsigned int p) {
  52. if (p >= (cast(lu_mem, 0x1F) << (0xF - 7 - 1)) * 100u) /* overflow? */
  53. return 0xFF; /* return maximum value */
  54. else {
  55. p = (cast(l_uint32, p) * 128 + 99) / 100; /* round up the division */
  56. if (p < 0x10) { /* subnormal number? */
  57. /* exponent bits are already zero; nothing else to do */
  58. return cast_byte(p);
  59. }
  60. else { /* p >= 0x10 implies ceil(log2(p + 1)) >= 5 */
  61. /* preserve 5 bits in 'p' */
  62. unsigned log = luaO_ceillog2(p + 1) - 5u;
  63. return cast_byte(((p >> log) - 0x10) | ((log + 1) << 4));
  64. }
  65. }
  66. }
  67. /*
  68. ** Computes 'p' times 'x', where 'p' is a floating-point byte. Roughly,
  69. ** we have to multiply 'x' by the mantissa and then shift accordingly to
  70. ** the exponent. If the exponent is positive, both the multiplication
  71. ** and the shift increase 'x', so we have to care only about overflows.
  72. ** For negative exponents, however, multiplying before the shift keeps
  73. ** more significant bits, as long as the multiplication does not
  74. ** overflow, so we check which order is best.
  75. */
  76. l_obj luaO_applyparam (lu_byte p, l_obj x) {
  77. unsigned int m = p & 0xF; /* mantissa */
  78. int e = (p >> 4); /* exponent */
  79. if (e > 0) { /* normalized? */
  80. e--; /* correct exponent */
  81. m += 0x10; /* correct mantissa; maximum value is 0x1F */
  82. }
  83. e -= 7; /* correct excess-7 */
  84. if (e >= 0) {
  85. if (x < (MAX_LOBJ / 0x1F) >> e) /* no overflow? */
  86. return (x * m) << e; /* order doesn't matter here */
  87. else /* real overflow */
  88. return MAX_LOBJ;
  89. }
  90. else { /* negative exponent */
  91. e = -e;
  92. if (x < MAX_LOBJ / 0x1F) /* multiplication cannot overflow? */
  93. return (x * m) >> e; /* multiplying first gives more precision */
  94. else if ((x >> e) < MAX_LOBJ / 0x1F) /* cannot overflow after shift? */
  95. return (x >> e) * m;
  96. else /* real overflow */
  97. return MAX_LOBJ;
  98. }
  99. }
  100. static lua_Integer intarith (lua_State *L, int op, lua_Integer v1,
  101. lua_Integer v2) {
  102. switch (op) {
  103. case LUA_OPADD: return intop(+, v1, v2);
  104. case LUA_OPSUB:return intop(-, v1, v2);
  105. case LUA_OPMUL:return intop(*, v1, v2);
  106. case LUA_OPMOD: return luaV_mod(L, v1, v2);
  107. case LUA_OPIDIV: return luaV_idiv(L, v1, v2);
  108. case LUA_OPBAND: return intop(&, v1, v2);
  109. case LUA_OPBOR: return intop(|, v1, v2);
  110. case LUA_OPBXOR: return intop(^, v1, v2);
  111. case LUA_OPSHL: return luaV_shiftl(v1, v2);
  112. case LUA_OPSHR: return luaV_shiftr(v1, v2);
  113. case LUA_OPUNM: return intop(-, 0, v1);
  114. case LUA_OPBNOT: return intop(^, ~l_castS2U(0), v1);
  115. default: lua_assert(0); return 0;
  116. }
  117. }
  118. static lua_Number numarith (lua_State *L, int op, lua_Number v1,
  119. lua_Number v2) {
  120. switch (op) {
  121. case LUA_OPADD: return luai_numadd(L, v1, v2);
  122. case LUA_OPSUB: return luai_numsub(L, v1, v2);
  123. case LUA_OPMUL: return luai_nummul(L, v1, v2);
  124. case LUA_OPDIV: return luai_numdiv(L, v1, v2);
  125. case LUA_OPPOW: return luai_numpow(L, v1, v2);
  126. case LUA_OPIDIV: return luai_numidiv(L, v1, v2);
  127. case LUA_OPUNM: return luai_numunm(L, v1);
  128. case LUA_OPMOD: return luaV_modf(L, v1, v2);
  129. default: lua_assert(0); return 0;
  130. }
  131. }
  132. int luaO_rawarith (lua_State *L, int op, const TValue *p1, const TValue *p2,
  133. TValue *res) {
  134. switch (op) {
  135. case LUA_OPBAND: case LUA_OPBOR: case LUA_OPBXOR:
  136. case LUA_OPSHL: case LUA_OPSHR:
  137. case LUA_OPBNOT: { /* operate only on integers */
  138. lua_Integer i1; lua_Integer i2;
  139. if (tointegerns(p1, &i1) && tointegerns(p2, &i2)) {
  140. setivalue(res, intarith(L, op, i1, i2));
  141. return 1;
  142. }
  143. else return 0; /* fail */
  144. }
  145. case LUA_OPDIV: case LUA_OPPOW: { /* operate only on floats */
  146. lua_Number n1; lua_Number n2;
  147. if (tonumberns(p1, n1) && tonumberns(p2, n2)) {
  148. setfltvalue(res, numarith(L, op, n1, n2));
  149. return 1;
  150. }
  151. else return 0; /* fail */
  152. }
  153. default: { /* other operations */
  154. lua_Number n1; lua_Number n2;
  155. if (ttisinteger(p1) && ttisinteger(p2)) {
  156. setivalue(res, intarith(L, op, ivalue(p1), ivalue(p2)));
  157. return 1;
  158. }
  159. else if (tonumberns(p1, n1) && tonumberns(p2, n2)) {
  160. setfltvalue(res, numarith(L, op, n1, n2));
  161. return 1;
  162. }
  163. else return 0; /* fail */
  164. }
  165. }
  166. }
  167. void luaO_arith (lua_State *L, int op, const TValue *p1, const TValue *p2,
  168. StkId res) {
  169. if (!luaO_rawarith(L, op, p1, p2, s2v(res))) {
  170. /* could not perform raw operation; try metamethod */
  171. luaT_trybinTM(L, p1, p2, res, cast(TMS, (op - LUA_OPADD) + TM_ADD));
  172. }
  173. }
  174. lu_byte luaO_hexavalue (int c) {
  175. if (lisdigit(c)) return cast_byte(c - '0');
  176. else return cast_byte((ltolower(c) - 'a') + 10);
  177. }
  178. static int isneg (const char **s) {
  179. if (**s == '-') { (*s)++; return 1; }
  180. else if (**s == '+') (*s)++;
  181. return 0;
  182. }
  183. /*
  184. ** {==================================================================
  185. ** Lua's implementation for 'lua_strx2number'
  186. ** ===================================================================
  187. */
  188. #if !defined(lua_strx2number)
  189. /* maximum number of significant digits to read (to avoid overflows
  190. even with single floats) */
  191. #define MAXSIGDIG 30
  192. /*
  193. ** convert a hexadecimal numeric string to a number, following
  194. ** C99 specification for 'strtod'
  195. */
  196. static lua_Number lua_strx2number (const char *s, char **endptr) {
  197. int dot = lua_getlocaledecpoint();
  198. lua_Number r = l_mathop(0.0); /* result (accumulator) */
  199. int sigdig = 0; /* number of significant digits */
  200. int nosigdig = 0; /* number of non-significant digits */
  201. int e = 0; /* exponent correction */
  202. int neg; /* 1 if number is negative */
  203. int hasdot = 0; /* true after seen a dot */
  204. *endptr = cast_charp(s); /* nothing is valid yet */
  205. while (lisspace(cast_uchar(*s))) s++; /* skip initial spaces */
  206. neg = isneg(&s); /* check sign */
  207. if (!(*s == '0' && (*(s + 1) == 'x' || *(s + 1) == 'X'))) /* check '0x' */
  208. return l_mathop(0.0); /* invalid format (no '0x') */
  209. for (s += 2; ; s++) { /* skip '0x' and read numeral */
  210. if (*s == dot) {
  211. if (hasdot) break; /* second dot? stop loop */
  212. else hasdot = 1;
  213. }
  214. else if (lisxdigit(cast_uchar(*s))) {
  215. if (sigdig == 0 && *s == '0') /* non-significant digit (zero)? */
  216. nosigdig++;
  217. else if (++sigdig <= MAXSIGDIG) /* can read it without overflow? */
  218. r = (r * l_mathop(16.0)) + luaO_hexavalue(*s);
  219. else e++; /* too many digits; ignore, but still count for exponent */
  220. if (hasdot) e--; /* decimal digit? correct exponent */
  221. }
  222. else break; /* neither a dot nor a digit */
  223. }
  224. if (nosigdig + sigdig == 0) /* no digits? */
  225. return l_mathop(0.0); /* invalid format */
  226. *endptr = cast_charp(s); /* valid up to here */
  227. e *= 4; /* each digit multiplies/divides value by 2^4 */
  228. if (*s == 'p' || *s == 'P') { /* exponent part? */
  229. int exp1 = 0; /* exponent value */
  230. int neg1; /* exponent sign */
  231. s++; /* skip 'p' */
  232. neg1 = isneg(&s); /* sign */
  233. if (!lisdigit(cast_uchar(*s)))
  234. return l_mathop(0.0); /* invalid; must have at least one digit */
  235. while (lisdigit(cast_uchar(*s))) /* read exponent */
  236. exp1 = exp1 * 10 + *(s++) - '0';
  237. if (neg1) exp1 = -exp1;
  238. e += exp1;
  239. *endptr = cast_charp(s); /* valid up to here */
  240. }
  241. if (neg) r = -r;
  242. return l_mathop(ldexp)(r, e);
  243. }
  244. #endif
  245. /* }====================================================== */
  246. /* maximum length of a numeral to be converted to a number */
  247. #if !defined (L_MAXLENNUM)
  248. #define L_MAXLENNUM 200
  249. #endif
  250. /*
  251. ** Convert string 's' to a Lua number (put in 'result'). Return NULL on
  252. ** fail or the address of the ending '\0' on success. ('mode' == 'x')
  253. ** means a hexadecimal numeral.
  254. */
  255. static const char *l_str2dloc (const char *s, lua_Number *result, int mode) {
  256. char *endptr;
  257. *result = (mode == 'x') ? lua_strx2number(s, &endptr) /* try to convert */
  258. : lua_str2number(s, &endptr);
  259. if (endptr == s) return NULL; /* nothing recognized? */
  260. while (lisspace(cast_uchar(*endptr))) endptr++; /* skip trailing spaces */
  261. return (*endptr == '\0') ? endptr : NULL; /* OK iff no trailing chars */
  262. }
  263. /*
  264. ** Convert string 's' to a Lua number (put in 'result') handling the
  265. ** current locale.
  266. ** This function accepts both the current locale or a dot as the radix
  267. ** mark. If the conversion fails, it may mean number has a dot but
  268. ** locale accepts something else. In that case, the code copies 's'
  269. ** to a buffer (because 's' is read-only), changes the dot to the
  270. ** current locale radix mark, and tries to convert again.
  271. ** The variable 'mode' checks for special characters in the string:
  272. ** - 'n' means 'inf' or 'nan' (which should be rejected)
  273. ** - 'x' means a hexadecimal numeral
  274. ** - '.' just optimizes the search for the common case (no special chars)
  275. */
  276. static const char *l_str2d (const char *s, lua_Number *result) {
  277. const char *endptr;
  278. const char *pmode = strpbrk(s, ".xXnN"); /* look for special chars */
  279. int mode = pmode ? ltolower(cast_uchar(*pmode)) : 0;
  280. if (mode == 'n') /* reject 'inf' and 'nan' */
  281. return NULL;
  282. endptr = l_str2dloc(s, result, mode); /* try to convert */
  283. if (endptr == NULL) { /* failed? may be a different locale */
  284. char buff[L_MAXLENNUM + 1];
  285. const char *pdot = strchr(s, '.');
  286. if (pdot == NULL || strlen(s) > L_MAXLENNUM)
  287. return NULL; /* string too long or no dot; fail */
  288. strcpy(buff, s); /* copy string to buffer */
  289. buff[pdot - s] = lua_getlocaledecpoint(); /* correct decimal point */
  290. endptr = l_str2dloc(buff, result, mode); /* try again */
  291. if (endptr != NULL)
  292. endptr = s + (endptr - buff); /* make relative to 's' */
  293. }
  294. return endptr;
  295. }
  296. #define MAXBY10 cast(lua_Unsigned, LUA_MAXINTEGER / 10)
  297. #define MAXLASTD cast_int(LUA_MAXINTEGER % 10)
  298. static const char *l_str2int (const char *s, lua_Integer *result) {
  299. lua_Unsigned a = 0;
  300. int empty = 1;
  301. int neg;
  302. while (lisspace(cast_uchar(*s))) s++; /* skip initial spaces */
  303. neg = isneg(&s);
  304. if (s[0] == '0' &&
  305. (s[1] == 'x' || s[1] == 'X')) { /* hex? */
  306. s += 2; /* skip '0x' */
  307. for (; lisxdigit(cast_uchar(*s)); s++) {
  308. a = a * 16 + luaO_hexavalue(*s);
  309. empty = 0;
  310. }
  311. }
  312. else { /* decimal */
  313. for (; lisdigit(cast_uchar(*s)); s++) {
  314. int d = *s - '0';
  315. if (a >= MAXBY10 && (a > MAXBY10 || d > MAXLASTD + neg)) /* overflow? */
  316. return NULL; /* do not accept it (as integer) */
  317. a = a * 10 + cast_uint(d);
  318. empty = 0;
  319. }
  320. }
  321. while (lisspace(cast_uchar(*s))) s++; /* skip trailing spaces */
  322. if (empty || *s != '\0') return NULL; /* something wrong in the numeral */
  323. else {
  324. *result = l_castU2S((neg) ? 0u - a : a);
  325. return s;
  326. }
  327. }
  328. size_t luaO_str2num (const char *s, TValue *o) {
  329. lua_Integer i; lua_Number n;
  330. const char *e;
  331. if ((e = l_str2int(s, &i)) != NULL) { /* try as an integer */
  332. setivalue(o, i);
  333. }
  334. else if ((e = l_str2d(s, &n)) != NULL) { /* else try as a float */
  335. setfltvalue(o, n);
  336. }
  337. else
  338. return 0; /* conversion failed */
  339. return ct_diff2sz(e - s) + 1; /* success; return string size */
  340. }
  341. int luaO_utf8esc (char *buff, unsigned long x) {
  342. int n = 1; /* number of bytes put in buffer (backwards) */
  343. lua_assert(x <= 0x7FFFFFFFu);
  344. if (x < 0x80) /* ascii? */
  345. buff[UTF8BUFFSZ - 1] = cast_char(x);
  346. else { /* need continuation bytes */
  347. unsigned int mfb = 0x3f; /* maximum that fits in first byte */
  348. do { /* add continuation bytes */
  349. buff[UTF8BUFFSZ - (n++)] = cast_char(0x80 | (x & 0x3f));
  350. x >>= 6; /* remove added bits */
  351. mfb >>= 1; /* now there is one less bit available in first byte */
  352. } while (x > mfb); /* still needs continuation byte? */
  353. buff[UTF8BUFFSZ - n] = cast_char((~mfb << 1) | x); /* add first byte */
  354. }
  355. return n;
  356. }
  357. /*
  358. ** Maximum length of the conversion of a number to a string. Must be
  359. ** enough to accommodate both LUA_INTEGER_FMT and LUA_NUMBER_FMT.
  360. ** (For a long long int, this is 19 digits plus a sign and a final '\0',
  361. ** adding to 21. For a long double, it can go to a sign, 33 digits,
  362. ** the dot, an exponent letter, an exponent sign, 5 exponent digits,
  363. ** and a final '\0', adding to 43.)
  364. */
  365. #define MAXNUMBER2STR 44
  366. /*
  367. ** Convert a number object to a string, adding it to a buffer
  368. */
  369. static unsigned tostringbuff (TValue *obj, char *buff) {
  370. int len;
  371. lua_assert(ttisnumber(obj));
  372. if (ttisinteger(obj))
  373. len = lua_integer2str(buff, MAXNUMBER2STR, ivalue(obj));
  374. else {
  375. len = lua_number2str(buff, MAXNUMBER2STR, fltvalue(obj));
  376. if (buff[strspn(buff, "-0123456789")] == '\0') { /* looks like an int? */
  377. buff[len++] = lua_getlocaledecpoint();
  378. buff[len++] = '0'; /* adds '.0' to result */
  379. }
  380. }
  381. return cast_uint(len);
  382. }
  383. /*
  384. ** Convert a number object to a Lua string, replacing the value at 'obj'
  385. */
  386. void luaO_tostring (lua_State *L, TValue *obj) {
  387. char buff[MAXNUMBER2STR];
  388. unsigned len = tostringbuff(obj, buff);
  389. setsvalue(L, obj, luaS_newlstr(L, buff, len));
  390. }
  391. /*
  392. ** {==================================================================
  393. ** 'luaO_pushvfstring'
  394. ** ===================================================================
  395. */
  396. /*
  397. ** Size for buffer space used by 'luaO_pushvfstring'. It should be
  398. ** (LUA_IDSIZE + MAXNUMBER2STR) + a minimal space for basic messages,
  399. ** so that 'luaG_addinfo' can work directly on the buffer.
  400. */
  401. #define BUFVFS cast_uint(LUA_IDSIZE + MAXNUMBER2STR + 95)
  402. /* buffer used by 'luaO_pushvfstring' */
  403. typedef struct BuffFS {
  404. lua_State *L;
  405. int pushed; /* true if there is a part of the result on the stack */
  406. unsigned blen; /* length of partial string in 'space' */
  407. char space[BUFVFS]; /* holds last part of the result */
  408. } BuffFS;
  409. /*
  410. ** Push given string to the stack, as part of the result, and
  411. ** join it to previous partial result if there is one.
  412. ** It may call 'luaV_concat' while using one slot from EXTRA_STACK.
  413. ** This call cannot invoke metamethods, as both operands must be
  414. ** strings. It can, however, raise an error if the result is too
  415. ** long. In that case, 'luaV_concat' frees the extra slot before
  416. ** raising the error.
  417. */
  418. static void pushstr (BuffFS *buff, const char *str, size_t lstr) {
  419. lua_State *L = buff->L;
  420. setsvalue2s(L, L->top.p, luaS_newlstr(L, str, lstr));
  421. L->top.p++; /* may use one slot from EXTRA_STACK */
  422. if (!buff->pushed) /* no previous string on the stack? */
  423. buff->pushed = 1; /* now there is one */
  424. else /* join previous string with new one */
  425. luaV_concat(L, 2);
  426. }
  427. /*
  428. ** empty the buffer space into the stack
  429. */
  430. static void clearbuff (BuffFS *buff) {
  431. pushstr(buff, buff->space, buff->blen); /* push buffer contents */
  432. buff->blen = 0; /* space now is empty */
  433. }
  434. /*
  435. ** Get a space of size 'sz' in the buffer. If buffer has not enough
  436. ** space, empty it. 'sz' must fit in an empty buffer.
  437. */
  438. static char *getbuff (BuffFS *buff, unsigned sz) {
  439. lua_assert(buff->blen <= BUFVFS); lua_assert(sz <= BUFVFS);
  440. if (sz > BUFVFS - buff->blen) /* not enough space? */
  441. clearbuff(buff);
  442. return buff->space + buff->blen;
  443. }
  444. #define addsize(b,sz) ((b)->blen += (sz))
  445. /*
  446. ** Add 'str' to the buffer. If string is larger than the buffer space,
  447. ** push the string directly to the stack.
  448. */
  449. static void addstr2buff (BuffFS *buff, const char *str, size_t slen) {
  450. if (slen <= BUFVFS) { /* does string fit into buffer? */
  451. char *bf = getbuff(buff, cast_uint(slen));
  452. memcpy(bf, str, slen); /* add string to buffer */
  453. addsize(buff, cast_uint(slen));
  454. }
  455. else { /* string larger than buffer */
  456. clearbuff(buff); /* string comes after buffer's content */
  457. pushstr(buff, str, slen); /* push string */
  458. }
  459. }
  460. /*
  461. ** Add a numeral to the buffer.
  462. */
  463. static void addnum2buff (BuffFS *buff, TValue *num) {
  464. char *numbuff = getbuff(buff, MAXNUMBER2STR);
  465. unsigned len = tostringbuff(num, numbuff); /* format number into 'numbuff' */
  466. addsize(buff, len);
  467. }
  468. /*
  469. ** this function handles only '%d', '%c', '%f', '%p', '%s', and '%%'
  470. conventional formats, plus Lua-specific '%I' and '%U'
  471. */
  472. const char *luaO_pushvfstring (lua_State *L, const char *fmt, va_list argp) {
  473. BuffFS buff; /* holds last part of the result */
  474. const char *e; /* points to next '%' */
  475. buff.pushed = 0; buff.blen = 0;
  476. buff.L = L;
  477. while ((e = strchr(fmt, '%')) != NULL) {
  478. addstr2buff(&buff, fmt, ct_diff2sz(e - fmt)); /* add 'fmt' up to '%' */
  479. switch (*(e + 1)) { /* conversion specifier */
  480. case 's': { /* zero-terminated string */
  481. const char *s = va_arg(argp, char *);
  482. if (s == NULL) s = "(null)";
  483. addstr2buff(&buff, s, strlen(s));
  484. break;
  485. }
  486. case 'c': { /* an 'int' as a character */
  487. char c = cast_char(va_arg(argp, int));
  488. addstr2buff(&buff, &c, sizeof(char));
  489. break;
  490. }
  491. case 'd': { /* an 'int' */
  492. TValue num;
  493. setivalue(&num, va_arg(argp, int));
  494. addnum2buff(&buff, &num);
  495. break;
  496. }
  497. case 'I': { /* a 'lua_Integer' */
  498. TValue num;
  499. setivalue(&num, cast(lua_Integer, va_arg(argp, l_uacInt)));
  500. addnum2buff(&buff, &num);
  501. break;
  502. }
  503. case 'f': { /* a 'lua_Number' */
  504. TValue num;
  505. setfltvalue(&num, cast_num(va_arg(argp, l_uacNumber)));
  506. addnum2buff(&buff, &num);
  507. break;
  508. }
  509. case 'p': { /* a pointer */
  510. const unsigned sz = 3 * sizeof(void*) + 8; /* enough space for '%p' */
  511. char *bf = getbuff(&buff, sz);
  512. void *p = va_arg(argp, void *);
  513. int len = lua_pointer2str(bf, sz, p);
  514. addsize(&buff, cast_uint(len));
  515. break;
  516. }
  517. case 'U': { /* an 'unsigned long' as a UTF-8 sequence */
  518. char bf[UTF8BUFFSZ];
  519. int len = luaO_utf8esc(bf, va_arg(argp, unsigned long));
  520. addstr2buff(&buff, bf + UTF8BUFFSZ - len, cast_uint(len));
  521. break;
  522. }
  523. case '%': {
  524. addstr2buff(&buff, "%", 1);
  525. break;
  526. }
  527. default: {
  528. luaG_runerror(L, "invalid option '%%%c' to 'lua_pushfstring'",
  529. *(e + 1));
  530. }
  531. }
  532. fmt = e + 2; /* skip '%' and the specifier */
  533. }
  534. addstr2buff(&buff, fmt, strlen(fmt)); /* rest of 'fmt' */
  535. clearbuff(&buff); /* empty buffer into the stack */
  536. lua_assert(buff.pushed == 1);
  537. return getstr(tsvalue(s2v(L->top.p - 1)));
  538. }
  539. const char *luaO_pushfstring (lua_State *L, const char *fmt, ...) {
  540. const char *msg;
  541. va_list argp;
  542. va_start(argp, fmt);
  543. msg = luaO_pushvfstring(L, fmt, argp);
  544. va_end(argp);
  545. return msg;
  546. }
  547. /* }================================================================== */
  548. #define RETS "..."
  549. #define PRE "[string \""
  550. #define POS "\"]"
  551. #define addstr(a,b,l) ( memcpy(a,b,(l) * sizeof(char)), a += (l) )
  552. void luaO_chunkid (char *out, const char *source, size_t srclen) {
  553. size_t bufflen = LUA_IDSIZE; /* free space in buffer */
  554. if (*source == '=') { /* 'literal' source */
  555. if (srclen <= bufflen) /* small enough? */
  556. memcpy(out, source + 1, srclen * sizeof(char));
  557. else { /* truncate it */
  558. addstr(out, source + 1, bufflen - 1);
  559. *out = '\0';
  560. }
  561. }
  562. else if (*source == '@') { /* file name */
  563. if (srclen <= bufflen) /* small enough? */
  564. memcpy(out, source + 1, srclen * sizeof(char));
  565. else { /* add '...' before rest of name */
  566. addstr(out, RETS, LL(RETS));
  567. bufflen -= LL(RETS);
  568. memcpy(out, source + 1 + srclen - bufflen, bufflen * sizeof(char));
  569. }
  570. }
  571. else { /* string; format as [string "source"] */
  572. const char *nl = strchr(source, '\n'); /* find first new line (if any) */
  573. addstr(out, PRE, LL(PRE)); /* add prefix */
  574. bufflen -= LL(PRE RETS POS) + 1; /* save space for prefix+suffix+'\0' */
  575. if (srclen < bufflen && nl == NULL) { /* small one-line source? */
  576. addstr(out, source, srclen); /* keep it */
  577. }
  578. else {
  579. if (nl != NULL)
  580. srclen = ct_diff2sz(nl - source); /* stop at first newline */
  581. if (srclen > bufflen) srclen = bufflen;
  582. addstr(out, source, srclen);
  583. addstr(out, RETS, LL(RETS));
  584. }
  585. memcpy(out, POS, (LL(POS) + 1) * sizeof(char));
  586. }
  587. }