lobject.c 11 KB

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