Notes

#include <stdio.h>
#define N_PROC 10
#define Q_EMPTY -1

que_t q1 = {NULL, 0 , NULL}
pcb_t pcb_tab [N_PROC];

typedef struct pcb {
int id, prio;
pcb*next;
} pcb_t;

typedef struct queue {
pcb_t*front;
pcb_t*rear;
} que_t;

que_t* init_que(que_t qq){
qq.front = NULL;
qq.rear = NULL;
return qq;
}
pcb_t*init_pcb(pcb_t pp){
pp.id;
pp.prio;
return pp;
}
void enqueue (pcb_t pp,que_t qq){
if(qq.front = NULL&&qq.rear=NULL){
qq.front = pp;
qq.rear = pp;
pp-> next =NULL;
}
else (qq->rear->next = pp;
qq->rear = pp;
pp->next = NULL;)
}
void dequeue (pcb_t pp , que_t qq){
if(qq->front == NULL)
return NULL;

}
void insert (pcb_t pp , que_t qq){
int tmp;
while (tmp->next! =NULL)
rear =tmp;
next = tmp ->front;
if(pp->prio>rear ->prio)&&(pp->prio<next->prio)
return NULL;
}
void delete(pcb_t pp , que_t qq){
pcb_t tmp = qq.front;
while (tmp != NULL){
if(tmp==pp){
if(qq.front==pp){
qq.front = qq.front.next;
return (1);
}
prev.next= pp.next;
return 1;
}
pcb_t.prev = tmp;
tmp = tmp.next;
}
return 0;

}
void checkqueue(que_t qq){
return (qq.front=NULL);
}
void main(){
}