Files
FC1/CryScriptSystem/LUA/lmem.c
romkazvo 34d6c5d489 123
2023-08-07 19:29:24 +08:00

94 lines
2.2 KiB
C

/*
** $Id: lmem.c,v 1.49 2001/03/26 14:31:49 roberto Exp $
** Interface to Memory Manager
** See Copyright Notice in lua.h
*/
#include <stdlib.h>
#include <stdio.h>
#define LUA_PRIVATE
#include "lua.h"
#include "ldo.h"
#include "lmem.h"
#include "lobject.h"
#include "lstate.h"
#ifndef l_realloc
#include <CryMemoryManager.h>
int gLuaAllocatedMemory = 0;
#ifndef _DEBUG
#define l_realloc(b,os,s) CryModuleReallocSize(b,os,s)
#define l_free(b,s) CryModuleFreeSize(b,s)
#else
#include "..\RecycleAllocator.h"
#define l_realloc(b,os,s) recycle_realloc(b,os,s)
#define l_free(b,s) recycle_free(b,s)
#endif
#endif
void *luaM_growaux (lua_State *L, void *block, int *size, int size_elems,
int limit, const l_char *errormsg) {
void *newblock;
int newsize = (*size)*2;
if (newsize < MINPOWER2)
newsize = MINPOWER2; /* minimum size */
else if (*size >= limit/2) { /* cannot double it? */
if (*size < limit - MINPOWER2) /* try something smaller... */
newsize = limit; /* still have at least MINPOWER2 free places */
else luaD_error(L, errormsg);
}
newblock = luaM_realloc(L, block, (lu_mem)(*size)*(lu_mem)size_elems,
(lu_mem)newsize*(lu_mem)size_elems);
*size = newsize; /* update only when everything else is OK */
return newblock;
}
extern int g_dumpStackOnAlloc;
extern void DumpCallStack( lua_State *L );
/*
** generic allocation routine.
*/
void *luaM_realloc (lua_State *L, void *block, lu_mem oldsize, lu_mem size) {
// char sTemp[100];
if (size == 0) {
gLuaAllocatedMemory -= oldsize;
l_free(block, oldsize); /* block may be NULL; that is OK for free */
block = NULL;
}
else if (size >= MAX_SIZET)
luaD_error(L, l_s("memory allocation error: block too big"));
else {
if (g_dumpStackOnAlloc && oldsize == 0)
{
// Only consider first allocation (malloc)
DumpCallStack( L );
}
gLuaAllocatedMemory += size - oldsize;
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;
}