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
103
104
105
106
107
108
109
|
/*
* Copyright (C) 1999-2001, Ian Main <imain@stemwinder.org>.
* All rights reserved.
*
* 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 <roy.h>
#define USE_CHUNKS 1
#ifdef USE_CHUNKS
#define ALLOC(size) rchunk_alloc (size)
#define FREE(ptr, size) rchunk_free (ptr, size)
#else
#define ALLOC(size) rmem_alloc (size)
#define FREE(ptr, size) rmem_free (ptr)
#endif
typedef struct {
RLIST_HEADER;
int id;
int id2;
} MyInfo;
int main (void)
{
MyInfo *info, *newinfo;
RList *list;
int i, a;
rinit ();
list = rlist_new ();
for (a = 0; a < 1; a++) {
for (i = 0; i < 10; i++) {
info = ALLOC (sizeof (MyInfo));
info->id = i;
info->id2 = i * i;
rlist_append (list, info);
}
RLIST_FOREACH (list, info) {
printf ("item: %d, %d\n", info->id, info->id2);
} RFOREACH_CLOSE;
RLIST_FOREACH (list, info) {
newinfo = ALLOC (sizeof (MyInfo));
newinfo->id = -1;
newinfo->id2 = -1;
rlist_insert_before (list, newinfo, info);
} RFOREACH_CLOSE;
RLIST_FOREACH (list, info) {
printf ("item: %d, %d\n", info->id, info->id2);
} RFOREACH_CLOSE;
RLIST_FOREACH_REVERSE (list, info) {
newinfo = ALLOC (sizeof (MyInfo));
newinfo->id = 99;
newinfo->id2 = 99;
rlist_insert_after (list, newinfo, info);
} RFOREACH_CLOSE;
RLIST_FOREACH (list, info) {
printf ("item: %d, %d\n", info->id, info->id2);
} RFOREACH_CLOSE;
RLIST_FOREACH (list, info) {
printf ("freeing list item id:%d id2:%d\n", info->id, info->id2);
info->id++;
info->id2++;
rlist_remove (list, info);
FREE (info, sizeof (MyInfo));
} RFOREACH_CLOSE;
}
rlist_free (list);
rcleanup ();
return (0);
}
|
