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
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
|
/*
(c) Copyright 2001-2009 The world wide DirectFB Open Source Community (directfb.org)
(c) Copyright 2000-2004 Convergence (integrated media) GmbH
All rights reserved.
Written by Denis Oliver Kropp <dok@directfb.org>,
Andreas Hundt <andi@fischlustig.de>,
Sven Neumann <neo@directfb.org>,
Ville Syrjälä <syrjala@sci.fi> and
Claudio Ciccani <klan@users.sf.net>.
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the
Free Software Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA.
*/
#ifndef __DIRECT__LIST_H__
#define __DIRECT__LIST_H__
#include <direct/types.h>
#include <direct/debug.h>
struct __D_DirectLink {
int magic;
DirectLink *next;
DirectLink *prev; /* The 'prev' pointer of the first element always points
to the last element of the list, for fast appending ;-) */
};
static __inline__ void
direct_list_prepend( DirectLink **list, DirectLink *link )
{
DirectLink *first = *list;
link->next = first;
if (first) {
D_MAGIC_ASSERT( first, DirectLink );
link->prev = first->prev;
first->prev = link;
}
else
link->prev = link;
*list = link;
D_MAGIC_SET( link, DirectLink );
}
static __inline__ void
direct_list_append( DirectLink **list, DirectLink *link )
{
DirectLink *first = *list;
link->next = NULL;
if (first) {
DirectLink *last = first->prev;
D_MAGIC_ASSERT( first, DirectLink );
D_MAGIC_ASSERT( last, DirectLink );
link->prev = last;
last->next = first->prev = link;
}
else
*list = link->prev = link;
D_MAGIC_SET( link, DirectLink );
}
static __inline__ bool
direct_list_contains_element_EXPENSIVE( DirectLink *list, DirectLink *link )
{
D_MAGIC_ASSERT_IF( list, DirectLink );
while (list) {
if (list == link)
return true;
list = list->next;
}
return false;
}
static __inline__ int
direct_list_count_elements_EXPENSIVE( DirectLink *list )
{
int count = 0;
while (list) {
D_MAGIC_ASSERT( list, DirectLink );
count++;
list = list->next;
}
return count;
}
static __inline__ void
direct_list_remove( DirectLink **list, DirectLink *link )
{
DirectLink *next;
DirectLink *prev;
D_ASSERT( list != NULL );
D_ASSERT( direct_list_contains_element_EXPENSIVE( *list, link ) );
D_MAGIC_ASSERT( *list, DirectLink );
D_MAGIC_ASSERT( link, DirectLink );
next = link->next;
prev = link->prev;
if (next) {
D_MAGIC_ASSERT( next, DirectLink );
next->prev = prev;
}
else
(*list)->prev = prev;
if (link == *list)
*list = next;
else {
D_MAGIC_ASSERT( prev, DirectLink );
prev->next = next;
}
link->next = link->prev = NULL;
D_MAGIC_CLEAR( link );
}
static __inline__ void
direct_list_move_to_front( DirectLink **list, DirectLink *link )
{
DirectLink *next;
DirectLink *prev;
DirectLink *first;
D_ASSERT( list != NULL );
first = *list;
D_ASSERT( direct_list_contains_element_EXPENSIVE( first, link ) );
D_MAGIC_ASSERT( first, DirectLink );
D_MAGIC_ASSERT( link, DirectLink );
if (first == link)
return;
next = link->next;
prev = link->prev;
D_MAGIC_ASSERT_IF( next, DirectLink );
D_MAGIC_ASSERT( prev, DirectLink );
if (next) {
next->prev = prev;
link->prev = first->prev;
}
else
link->prev = prev;
prev->next = next;
link->next = first;
first->prev = link;
*list = link;
}
static __inline__ bool
direct_list_check_link( const DirectLink *link )
{
D_MAGIC_ASSERT_IF( link, DirectLink );
return link != NULL;
}
#define direct_list_foreach(elem, list) \
for (elem = (__typeof__(elem))(list); \
direct_list_check_link( (DirectLink*)(elem) ); \
elem = (__typeof__(elem))(((DirectLink*)(elem))->next))
#define direct_list_foreach_reverse(elem, list) \
for (elem = (__typeof__(elem))((list) ? (list)->prev : NULL); \
direct_list_check_link( (DirectLink*)(elem) ); \
elem = (__typeof__(elem))((((DirectLink*)(elem))->prev->next) ? ((DirectLink*)(elem))->prev : NULL))
#define direct_list_foreach_safe(elem, temp, list) \
for (elem = (__typeof__(elem))(list), temp = ((__typeof__(temp))(elem) ? (__typeof__(temp))(((DirectLink*)(elem))->next) : NULL); \
direct_list_check_link( (DirectLink*)(elem) ); \
elem = (__typeof__(elem))(temp), temp = ((__typeof__(temp))(elem) ? (__typeof__(temp))(((DirectLink*)(elem))->next) : NULL))
#endif
|
