-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathalocator.c
246 lines (187 loc) · 5.45 KB
/
alocator.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
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
typedef unsigned char uchar;
typedef struct{
uchar *V;
int size;
int isEmpty;
int start_bloc;
} Arena;
//creeam arena
void initialization (Arena *arena, int size_arena){
arena->start_bloc = 0;
arena->isEmpty = 1;
arena->size = size_arena;
arena->V = (uchar *) calloc(size_arena, sizeof(uchar)) ;
}
int getNum(uchar *v){
int rez = 0,k,p=1;
for(k = 0;k<4;k++,p*=256) rez+= v[k] * p;
return rez;
}
void inNum(uchar *v, int n){
int k;
for(k=0;k<4;k++){
v[k] = n%256;
n/=256;
}
}
void finalize (Arena *arena){
free (arena->V);
}
void DUMP (Arena *arena){
int i;
for (i = 0;i < arena->size;i++) {
if (i % 16 == 0) {
if(i > 0 && (i+1) <= arena->size){
printf("\n");
}
printf("%08X\t",i);
}else{
if(i % 8 == 0) {
printf(" ");
}
}
printf("%02X ",arena->V[i]);
}
printf("\n");
}
int alocare(Arena *arena,int alloc_size){
if(arena->isEmpty){
if(arena->size-12 < alloc_size) return 0;
inNum(arena->V+8,alloc_size);
arena->isEmpty=0;
arena->start_bloc=0; //daca e gol
return 12;
}else
if(arena->start_bloc >= alloc_size + 12){ //verificam daca putem adauga inainte de primul bloc
inNum(arena->V,arena->start_bloc); // primul va fi urmatorul
inNum(arena->V+4,0); //precedentul nu exista
inNum(arena->V+8,alloc_size);
arena->start_bloc=0; //primul devine curentul (0)
return 12;
}
//cercetam spatiul dintre fiecare 2 blocuri
int curent = arena->start_bloc;
int next = getNum(arena->V + curent);
while(next != 0){
int av_size = next - (curent + 12 + getNum(arena->V+curent+8));
if(alloc_size + 12 <= av_size){ //daca putem baga
int new_bloc = (curent + 12 + getNum(arena->V+curent+8));
inNum(arena->V + curent,new_bloc);
inNum(arena->V + new_bloc,next);
inNum(arena->V + new_bloc+4,curent); // ap bagam
inNum(arena->V + new_bloc+8,alloc_size);
inNum(arena->V + next + 4,new_bloc);
return new_bloc + 12;
}else{ // daca nu
curent = next; // cautam o borta mai mare
next = getNum(arena->V + next);
}
}
//daca nu am gasit borta incercam sa adaugam la capat
// in caz ca next==0 ( curent e ultimul bloc)
int bloc_size = getNum(arena->V + curent+8);
if(arena->size - (curent + 12+bloc_size) < alloc_size + 12) return 0; // verificam daca putem adauga dupa ultimul bloc
int new_bloc = curent+12+bloc_size;
inNum(arena->V + new_bloc,0);
inNum(arena->V + new_bloc+4,curent);
inNum(arena->V + new_bloc+8,alloc_size);
inNum(arena->V + curent,new_bloc);
return new_bloc+12;
}
void Free(Arena *arena, int index){
index-=12;
int bloc_size = getNum(arena->V + index + 8);
int succ = getNum(arena->V + index);
if(index == arena->start_bloc){
arena->start_bloc = succ; // daca stergem primul bloc, atunci primul deja devine urmatorul
if(succ == 0) arena->isEmpty=1; // daca nu am avut un bloc urmator, atunci exista doar unul
}
int pred = getNum(arena->V + index + 4);
int i;
for(i=0;i<12+bloc_size;i++) arena->V[index + i] = 0;
if(succ != 0) inNum(arena->V + succ + 4, pred);
if(getNum(arena->V + pred + 8) > 0) inNum(arena->V + pred, succ);
}
void Fill(Arena *arena, int index, int cnt, int val){
int k,bloc_size = getNum(arena->V + index + 8);
for(k = 0;k<bloc_size;k++){
arena->V[index+12+k] = val;
cnt=cnt-1;
if(cnt == 0) return;
}
if(getNum(arena->V + index) != 0) Fill(arena,getNum(arena->V + index),cnt,val);
}
void parse_command(char* cmd,Arena *arena){
const char* delims = " \n";
char* cmd_name = strtok(cmd, delims);
if (!cmd_name) {
goto invalid_command;
}
if (strcmp(cmd_name, "INITIALIZE") == 0) {
char* size_str = strtok(NULL, delims);
if (!size_str) {
goto invalid_command;
}
uint32_t size = atoi(size_str);
initialization(arena,size);
} else if (strcmp(cmd_name, "FINALIZE") == 0) {
finalize(arena);
} else if (strcmp(cmd_name, "DUMP") == 0) {
DUMP(arena);
} else if (strcmp(cmd_name, "ALLOC") == 0) {
char* size_str = strtok(NULL, delims);
if (!size_str) {
goto invalid_command;
}
uint32_t size = atoi(size_str);
printf("%d\n",alocare(arena,size));
} else if (strcmp(cmd_name, "FREE") == 0) {
char* index_str = strtok(NULL, delims);
if (!index_str) {
goto invalid_command;
}
uint32_t index = atoi(index_str);
Free(arena,index);
} else if (strcmp(cmd_name, "FILL") == 0) {
char* index_str = strtok(NULL, delims);
if (!index_str) {
goto invalid_command;
}
uint32_t index = atoi(index_str);
char* size_str = strtok(NULL, delims);
if (!size_str) {
goto invalid_command;
}
uint32_t size = atoi(size_str);
char* value_str = strtok(NULL, delims);
if (!value_str) {
goto invalid_command;
}
uint32_t value = atoi(value_str);
Fill(arena,index-12,size,value);
} else {
goto invalid_command;
}
return;
invalid_command:
printf("Invalid command: %s\n", cmd);
exit(1);
}
int main(void){
ssize_t read;
char* line = NULL;
size_t len;
Arena arena;
while ((read = getline(&line, &len, stdin)) != -1) {
printf("%s", line);
parse_command(line,&arena);
free(line);
line = NULL;
}
free(line);
return 0;
}