lua/lmem.c

141 lines
3.0 KiB
C
Raw Normal View History

1997-09-16 23:25:59 +04:00
/*
** $Id: lmem.c,v 1.19 1999/10/19 13:33:22 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 "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
#define MINSIZE 8 /* minimum size for "growing" vectors */
1997-09-16 23:25:59 +04:00
1999-02-26 18:50:10 +03:00
1999-02-25 18:16:26 +03:00
static unsigned long power2 (unsigned long n) {
unsigned long p = MINSIZE;
while (p<=n) p<<=1;
return p;
}
void *luaM_growaux (lua_State *L, void *block, unsigned long nelems, int inc, int size,
1999-08-17 00:52:00 +04:00
const char *errormsg, unsigned long limit) {
1999-02-25 18:16:26 +03:00
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 < MINSIZE)) /* or block already is MINSIZE? */
return block; /* do not need to reallocate */
else /* it crossed a power of 2 boundary; grow to next power */
return luaM_realloc(L, block, power2(newn)*size);
1997-09-16 23:25:59 +04:00
}
#ifndef DEBUG
1997-09-16 23:25:59 +04:00
/*
** generic allocation routine.
*/
void *luaM_realloc (lua_State *L, void *block, unsigned long size) {
1997-09-16 23:25:59 +04:00
size_t s = (size_t)size;
if (s != size)
lua_error(L, "memory allocation error: block too big");
1997-09-16 23:25:59 +04:00
if (size == 0) {
free(block); /* block may be NULL, that is OK for free */
1997-09-16 23:25:59 +04:00
return NULL;
}
block = realloc(block, s);
1997-09-16 23:25:59 +04:00
if (block == NULL)
lua_error(L, memEM);
1997-09-16 23:25:59 +04:00
return block;
}
#else
/* DEBUG */
#include <string.h>
#define HEADER (sizeof(double))
#define MARKSIZE 16
1997-09-16 23:25:59 +04:00
#define MARK 55
#define blocksize(b) ((unsigned long *)((char *)(b) - HEADER))
unsigned long numblocks = 0;
unsigned long totalmem = 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++)
LUA_ASSERT(L, *(((char *)b)+HEADER+size+i) == MARK+i, "corrupted block");
1999-08-17 00:52:00 +04:00
numblocks--;
totalmem -= size;
return b;
}
static void freeblock (void *block) {
1999-08-17 00:52:00 +04:00
if (block) {
memset(block, -1, *blocksize(block)); /* erase block */
1999-08-17 00:52:00 +04:00
block = checkblock(block);
free(block);
}
1997-09-16 23:25:59 +04:00
}
void *luaM_realloc (lua_State *L, void *block, unsigned long size) {
unsigned long realsize = HEADER+size+MARKSIZE;
1997-09-16 23:25:59 +04:00
if (realsize != (size_t)realsize)
lua_error(L, "memory allocation error: block too big");
if (size == 0) {
freeblock(block);
return NULL;
}
else {
char *newblock = malloc(realsize);
int i;
1997-09-16 23:25:59 +04:00
if (block) {
unsigned long 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
}
if (newblock == NULL)
lua_error(L, memEM);
totalmem += size;
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
}
}
#endif