1997-09-17 03:25:59 +08:00
|
|
|
/*
|
2013-02-20 22:08:21 +08:00
|
|
|
** $Id: lmem.h,v 1.39 2012/11/14 17:21:34 roberto Exp roberto $
|
1997-09-17 03:25:59 +08:00
|
|
|
** Interface to Memory Manager
|
|
|
|
** See Copyright Notice in lua.h
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef lmem_h
|
|
|
|
#define lmem_h
|
|
|
|
|
|
|
|
|
2000-05-24 21:54:49 +08:00
|
|
|
#include <stddef.h>
|
1997-09-17 03:25:59 +08:00
|
|
|
|
2000-05-24 21:54:49 +08:00
|
|
|
#include "llimits.h"
|
1999-11-22 21:12:07 +08:00
|
|
|
#include "lua.h"
|
|
|
|
|
2002-05-02 04:48:12 +08:00
|
|
|
|
2012-11-15 01:21:34 +08:00
|
|
|
/*
|
|
|
|
** This macro avoids the runtime division MAX_SIZET/(e), as 'e' is
|
|
|
|
** always constant.
|
|
|
|
** The macro is somewhat complex to avoid warnings:
|
2013-02-20 22:08:21 +08:00
|
|
|
** +1 avoids warnings of "comparison has constant result";
|
2012-11-15 01:21:34 +08:00
|
|
|
** cast to 'void' avoids warnings of "value unused".
|
|
|
|
*/
|
2004-11-19 23:52:40 +08:00
|
|
|
#define luaM_reallocv(L,b,on,n,e) \
|
2012-11-15 01:21:34 +08:00
|
|
|
(cast(void, \
|
|
|
|
(cast(size_t, (n)+1) > MAX_SIZET/(e)) ? (luaM_toobig(L), 0) : 0), \
|
|
|
|
luaM_realloc_(L, (b), (on)*(e), (n)*(e)))
|
2004-11-19 23:52:40 +08:00
|
|
|
|
2004-12-01 23:46:18 +08:00
|
|
|
#define luaM_freemem(L, b, s) luaM_realloc_(L, (b), (s), 0)
|
|
|
|
#define luaM_free(L, b) luaM_realloc_(L, (b), sizeof(*(b)), 0)
|
2009-04-17 22:40:13 +08:00
|
|
|
#define luaM_freearray(L, b, n) luaM_reallocv(L, (b), n, 0, sizeof((b)[0]))
|
2000-12-28 20:55:41 +08:00
|
|
|
|
2009-12-17 23:46:44 +08:00
|
|
|
#define luaM_malloc(L,s) luaM_realloc_(L, NULL, 0, (s))
|
2004-11-19 23:52:40 +08:00
|
|
|
#define luaM_new(L,t) cast(t *, luaM_malloc(L, sizeof(t)))
|
|
|
|
#define luaM_newvector(L,n,t) \
|
|
|
|
cast(t *, luaM_reallocv(L, NULL, 0, n, sizeof(t)))
|
2000-05-24 21:54:49 +08:00
|
|
|
|
2009-12-17 23:46:44 +08:00
|
|
|
#define luaM_newobject(L,tag,s) luaM_realloc_(L, NULL, tag, (s))
|
|
|
|
|
2000-12-27 02:46:09 +08:00
|
|
|
#define luaM_growvector(L,v,nelems,size,t,limit,e) \
|
2004-12-01 23:46:18 +08:00
|
|
|
if ((nelems)+1 > (size)) \
|
|
|
|
((v)=cast(t *, luaM_growaux_(L,v,&(size),sizeof(t),limit,e)))
|
2000-05-24 21:54:49 +08:00
|
|
|
|
2000-12-28 20:55:41 +08:00
|
|
|
#define luaM_reallocvector(L, v,oldn,n,t) \
|
2004-11-19 23:52:40 +08:00
|
|
|
((v)=cast(t *, luaM_reallocv(L, v, oldn, n, sizeof(t))))
|
1997-09-17 03:25:59 +08:00
|
|
|
|
2011-11-30 20:42:49 +08:00
|
|
|
LUAI_FUNC l_noret luaM_toobig (lua_State *L);
|
1997-09-17 03:25:59 +08:00
|
|
|
|
2007-02-09 21:04:52 +08:00
|
|
|
/* not to be called directly */
|
2005-04-26 03:24:10 +08:00
|
|
|
LUAI_FUNC void *luaM_realloc_ (lua_State *L, void *block, size_t oldsize,
|
|
|
|
size_t size);
|
|
|
|
LUAI_FUNC void *luaM_growaux_ (lua_State *L, void *block, int *size,
|
|
|
|
size_t size_elem, int limit,
|
2006-09-15 02:42:28 +08:00
|
|
|
const char *what);
|
2005-04-26 03:24:10 +08:00
|
|
|
|
1997-09-17 03:25:59 +08:00
|
|
|
#endif
|
|
|
|
|