lmathlib.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765
  1. /*
  2. ** $Id: lmathlib.c $
  3. ** Standard mathematical library
  4. ** See Copyright Notice in lua.h
  5. */
  6. #define lmathlib_c
  7. #define LUA_LIB
  8. #include "lprefix.h"
  9. #include <float.h>
  10. #include <limits.h>
  11. #include <math.h>
  12. #include <stdlib.h>
  13. #include <time.h>
  14. #include "lua.h"
  15. #include "lauxlib.h"
  16. #include "lualib.h"
  17. #undef PI
  18. #define PI (l_mathop(3.141592653589793238462643383279502884))
  19. static int math_abs (lua_State *L) {
  20. if (lua_isinteger(L, 1)) {
  21. lua_Integer n = lua_tointeger(L, 1);
  22. if (n < 0) n = (lua_Integer)(0u - (lua_Unsigned)n);
  23. lua_pushinteger(L, n);
  24. }
  25. else
  26. lua_pushnumber(L, l_mathop(fabs)(luaL_checknumber(L, 1)));
  27. return 1;
  28. }
  29. static int math_sin (lua_State *L) {
  30. lua_pushnumber(L, l_mathop(sin)(luaL_checknumber(L, 1)));
  31. return 1;
  32. }
  33. static int math_cos (lua_State *L) {
  34. lua_pushnumber(L, l_mathop(cos)(luaL_checknumber(L, 1)));
  35. return 1;
  36. }
  37. static int math_tan (lua_State *L) {
  38. lua_pushnumber(L, l_mathop(tan)(luaL_checknumber(L, 1)));
  39. return 1;
  40. }
  41. static int math_asin (lua_State *L) {
  42. lua_pushnumber(L, l_mathop(asin)(luaL_checknumber(L, 1)));
  43. return 1;
  44. }
  45. static int math_acos (lua_State *L) {
  46. lua_pushnumber(L, l_mathop(acos)(luaL_checknumber(L, 1)));
  47. return 1;
  48. }
  49. static int math_atan (lua_State *L) {
  50. lua_Number y = luaL_checknumber(L, 1);
  51. lua_Number x = luaL_optnumber(L, 2, 1);
  52. lua_pushnumber(L, l_mathop(atan2)(y, x));
  53. return 1;
  54. }
  55. static int math_toint (lua_State *L) {
  56. int valid;
  57. lua_Integer n = lua_tointegerx(L, 1, &valid);
  58. if (l_likely(valid))
  59. lua_pushinteger(L, n);
  60. else {
  61. luaL_checkany(L, 1);
  62. luaL_pushfail(L); /* value is not convertible to integer */
  63. }
  64. return 1;
  65. }
  66. static void pushnumint (lua_State *L, lua_Number d) {
  67. lua_Integer n;
  68. if (lua_numbertointeger(d, &n)) /* does 'd' fit in an integer? */
  69. lua_pushinteger(L, n); /* result is integer */
  70. else
  71. lua_pushnumber(L, d); /* result is float */
  72. }
  73. static int math_floor (lua_State *L) {
  74. if (lua_isinteger(L, 1))
  75. lua_settop(L, 1); /* integer is its own floor */
  76. else {
  77. lua_Number d = l_mathop(floor)(luaL_checknumber(L, 1));
  78. pushnumint(L, d);
  79. }
  80. return 1;
  81. }
  82. static int math_ceil (lua_State *L) {
  83. if (lua_isinteger(L, 1))
  84. lua_settop(L, 1); /* integer is its own ceil */
  85. else {
  86. lua_Number d = l_mathop(ceil)(luaL_checknumber(L, 1));
  87. pushnumint(L, d);
  88. }
  89. return 1;
  90. }
  91. static int math_fmod (lua_State *L) {
  92. if (lua_isinteger(L, 1) && lua_isinteger(L, 2)) {
  93. lua_Integer d = lua_tointeger(L, 2);
  94. if ((lua_Unsigned)d + 1u <= 1u) { /* special cases: -1 or 0 */
  95. luaL_argcheck(L, d != 0, 2, "zero");
  96. lua_pushinteger(L, 0); /* avoid overflow with 0x80000... / -1 */
  97. }
  98. else
  99. lua_pushinteger(L, lua_tointeger(L, 1) % d);
  100. }
  101. else
  102. lua_pushnumber(L, l_mathop(fmod)(luaL_checknumber(L, 1),
  103. luaL_checknumber(L, 2)));
  104. return 1;
  105. }
  106. /*
  107. ** next function does not use 'modf', avoiding problems with 'double*'
  108. ** (which is not compatible with 'float*') when lua_Number is not
  109. ** 'double'.
  110. */
  111. static int math_modf (lua_State *L) {
  112. if (lua_isinteger(L ,1)) {
  113. lua_settop(L, 1); /* number is its own integer part */
  114. lua_pushnumber(L, 0); /* no fractional part */
  115. }
  116. else {
  117. lua_Number n = luaL_checknumber(L, 1);
  118. /* integer part (rounds toward zero) */
  119. lua_Number ip = (n < 0) ? l_mathop(ceil)(n) : l_mathop(floor)(n);
  120. pushnumint(L, ip);
  121. /* fractional part (test needed for inf/-inf) */
  122. lua_pushnumber(L, (n == ip) ? l_mathop(0.0) : (n - ip));
  123. }
  124. return 2;
  125. }
  126. static int math_sqrt (lua_State *L) {
  127. lua_pushnumber(L, l_mathop(sqrt)(luaL_checknumber(L, 1)));
  128. return 1;
  129. }
  130. static int math_ult (lua_State *L) {
  131. lua_Integer a = luaL_checkinteger(L, 1);
  132. lua_Integer b = luaL_checkinteger(L, 2);
  133. lua_pushboolean(L, (lua_Unsigned)a < (lua_Unsigned)b);
  134. return 1;
  135. }
  136. static int math_log (lua_State *L) {
  137. lua_Number x = luaL_checknumber(L, 1);
  138. lua_Number res;
  139. if (lua_isnoneornil(L, 2))
  140. res = l_mathop(log)(x);
  141. else {
  142. lua_Number base = luaL_checknumber(L, 2);
  143. #if !defined(LUA_USE_C89)
  144. if (base == l_mathop(2.0))
  145. res = l_mathop(log2)(x);
  146. else
  147. #endif
  148. if (base == l_mathop(10.0))
  149. res = l_mathop(log10)(x);
  150. else
  151. res = l_mathop(log)(x)/l_mathop(log)(base);
  152. }
  153. lua_pushnumber(L, res);
  154. return 1;
  155. }
  156. static int math_exp (lua_State *L) {
  157. lua_pushnumber(L, l_mathop(exp)(luaL_checknumber(L, 1)));
  158. return 1;
  159. }
  160. static int math_deg (lua_State *L) {
  161. lua_pushnumber(L, luaL_checknumber(L, 1) * (l_mathop(180.0) / PI));
  162. return 1;
  163. }
  164. static int math_rad (lua_State *L) {
  165. lua_pushnumber(L, luaL_checknumber(L, 1) * (PI / l_mathop(180.0)));
  166. return 1;
  167. }
  168. static int math_min (lua_State *L) {
  169. int n = lua_gettop(L); /* number of arguments */
  170. int imin = 1; /* index of current minimum value */
  171. int i;
  172. luaL_argcheck(L, n >= 1, 1, "value expected");
  173. for (i = 2; i <= n; i++) {
  174. if (lua_compare(L, i, imin, LUA_OPLT))
  175. imin = i;
  176. }
  177. lua_pushvalue(L, imin);
  178. return 1;
  179. }
  180. static int math_max (lua_State *L) {
  181. int n = lua_gettop(L); /* number of arguments */
  182. int imax = 1; /* index of current maximum value */
  183. int i;
  184. luaL_argcheck(L, n >= 1, 1, "value expected");
  185. for (i = 2; i <= n; i++) {
  186. if (lua_compare(L, imax, i, LUA_OPLT))
  187. imax = i;
  188. }
  189. lua_pushvalue(L, imax);
  190. return 1;
  191. }
  192. static int math_type (lua_State *L) {
  193. if (lua_type(L, 1) == LUA_TNUMBER)
  194. lua_pushstring(L, (lua_isinteger(L, 1)) ? "integer" : "float");
  195. else {
  196. luaL_checkany(L, 1);
  197. luaL_pushfail(L);
  198. }
  199. return 1;
  200. }
  201. /*
  202. ** {==================================================================
  203. ** Pseudo-Random Number Generator based on 'xoshiro256**'.
  204. ** ===================================================================
  205. */
  206. /* number of binary digits in the mantissa of a float */
  207. #define FIGS l_floatatt(MANT_DIG)
  208. #if FIGS > 64
  209. /* there are only 64 random bits; use them all */
  210. #undef FIGS
  211. #define FIGS 64
  212. #endif
  213. /*
  214. ** LUA_RAND32 forces the use of 32-bit integers in the implementation
  215. ** of the PRN generator (mainly for testing).
  216. */
  217. #if !defined(LUA_RAND32) && !defined(Rand64)
  218. /* try to find an integer type with at least 64 bits */
  219. #if ((ULONG_MAX >> 31) >> 31) >= 3
  220. /* 'long' has at least 64 bits */
  221. #define Rand64 unsigned long
  222. #elif !defined(LUA_USE_C89) && defined(LLONG_MAX)
  223. /* there is a 'long long' type (which must have at least 64 bits) */
  224. #define Rand64 unsigned long long
  225. #elif ((LUA_MAXUNSIGNED >> 31) >> 31) >= 3
  226. /* 'lua_Unsigned' has at least 64 bits */
  227. #define Rand64 lua_Unsigned
  228. #endif
  229. #endif
  230. #if defined(Rand64) /* { */
  231. /*
  232. ** Standard implementation, using 64-bit integers.
  233. ** If 'Rand64' has more than 64 bits, the extra bits do not interfere
  234. ** with the 64 initial bits, except in a right shift. Moreover, the
  235. ** final result has to discard the extra bits.
  236. */
  237. /* avoid using extra bits when needed */
  238. #define trim64(x) ((x) & 0xffffffffffffffffu)
  239. /* rotate left 'x' by 'n' bits */
  240. static Rand64 rotl (Rand64 x, int n) {
  241. return (x << n) | (trim64(x) >> (64 - n));
  242. }
  243. static Rand64 nextrand (Rand64 *state) {
  244. Rand64 state0 = state[0];
  245. Rand64 state1 = state[1];
  246. Rand64 state2 = state[2] ^ state0;
  247. Rand64 state3 = state[3] ^ state1;
  248. Rand64 res = rotl(state1 * 5, 7) * 9;
  249. state[0] = state0 ^ state3;
  250. state[1] = state1 ^ state2;
  251. state[2] = state2 ^ (state1 << 17);
  252. state[3] = rotl(state3, 45);
  253. return res;
  254. }
  255. /* must take care to not shift stuff by more than 63 slots */
  256. /*
  257. ** Convert bits from a random integer into a float in the
  258. ** interval [0,1), getting the higher FIG bits from the
  259. ** random unsigned integer and converting that to a float.
  260. */
  261. /* must throw out the extra (64 - FIGS) bits */
  262. #define shift64_FIG (64 - FIGS)
  263. /* to scale to [0, 1), multiply by scaleFIG = 2^(-FIGS) */
  264. #define scaleFIG (l_mathop(0.5) / ((Rand64)1 << (FIGS - 1)))
  265. static lua_Number I2d (Rand64 x) {
  266. return (lua_Number)(trim64(x) >> shift64_FIG) * scaleFIG;
  267. }
  268. /* convert a 'Rand64' to a 'lua_Unsigned' */
  269. #define I2UInt(x) ((lua_Unsigned)trim64(x))
  270. /* convert a 'lua_Unsigned' to a 'Rand64' */
  271. #define Int2I(x) ((Rand64)(x))
  272. #else /* no 'Rand64' }{ */
  273. /* get an integer with at least 32 bits */
  274. #if LUAI_IS32INT
  275. typedef unsigned int lu_int32;
  276. #else
  277. typedef unsigned long lu_int32;
  278. #endif
  279. /*
  280. ** Use two 32-bit integers to represent a 64-bit quantity.
  281. */
  282. typedef struct Rand64 {
  283. lu_int32 h; /* higher half */
  284. lu_int32 l; /* lower half */
  285. } Rand64;
  286. /*
  287. ** If 'lu_int32' has more than 32 bits, the extra bits do not interfere
  288. ** with the 32 initial bits, except in a right shift and comparisons.
  289. ** Moreover, the final result has to discard the extra bits.
  290. */
  291. /* avoid using extra bits when needed */
  292. #define trim32(x) ((x) & 0xffffffffu)
  293. /*
  294. ** basic operations on 'Rand64' values
  295. */
  296. /* build a new Rand64 value */
  297. static Rand64 packI (lu_int32 h, lu_int32 l) {
  298. Rand64 result;
  299. result.h = h;
  300. result.l = l;
  301. return result;
  302. }
  303. /* return i << n */
  304. static Rand64 Ishl (Rand64 i, int n) {
  305. lua_assert(n > 0 && n < 32);
  306. return packI((i.h << n) | (trim32(i.l) >> (32 - n)), i.l << n);
  307. }
  308. /* i1 ^= i2 */
  309. static void Ixor (Rand64 *i1, Rand64 i2) {
  310. i1->h ^= i2.h;
  311. i1->l ^= i2.l;
  312. }
  313. /* return i1 + i2 */
  314. static Rand64 Iadd (Rand64 i1, Rand64 i2) {
  315. Rand64 result = packI(i1.h + i2.h, i1.l + i2.l);
  316. if (trim32(result.l) < trim32(i1.l)) /* carry? */
  317. result.h++;
  318. return result;
  319. }
  320. /* return i * 5 */
  321. static Rand64 times5 (Rand64 i) {
  322. return Iadd(Ishl(i, 2), i); /* i * 5 == (i << 2) + i */
  323. }
  324. /* return i * 9 */
  325. static Rand64 times9 (Rand64 i) {
  326. return Iadd(Ishl(i, 3), i); /* i * 9 == (i << 3) + i */
  327. }
  328. /* return 'i' rotated left 'n' bits */
  329. static Rand64 rotl (Rand64 i, int n) {
  330. lua_assert(n > 0 && n < 32);
  331. return packI((i.h << n) | (trim32(i.l) >> (32 - n)),
  332. (trim32(i.h) >> (32 - n)) | (i.l << n));
  333. }
  334. /* for offsets larger than 32, rotate right by 64 - offset */
  335. static Rand64 rotl1 (Rand64 i, int n) {
  336. lua_assert(n > 32 && n < 64);
  337. n = 64 - n;
  338. return packI((trim32(i.h) >> n) | (i.l << (32 - n)),
  339. (i.h << (32 - n)) | (trim32(i.l) >> n));
  340. }
  341. /*
  342. ** implementation of 'xoshiro256**' algorithm on 'Rand64' values
  343. */
  344. static Rand64 nextrand (Rand64 *state) {
  345. Rand64 res = times9(rotl(times5(state[1]), 7));
  346. Rand64 t = Ishl(state[1], 17);
  347. Ixor(&state[2], state[0]);
  348. Ixor(&state[3], state[1]);
  349. Ixor(&state[1], state[2]);
  350. Ixor(&state[0], state[3]);
  351. Ixor(&state[2], t);
  352. state[3] = rotl1(state[3], 45);
  353. return res;
  354. }
  355. /*
  356. ** Converts a 'Rand64' into a float.
  357. */
  358. /* an unsigned 1 with proper type */
  359. #define UONE ((lu_int32)1)
  360. #if FIGS <= 32
  361. /* 2^(-FIGS) */
  362. #define scaleFIG (l_mathop(0.5) / (UONE << (FIGS - 1)))
  363. /*
  364. ** get up to 32 bits from higher half, shifting right to
  365. ** throw out the extra bits.
  366. */
  367. static lua_Number I2d (Rand64 x) {
  368. lua_Number h = (lua_Number)(trim32(x.h) >> (32 - FIGS));
  369. return h * scaleFIG;
  370. }
  371. #else /* 32 < FIGS <= 64 */
  372. /* must take care to not shift stuff by more than 31 slots */
  373. /* 2^(-FIGS) = 1.0 / 2^30 / 2^3 / 2^(FIGS-33) */
  374. #define scaleFIG \
  375. (l_mathop(1.0) / (UONE << 30) / l_mathop(8.0) / (UONE << (FIGS - 33)))
  376. /*
  377. ** use FIGS - 32 bits from lower half, throwing out the other
  378. ** (32 - (FIGS - 32)) = (64 - FIGS) bits
  379. */
  380. #define shiftLOW (64 - FIGS)
  381. /*
  382. ** higher 32 bits go after those (FIGS - 32) bits: shiftHI = 2^(FIGS - 32)
  383. */
  384. #define shiftHI ((lua_Number)(UONE << (FIGS - 33)) * l_mathop(2.0))
  385. static lua_Number I2d (Rand64 x) {
  386. lua_Number h = (lua_Number)trim32(x.h) * shiftHI;
  387. lua_Number l = (lua_Number)(trim32(x.l) >> shiftLOW);
  388. return (h + l) * scaleFIG;
  389. }
  390. #endif
  391. /* convert a 'Rand64' to a 'lua_Unsigned' */
  392. static lua_Unsigned I2UInt (Rand64 x) {
  393. return (((lua_Unsigned)trim32(x.h) << 31) << 1) | (lua_Unsigned)trim32(x.l);
  394. }
  395. /* convert a 'lua_Unsigned' to a 'Rand64' */
  396. static Rand64 Int2I (lua_Unsigned n) {
  397. return packI((lu_int32)((n >> 31) >> 1), (lu_int32)n);
  398. }
  399. #endif /* } */
  400. /*
  401. ** A state uses four 'Rand64' values.
  402. */
  403. typedef struct {
  404. Rand64 s[4];
  405. } RanState;
  406. /*
  407. ** Project the random integer 'ran' into the interval [0, n].
  408. ** Because 'ran' has 2^B possible values, the projection can only be
  409. ** uniform when the size of the interval is a power of 2 (exact
  410. ** division). Otherwise, to get a uniform projection into [0, n], we
  411. ** first compute 'lim', the smallest Mersenne number not smaller than
  412. ** 'n'. We then project 'ran' into the interval [0, lim]. If the result
  413. ** is inside [0, n], we are done. Otherwise, we try with another 'ran',
  414. ** until we have a result inside the interval.
  415. */
  416. static lua_Unsigned project (lua_Unsigned ran, lua_Unsigned n,
  417. RanState *state) {
  418. if ((n & (n + 1)) == 0) /* is 'n + 1' a power of 2? */
  419. return ran & n; /* no bias */
  420. else {
  421. lua_Unsigned lim = n;
  422. /* compute the smallest (2^b - 1) not smaller than 'n' */
  423. lim |= (lim >> 1);
  424. lim |= (lim >> 2);
  425. lim |= (lim >> 4);
  426. lim |= (lim >> 8);
  427. lim |= (lim >> 16);
  428. #if (LUA_MAXUNSIGNED >> 31) >= 3
  429. lim |= (lim >> 32); /* integer type has more than 32 bits */
  430. #endif
  431. lua_assert((lim & (lim + 1)) == 0 /* 'lim + 1' is a power of 2, */
  432. && lim >= n /* not smaller than 'n', */
  433. && (lim >> 1) < n); /* and it is the smallest one */
  434. while ((ran &= lim) > n) /* project 'ran' into [0..lim] */
  435. ran = I2UInt(nextrand(state->s)); /* not inside [0..n]? try again */
  436. return ran;
  437. }
  438. }
  439. static int math_random (lua_State *L) {
  440. lua_Integer low, up;
  441. lua_Unsigned p;
  442. RanState *state = (RanState *)lua_touserdata(L, lua_upvalueindex(1));
  443. Rand64 rv = nextrand(state->s); /* next pseudo-random value */
  444. switch (lua_gettop(L)) { /* check number of arguments */
  445. case 0: { /* no arguments */
  446. lua_pushnumber(L, I2d(rv)); /* float between 0 and 1 */
  447. return 1;
  448. }
  449. case 1: { /* only upper limit */
  450. low = 1;
  451. up = luaL_checkinteger(L, 1);
  452. if (up == 0) { /* single 0 as argument? */
  453. lua_pushinteger(L, I2UInt(rv)); /* full random integer */
  454. return 1;
  455. }
  456. break;
  457. }
  458. case 2: { /* lower and upper limits */
  459. low = luaL_checkinteger(L, 1);
  460. up = luaL_checkinteger(L, 2);
  461. break;
  462. }
  463. default: return luaL_error(L, "wrong number of arguments");
  464. }
  465. /* random integer in the interval [low, up] */
  466. luaL_argcheck(L, low <= up, 1, "interval is empty");
  467. /* project random integer into the interval [0, up - low] */
  468. p = project(I2UInt(rv), (lua_Unsigned)up - (lua_Unsigned)low, state);
  469. lua_pushinteger(L, p + (lua_Unsigned)low);
  470. return 1;
  471. }
  472. static void setseed (lua_State *L, Rand64 *state,
  473. lua_Unsigned n1, lua_Unsigned n2) {
  474. int i;
  475. state[0] = Int2I(n1);
  476. state[1] = Int2I(0xff); /* avoid a zero state */
  477. state[2] = Int2I(n2);
  478. state[3] = Int2I(0);
  479. for (i = 0; i < 16; i++)
  480. nextrand(state); /* discard initial values to "spread" seed */
  481. lua_pushinteger(L, n1);
  482. lua_pushinteger(L, n2);
  483. }
  484. /*
  485. ** Set a "random" seed. To get some randomness, use the current time
  486. ** and the address of 'L' (in case the machine does address space layout
  487. ** randomization).
  488. */
  489. static void randseed (lua_State *L, RanState *state) {
  490. lua_Unsigned seed1 = (lua_Unsigned)time(NULL);
  491. lua_Unsigned seed2 = (lua_Unsigned)(size_t)L;
  492. setseed(L, state->s, seed1, seed2);
  493. }
  494. static int math_randomseed (lua_State *L) {
  495. RanState *state = (RanState *)lua_touserdata(L, lua_upvalueindex(1));
  496. if (lua_isnone(L, 1)) {
  497. randseed(L, state);
  498. }
  499. else {
  500. lua_Integer n1 = luaL_checkinteger(L, 1);
  501. lua_Integer n2 = luaL_optinteger(L, 2, 0);
  502. setseed(L, state->s, n1, n2);
  503. }
  504. return 2; /* return seeds */
  505. }
  506. static const luaL_Reg randfuncs[] = {
  507. {"random", math_random},
  508. {"randomseed", math_randomseed},
  509. {NULL, NULL}
  510. };
  511. /*
  512. ** Register the random functions and initialize their state.
  513. */
  514. static void setrandfunc (lua_State *L) {
  515. RanState *state = (RanState *)lua_newuserdatauv(L, sizeof(RanState), 0);
  516. randseed(L, state); /* initialize with a "random" seed */
  517. lua_pop(L, 2); /* remove pushed seeds */
  518. luaL_setfuncs(L, randfuncs, 1);
  519. }
  520. /* }================================================================== */
  521. /*
  522. ** {==================================================================
  523. ** Deprecated functions (for compatibility only)
  524. ** ===================================================================
  525. */
  526. #if defined(LUA_COMPAT_MATHLIB)
  527. static int math_cosh (lua_State *L) {
  528. lua_pushnumber(L, l_mathop(cosh)(luaL_checknumber(L, 1)));
  529. return 1;
  530. }
  531. static int math_sinh (lua_State *L) {
  532. lua_pushnumber(L, l_mathop(sinh)(luaL_checknumber(L, 1)));
  533. return 1;
  534. }
  535. static int math_tanh (lua_State *L) {
  536. lua_pushnumber(L, l_mathop(tanh)(luaL_checknumber(L, 1)));
  537. return 1;
  538. }
  539. static int math_pow (lua_State *L) {
  540. lua_Number x = luaL_checknumber(L, 1);
  541. lua_Number y = luaL_checknumber(L, 2);
  542. lua_pushnumber(L, l_mathop(pow)(x, y));
  543. return 1;
  544. }
  545. static int math_frexp (lua_State *L) {
  546. int e;
  547. lua_pushnumber(L, l_mathop(frexp)(luaL_checknumber(L, 1), &e));
  548. lua_pushinteger(L, e);
  549. return 2;
  550. }
  551. static int math_ldexp (lua_State *L) {
  552. lua_Number x = luaL_checknumber(L, 1);
  553. int ep = (int)luaL_checkinteger(L, 2);
  554. lua_pushnumber(L, l_mathop(ldexp)(x, ep));
  555. return 1;
  556. }
  557. static int math_log10 (lua_State *L) {
  558. lua_pushnumber(L, l_mathop(log10)(luaL_checknumber(L, 1)));
  559. return 1;
  560. }
  561. #endif
  562. /* }================================================================== */
  563. static const luaL_Reg mathlib[] = {
  564. {"abs", math_abs},
  565. {"acos", math_acos},
  566. {"asin", math_asin},
  567. {"atan", math_atan},
  568. {"ceil", math_ceil},
  569. {"cos", math_cos},
  570. {"deg", math_deg},
  571. {"exp", math_exp},
  572. {"tointeger", math_toint},
  573. {"floor", math_floor},
  574. {"fmod", math_fmod},
  575. {"ult", math_ult},
  576. {"log", math_log},
  577. {"max", math_max},
  578. {"min", math_min},
  579. {"modf", math_modf},
  580. {"rad", math_rad},
  581. {"sin", math_sin},
  582. {"sqrt", math_sqrt},
  583. {"tan", math_tan},
  584. {"type", math_type},
  585. #if defined(LUA_COMPAT_MATHLIB)
  586. {"atan2", math_atan},
  587. {"cosh", math_cosh},
  588. {"sinh", math_sinh},
  589. {"tanh", math_tanh},
  590. {"pow", math_pow},
  591. {"frexp", math_frexp},
  592. {"ldexp", math_ldexp},
  593. {"log10", math_log10},
  594. #endif
  595. /* placeholders */
  596. {"random", NULL},
  597. {"randomseed", NULL},
  598. {"pi", NULL},
  599. {"huge", NULL},
  600. {"maxinteger", NULL},
  601. {"mininteger", NULL},
  602. {NULL, NULL}
  603. };
  604. /*
  605. ** Open math library
  606. */
  607. LUAMOD_API int luaopen_math (lua_State *L) {
  608. luaL_newlib(L, mathlib);
  609. lua_pushnumber(L, PI);
  610. lua_setfield(L, -2, "pi");
  611. lua_pushnumber(L, (lua_Number)HUGE_VAL);
  612. lua_setfield(L, -2, "huge");
  613. lua_pushinteger(L, LUA_MAXINTEGER);
  614. lua_setfield(L, -2, "maxinteger");
  615. lua_pushinteger(L, LUA_MININTEGER);
  616. lua_setfield(L, -2, "mininteger");
  617. setrandfunc(L);
  618. return 1;
  619. }