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
|
/*** MEMORY.C ***/
#include <stdio.h>
#include <stdlib.h> /* malloc(), exit() */
#include "vdefs.h"
extern int sqrt_nsites, siteidx ;
char** memory_map;
int nallocs = 0;
void
freeinit(Freelist * fl, int size)
{
fl->head = (Freenode *)NULL ;
fl->nodesize = size ;
}
char *
getfree(Freelist * fl)
{
int i ;
Freenode * t ;
if (fl->head == (Freenode *)NULL)
{
t = (Freenode *) myalloc(sqrt_nsites * fl->nodesize) ;
for(i = 0 ; i < sqrt_nsites ; i++)
{
makefree((Freenode *)((char *)t+i*fl->nodesize), fl) ;
}
}
t = fl->head ;
fl->head = (fl->head)->nextfree ;
return ((char *)t) ;
}
void
makefree(Freenode * curr, Freelist * fl)
{
curr->nextfree = fl->head ;
fl->head = curr ;
}
int total_alloc;
char *
myalloc(unsigned n)
{
char * t ;
if ((t=(char*)malloc(n)) == (char *) 0)
{
fprintf(stderr,"Insufficient memory processing site %d (%d bytes in use, asked for %u)\n",
siteidx, total_alloc, n) ;
exit(0) ;
}
total_alloc += n ;
if (nallocs % 1000 == 0)
{
if (nallocs == 0) {
Newz(0, memory_map, (nallocs+1000), char*);
} else {
Renew(memory_map, (nallocs+1000), char*);
Zero( memory_map+nallocs, 1000, char*);
}
total_alloc += (1000 * sizeof(void *));
}
memory_map[nallocs++] = t;
return (t) ;
}
void free_all(void)
{
int i;
for (i=0; i<nallocs; i++)
{
if (memory_map[i] != (char*)0)
{
Safefree(memory_map[i]);
memory_map[i] = (char*)0;
}
}
Safefree(memory_map);
nallocs = 0;
total_alloc = 0;
}
|
