I just want to know why I get and error on 54th line saying invalid conversion from void to process ?? Any Idea anyone >??

Thanks
Last edited on
Krunal wrote:
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
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
#include <stdio.h>
#include <stdlib.h>

/* Process Data Structure */
struct process {
	int pid; /* Process ID */
	int burst; /* CPU Burst Time */
	int priority; /* Priority */
	int working; /* Working time, for round-robin scheduling */
	int waiting; /* Waiting time, for round-robin scheduling */
	struct process *next;
};

struct process *init_process (int pid, int burst, int priority);
void fcfs (struct process *proc);
void listprocs (struct process *proc);
void priority (struct process *proc);
void rr (struct process *proc, int quantum);
void sjf (struct process *proc);
int main (void) {
	/* Initialize process list */
	struct process *plist, *ptmp;
	plist = init_process(1, 10, 3);
	plist->next = init_process(2, 1, 1); ptmp = plist->next;
	ptmp->next = init_process(3, 2, 3); ptmp = ptmp->next;
	ptmp->next = init_process(4, 1, 4); ptmp = ptmp->next;
	ptmp->next = init_process(5, 5, 2);

	/* Perform simulations */
	listprocs(plist);
	fcfs(plist);
	sjf(plist);
	priority(plist);
	rr(plist, 1);

	while (plist != NULL) {
		ptmp = plist;
		plist = plist->next;
		free(ptmp);
	};
	return(0);
};


/* Process list entry initialization routine */
struct process *init_process (int pid, int burst, int priority) {
	struct process *proc;
	proc = malloc(sizeof(struct process));
	if (proc == NULL) {
		printf("Fatal error: memory allocation failure.\nTerminating.\n");
		exit(1);
	};
	proc->pid = pid;
	proc->burst = burst;
	proc->priority = priority;
	proc->working = 0;
	proc->waiting = 0;
	proc->next = NULL;
	return(proc);
};


/* First-Come-First-Served scheduling simulation */
void fcfs (struct process *proc) {
	int time = 0, start, end;
	struct process *tmp = proc;

	printf("BEGIN:\tFirst-Come-First-Served scheduling simulation\n");

	while (tmp != NULL) {
		start = time;
		time += tmp->burst;
		end = time;
		printf("Process: %d\tEnd Time: %d\tWaiting: %d\tTurnaround: %d\n", tmp->pid, time, start, end);
		tmp = tmp->next;
	};

	printf("END:\tFirst-Come-First-served scheduling simulation\n\n");
};


/* Process listing */
void listprocs (struct process *proc) {
	struct process *tmp = proc;

	printf("BEGIN:\tProcess Listing\n");

	while (tmp != NULL) {
		printf("PID: %d\t\tPriority: %d\tBurst: %d\n", tmp->pid, tmp->priority, tmp->burst);
		tmp = tmp->next;
	};

	printf("END:\tProcess Listing\n\n");
};



void priority (struct process *proc) {
	int time, start, end, highest;
	struct process *copy, *tmpsrc, *tmp, *beforehighest;

	printf("BEGIN:\tPriority scheduling simulation\n");

	/* Duplicate process list */
	tmpsrc = proc;
	copy = tmp = NULL;
	while (tmpsrc != NULL) {
		if (copy == NULL) {
			copy = init_process(tmpsrc->pid, tmpsrc->burst, tmpsrc->priority);
			tmp = copy;
		} else {
			tmp->next = init_process(tmpsrc->pid, tmpsrc->burst, tmpsrc->priority);
			tmp = tmp->next;
		};
		tmpsrc = tmpsrc->next;
	};

	/* Main routine */
	time = 0;
	while (copy != NULL) {
		/* Find the next job */
		beforehighest = NULL;
		highest = copy->priority;
		tmp = copy->next;
		tmpsrc = copy;
		while (tmp != NULL) {
			if (tmp->priority < highest) {
				highest = tmp->priority;
				beforehighest = tmpsrc;
			};
			tmpsrc = tmp;
			tmp = tmp->next;
		};

		/* Process job and remove from copy of process list */
		if (beforehighest == NULL) {
			/* Handle first job is highest priority case */
			start = time;
			time += copy->burst;
			end = time;
			printf("Process: %d\tEnd Time: %d\tWaiting: %d\tTurnaround: %d\n", copy->pid, time, start, end);
			tmpsrc = copy->next;
			free(copy);
			copy = tmpsrc;
		} else {
			/* Handle first job is not highest priority case */
			tmp = beforehighest->next;
			start = time;
			time += tmp->burst;
			end = time;
			printf("Process: %d\tEnd Time: %d\tWaiting: %d\tTurnaround: %d\n", tmp->pid, time, start, end);
			beforehighest->next = tmp->next;
			free(tmp);
		};
	};

	printf("END:\tPriority scheduling simulation\n\n");
};


/* Round-Robin scheduling simulation */
void rr (struct process *proc, int quantum) {
	int jobsremain, passes;
	struct process *copy, *tmpsrc, *tmp, *slot;

	printf("BEGIN:\tRound-Robin scheduling simulation (Quantum: %d)\n", quantum);
	/* Duplicate process list */
	tmpsrc = proc;
	copy = tmp = NULL;
	while (tmpsrc != NULL) {
		if (copy == NULL) {
			copy = init_process(tmpsrc->pid, tmpsrc->burst, tmpsrc->priority);
			tmp = copy;
		} else {
			tmp->next = init_process(tmpsrc->pid, tmpsrc->burst, tmpsrc->priority);
			tmp = tmp->next;
		};
		tmpsrc = tmpsrc->next;
	};

	/* Main routine */
	jobsremain = 1;
	slot = NULL;
	while (jobsremain) {
		jobsremain = 0;

		/* Pick next working slot */
		if (slot == NULL) {
			slot = copy;
			jobsremain = 1;
		} else {
			passes = 0;
			do {
				if (slot->next == NULL) {
					passes++;
					slot = copy;
				} else {
					slot = slot->next;
				};
			} while (passes <= 2 && slot->burst <= slot->working);
			if (passes <= 2) {
				jobsremain = 1;
			};
		};

		/* Perform a cycle */
		tmp = copy;
		while (tmp != NULL) {
			if (tmp->burst > tmp->working) {
				if (tmp == slot) {
					tmp->working += quantum;
				} else {
					tmp->waiting += quantum;
				};
			};
			tmp = tmp->next;
		};
	};
	tmp = copy;
	while (tmp != NULL) {
		printf("Process: %d\tWorking: %d\tWaiting: %d\tTurnaround: %d\n", tmp->pid, tmp->working, tmp->waiting, tmp->working + tmp->waiting);
		tmpsrc = tmp;
		tmp = tmp->next;
		free(tmpsrc);
	};

	printf("END:\tRR scheduling simulation\n\n");
};


/* Shortest Job First scheduling simulation */
void sjf (struct process *proc) {
	int time, start, end, shortest;
	struct process *copy, *tmpsrc, *tmp, *beforeshortest;

	printf("BEGIN:\tShortest Job First scheduling simulation\n");


	tmpsrc = proc;
	copy = tmp = NULL;
	while (tmpsrc != NULL) {
		if (copy == NULL) {
			copy = init_process(tmpsrc->pid, tmpsrc->burst, tmpsrc->priority);
			tmp = copy;
		} else {
			tmp->next = init_process(tmpsrc->pid, tmpsrc->burst, tmpsrc->priority);
			tmp = tmp->next;
		};
		tmpsrc = tmpsrc->next;
	};

	/* Main routine */
	time = 0;
	while (copy != NULL) {
		/* Find the next job */
		beforeshortest = NULL;
		shortest = copy->burst;
		tmp = copy->next;
		tmpsrc = copy;
		while (tmp != NULL) {
			if (tmp->burst < shortest) {
				shortest = tmp->burst;
				beforeshortest = tmpsrc;
			};
				tmpsrc = tmp;
				tmp = tmp->next;
		};

		/* Process job and remove from copy of process list */
		if (beforeshortest == NULL) {
			/* Handle first job is shortest case */
			start = time;
			time += copy->burst;
			end = time;
			printf("Process: %d\tEnd Time: %d\tWaiting: %d\tTurnaround: %d\n", copy->pid, time, start, end);
			tmpsrc = copy;
			copy = copy->next;
			free(tmpsrc);
		} else {
			/* Handle first job is not shortest case */
			tmp = beforeshortest->next;
			start = time;
			time += tmp->burst;
			end = time;
			printf("Process: %d\tEnd Time: %d\tWaiting: %d\tTurnaround: %d\n", tmp->pid, time, start, end);
			beforeshortest->next = tmp->next;
			free(tmp);
		};
	};

	printf("END:\tShortest Job First scheduling simulation\n\n");
}; 


In C++ the conversion from void* to other pointer types are not implicit so you have to make an explicit cast.

 
proc = static_cast<process*>(malloc(sizeof(struct process)));
Last edited on
Please add the code tags: http://www.cplusplus.com/articles/jEywvCM9/
(Finding line 54 without them is too much.)
Compile that code using gcc, not g++ and you don't have any problems. After all, is a pure C code, not C++.
Registered users can post here. Sign in or register to post.