blob: 320823750878427e32c4b0e22cbc41831ccefde9 (
plain)
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
|
/* libcr_ipc/tests/test_sema.c - Tests for <libcr_ipc/sema.h>
*
* Copyright (C) 2025 Luke T. Shumaker <lukeshu@lukeshu.com>
* SPDX-License-Identifier: AGPL-3.0-or-later
*/
#include <libcr/coroutine.h>
#include <libcr_ipc/sema.h>
#include "test.h"
int counter = 0;
COROUTINE cr_first(void *_sema) {
cr_sema_t *sema = _sema;
cr_begin();
cr_sema_wait(sema);
counter++;
cr_sema_signal(sema);
cr_exit();
}
COROUTINE cr_second(void *_sema) {
cr_sema_t *sema = _sema;
cr_begin();
cr_sema_signal(sema); /* should be claimed by cr_first, which has been waiting */
cr_sema_wait(sema); /* should block, because cr_first claimed it */
test_assert(counter == 1);
cr_exit();
}
COROUTINE cr_producer(void *_sema) {
cr_sema_t *sema = _sema;
cr_begin();
for (int i = 0; i < 10; i++)
cr_sema_signal(sema);
cr_end();
}
COROUTINE cr_consumer(void *_sema) {
cr_sema_t *sema = _sema;
cr_begin();
for (int i = 0; i < 5; i++)
cr_sema_wait(sema);
cr_end();
}
int main() {
cr_sema_t sema = {0};
printf("== test 1 =========================================\n");
coroutine_add("first", cr_first, &sema);
coroutine_add("second", cr_second, &sema);
coroutine_main();
test_assert(sema.cnt == 0);
printf("== test 2 =========================================\n");
coroutine_add("consumer", cr_consumer, &sema);
coroutine_add("producer", cr_producer, &sema);
coroutine_main();
coroutine_add("consumer", cr_consumer, &sema);
coroutine_main();
test_assert(sema.cnt == 0);
return 0;
}
|
