#include
#include
//執行結點
typedef?struct?run{
????int?data;
????struct?run?*next;
}run*runlist;
//就緒節點
typedef?struct?ready{
????int?data;
????struct?ready?*next;
}ready*readylist;
//阻塞節點
typedef?struct?block{
????int?data;
????struct?block?*next;
}block*blocklist;
//執行隊列
runlist?runlist_creat（）{
????run?*L*p;
????L=（run?*）malloc（sizeof（run））;
????p=（run?*）malloc（sizeof（run））;
????if（p==NULL||L==NULL）{
????????exit（1）;
????}
????L->next=NULL;
????int?x=5;
????p->data=x;
????p->next=L->next;
????L->next=p;
????printf（“執行指針為：%d\n“p->data）;
????return?L;
}
//就緒隊列
readylist?readylist_creat（）{
????int?i;
????int?a[5]={21546};
????ready?*L;
????L=（ready?*）malloc（sizeof（ready））;
????ready?*p*s;
????L->next=NULL;
????s=L;
????//依次將數組a中的5個元素插入單鏈表中
????for（i=0;?i<5;?i++）
????{
????????p=（ready?*）malloc（sizeof（ready））;
????????p->data=a[i];
????????p->next=s->next;
????????s->next=p;
????????s=s->next;
????}
????//將該鏈表顯示
????p=L->next;
????printf（“就緒指針為：%d\n“a[0]）;
????printf（“就緒隊列為：“）;
????while（p）
????{
????????printf（“%d?“p->data）;
????????p=p->next;
????}
????return?L;
}
//阻塞隊列
blocklist?blocklist_creat（）{
????int?i;
????int?a[5]={12473};
????block?*L;
????L=（block?*）malloc（sizeof（block））;
????block?*p*s;
????L->next=NULL;
????s=L;
????//依次將數組a中的5個元素插入單鏈表中
????for（i=0;?i<5;?i++）
????{
????????p=（block?*）malloc（sizeof（block））;
????????p->data=a[i];
????????p->next=s->next;
????????s->next=p;
????????s=s->next;
????}
????//將該鏈表顯示
????p=L->next;
????printf（“\n阻塞指針為：%d\n“a[0]）;
????printf（“阻塞隊列為：“）;
????while（p）
????{
????????printf（“%d?“p->data）;
????????p=p->next;
????}
????return?L;
}
//阻塞變就緒
void?block_to_ready（readylist?pr_headblocklist?pb_head）{
????readylist?pr_temp?=pr_head;
????readylist?pr_new;
????blocklist?pb_temp?=pb_head;
????for（;pr_temp->next!=NULL;pr_temp=pr_temp->n