X-Git-Url: https://git.liburcu.org/?a=blobdiff_plain;f=doc%2Fexamples%2Flfstack%2Fcds_lfs_push.c;fp=doc%2Fexamples%2Flfstack%2Fcds_lfs_push.c;h=e70ce150808704df051b75097a8f61edd370c089;hb=a5fb5b81c9da019efa71fb930d4a5e01dbc87401;hp=0000000000000000000000000000000000000000;hpb=bb641aa3882c0a345c98a75d4784b3b7ee6211ab;p=urcu.git

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 <mathieu.desnoyers@efficios.com>
+ *
+ * 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 <stdio.h>
+#include <stdlib.h>
+
+#include <urcu/lfstack.h>	/* Lock-free stack */
+#include <urcu/compiler.h>	/* 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;
+}