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
|
// https://mariusbancila.ro/blog/2020/06/22/a-cpp20-coroutine-example/
#include <time.h>
#include <stdio.h>
#define i_static
#include <stc/cstr.h>
#include <stc/coroutine.h>
cco_task_struct (next_value,
int val;
cco_timer tm;
);
int next_value(struct next_value* co, cco_runtime* rt)
{
cco_routine (co) {
while (true) {
cco_await_timer(&co->tm, 1 + rand() % 2);
co->val = rand();
cco_yield();
}
}
return 0;
}
void print_time()
{
time_t now = time(NULL);
char mbstr[64];
strftime(mbstr, sizeof(mbstr), "[%H:%M:%S]", localtime(&now));
printf("%s ", mbstr);
}
// PRODUCER
cco_task_struct (produce_items,
struct next_value next;
cstr text;
);
int produce_items(struct produce_items* p, cco_runtime* rt)
{
cco_routine (p) {
p->text = cstr_init();
p->next.cco_func = next_value;
while (true)
{
// await for next CCO_YIELD (or CCO_DONE) in next_value
cco_await_task(&p->next, rt, CCO_YIELD);
cstr_printf(&p->text, "item %d", p->next.val);
print_time();
printf("produced %s\n", cstr_str(&p->text));
cco_yield();
}
cco_final:
cstr_drop(&p->text);
puts("done produce");
}
return 0;
}
// CONSUMER
cco_task_struct (consume_items,
int n, i;
struct produce_items produce;
);
int consume_items(struct consume_items* c, cco_runtime* rt)
{
cco_routine (c) {
c->produce.cco_func = produce_items;
for (c->i = 1; c->i <= c->n; ++c->i)
{
printf("consume #%d\n", c->i);
cco_await_task(&c->produce, rt, CCO_YIELD);
print_time();
printf("consumed %s\n", cstr_str(&c->produce.text));
}
cco_final:
cco_stop(&c->produce);
cco_resume_task(&c->produce, rt);
puts("done consume");
}
return 0;
}
int main(void)
{
struct consume_items consume = {
.cco_func = consume_items,
.n = 5,
};
cco_blocking_task(&consume);
}
|
