From owner-man-jp-reviewer@jp.freebsd.org  Mon Sep 10 11:59:07 2001
Received: (from daemon@localhost)
	by castle.jp.freebsd.org (8.9.3+3.2W/8.7.3) id LAA03060;
	Mon, 10 Sep 2001 11:59:07 +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 LAA03055
	for <man-jp-reviewer@jp.freebsd.org>; Mon, 10 Sep 2001 11:59:07 +0900 (JST)
	(envelope-from koizumi@cms.phys.s.u-tokyo.ac.jp)
Received: from mail-cms (cms-as3.phys.s.u-tokyo.ac.jp [133.11.4.6])
	by tatesina.phys.s.u-tokyo.ac.jp (8.11.6/3.7W) with ESMTP id f8A2x7u69290
	for <man-jp-reviewer@jp.freebsd.org>; Mon, 10 Sep 2001 11:59:07 +0900 (JST)
Message-Id: <200109100259.f8A2x7u69290@tatesina.phys.s.u-tokyo.ac.jp>
To: man-jp-reviewer@jp.freebsd.org
Date: Mon, 10 Sep 2001 11:59:06 +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 3786
Subject: [man-jp-reviewer 3786] 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$N=$@5HG$G$9!#(B
 $BCSFb$5$s$N;XE&$K=>$C$F!"%=!<%9%3!<%I$NNc$N%3%a%s%HItJ,$rLu$7$F$_$^$7$?!#(B
 $B$^$?!"4V0c$$$r8+$D$1$?$N$G$=$l$bD>$7$F$"$j$^$9!#(B

                            $B>.(B  $B@t(B    $B8g(B

--- queue.3.orig	Mon Sep  3 12:07:15 2001
+++ queue.3	Mon Sep 10 11:52:48 2001
@@ -361,7 +361,7 @@
 .Nm SLIST_INSERT_AFTER
 $B$OMWAG(B
 .Fa listelm
-$B$N8e$K?7$7$$MWAG(B
+$B$N8e$m$K?7$7$$MWAG(B
 .Fa elm
 $B$rA^F~$7$^$9!#(B
 .Pp
@@ -387,33 +387,33 @@
 .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 slisthead *headp;		/* $BC10l%j%s%/%j%9%H%X%C%I(B */
 struct entry {
 	...
-	SLIST_ENTRY(entry) entries;	/* Singly-linked List. */
+	SLIST_ENTRY(entry) entries;	/* $BC10l%j%s%/%j%9%H(B */
 	...
 } *n1, *n2, *n3, *np;
 
-SLIST_INIT(&head);			/* Initialize the list. */
+SLIST_INIT(&head);			/* $B%j%9%H$r=i4|2=(B */
 
-n1 = malloc(sizeof(struct entry));	/* Insert at the head. */
+n1 = malloc(sizeof(struct entry));	/* $B@hF,$KA^F~(B */
 SLIST_INSERT_HEAD(&head, n1, entries);
 
-n2 = malloc(sizeof(struct entry));	/* Insert after. */
+n2 = malloc(sizeof(struct entry));	/* $B8e$m$KA^F~(B */
 SLIST_INSERT_AFTER(n1, n2, entries);
 
-SLIST_REMOVE(&head, n2, entry, entries);/* Deletion. */
+SLIST_REMOVE(&head, n2, entry, entries);/* $B:o=|(B */
 free(n2);
 
 n3 = SLIST_FIRST(&head);
-SLIST_REMOVE_HEAD(&head, entries);	/* Deletion. */
+SLIST_REMOVE_HEAD(&head, entries);	/* $B:o=|(B */
 free(n3);
 
-					/* Forward traversal. */
+					/* $B=gAv::(B */
 SLIST_FOREACH(np, &head, entries)
 	np-> ...
 
-while (!SLIST_EMPTY(&head)) { /* List Deletion. */
+while (!SLIST_EMPTY(&head)) { /* $B%j%9%H$N:o=|(B */
 	n1 = SLIST_FIRST(&head);
 	SLIST_REMOVE_HEAD(&head, entries);
 	free(n1);
@@ -524,43 +524,43 @@
 .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 stailhead *headp;		/* $BC10l%j%s%/%F!<%k%-%e!<%X%C%I(B */
 struct entry {
 	...
-	STAILQ_ENTRY(entry) entries;	/* Tail queue. */
+	STAILQ_ENTRY(entry) entries;	/* $B%F!<%k%-%e!<(B */
 	...
 } *n1, *n2, *n3, *np;
 
-STAILQ_INIT(&head);			/* Initialize the queue. */
+STAILQ_INIT(&head);			/* $B%-%e!<$r=i4|2=(B */
 
-n1 = malloc(sizeof(struct entry));	/* Insert at the head. */
+n1 = malloc(sizeof(struct entry));	/* $B@hF,$KA^F~(B */
 STAILQ_INSERT_HEAD(&head, n1, entries);
 
-n1 = malloc(sizeof(struct entry));	/* Insert at the tail. */
+n1 = malloc(sizeof(struct entry));	/* $BKvHx$KA^F~(B */
 STAILQ_INSERT_TAIL(&head, n1, entries);
 
-n2 = malloc(sizeof(struct entry));	/* Insert after. */
+n2 = malloc(sizeof(struct entry));	/* $B8e$m$KA^F~(B */
 STAILQ_INSERT_AFTER(&head, n1, n2, entries);
 
-					/* Deletion. */
+					/* $B:o=|(B */
 STAILQ_REMOVE(&head, n2, entry, entries);
 free(n2);
 
-					/* Deletion from the head */
+					/* $B@hF,$+$i:o=|(B */
 n3 = STAILQ_FIRST(&head);
 STAILQ_REMOVE_HEAD(&head, entries);
 free(n3);
 
-					/* Forward traversal. */
+					/* $B=gAv::(B */
 STAILQ_FOREACH(np, &head, entries)
 	np-> ...
-					/* TailQ Deletion. */
+					/* $B%F!<%k%-%e!<$N:o=|(B */
 while (!STAILQ_EMPTY(&head)) {
 	n1 = STAILQ_HEAD(&head);
 	STAILQ_REMOVE_HEAD(&head, entries);
 	free(n1);
 }
-					/* Faster TailQ Deletion. */
+					/* $B%F!<%k%-%e!<$N9bB.$J:o=|(B */
 n1 = STAILQ_FIRST(&head);
 while (n1 != NULL) {
 	n2 = STAILQ_NEXT(n1, entries);
@@ -645,7 +645,7 @@
 .Fa elm
 $B$rMWAG(B
 .Fa listelm
-$B$N8e$m$KA^F~$7$^$9!#(B
+$B$NA0$KA^F~$7$^$9!#(B
 .Pp
 $B%^%/%m(B
 .Nm LIST_NEXT
@@ -659,38 +659,38 @@
 .Sh $B%j%9%H$N;HMQNc(B
 .Bd -literal
 LIST_HEAD(listhead, entry) head;
-struct listhead *headp;		/* List head. */
+struct listhead *headp;		/* $B%j%9%H%X%C%I(B */
 struct entry {
 	...
-	LIST_ENTRY(entry) entries;	/* List. */
+	LIST_ENTRY(entry) entries;	/* $B%j%9%H(B */
 	...
 } *n1, *n2, *n3, *np;
 
-LIST_INIT(&head);			/* Initialize the list. */
+LIST_INIT(&head);			/* $B%j%9%H$r=i4|2=(B */
 
-n1 = malloc(sizeof(struct entry));	/* Insert at the head. */
+n1 = malloc(sizeof(struct entry));	/* $B@hF,$KA^F~(B */
 LIST_INSERT_HEAD(&head, n1, entries);
 
-n2 = malloc(sizeof(struct entry));	/* Insert after. */
+n2 = malloc(sizeof(struct entry));	/* $B8e$m$KA^F~(B */
 LIST_INSERT_AFTER(n1, n2, entries);
 
-n3 = malloc(sizeof(struct entry));	/* Insert before. */
+n3 = malloc(sizeof(struct entry));	/* $BA0$KA^F~(B */
 LIST_INSERT_BEFORE(n2, n3, entries);
 
-LIST_REMOVE(n2, entries);		/* Deletion. */
+LIST_REMOVE(n2, entries);		/* $B:o=|(B */
 free(n2);
 
-					/* Forward traversal. */
+					/* $B=gAv::(B */
 LIST_FOREACH(np, &head, entries)
 	np-> ...
 
-while (!LIST_EMPTY(&head)) {          /* List Deletion. */
+while (!LIST_EMPTY(&head)) {          /* $B%j%9%H$N:o=|(B */
 	n1 = LIST_FIRST(&head);
 	LIST_REMOVE(n1, entries);
 	free(n1);
 }
 
-n1 = LIST_FIRST(&head);                       /* Faster List Delete. */
+n1 = LIST_FIRST(&head);                       /* $B%j%9%H$N9bB.$J:o=|(B */
 while (n1 != NULL) {
 	n2 = LIST_NEXT(n1, entries);
 	free(n1);
@@ -814,42 +814,42 @@
 .Sh $B%F!<%k%-%e!<$N;HMQNc(B
 .Bd -literal
 TAILQ_HEAD(tailhead, entry) head;
-struct tailhead *headp;		/* Tail queue head. */
+struct tailhead *headp;		/* $B%F!<%k%-%e!<%X%C%I(B */
 struct entry {
 	...
-	TAILQ_ENTRY(entry) entries;	/* Tail queue. */
+	TAILQ_ENTRY(entry) entries;	/* $B%F!<%k%-%e!<(B */
 	...
 } *n1, *n2, *n3, *np;
 
-TAILQ_INIT(&head);			/* Initialize the queue. */
+TAILQ_INIT(&head);			/* $B%-%e!<$r=i4|2=(B */
 
-n1 = malloc(sizeof(struct entry));	/* Insert at the head. */
+n1 = malloc(sizeof(struct entry));	/* $B@hF,$KA^F~(B */
 TAILQ_INSERT_HEAD(&head, n1, entries);
 
-n1 = malloc(sizeof(struct entry));	/* Insert at the tail. */
+n1 = malloc(sizeof(struct entry));	/* $BKvHx$KA^F~(B */
 TAILQ_INSERT_TAIL(&head, n1, entries);
 
-n2 = malloc(sizeof(struct entry));	/* Insert after. */
+n2 = malloc(sizeof(struct entry));	/* $B8e$m$KA^F~(B */
 TAILQ_INSERT_AFTER(&head, n1, n2, entries);
 
-n3 = malloc(sizeof(struct entry));	/* Insert before. */
+n3 = malloc(sizeof(struct entry));	/* $BA0$KA^F~(B */
 TAILQ_INSERT_BEFORE(n2, n3, entries);
 
-TAILQ_REMOVE(&head, n2, entries);	/* Deletion. */
+TAILQ_REMOVE(&head, n2, entries);	/* $B:o=|(B */
 free(n2);
-					/* Forward traversal. */
+					/* $B=gAv::(B */
 TAILQ_FOREACH(np, &head, entries)
 	np-> ...
-					/* Reverse traversal. */
+					/* $B5UAv::(B */
 TAILQ_FOREACH_REVERSE(np, &head, tailhead, entries)
 	np-> ...
-					/* TailQ Deletion. */
+					/* $B%F!<%k%-%e!<$N:o=|(B */
 while (!TAILQ_EMPTY(head)) {
 	n1 = TAILQ_FIRST(&head);
 	TAILQ_REMOVE(&head, n1, entries);
 	free(n1);
 }
-					/* Faster TailQ Deletion. */
+					/* $B%F!<%k%-%e!<$N9bB.$J:o=|(B */
 
 n1 = TAILQ_FIRST(&head);
 while (n1 != NULL) {
@@ -973,42 +973,42 @@
 .Sh $B=[4D%-%e!<$N;HMQNc(B
 .Bd -literal
 CIRCLEQ_HEAD(circleq, entry) head;
-struct circleq *headp;			/* Circular queue head. */
+struct circleq *headp;			/* $B=[4D%-%e!<%X%C%I(B */
 struct entry {
 	...
-	CIRCLEQ_ENTRY(entry) entries;	/* Circular queue. */
+	CIRCLEQ_ENTRY(entry) entries;	/* $B=[4D%-%e!<(B */
 	...
 } *n1, *n2, *np;
 
-CIRCLEQ_INIT(&head);			/* Initialize the circular queue. */
+CIRCLEQ_INIT(&head);			/* $B=[4D%-%e!<$r=i4|2=(B */
 
-n1 = malloc(sizeof(struct entry));	/* Insert at the head. */
+n1 = malloc(sizeof(struct entry));	/* $B@hF,$KA^F~(B */
 CIRCLEQ_INSERT_HEAD(&head, n1, entries);
 
-n1 = malloc(sizeof(struct entry));	/* Insert at the tail. */
+n1 = malloc(sizeof(struct entry));	/* $BKvHx$KA^F~(B */
 CIRCLEQ_INSERT_TAIL(&head, n1, entries);
 
-n2 = malloc(sizeof(struct entry));	/* Insert after. */
+n2 = malloc(sizeof(struct entry));	/* $B8e$m$KA^F~(B */
 CIRCLEQ_INSERT_AFTER(&head, n1, n2, entries);
 
-n2 = malloc(sizeof(struct entry));	/* Insert before. */
+n2 = malloc(sizeof(struct entry));	/* $BA0$KA^F~(B */
 CIRCLEQ_INSERT_BEFORE(&head, n1, n2, entries);
 
-CIRCLEQ_REMOVE(&head, n1, entries);	/* Deletion. */
+CIRCLEQ_REMOVE(&head, n1, entries);	/* $B:o=|(B */
 free(n1);
-					/* Forward traversal. */
+					/* $B=gAv::(B */
 CIRCLEQ_FOREACH(np, &head, entries)
 	np-> ...
-					/* Reverse traversal. */
+					/* $B5UAv::(B */
 CIRCLEQ_FOREACH_REVERSE(np, &head, entries)
 	np-> ...
-					/* CircleQ Deletion. */
+					/* $B=[4D%-%e!<$N:o=|(B */
 while (CIRCLEQ_FIRST(&head) != (void *)&head) {
 	n1 = CIRCLEQ_HEAD(&head);
 	CIRCLEQ_REMOVE(&head, n1, entries);
 	free(n1);
 }
-					/* Faster CircleQ Deletion. */
+					/* $B=[4D%-%e!<$N9bB.$J:o=|(B */
 n1 = CIRCLEQ_FIRST(&head);
 while (n1 != (void *)&head) {
 	n2 = CIRCLEQ_NEXT(n1, entries);
