This repository has been archived by the owner on Nov 28, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 566
/
Copy pathalloc.c
84 lines (74 loc) · 1.43 KB
/
alloc.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
#include <stdlib.h>
#include <stdio.h>
static int _g = 0;
void * _pbcM_malloc(size_t sz) {
++ _g;
return malloc(sz);
}
void _pbcM_free(void *p) {
if (p) {
-- _g;
free(p);
}
}
void* _pbcM_realloc(void *p, size_t sz) {
return realloc(p,sz);
}
void _pbcM_memory() {
printf("%d\n",_g);
}
struct heap_page {
struct heap_page * next;
};
struct heap {
struct heap_page *current;
int size;
int used;
};
struct heap *
_pbcH_new(int pagesize) {
int cap = 1024;
while(cap < pagesize) {
cap *= 2;
}
struct heap * h = (struct heap *)_pbcM_malloc(sizeof(struct heap));
h->current = (struct heap_page *)_pbcM_malloc(sizeof(struct heap_page) + cap);
h->size = cap;
h->used = 0;
h->current->next = NULL;
return h;
}
void
_pbcH_delete(struct heap *h) {
struct heap_page * p = h->current;
struct heap_page * next = p->next;
for(;;) {
_pbcM_free(p);
if (next == NULL)
break;
p = next;
next = p->next;
}
_pbcM_free(h);
}
void*
_pbcH_alloc(struct heap *h, int size) {
size = (size + 3) & ~3;
if (h->size - h->used < size) {
struct heap_page * p;
if (size < h->size) {
p = (struct heap_page *)_pbcM_malloc(sizeof(struct heap_page) + h->size);
} else {
p = (struct heap_page *)_pbcM_malloc(sizeof(struct heap_page) + size);
}
p->next = h->current;
h->current = p;
h->used = size;
return (p+1);
} else {
char * buffer = (char *)(h->current + 1);
buffer += h->used;
h->used += size;
return buffer;
}
}