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
|
/*
Time-stamp: <98/04/07 09:52:43 yusuf>
$Id: memory.c,v 1.7 1998/05/02 12:51:41 yusuf Exp $
*/
#ifndef lint
static char vcid[] = "$Id: memory.c,v 1.7 1998/05/02 12:51:41 yusuf Exp $";
#endif /* lint */
/* My memory routines. Maintains a list of currently allocated
* blocks and provides a way to delete them all in one go. Can
* only alloc a maximum of MAX_ALLOCED blocks
*/
#include "memory.h"
#define MAX_ALLOCED 50
void *alloced[MAX_ALLOCED];
void init_memory() {
int c;
for (c=0; c<MAX_ALLOCED; c++)
alloced[c] = NULL;
}
void *my_malloc(size_t size) {
int c;
for (c=0; c<MAX_ALLOCED; c++) /* look for unused block */
if (alloced[c] == NULL)
break;
if (c == MAX_ALLOCED) /* too many blocks */
return NULL; /* allocated - return error */
alloced[c] = calloc(1, size); /* allocates and clears */
return alloced[c];
}
void *my_realloc(void *block, size_t size) {
int c;
for (c=0; c<MAX_ALLOCED; c++) /* look for block */
if (alloced[c] == block)
break;
if (c == MAX_ALLOCED) /* couldn't find this block */
return NULL; /* in my list */
alloced[c] = realloc(alloced[c], size);
return alloced[c];
}
void my_free(void *block) {
int c;
for (c=0; c<MAX_ALLOCED; c++) /* look for block */
if (alloced[c] == block)
break;
if (c < MAX_ALLOCED) {
free(block); /* free block */
alloced[c] = NULL; /* remove from my list */
}
else exit(-10);
}
void my_free_all() {
int c;
for (c=0; c<MAX_ALLOCED; c++)
if (alloced[c])
my_free(alloced[c]);
}
|
