mirror of
https://github.com/lua/lua.git
synced 2024-11-24 02:33:48 +08:00
72 lines
1.7 KiB
C
72 lines
1.7 KiB
C
/*
|
|
** $Id: lmem.c,v 1.51 2001/10/25 19:13:33 roberto Exp $
|
|
** Interface to Memory Manager
|
|
** See Copyright Notice in lua.h
|
|
*/
|
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include "lua.h"
|
|
|
|
#include "ldo.h"
|
|
#include "lmem.h"
|
|
#include "lobject.h"
|
|
#include "lstate.h"
|
|
|
|
|
|
|
|
#ifndef l_realloc
|
|
#define l_realloc(b,os,s) realloc(b,s)
|
|
#define l_free(b,s) free(b)
|
|
#endif
|
|
|
|
|
|
#define MINSIZEARRAY 4
|
|
|
|
|
|
void *luaM_growaux (lua_State *L, void *block, int *size, int size_elems,
|
|
int limit, const char *errormsg) {
|
|
void *newblock;
|
|
int newsize = (*size)*2;
|
|
if (newsize < MINSIZEARRAY)
|
|
newsize = MINSIZEARRAY; /* minimum size */
|
|
else if (*size >= limit/2) { /* cannot double it? */
|
|
if (*size < limit - MINSIZEARRAY) /* try something smaller... */
|
|
newsize = limit; /* still have at least MINSIZEARRAY free places */
|
|
else luaD_error(L, errormsg);
|
|
}
|
|
newblock = luaM_realloc(L, block,
|
|
cast(lu_mem, *size)*cast(lu_mem, size_elems),
|
|
cast(lu_mem, newsize)*cast(lu_mem, size_elems));
|
|
*size = newsize; /* update only when everything else is OK */
|
|
return newblock;
|
|
}
|
|
|
|
|
|
/*
|
|
** generic allocation routine.
|
|
*/
|
|
void *luaM_realloc (lua_State *L, void *block, lu_mem oldsize, lu_mem size) {
|
|
if (size == 0) {
|
|
l_free(block, oldsize); /* block may be NULL; that is OK for free */
|
|
block = NULL;
|
|
}
|
|
else if (size >= MAX_SIZET)
|
|
luaD_error(L, "memory allocation error: block too big");
|
|
else {
|
|
block = l_realloc(block, oldsize, size);
|
|
if (block == NULL) {
|
|
if (L)
|
|
luaD_breakrun(L, LUA_ERRMEM); /* break run without error message */
|
|
else return NULL; /* error before creating state! */
|
|
}
|
|
}
|
|
if (L && G(L)) {
|
|
G(L)->nblocks -= oldsize;
|
|
G(L)->nblocks += size;
|
|
}
|
|
return block;
|
|
}
|
|
|