lobject.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442
  1. /*
  2. ** $Id: lobject.c,v 2.79 2014/04/15 14:28:20 roberto Exp roberto $
  3. ** Some generic functions over Lua objects
  4. ** See Copyright Notice in lua.h
  5. */
  6. #include <stdarg.h>
  7. #include <stdio.h>
  8. #include <stdlib.h>
  9. #include <string.h>
  10. #define lobject_c
  11. #define LUA_CORE
  12. #include "lua.h"
  13. #include "lctype.h"
  14. #include "ldebug.h"
  15. #include "ldo.h"
  16. #include "lmem.h"
  17. #include "lobject.h"
  18. #include "lstate.h"
  19. #include "lstring.h"
  20. #include "lvm.h"
  21. LUAI_DDEF const TValue luaO_nilobject_ = {NILCONSTANT};
  22. /*
  23. ** converts an integer to a "floating point byte", represented as
  24. ** (eeeeexxx), where the real value is (1xxx) * 2^(eeeee - 1) if
  25. ** eeeee != 0 and (xxx) otherwise.
  26. */
  27. int luaO_int2fb (unsigned int x) {
  28. int e = 0; /* exponent */
  29. if (x < 8) return x;
  30. while (x >= 0x10) {
  31. x = (x+1) >> 1;
  32. e++;
  33. }
  34. return ((e+1) << 3) | (cast_int(x) - 8);
  35. }
  36. /* converts back */
  37. int luaO_fb2int (int x) {
  38. int e = (x >> 3) & 0x1f;
  39. if (e == 0) return x;
  40. else return ((x & 7) + 8) << (e - 1);
  41. }
  42. int luaO_ceillog2 (unsigned int x) {
  43. static const lu_byte log_2[256] = {
  44. 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,
  45. 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,
  46. 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,
  47. 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,
  48. 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,
  49. 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,
  50. 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,
  51. 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
  52. };
  53. int l = 0;
  54. x--;
  55. while (x >= 256) { l += 8; x >>= 8; }
  56. return l + log_2[x];
  57. }
  58. static lua_Integer intarith (lua_State *L, int op, lua_Integer v1,
  59. lua_Integer v2) {
  60. switch (op) {
  61. case LUA_OPADD: return intop(+, v1, v2);
  62. case LUA_OPSUB:return intop(-, v1, v2);
  63. case LUA_OPMUL:return intop(*, v1, v2);
  64. case LUA_OPMOD: return luaV_mod(L, v1, v2);
  65. case LUA_OPPOW: return luaV_pow(L, v1, v2);
  66. case LUA_OPIDIV: return luaV_div(L, v1, v2);
  67. case LUA_OPBAND: return intop(&, v1, v2);
  68. case LUA_OPBOR: return intop(|, v1, v2);
  69. case LUA_OPBXOR: return intop(^, v1, v2);
  70. case LUA_OPSHL: return luaV_shiftl(v1, v2);
  71. case LUA_OPSHR: return luaV_shiftl(v1, -v2);
  72. case LUA_OPUNM: return intop(-, 0, v1);
  73. case LUA_OPBNOT: return intop(^, ~l_castS2U(0), v1);
  74. default: lua_assert(0); return 0;
  75. }
  76. }
  77. static lua_Number numarith (lua_State *L, int op, lua_Number v1,
  78. lua_Number v2) {
  79. switch (op) {
  80. case LUA_OPADD: return luai_numadd(L, v1, v2);
  81. case LUA_OPSUB: return luai_numsub(L, v1, v2);
  82. case LUA_OPMUL: return luai_nummul(L, v1, v2);
  83. case LUA_OPDIV: return luai_numdiv(L, v1, v2);
  84. case LUA_OPPOW: return luai_numpow(L, v1, v2);
  85. case LUA_OPUNM: return luai_numunm(L, v1);
  86. case LUA_OPMOD: {
  87. lua_Number m;
  88. luai_nummod(L, v1, v2, m);
  89. return m;
  90. }
  91. default: lua_assert(0); return 0;
  92. }
  93. }
  94. void luaO_arith (lua_State *L, int op, const TValue *p1, const TValue *p2,
  95. TValue *res) {
  96. switch (op) {
  97. case LUA_OPIDIV: case LUA_OPBAND: case LUA_OPBOR:
  98. case LUA_OPBXOR: case LUA_OPSHL: case LUA_OPSHR:
  99. case LUA_OPBNOT: { /* operates only on integers */
  100. lua_Integer i1; lua_Integer i2;
  101. if (tointeger(p1, &i1) && tointeger(p2, &i2)) {
  102. setivalue(res, intarith(L, op, i1, i2));
  103. return;
  104. }
  105. else break; /* go to the end */
  106. }
  107. case LUA_OPDIV: { /* operates only on floats */
  108. lua_Number n1; lua_Number n2;
  109. if (tonumber(p1, &n1) && tonumber(p2, &n2)) {
  110. setnvalue(res, numarith(L, op, n1, n2));
  111. return;
  112. }
  113. else break; /* go to the end */
  114. }
  115. default: { /* other operations */
  116. lua_Number n1; lua_Number n2;
  117. if (ttisinteger(p1) && ttisinteger(p2)) {
  118. setivalue(res, intarith(L, op, ivalue(p1), ivalue(p2)));
  119. return;
  120. }
  121. else if (tonumber(p1, &n1) && tonumber(p2, &n2)) {
  122. setnvalue(res, numarith(L, op, n1, n2));
  123. return;
  124. }
  125. else break; /* go to the end */
  126. }
  127. }
  128. /* could not perform raw operation; try metamethod */
  129. lua_assert(L != NULL); /* should not fail when folding (compile time) */
  130. luaT_trybinTM(L, p1, p2, res, cast(TMS, op - LUA_OPADD + TM_ADD));
  131. }
  132. int luaO_hexavalue (int c) {
  133. if (lisdigit(c)) return c - '0';
  134. else return ltolower(c) - 'a' + 10;
  135. }
  136. static int isneg (const char **s) {
  137. if (**s == '-') { (*s)++; return 1; }
  138. else if (**s == '+') (*s)++;
  139. return 0;
  140. }
  141. /*
  142. ** {======================================================
  143. ** lua_strx2number converts an hexadecimal numeric string to a number.
  144. ** In C99, 'strtod' does both conversions. C89, however, has no function
  145. ** to convert floating hexadecimal strings to numbers. For these
  146. ** systems, you can leave 'lua_strx2number' undefined and Lua will
  147. ** provide its own implementation.
  148. ** =======================================================
  149. */
  150. #if !defined(lua_strx2number) /* { */
  151. #if defined(LUA_USE_C99) /* { */
  152. #define lua_strx2number(s,p) lua_str2number(s,p)
  153. #else /* }{ */
  154. /* Lua's implementation for 'lua_strx2number' */
  155. #include <math.h>
  156. /* maximum number of significant digits to read (to avoid overflows
  157. even with single floats) */
  158. #define MAXSIGDIG 30
  159. /*
  160. ** convert an hexadecimal numeric string to a number, following
  161. ** C99 specification for 'strtod'
  162. */
  163. static lua_Number lua_strx2number (const char *s, char **endptr) {
  164. lua_Number r = 0.0; /* result (accumulator) */
  165. int sigdig = 0; /* number of significant digits */
  166. int nosigdig = 0; /* number of non-significant digits */
  167. int e = 0; /* exponent correction */
  168. int neg = 0; /* 1 if number is negative */
  169. int dot = 0; /* true after seen a dot */
  170. *endptr = cast(char *, s); /* nothing is valid yet */
  171. while (lisspace(cast_uchar(*s))) s++; /* skip initial spaces */
  172. neg = isneg(&s); /* check signal */
  173. if (!(*s == '0' && (*(s + 1) == 'x' || *(s + 1) == 'X'))) /* check '0x' */
  174. return 0.0; /* invalid format (no '0x') */
  175. for (s += 2; ; s++) { /* skip '0x' and read numeral */
  176. if (*s == '.') {
  177. if (dot) break; /* second dot? stop loop */
  178. else dot = 1;
  179. }
  180. else if (lisxdigit(cast_uchar(*s))) {
  181. if (sigdig == 0 && *s == '0') { /* non-significant zero? */
  182. nosigdig++;
  183. if (dot) e--; /* zero after dot? correct exponent */
  184. }
  185. else {
  186. if (++sigdig <= MAXSIGDIG) { /* can read it without overflow? */
  187. r = (r * cast_num(16.0)) + luaO_hexavalue(cast_uchar(*s));
  188. if (dot) e--; /* decimal digit */
  189. }
  190. else /* too many digits; ignore */
  191. if (!dot) e++; /* still count it for exponent */
  192. }
  193. }
  194. else break; /* neither a dot nor a digit */
  195. }
  196. if (nosigdig + sigdig == 0) /* no digits? */
  197. return 0.0; /* invalid format */
  198. *endptr = cast(char *, s); /* valid up to here */
  199. e *= 4; /* each digit multiplies/divides value by 2^4 */
  200. if (*s == 'p' || *s == 'P') { /* exponent part? */
  201. int exp1 = 0; /* exponent value */
  202. int neg1; /* exponent signal */
  203. s++; /* skip 'p' */
  204. neg1 = isneg(&s); /* signal */
  205. if (!lisdigit(cast_uchar(*s)))
  206. return 0.0; /* invalid; must have at least one digit */
  207. while (lisdigit(cast_uchar(*s))) /* read exponent */
  208. exp1 = exp1 * 10 + *(s++) - '0';
  209. if (neg1) exp1 = -exp1;
  210. e += exp1;
  211. *endptr = cast(char *, s); /* valid up to here */
  212. }
  213. if (neg) r = -r;
  214. return l_mathop(ldexp)(r, e);
  215. }
  216. #endif /* } */
  217. #endif /* } */
  218. /* }====================================================== */
  219. int luaO_str2d (const char *s, size_t len, lua_Number *result) {
  220. char *endptr;
  221. if (strpbrk(s, "nN")) /* reject 'inf' and 'nan' */
  222. return 0;
  223. else if (strpbrk(s, "xX")) /* hexa? */
  224. *result = lua_strx2number(s, &endptr);
  225. else
  226. *result = lua_str2number(s, &endptr);
  227. if (endptr == s) return 0; /* nothing recognized */
  228. while (lisspace(cast_uchar(*endptr))) endptr++;
  229. return (endptr == s + len); /* OK if no trailing characters */
  230. }
  231. int luaO_str2int (const char *s, size_t len, lua_Integer *result) {
  232. const char *ends = s + len;
  233. lua_Unsigned a = 0;
  234. int empty = 1;
  235. int neg;
  236. while (lisspace(cast_uchar(*s))) s++; /* skip initial spaces */
  237. neg = isneg(&s);
  238. if (s[0] == '0' &&
  239. (s[1] == 'x' || s[1] == 'X')) { /* hexa? */
  240. s += 2; /* skip '0x' */
  241. for (; lisxdigit(cast_uchar(*s)); s++) {
  242. a = a * 16 + luaO_hexavalue(cast_uchar(*s));
  243. empty = 0;
  244. }
  245. }
  246. else { /* decimal */
  247. for (; lisdigit(cast_uchar(*s)); s++) {
  248. a = a * 10 + luaO_hexavalue(cast_uchar(*s));
  249. empty = 0;
  250. }
  251. }
  252. while (lisspace(cast_uchar(*s))) s++; /* skip trailing spaces */
  253. if (empty || s != ends) return 0; /* something wrong in the numeral */
  254. else {
  255. *result = l_castU2S((neg) ? 0u - a : a);
  256. return 1;
  257. }
  258. }
  259. int luaO_utf8esc (char *buff, unsigned int x) {
  260. int n = 1; /* number of bytes put in buffer (backwards) */
  261. if (x < 0x80) /* ascii? */
  262. buff[UTF8BUFFSZ - 1] = x;
  263. else { /* need continuation bytes */
  264. unsigned int mfb = 0x3f; /* maximum that fits in first byte */
  265. do {
  266. buff[UTF8BUFFSZ - (n++)] = 0x80 | (x & 0x3f); /* add continuation byte */
  267. x >>= 6; /* remove added bits */
  268. mfb >>= 1; /* now there is one less bit available in first byte */
  269. } while (x > mfb); /* still needs continuation byte? */
  270. buff[UTF8BUFFSZ - n] = (~mfb << 1) | x; /* add first byte */
  271. }
  272. return n;
  273. }
  274. static void pushstr (lua_State *L, const char *str, size_t l) {
  275. setsvalue2s(L, L->top++, luaS_newlstr(L, str, l));
  276. }
  277. /* this function handles only '%d', '%c', '%f', '%p', and '%s'
  278. conventional formats, plus Lua-specific '%L' and '%U' */
  279. const char *luaO_pushvfstring (lua_State *L, const char *fmt, va_list argp) {
  280. int n = 0;
  281. for (;;) {
  282. const char *e = strchr(fmt, '%');
  283. if (e == NULL) break;
  284. luaD_checkstack(L, 2); /* fmt + item */
  285. pushstr(L, fmt, e - fmt);
  286. switch (*(e+1)) {
  287. case 's': {
  288. const char *s = va_arg(argp, char *);
  289. if (s == NULL) s = "(null)";
  290. pushstr(L, s, strlen(s));
  291. break;
  292. }
  293. case 'c': {
  294. char buff;
  295. buff = cast(char, va_arg(argp, int));
  296. pushstr(L, &buff, 1);
  297. break;
  298. }
  299. case 'd': {
  300. setivalue(L->top++, cast_int(va_arg(argp, int)));
  301. break;
  302. }
  303. case 'I': {
  304. setivalue(L->top++, cast(lua_Integer, va_arg(argp, l_uacInt)));
  305. break;
  306. }
  307. case 'f': {
  308. setnvalue(L->top++, cast_num(va_arg(argp, l_uacNumber)));
  309. break;
  310. }
  311. case 'p': {
  312. char buff[4*sizeof(void *) + 8]; /* should be enough space for a `%p' */
  313. int l = sprintf(buff, "%p", va_arg(argp, void *));
  314. pushstr(L, buff, l);
  315. break;
  316. }
  317. case 'U': {
  318. char buff[UTF8BUFFSZ];
  319. int l = luaO_utf8esc(buff, va_arg(argp, int));
  320. pushstr(L, buff + UTF8BUFFSZ - l, l);
  321. break;
  322. }
  323. case '%': {
  324. pushstr(L, "%", 1);
  325. break;
  326. }
  327. default: {
  328. luaG_runerror(L,
  329. "invalid option " LUA_QL("%%%c") " to " LUA_QL("lua_pushfstring"),
  330. *(e + 1));
  331. }
  332. }
  333. n += 2;
  334. fmt = e+2;
  335. }
  336. luaD_checkstack(L, 1);
  337. pushstr(L, fmt, strlen(fmt));
  338. if (n > 0) luaV_concat(L, n + 1);
  339. return svalue(L->top - 1);
  340. }
  341. const char *luaO_pushfstring (lua_State *L, const char *fmt, ...) {
  342. const char *msg;
  343. va_list argp;
  344. va_start(argp, fmt);
  345. msg = luaO_pushvfstring(L, fmt, argp);
  346. va_end(argp);
  347. return msg;
  348. }
  349. /* number of chars of a literal string without the ending \0 */
  350. #define LL(x) (sizeof(x)/sizeof(char) - 1)
  351. #define RETS "..."
  352. #define PRE "[string \""
  353. #define POS "\"]"
  354. #define addstr(a,b,l) ( memcpy(a,b,(l) * sizeof(char)), a += (l) )
  355. void luaO_chunkid (char *out, const char *source, size_t bufflen) {
  356. size_t l = strlen(source);
  357. if (*source == '=') { /* 'literal' source */
  358. if (l <= bufflen) /* small enough? */
  359. memcpy(out, source + 1, l * sizeof(char));
  360. else { /* truncate it */
  361. addstr(out, source + 1, bufflen - 1);
  362. *out = '\0';
  363. }
  364. }
  365. else if (*source == '@') { /* file name */
  366. if (l <= bufflen) /* small enough? */
  367. memcpy(out, source + 1, l * sizeof(char));
  368. else { /* add '...' before rest of name */
  369. addstr(out, RETS, LL(RETS));
  370. bufflen -= LL(RETS);
  371. memcpy(out, source + 1 + l - bufflen, bufflen * sizeof(char));
  372. }
  373. }
  374. else { /* string; format as [string "source"] */
  375. const char *nl = strchr(source, '\n'); /* find first new line (if any) */
  376. addstr(out, PRE, LL(PRE)); /* add prefix */
  377. bufflen -= LL(PRE RETS POS) + 1; /* save space for prefix+suffix+'\0' */
  378. if (l < bufflen && nl == NULL) { /* small one-line source? */
  379. addstr(out, source, l); /* keep it */
  380. }
  381. else {
  382. if (nl != NULL) l = nl - source; /* stop at first newline */
  383. if (l > bufflen) l = bufflen;
  384. addstr(out, source, l);
  385. addstr(out, RETS, LL(RETS));
  386. }
  387. memcpy(out, POS, (LL(POS) + 1) * sizeof(char));
  388. }
  389. }