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
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
|
/* coroutine.c - Simple embeddable coroutine implementation
*
* Copyright (C) 2024 Luke T. Shumaker <lukeshu@lukeshu.com>
* SPDX-Licence-Identifier: AGPL-3.0-or-later
*/
#include <assert.h>
#include <setjmp.h> /* for setjmp(), longjmp(), jmp_buf */
#include <stdint.h> /* for uint8_t */
#include <stdio.h> /* for printf(), fprintf(), stderr */
#include <stdlib.h> /* for aligned_alloc(), free() */
#include <libcr/coroutine.h>
/* Configuration **************************************************************/
#define USE_CONFIG_COROUTINE
#include "config.h"
#ifndef CONFIG_COROUTINE_DEFAULT_STACK_SIZE
# error config.h must define CONFIG_COROUTINE_DEFAULT_STACK_SIZE
#endif
#ifndef CONFIG_COROUTINE_NUM
# error config.h must define CONFIG_COROUTINE_NUM
#endif
#ifndef CONFIG_COROUTINE_MEASURE_STACK
# error config.h must define CONFIG_COROUTINE_MEASURE_STACK
#endif
#ifndef CONFIG_COROUTINE_PROTECT_STACK
# error config.h must define CONFIG_COROUTINE_PROTECT_STACK
#endif
#ifndef CONFIG_COROUTINE_DEBUG
# error config.h must define CONFIG_COROUTINE_DEBUG
#endif
/* Implementation *************************************************************/
/*
* Portability notes:
*
* - It uses GCC `__attribute__`s, and the GNUC ({ ... }) statement exprs
etension.
*
* - It has a small bit of platform-specific code in the "platform support"
* section. Other than this, it should be portable to other platforms CPUs.
* It currently contains implementations for __x86_64__ (assumes POSIX) and
* __arm__ (assumes ARM CMSIS), and should be fairly easy to add
* implementations for other platforms.
*
* - It uses setjmp()/longjmp() in "unsafe" ways. POSIX-2017
* longjmp(3) says
*
* > If the most recent invocation of setjmp() with the
* > corresponding jmp_buf ... or if the function containing the
* > invocation of setjmp() has terminated execution in the interim,
* > or if the invocation of setjmp() was within the scope of an
* > identifier with variably modified type and execution has left
* > that scope in the interim, the behavior is undefined.
*
* We use longjmp() both of these scenarios, but make it OK by using
* call_with_stack() to manage the stack ourselves, assuming the
* sole reason that longjmp() behavior is undefined in such cases is
* because the stack that its saved stack-pointer points to is no
* longer around. It seems absurd that an implementation would
* choose to do something else, but I'm calling it out here because
* you never know.
*
* Note that setjmp()/longjmp() are defined in 3 places: in the libc
* (glibc/newlib), as GCC intrinsics, and the lower-level GCC
* __builtin_{setjmp,newlib} which the libc and intrinsic versions
* likely use. Our assumptions seem to be valid for
* x86_64-pc-linux-gnu/gcc-14.2.1/glibc-2.40 and
* arm-none-eabi/gcc-14.1.0/newlib-4.4.0.
*
* Why not use <ucontext.h>, the now-deprecated (was in POSIX.1-2001,
* is gone in POSIX-2008) predecesor to <setjmp.h>? It would let us
* do this without any assembly or unsafe assumptions. Simply:
* because newlib does not provide it.
*/
/*
* Design decisions and notes:
*
* - Coroutines are launched with a stack stack that is filled with
* known values (zero or a pre-determined pattern, depending on the
* config above). Because all stack variables should be initialized
* before they are read, this "shouldn't" make a difference, but:
* (1) Initializing it to a known value allows us to measure how
* much of the stack was written to, which is helpful to tune stack
* sizes. (2) Leaving it uninitialized just gives me the willies.
*
* - Because embedded programs should be adverse to using the heap,
* CONFIG_COROUTINE_NUM is fixed, instead of having coroutine_add()
* dynamically grow the coroutine_table as-needed.
*
* - On the flip-side, coroutine stacks are allocated on the heap
* instead of having them be statically-allocated along with
* coroutine_table. (1) This reduced the blast-area of damage for a
* stack-overflow; and indeed if the end of the stack alignes with a
* page-boundary then memory-protection can even detect the overflow
* for us. (2) Having different-looking addresses for stack-area vs
* static-area is handy for making things jump out at you when
* debugging. (3) This can likely also improve things with being
* page-aligned.
*
* - Coroutines must use cr_exit() instead of returning because if
* they return then they will return to call_with_stack() in
* coroutine_add() (not to after the longjmp() call in
* coroutine_main()), and besides being
* wrong-for-our-desired-flow-control, that's a stack location that
* no longer exists.
*/
#if __x86_64__
# include <unistd.h> /* for pause() */
# define wait_for_interrupt() pause()
#elif __arm__
# include "hardware/sync.h" /* for __wfi(); */
# define wait_for_interrupt() __wfi()
#endif
/* types **********************************************************************/
enum coroutine_state {
CR_NONE = 0, /* this slot in the table is empty */
CR_INITIALIZING, /* running, before cr_begin() */
CR_RUNNING, /* running, after cr_begin() */
CR_PRE_RUNNABLE, /* running, between cr_unpause_from_intrhandler() and cr_pause() */
CR_RUNNABLE, /* not running, but runnable */
CR_PAUSED, /* not running, and not runnable */
};
struct coroutine {
volatile enum coroutine_state state;
jmp_buf env;
size_t stack_size;
void *stack;
};
/* constants ******************************************************************/
const char *coroutine_state_strs[] = {
[CR_NONE] = "CR_NONE",
[CR_INITIALIZING] = "CR_INITIALIZING",
[CR_RUNNING] = "CR_RUNNING",
[CR_PRE_RUNNABLE] = "CR_PRE_RUNNABLE",
[CR_RUNNABLE] = "CR_RUNNABLE",
[CR_PAUSED] = "CR_PAUSED",
};
#if CONFIG_COROUTINE_MEASURE_STACK || CONFIG_COROUTINE_PROTECT_STACK
/* We just need a pattern that is unlikely to occur naturaly; this is
* just a few bytes that I read from /dev/random. */
static const uint8_t stack_pattern[] = {
0xa1, 0x31, 0xe6, 0x07, 0x1f, 0x61, 0x20, 0x32,
0x4b, 0x14, 0xc4, 0xe0, 0xea, 0x62, 0x25, 0x63,
};
#endif
/* global variables ***********************************************************/
static jmp_buf coroutine_add_env;
static jmp_buf coroutine_main_env;
/*
* Invariants (and non-invariants):
*
* - exactly 0 or 1 coroutines have state CR_INITIALIZING
* - exactly 0 or 1 coroutines have state CR_RUNNING
* - if coroutine_running is not zero, then
* coroutine_table[coroutine_running-1] is the currently-running
* coroutine
* - the coroutine_running coroutine either has state CR_RUNNING or
* CR_INITIALIZNG
* - a coroutine having state CR_RUNNING does *not* imply that
* coroutine_running points at that coroutine; if that coroutine is
* in the middle of coroutine_add(), it coroutine_running points at
* the CR_INITIALIZING child coroutine, while leaving the parent
* coroutine as CR_RUNNING.
*/
static struct coroutine coroutine_table[CONFIG_COROUTINE_NUM] = {0};
static cid_t coroutine_running = 0;
/* utility functions **********************************************************/
#define errorf(...) fprintf(stderr, "error: " __VA_ARGS__)
#define infof(...) printf("info: " __VA_ARGS__)
#if CONFIG_COROUTINE_DEBUG
# define debugf(...) printf("dbg: " __VA_ARGS__)
#else
# define debugf(...)
#endif
#ifdef __GLIBC__
# define assertf(expr, ...) \
((void) sizeof ((expr) ? 1 : 0), __extension__ ({ \
if (expr) \
; /* empty */ \
else { \
errorf("assertion: " __VA_ARGS__); \
__assert_fail (#expr, __FILE__, __LINE__, __ASSERT_FUNCTION); \
} \
}))
#else
# define assertf(expr, ...) assert(expr)
#endif
/** Return `n` rounded up to the nearest multiple of `d` */
#define round_up(n, d) ( ( ((n)+(d)-1) / (d) ) * (d) )
static inline const char* coroutine_state_str(enum coroutine_state state) {
assert(state < (sizeof(coroutine_state_strs)/sizeof(coroutine_state_strs[0])));
return coroutine_state_strs[state];
}
static inline void assert_cid(cid_t cid) {
assert(cid > 0);
assert(cid <= CONFIG_COROUTINE_NUM);
#if CONFIG_COROUTINE_PROTECT_STACK
assert(coroutine_table[cid-1].stack_size);
assert(coroutine_table[cid-1].stack);
for (size_t i = 0; i < sizeof(stack_pattern); i++) {
size_t j = coroutine_table[cid-1].stack_size - (i+1);
assert(((uint8_t*)coroutine_table[cid-1].stack)[i] == stack_pattern[i]);
assert(((uint8_t*)coroutine_table[cid-1].stack)[j] == stack_pattern[j%sizeof(stack_pattern)]);
}
#endif
}
#define assert_cid_state(cid, expr) do { \
assert_cid(cid); \
cid_t state = coroutine_table[(cid)-1].state; \
assert(expr); \
} while (0)
/* platform support ***********************************************************/
/* As part of sbc-harness, this only really needs to support ARM-32, but being
* able to run it on my x86-64 GNU/Linux laptop is useful for debugging. */
#define CR_PLAT_STACK_ALIGNMENT ({ __attribute__((aligned)) void fn(void) {}; __alignof__(fn); })
#if 0
{ /* to get Emacs indentation to work how I want */
#endif
#if __arm__
/* Assume bare metal ARMv6-M. */
#include "cmsis_compiler.h" /* for __WFI(), __disable_irq(), __enable_irq() */
#define CR_PLAT_STACK_GROWS_DOWNWARD 1
static void cr_plat_wait_for_interrupt(void) { asm volatile ("wfi":::"memory"); }
static void cr_plat_disable_interrupt(void) { asm volatile ("cpsid i":::"memory"); }
static void cr_plat_enable_interrupts(void) { asm volatile ("cpsie i":::"memory"); }
#if CONFIG_COROUTINE_MEASURE_STACK
static size_t cr_plat_get_sp(void) {
size_t sp;
asm volatile ("mov %0, sp":"=r"(sp));
return sp;
}
#endif
static void cr_plat_call_with_stack(void *stack, cr_fn_t fn, void *args) {
static void *saved_sp = NULL;
/* str/ldr can only work with a "lo" register, which sp is
* not, so we use r0 as an intermediate because we're going to
* clobber it with args anyway. */
asm volatile ("mov r0, sp\n\t" /* [saved_sp = sp */
"str r0, %0\n\t" /* ] */
"mov sp, %1\n\t" /* [sp = stack] */
"mov r0, %3\n\t" /* [arg0 = args] */
"blx %2\n\t" /* [fn()] */
"ldr r0, %0\n\t" /* [sp = staved_sp */
"mov sp, r0" /* ] */
:
: /* %0 */"m"(saved_sp),
/* %1 */"r"(stack),
/* %2 */"r"(fn),
/* %3 */"r"(args)
: "r0"
);
}
#elif __x86_64__
/* Assume POSIX. */
#include <signal.h> /* for sigset_t, sigprocmask(), SIG_*, sigfillset() */
#include <unistd.h> /* for pause() */
#define CR_PLAT_STACK_GROWS_DOWNWARD 1
static void cr_plat_wait_for_interrupt(void) {
pause();
}
static void cr_plat_disable_interrupts(void) {
sigset_t all;
sigfillset(&all);
sigprocmask(SIG_BLOCK, &all, NULL);
}
static void cr_plat_enable_interrupts(void) {
sigset_t all;
sigfillset(&all);
sigprocmask(SIG_UNBLOCK, &all, NULL);
}
#if CONFIG_COROUTINE_MEASURE_STACK
static size_t cr_plat_get_sp(void) {
size_t sp;
asm volatile ("movq %%rsp, %0":"=r"(sp));
return sp;
}
#endif
static void cr_plat_call_with_stack(void *stack, cr_fn_t fn, void *args) {
static void *saved_sp = NULL;
asm volatile ("movq %%rsp , %0\n\t" /* saved_sp = sp */
"movq %1 , %%rsp\n\t" /* sp = stack */
"movq %3 , %%rdi\n\t" /* arg0 = args */
"call *%2\n\t" /* fn() */
"movq %0 , %%rsp" /* sp = saved_sp */
:
: /* %0 */"m"(saved_sp),
/* %1 */"r"(stack),
/* %2 */"r"(fn),
/* %3 */"r"(args)
: "rdi"
);
#else
#error unsupported platform
#endif
#if 0
}
#endif
/* coroutine_add() ************************************************************/
cid_t coroutine_add_with_stack_size(size_t stack_size, cr_fn_t fn, void *args) {
static cid_t last_created = 0;
cid_t parent = coroutine_running;
if (parent)
assert_cid_state(parent, state == CR_RUNNING);
assert(stack_size);
assert(fn);
debugf("coroutine_add_with_stack_size(%zu, %p, %p)...\n", stack_size, fn, args);
cid_t child;
{
size_t idx_base = last_created;
for (size_t idx_shift = 0; idx_shift < CONFIG_COROUTINE_NUM; idx_shift++) {
child = ((idx_base + idx_shift) % CONFIG_COROUTINE_NUM) + 1;
if (coroutine_table[child-1].state == CR_NONE)
goto found;
}
return 0;
found:
}
debugf("...child=%zu\n", child);
last_created = child;
coroutine_table[child-1].stack_size = stack_size;
coroutine_table[child-1].stack = aligned_alloc(CR_PLAT_STACK_ALIGNMENT, stack_size);
#if CONFIG_COROUTINE_MEASURE_STACK || CONFIG_COROUTINE_PROTECT_STACK
for (size_t i = 0; i < stack_size; i++)
((uint8_t*)coroutine_table[child-1].stack)[i] = stack_pattern[i%sizeof(stack_pattern)];
#endif
coroutine_running = child;
coroutine_table[child-1].state = CR_INITIALIZING;
if (!setjmp(coroutine_add_env)) { /* point=a */
void *stack_base = coroutine_table[child-1].stack + (CR_PLAT_STACK_GROWS_DOWNWARD ? stack_size : 0);
#if CONFIG_COROUTINE_PROTECT_STACK
# if CR_PLAT_STACK_GROWS_DOWNWARD
stack_base -= round_up(sizeof(stack_pattern), CR_PLAT_STACK_ALIGNMENT);
# else
stack_base += round_up(sizeof(stack_pattern), CR_PLAT_STACK_ALIGNMENT);
# endif
#endif
debugf("...stack =%p\n", coroutine_table[child-1].stack);
debugf("...stack_base=%p\n", stack_base);
/* run until cr_begin() */
cr_plat_call_with_stack(stack_base, fn, args);
assert(false); /* should cr_begin() instead of returning */
}
assert_cid_state(child, state == CR_RUNNABLE);
if (parent)
assert_cid_state(parent, state == CR_RUNNING);
coroutine_running = parent;
return child;
}
cid_t coroutine_add(cr_fn_t fn, void *args) {
return coroutine_add_with_stack_size(CONFIG_COROUTINE_DEFAULT_STACK_SIZE, fn, args);
}
/* coroutine_main() ***********************************************************/
#if CONFIG_COROUTINE_MEASURE_STACK
struct stack_stats {
size_t cap;
size_t max;
//size_t cur;
};
static void measure_stack(cid_t cid, struct stack_stats *ret) {
ret->cap = coroutine_table[cid-1].stack_size - (CONFIG_COROUTINE_PROTECT_STACK ? 2*round_up(sizeof(stack_pattern), CR_PLAT_STACK_ALIGNMENT) : 0);
ret->max = ret->cap;
for (;;) {
#if CR_PLAT_STACK_GROWS_DOWNWARD
size_t i = (CONFIG_COROUTINE_PROTECT_STACK ? round_up(sizeof(stack_pattern), CR_PLAT_STACK_ALIGNMENT) : 0) + ret->cap - ret->max;
#else
size_t i = ret->max - 1 - (CONFIG_COROUTINE_PROTECT_STACK ? round_up(sizeof(stack_pattern), CR_PLAT_STACK_ALIGNMENT) : 0);
#endif
if (ret->max == 0 || ((uint8_t*)coroutine_table[cid-1].stack)[i] != stack_pattern[i%sizeof(stack_pattern)])
break;
ret->max--;
}
}
#endif
static inline cid_t next_coroutine() {
for (cid_t next = (coroutine_running%CONFIG_COROUTINE_NUM)+1;
next != coroutine_running;
next = (next%CONFIG_COROUTINE_NUM)+1) {
if (coroutine_table[next-1].state == CR_RUNNABLE)
return next;
}
return 0;
}
void coroutine_main(void) {
debugf("coroutine_main()\n");
coroutine_running = 0;
for (;;) {
cid_t next = next_coroutine();
if (!next) {
errorf("no coroutines\n");
return;
}
if (!setjmp(coroutine_main_env)) { /* point=b */
coroutine_running = next;
coroutine_table[coroutine_running-1].state = CR_RUNNING;
longjmp(coroutine_table[coroutine_running-1].env, 1); /* jump to point=c */
}
assert_cid_state(coroutine_running, state == CR_NONE);
#if CONFIG_COROUTINE_MEASURE_STACK
struct stack_stats sizes;
measure_stack(coroutine_running, &sizes);
infof("cid=%zu: exited having used %zu B stack space\n", coroutine_running, sizes.max);
#endif
free(coroutine_table[coroutine_running-1].stack);
coroutine_table[coroutine_running-1] = (struct coroutine){0};
}
}
/* cr_*() *********************************************************************/
void cr_begin(void) {
assert_cid_state(coroutine_running, state == CR_INITIALIZING);
coroutine_table[coroutine_running-1].state = CR_RUNNABLE;
if (!setjmp(coroutine_table[coroutine_running-1].env)) /* point=c1 */
longjmp(coroutine_add_env, 1); /* jump to point=a */
}
static inline void _yield() {
cid_t next;
for (;;) {
next = next_coroutine();
if (next)
break;
if (coroutine_table[coroutine_running-1].state == CR_RUNNABLE) {
debugf("cid=%zu: no other runnable coroutines, not yielding\n", coroutine_running);
coroutine_table[coroutine_running-1].state = CR_RUNNING;
return;
} else { // XXX
debugf("cid=%zu: no runnable coroutines, sleeping\n", coroutine_running); // XXX
wait_for_interrupt(); // XXX
}
}
if (!setjmp(coroutine_table[coroutine_running-1].env)) { /* point=c2 */
coroutine_running = next;
coroutine_table[coroutine_running-1].state = CR_RUNNING;
longjmp(coroutine_table[coroutine_running-1].env, 1); /* jump to point=b */
}
}
void cr_yield(void) {
assert_cid_state(coroutine_running, state == CR_RUNNING);
coroutine_table[coroutine_running-1].state = CR_RUNNABLE;
_yield();
}
void cr_pause_and_yield(void) {
assert_cid_state(coroutine_running, state == CR_RUNNING || state == CR_PRE_RUNNABLE);
coroutine_table[coroutine_running-1].state = CR_PAUSED;
_yield();
}
void cr_exit(void) {
assert_cid_state(coroutine_running, state == CR_RUNNING);
debugf("cid=%zu: exit\n", coroutine_running);
coroutine_table[coroutine_running-1].state = CR_NONE;
longjmp(coroutine_main_env, 1); /* jump to point=b */
}
void cr_unpause(cid_t cid) {
assert_cid_state(cid, state == CR_PAUSED);
debugf("cr_unpause(%zu)\n", cid);
coroutine_table[cid-1].state = CR_RUNNABLE;
}
void cr_unpause_from_intrhandler(cid_t cid) {
assert_cid_state(cid, state == CR_RUNNING || state == CR_PAUSED);
debugf("cr_unpause_from_intrhandler(%zu)\n", cid);
switch (coroutine_table[cid-1].state) {
case CR_RUNNING:
assert(cid == coroutine_running);
debugf("... raced, deferring unpause\n");
coroutine_table[cid-1].state = CR_PRE_RUNNABLE;
break;
case CR_PAUSED:
debugf("... actual unpause\n");
coroutine_table[cid-1].state = CR_RUNNABLE;
break;
default:
assert(false);
}
}
cid_t cr_getcid(void) {
return coroutine_running;
}
|