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
|
/* MIT License
*
* Copyright (c) 2023 Tyge Løvset
*
* 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 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.
*/
#ifndef STC_COROUTINE_INCLUDED
#define STC_COROUTINE_INCLUDED
/*
#include <stdio.h>
#include <stc/algo/coroutine.h>
struct coroutine {
int max_x, max_y;
int x, y;
int cco_state; // required member
};
bool coroutine(struct coroutine* I) {
cco_begin(I);
for (I->x = 0; I->x < I->max_x; I->x++)
for (I->y = 0; I->y < I->max_y; I->y++)
cco_yield(false);
cco_final: // required if there is cleanup code
puts("final");
cco_end(true);
}
int main(void) {
struct coroutine it = {.max_x=3, .max_y=3};
int n = 0;
while (!coroutine(&it))
{
printf("%d %d\n", it.x, it.y);
// example of early stop:
if (++n == 7) cco_stop(&it); // signal to stop at next
}
return 0;
}
*/
#include <stc/ccommon.h>
enum {
cco_state_final = -1,
cco_state_done = -2,
};
#define cco_initial(ctx) ((ctx)->cco_state == 0)
#define cco_suspended(ctx) ((ctx)->cco_state > 0)
#define cco_done(ctx) ((ctx)->cco_state == cco_state_done)
#define cco_begin(ctx) \
int *_state = &(ctx)->cco_state; \
goto _begin; _begin: switch (*_state) { \
case 0:
#define cco_end(retval) \
} \
*_state = cco_state_done; \
return retval
#define cco_yield(retval) \
do { \
*_state = __LINE__; return retval; \
case __LINE__:; \
} while (0)
#define cco_await(...) c_MACRO_OVERLOAD(cco_await, __VA_ARGS__)
#define cco_await_1(promise) cco_await_2(promise, )
#define cco_await_2(promise, retval) \
do { \
*_state = __LINE__; \
case __LINE__: if (!(promise)) return retval; \
} while (0)
#define cco_final \
case cco_state_final
#define cco_return \
do { *_state = cco_state_final; goto _begin; } while (0)
#define cco_stop(ctx) \
do { \
int* _state = &(ctx)->cco_state; \
if (*_state > 0) *_state = cco_state_final; \
} while (0)
#define cco_reset(ctx) \
do { \
int* _state = &(ctx)->cco_state; \
if (*_state == cco_state_done) *_state = 0; \
} while (0)
/*
* Semaphore
*/
typedef struct {
intptr_t count;
} csem;
#define cco_await_sem(...) c_MACRO_OVERLOAD(cco_await_sem, __VA_ARGS__)
#define cco_await_sem_1(sem) cco_await_sem_2(sem, )
#define cco_await_sem_2(sem, retval) \
do { \
cco_await_2((sem)->count > 0, retval); \
--(sem)->count; \
} while (0)
#define csem_signal(sem) ++(sem)->count
#define csem_set(sem, value) ((sem)->count = (value))
/*
* Timer
*/
#include <time.h>
#ifdef _WIN32
static inline void csleep_ms(long msecs) {
extern void Sleep(unsigned long);
Sleep((unsigned long)msecs);
}
#elif _POSIX_C_SOURCE >= 199309L
static inline void csleep_ms(long msecs) {
struct timespec ts = {msecs/1000, 1000000*(msecs % 1000)};
nanosleep(&ts, NULL);
}
#endif
typedef struct {
clock_t start;
clock_t interval;
} ctimer;
#define cco_await_timer(...) c_MACRO_OVERLOAD(cco_await_timer, __VA_ARGS__)
#define cco_await_timer_2(t, msecs) cco_await_timer_3(t, msecs, )
#define cco_await_timer_3(t, msecs, ret) \
do { \
ctimer_start(t, msecs); \
cco_await_2(ctimer_expired(t), ret); \
} while (0)
static inline void ctimer_start(ctimer* t, long msecs) {
t->interval = msecs*(CLOCKS_PER_SEC/1000);
t->start = clock();
}
static inline void ctimer_restart(ctimer* t) {
t->start = clock();
}
static inline bool ctimer_expired(ctimer* t) {
return clock() - t->start >= t->interval;
}
static inline long ctimer_remaining(ctimer* t) {
return (long)((double)(t->start + t->interval - clock())*(1000.0/CLOCKS_PER_SEC));
}
#endif
|
