Changeset 609 for branches/GNU/src/binutils/libiberty/insque.c

Timestamp:

Aug 16, 2003, 6:59:22 PM (22 years ago)

Author:

bird

Message:

binutils v2.14 - offical sources.

File:

• branches/GNU/src/binutils/libiberty/insque.c (modified) (1 diff, 1 prop)

branches/GNU/src/binutils/libiberty/insque.c

@@ -3 +3 @@
 
 /*
-NAME
-        insque, remque -- insert, remove an element from a queue
 
-SYNOPSIS
-        struct qelem {
-          struct qelem *q_forw;
-          struct qelem *q_back;
-          char q_data[];
-        };
+@deftypefn Supplemental void insque (struct qelem *@var{elem}, struct qelem *@var{pred})
+@deftypefnx Supplemental void remque (struct qelem *@var{elem})
 
-        void insque (struct qelem *elem, struct qelem *pred)
+Routines to manipulate queues built from doubly linked lists.  The
+@code{insque} routine inserts @var{elem} in the queue immediately
+after @var{pred}.  The @code{remque} routine removes @var{elem} from
+its containing queue.  These routines expect to be passed pointers to
+structures which have as their first members a forward pointer and a
+back pointer, like this prototype (although no prototype is provided):
 
-        void remque (struct qelem *elem)
+@example
+struct qelem @{
+  struct qelem *q_forw;
+  struct qelem *q_back;
+  char q_data[];
+@};
+@end example
 
-DESCRIPTION
-        Routines to manipulate queues built from doubly linked lists.
-        The insque routine inserts ELEM in the queue immediately after
-        PRED.  The remque routine removes ELEM from its containing queue.
+@end deftypefn
+
 */