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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
|
/*
* File : lf_fifo_test.c
* Author : Jérémy Zurcher <jeremy@asynk.ch>
* Date : 01/11/09
* License :
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*/
#include "stdio.h"
#include "stdlib.h"
#include "stddef.h"
#include "lf_fifo.h"
#define container_of(ptr, type, member) ( { (type*)(((char*)ptr)-offsetof(type,member)); } )
struct node {
int data;
lf_pointer_t link;
};
int main(int argc, char *argv[]) {
lf_pointer_t new;
lf_pointer_t old;
lf_pointer_t mem;
int ret;
lf_fifo_t q;
lf_pointer_t *it;
struct node data[10];
int i;
/* check comprae_and_swap */
mem.count = 0;
old.count = 6;
new.count = 666;
mem.ptr = (void*)&argc;
old.ptr = (void*)&argc;
new.ptr = (void*)&argv;
ret = cas(&mem, old, new);
printf("ret %d -> (%d,%X)\n", ret, mem.count, (unsigned int)mem.ptr);
mem.count=6;
ret = cas(&mem, old, new);
printf("ret %d -> (%d,%X)\n", ret, mem.count, (unsigned int)mem.ptr);
/* init data */
for(i=0; i<10; i++) data[i].data=i;
for(i=0; i<10; i++) printf("data[%d] :%d\n",i,data[i].data);
/* check lf_fifo */
lf_fifo_init( &q);
printf("pop %X\n",(unsigned int)pop( &q ));
for(i=0; i<10; i++) lf_fifo_push( &q, &data[i].link );
it = (lf_pointer_t*)q.head.ptr;
while(it!=NULL) {
printf("data : %d\n",container_of(it,struct node,link)->data);
it = (lf_pointer_t*)it->ptr;
}
for(i=0; i<5; i++) {
it = pop( &q );
printf("pop %X %d\n",(unsigned int)it,container_of(it,struct node,link)->data);
}
it = (lf_pointer_t*)q.head.ptr;
while(it!=NULL) {
printf("data : %d\n",container_of(it,struct node,link)->data);
it = (lf_pointer_t*)it->ptr;
}
return EXIT_SUCCESS;
}
|
