1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
|
/*-------------------------------------------------------------------------
realloc.c - dynamic memory allocation
Copyright (C) 2004, Vangelis Rokas <vrokas at otenet.gr>
This library is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 2, or (at your option) any
later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this library; see the file COPYING. If not, write to the
Free Software Foundation, 51 Franklin Street, Fifth Floor, Boston,
MA 02110-1301, USA.
As a special exception, if you link this library with other files,
some of which are compiled with SDCC, to produce an executable,
this library does not by itself cause the resulting executable to
be covered by the GNU General Public License. This exception does
not however invalidate any other reasons why the executable file
might be covered by the GNU General Public License.
-------------------------------------------------------------------------*/
#include <malloc.h>
extern unsigned char _MALLOC_SPEC *heap;
unsigned char _MALLOC_SPEC *realloc(unsigned char _MALLOC_SPEC *mblock, unsigned char len)
{
_malloc_rec _MALLOC_SPEC *pHeap; /* pointer to block header */
_malloc_rec _MALLOC_SPEC *temp;
unsigned char bLen; /* size of block */
if(len >= MAX_BLOCK_SIZE)
return ((unsigned char _MALLOC_SPEC *)0);
/* if mblock is NULL, then same as malloc */
if(!mblock)
return (malloc(len));
/* if len is 0 */
if(len == 0) {
free(mblock);
return ((unsigned char _MALLOC_SPEC *)0);
}
pHeap = (_malloc_rec _MALLOC_SPEC *)((unsigned int)mblock - 1);
bLen = pHeap->bits.count;
/* block too small for len bytes + 1 byte header <===> bLen < len + 1 <===> blen <= len */
if (bLen <= len) {
/* so, new segment has size bigger than the old one, we can return a
* valid pointer only when after the block there is an empty block that
* can be merged to produce a new block of the requested size, otherwise
* we return NULL */
temp = _mergeHeapBlock(pHeap, len);
if(!temp) {
/* no could not find a valid block, return NULL */
return ((unsigned char _MALLOC_SPEC *)0);
}
//pHeap = temp; /* temp == pHeap */
bLen = pHeap->bits.count;
}
len++; /* increase to also count the header */
if(bLen > len) {
/* new segment is smaller than the old one (or the merged one), that's easy! */
pHeap->bits.count = len;
temp = (_malloc_rec _MALLOC_SPEC *)((unsigned int)pHeap + len);
temp->bits.alloc = 0;
temp->bits.count = bLen - len;
}
return (mblock);
}
|
