-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.c
153 lines (134 loc) · 3.36 KB
/
main.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
#include <unistd.h>
#include <string.h>
#include <pthread.h>
#include <stdio.h>
typedef char ALIGN[16];
union header {
struct {
size_t size;
unsigned is_free;
union header *next;
} s;
ALIGN stub;
};
typedef union header header_t;
header_t *head, *tail;
pthread_mutex_t global_malloc_lock;
header_t *get_free_block(size_t size)
{
header_t *curr = head;
while(curr) {
if (curr->s.is_free && curr->s.size >= size)
return curr;
curr = curr->s.next;
}
return NULL;
}
void * new_malloc(size_t size){
size_t total_size;
void *block;
header_t *header;
if (!size)
return NULL;
pthread_mutex_lock(&global_malloc_lock);
header = get_free_block(size);
if (header) {
header->s.is_free = 0;
pthread_mutex_unlock(&global_malloc_lock);
return (void*)(header + 1);
}
total_size = sizeof(header_t) + size;
block = sbrk(total_size);
if (block == (void*) -1) {
pthread_mutex_unlock(&global_malloc_lock);
return NULL;
}
header = block;
header->s.size = size;
header->s.is_free = 0;
header->s.next = NULL;
if (!head)
head = header;
if (tail)
tail->s.next = header;
tail = header;
pthread_mutex_unlock(&global_malloc_lock);
return (void*)(header + 1);
}
void new_free(void * block){
header_t *header, *tmp;
/* program break is the end of the process's data segment */
void *programbreak;
if (!block)
return;
pthread_mutex_lock(&global_malloc_lock);
header = (header_t*)block - 1;
/* sbrk(0) gives the current program break address */
programbreak = sbrk(0);
/*
Check if the block to be freed is the last one in the
linked list. If it is, then we could shrink the size of the
heap and release memory to OS. Else, we will keep the block
but mark it as free.
*/
if ((char*)block + header->s.size == programbreak) {
if (head == tail) {
head = tail = NULL;
} else {
tmp = head;
while (tmp) {
if(tmp->s.next == tail) {
tmp->s.next = NULL;
tail = tmp;
}
tmp = tmp->s.next;
}
}
/*
sbrk() with a negative argument decrements the program break.
So memory is released by the program to OS.
*/
sbrk(0 - header->s.size - sizeof(header_t));
/* Note: This lock does not really assure thread
safety, because sbrk() itself is not really
thread safe. Suppose there occurs a foregin sbrk(N)
after we find the program break and before we decrement
it, then we end up realeasing the memory obtained by
the foreign sbrk().
*/
pthread_mutex_unlock(&global_malloc_lock);
return;
}
header->s.is_free = 1;
pthread_mutex_unlock(&global_malloc_lock);
}
void print_mem_list()
{
header_t *curr = head;
printf("head = %p, tail = %p \n", (void*)head, (void*)tail);
while(curr) {
printf("addr = %p, size = %zu, is_free=%u, next=%p\n",
(void*)curr, curr->s.size, curr->s.is_free, (void*)curr->s.next);
curr = curr->s.next;
}
}
int main(){
int bytes;
int * addr;
void * returned;
printf("Enter bytes: \n");
scanf("%d", &bytes);
printf("Enter addr: \n");
scanf("%p", &addr);
returned = new_malloc(bytes);
printf("Returned 1: %p\n", returned);
header_t *curr = head;
printf("head = %p, tail = %p \n", (void*)head, (void*)tail);
while(curr) {
printf("addr = %p, size = %zu, is_free=%u, next=%p\n",
(void*)curr, curr->s.size, curr->s.is_free, (void*)curr->s.next);
curr = curr->s.next;
}
new_free(returned);
return 0;
}