From: Mathieu Desnoyers Date: Fri, 21 Jun 2013 21:17:32 +0000 (-0400) Subject: doc/examples: lfstack X-Git-Tag: v0.8.0~39 X-Git-Url: https://git.lttng.org./?a=commitdiff_plain;h=a5fb5b81c9da019efa71fb930d4a5e01dbc87401;p=userspace-rcu.git doc/examples: lfstack Signed-off-by: Mathieu Desnoyers --- diff --git a/.gitignore b/.gitignore index b16fffd..58c9ba3 100644 --- a/.gitignore +++ b/.gitignore @@ -90,6 +90,10 @@ doc/examples/wfstack/cds_wfs_push doc/examples/wfstack/cds_wfs_pop doc/examples/wfstack/cds_wfs_pop_all_blocking +doc/examples/lfstack/cds_lfs_push +doc/examples/lfstack/cds_lfs_pop_blocking +doc/examples/lfstack/cds_lfs_pop_all_blocking + #automake /config.h .deps/ diff --git a/doc/examples/Makefile.am b/doc/examples/Makefile.am index 5c3e76f..9471957 100644 --- a/doc/examples/Makefile.am +++ b/doc/examples/Makefile.am @@ -48,6 +48,17 @@ dist_doc_examples_wfstack_DATA = \ wfstack/cds_wfs_pop.c \ wfstack/cds_wfs_pop_all_blocking.c +doc_examples_lfstackdir = ${doc_examplesdir}/lfstack + +dist_doc_examples_lfstack_DATA = \ + lfstack/Makefile \ + lfstack/Makefile.cds_lfs_push \ + lfstack/Makefile.cds_lfs_pop_blocking \ + lfstack/Makefile.cds_lfs_pop_all_blocking \ + lfstack/cds_lfs_push.c \ + lfstack/cds_lfs_pop_blocking.c \ + lfstack/cds_lfs_pop_all_blocking.c + if NO_SHARED # Don't build examples if shared libraries support was explicitly # disabled. diff --git a/doc/examples/lfstack/Makefile b/doc/examples/lfstack/Makefile new file mode 100644 index 0000000..e8d1d13 --- /dev/null +++ b/doc/examples/lfstack/Makefile @@ -0,0 +1,23 @@ +# 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 makefile is purposefully kept simple to support GNU and BSD make. + +all: + $(MAKE) -f Makefile.cds_lfs_push + $(MAKE) -f Makefile.cds_lfs_pop_blocking + $(MAKE) -f Makefile.cds_lfs_pop_all_blocking + +.PHONY: clean +clean: + $(MAKE) -f Makefile.cds_lfs_push clean + $(MAKE) -f Makefile.cds_lfs_pop_blocking clean + $(MAKE) -f Makefile.cds_lfs_pop_all_blocking clean diff --git a/doc/examples/lfstack/Makefile.cds_lfs_pop_all_blocking b/doc/examples/lfstack/Makefile.cds_lfs_pop_all_blocking new file mode 100644 index 0000000..9ee48d5 --- /dev/null +++ b/doc/examples/lfstack/Makefile.cds_lfs_pop_all_blocking @@ -0,0 +1,21 @@ +# 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 makefile is purposefully kept simple to support GNU and BSD make. + +EXAMPLE_NAME = cds_lfs_pop_all_blocking + +SOURCES = $(EXAMPLE_NAME).c +OBJECTS = $(EXAMPLE_NAME).o +BINARY = $(EXAMPLE_NAME) +LIBS = -lurcu-cds + +include ../Makefile.examples.template diff --git a/doc/examples/lfstack/Makefile.cds_lfs_pop_blocking b/doc/examples/lfstack/Makefile.cds_lfs_pop_blocking new file mode 100644 index 0000000..da43458 --- /dev/null +++ b/doc/examples/lfstack/Makefile.cds_lfs_pop_blocking @@ -0,0 +1,21 @@ +# 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 makefile is purposefully kept simple to support GNU and BSD make. + +EXAMPLE_NAME = cds_lfs_pop_blocking + +SOURCES = $(EXAMPLE_NAME).c +OBJECTS = $(EXAMPLE_NAME).o +BINARY = $(EXAMPLE_NAME) +LIBS = -lurcu-cds + +include ../Makefile.examples.template diff --git a/doc/examples/lfstack/Makefile.cds_lfs_push b/doc/examples/lfstack/Makefile.cds_lfs_push new file mode 100644 index 0000000..a2078c4 --- /dev/null +++ b/doc/examples/lfstack/Makefile.cds_lfs_push @@ -0,0 +1,21 @@ +# 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 makefile is purposefully kept simple to support GNU and BSD make. + +EXAMPLE_NAME = cds_lfs_push + +SOURCES = $(EXAMPLE_NAME).c +OBJECTS = $(EXAMPLE_NAME).o +BINARY = $(EXAMPLE_NAME) +LIBS = -lurcu-cds + +include ../Makefile.examples.template diff --git a/doc/examples/lfstack/cds_lfs_pop_all_blocking.c b/doc/examples/lfstack/cds_lfs_pop_all_blocking.c new file mode 100644 index 0000000..c2199d3 --- /dev/null +++ b/doc/examples/lfstack/cds_lfs_pop_all_blocking.c @@ -0,0 +1,79 @@ +/* + * 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 all nodes from a lfstack. + */ + +#include +#include + +#include /* Lock-free stack */ +#include /* For CAA_ARRAY_SIZE */ + +/* + * Nodes populated into the stack. + */ +struct mynode { + int value; /* Node content */ + struct cds_lfs_node node; /* Chaining in stack */ +}; + +int main(int argc, char **argv) +{ + int values[] = { -5, 42, 36, 24, }; + struct cds_lfs_stack mystack; /* Stack */ + unsigned int i; + int ret = 0; + struct cds_lfs_node *snode, *sn; + struct cds_lfs_head *shead; + + cds_lfs_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_lfs_node_init(&node->node); + node->value = values[i]; + cds_lfs_push(&mystack, &node->node); + } + + /* + * Pop all nodes from mystack into shead. The head can the be + * used for iteration. + */ + shead = cds_lfs_pop_all_blocking(&mystack); + + /* + * Show the stack content, iterate in reverse order of push, + * from newest to oldest. Use cds_lfs_for_each_safe() so we can + * free the nodes as we iterate. + */ + printf("mystack content:"); + cds_lfs_for_each_safe(shead, snode, sn) { + struct mynode *node = + caa_container_of(snode, struct mynode, node); + printf(" %d", node->value); + free(node); + } + printf("\n"); +end: + return ret; +} diff --git a/doc/examples/lfstack/cds_lfs_pop_blocking.c b/doc/examples/lfstack/cds_lfs_pop_blocking.c new file mode 100644 index 0000000..07b2169 --- /dev/null +++ b/doc/examples/lfstack/cds_lfs_pop_blocking.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 lfstack. + */ + +#include +#include + +#include /* Wait-free stack */ +#include /* For CAA_ARRAY_SIZE */ + +/* + * Nodes populated into the stack. + */ +struct mynode { + int value; /* Node content */ + struct cds_lfs_node node; /* Chaining in stack */ +}; + +int main(int argc, char **argv) +{ + int values[] = { -5, 42, 36, 24, }; + struct cds_lfs_stack mystack; /* Stack */ + unsigned int i; + int ret = 0; + + cds_lfs_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_lfs_node_init(&node->node); + node->value = values[i]; + cds_lfs_push(&mystack, &node->node); + } + + /* + * Pop nodes from the stack, one by one, from newest to oldest. + */ + printf("pop each mystack node:"); + for (;;) { + struct cds_lfs_node *snode; + struct mynode *node; + + snode = cds_lfs_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; +} diff --git a/doc/examples/lfstack/cds_lfs_push.c b/doc/examples/lfstack/cds_lfs_push.c new file mode 100644 index 0000000..e70ce15 --- /dev/null +++ b/doc/examples/lfstack/cds_lfs_push.c @@ -0,0 +1,72 @@ +/* + * 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 push nodes into a lfstack. + */ + +#include +#include + +#include /* Lock-free stack */ +#include /* For CAA_ARRAY_SIZE */ + +/* + * Nodes populated into the stack. + */ +struct mynode { + int value; /* Node content */ + struct cds_lfs_node node; /* Chaining in stack */ +}; + +int main(int argc, char **argv) +{ + int values[] = { -5, 42, 36, 24, }; + struct cds_lfs_stack mystack; /* Stack */ + unsigned int i; + int ret = 0; + struct cds_lfs_node *snode; + struct cds_lfs_head *shead; + + cds_lfs_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_lfs_node_init(&node->node); + node->value = values[i]; + cds_lfs_push(&mystack, &node->node); + } + + /* + * Show the stack content, iterate in reverse order of push, + * from newest to oldest. + */ + printf("mystack content:"); + shead = cds_lfs_pop_all_blocking(&mystack); + cds_lfs_for_each(shead, snode) { + struct mynode *node = + caa_container_of(snode, struct mynode, node); + printf(" %d", node->value); + } + printf("\n"); +end: + return ret; +}