0 branches 0 tags
Checkout
svn co https://svn.svnplace.com/artoflibs_ccoroutines/trunk/examples
86 91
93
Generator works with chaining - adjust chaining demo to actually chain (using generators)
jonroach
on 8:43 AM Jun 9 2026
chaining_demo.c
92
93
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
#include <stdio.h>
#include <stddef.h>
#include "coroutine.h"
#include "generator.h"
#include "asleep.h"
#include "task.h"
#include <dirent.h>
#include <string.h>
#include <stdlib.h>
#include <time.h>
#define DEMO_STACK_SIZE (8192*sizeof(void *))
void *chaindeeper(void *param){
// enough headroom for printf on an Intel Mac - your system may be different
if (Coroutine_GetStackHeadroom() < 2000){
void *result;
bool fail = Coroutine_Chain(DEMO_STACK_SIZE, 0, chaindeeper, param, &result);
return fail ? NULL : result;
}
printf("%ld %ld\n", (long)param, Coroutine_GetStackHeadroom());
long depth = (long)param;
if (depth > 10000){
return NULL;
}
return chaindeeper((void *)(depth + 1));
}
void *chaintest(
void *param
){
(void)param;
chaindeeper((void *)0);
Coroutine_Report report = Coroutine_GetReport();
printf("%d routines using a pool of %d, min headroom %zu\n", report.coroutines_created, report.coroutines_pool_size, report.lowest_headroom);
return param;
}
int main(int argc, char *argv[]) {
(void)argc;
(void)argv;
Coroutine_Run(DEMO_STACK_SIZE, 0, chaintest, NULL, NULL);
return 0;
}
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
#include <stdio.h>
#include <stddef.h>
#include "coroutine.h"
#include "generator.h"
#include "asleep.h"
#include "task.h"
#include <dirent.h>
#include <string.h>
#include <stdlib.h>
#include <time.h>
#define DEMO_STACK_SIZE (8192*sizeof(void *))
void *chaindeeper(void *param){
// enough headroom for printf on an Intel Mac - your system may be different
if (Coroutine_GetStackHeadroom() < 2000){
void *result;
bool fail = Coroutine_Chain(DEMO_STACK_SIZE, 0, chaindeeper, param, &result);
return fail ? NULL : result;
}
printf("%ld %ld\n", (long)param, Coroutine_GetStackHeadroom());
bool domore = Generator_Yield(param);
if (domore){
long depth = (long)param;
if (depth > 1000){
return NULL;
}
return chaindeeper((void *)(depth + 1));
}
return NULL;
}
void *chaintest(
void *param
){
(void)param;
// Need to run two coroutines so that at least one of their stacks is limited, and so
// needs to chain
Generator gen1;
Generator_ctor(&gen1, DEMO_STACK_SIZE, 0, chaindeeper, 0);
Generator gen2;
Generator_ctor(&gen2, DEMO_STACK_SIZE, 0, chaindeeper, 0);
void *param1;
void *param2;
while(Generator_Next(&gen1, &param1) && Generator_Next(&gen2, &param2)){
}
Generator_dtor(&gen2);
Generator_dtor(&gen1);
Coroutine_Report report = Coroutine_GetReport();
printf("%d routines using a pool of %d, min headroom %zu\n", report.coroutines_created, report.coroutines_pool_size, report.lowest_headroom);
return param;
}
int main(int argc, char *argv[]) {
(void)argc;
(void)argv;
Coroutine_Run(DEMO_STACK_SIZE, 0, chaintest, NULL, NULL);
return 0;
}