[src/trunk]: src/share/man/man3 Fix layout for comments. Bump date.

[ryoon <ryoon%NetBSD.org@localhost>]

details:   https://anonhg.NetBSD.org/src/rev/bbf18fb202d0
branches:  trunk
changeset: 343405:bbf18fb202d0
user:      ryoon <ryoon%NetBSD.org@localhost>
date:      Tue Feb 02 12:25:24 2016 +0000

description:
Fix layout for comments. Bump date.

diffstat:

 share/man/man3/queue.3 |  36 ++++++++++++++++++------------------
 1 files changed, 18 insertions(+), 18 deletions(-)

diffs (98 lines):

diff -r 2f04251b94e3 -r bbf18fb202d0 share/man/man3/queue.3
--- a/share/man/man3/queue.3    Tue Feb 02 12:22:23 2016 +0000
+++ b/share/man/man3/queue.3    Tue Feb 02 12:25:24 2016 +0000
@@ -1,4 +1,4 @@
-.\"    $NetBSD: queue.3,v 1.50 2014/12/03 20:36:33 snj Exp $
+.\"    $NetBSD: queue.3,v 1.51 2016/02/02 12:25:24 ryoon Exp $
 .\"
 .\" Copyright (c) 2000, 2002 The NetBSD Foundation, Inc.
 .\" All rights reserved.
@@ -53,7 +53,7 @@
 .\"
 .\"    @(#)queue.3     8.1 (Berkeley) 12/13/93
 .\"
-.Dd May 17, 2014
+.Dd February 2, 2016
 .Dt QUEUE 3
 .Os
 .Sh NAME
@@ -537,8 +537,8 @@
 n3 = SLIST_FIRST(\*[Am]head);
 SLIST_REMOVE_HEAD(\*[Am]head, entries);      /* Deletion from the head. */
 free(n3);
-                                        /* Forward traversal. */
-SLIST_FOREACH(np, \*[Am]head, entries)
+
+SLIST_FOREACH(np, \*[Am]head, entries)       /* Forward traversal. */
         np-\*[Gt] ...
 
 while (!SLIST_EMPTY(\*[Am]head)) {           /* List Deletion. */
@@ -672,7 +672,7 @@
 .Sh LIST EXAMPLE
 .Bd -literal
 LIST_HEAD(listhead, entry) head;
-struct listhead *headp;                /* List head. */
+struct listhead *headp;                        /* List head. */
 struct entry {
        ...
        LIST_ENTRY(entry) entries;      /* List. */
@@ -689,11 +689,11 @@
 
 n2 = malloc(sizeof(struct entry));     /* Insert before. */
 LIST_INSERT_BEFORE(n1, n2, entries);
-                                       /* Forward traversal. */
-LIST_FOREACH(np, \*[Am]head, entries)
+
+LIST_FOREACH(np, \*[Am]head, entries)  /* Forward traversal. */
        np-\*[Gt] ...
-                                       /* Delete. */
-while (LIST_FIRST(\*[Am]head) != NULL)
+
+while (LIST_FIRST(\*[Am]head) != NULL) /* Delete. */
        LIST_REMOVE(LIST_FIRST(\*[Am]head), entries);
 if (LIST_EMPTY(\*[Am]head))                    /* Test for emptiness. */
        printf("nothing to do\\n");
@@ -857,11 +857,11 @@
 
 n2 = malloc(sizeof(struct entry));     /* Insert after. */
 SIMPLEQ_INSERT_AFTER(\*[Am]head, n1, n2, entries);
-                                       /* Forward traversal. */
-SIMPLEQ_FOREACH(np, \*[Am]head, entries)
+
+SIMPLEQ_FOREACH(np, \*[Am]head, entries)       /* Forward traversal. */
        np-\*[Gt] ...
-                                       /* Delete. */
-while (SIMPLEQ_FIRST(\*[Am]head) != NULL)
+
+while (SIMPLEQ_FIRST(\*[Am]head) != NULL)      /* Delete. */
        SIMPLEQ_REMOVE_HEAD(\*[Am]head, entries);
 if (SIMPLEQ_EMPTY(\*[Am]head))         /* Test for emptiness. */
        printf("nothing to do\\n");
@@ -1015,7 +1015,7 @@
 .Sh TAIL QUEUE EXAMPLE
 .Bd -literal
 TAILQ_HEAD(tailhead, entry) head;
-struct tailhead *headp;                /* Tail queue head. */
+struct tailhead *headp;                        /* Tail queue head. */
 struct entry {
        ...
        TAILQ_ENTRY(entry) entries;     /* Tail queue. */
@@ -1035,14 +1035,14 @@
 
 n2 = malloc(sizeof(struct entry));     /* Insert before. */
 TAILQ_INSERT_BEFORE(n1, n2, entries);
-                                       /* Forward traversal. */
-TAILQ_FOREACH(np, \*[Am]head, entries)
+
+TAILQ_FOREACH(np, \*[Am]head, entries) /* Forward traversal. */
        np-\*[Gt] ...
                                        /* Reverse traversal. */
 TAILQ_FOREACH_REVERSE(np, \*[Am]head, tailhead, entries)
        np-\*[Gt] ...
-                                       /* Delete. */
-while (TAILQ_FIRST(\*[Am]head) != NULL)
+                                       
+while (TAILQ_FIRST(\*[Am]head) != NULL)        /* Delete. */
        TAILQ_REMOVE(\*[Am]head, TAILQ_FIRST(\*[Am]head), entries);
 if (TAILQ_EMPTY(\*[Am]head))                   /* Test for emptiness. */
        printf("nothing to do\\n");