lua/lmem.c

141 lines
3.4 KiB
C
Raw Normal View History

1997-09-16 23:25:59 +04:00
/*
2000-03-03 17:58:26 +03:00
** $Id: lmem.c,v 1.25 2000/02/08 16:34:31 roberto Exp roberto $
1997-09-16 23:25:59 +04:00
** Interface to Memory Manager
** See Copyright Notice in lua.h
*/
#include <stdlib.h>
#define LUA_REENTRANT
1997-09-16 23:25:59 +04:00
#include "lmem.h"
#include "lobject.h"
#include "lstate.h"
1997-09-16 23:25:59 +04:00
#include "lua.h"
/*
1999-02-26 18:50:10 +03:00
** real ANSI systems do not need these tests;
** but some systems (Sun OS) are not that ANSI...
*/
#ifdef OLD_ANSI
#define realloc(b,s) ((b) == NULL ? malloc(s) : (realloc)(b, s))
#define free(b) if (b) (free)(b)
#endif
1997-09-16 23:25:59 +04:00
#ifdef DEBUG
1997-09-16 23:25:59 +04:00
/*
** {======================================================================
** Controled version for realloc.
** =======================================================================
1997-09-16 23:25:59 +04:00
*/
#include <assert.h>
#include <string.h>
1997-09-16 23:25:59 +04:00
#define realloc(b, s) debug_realloc(b, s)
#define malloc(b) debug_realloc(NULL, 0)
#define free(b) debug_realloc(b, 0)
1997-09-16 23:25:59 +04:00
2000-03-03 17:58:26 +03:00
/* ensures maximum alignment for HEADER */
#define HEADER (sizeof(double)>sizeof(long) ? sizeof(double) : sizeof(long))
#define MARKSIZE 16
#define MARK 0x55 /* 01010101 (a nice pattern) */
1997-09-16 23:25:59 +04:00
#define blocksize(b) ((unsigned long *)((char *)(b) - HEADER))
unsigned long memdebug_numblocks = 0;
unsigned long memdebug_total = 0;
1997-09-16 23:25:59 +04:00
static void *checkblock (void *block) {
1999-08-17 00:52:00 +04:00
unsigned long *b = blocksize(block);
unsigned long size = *b;
int i;
for (i=0;i<MARKSIZE;i++)
assert(*(((char *)b)+HEADER+size+i) == MARK+i); /* corrupted block? */
memdebug_numblocks--;
memdebug_total -= size;
1999-08-17 00:52:00 +04:00
return b;
}
static void freeblock (void *block) {
1999-08-17 00:52:00 +04:00
if (block) {
size_t size = *blocksize(block);
1999-08-17 00:52:00 +04:00
block = checkblock(block);
memset(block, -1, size+HEADER+MARKSIZE); /* erase block */
(free)(block); /* free original block */
1999-08-17 00:52:00 +04:00
}
1997-09-16 23:25:59 +04:00
}
static void *debug_realloc (void *block, size_t size) {
if (size == 0) {
freeblock(block);
return NULL;
}
else {
2000-03-03 17:58:26 +03:00
size_t realsize = HEADER+size+MARKSIZE;
2000-02-08 19:39:42 +03:00
char *newblock = (char *)(malloc)(realsize); /* alloc a new block */
int i;
2000-03-03 17:58:26 +03:00
if (newblock == NULL) return NULL;
1997-09-16 23:25:59 +04:00
if (block) {
size_t oldsize = *blocksize(block);
if (oldsize > size) oldsize = size;
memcpy(newblock+HEADER, block, oldsize);
freeblock(block); /* erase (and check) old copy */
1997-09-16 23:25:59 +04:00
}
memdebug_total += size;
memdebug_numblocks++;
*(unsigned long *)newblock = size;
for (i=0;i<MARKSIZE;i++)
1999-10-19 17:33:22 +04:00
*(newblock+HEADER+size+i) = (char)(MARK+i);
return newblock+HEADER;
1997-09-16 23:25:59 +04:00
}
}
/* }====================================================================== */
1997-09-16 23:25:59 +04:00
#endif
void *luaM_growaux (lua_State *L, void *block, unsigned long nelems,
int inc, int size, const char *errormsg, unsigned long limit) {
unsigned long newn = nelems+inc;
if (newn >= limit) lua_error(L, errormsg);
if ((newn ^ nelems) <= nelems || /* still the same power-of-2 limit? */
(nelems > 0 && newn < MINPOWER2)) /* or block already is MINPOWER2? */
return block; /* do not need to reallocate */
else /* it crossed a power-of-2 boundary; grow to next power */
return luaM_realloc(L, block, luaO_power2(newn)*size);
}
/*
** generic allocation routine.
*/
void *luaM_realloc (lua_State *L, void *block, unsigned long size) {
if (size == 0) {
free(block); /* block may be NULL; that is OK for free */
return NULL;
}
2000-03-03 17:58:26 +03:00
else if ((size_t)size != size)
lua_error(L, "memory allocation error: block too big");
block = realloc(block, size);
if (block == NULL)
lua_error(L, memEM);
return block;
}