|
Last change
on this file since 4a3eb1c was 5c46672, checked in by Thierry Delisle <tdelisle@…>, 4 years ago |
|
coroutine fibonacci now uses return from resume
|
-
Property mode
set to
100644
|
|
File size:
1.2 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 |
|
|---|
| 19 | coroutine Fibonacci { int fn; }; // used for communication
|
|---|
| 20 |
|
|---|
| 21 | void 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 |
|
|---|
| 33 | int main() {
|
|---|
| 34 | Fibonacci f1, f2;
|
|---|
| 35 | for ( 10 ) { // print N Fibonacci values
|
|---|
| 36 | sout | resume( f1 ).fn | resume( f2 ).fn;
|
|---|
| 37 | } // for
|
|---|
| 38 | }
|
|---|
| 39 |
|
|---|
| 40 | // Local Variables: //
|
|---|
| 41 | // tab-width: 4 //
|
|---|
| 42 | // compile-command: "cfa fibonacci.cfa" //
|
|---|
| 43 | // End: //
|
|---|
Note:
See
TracBrowser
for help on using the repository browser.
