diff options
author | Alejandro Colomar <colomar.6.4.3@gmail.com> | 2020-10-23 16:57:31 +0200 |
---|---|---|
committer | Michael Kerrisk <mtk.manpages@gmail.com> | 2020-10-23 18:13:06 +0200 |
commit | 8306d5cb87c17640ae67548339f0602918ba4c1f (patch) | |
tree | 375f0695c1a27b13f9c5584f7db3dd1ca4537ac1 | |
parent | 66bb7b4db432a7199700bed3cf20191f0636a19e (diff) | |
download | man-pages-8306d5cb87c17640ae67548339f0602918ba4c1f.tar.gz |
circleq.3, queue.3: EXAMPLES: Move circleq example program from queue.3 to circleq.3
Signed-off-by: Alejandro Colomar <colomar.6.4.3@gmail.com>
Signed-off-by: Michael Kerrisk <mtk.manpages@gmail.com>
-rw-r--r-- | man3/circleq.3 | 56 | ||||
-rw-r--r-- | man3/queue.3 | 56 |
2 files changed, 56 insertions, 56 deletions
diff --git a/man3/circleq.3 b/man3/circleq.3 index a28a829190..2d683b441b 100644 --- a/man3/circleq.3 +++ b/man3/circleq.3 @@ -210,4 +210,60 @@ from the circular queue. .SH CONFORMING TO .SH BUGS .SH EXAMPLES +.Ss Circular queue example +.Bd -literal +#include <stddef.h> +#include <stdio.h> +#include <stdlib.h> +#include <sys/queue.h> + +struct entry { + int data; + CIRCLEQ_ENTRY(entry) entries; /* Queue. */ +}; + +CIRCLEQ_HEAD(circlehead, entry); + +int +main(void) +{ + struct entry *n1, *n2, *n3, *np; + struct circlehead head; /* Queue head. */ + int i; + + CIRCLEQ_INIT(&head); /* Initialize the 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); + + n3 = malloc(sizeof(struct entry)); /* Insert before. */ + CIRCLEQ_INSERT_BEFORE(&head, n2, n3, entries); + + CIRCLEQ_REMOVE(&head, n2, entries); /* Deletion. */ + free(n2); + /* Forward traversal. */ + i = 0; + CIRCLEQ_FOREACH(np, &head, entries) + np->data = i++; + /* Reverse traversal. */ + CIRCLEQ_FOREACH_REVERSE(np, &head, entries) + printf("%i\en", np->data); + /* Queue deletion. */ + n1 = CIRCLEQ_FIRST(&head); + while (n1 != (void *)&head) { + n2 = CIRCLEQ_NEXT(n1, entries); + free(n1); + n1 = n2; + } + CIRCLEQ_INIT(&head); + + exit(EXIT_SUCCESS); +} +.Ed .SH SEE ALSO diff --git a/man3/queue.3 b/man3/queue.3 index 7947908810..26e304b2f9 100644 --- a/man3/queue.3 +++ b/man3/queue.3 @@ -791,62 +791,6 @@ main(void) exit(EXIT_SUCCESS); } .Ed -.Ss Circular queue example -.Bd -literal -#include <stddef.h> -#include <stdio.h> -#include <stdlib.h> -#include <sys/queue.h> - -struct entry { - int data; - CIRCLEQ_ENTRY(entry) entries; /* Queue. */ -}; - -CIRCLEQ_HEAD(circlehead, entry); - -int -main(void) -{ - struct entry *n1, *n2, *n3, *np; - struct circlehead head; /* Queue head. */ - int i; - - CIRCLEQ_INIT(&head); /* Initialize the 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); - - n3 = malloc(sizeof(struct entry)); /* Insert before. */ - CIRCLEQ_INSERT_BEFORE(&head, n2, n3, entries); - - CIRCLEQ_REMOVE(&head, n2, entries); /* Deletion. */ - free(n2); - /* Forward traversal. */ - i = 0; - CIRCLEQ_FOREACH(np, &head, entries) - np->data = i++; - /* Reverse traversal. */ - CIRCLEQ_FOREACH_REVERSE(np, &head, entries) - printf("%i\en", np->data); - /* Queue deletion. */ - n1 = CIRCLEQ_FIRST(&head); - while (n1 != (void *)&head) { - n2 = CIRCLEQ_NEXT(n1, entries); - free(n1); - n1 = n2; - } - CIRCLEQ_INIT(&head); - - exit(EXIT_SUCCESS); -} -.Ed .Sh CONFORMING TO Not in POSIX.1, POSIX.1-2001 or POSIX.1-2008. Present on the BSDs. |