Replaced cco_yield(corocall, ctx, retval) with cco_await(cond) and cco_await_while(cond).

1 files changed, 11 insertions, 13 deletions

diff --git a/misc/examples/coroutines.c b/misc/examples/coroutines.c
index b11b8532..af9fef81 100644
--- a/misc/examples/coroutines.c
+++ b/misc/examples/coroutines.c
@@ -78,29 +78,27 @@ struct combined {
     int cco_state;
 };
 
+
 bool combined(struct combined* C) {
     cco_begin(C);
-        cco_yield(prime(&C->prm), &C->prm, true);
-        cco_yield(fibonacci(&C->fib), &C->fib, true);
+        cco_await(prime(&C->prm) == false);
+        cco_await(fibonacci(&C->fib) == false);
 
         // Reuse the C->prm context and extend the count:
         C->prm.count = 8; C->prm.result += 2;
         cco_reset(&C->prm);
-        cco_yield(prime(&C->prm), &C->prm, true);
+        cco_await(prime(&C->prm) == false);
 
         cco_final: puts("final comb");
     cco_end(false);
 }
 
-int main(void) {
+int main(void)
+{
     struct combined comb = {.prm={.count=8}, .fib={14}};
-    if (true)
-        while (combined(&comb))
-            printf("Prime(%d)=%lld, Fib(%d)=%lld\n", 
-                comb.prm.idx, (long long)comb.prm.result, 
-                comb.fib.idx, (long long)comb.fib.result);
-    else
-        while (prime(&comb.prm))
-            printf("Prime(%d)=%lld\n", 
-                comb.prm.idx, (long long)comb.prm.result);
+
+    while (combined(&comb))
+        printf("Prime(%d)=%lld, Fib(%d)=%lld\n", 
+            comb.prm.idx, (long long)comb.prm.result, 
+            comb.fib.idx, (long long)comb.fib.result);
 }