lmem.h 3.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293
  1. /*
  2. ** $Id: lmem.h $
  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. #define luaM_error(L) luaD_throw(L, LUA_ERRMEM)
  12. /*
  13. ** This macro tests whether it is safe to multiply 'n' by the size of
  14. ** type 't' without overflows. Because 'e' is always constant, it avoids
  15. ** the runtime division MAX_SIZET/(e).
  16. ** (The macro is somewhat complex to avoid warnings: The 'sizeof'
  17. ** comparison avoids a runtime comparison when overflow cannot occur.
  18. ** The compiler should be able to optimize the real test by itself, but
  19. ** when it does it, it may give a warning about "comparison is always
  20. ** false due to limited range of data type"; the +1 tricks the compiler,
  21. ** avoiding this warning but also this optimization.)
  22. */
  23. #define luaM_testsize(n,e) \
  24. (sizeof(n) >= sizeof(size_t) && cast_sizet((n)) + 1 > MAX_SIZET/(e))
  25. #define luaM_checksize(L,n,e) \
  26. (luaM_testsize(n,e) ? luaM_toobig(L) : cast_void(0))
  27. /*
  28. ** Computes the minimum between 'n' and 'MAX_SIZET/sizeof(t)', so that
  29. ** the result is not larger than 'n' and cannot overflow a 'size_t'
  30. ** when multiplied by the size of type 't'. (Assumes that 'n' is an
  31. ** 'int' or 'unsigned int' and that 'int' is not larger than 'size_t'.)
  32. */
  33. #define luaM_limitN(n,t) \
  34. ((cast_sizet(n) <= MAX_SIZET/sizeof(t)) ? (n) : \
  35. cast_uint((MAX_SIZET/sizeof(t))))
  36. /*
  37. ** Arrays of chars do not need any test
  38. */
  39. #define luaM_reallocvchar(L,b,on,n) \
  40. cast_charp(luaM_saferealloc_(L, (b), (on)*sizeof(char), (n)*sizeof(char)))
  41. #define luaM_freemem(L, b, s) luaM_free_(L, (b), (s))
  42. #define luaM_free(L, b) luaM_free_(L, (b), sizeof(*(b)))
  43. #define luaM_freearray(L, b, n) luaM_free_(L, (b), (n)*sizeof(*(b)))
  44. #define luaM_new(L,t) cast(t*, luaM_malloc_(L, sizeof(t), 0))
  45. #define luaM_newvector(L,n,t) cast(t*, luaM_malloc_(L, (n)*sizeof(t), 0))
  46. #define luaM_newvectorchecked(L,n,t) \
  47. (luaM_checksize(L,n,sizeof(t)), luaM_newvector(L,n,t))
  48. #define luaM_newobject(L,tag,s) luaM_malloc_(L, (s), tag)
  49. #define luaM_growvector(L,v,nelems,size,t,limit,e) \
  50. ((v)=cast(t *, luaM_growaux_(L,v,nelems,&(size),sizeof(t), \
  51. luaM_limitN(limit,t),e)))
  52. #define luaM_reallocvector(L, v,oldn,n,t) \
  53. (cast(t *, luaM_realloc_(L, v, cast_sizet(oldn) * sizeof(t), \
  54. cast_sizet(n) * sizeof(t))))
  55. #define luaM_shrinkvector(L,v,size,fs,t) \
  56. ((v)=cast(t *, luaM_shrinkvector_(L, v, &(size), fs, sizeof(t))))
  57. LUAI_FUNC l_noret luaM_toobig (lua_State *L);
  58. /* not to be called directly */
  59. LUAI_FUNC void *luaM_realloc_ (lua_State *L, void *block, size_t oldsize,
  60. size_t size);
  61. LUAI_FUNC void *luaM_saferealloc_ (lua_State *L, void *block, size_t oldsize,
  62. size_t size);
  63. LUAI_FUNC void luaM_free_ (lua_State *L, void *block, size_t osize);
  64. LUAI_FUNC void *luaM_growaux_ (lua_State *L, void *block, int nelems,
  65. int *size, int size_elem, int limit,
  66. const char *what);
  67. LUAI_FUNC void *luaM_shrinkvector_ (lua_State *L, void *block, int *nelem,
  68. int final_n, int size_elem);
  69. LUAI_FUNC void *luaM_malloc_ (lua_State *L, size_t size, int tag);
  70. #endif