lmem.h 2.9 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182
  1. /*
  2. ** $Id: lmem.h,v 1.43 2014/12/19 17:26:14 roberto Exp roberto $
  3. ** Interface to Memory Manager
  4. ** See Copyright Notice in lua.h
  5. */
  6. #ifndef lmem_h
  7. #define lmem_h
  8. #include <stddef.h>
  9. #include "llimits.h"
  10. #include "lua.h"
  11. /*
  12. ** This macro tests whether it is safe to multiply 'n' by the size of
  13. ** type 't' without overflows. Because 'e' is always constant, it avoids
  14. ** the runtime division MAX_SIZET/(e).
  15. ** (The macro is somewhat complex to avoid warnings: The 'sizeof'
  16. ** comparison avoids a runtime comparison when overflow cannot occur.
  17. ** The compiler should be able to optimize the real test by itself, but
  18. ** when it does it, it may give a warning about "comparison is always
  19. ** false due to limited range of data type"; the +1 tricks the compiler,
  20. ** avoiding this warning but also this optimization.)
  21. */
  22. #define luaM_testsize(n,e) \
  23. (sizeof(n) >= sizeof(size_t) && cast(size_t, (n)) + 1 > MAX_SIZET/(e))
  24. #define luaM_checksize(L,n,e) \
  25. (luaM_testsize(n,e) ? luaM_toobig(L) : cast_void(0))
  26. /*
  27. ** This macro reallocs a vector 'b' from 'on' to 'n' elements, where
  28. ** each element has size 'e'. In case of arithmetic overflow of the
  29. ** product 'n'*'e', it raises an error (calling 'luaM_toobig').
  30. */
  31. #define luaM_reallocv(L,b,on,n,e) \
  32. (luaM_checksize(L,n,e), \
  33. luaM_realloc_(L, (b), cast(size_t, on)*(e), cast(size_t, n)*(e)))
  34. /*
  35. ** Arrays of chars do not need any test
  36. */
  37. #define luaM_reallocvchar(L,b,on,n) \
  38. cast(char *, luaM_realloc_(L, (b), (on)*sizeof(char), (n)*sizeof(char)))
  39. #define luaM_freemem(L, b, s) luaM_free_(L, (b), (s))
  40. #define luaM_free(L, b) luaM_free_(L, (b), sizeof(*(b)))
  41. #define luaM_freearray(L, b, n) luaM_free_(L, (b), (n)*sizeof(*(b)))
  42. #define luaM_new(L,t) cast(t *, luaM_malloc(L, sizeof(t), 0))
  43. #define luaM_newvector(L,n,t) \
  44. (luaM_checksize(L,n,sizeof(t)), cast(t *, luaM_malloc(L, (n)*sizeof(t), 0)))
  45. #define luaM_newobject(L,tag,s) luaM_malloc(L, (s), tag)
  46. #define luaM_growvector(L,v,nelems,size,t,limit,e) \
  47. ((v)=cast(t *, luaM_growaux_(L,v,nelems,&(size),sizeof(t),limit,e)))
  48. #define luaM_reallocvector(L, v,oldn,n,t) \
  49. ((v)=cast(t *, luaM_reallocv(L, v, oldn, n, sizeof(t))))
  50. #define luaM_shrinkvector(L,v,size,fs,t) \
  51. ((v)=cast(t *, luaM_shrinkvector_(L, v, &(size), fs, sizeof(t))))
  52. LUAI_FUNC l_noret luaM_toobig (lua_State *L);
  53. /* not to be called directly */
  54. LUAI_FUNC void *luaM_realloc_ (lua_State *L, void *block, size_t oldsize,
  55. size_t size);
  56. LUAI_FUNC void luaM_free_ (lua_State *L, void *block, size_t osize);
  57. LUAI_FUNC void *luaM_growaux_ (lua_State *L, void *block, int nelems,
  58. int *size, int size_elem, int limit,
  59. const char *what);
  60. LUAI_FUNC void *luaM_shrinkvector_ (lua_State *L, void *block, int *nelem,
  61. int final_n, int size_elem);
  62. LUAI_FUNC void *luaM_malloc (lua_State *L, size_t size, int tag);
  63. #endif