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
93
94
95
96
97
98
99
100
101
102
|
/*
* File : lfq_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 "lfq.h"
#include "lfq_cas.h"
/**
* container_of - cast a member of a structure out to the containing structure
* @ptr: the pointer to the member.
* @type: the type of the container struct this is embedded in.
* @member: the name of the member within the struct.
*
*/
#define container_of(ptr, type, member) ({ \
const typeof( ((type *)0)->member ) *__mptr = (ptr); \
(type *)( (char *)__mptr - offsetof(type,member) );})
struct node {
int data;
pointer_t link;
};
int main(int argc, char *argv[]) {
pointer_t new;
pointer_t old;
pointer_t mem;
int ret;
lfq_t q;
pointer_t *it;
struct node data[10];
int i;
/* check comprae_and_swap */
mem.split.count = 0;
old.split.count = 6;
new.split.count = 666;
mem.split.next = (void*)&argc;
old.split.next = (void*)&argc;
new.split.next = (void*)&argv;
ret = cas(&mem.split, old.split, new.split);
printf("ret %d -> (%d,%X)\n", ret, mem.split.count, (unsigned int)mem.split.next);
mem.split.count=6;
ret = cas(&mem.split, old.split, new.split);
printf("ret %d -> (%d,%X)\n", ret, mem.split.count, (unsigned int)mem.split.next);
/* 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 lfq */
lfq_init( &q);
printf("shift %X\n",(unsigned int)shift( &q ));
for(i=0; i<10; i++) lfq_push( &q, &data[i].link );
it = (pointer_t*)q.head.split.next;
while(it!=NULL) {
printf("data : %d\n",container_of(it,struct node,link)->data);
it = (pointer_t*)it->split.next;
}
for(i=0; i<5; i++) {
it = shift( &q );
printf("shift %X %d\n",(unsigned int)it,container_of(it,struct node,link)->data);
}
it = (pointer_t*)q.head.split.next;
while(it!=NULL) {
printf("data : %d\n",container_of(it,struct node,link)->data);
it = (pointer_t*)it->split.next;
}
return EXIT_SUCCESS;
}
|
