From owner-man-jp-reviewer@jp.freebsd.org  Fri Aug 24 14:58:43 2001
Received: (from daemon@localhost)
	by castle.jp.freebsd.org (8.9.3+3.2W/8.7.3) id OAA16083;
	Fri, 24 Aug 2001 14:58:43 +0900 (JST)
	(envelope-from owner-man-jp-reviewer@jp.FreeBSD.org)
Received: from tatesina.phys.s.u-tokyo.ac.jp (tatesina.phys.s.u-tokyo.ac.jp [133.11.4.240])
	by castle.jp.freebsd.org (8.9.3+3.2W/8.7.3) with ESMTP id OAA16078
	for <man-jp-reviewer@jp.freebsd.org>; Fri, 24 Aug 2001 14:58:43 +0900 (JST)
	(envelope-from koizumi@cms.phys.s.u-tokyo.ac.jp)
Received: from mail-cms (cms-as4.phys.s.u-tokyo.ac.jp [133.11.4.7])
	by tatesina.phys.s.u-tokyo.ac.jp (8.11.3/3.7W) with ESMTP id f7O5wg418901
	for <man-jp-reviewer@jp.freebsd.org>; Fri, 24 Aug 2001 14:58:42 +0900 (JST)
Message-Id: <200108240558.f7O5wg418901@tatesina.phys.s.u-tokyo.ac.jp>
To: man-jp-reviewer@jp.freebsd.org
Date: Fri, 24 Aug 2001 14:58:42 +0900
From: Satoru Koizumi <koizumi@cms.phys.s.u-tokyo.ac.jp>
Reply-To: man-jp-reviewer@jp.freebsd.org
Precedence: list
X-Distribute: distribute version 2.1 (Alpha) patchlevel 24e+010328
X-Sequence: man-jp-reviewer 3756
Subject: [man-jp-reviewer 3756] queue.3
Errors-To: owner-man-jp-reviewer@jp.freebsd.org
Sender: owner-man-jp-reviewer@jp.freebsd.org
X-Originator: koizumi@cms.phys.s.u-tokyo.ac.jp


 queue.3 $B$G$9!#%A%'%C%/$h$m$7$/$*4j$$$7$^$9!#(B
 $BCY$/$J$C$F:Q$_$^$;$s!#Fs%v7n6a$/<j85$G?2$+$;$F$^$7$?!#(B
# $B$$$DM=Ls$7$?$s$@$+$b$O$C$-$j3P$($F$J$$!E!E(B

                            $B>.(B  $B@t(B    $B8g(B
----------------------------------------------------------------------
.\" Copyright (c) 1993
.\"	The Regents of the University of California.  All rights reserved.
.\"
.\" Redistribution and use in source and binary forms, with or without
.\" modification, are permitted provided that the following conditions
.\" are met:
.\" 1. Redistributions of source code must retain the above copyright
.\"    notice, this list of conditions and the following disclaimer.
.\" 2. Redistributions in binary form must reproduce the above copyright
.\"    notice, this list of conditions and the following disclaimer in the
.\"    documentation and/or other materials provided with the distribution.
.\" 3. All advertising materials mentioning features or use of this software
.\"    must display the following acknowledgement:
.\"	This product includes software developed by the University of
.\"	California, Berkeley and its contributors.
.\" 4. Neither the name of the University nor the names of its contributors
.\"    may be used to endorse or promote products derived from this software
.\"    without specific prior written permission.
.\"
.\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
.\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
.\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
.\" ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
.\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
.\" SUCH DAMAGE.
.\"
.\"	@(#)queue.3	8.2 (Berkeley) 1/24/94
.\" $FreeBSD: src/share/man/man3/queue.3,v 1.15.2.2 2000/05/05 01:44:21 archie Exp $
.\"
.Dd January 24, 1994
.Dt QUEUE 3
.Os BSD 4
.Sh $BL>>N(B
.Nm SLIST_EMPTY ,
.Nm SLIST_ENTRY ,
.Nm SLIST_FIRST ,
.Nm SLIST_FOREACH ,
.Nm SLIST_HEAD ,
.Nm SLIST_INIT ,
.Nm SLIST_INSERT_AFTER ,
.Nm SLIST_INSERT_HEAD ,
.Nm SLIST_NEXT ,
.Nm SLIST_REMOVE_HEAD ,
.Nm SLIST_REMOVE ,
.Nm STAILQ_EMPTY ,
.Nm STAILQ_ENTRY ,
.Nm STAILQ_FIRST ,
.Nm STAILQ_FOREACH ,
.Nm STAILQ_HEAD ,
.Nm STAILQ_INIT ,
.Nm STAILQ_INSERT_AFTER ,
.Nm STAILQ_INSERT_HEAD ,
.Nm STAILQ_INSERT_TAIL ,
.Nm STAILQ_LAST ,
.Nm STAILQ_NEXT ,
.Nm STAILQ_REMOVE_HEAD ,
.Nm STAILQ_REMOVE ,
.Nm LIST_EMPTY ,
.Nm LIST_ENTRY ,
.Nm LIST_FIRST ,
.Nm LIST_FOREACH ,
.Nm LIST_HEAD ,
.Nm LIST_INIT ,
.Nm LIST_INSERT_AFTER ,
.Nm LIST_INSERT_BEFORE ,
.Nm LIST_INSERT_HEAD ,
.Nm LIST_NEXT ,
.Nm LIST_REMOVE ,
.Nm TAILQ_EMPTY ,
.Nm TAILQ_ENTRY ,
.Nm TAILQ_FIRST ,
.Nm TAILQ_FOREACH ,
.Nm TAILQ_FOREACH_REVERSE ,
.Nm TAILQ_HEAD ,
.Nm TAILQ_INIT ,
.Nm TAILQ_INSERT_AFTER ,
.Nm TAILQ_INSERT_BEFORE ,
.Nm TAILQ_INSERT_HEAD ,
.Nm TAILQ_INSERT_TAIL ,
.Nm TAILQ_LAST ,
.Nm TAILQ_NEXT ,
.Nm TAILQ_PREV ,
.Nm TAILQ_REMOVE ,
.Nm CIRCLEQ_EMPTY ,
.Nm CIRCLEQ_ENTRY ,
.Nm CIRCLEQ_FIRST ,
.Nm CIRCLEQ_FOREACH ,
.Nm CIRCLEQ_FOREACH_REVERSE ,
.Nm CIRCLEQ_HEAD ,
.Nm CIRCLEQ_INIT ,
.Nm CIRCLEQ_INSERT_AFTER ,
.Nm CIRCLEQ_INSERT_BEFORE ,
.Nm CIRCLEQ_INSERT_HEAD ,
.Nm CIRCLEQ_INSERT_TAIL ,
.Nm CIRCLE_LAST ,
.Nm CIRCLE_NEXT ,
.Nm CIRCLE_PREV ,
.Nm CIRCLEQ_REMOVE
.Nd $BC10l%j%s%/%j%9%H!"C10l%j%s%/%F!<%k%-%e!<!"%j%9%H!"%F!<%k%-%e!<!"(B
$B=[4D%-%e!<$N<BAu(B
.Sh $B=q<0(B
.Fd #include <sys/queue.h>
.\"
.Fn SLIST_EMPTY "SLIST_HEAD *head"
.Fn SLIST_ENTRY "TYPE"
.Fn SLIST_FIRST "SLIST_HEAD *head"
.Fn SLIST_FOREACH "TYPE *var" "SLIST_HEAD *head" "SLIST_ENTRY NAME"
.Fn SLIST_HEAD "HEADNAME" "TYPE"
.Fn SLIST_INIT "SLIST_HEAD *head"
.Fn SLIST_INSERT_AFTER "TYPE *listelm" "TYPE *elm" "SLIST_ENTRY NAME"
.Fn SLIST_INSERT_HEAD "SLIST_HEAD *head" "TYPE *elm" "SLIST_ENTRY NAME"
.Fn SLIST_NEXT "TYPE *elm" "SLIST_ENTRY NAME"
.Fn SLIST_REMOVE_HEAD "SLIST_HEAD *head" "SLIST_ENTRY NAME"
.Fn SLIST_REMOVE "SLIST_HEAD *head" "TYPE *elm" "TYPE" "SLIST_ENTRY NAME"
.\"
.Fn STAILQ_EMPTY "STAILQ_HEAD *head"
.Fn STAILQ_ENTRY "TYPE"
.Fn STAILQ_FIRST "STAILQ_HEAD *head"
.Fn STAILQ_FOREACH "TYPE *var" "STAILQ_HEAD *head" "STAILQ_ENTRY NAME"
.Fn STAILQ_HEAD "HEADNAME" "TYPE"
.Fn STAILQ_INIT "STAILQ_HEAD *head"
.Fn STAILQ_INSERT_AFTER "STAILQ_HEAD *head" "TYPE *listelm" "TYPE *elm" "STAILQ_ENTRY NAME"
.Fn STAILQ_INSERT_HEAD "STAILQ_HEAD *head" "TYPE *elm" "STAILQ_ENTRY NAME"
.Fn STAILQ_INSERT_TAIL "STAILQ_HEAD *head" "TYPE *elm" "STAILQ_ENTRY NAME"
.Fn STAILQ_LAST "STAILQ_HEAD *head"
.Fn STAILQ_NEXT "TYPE *elm" "STAILQ_ENTRY NAME"
.Fn STAILQ_REMOVE_HEAD "STAILQ_HEAD *head" "STAILQ_ENTRY NAME"
.Fn STAILQ_REMOVE "STAILQ_HEAD *head" "TYPE *elm" "TYPE" "STAILQ_ENTRY NAME"
.\"
.Fn LIST_EMPTY "LIST_HEAD *head"
.Fn LIST_ENTRY "TYPE"
.Fn LIST_FIRST "LIST_HEAD *head"
.Fn LIST_FOREACH "TYPE *var" "LIST_HEAD *head" "LIST_ENTRY NAME"
.Fn LIST_HEAD "HEADNAME" "TYPE"
.Fn LIST_INIT "LIST_HEAD *head"
.Fn LIST_INSERT_AFTER "TYPE *listelm" "TYPE *elm" "LIST_ENTRY NAME"
.Fn LIST_INSERT_BEFORE "TYPE *listelm" "TYPE *elm" "LIST_ENTRY NAME"
.Fn LIST_INSERT_HEAD "LIST_HEAD *head" "TYPE *elm" "LIST_ENTRY NAME"
.Fn LIST_NEXT "TYPE *elm" "LIST_ENTRY NAME"
.Fn LIST_REMOVE "TYPE *elm" "LIST_ENTRY NAME"
.\"
.Fn TAILQ_EMPTY "TAILQ_HEAD *head"
.Fn TAILQ_ENTRY "TYPE"
.Fn TAILQ_FIRST "TAILQ_HEAD *head"
.Fn TAILQ_FOREACH "TYPE *var" "TAILQ_HEAD *head" "TAILQ_ENTRY NAME"
.Fn TAILQ_FOREACH_REVERSE "TYPE *var" "TAILQ_HEAD *head" "HEADNAME" "TAILQ_ENTRY NAME"
.Fn TAILQ_HEAD "HEADNAME" "TYPE"
.Fn TAILQ_INIT "TAILQ_HEAD *head"
.Fn TAILQ_INSERT_AFTER "TAILQ_HEAD *head" "TYPE *listelm" "TYPE *elm" "TAILQ_ENTRY NAME"
.Fn TAILQ_INSERT_BEFORE "TYPE *listelm" "TYPE *elm" "TAILQ_ENTRY NAME"
.Fn TAILQ_INSERT_HEAD "TAILQ_HEAD *head" "TYPE *elm" "TAILQ_ENTRY NAME"
.Fn TAILQ_INSERT_TAIL "TAILQ_HEAD *head" "TYPE *elm" "TAILQ_ENTRY NAME"
.Fn TAILQ_LAST "TAILQ_HEAD *head" "HEADNAME"
.Fn TAILQ_NEXT "TYPE *elm" "TAILQ_ENTRY NAME"
.Fn TAILQ_PREV "TYPE *elm" "HEADNAME" "TAILQ_ENTRY NAME"
.Fn TAILQ_REMOVE "TAILQ_HEAD *head" "TYPE *elm" "TAILQ_ENTRY NAME"
.\"
.Fn CIRCLEQ_EMPTY "CIRCLEQ_HEAD *head"
.Fn CIRCLEQ_ENTRY "TYPE"
.Fn CIRCLEQ_FIRST "CIRCLEQ_HEAD *head"
.Fn CIRCLEQ_FOREACH "TYPE *var" "CIRCLEQ_HEAD *head" "CIRCLEQ_ENTRY NAME"
.Fn CIRCLEQ_FOREACH_REVERSE "TYPE *var" "CIRCLEQ_HEAD *head" "CIRCLEQ_ENTRY NAME"
.Fn CIRCLEQ_HEAD "HEADNAME" "TYPE"
.Fn CIRCLEQ_INIT "CIRCLEQ_HEAD *head"
.Fn CIRCLEQ_INSERT_AFTER "CIRCLEQ_HEAD *head" "TYPE *listelm" "TYPE *elm" "CIRCLEQ_ENTRY NAME"
.Fn CIRCLEQ_INSERT_BEFORE "CIRCLEQ_HEAD *head" "TYPE *listelm" "TYPE *elm" "CIRCLEQ_ENTRY NAME"
.Fn CIRCLEQ_INSERT_HEAD "CIRCLEQ_HEAD *head" "TYPE *elm" "CIRCLEQ_ENTRY NAME"
.Fn CIRCLEQ_INSERT_TAIL "CIRCLEQ_HEAD *head" "TYPE *elm" "CIRCLEQ_ENTRY NAME"
.Fn CIRCLEQ_LAST "CIRCLEQ_HEAD *head"
.Fn CIRCLEQ_NEXT "TYPE *elm" "CIRCLEQ_ENTRY NAME"
.Fn CIRCLE_PREV "TYPE *elm" "CIRCLEQ_ENTRY NAME"
.Fn CIRCLEQ_REMOVE "CIRCLEQ_HEAD *head" "TYPE *elm" "CIRCLEQ_ENTRY NAME"
.Sh $B2r@b(B
$B$3$N%^%/%m$O!"C10l%j%s%/%j%9%H!"C10l%j%s%/%F!<%k%-%e!<!"%j%9%H!"(B
$B%F!<%k%-%e!<!"=[4D%-%e!<$H$$$&!"(B5 $B<oN`$N%G!<%?9=B$$rDj5A$7$F$=$3$GF0:n$7$^$9!#(B
5 $B$D$N%G!<%?9=B$$O$9$Y$F!"0J2<$N5!G=$r%5%]!<%H$7$^$9!#(B
.Bl -enum -compact -offset indent
.It
$B%j%9%H$N@hF,$K?7$7$$%(%s%H%j$rA^F~$9$k!#(B
.It
$B%j%9%H$KB8:_$9$kG$0U$NMWAG$N8e$m$K?7$7$$%(%s%H%j$rA^F~$9$k!#(B
.It
$B%j%9%H$N@hF,$+$i%(%s%H%j$r(B O(1) $B:o=|$9$k!#(B
.It
$B%j%9%H$NG$0U$N%(%s%H%j$r(B O(n) $B:o=|$9$k!#(B
.It
$B%j%9%H$rA0$+$iAv::$9$k!#(B
.El
.Pp
$BC10l%j%s%/%j%9%H$O!"(B5 $B$D$N%G!<%?9=B$$NCf$G:G$bC1=c$G!">e$N(B 5$B$D$N5!G=$7(B
$B$+%5%]!<%H$7$^$;$s!#(B
$BC10l%j%s%/%j%9%H$O!"(B
$B%G!<%?%;%C%H$,Bg$-$/!":o=|$,$[$H$s$I$J$$!"$b$7$/$O!"A4$/$J$$%"%W%j%1!<%7%g%s!"(B
$B$^$?$O(B LIFO $B%-%e!<$N<BAu$KM}A[E*$G$9!#(B
.Pp
$BC10l%j%s%/%F!<%k%-%e!<$K$O0J2<$N5!G=$b$"$j$^$9!#(B
.Bl -enum -compact -offset indent
.It
$B%j%9%H$NKvHx$K%(%s%H%j$rDI2C$9$k!#(B
.El
$B$7$+$70J2<$KCm0U$7$F$/$@$5$$!#(B
.Bl -enum -compact -offset indent
.It
$B%j%9%H$NA^F~$G$O!"%j%9%H$N%X%C%I$rI,$:;XDj$9$kI,MW$,$"$k!#(B
.It
$B3F%X%C%I%(%s%H%j$G$O!"(B1 $B$D$G$O$J$/(B 2 $B$D$N%]%$%s%?$,I,MW$G$"$k!#(B
.It
$BC10l%j%s%/%j%9%H$h$j!"%3!<%I%5%$%:$OLs(B 15% $BBg$-$/!"F0:n$OLs(B 20% $BCY$$!#(B
.El
.Pp
$BC10l%j%s%/%F!<%k%-%e!<$O!"(B
$B%G!<%?%;%C%H$,Bg$-$/!":o=|$,$[$H$s$I$J$$!"$b$7$/$O!"A4$/$J$$%"%W%j%1!<%7%g%s!"(B
$B$^$?$O(B  FIFO $B%-%e!<$N<BAu$KM}A[E*$G$9!#(B
.Pp
$BFs=E%j%s%/%?%$%W$N$9$Y$F$N%G!<%?9=B$(B ($B%j%9%H!"%F!<%k%-%e!<!"=[4D%-%e!<(B) $B$K$O(B
$B0J2<$N5!G=$b$"$j$^$9!#(B
.Bl -enum -compact -offset indent
.It
$B%j%9%H$KB8:_$9$kG$0U$NMWAG$NA0$K?7$7$$%(%s%H%j$rA^F~$9$k!#(B
.It
$B%j%9%H$NG$0U$N%(%s%H%j$r(B O(1) $B:o=|$9$k!#(B
.El
$B$7$+$70J2<$KCm0U$7$F$/$@$5$$!#(B
.Bl -enum -compact -offset indent
.It
$B3FMWAG$K$O!"(B1 $B$D$G$O$J$/(B 2 $B$D$N%]%$%s%?$,I,MW$G$"$k!#(B
.It
$BC10l%j%s%/%G!<%?9=B$$h$j!"%3!<%I%5%$%:$H<B9T;~4V(B ($B:o=|$O=|$/(B) $B$,Ls(B 2 $BG\$K(B
$B$J$k!#(B
.El
.Pp
$B%j%s%/%j%9%H$O!"Fs=E%j%s%/%G!<%?9=B$$NCf$G:G$bC1=c$G!"C10l%j%s%/%j%9%H$N(B
$B5!G=$K2C$($F>e$N5!G=$7$+%5%]!<%H$7$^$;$s!#(B
.Pp
$B%F!<%k%-%e!<$K$O0J2<$N5!G=$b$"$j$^$9!#(B
.Bl -enum -compact -offset indent
.It
$B%j%9%H$NKvHx$K%(%s%H%j$rDI2C$9$k!#(B
.It
$BKvHx$+$i@hF,$X$H5U$KAv::$9$k!#(B
.El
$B$7$+$70J2<$KCm0U$7$F$/$@$5$$!#(B
.Bl -enum -compact -offset indent
.It
$B%j%9%H$NA^F~$H:o=|$G$O!"%j%9%H$N%X%C%I$rI,$:;XDj$9$kI,MW$,$"$k!#(B
.It
$B3F%X%C%I%(%s%H%j$G$O!"(B1 $B$D$G$O$J$/(B 2 $B$D$N%]%$%s%?$,I,MW$G$"$k!#(B
.It
$BC10l%j%s%/%j%9%H$h$j!"%3!<%I%5%$%:$OLs(B 15% $BBg$-$/!"=hM};~4V$OLs(B 20% $BD9$$!#(B
.El
.Pp
$B=[4D%-%e!<$K$O0J2<$N5!G=$b$"$j$^$9!#(B
.Bl -enum -compact -offset indent
.It
$B%j%9%H$NKvHx$K%(%s%H%j$rDI2C$9$k!#(B
.It
$BKvHx$+$i@hF,$X$H5U$KAv::$9$k!#(B
.El
$B$7$+$70J2<$KCm0U$7$F$/$@$5$$!#(B
.Bl -enum -compact -offset indent
.It
$B%j%9%H$NA^F~$H:o=|$G$O!"%j%9%H$N%X%C%I$rI,$:;XDj$9$kI,MW$,$"$k!#(B
.It
$B3F%X%C%I%(%s%H%j$G$O!"(B1 $B$D$G$O$J$/(B 2 $B$D$N%]%$%s%?$,I,MW$G$"$k!#(B
.It
$BAv::$N=*N;>r7o$,$h$jJ#;($G$"$k!#(B
.It
$B%j%9%H$h$j!"%3!<%I%5%$%:$OLs(B 40% $BBg$-$/!"=hM};~4V$OLs(B 45% $BD9$$!#(B
.El
.Pp
$B%^%/%mDj5A$G$O!"(B
.Fa TYPE
$B$O%f!<%6$,Dj5A$7$?9=B$BN$NL>A0$G$9!#$3$N9=B$BN$K$O!"(B
.Fa NAME
$B$H$$$&L>A0$,IU$$$?!"(B
.Li SLIST_ENTRY ,
.Li STAILQ_ENTRY ,
.Li LIST_ENTRY ,
.Li TAILQ_ENTRY ,
.Li CIRCLEQ_ENTRY
$B$H$$$&7?$N%U%#!<%k%I$r4^$a$kI,MW$,$"$j$^$9!#(B
$B0z?t(B
.Fa HEADNAME
$B$O(B
$B%^%/%m(B
.Li SLIST_HEAD ,
.Li STAILQ_HEAD ,
.Li LIST_HEAD ,
.Li TAILQ_HEAD ,
.Li CIRCLEQ_HEAD
$B$G@k8@$9$kI,MW$N$"$k!"%f!<%6$,Dj5A$7$?9=B$BN$NL>A0$G$9!#(B
$B$3$N%^%/%m$N;HMQK!$N>\:Y$K$D$$$F$O!"0J2<$N;HMQNc$r;2>H$7$F$/$@$5$$!#(B
.Sh $BC10l%j%s%/%j%9%H(B
$BC10l%j%s%/%j%9%H$N:G=i$K$O!"(B
.Nm SLIST_HEAD
$B%^%/%m$GDj5A$5$l$k9=B$BN$,IU$-$^$9!#(B
$B$3$N9=B$BN$K$O!"%j%9%H$N@hF,$NMWAG$r;X$9%]%$%s%?$,(B 1 $B$D4^$^$l$^$9!#(B
$BMWAG$O!"G$0U$NMWAG$N(B O(n) $B:o=|$r5>@7$K$7$F!"(B
$B%9%Z!<%9$H%]%$%s%?A`:n$N%*!<%P%X%C%I$,:G>.$K$J$k$h$&$KC10l%j%s%/$5$l$^$9!#(B
The elements are singly linked for minimum space and pointer manipulation
overhead at the expense of O(n) removal for arbitrary elements.
$B?7$7$$MWAG$O!"4{B8$NMWAG$N8e$m!"%j%9%H$N@hF,$G%j%9%H$KDI2C$G$-$^$9!#(B
.Fa SLIST_HEAD
$B9=B$BN$O0J2<$N$h$&$K@k8@$5$l$^$9!#(B
.Bd -literal -offset indent
SLIST_HEAD(HEADNAME, TYPE) head;
.Ed
.Pp
$B$3$3$G(B
.Fa HEADNAME
$B$ODj5A$9$k9=B$BN$NL>A0$G!"(B
.Fa TYPE
$B$O%j%9%H$K%j%s%/$9$kMWAG$N7?$G$9!#(B
$B%j%9%H$N%X%C%I$N%]%$%s%?$O!"8e$G0J2<$N$h$&$K@k8@$G$-$^$9!#(B 
.Bd -literal -offset indent
struct HEADNAME *headp;
.Ed
.Pp
($BL>A0(B
.Li head
$B$H(B
.Li headp
$B$O!"%f!<%6$,A*$Y$^$9!#(B)
.Pp
$B%^%/%m(B
.Nm SLIST_EMPTY
$B$O%j%9%H$KMWAG$,$J$$>l9g$K??$K$J$j$^$9!#(B
.Pp
$B%^%/%m(B
.Nm SLIST_ENTRY
$B$O%j%9%H$NMWAG$r@\B3$9$k9=B$BN$r@k8@$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm SLIST_FIRST
$B$O%j%9%H$N@hF,$NMWAG$r!"%j%9%H$,6u$J$i(B NULL $B$rJV$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm SLIST_FOREACH
$B$O(B
.Fa head
$B$G;2>H$5$l$k%j%9%H$r!"3FMWAG$r=g$K(B
.Fa var
$B$K3d$jEv$F$F=gJ}8~$KAv::$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm SLIST_INIT
$B$O(B
.Fa head
$B$,;2>H$9$k%j%9%H$r=i4|2=$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm SLIST_INSERT_HEAD
$B$O?7$7$$MWAG(B
.Fa elm
$B$r%j%9%H$N@hF,$KA^F~$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm SLIST_INSERT_AFTER
$B$OMWAG(B
.Fa listelm
$B$N8e$K?7$7$$MWAG(B
.Fa elm
$B$rA^F~$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm SLIST_NEXT
$B$O%j%9%H$N<!$NMWAG$rJV$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm SLIST_REMOVE_HEAD
$B$O%j%9%H$N@hF,$+$iMWAG(B
.Fa elm
$B$r:o=|$7$^$9!#(B
$B:GE,$J8zN($rF@$k$?$a$K!"%j%9%H$N@hF,$+$iMWAG$r:o=|$9$k>l9g$K$O(B
$B0lHLE*$J(B
.Fa SLIST_REMOVE
$B%^%/%m$NBe$o$j$K$3$N%^%/%m$rL@<(E*$K;HMQ$9$Y$-$G$9!#(B
.Pp
$B%^%/%m(B
.Nm SLIST_REMOVE
$B$O%j%9%H$+$iMWAG(B
.Fa elm
$B$r:o=|$7$^$9!#(B
.Sh $BC10l%j%s%/%j%9%H$N;HMQNc(B
.Bd -literal
SLIST_HEAD(slisthead, entry) head;
struct slisthead *headp;		/* Singly-linked List head. */
struct entry {
	...
	SLIST_ENTRY(entry) entries;	/* Singly-linked List. */
	...
} *n1, *n2, *n3, *np;

SLIST_INIT(&head);			/* Initialize the list. */

n1 = malloc(sizeof(struct entry));	/* Insert at the head. */
SLIST_INSERT_HEAD(&head, n1, entries);

n2 = malloc(sizeof(struct entry));	/* Insert after. */
SLIST_INSERT_AFTER(n1, n2, entries);

SLIST_REMOVE(&head, n2, entry, entries);/* Deletion. */
free(n2);

n3 = SLIST_FIRST(&head);
SLIST_REMOVE_HEAD(&head, entries);	/* Deletion. */
free(n3);

					/* Forward traversal. */
SLIST_FOREACH(np, &head, entries)
	np-> ...

while (!SLIST_EMPTY(&head)) { /* List Deletion. */
	n1 = SLIST_FIRST(&head);
	SLIST_REMOVE_HEAD(&head, entries);
	free(n1);
}
.Ed
.Sh $BC10l%j%s%/%F!<%k%-%e!<(B
$BC10l%j%s%/%F!<%k%-%e!<$N:G=i$K$O!"(B
.Nm STAILQ_HEAD
$B%^%/%m$GDj5A$5$l$k9=B$BN$,$D$-$^$9!#(B
$B$3$N9=B$BN$K$O%F!<%k%-%e!<$N@hF,$NMWAG$r;X$9%]%$%s%?$H(B
$B%F!<%k%-%e!<$NKvHx$NMWAG$r;X$9%]%$%s%?$N(B 2 $B$D$,4^$^$l$^$9!#(B
$BMWAG$O!"G$0U$NMWAG$N(B O(n) $B:o=|$r5>@7$K$7$F!"(B
$B%9%Z!<%9$H%]%$%s%?A`:n$N%*!<%P%X%C%I$,:G>.$K$J$k$h$&$KC10l%j%s%/$5$l$^$9!#(B
$B?7$7$$MWAG$O!"4{B8$NMWAG$N8e$m!"%F!<%k%-%e!<$N@hF,!"%F!<%k%-%e!<$NKvHx$G(B
$B%F!<%k%-%e!<$KDI2C$G$-$^$9!#(B
.Fa STAILQ_HEAD
$B9=B$BN$O0J2<$N$h$&$K@k8@$5$l$^$9!#(B
.Bd -literal -offset indent
STAILQ_HEAD(HEADNAME, TYPE) head;
.Ed
.Pp
$B$3$3$G(B
.Li HEADNAME
$B$ODj5A$9$k9=B$BN$NL>A0$G!"(B
.Li TYPE
$B$O%F!<%k%-%e!<$K%j%s%/$9$kMWAG$N7?$G$9!#(B
$B%F!<%k%-%e!<$N%X%C%I$N%]%$%s%?$O!"8e$G0J2<$N$h$&$K@k8@$G$-$^$9!#(B
.Bd -literal -offset indent
struct HEADNAME *headp;
.Ed
.Pp
($BL>A0(B
.Li head
$B$H(B
.Li headp
$B$O!"%f!<%6$,A*$Y$^$9!#(B)
.Pp
$B%^%/%m(B
.Nm STAILQ_EMPTY
$B$O%F!<%k%-%e!<$KMWAG$,$J$$>l9g$K??$K$J$j$^$9!#(B
.Pp
$B%^%/%m(B
.Nm STAILQ_ENTRY
$B$O%F!<%k%-%e!<$NMWAG$r@\B3$9$k9=B$BN$r@k8@$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm STAILQ_FIRST
$B$O%F!<%k%-%e!<$N@hF,$NMWAG$r!"%F!<%k%-%e!<$,6u$J$i(B NULL $B$rJV$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm STAILQ_FOREACH
$B$O(B
.Fa head
$B$G;2>H$5$l$k%F!<%k%-%e!<$r!"3FMWAG$r=g$K(B
.Fa var
$B$K3d$jEv$F$F=gJ}8~$KAv::$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm STAILQ_INIT
$B$O(B
.Fa head
$B$,;2>H$9$k%F!<%k%-%e!<$r=i4|2=$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm STAILQ_INSERT_HEAD
$B$O?7$7$$MWAG(B
.Fa elm
$B$r%F!<%k%-%e!<$N@hF,$KA^F~$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm STAILQ_INSERT_TAIL
$B$O?7$7$$MWAG(B
.Fa elm
$B$r%F!<%k%-%e!<$NKvHx$KA^F~$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm STAILQ_INSERT_AFTER
$B$O?7$7$$MWAG(B
.Fa elm
$B$rMWAG(B
.Fa listelm
$B$N8e$m$KA^F~$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm STAILQ_LAST
$B$O%F!<%k%-%e!<$NKvHx$NMWAG$rJV$7$^$9!#(B
$B%F!<%k%-%e!<$,6u$J$i!"La$jCM$OL$Dj5A$G$9!#(B
.Pp
$B%^%/%m(B
.Nm STAILQ_NEXT
$B$O%F!<%k%-%e!<$N<!$NMWAG$r!"$3$NMWAG$,KvHx$J$i(B NULL $B$rJV$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm STAILQ_REMOVE_HEAD
$B$O%F!<%k%-%e!<$N@hF,$+$iMWAG(B
.Fa elm
$B$r:o=|$7$^$9!#(B
$B:GE,$J8zN($rF@$k$?$a$K!"%F!<%k%-%e!<$N@hF,$+$iMWAG$r:o=|$9$k>l9g$K$O(B
$B0lHLE*$J(B
.Fa STAILQ_REMOVE
$B%^%/%m$h$j$b$3$N%^%/%m$rL@<(E*$K;HMQ$9$Y$-$G$9!#(B
.Pp
$B%^%/%m(B
.Nm STAILQ_REMOVE
$B$O%F!<%k%-%e!<$+$iMWAG(B
.Fa elm
$B$r:o=|$7$^$9!#(B
.Sh $BC10l%j%s%/%F!<%k%-%e!<$N;HMQNc(B
.Bd -literal
STAILQ_HEAD(stailhead, entry) head;
struct stailhead *headp;		/* Singly-linked tail queue head. */
struct entry {
	...
	STAILQ_ENTRY(entry) entries;	/* Tail queue. */
	...
} *n1, *n2, *n3, *np;

STAILQ_INIT(&head);			/* Initialize the queue. */

n1 = malloc(sizeof(struct entry));	/* Insert at the head. */
STAILQ_INSERT_HEAD(&head, n1, entries);

n1 = malloc(sizeof(struct entry));	/* Insert at the tail. */
STAILQ_INSERT_TAIL(&head, n1, entries);

n2 = malloc(sizeof(struct entry));	/* Insert after. */
STAILQ_INSERT_AFTER(&head, n1, n2, entries);

					/* Deletion. */
STAILQ_REMOVE(&head, n2, entry, entries);
free(n2);

					/* Deletion from the head */
n3 = STAILQ_FIRST(&head);
STAILQ_REMOVE_HEAD(&head, entries);
free(n3);

					/* Forward traversal. */
STAILQ_FOREACH(np, &head, entries)
	np-> ...
					/* TailQ Deletion. */
while (!STAILQ_EMPTY(&head)) {
	n1 = STAILQ_HEAD(&head);
	STAILQ_REMOVE_HEAD(&head, entries);
	free(n1);
}
					/* Faster TailQ Deletion. */
n1 = STAILQ_FIRST(&head);
while (n1 != NULL) {
	n2 = STAILQ_NEXT(n1, entries);
	free(n1);
	n1 = n2;
}
STAILQ_INIT(&head);
.Ed
.Sh $B%j%9%H(B
$B%j%9%H$N:G=i$K$O!"(B
.Nm LIST_HEAD
$B%^%/%m$GDj5A$5$l$k9=B$BN$,IU$-$^$9!#(B
$B$3$N9=B$BN$K$O!"%j%9%H$N@hF,$NMWAG$r;X$9%]%$%s%?$,(B 1 $B$D4^$^$l$^$9!#(B
$BMWAG$OFs=E$K%j%s%/$5$l$F$$$k$N$G!"%j%9%H$rAv::$;$:$KG$0U$NMWAG$r:o=|$G$-$^$9!#(B
$B?7$7$$MWAG$O!"4{B8$NMWAG$NA0!"4{B8$NMWAG$N8e!"%j%9%H$N@hF,$G(B
$B%j%9%H$KDI2C$G$-$^$9!#(B
.Fa LIST_HEAD
$B9=B$BN$O!"0J2<$N$h$&$K@k8@$5$l$^$9!#(B
.Bd -literal -offset indent
LIST_HEAD(HEADNAME, TYPE) head;
.Ed
.Pp
$B$3$3$G(B
.Fa HEADNAME
$B$ODj5A$9$k9=B$BN$NL>A0$G!"(B
.Fa TYPE
$B$O%j%9%H$K%j%s%/$9$kMWAG$N7?$G$9!#(B
$B%j%9%H$N%X%C%I$N%]%$%s%?$O!"8e$G0J2<$N$h$&$K@k8@$G$-$^$9!#(B
.Bd -literal -offset indent
struct HEADNAME *headp;
.Ed
.Pp
($BL>A0(B
.Li head
$B$H(B
.Li headp
$B$O!"%f!<%6$,A*$Y$^$9!#(B)
.Pp
$B%^%/%m(B
.Nm LIST_EMPTY
$B$O%j%9%H$KMWAG$,$J$$>l9g$K??$K$J$j$^$9!#(B
.Pp
$B%^%/%m(B
.Nm LIST_ENTRY
$B$O%j%9%H$NMWAG$r@\B3$9$k9=B$BN$r@k8@$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm LIST_FIRST
$B$O%j%9%H$N:G=i$NMWAG$r!"%j%9%H$,6u$J$i(B NULL $B$rJV$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm LIST_FOREACH
$B$O(B
.Fa head
$B$G;2>H$5$l$k%j%9%H$r!"3FMWAG$r=g$K(B
.Fa var
$B$K3d$jEv$F$F=gJ}8~$KAv::$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm LIST_INIT
$B$O(B
.Fa head
$B$,;2>H$9$k%j%9%H$r=i4|2=$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm LIST_INSERT_HEAD
$B$O?7$7$$MWAG(B
.Fa elm
$B$r%j%9%H$N@hF,$KA^F~$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm LIST_INSERT_AFTER
$B$O?7$7$$MWAG(B
.Fa elm
$B$rMWAG(B
.Fa listelm
$B$N8e$m$KA^F~$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm LIST_INSERT_BEFORE
$B$O?7$7$$MWAG(B
.Fa elm
$B$rMWAG(B
.Fa listelm
$B$N8e$m$KA^F~$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm LIST_NEXT
$B$O%j%9%H$N<!$NMWAG$r!"$3$NMWAG$,KvHx$J$i(B NULL $B$rJV$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm LIST_REMOVE
$B$OMWAG(B
.Fa elm
$B$r%j%9%H$+$i:o=|$7$^$9!#(B
.Sh $B%j%9%H$N;HMQNc(B
.Bd -literal
LIST_HEAD(listhead, entry) head;
struct listhead *headp;		/* List head. */
struct entry {
	...
	LIST_ENTRY(entry) entries;	/* List. */
	...
} *n1, *n2, *n3, *np;

LIST_INIT(&head);			/* Initialize the list. */

n1 = malloc(sizeof(struct entry));	/* Insert at the head. */
LIST_INSERT_HEAD(&head, n1, entries);

n2 = malloc(sizeof(struct entry));	/* Insert after. */
LIST_INSERT_AFTER(n1, n2, entries);

n3 = malloc(sizeof(struct entry));	/* Insert before. */
LIST_INSERT_BEFORE(n2, n3, entries);

LIST_REMOVE(n2, entries);		/* Deletion. */
free(n2);

					/* Forward traversal. */
LIST_FOREACH(np, &head, entries)
	np-> ...

while (!LIST_EMPTY(&head)) {          /* List Deletion. */
	n1 = LIST_FIRST(&head);
	LIST_REMOVE(n1, entries);
	free(n1);
}

n1 = LIST_FIRST(&head);                       /* Faster List Delete. */
while (n1 != NULL) {
	n2 = LIST_NEXT(n1, entries);
	free(n1);
	n1 = n2;
}
LIST_INIT(&head);

.Ed
.Sh $B%F!<%k%-%e!<(B
$B%F!<%k%-%e!<$N:G=i$K$O!"(B
.Nm TAILQ_HEAD
$B%^%/%m$GDj5A$5$l$k9=B$BN$,IU$-$^$9!#(B
$B$3$N9=B$BN$K$O!"%F!<%k%-%e!<$N:G=i$NMWAG$r;X$9%]%$%s%?$H(B
$B%F!<%k%-%e!<$N@hF,$NMWAG$r;X$9%]%$%s%?$N(B 2 $B$D$,4^$^$l$^$9!#(B
$BMWAG$OFs=E$K%j%s%/$5$l$F$$$k$N$G!"%F!<%k%-%e!<$rAv::$;$:$K(B
$BG$0U$NMWAG$r:o=|$G$-$^$9!#(B
$B?7$7$$MWAG$O!"4{B8$NMWAG$NA0!"4{B8$NMWAG$N8e!"%F!<%k%-%e!<$N@hF,!"(B
$B%F!<%k%-%e!<$NKvHx$G%F!<%k%-%e!<$KDI2C$G$-$^$9!#(B
.Fa TAILQ_HEAD
$B9=B$BN$O!"0J2<$N$h$&$K@k8@$5$l$F$$$^$9!#(B
.Bd -literal -offset indent
TAILQ_HEAD(HEADNAME, TYPE) head;
.Ed
.Pp
$B$3$3$G(B
.Li HEADNAME
$B$ODj5A$9$k9=B$BN$NL>A0$G!"(B
.Li TYPE
$B$O%F!<%k%-%e!<$K%j%s%/$9$kMWAG$N7?$G$9!#(B
$B%F!<%k%-%e!<$N%X%C%I$N%]%$%s%?$O!"8e$G0J2<$N$h$&$K@k8@$5$l$^$9!#(B
.Bd -literal -offset indent
struct HEADNAME *headp;
.Ed
.Pp
($BL>A0(B
.Li head
$B$H(B
.Li headp
$B$O!"%f!<%6$,A*$Y$^$9!#(B)
.Pp
$B%^%/%m(B
.Nm TAILQ_EMPTY
$B$O%F!<%k%-%e!<$KMWAG$,$J$$>l9g$K??$K$J$j$^$9!#(B
.Pp
$B%^%/%m(B
.Nm TAILQ_ENTRY
$B$O%F!<%k%-%e!<$NMWAG$r@\B3$9$k9=B$BN$r@k8@$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm TAILQ_FIRST
$B$O%F!<%k%-%e!<$N:G=i$NMWAG$r!"%F!<%k%-%e!<$,6u$J$i(B NULL $B$rJV$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm TAILQ_FOREACH
$B$O(B
.Fa head
$B$G;2>H$5$l$k%F!<%k%-%e!<$r!"3FMWAG$r=g$K(B
.Fa var
$B$K3d$jEv$F$F=gJ}8~$KAv::$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm TAILQ_FOREACH_REVERSE
$B$O(B
.Fa head
$B$G;2>H$5$l$k%F!<%k%-%e!<$r!"3FMWAG$r=g$K(B
.Fa var
$B$K3d$jEv$F$F5UJ}8~$KAv::$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm TAILQ_INIT
$B$O(B
.Fa head
$B$,;2>H$9$k%F!<%k%-%e!<$r=i4|2=$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm TAILQ_INSERT_HEAD
$B$O?7$7$$MWAG(B
.Fa elm
$B$r%F!<%k%-%e!<$N@hF,$KA^F~$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm TAILQ_INSERT_TAIL
$B$O?7$7$$MWAG(B
.Fa elm
$B$r%F!<%k%-%e!<$NKvHx$KA^F~$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm TAILQ_INSERT_AFTER
$B$O?7$7$$MWAG(B
.Fa elm
$B$rMWAG(B
.Fa listelm
$B$N8e$m$KA^F~$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm TAILQ_INSERT_BEFORE
$B$O?7$7$$MWAG(B
.Fa elm
$B$rMWAG(B
.Fa listelm
$B$NA0$KA^F~$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm TAILQ_LAST
$B$O%F!<%k%-%e!<$NKvHx$NMWAG$rJV$7$^$9!#(B
$B%F!<%k%-%e!<$,6u$N>l9g!"La$jCM$OL$Dj5A$G$9!#(B 
.Pp
$B%^%/%m(B
.Nm TAILQ_NEXT
$B$O%F!<%k%-%e!<$N<!$NMWAG$r!"$=$NMWAG$,KvHx$N>l9g$O(B NULL $B$rJV$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm TAILQ_PREV
$B$O%F!<%k%-%e!<$NA0$NMWAG$r!"$=$NMWAG$,@hF,$N>l9g$O(B NULL $B$rJV$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm TAILQ_REMOVE
$B$OMWAG(B
.Fa elm
$B$r%F!<%k%-%e!<$+$i:o=|$7$^$9!#(B
.Sh $B%F!<%k%-%e!<$N;HMQNc(B
.Bd -literal
TAILQ_HEAD(tailhead, entry) head;
struct tailhead *headp;		/* Tail queue head. */
struct entry {
	...
	TAILQ_ENTRY(entry) entries;	/* Tail queue. */
	...
} *n1, *n2, *n3, *np;

TAILQ_INIT(&head);			/* Initialize the queue. */

n1 = malloc(sizeof(struct entry));	/* Insert at the head. */
TAILQ_INSERT_HEAD(&head, n1, entries);

n1 = malloc(sizeof(struct entry));	/* Insert at the tail. */
TAILQ_INSERT_TAIL(&head, n1, entries);

n2 = malloc(sizeof(struct entry));	/* Insert after. */
TAILQ_INSERT_AFTER(&head, n1, n2, entries);

n3 = malloc(sizeof(struct entry));	/* Insert before. */
TAILQ_INSERT_BEFORE(n2, n3, entries);

TAILQ_REMOVE(&head, n2, entries);	/* Deletion. */
free(n2);
					/* Forward traversal. */
TAILQ_FOREACH(np, &head, entries)
	np-> ...
					/* Reverse traversal. */
TAILQ_FOREACH_REVERSE(np, &head, tailhead, entries)
	np-> ...
					/* TailQ Deletion. */
while (!TAILQ_EMPTY(head)) {
	n1 = TAILQ_FIRST(&head);
	TAILQ_REMOVE(&head, n1, entries);
	free(n1);
}
					/* Faster TailQ Deletion. */

n1 = TAILQ_FIRST(&head);
while (n1 != NULL) {
	n2 = TAILQ_NEXT(n1, entries);
	free(n1);
	n1 = n2;
}
TAILQ_INIT(&head);
.Ed
.Sh $B=[4D%-%e!<(B
$B=[4D%-%e!<$N:G=i$K$O!"(B
.Nm CIRCLEQ_HEAD
$B%^%/%m$GDj5A$5$l$k9=B$BN$,IU$-$^$9!#(B
$B$3$N9=B$BN$K$O!"=[4D%-%e!<$N@hF,$NMWAG$r;X$9%]%$%s%?$H(B
$B=[4D%-%e!<$NKvHx$NMWAG$r;X$9%]%$%s%?$N(B 2 $B$D$,4^$^$l$^$9!#(B
$BMWAG$OFs=E$K%j%s%/$5$l$F$$$k$N$G!"%-%e!<$rAv::$;$:$K(B
$BG$0U$NMWAG$r:o=|$G$-$^$9!#(B
$B?7$7$$MWAG$O!"4{B8$NMWAG$NA0!"4{B8$NMWAG$N8e$m!"=[4D%-%e!<$N@hF,!"(B
$B=[4D%-%e!<$NKvHx$G=[4D%-%e!<$KDI2C$G$-$^$9!#(B
.Fa CIRCLEQ_HEAD
$B9=B$BN$O0J2<$N$h$&$K@k8@$5$l$^$9!#(B
.Bd -literal -offset indent
CIRCLEQ_HEAD(HEADNAME, TYPE) head;
.Ed
.Pp
$B$3$3$G(B
.Li HEADNAME
$B$ODj5A$9$k9=B$BN$NL>A0$G!"(B
.Li TYPE
$B$O=[4D%-%e!<$K%j%s%/$9$kMWAG$N7?$G$9!#(B
$B=[4D%-%e!<$N%X%C%I$N%]%$%s%?$O!"8e$G0J2<$N$h$&$K@k8@$G$-$^$9!#(B
.Bd -literal -offset indent
struct HEADNAME *headp;
.Ed
.Pp
($BL>A0(B
.Li head
$B$H(B
.Li headp
$B$O!"%f!<%6$,A*$Y$^$9!#(B)
.Pp
$B%^%/%m(B
.Nm CIRCLEQ_EMPTY
$B$O=[4D%-%e!<$KMWAG$,$J$$>l9g$K??$K$J$j$^$9!#(B
.Pp
$B%^%/%m(B
.Nm CIRCLEQ_ENTRY
$B$O=[4D%-%e!<$NMWAG$r@\B3$9$k9=B$BN$r@k8@$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm CIRCLEQ_FIRST
$B$O=[4D%-%e!<$N@hF,$NMWAG$rJV$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm CICRLEQ_FOREACH
$B$O(B
.Fa head
$B$G;2>H$5$l$k=[4D%-%e!<$r!"3FMWAG$r=g$K(B
.Fa var
$B$K3d$jEv$F$F=gJ}8~$KAv::$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm CICRLEQ_FOREACH_REVERSE
$B$O(B
.Fa head
$B$G;2>H$5$l$k=[4D%-%e!<$r!"3FMWAG$r=g$K(B
.Fa var
$B$K3d$jEv$F$F5UJ}8~$KAv::$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm CIRCLEQ_INIT
$B$O(B
.Fa head
$B$,;2>H$9$k=[4D%-%e!<$r=i4|2=$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm CIRCLEQ_INSERT_HEAD
$B$O?7$7$$MWAG(B
.Fa elm
$B$r=[4D%-%e!<$N@hF,$KA^F~$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm CIRCLEQ_INSERT_TAIL
$B$O?7$7$$MWAG(B
.Fa elm
$B$r=[4D%-%e!<$NKvHx$KA^F~$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm CIRCLEQ_INSERT_AFTER
$B$O?7$7$$MWAG(B
.Fa elm
$B$rMWAG(B
.Fa listelm
$B$N8e$m$KA^F~$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm CIRCLEQ_INSERT_BEFORE
$B$O?7$7$$MWAG(B
.Fa elm
$B$rMWAG(B
.Fa listelm
$B$NA0$KA^F~$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm CIRCLEQ_LAST
$B$O=[4D%-%e!<$NKvHx$NMWAG$rJV$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm CIRCLEQ_NEXT
$B$O=[4D%-%e!<$N<!$NMWAG$rJV$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm CIRCLEQ_PREV
$B$O=[4D%-%e!<$NA0$NMWAG$rJV$7$^$9!#(B
.Pp
$B%^%/%m(B
.Nm CIRCLEQ_REMOVE
$B$OMWAG(B
.Fa elm
$B$r=[4D%-%e!<$+$i:o=|$7$^$9!#(B
.Sh $B=[4D%-%e!<$N;HMQNc(B
.Bd -literal
CIRCLEQ_HEAD(circleq, entry) head;
struct circleq *headp;			/* Circular queue head. */
struct entry {
	...
	CIRCLEQ_ENTRY(entry) entries;	/* Circular queue. */
	...
} *n1, *n2, *np;

CIRCLEQ_INIT(&head);			/* Initialize the circular queue. */

n1 = malloc(sizeof(struct entry));	/* Insert at the head. */
CIRCLEQ_INSERT_HEAD(&head, n1, entries);

n1 = malloc(sizeof(struct entry));	/* Insert at the tail. */
CIRCLEQ_INSERT_TAIL(&head, n1, entries);

n2 = malloc(sizeof(struct entry));	/* Insert after. */
CIRCLEQ_INSERT_AFTER(&head, n1, n2, entries);

n2 = malloc(sizeof(struct entry));	/* Insert before. */
CIRCLEQ_INSERT_BEFORE(&head, n1, n2, entries);

CIRCLEQ_REMOVE(&head, n1, entries);	/* Deletion. */
free(n1);
					/* Forward traversal. */
CIRCLEQ_FOREACH(np, &head, entries)
	np-> ...
					/* Reverse traversal. */
CIRCLEQ_FOREACH_REVERSE(np, &head, entries)
	np-> ...
					/* CircleQ Deletion. */
while (CIRCLEQ_FIRST(&head) != (void *)&head) {
	n1 = CIRCLEQ_HEAD(&head);
	CIRCLEQ_REMOVE(&head, n1, entries);
	free(n1);
}
					/* Faster CircleQ Deletion. */
n1 = CIRCLEQ_FIRST(&head);
while (n1 != (void *)&head) {
	n2 = CIRCLEQ_NEXT(n1, entries);
	free(n1);
	n1 = n2;
}
CIRCLEQ_INIT(&head);
.Ed
.Sh $BNr;K(B
.Nm queue
$B4X?t$O(B
.Bx 4.4
$B$G$O$8$a$FEP>l$7$^$7$?!#(B
