-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsafe-malloc.c
261 lines (202 loc) · 6.9 KB
/
safe-malloc.c
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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
/*
GNU Lesser General Public License version 2.1
Copyright (C) 2025 Moises Aguirre "TDRR"
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This file contains some code from libGDCC's alloc.c, written by David Hill.
*/
// Intended to be linked as a replacement to libGDCC.
// (but generally it's perfectly fine to link it dynamically or statically)
#include <ACS_Zandronum.h>
#include <stddef.h>
#include <stdbool.h>
#include "safe-malloc.h"
#define BLOCK_TO_PTR(ptr) ((void SM_SPC *)(((char SM_SPC *)ptr) + sizeof(AllocBlockT)))
#define PTR_TO_BLOCK(ptr) ((AllocBlockT SM_SPC *)(((char SM_SPC *)ptr) - sizeof(AllocBlockT)))
enum
{
// The last 65536 words are used for extra script parameters, so
// let's avoid those.
HEAP_START = 0xFFFEFFFF
};
typedef struct AllocBlock
{
struct AllocBlock SM_SPC *next;
size_t size; // we only really need 31-bits unsigned anyway
bool used : 1;
bool autBlock : 2;
} AllocBlockT;
typedef struct
{
bool init;
int allocTime;
AllocBlockT SM_SPC *tail;
AllocBlockT SM_SPC *lastFreed;
} HeapHeadT;
[[call("StkCall")]]
void SM_SPC *s_malloc (register size_t size)
{
register HeapHeadT SM_SPC *head = (void SM_SPC *)(((char SM_SPC *)HEAP_START) - sizeof(*head));
register AllocBlockT SM_SPC *block;
if(!head->init)
{
head->init = true;
head->lastFreed = NULL;
block = (void SM_SPC *)(((char SM_SPC *)head) - (size + sizeof(*block) - 1));
block->autBlock = false;
block->used = true;
block->size = size;
block->next = NULL;
head->tail = block;
return BLOCK_TO_PTR(block);
}
block = head->tail;
do
{
if(block->used || (size > block->size) )
continue;
#ifdef DEBUG_MODE
ACS_BeginPrintBold(); ACS_PrintString(s"Found an acceptable block at "); ACS_PrintHex((int)block); ACS_EndPrintBold();
#endif
// We should split off the block here (4 words is the minimum useful allocation).
if((block->size - size) >= (sizeof(*block) + 4))
{
AllocBlockT SM_SPC *splitBlock = (void SM_SPC *)(((char SM_SPC *)block) + size + sizeof(*block));
splitBlock->used = false;
splitBlock->autBlock = false;
splitBlock->size = block->size - sizeof(*block) - size;
splitBlock->next = block->next;
block->next = splitBlock;
block->size = size;
#ifdef DEBUG_MODE
ACS_BeginPrintBold(); ACS_PrintString(s"Split block "); ACS_PrintHex((int)block); ACS_PrintString(s" to "); ACS_PrintHex((int)splitBlock); ACS_EndPrintBold();
ACS_BeginPrintBold(); ACS_PrintString(s"next is "); ACS_PrintHex((int)splitBlock->next); ACS_EndPrintBold();
#endif
}
block->used = true;
return BLOCK_TO_PTR(block);
} while((block = block->next));
// No acceptable blocks found, so let's "grow" the heap.
block = (void SM_SPC *)(((char SM_SPC *)head->tail) - (sizeof(*block) + size));
#ifdef DEBUG_MODE
ACS_BeginPrintBold(); ACS_PrintString(s"Grew the heap for block "); ACS_PrintHex((int)block); ACS_EndPrintBold();
#endif
block->used = true;
block->size = size;
block->next = head->tail;
head->tail = block;
return BLOCK_TO_PTR(block);
}
[[call("StkCall")]]
void s_free (register void SM_SPC *ptr)
{
if(!ptr)
return;
register AllocBlockT SM_SPC *block = PTR_TO_BLOCK(ptr);
// Should merge blocks here.
if( (block->next) && (!block->next->used) )
{
#ifdef DEBUG_MODE
ACS_BeginPrintBold(); ACS_PrintString(s"Merging blocks "); ACS_PrintHex((int)block); ACS_PrintString(s" and "); ACS_PrintHex((int)block->next); ACS_EndPrintBold();
#endif
block->size += block->next->size + sizeof(*block);
block->next = block->next->next;
}
block->used = false;
block->autBlock = false;
}
[[call("StkCall")]]
void SM_SPC *s_realloc (register void SM_SPC *oldPtr, register size_t size)
{
if(!oldPtr)
return (size) ? s_malloc(size) : NULL;
if(!size)
{
s_free(oldPtr);
return NULL;
}
register AllocBlockT SM_SPC *oldBlock = PTR_TO_BLOCK(oldPtr);
if(oldBlock->size >= size)
return oldPtr;
register void SM_SPC *ptr = s_malloc(size);
for(int i = 0; i < oldBlock->size; i++)
((char SM_SPC *)ptr)[i] = ((char SM_SPC *)oldPtr)[i];
s_free(oldPtr);
return ptr;
}
[[call("StkCall")]]
void SM_SPC *s_calloc (register size_t nmemb, register size_t size)
{
register char SM_SPC *ptr = s_malloc(size *= nmemb);
for(register char SM_SPC *iter = ptr; size--;)
*iter++ = 0;
return ptr;
}
[[call("StkCall")]]
static void AllocFreeAut (void)
{
register AllocBlockT SM_SPC *block = ((HeapHeadT SM_SPC *)(((char SM_SPC *)HEAP_START) - sizeof(HeapHeadT)))->tail;
while((block = block->next))
{
if(block->used && block->autBlock)
s_free(block);
}
}
[[call("ScriptS"), script("open"), alloc_Aut(0)]]
static void AllocTimeSet(void)
{
if(!ACS_Timer())
ACS_Delay(1);
if(ACS_Timer() == 1)
((HeapHeadT SM_SPC *)(((char SM_SPC *)HEAP_START) - sizeof(HeapHeadT)))->allocTime = 1;
}
// AFAICT this function is essentially just realloc so I'll simply call s_realloc for it.
// I *think* this is only called by libc. This also means the libc functions are already
// using the new allocator but we also need to account for anyone not using libc at all (me).
[[call("StkCall")]]
void SM_SPC *__GDCC__alloc (register void SM_SPC *oldPtr, size_t size)
{
return s_realloc(oldPtr, size);
}
// Internal functions called by GDCC for allocating/freeing the auto stack for every script.
[[call("StkCall")]]
void SM_SPC *__GDCC__Plsa(register unsigned int size)
{
register int SM_SPC *allocTime = &((HeapHeadT SM_SPC *)(((char SM_SPC *)HEAP_START) - sizeof(HeapHeadT)))->allocTime;
// [DavidPH] Check if a new hub was entered. If so, free automatic storage.
if(*allocTime > ACS_Timer())
AllocFreeAut();
*allocTime = ACS_Timer();
register AllocBlockT SM_SPC *ptr = s_malloc(size);
PTR_TO_BLOCK(ptr)->autBlock = true;
return ptr;
}
[[call("StkCall")]]
void __GDCC__Plsf(void SM_SPC *ptr)
{
s_free(ptr);
}
// Not sure where this is called from? I'm just using it manually.
[[call("StkCall")]]
void __GDCC__alloc_dump(void)
{
register AllocBlockT SM_SPC *block = ((HeapHeadT SM_SPC *)(((char SM_SPC *)HEAP_START) - sizeof(HeapHeadT)))->tail;
if(!block)
return;
do
{
ACS_BeginPrint();
ACS_PrintHex((int)block);
ACS_PrintString(s" - next: ");
ACS_PrintHex((int)block->next);
ACS_PrintString(s", size: ");
ACS_PrintHex(block->size);
ACS_PrintString(s", used: ");
ACS_PrintString((block->used) ? s"true" : s"false");
ACS_PrintString(s", autBlock: ");
ACS_PrintString((block->autBlock) ? s"true" : s"false");
ACS_EndPrint();
} while((block = block->next));
}