source: doc/papers/concurrency/examples/Fib2.cfa @ e7fdd76

ADTarm-ehast-experimentalcleanup-dtorsenumforall-pointer-decayjacob/cs343-translationjenkins-sandboxnew-astnew-ast-unique-exprpthread-emulationqualifiedEnum
Last change on this file since e7fdd76 was 1e5d0f0c, checked in by Peter A. Buhr <pabuhr@…>, 6 years ago

start rewrite of coroutine section

  • Property mode set to 100644
File size: 1.2 KB
Line 
1//
2// Cforall Version 1.0.0 Copyright (C) 2018 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_1.cfa -- 1-state finite-state machine: precomputed first two states returning f(n - 1)
8//
9// Author           : Peter A. Buhr
10// Created On       : Thu Apr 26 23:20:08 2018
11// Last Modified By : Peter A. Buhr
12// Last Modified On : Fri Mar 22 17:26:41 2019
13// Update Count     : 28
14//
15
16#include <fstream.hfa>
17#include <coroutine.hfa>
18
19coroutine Fibonacci { int fn1; };                                               // used for communication
20
21void main( Fibonacci & fib ) with( fib ) {                              // called on first resume
22        int fn;
23        [fn1, fn] = [0, 1];                                                                     // precompute first two states
24        for () {
25                suspend();                                                                              // restart last resume
26                [fn1, fn] = [fn, fn1 + fn];                                             // general case
27        } // for
28}
29
30int ?()( Fibonacci & fib ) with( fib ) {                                // function call operator
31        resume( fib );                                                                          // restart last suspend
32        return fn1;
33}
34
35int main() {
36        Fibonacci f1, f2;
37        for ( 10 ) {                                                                            // print N Fibonacci values
38                sout | f1() | f2();
39        } // for
40}
41
42// Local Variables: //
43// tab-width: 4 //
44// compile-command: "cfa fibonacci_1.cfa" //
45// End: //
Note: See TracBrowser for help on using the repository browser.