insque(3C) insque(3C)
NAME
insque, remque - insert/remove element from a queue
SYNOPSIS
include <search.h>
void insque(struct qelem *elem, struct qelem *pred);
void remque(struct qelem *elem);
DESCRIPTION
insque and remque manipulate queues built from doubly linked
lists. Each element in the queue must be in the following
form:
struct qelem {
struct qelem *q_forw;
struct qelem *q_back;
char q_data[];
};
insque inserts elem in a queue immediately after pred. remque
removes an entry elem from a queue.
NOTICES
It is the caller's responsibility never to insert or delete a
member before the first member of the list or after the last
member of the list. The first and last members of the list
must remain in place for the duration of the use of the list.
Copyright 1994 Novell, Inc. Page 1