1.\" Copyright (c) 1993 John Brezak 2.\" All rights reserved. 3.\" 4.\" Redistribution and use in source and binary forms, with or without 5.\" modification, are permitted provided that the following conditions 6.\" are met: 7.\" 1. Redistributions of source code must retain the above copyright 8.\" notice, this list of conditions and the following disclaimer. 9.\" 2. Redistributions in binary form must reproduce the above copyright 10.\" notice, this list of conditions and the following disclaimer in the 11.\" documentation and/or other materials provided with the distribution. 12.\" 3. The name of the author may be used to endorse or promote products 13.\" derived from this software without specific prior written permission. 14.\" 15.\" THIS SOFTWARE IS PROVIDED BY THE AUTHOR `AS IS'' AND 16.\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 17.\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 18.\" ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE 19.\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 20.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 21.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 22.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 23.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 24.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 25.\" SUCH DAMAGE. 26.\" 27.\" $NetBSD: insque.3,v 1.3 2005/07/12 08:28:27 wiz Exp $ 28.\" 29.Dd July 6, 2005 30.Dt INSQUE 3 31.Sh NAME 32.Nm insque , 33.Nm remque 34.Nd insert/remove element from a queue 35.Sh LIBRARY 36.Lb libc 37.Sh SYNOPSIS 38.In search.h 39.Ft void 40.Fn insque "void *elem" "void *pred" 41.Ft void 42.Fn remque "void *elem" 43.Sh DESCRIPTION 44.Fn insque 45and 46.Fn remque 47manipulate queues built from doubly linked lists. 48The queue can be either circular or linear. 49The functions expect their 50arguments to point to a structure whose first and second members are 51pointers to the next and previous element, respectively. 52The 53.Fn insque 54function also allows the 55.Fa pred 56argument to be a 57.Dv NULL 58pointer for the initialization of a new linear list's 59head element. 60.Sh STANDARDS 61The 62.Fn insque 63and 64.Fn remque 65functions conform to 66.St -p1003.1-2001 . 67.Sh HISTORY 68These are derived from the insque and remque instructions on a VAX. 69