1997-09-16 12:25:59 -07:00
|
|
|
/*
|
2004-11-19 07:52:40 -08:00
|
|
|
** $Id: lmem.c,v 1.65 2004/08/30 13:44:44 roberto Exp roberto $
|
1997-09-16 12:25:59 -07:00
|
|
|
** Interface to Memory Manager
|
|
|
|
** See Copyright Notice in lua.h
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
2003-10-02 13:31:17 -07:00
|
|
|
#include <stddef.h>
|
1997-09-16 12:25:59 -07:00
|
|
|
|
2002-12-04 09:38:31 -08:00
|
|
|
#define lmem_c
|
2004-04-30 13:13:38 -07:00
|
|
|
#define LUA_CORE
|
2002-12-04 09:38:31 -08:00
|
|
|
|
2000-06-12 06:52:05 -07:00
|
|
|
#include "lua.h"
|
|
|
|
|
2002-05-15 11:57:44 -07:00
|
|
|
#include "ldebug.h"
|
2000-08-04 12:38:35 -07:00
|
|
|
#include "ldo.h"
|
1997-09-16 12:25:59 -07:00
|
|
|
#include "lmem.h"
|
1999-11-29 08:38:48 -08:00
|
|
|
#include "lobject.h"
|
1997-11-19 09:29:23 -08:00
|
|
|
#include "lstate.h"
|
1997-09-16 12:25:59 -07:00
|
|
|
|
|
|
|
|
1999-01-22 09:28:00 -08:00
|
|
|
|
2002-06-11 09:26:12 -07:00
|
|
|
/*
|
2003-10-02 13:31:17 -07:00
|
|
|
** About the realloc function:
|
|
|
|
** void * realloc (void *ud, void *ptr, size_t osize, size_t nsize);
|
|
|
|
** (`osize' is the old size, `nsize' is the new size)
|
|
|
|
**
|
|
|
|
** Lua ensures that (ptr == NULL) iff (osize == 0).
|
|
|
|
**
|
|
|
|
** * realloc(ud, NULL, 0, x) creates a new block of size `x'
|
|
|
|
**
|
|
|
|
** * realloc(ud, p, x, 0) frees the block `p'
|
|
|
|
** (in this specific case, realloc must return NULL).
|
|
|
|
** particularly, realloc(ud, NULL, 0, 0) does nothing
|
|
|
|
** (which is equivalent to free(NULL) in ANSI C)
|
|
|
|
**
|
|
|
|
** realloc returns NULL if it cannot create or reallocate the area
|
|
|
|
** (any reallocation to an equal or smaller size cannot fail!)
|
2002-06-11 09:26:12 -07:00
|
|
|
*/
|
2000-10-11 09:47:50 -07:00
|
|
|
|
2002-10-08 11:45:07 -07:00
|
|
|
|
2000-10-11 09:47:50 -07:00
|
|
|
|
2001-10-25 12:13:33 -07:00
|
|
|
#define MINSIZEARRAY 4
|
|
|
|
|
|
|
|
|
2004-11-19 07:52:40 -08:00
|
|
|
void *luaM_growaux (lua_State *L, void *block, int *size, size_t size_elems,
|
2001-11-28 12:13:13 -08:00
|
|
|
int limit, const char *errormsg) {
|
2000-12-26 10:46:09 -08:00
|
|
|
void *newblock;
|
2003-11-27 10:18:37 -08:00
|
|
|
int newsize;
|
2004-11-19 07:52:40 -08:00
|
|
|
if (cast(size_t, limit) > MAX_SIZET/size_elems)
|
|
|
|
limit = cast(int, MAX_SIZET/size_elems);
|
2003-11-27 10:18:37 -08:00
|
|
|
if (*size >= limit/2) { /* cannot double it? */
|
|
|
|
if (*size >= limit - MINSIZEARRAY) /* try something smaller... */
|
|
|
|
luaG_runerror(L, errormsg);
|
|
|
|
newsize = limit; /* still have at least MINSIZEARRAY free places */
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
newsize = (*size)*2;
|
|
|
|
if (newsize < MINSIZEARRAY)
|
|
|
|
newsize = MINSIZEARRAY; /* minimum size */
|
2000-12-26 10:46:09 -08:00
|
|
|
}
|
2004-11-19 07:52:40 -08:00
|
|
|
newblock = luaM_reallocv(L, block, *size, newsize, size_elems);
|
2000-12-26 10:46:09 -08:00
|
|
|
*size = newsize; /* update only when everything else is OK */
|
|
|
|
return newblock;
|
2000-01-13 08:30:47 -08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-11-19 07:52:40 -08:00
|
|
|
void *luaM_toobig (lua_State *L) {
|
|
|
|
luaG_runerror(L, "memory allocation error: block too big");
|
|
|
|
return NULL; /* to avoid warnings */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2000-01-13 08:30:47 -08:00
|
|
|
/*
|
|
|
|
** generic allocation routine.
|
|
|
|
*/
|
2004-11-19 07:52:40 -08:00
|
|
|
void *luaM_realloc (lua_State *L, void *block, size_t osize, size_t nsize) {
|
2003-10-02 13:31:17 -07:00
|
|
|
global_State *g = G(L);
|
|
|
|
lua_assert((osize == 0) == (block == NULL));
|
|
|
|
block = (*g->realloc)(g->ud, block, osize, nsize);
|
|
|
|
if (block == NULL && nsize > 0)
|
|
|
|
luaD_throw(L, LUA_ERRMEM);
|
|
|
|
lua_assert((nsize == 0) == (block == NULL));
|
2004-08-30 06:44:44 -07:00
|
|
|
g->totalbytes = (g->totalbytes - osize) + nsize;
|
2000-01-13 08:30:47 -08:00
|
|
|
return block;
|
|
|
|
}
|
|
|
|
|