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
|
// 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>
struct next_value {
int val;
int cco_state;
cco_timer tm;
};
int next_value(struct next_value* co)
{
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
struct produce_items {
struct next_value next;
cstr str;
int cco_state;
};
int produce_items(struct produce_items* p)
{
cco_routine (p) {
p->str = cstr_init();
while (true)
{
cco_await(next_value(&p->next) != CCO_AWAIT);
cstr_printf(&p->str, "item %d", p->next.val);
print_time();
printf("produced %s\n", cstr_str(&p->str));
cco_yield();
}
cco_final:
cstr_drop(&p->str);
puts("done produce");
}
return 0;
}
// CONSUMER
struct consume_items {
int n, i;
int cco_state;
};
int consume_items(struct consume_items* c, struct produce_items* p)
{
cco_routine (c) {
for (c->i = 1; c->i <= c->n; ++c->i)
{
printf("consume #%d\n", c->i);
cco_await(produce_items(p) != CCO_AWAIT);
print_time();
printf("consumed %s\n", cstr_str(&p->str));
}
cco_final:
puts("done consume");
}
return 0;
}
int main(void)
{
struct produce_items produce = {0};
struct consume_items consume = {.n=5};
int count = 0;
cco_blocking_call(consume_items(&consume, &produce))
{
++count;
//cco_sleep(0.001);
//if (consume.i == 3) cco_stop(&consume);
}
cco_stop(&produce);
produce_items(&produce);
printf("count: %d\n", count);
}
|
