inqueue(int queue_type, void *p)
{
  q=GetQueue(Q,i);
  s=(QUEUE_LIST)malloc(sizeof(queue_list));
  s->entity=p;
  s->in_ptr->previous=q->in_ptr->previous;
  q->in_ptr->previous=s->in_ptr;
  queue_number=queue_number+1;
}
dequeue(int queue_type)
{
  q=GetQueue(Q,i);
  queue_type=q->entity;
  q->out_ptr->previous->next=q->out_ptr->next;
  q->out_ptr->next->previous=q->out_ptr->previous;
  free(q);
  queue_number=queue_number-1;
}
Numqueue(int queue_type)
{
 int indx=1; 
 struct QUEUE_LIST *Q;
 Q=(struct QUEUE_LIST*)malloc(sizeof(struct queue_list));
 Q=queue_type;
 do{
    Q->out_ptr->next=Q->out_ptr->next->next;
    indx=indx+1;
   }
   while(queue_type->out_ptr->next==Q->out_ptr->next);
  return indx;
}