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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
|
/*-------------------------------------------------------------------------
memmisc.c - heap handling functions
Copyright (C) 2005, 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>
void _initHeap(unsigned char _MALLOC_SPEC *dheap, unsigned int heapsize)
{
_malloc_rec _MALLOC_SPEC *pHeap;
unsigned int hsize=0;
int bsize;
pHeap = (_malloc_rec _MALLOC_SPEC *)dheap;
if (heapsize == 0) return;
/* we need one byte as the end of block list marker */
heapsize--;
while (hsize < heapsize) {
/* a guess of the next block size */
bsize = (heapsize - hsize); /* thus: bsize > 0 */
if(bsize > MAX_BLOCK_SIZE) bsize = MAX_BLOCK_SIZE;
/* now we can create the block */
pHeap->datum = bsize;
pHeap = (_malloc_rec _MALLOC_SPEC *)((unsigned int)pHeap + bsize);
hsize += bsize;
}
/* mark end of block list */
pHeap->datum = 0;
}
/* search heap starting from sBlock for a block of size bSize, merging
* adjacent blocks if necessery */
_malloc_rec _MALLOC_SPEC *_mergeHeapBlock(_malloc_rec _MALLOC_SPEC *sBlock, unsigned char bSize)
{
_malloc_rec _MALLOC_SPEC *temp;
unsigned char bLen;
unsigned char eLen;
unsigned char dat;
bLen = sBlock->bits.count;
/* current block is not enough, see if we can merge some adjacent memory
* blocks to make it fit */
temp = (_malloc_rec _MALLOC_SPEC *)((unsigned int)sBlock + bLen); //sBlock->bits.count);
eLen = bLen;
while((temp->datum) && (!temp->bits.alloc) && (eLen <= bSize)) {
eLen += (dat=temp->bits.count);
temp = (_malloc_rec _MALLOC_SPEC *)((unsigned int)temp + dat);
}
if(eLen > bSize) {
unsigned char i;
/* yes, there are some free blocks that can be merged, so merge them... */
temp = sBlock;
while(eLen > 0) {
if(eLen > MAX_BLOCK_SIZE)i = MAX_BLOCK_SIZE;
else i = eLen;
temp->datum = i;
temp = (_malloc_rec _MALLOC_SPEC *)((unsigned int)temp + i);
eLen -= i;
}
/* return block starts at the old block start address */
return (sBlock);
} else {
/* no, there are no free blocks after sBlock, so return NULL */
return ((_malloc_rec _MALLOC_SPEC *)0);
}
}
|
