1280405Srpaulo/*
2344220Skevans** $Id: lmem.h,v 1.43.1.1 2017/04/19 17:20:42 roberto Exp $
3280405Srpaulo** Interface to Memory Manager
4280405Srpaulo** See Copyright Notice in lua.h
5280405Srpaulo*/
6280405Srpaulo
7280405Srpaulo#ifndef lmem_h
8280405Srpaulo#define lmem_h
9280405Srpaulo
10280405Srpaulo
11280405Srpaulo#include <stddef.h>
12280405Srpaulo
13280405Srpaulo#include "llimits.h"
14280405Srpaulo#include "lua.h"
15280405Srpaulo
16280405Srpaulo
17280405Srpaulo/*
18280405Srpaulo** This macro reallocs a vector 'b' from 'on' to 'n' elements, where
19280405Srpaulo** each element has size 'e'. In case of arithmetic overflow of the
20280405Srpaulo** product 'n'*'e', it raises an error (calling 'luaM_toobig'). Because
21280405Srpaulo** 'e' is always constant, it avoids the runtime division MAX_SIZET/(e).
22280405Srpaulo**
23280405Srpaulo** (The macro is somewhat complex to avoid warnings:  The 'sizeof'
24280405Srpaulo** comparison avoids a runtime comparison when overflow cannot occur.
25280405Srpaulo** The compiler should be able to optimize the real test by itself, but
26280405Srpaulo** when it does it, it may give a warning about "comparison is always
27280405Srpaulo** false due to limited range of data type"; the +1 tricks the compiler,
28280405Srpaulo** avoiding this warning but also this optimization.)
29280405Srpaulo*/
30280405Srpaulo#define luaM_reallocv(L,b,on,n,e) \
31280405Srpaulo  (((sizeof(n) >= sizeof(size_t) && cast(size_t, (n)) + 1 > MAX_SIZET/(e)) \
32280405Srpaulo      ? luaM_toobig(L) : cast_void(0)) , \
33280405Srpaulo   luaM_realloc_(L, (b), (on)*(e), (n)*(e)))
34280405Srpaulo
35280405Srpaulo/*
36280405Srpaulo** Arrays of chars do not need any test
37280405Srpaulo*/
38280405Srpaulo#define luaM_reallocvchar(L,b,on,n)  \
39280405Srpaulo    cast(char *, luaM_realloc_(L, (b), (on)*sizeof(char), (n)*sizeof(char)))
40280405Srpaulo
41280405Srpaulo#define luaM_freemem(L, b, s)	luaM_realloc_(L, (b), (s), 0)
42280405Srpaulo#define luaM_free(L, b)		luaM_realloc_(L, (b), sizeof(*(b)), 0)
43280405Srpaulo#define luaM_freearray(L, b, n)   luaM_realloc_(L, (b), (n)*sizeof(*(b)), 0)
44280405Srpaulo
45280405Srpaulo#define luaM_malloc(L,s)	luaM_realloc_(L, NULL, 0, (s))
46280405Srpaulo#define luaM_new(L,t)		cast(t *, luaM_malloc(L, sizeof(t)))
47280405Srpaulo#define luaM_newvector(L,n,t) \
48280405Srpaulo		cast(t *, luaM_reallocv(L, NULL, 0, n, sizeof(t)))
49280405Srpaulo
50280405Srpaulo#define luaM_newobject(L,tag,s)	luaM_realloc_(L, NULL, tag, (s))
51280405Srpaulo
52280405Srpaulo#define luaM_growvector(L,v,nelems,size,t,limit,e) \
53280405Srpaulo          if ((nelems)+1 > (size)) \
54280405Srpaulo            ((v)=cast(t *, luaM_growaux_(L,v,&(size),sizeof(t),limit,e)))
55280405Srpaulo
56280405Srpaulo#define luaM_reallocvector(L, v,oldn,n,t) \
57280405Srpaulo   ((v)=cast(t *, luaM_reallocv(L, v, oldn, n, sizeof(t))))
58280405Srpaulo
59280405SrpauloLUAI_FUNC l_noret luaM_toobig (lua_State *L);
60280405Srpaulo
61280405Srpaulo/* not to be called directly */
62280405SrpauloLUAI_FUNC void *luaM_realloc_ (lua_State *L, void *block, size_t oldsize,
63280405Srpaulo                                                          size_t size);
64280405SrpauloLUAI_FUNC void *luaM_growaux_ (lua_State *L, void *block, int *size,
65280405Srpaulo                               size_t size_elem, int limit,
66280405Srpaulo                               const char *what);
67280405Srpaulo
68280405Srpaulo#endif
69280405Srpaulo
70