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
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
|
/*
* Copyright © 2013 Marek Chalupa
*
* 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 (including the
* next paragraph) 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 <assert.h>
#include "test-runner.h"
#include "wayland-private.h"
static void
signal_notify(struct wl_listener *listener, void *data)
{
/* only increase counter*/
++(*((int *) data));
}
TEST(signal_init)
{
struct wl_priv_signal signal;
wl_priv_signal_init(&signal);
/* Test if listeners' list is initialized */
assert(&signal.listener_list == signal.listener_list.next
&& "Maybe wl_priv_signal implementation changed?");
assert(signal.listener_list.next == signal.listener_list.prev
&& "Maybe wl_priv_signal implementation changed?");
}
TEST(signal_add_get)
{
struct wl_priv_signal signal;
/* we just need different values of notify */
struct wl_listener l1 = {.notify = (wl_notify_func_t) 0x1};
struct wl_listener l2 = {.notify = (wl_notify_func_t) 0x2};
struct wl_listener l3 = {.notify = (wl_notify_func_t) 0x3};
/* one real, why not */
struct wl_listener l4 = {.notify = signal_notify};
wl_priv_signal_init(&signal);
wl_priv_signal_add(&signal, &l1);
wl_priv_signal_add(&signal, &l2);
wl_priv_signal_add(&signal, &l3);
wl_priv_signal_add(&signal, &l4);
assert(wl_priv_signal_get(&signal, signal_notify) == &l4);
assert(wl_priv_signal_get(&signal, (wl_notify_func_t) 0x3) == &l3);
assert(wl_priv_signal_get(&signal, (wl_notify_func_t) 0x2) == &l2);
assert(wl_priv_signal_get(&signal, (wl_notify_func_t) 0x1) == &l1);
/* get should not be destructive */
assert(wl_priv_signal_get(&signal, signal_notify) == &l4);
assert(wl_priv_signal_get(&signal, (wl_notify_func_t) 0x3) == &l3);
assert(wl_priv_signal_get(&signal, (wl_notify_func_t) 0x2) == &l2);
assert(wl_priv_signal_get(&signal, (wl_notify_func_t) 0x1) == &l1);
}
TEST(signal_emit_to_one_listener)
{
int count = 0;
int counter;
struct wl_priv_signal signal;
struct wl_listener l1 = {.notify = signal_notify};
wl_priv_signal_init(&signal);
wl_priv_signal_add(&signal, &l1);
for (counter = 0; counter < 100; counter++)
wl_priv_signal_emit(&signal, &count);
assert(counter == count);
}
TEST(signal_emit_to_more_listeners)
{
int count = 0;
int counter;
struct wl_priv_signal signal;
struct wl_listener l1 = {.notify = signal_notify};
struct wl_listener l2 = {.notify = signal_notify};
struct wl_listener l3 = {.notify = signal_notify};
wl_priv_signal_init(&signal);
wl_priv_signal_add(&signal, &l1);
wl_priv_signal_add(&signal, &l2);
wl_priv_signal_add(&signal, &l3);
for (counter = 0; counter < 100; counter++)
wl_priv_signal_emit(&signal, &count);
assert(3 * counter == count);
}
struct signal
{
struct wl_priv_signal signal;
struct wl_listener l1, l2, l3;
int count;
struct wl_listener *current;
};
static void notify_remove(struct wl_listener *l, void *data)
{
struct signal *sig = data;
wl_list_remove(&sig->current->link);
wl_list_init(&sig->current->link);
sig->count++;
}
#define INIT \
wl_priv_signal_init(&signal.signal); \
wl_list_init(&signal.l1.link); \
wl_list_init(&signal.l2.link); \
wl_list_init(&signal.l3.link);
#define CHECK_EMIT(expected) \
signal.count = 0; \
wl_priv_signal_emit(&signal.signal, &signal); \
assert(signal.count == expected);
TEST(signal_remove_listener)
{
test_set_timeout(4);
struct signal signal;
signal.l1.notify = notify_remove;
signal.l2.notify = notify_remove;
signal.l3.notify = notify_remove;
INIT
wl_priv_signal_add(&signal.signal, &signal.l1);
signal.current = &signal.l1;
CHECK_EMIT(1)
CHECK_EMIT(0)
INIT
wl_priv_signal_add(&signal.signal, &signal.l1);
wl_priv_signal_add(&signal.signal, &signal.l2);
CHECK_EMIT(2)
CHECK_EMIT(1)
INIT
wl_priv_signal_add(&signal.signal, &signal.l1);
wl_priv_signal_add(&signal.signal, &signal.l2);
signal.current = &signal.l2;
CHECK_EMIT(1)
CHECK_EMIT(1)
INIT
wl_priv_signal_add(&signal.signal, &signal.l1);
wl_priv_signal_add(&signal.signal, &signal.l2);
wl_priv_signal_add(&signal.signal, &signal.l3);
signal.current = &signal.l1;
CHECK_EMIT(3)
CHECK_EMIT(2)
INIT
wl_priv_signal_add(&signal.signal, &signal.l1);
wl_priv_signal_add(&signal.signal, &signal.l2);
wl_priv_signal_add(&signal.signal, &signal.l3);
signal.current = &signal.l2;
CHECK_EMIT(2)
CHECK_EMIT(2)
INIT
wl_priv_signal_add(&signal.signal, &signal.l1);
wl_priv_signal_add(&signal.signal, &signal.l2);
wl_priv_signal_add(&signal.signal, &signal.l3);
signal.current = &signal.l3;
CHECK_EMIT(2)
CHECK_EMIT(2)
}
static void notify_readd(struct wl_listener *l, void *data)
{
struct signal *signal = data;
if (signal->current) {
wl_list_remove(&signal->current->link);
wl_list_init(&signal->current->link);
wl_priv_signal_add(&signal->signal, signal->current);
}
signal->count++;
}
static void notify_empty(struct wl_listener *l, void *data)
{
struct signal *signal = data;
signal->count++;
}
TEST(signal_readd_listener)
{
/* Readding a listener is supported, that is it doesn't trigger an
* infinite loop or other weird things, but if in a listener you
* readd another listener, that will not be fired in the current
* signal emission. */
test_set_timeout(4);
struct signal signal;
signal.l1.notify = notify_readd;
signal.l2.notify = notify_readd;
INIT
wl_priv_signal_add(&signal.signal, &signal.l1);
signal.current = &signal.l1;
CHECK_EMIT(1)
CHECK_EMIT(1)
INIT
wl_priv_signal_add(&signal.signal, &signal.l1);
signal.current = &signal.l2;
CHECK_EMIT(1)
signal.current = NULL;
CHECK_EMIT(2)
INIT
wl_priv_signal_add(&signal.signal, &signal.l2);
signal.current = &signal.l1;
CHECK_EMIT(1)
/* l2 was added before l1, so l2 is fired first, which by readding l1
* removes it from the current list that is being fired, so 1 is correct */
CHECK_EMIT(1)
INIT
wl_priv_signal_add(&signal.signal, &signal.l1);
wl_priv_signal_add(&signal.signal, &signal.l2);
signal.l1.notify = notify_empty;
signal.current = &signal.l2;
CHECK_EMIT(2)
CHECK_EMIT(2)
INIT
wl_priv_signal_add(&signal.signal, &signal.l1);
wl_priv_signal_add(&signal.signal, &signal.l2);
signal.l1.notify = notify_empty;
signal.current = &signal.l1;
CHECK_EMIT(2)
/* same as before, by readding l1 in the first emit, it now is fired
* after l2, so on the second emit it is not fired at all. */
CHECK_EMIT(1)
}
static void notify_addandget(struct wl_listener *l, void *data)
{
struct signal *signal = data;
wl_list_remove(&signal->current->link);
wl_list_init(&signal->current->link);
wl_priv_signal_add(&signal->signal, signal->current);
assert(wl_priv_signal_get(&signal->signal, signal->current->notify) != NULL);
signal->count++;
}
static void notify_get(struct wl_listener *l, void *data)
{
struct signal *signal = data;
assert(wl_priv_signal_get(&signal->signal, signal->current->notify) == signal->current);
signal->count++;
}
TEST(signal_get_listener)
{
test_set_timeout(4);
struct signal signal;
signal.l1.notify = notify_addandget;
signal.l2.notify = notify_get;
INIT
wl_priv_signal_add(&signal.signal, &signal.l1);
signal.current = &signal.l2;
CHECK_EMIT(1)
INIT
wl_priv_signal_add(&signal.signal, &signal.l2);
signal.current = &signal.l2;
CHECK_EMIT(1)
INIT
signal.l1.notify = notify_get;
signal.l2.notify = notify_empty;
wl_priv_signal_add(&signal.signal, &signal.l1);
wl_priv_signal_add(&signal.signal, &signal.l2);
CHECK_EMIT(2)
INIT
signal.l1.notify = notify_empty;
signal.l2.notify = notify_get;
wl_priv_signal_add(&signal.signal, &signal.l1);
wl_priv_signal_add(&signal.signal, &signal.l2);
signal.current = &signal.l1;
CHECK_EMIT(2)
}
|
