Repository navigation
Expand file tree
/
Copy pathtest-list.c
More file actions
250 lines (232 loc) · 4.48 KB
/
Copy pathtest-list.c
File metadata and controls
250 lines (232 loc) · 4.48 KB
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
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
#include <stdio.h>
struct list_head {
struct list_head *next;
struct list_head *prev;
};
extern struct list_head normal_head;
struct list_head short_list[] = {
{
.next = &short_list[1],
.prev = &normal_head,
},
{
.next = &short_list[2],
.prev = &short_list[0],
},
{
.next = &short_list[3],
.prev = &short_list[1],
},
{
.next = &short_list[4],
.prev = &short_list[2],
},
{
.next = &normal_head,
.prev = &short_list[3],
},
};
struct list_head normal_head = {
.next = &short_list[0],
.prev = &short_list[4],
};
extern struct list_head cycle_head;
struct list_head short_list_with_cycle[] = {
{
.next = &short_list_with_cycle[1],
.prev = &cycle_head,
},
{
.next = &short_list_with_cycle[2],
.prev = &short_list_with_cycle[0],
},
{
.next = &short_list_with_cycle[3],
.prev = &short_list_with_cycle[1],
},
{
.next = &short_list_with_cycle[1],
.prev = &short_list_with_cycle[2],
},
{
.next = &cycle_head,
.prev = &short_list_with_cycle[3],
},
};
struct list_head cycle_head = {
.next = &short_list_with_cycle[0],
.prev = &short_list_with_cycle[4],
};
extern struct list_head bad_list_head;
struct list_head short_list_with_bad_prev[] = {
{
.next = &short_list_with_bad_prev[1],
.prev = &bad_list_head,
},
{
.next = &short_list_with_bad_prev[2],
.prev = &short_list_with_bad_prev[0],
},
{
.next = &short_list_with_bad_prev[3],
.prev = &short_list_with_bad_prev[0],
},
{
.next = &short_list_with_bad_prev[1],
.prev = &short_list_with_bad_prev[2],
},
{
.next = &bad_list_head,
.prev = &short_list_with_bad_prev[3],
},
};
struct list_head bad_list_head = {
.next = &short_list[0],
.prev = &short_list[4],
};
struct container {
unsigned long someval;
struct list_head list;
};
extern struct list_head good_container_list;
struct container good_containers[] = {
{
.someval = 0xdead0000,
.list = {
.next = &good_containers[1].list,
.prev = &good_container_list,
},
},
{
.someval = 0xdead0001,
.list = {
.next = &good_containers[2].list,
.prev = &good_containers[0].list,
},
},
{
.someval = 0xdead0002,
.list = {
.next = &good_containers[3].list,
.prev = &good_containers[1].list,
},
},
{
.someval = 0xdead0003,
.list = {
.next = &good_containers[4].list,
.prev = &good_containers[2].list,
},
},
{
.someval = 0xdead0004,
.list = {
.next = &good_container_list,
.prev = &good_containers[3].list,
},
},
};
struct list_head good_container_list = {
.next = &good_containers[0].list,
.prev = &good_containers[4].list,
};
extern struct list_head cycle_container_list;
struct container cycle_containers[] = {
{
.someval = 0xdead0000,
.list = {
.next = &cycle_containers[1].list,
.prev = &cycle_container_list,
},
},
{
.someval = 0xdead0001,
.list = {
.next = &cycle_containers[2].list,
.prev = &cycle_containers[0].list,
},
},
{
.someval = 0xdead0002,
.list = {
.next = &cycle_containers[3].list,
.prev = &cycle_containers[1].list,
},
},
{
.someval = 0xdead0003,
.list = {
.next = &cycle_containers[1].list,
.prev = &cycle_containers[2].list,
},
},
{
.someval = 0xdead0004,
.list = {
.next = &cycle_container_list,
.prev = &cycle_containers[3].list,
},
},
};
struct list_head cycle_container_list = {
.next = &cycle_containers[0].list,
.prev = &cycle_containers[4].list,
};
extern struct list_head bad_container_list;
struct container bad_containers[] = {
{
.someval = 0xdead0000,
.list = {
.next = &bad_containers[1].list,
.prev = &bad_container_list,
},
},
{
.someval = 0xdead0001,
.list = {
.next = &bad_containers[2].list,
.prev = &bad_containers[0].list,
},
},
{
.someval = 0xdead0002,
.list = {
.next = &bad_containers[3].list,
.prev = &bad_containers[1].list,
},
},
{
.someval = 0xdead0003,
.list = {
.next = &bad_containers[4].list,
.prev = &bad_containers[1].list,
},
},
{
.someval = 0xdead0004,
.list = {
.next = &bad_container_list,
.prev = &bad_containers[3].list,
},
},
};
struct list_head bad_container_list = {
.next = &bad_containers[0].list,
.prev = &bad_containers[4].list,
};
struct list_head bad_next_ptr_list = {
.next = (struct list_head *)0xdeadbeef,
.prev = &bad_next_ptr_list,
};
struct list_head bad_prev_ptr_list = {
.next = &bad_prev_ptr_list,
.prev = (struct list_head *)0xdeadbeef,
};
int
main(void)
{
struct list_head lh = { NULL, NULL };
printf("normal_head = %p\n", &normal_head);
printf("short_list = %p\n", &short_list);
return 0;
}