source: tests/coroutine/fibonacci.cfa@ b26144d

ADT arm-eh ast-experimental enum forall-pointer-decay jacob/cs343-translation new-ast-unique-expr pthread-emulation qualifiedEnum
Last change on this file since b26144d was 427854b, checked in by Thierry Delisle <tdelisle@…>, 6 years ago

First draft implementation of generators, still missing error checking, testing and clean-up

  • Property mode set to 100644
File size: 1.3 KB
Line 
1//
2// Cforall Version 1.0.0 Copyright (C) 2017 University of Waterloo
3//
4// The contents of this file are covered under the licence agreement in the
5// file "LICENCE" distributed with Cforall.
6//
7// fibonacci.c -- 3-state finite-state machine
8//
9// Author : Thierry Delisle
10// Created On : Thu Jun 8 07:29:37 2017
11// Last Modified By : Peter A. Buhr
12// Last Modified On : Fri Mar 22 13:40:35 2019
13// Update Count : 26
14//
15
16#include <fstream.hfa>
17#include <coroutine.hfa>
18
19coroutine Fibonacci { int fn; }; // used for communication
20
21void main( Fibonacci & fib ) with( fib ) { // called on first resume
22 int fn1, fn2; // retained between resumes
23 fn = 0; fn1 = fn; // 1st case
24 suspend; // restart last resume
25 fn = 1; fn2 = fn1; fn1 = fn; // 2nd case
26 suspend; // restart last resume
27 for () {
28 fn = fn1 + fn2; fn2 = fn1; fn1 = fn; // general case
29 suspend; // restart last resume
30 } // for
31}
32
33int next( Fibonacci & fib ) with( fib ) {
34 resume( fib ); // restart last suspend
35 return fn;
36}
37
38int main() {
39 Fibonacci f1, f2;
40 for ( 10 ) { // print N Fibonacci values
41 sout | next( f1 ) | next( f2 );
42 } // for
43}
44
45// Local Variables: //
46// tab-width: 4 //
47// compile-command: "cfa fibonacci.cfa" //
48// End: //
Note: See TracBrowser for help on using the repository browser.