-
Notifications
You must be signed in to change notification settings - Fork 0
/
DiskSch.c
163 lines (163 loc) · 3.27 KB
/
DiskSch.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
#include<stdio.h>
#include<math.h>
typedef struct diskInfo {
int trackNo;
int if_scanned;
} DI;
DI diskSch[200];
DI temptable[200];
int disk_pos = 0;
int counter(DI disk[]) {
int i = 0;
while (1) {
if (disk[i].trackNo != -1) {
i++;
}
else break;
}
return i;
}
void rstScan(DI diskSch[]) {
for (int a = 0; a < 200; a++) {
diskSch[a].if_scanned = 0;
}
}
int findPos(DI disk[]) {
int i = 0;
while (1) {
if (disk[i].trackNo != -1)
{
if (disk_pos <= disk[i].trackNo) break;
else i++;
}
else break;
}
return i;
}
void diskJobinit(DI disk[]) {
for (int a = 0; a < 200; a++) {
disk[a].trackNo = -1;
rstScan(disk);
}
int i = 0;
while (i < 200) {
int trackNum;
printf("请输入需要访问的磁道号(输入-1以退出):\n");
scanf_s("%d", &trackNum);
if (trackNum == -1) break;
else {
diskSch[i].trackNo = trackNum;
i++;
}
system("CLS");
}
}
void jobSorter(DI disk[]){
for (int i = 0; i < 200; i++) {
for (int j = 0; j < 199; j++) {
int temp;
if (disk[j].trackNo > disk[j + 1].trackNo && disk[j].trackNo != -1 && disk[j+1].trackNo != -1) {
temp = disk[j].trackNo;
disk[j].trackNo = disk[j + 1].trackNo;
disk[j + 1].trackNo = temp;
}
}
}
}
void init(DI disk[]) {
system("COLOR 1f");
diskJobinit(disk);
system("CLS");
printf("请输入磁头位置:\n");
scanf_s("%d", &disk_pos);
system("CLS");
jobSorter(disk);
}
void func_C_look(DI disk[]) {
printf("C-LOOK算法磁道扫描顺序:\n");
rstScan(disk);
int i = findPos(disk);
printf("%d->", disk_pos);
while (1) {
if (disk[i % 200].if_scanned == 0) {
if (disk[i % 200].trackNo != -1) {
printf("%d->", disk[i % 200].trackNo);
}
disk[i % 200].if_scanned = 1;
i++;
}
else {
printf("END\n");
break;
}
}
}
void func_look(DI disk[]) {
printf("LOOK算法磁道扫描顺序:\n");
rstScan(disk);
int i = findPos(disk);
int temp;
temp = i - 1;
printf("%d->", disk_pos);
while (i<200) {
if (disk[i].if_scanned == 0) {
if (disk[i].trackNo != -1) {
printf("%d->", disk[i].trackNo);
}
disk[i].if_scanned = 1;
i++;
}
else break;
}
while (temp >= 0) {
if (disk[temp].if_scanned == 0) {
if (disk[temp].trackNo != -1) {
printf("%d->", disk[temp].trackNo);
}
disk[temp].if_scanned = 1;
temp--;
}
else break;
}
printf("END\n");
}
void func_SSTF_proc(DI disk[]) {
rstScan(disk);
int i = 0;
int min=2147483647;
int index=0;
while (1) {
if (disk[i].trackNo != -1) {
if (temptable[i].if_scanned != 1) {
temptable[i].trackNo = abs(disk[i].trackNo - disk_pos);
}
else temptable[i].trackNo = 0;
i++;
}
else break;
}
for (int x = 0; x < i; x++) {
if (min > temptable[x].trackNo && temptable[x].trackNo != 0) {
min = temptable[x].trackNo;
index = x;
}
}
printf("%d->", disk[index].trackNo);
disk_pos = disk[index].trackNo;
temptable[index].if_scanned = 1;
}
void func_SSTF_main(DI disk[]) {
int j = counter(disk);
int count = 0;
printf("SSTF算法磁道扫描顺序:\n%d->", disk_pos);
for (count; count < j; count++) {
func_SSTF_proc(disk);
}
printf("END\n");
}
int main() {
init(diskSch);
func_C_look(diskSch);
func_look(diskSch);
func_SSTF_main(diskSch);
}