mirror of
https://github.com/Mercury-Language/mercury.git
synced 2025-12-21 00:39:37 +00:00
a3644ae6cf
Estimated hours taken: 2 More cleanup of the bytecode stuff; in particular, add a `MB_' prefix to most names. bytecode/*: - Prefix all names defined in header files with `MB_' (except for `TRUE', `FALSE', `DEBUGGING', and `XXXdebug'). - Add macros `MB_new', `MB_new_array', and `MB_resize_array', and use those instead of using `MB_malloc' and `MB_resize' (formerly `mem_malloc' and `mem_resize') or malloc() and realloc() directly. Uncomment the definition of MB_strdup() now that it calls MB_malloc(). - Delete the definitions of `uchar', `uint', `ushort', `ulong' (just spell them out, its clearer and more portable that way). - Fix the indentation in a few places I missed on my previous pass. - Add a `README' file.
104 lines
2.0 KiB
C
104 lines
2.0 KiB
C
/*
|
|
** Copyright (C) 1997 University of Melbourne.
|
|
** This file may only be copied under the terms of the GNU Library General
|
|
** Public License - see the file COPYING.LIB in the Mercury distribution.
|
|
**
|
|
** $Id: mem.c,v 1.5 1997-04-26 05:57:03 fjh Exp $
|
|
*/
|
|
|
|
/* Imports */
|
|
#include <stdlib.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
|
|
#include "util.h"
|
|
#include "mem.h"
|
|
|
|
/* Exported definitions */
|
|
|
|
/* Local declarations */
|
|
|
|
static char
|
|
rcs_id[] = "$Id: mem.c,v 1.5 1997-04-26 05:57:03 fjh Exp $";
|
|
|
|
/*
|
|
* Make sure the size of guard_bytes is a multiple of 8 to ensure we
|
|
* don't get unaligned accesses, even on 64-bit architectures.
|
|
*/
|
|
static const unsigned char
|
|
guard_bytes[] = {0xa5,0xa5,0xa5,0xa5,0xa5,0xa5,0xa5,0xa5};
|
|
|
|
/* Implementation */
|
|
|
|
void*
|
|
MB_malloc(size_t size)
|
|
{
|
|
size_t real_size;
|
|
size_t guard_size;
|
|
unsigned char *real_mem, *mem;
|
|
|
|
guard_size = sizeof(guard_bytes) / sizeof(*guard_bytes);
|
|
real_size = size + 2 * guard_size;
|
|
|
|
real_mem = malloc(real_size);
|
|
if (real_mem == NULL) {
|
|
MB_fatal("mem.MB_alloc: malloc failed");
|
|
}
|
|
|
|
/*
|
|
* Now check all allocated memory for corruption.
|
|
* XXX: Fill this in later...
|
|
*/
|
|
|
|
mem = real_mem + guard_size;
|
|
return mem;
|
|
}
|
|
|
|
void
|
|
MB_free(void *mem)
|
|
{
|
|
size_t guard_size;
|
|
unsigned char *real_mem;
|
|
|
|
/*
|
|
* Check that the memory to be freed was actually allocated.
|
|
* We can't check for still-remaining references to the
|
|
* memory without some sort of memory-marking as done in
|
|
* Hans Boehm's conservative garbage collector.
|
|
*/
|
|
|
|
/*
|
|
* Check all allocated memory for corruption.
|
|
* XXX: Do this later...
|
|
*/
|
|
|
|
guard_size = sizeof(guard_bytes) / sizeof(*guard_bytes);
|
|
real_mem = (unsigned char *) mem - guard_size;
|
|
free(real_mem);
|
|
|
|
return;
|
|
}
|
|
|
|
void*
|
|
MB_realloc(void *mem, size_t size)
|
|
{
|
|
|
|
void *new_mem;
|
|
|
|
/*
|
|
* Check all allocated memory for corruption.
|
|
* XXX: Do this later...
|
|
*/
|
|
|
|
new_mem = MB_malloc(size);
|
|
memcpy(new_mem, mem, size);
|
|
|
|
/*
|
|
* Check mem was actually allocated.
|
|
* XXX: Do later...
|
|
*/
|
|
MB_free(mem);
|
|
|
|
return new_mem;
|
|
}
|