Notes

#define Q_EMPTY -1
#define N_PROC 10

struct queue {
pcb_t* front,
int state;
pcb_t* rear;
}que_t;

struct pcb {
int id;
int prio;
proc* next;
}pcb_t;

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

/*que_t init_queue(que_t qq) {
qq.front = NULL;
qq.rear = NULL;
return qq;
}

pcb_t init_pcb(pcb_t pp) {
pp.id =
pp.priority =
return pp;
}*/

int enqueue_proc(pcb_t pp, que_t qq) {
if(qq.front == NULL)
{
qq.front = pp;
qq.rear = pp;
return 1;
}
else
{
qq.rear.next = pp;
qq.rear = pp;
pp.next = NULL;
}

pcb_t dequeue_proc(que_t qq) {
pcb_t temp = qq.front;
if(temp == NULL)
return Q_EMPTY;
qq.front = qq.front.next;
return temp;
}

int insert_proc(pcb_t pp, que_t qq) {
pcb_t temp = qq.front;
while(temp.next != NULL) {
pcb_t prev = temp;
pcb_t next = temp.next;
if(pp.prio > prev.prio && pp.prio < next.prio) {
prev.next = pp;
pp.next = next;
}
temp = temp.next;
}
qq.rear.next = pp;
qq.rear = pp;
pp.next = NULL;
}

int delete_proc(pcb_t pp, que_t qq) {
pcb_t temp = qq.front;
while(temp != NULL) {
if(temp == pp) {
if(qq.front == pp) {
qq.front = qq.front.next;
return 1;
}
prev.next = pp.next;
return 1,
}
pcb_t prev = temp;
temp = temp.next;
}
return 0;
}

int checkque(que_t qq) {
return qq.front == NULL;
}