.5 D¸í·ÉÀÏ ¶§.
2.5.1 Print Queue, Job Queue, Available linked list, Active process listÀÇ ³»¿ëÀ» Á¶»çÇÏ¿© ȸ鿡 Ãâ·ÂÇÑ´Ù.
void case_display(job_pointer jhead, pq_pointer pfront,job_pointer avail,job_pointer act)
/* ±â´É : °¢ ÇØ´çÇÏ´Â ¸®½ºÆ®µéÀ» ȸ鿡 Ãâ·ÂÇÑ´Ù. job list¸¦ Á¦¿ÜÇÑ ¸®½ºÆ®´Â ¼øÂ÷ÀûÀ¸·Î Ãâ·ÂµÇ¸ç, job listÀÇ °æ¿ì postorder¼øÀ¸·Î Ãâ·ÂµÈ´Ù. */
{
pq_pointer ptemp; job_pointer jtemp;
int post_no=1,nsize;
/* batch job queue¸¦ postorder¼øÀ¸·Î Ãâ·ÂÇÑ´Ù. */
fprintf(out,`[batch job queue]\\n`);
tot_num = count_node(jhead);
while(jhead){
post_array[post_no].jn=jhead->jobno;
post_array[post_no].jp=jhead->priorty;
nsize = jhead->tail - jhead->head +1;
post_array[post_no].js=nsize;
post_no++;
jhead=jhead->next;
}
post_no=1;
postorder(post_no);
/* print queue¸¦ ¼øÂ÷ÀûÀ¸·Î Ãâ·ÂÇÑ´Ù. */
fprintf(out,`[print queue]\\n`);
while(pfront¡¦(»ý·«)
|