Copyright (c) 1983 Regents of the University of California.
All rights reserved. The Berkeley software License Agreement
specifies the terms and conditions for redistribution.
@(#)insque.3 6.1 (Berkeley) 05/15/85
All rights reserved. The Berkeley software License Agreement
specifies the terms and conditions for redistribution.
@(#)insque.3 6.1 (Berkeley) 05/15/85
INSQUE 3 ""
C 5 NAME
insque, remque - insert/remove element from a queue
SYNOPSIS
struct qelem { struct qelem *q_forw; struct qelem *q_back; char q_data[]; };insque(elem, pred) struct qelem *elem, *pred;
remque(elem) struct qelem *elem;
DESCRIPTIONInsque 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 imediately after pred ; remque removes an entry elem from a queue."SEE ALSO``VAX Architecture Handbook'', pp. 228-235.