-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathutils.c
230 lines (191 loc) · 4.14 KB
/
utils.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
#include <stdio.h>
#include <stdlib.h>
#include "utils.h"
// display -----------------------------------------------------------
void display_menu()
{
printf("Select an option: \n"
"1. Create a new list \n"
"2. Insert a new element in a given list in sorted order \n"
"3. Delete an element from a given list \n"
"4. Count total elements excluding free list \n"
"5. Count total elements of a list \n"
"6. Display all lists \n"
"7. Display free list \n"
"8. Perform defragmentation \n"
"9. Press 0 to exit \n");
printf(" ****************** \n");
}
void disp_ram()
{
for (int i = 1; i <= RAMSIZE; i ++)
printf("%d (%d) |", RAM[i - 1], i);
printf(" \t ***\n");
}
// defragmentation ------------------------------------------------
void swap(int i, int j, int list_num)
{
int next = RAM[i];
int prev = RAM[i + 1];
// filled node is only node in list
if (next == -1 && prev == -1)
{
existinglists.lists_head[list_num - 1].head = j;
RAM[j + 1] = prev;
RAM[j - 1] = RAM[i - 1];
RAM[j] = next;
RAM[i - 1] = nullval;
RAM[i + 1] = nullval;
}
// filled node at end of list
else if (next == -1)
{
RAM[j] = next;
RAM[j + 1] = prev;
RAM[j - 1] = RAM[i - 1];
RAM[RAM[j + 1]] = j;
RAM[i - 1] = nullval;
}
// filled node at head of list
else if(prev == -1)
{
existinglists.lists_head[list_num].head = j;
RAM[j + 1] = prev;
RAM[j - 1] = RAM[i - 1];
RAM[RAM[next] + 1] = j;
RAM[i - 1] = nullval;
}
// in the middle
else
{
RAM[RAM[i + 1]] = j;
RAM[RAM[next] + 1] = j;
RAM[i - 1] = nullval;
}
}
void reset_order()
{
freelist.lists_head[0].head = 1;
int count = 1;
int i = 1;
RAM[i] = -1;
RAM[i - 1] = nullval;
RAM[i + 1] = nullval;
while(count < freelist.lists_head[0].size)
{
RAM[i] = i + 3;
RAM[i - 1] = nullval;
RAM[i + 1] = nullval;
i += 3;
count ++;
}
RAM[i] = -1;
}
int getlistnum(int i)
{
int prev = RAM[i + 1];
while(prev != -1)
{
prev = RAM[prev + 1];
i = RAM[i + 1];
}
for(int j = 1; j <= existinglists.size; j ++)
{
if(existinglists.lists_head[j - 1].head == i)
return j;
}
}
void get_together()
{
int index = freelist.lists_head[0].head;
int size = freelist.lists_head[0].size;
int i;
for (i = 1; i <= RAMSIZE; i += 3)
{
if (RAM[i - 1] != nullval)
break;
}
if (i == 3 * size + 1)
return ;
int j;
int list_num;
for(j = RAMSIZE - 2; j >= 1; j -= 3)
{
if(RAM[j - 1] == nullval)
break;
}
if (j <= i)
{
return ;
}
list_num = getlistnum(i);
swap(i, j, list_num);
get_together();
}
void perform_defragmentation()
{
get_together();
reset_order();
printf("SUCCESS: RAM DEFRAGMENTED \n");
}
// ---------------------------------------------------------------
// select option in menu -----------------------------------------
void select_pref_option()
{
int option = 0;
do
{
printf("Select an option between 0 and 8: ");
scanf("%d", &option);
getchar();
printf(" \n");
} while (option < 0 || option > 8);
switch(option)
{
case 1: create_new_list(); break; //done
case 2: insert_new_ele(); break; //done
case 3: delete_ele(); break; //done
case 4: count_total_ele(); break; //done
case 5: count_ele_list(); break; //done
case 6: display_lists(); break; //done
case 7: display_freelist(); break; //done
case 8: perform_defragmentation(); break; //done
case 0: exit(0); break; //done
}
printf(" \n"); printf(" \t ****************** \n"); printf(" \n");
}
// init ----------------------------------------------------------
void init_freelist()
{
freelist.lists_head = malloc(sizeof(List));
freelist.size = 1;
freelist.lists_head[0].head = 1;
freelist.lists_head[0].size = RAMSIZE / 3;
freelist.lists_head[0].id = 0;
}
void init_existinglists()
{
existinglists.lists_head = malloc(sizeof(List) * RAMSIZE / 3);
existinglists.size = 0;
}
void fill_contig_loc(int i)
{
RAM[i - 1] = nullval;
if (i == RAMSIZE - 2)
RAM[i] = -1;
else
RAM[i] = i + 3;
RAM[i + 1] = nullval;
}
void set_up_ram_int()
{
for(int i = 1; i <= RAMSIZE; i += 3)
fill_contig_loc(i);
}
void init_all()
{
init_freelist();
init_existinglists();
set_up_ram_int();
}
// ----------------------------------------------------------