NAME

insque, remque − insert/remove element from a queue

SYNOPSIS

struct qelem {
structqelem ∗q_forw;
structqelem ∗q_back;
charq_data[];
};

insque(elem, pred)
struct qelem ∗elem, ∗pred;

remque(elem)
struct qelem ∗elem;

DESCRIPTION

Insque and remque manipulate queues built from doubly linked lists.  Each element in the queue must in the form of “struct qelem”.  Insque inserts elem in a queue immediately after pred; remque removes an entry elem from a queue. 

4.2 Berkeley Distribution  —  May 20, 1986