X-Git-Url: https://git.liburcu.org/?p=urcu.git;a=blobdiff_plain;f=doc%2Fexamples%2Fwfstack%2Fcds_wfs_pop.c;fp=doc%2Fexamples%2Fwfstack%2Fcds_wfs_pop.c;h=4cdec0a3b36b15078a6993805347e60071c86c56;hp=0000000000000000000000000000000000000000;hb=95bba308b25b1d642d1ef96210bfb70384ab6de6;hpb=0bee40698530d2d16a488e7a4b2865d875c6c6b7 diff --git a/doc/examples/wfstack/cds_wfs_pop.c b/doc/examples/wfstack/cds_wfs_pop.c new file mode 100644 index 0000000..4cdec0a --- /dev/null +++ b/doc/examples/wfstack/cds_wfs_pop.c @@ -0,0 +1,75 @@ +/* + * Copyright (C) 2013 Mathieu Desnoyers + * + * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY EXPRESSED + * OR IMPLIED. ANY USE IS AT YOUR OWN RISK. + * + * Permission is hereby granted to use or copy this program for any + * purpose, provided the above notices are retained on all copies. + * Permission to modify the code and to distribute modified code is + * granted, provided the above notices are retained, and a notice that + * the code was modified is included with the above copyright notice. + * + * This example shows how to pop nodes from a wfstack. + */ + +#include +#include + +#include /* Wait-free stack */ +#include /* For CAA_ARRAY_SIZE */ + +/* + * Nodes populated into the stack. + */ +struct mynode { + int value; /* Node content */ + struct cds_wfs_node node; /* Chaining in stack */ +}; + +int main(int argc, char **argv) +{ + int values[] = { -5, 42, 36, 24, }; + struct cds_wfs_stack mystack; /* Stack */ + unsigned int i; + int ret = 0; + + cds_wfs_init(&mystack); + + /* + * Push nodes. + */ + for (i = 0; i < CAA_ARRAY_SIZE(values); i++) { + struct mynode *node; + + node = malloc(sizeof(*node)); + if (!node) { + ret = -1; + goto end; + } + + cds_wfs_node_init(&node->node); + node->value = values[i]; + cds_wfs_push(&mystack, &node->node); + } + + /* + * Pop nodes from the stack, one by one, from newest to oldest. + */ + printf("pop each mystack node:"); + for (;;) { + struct cds_wfs_node *snode; + struct mynode *node; + + snode = cds_wfs_pop_blocking(&mystack); + if (!snode) { + break; + } + node = caa_container_of(snode, struct mynode, node); + printf(" %d", node->value); + free(node); + } + printf("\n"); +end: + return ret; +}