2002-11-05 20:21:14 +00:00
|
|
|
/*****************************************************************************/
|
|
|
|
/* */
|
|
|
|
/* realloc.c */
|
|
|
|
/* */
|
|
|
|
/* Change the size of an allocated memory block */
|
|
|
|
/* */
|
|
|
|
/* */
|
|
|
|
/* */
|
2004-12-19 23:09:38 +00:00
|
|
|
/* (C) 1998-2004 Ullrich von Bassewitz */
|
2002-11-05 20:21:14 +00:00
|
|
|
/* Wacholderweg 14 */
|
|
|
|
/* D-70597 Stuttgart */
|
|
|
|
/* EMail: uz@musoftware.de */
|
|
|
|
/* */
|
|
|
|
/* */
|
|
|
|
/* This software is provided 'as-is', without any expressed or implied */
|
|
|
|
/* warranty. In no event will the authors be held liable for any damages */
|
|
|
|
/* arising from the use of this software. */
|
|
|
|
/* */
|
|
|
|
/* Permission is granted to anyone to use this software for any purpose, */
|
|
|
|
/* including commercial applications, and to alter it and redistribute it */
|
|
|
|
/* freely, subject to the following restrictions: */
|
|
|
|
/* */
|
|
|
|
/* 1. The origin of this software must not be misrepresented; you must not */
|
|
|
|
/* claim that you wrote the original software. If you use this software */
|
|
|
|
/* in a product, an acknowledgment in the product documentation would be */
|
|
|
|
/* appreciated but is not required. */
|
|
|
|
/* 2. Altered source versions must be plainly marked as such, and must not */
|
|
|
|
/* be misrepresented as being the original software. */
|
|
|
|
/* 3. This notice may not be removed or altered from any source */
|
|
|
|
/* distribution. */
|
|
|
|
/* */
|
|
|
|
/*****************************************************************************/
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
2003-02-01 12:22:09 +00:00
|
|
|
#include <_heap.h>
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
2002-11-05 20:21:14 +00:00
|
|
|
void* __fastcall__ realloc (void* block, size_t size)
|
2000-05-28 13:40:48 +00:00
|
|
|
{
|
2004-12-19 23:09:38 +00:00
|
|
|
struct usedblock* b;
|
|
|
|
struct usedblock* newblock;
|
2000-05-28 13:40:48 +00:00
|
|
|
unsigned oldsize;
|
2004-12-19 23:09:38 +00:00
|
|
|
unsigned newhptr;
|
2000-05-28 13:40:48 +00:00
|
|
|
int diff;
|
|
|
|
|
|
|
|
/* Check the block parameter */
|
|
|
|
if (!block) {
|
|
|
|
/* Block is NULL, same as malloc */
|
|
|
|
return malloc (size);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Check the size parameter */
|
|
|
|
if (size == 0) {
|
|
|
|
/* Block is not NULL, but size is: free the block */
|
|
|
|
free (block);
|
2004-12-19 23:09:38 +00:00
|
|
|
return 0;
|
2000-05-28 13:40:48 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Make the internal used size from the given size */
|
|
|
|
size += HEAP_ADMIN_SPACE;
|
|
|
|
if (size < sizeof (struct freeblock)) {
|
|
|
|
size = sizeof (struct freeblock);
|
|
|
|
}
|
|
|
|
|
2004-12-19 23:09:38 +00:00
|
|
|
/* The word below the user block contains a pointer to the start of the
|
|
|
|
* raw memory block. The first word of this raw memory block is the full
|
|
|
|
* size of the block. Get a pointer to the real block, get the old block
|
|
|
|
* size.
|
|
|
|
*/
|
|
|
|
b = (((struct usedblock*) block) - 1)->start;
|
|
|
|
oldsize = b->size;
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
/* Get the size difference as a signed quantity */
|
|
|
|
diff = size - oldsize;
|
|
|
|
|
|
|
|
/* Is the block at the current heap top? */
|
2004-12-19 23:09:38 +00:00
|
|
|
if (((unsigned) b) + oldsize == ((unsigned) _heapptr)) {
|
2000-05-28 13:40:48 +00:00
|
|
|
/* Check if we've enough memory at the heap top */
|
2004-12-19 23:09:38 +00:00
|
|
|
newhptr = ((unsigned) _heapptr) + diff;
|
|
|
|
if (newhptr <= ((unsigned) _heapend)) {
|
2000-05-28 13:40:48 +00:00
|
|
|
/* Ok, there's space enough */
|
2003-02-01 12:22:09 +00:00
|
|
|
_heapptr = (unsigned*) newhptr;
|
2004-12-19 23:09:38 +00:00
|
|
|
b->size = size;
|
|
|
|
b->start = b;
|
2000-05-28 13:40:48 +00:00
|
|
|
return block;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* The given block was not located on top of the heap, or there's no
|
|
|
|
* room left. Try to allocate a new block and copy the data.
|
|
|
|
*/
|
|
|
|
if (newblock = malloc (size)) {
|
2000-06-25 13:17:26 +00:00
|
|
|
|
2004-12-19 23:09:38 +00:00
|
|
|
/* Adjust the old size to the user visible portion */
|
|
|
|
oldsize -= HEAP_ADMIN_SPACE;
|
2000-06-25 13:17:26 +00:00
|
|
|
|
2004-12-19 23:09:38 +00:00
|
|
|
/* If the new block is larger than the old one, copy the old
|
|
|
|
* data only
|
|
|
|
*/
|
|
|
|
if (size > oldsize) {
|
|
|
|
size = oldsize;
|
|
|
|
}
|
2000-06-25 13:17:26 +00:00
|
|
|
|
2004-12-19 23:09:38 +00:00
|
|
|
/* Copy the block data */
|
2000-06-25 13:17:26 +00:00
|
|
|
memcpy (newblock, block, size);
|
2000-05-28 13:40:48 +00:00
|
|
|
free (block);
|
|
|
|
}
|
|
|
|
return newblock;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2004-12-19 23:09:38 +00:00
|
|
|
|