(完整word版)操作系统课程设计设备管理实现源代码_第1页
(完整word版)操作系统课程设计设备管理实现源代码_第2页
免费预览已结束,剩余13页可下载查看

下载本文档

版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领

文档简介

1、#i nclude #i nclude iostream.h#in elude stdlib.h#i nclude stri ng.hstruct PCBint id;char n ame10;int size;struct PCB *n ext;struct PCB *runnin g;struct PCB *ready;struct PCB *blocked;struct PCB *q;struct PCB *p;in t id=1;int size;char n ame10;/ structDCT / 设备char n ame10;int busy;PCB * occupied;PCB

2、* waiti ng;struct DCT *n ext;struct COCT* coct;/ 上级控制器;struct COCT/ 控制器char n ame10;int busy;PCB * occupied;PCB * waiti ng;struct COCT *n ext;struct CHCT* chct;/控制器的上级通道;struct CHCT通道char n ame10;int busy;PCB * occupied;PCB * waiti ng;struct CHCT *n ext;/struct DCT * dets;struct COCT *eoets;struct C

3、HCT *ehets;void enq ueue(i nt id,char *n ame,i nt size,struct PCB *head)struet PCB *n ode=(struct PCB *)malloc(sizeof(struct PCB);no de-n ext=0;no de-id=id;strepy (no de-n ame ,n ame);no de-size=size;struet PCB *tmp=head;while(tmp-n ext!=0)tmp=tmp-n ext;tmp-n ext =no de;struet PCB * dequeue(struet P

4、CB *head)struet PCB * tmp=head- next;if(head- next!=0)head-n ext=head-n ext-n ext;tmp-n ext=0;return(tmp);void ereateProeess()prin tf(nn ame:);sea nf(%s, name);prin tf(size:);scan f(%d, &size);prin tf(n);enq ueue(id+,n ame,size,ready);if(runnin g=0)runnin g=dequeue(ready);void switchProcess()if(

5、runnin g!=0&ready-n ext!=0)enq ueue(r unnin g-id,r unning-n ame,r unning-size,ready); runnin g=dequeue(ready);elseprintf(没有可切换的进程n);void blockProcess()if(runnin g=0)printf(没有可阻塞的进程n);elseenq ueue(r unnin g-id,r unning-n ame,r unning-size,blocked); runnin g=0;if(ready-n ext=0)printf(没有可执行的进程n);el

6、serunnin g=dequeue(ready); void wakeupProcess()if(blocked-n ext=0)printf(没有可激活的进程);elseenq ueue(blocked-n ext-id,blocked-n ext- name,blocked-n ext-size,ready); dequeue(blocked);if(runnin g=0)runnin g=dequeue(ready);void termi nateProcess()/ 结束进程if(runnin g=0)printf(没有需要结束的进程n);elserunnin g=dequeue(r

7、eady);void displayProcessstatus()printf(”- 就绪态-n);if(ready-n ext=0)printf(当前没有进程在该状态n);if(ready-n ext!=0)q=ready _n ext;while(ready-n ext!=0)prin tf(%s,ready-n ext- n ame);printf(”dn ”,ready-n ext-size);ready-n ext=ready-n ext-n ext;ready _n ext=q;printf(”- 执行状态-n);if(running=0) printf(当前没有进程在该状态 n)

8、;if(runnin g!=0)prin tf(%s,r unning-n ame);printf(”%dn,r unnin g-size);printf(”- 阻塞状态-n);if(blocked- next=0) pri ntf(当前没有进程在该状态 nn);if(blocked- next!=0)p=blocked-n ext;while(blocked-n ext!=0)prin tf(%s,blocked-n ext- n ame);printf(”dn ”,blocked-n ext-size);blocked-next = blocked-n ext-n ext;blocked-

9、n ext=p; / temp =temp-n ext;struct DCT * fin dDCT(char name)struct DCT *temp = dcts;while(temp- next!=NULL)/设备分配时找到要添加的设备if(strcmp(temp-n ame, name)=O) return temp;return NULL;struct CHCT * fin dCha nn el(char name)struct CHCT *temp = chcts;while(temp- next!=NULL)temp = temp-n ext;if(strcmp(temp-n a

10、me, name)=O) return temp;return NULL;struct COCT * fin dCo ntroller(charn ame)struct COCT *temp = cocts;while(temp- next!=NULL)temp = temp-n ext;if(strcmp(temp-n ame, name)=0) return temp;return NULL;void addProcesstoWait in g(struct PCB * waiti ng,struct PCB *p)进入进程等待队列 struct PCB *temp = wait ing;

11、while(temp- next!=NULL)temp = temp-n ext;/temp-next = p;/+temp-n ext = new struct PCB;temp-n ext-id = p-id;strcpy(temp-n ext-n ame,p-n ame);temp-n ext-size = p-size;temp-n ext- n ext = NULL;/+void add(struct PCB * head,struct PCB * n ode) / 入队列struct PCB *tmp=head;while(tmp-n ext!=0)tmp=tmp-n ext;tm

12、p-n ext=no de;struct PCB * getFirst(struct PCB *head) 获得队列里的第一个进程retur n head-n ext;void allocateCHCT(struct CHCT* chct,PCB *p)/ 分配 CHCTif(chct-occupied!=0)printf(不能分配通道n); addProcesstoWaiting(chct-wait in g,p);elsechct-occupied=p;printf(分配成功! n);add(blocked,p);if(ready!=0)runnin g=dequeue(ready);el

13、serunnin g=0;/*void allocateCOCT(struct COCT* coct,PCB *p)if(coct-occupied!=0)printf(不能分配控制器n);addProcesstoWaiti ng(coct-wait in g,p);add(blocked,p);if(ready!=O)runnin g=dequeue(ready);elserunnin g=0;return;elsecoct-occupied=p; allocateCHCT(coct-chct,p);void allocateDCT()char n ameDCT10;printf(请输入设备

14、名称:);scan f(%s ,n ameDCT);struct DCT * dct=fi ndDCT( nameDCT);struct PCB * p = running;if(dct!=NULL&p!=NULL)if(dct-occupied!=0)printf(不能分配设备n); addProcesstoWaiting(dct-wait in g,p); add(blocked,p);if(ready!=0)runnin g=dequeue(ready);elserunnin g=0;return;elsedct-occupied=p; allocateCOCT(dct-coct

15、,p);/+/*add(blocked,p);if(ready!=0)runnin g=dequeue(ready);elserunnin g=0;return;*/ /+ elseprintf(发生错误!n);void releaseCHCT(char *n ame,struct CHCT* chct,struct PCB* p) if(p!=NULL)addProcesstoWaiti ng(chct-wait in g,p);if(strcmp( name,chct-occupied-n ame)=0)if(chct-waiti ng- next!=NULL)chct-occupied

16、= dequeue(chct-wait in g);else/?chct-occupied = NULL;void releaseCOCT(char *n ame,struct COCT* coct,struct PCB* p) if(p!=NULL)addProcesstoWaiti ng(coct-wait in g,p);if(strcmp( name,coct-occupied-n ame)=0)if(coct-wait ing-n ext!=NULL)coct-occupied = dequeue(coct-wait in g);elsecoct-occupied = NULL;re

17、leaseCHCT (n ame,coct-chct,coct-occupied);void releaseDCT()char n ameDCT10;printf(请输入要释放的设备名称:n);scan f(%s ,n ameDCT);char nameP10;printf(请输入要释放的进程名称:n);scan f(%s, nameP);struct DCT *temp = fin dDCT( nameDCT);if(strcmp(temp-occupied-n ame ,n ameP)=O) if(temp-wait ing-n ext!=NULL)temp-occupied = dequ

18、eue(temp-wait in g);else temp-occupied = NULL;releaseCOCT (n ameP,temp-coct,temp-occupied);elseprintf(没有对应的设备和进程!”);void addCha nn el(char n ame)struct CHCT * temp=(struct CHCT *)malloc(sizeof(structCHCT); strcpy(temp-n ame ,n ame);temp-n ext=0;temp-busy=O;temp-wait ing = new struct PCB;temp-wait in

19、g-n ext = NULL;temp-wait in g=0; temp-occupied=0;struct CHCT * head=chcts;/进入了 chcts 队列while(head-n ext!=0)head=head-n ext;head-n ext=temp;void addCo ntroller(char *n ame,struct CHCT * chct)/ 增加控制器struct COCT * temp=(struct COCT *)malloc(sizeof(structCOCT); strcpy(temp-n ame ,n ame);temp-n ext=0;tem

20、p-busy=0;temp-wait ing = new struct PCB;temp-wait ing-n ext = NULL;temp-wait in g=0; /+temp-occupied=0;temp-chct= chct;struct COCT * head=cocts;进入了 cocts 队列while(head-n ext!=0)head=head-n ext;head-n ext=temp;void addDevice(char *n ame,struct COCT * coct)/增加设备struct DCT * temp=(struct DCT *)malloc(si

21、zeof(struct DCT);strcpy(temp-n ame ,n ame);temp-n ext=0; temp-busy=O;temp-wait ing = new struct PCB;temp-wait ing-next = NULL; temp-wait in g=0;temp-occupied=0; temp-coct= coct; struct DCT *head=dcts;while(head-next!=0)head=head-next;head-n ext=temp;/ 添加设备 +void add_dct()char n ewDCT10;printf(请输入新设备

22、的名字:n);scan f(%s ,n ewDCT);char newCOCT10;printf(请输入要添加到的控制器的名字:n);scan f(%s ,n ewCOCT); addDevice( newDCT,fi ndC ontroller( newCOCT);/添加控制器void add_coct()char newCOCT1O;printf(请输入新控制器的名字:n);scan f(%s ,n ewCOCT);char newCHCT10;printf(请输入要添加到的通道的名字:n);scan f(%s ,n ewCHCT);addCo ntroller( newCOCT,fi n

23、dCha nn el( newCHCT);/添加通道void add_chct()char newCHCT10;printf(请输入新的通道的名字:n);scan f(%s ,n ewCHCT);addCha nn el( newCHCT);/+/+ 删除操作 +删除设备void deleteDCT(char nameDCT)/char n ameDCT10;int i=0;/printf(”请输入要删除 DCT 的名字:”);/scan f(%s ,n ameDCT);struct DCT * temp = fin dDCT( nameDCT);struct DCT * head = dct

24、s;if(temp=NULL)printf(没有对应的设备!n);return ;elsewhile(head-n ext!=0)if(strcmp(temp-n ame,head-n ext- n ame)=0)if(temp-occupied!=NULL)printf(此设备现在正在使用不能删除n);elsehead-n ext=head-n ext- n ext;/i+;break;elsehead=head-n ext;删除控制器void deleteCOCT(char nameCOC T)struct COCT *temp=fi ndCo ntroller( nameCOCT); s

25、tructCOCT *head=cocts;if(temp=NULL)printf(没有对应的控制器n);return;elsewhile(head-n ext!=O)if(strcmp(temp-n ame,head-n ext- name)=0) if(temp-occupied!=NULL)printf(此控制器现在正在使用不能删除else/ deleteDCT(temp-);head-n ext=head-n ext- n ext;break;head=head-n ext;删除通道void deleteCHCT(char nameCHC T)struct CHCT *temp=fi

26、ndCha nnel(n ameCHCT);struct CHCT *head=chcts;if(temp=NULL)printf(没有对应的通道n);return;elsewhile(head-n ext!=0)if(strcmp(temp-n ame,head-n ext- name)=0) if(temp-occupied!=NULL)printf(此通道现在正在使用不能删除nelse/ deleteDCT(temp-);head-n ext=head-n ext- n ext;i+;break;head=head-n ext;/+ voiddisplayDCT()struct DCT

27、* dct;struct COCT *coct;struct CHCT *chct = chcts;struct PCB *pcb;n);/-while(chct- next!=NULL)chct = chct-n ext;printf(“%s(,chct -n ame);if(chct-occupied!=0)prin tf(%s,chct-occupied-n ame);prin tf(”)”);pcb = chct-waiting-next;/waiting 是头结点, pcb 指向队列第一个进程 while(pcb!=NULL)prin tf(%s,pcb- name);pcb = p

28、cb-n ext;prin tf(n);/-coct = cocts;while(coct- next!=NULL)coct = coct -n ext;if(strcmp(coct-chct-n ame,chct -n ame)=0)printf(“%s(,coct -n ame);if(coct-occupied!=0)prin tf(%s,coct-occupied-n ame);prin tf();pcb = coct-wait ing-n ext;while(pcb!=NULL)prin tf(%s,pcb- name);pcb = pcb-n ext;prin tf(n);/-dc

29、t = dcts;while(dct- next!=NULL)dct = dct-n ext;if(strcmp(dct-coct-n ame,coct -name)=O)prin tf(%s(,dct- name);if(dct-occupied!=0)prin tf(%s,dct-occupied-name);prin tf();pcb = dct-wait ing-n ext;while(pcb!=NULL)prin tf(%s,pcb- name); pcb= pcb-n ext;prin tf(n);/void mai n()dcts=(struct DCT *)malloc(sizeof(struct DCT);dcts-n ext=0;cocts=(struct COCT *)malloc(sizeof(struct COCT); cocts-next=0;chcts=(struct CHCT *)malloc(sizeof(struct CHCT); chcts-next=0;addCha nn el(chct1);addCha nn el(chct2);a

温馨提示

  • 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
  • 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
  • 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
  • 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
  • 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
  • 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
  • 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

评论

0/150

提交评论