lobject.c 13 KB

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