1.\" Copyright (c) 1983, 1991, 1993 2.\" The Regents of the University of California. All rights reserved. 3.\" 4.\" %sccs.include.redist.man% 5.\" 6.\" @(#)insque.3 8.2 (Berkeley) 12/11/93 7.\" 8.Dd 9.Dt INSQUE 3 10.Os BSD 4.2 11.Sh NAME 12.Nm insque , 13.Nm remque 14.Nd insert/remove element from a queue 15.Sh SYNOPSIS 16.Bd -literal 17struct qelem { 18 struct qelem *q_forw; 19 struct qelem *q_back; 20 char q_data[]; 21}; 22.Ed 23 24.Fn insque "(caddr_t) struct qelem *elem" "(caddr_t) struct qelem *pred" 25.Fn remque "(caddr_t) struct qelem *elem" 26.Sh DESCRIPTION 27The 28.Fn insque 29and 30.Fn remque 31functions 32manipulate queues built from doubly linked lists. Each 33element in the queue must be in the form of 34.Dq Li struct qelem . 35The function 36.Fn insque 37inserts 38.Fa elem 39in a queue immediately after 40.Fa pred ; 41.Fn remque 42removes an entry 43.Fa elem 44from a queue. 45.Sh SEE ALSO 46.%T "VAX Architecture Handbook" , 47pp. 228-235. 48.Sh HISTORY 49The 50.Fn insque 51and 52.Fn remque 53functions appeared in 54.Bx 4.2 . 55