1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
|
/*
* 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 pop nodes from a lfstack.
*/
#include <stdio.h>
#include <stdlib.h>
#include <urcu/lfstack.h> /* Wait-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;
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;
}
|
