Index: src/tests/Makefile.am
===================================================================
--- src/tests/Makefile.am	(revision d7dc82447d825854b37e78a7aa777b1a58e7e1b2)
+++ src/tests/Makefile.am	(revision ec95d1177c41ea894d346d43b00af99c7f01bb8b)
@@ -11,6 +11,6 @@
 ## Created On       : Sun May 31 09:08:15 2015
 ## Last Modified By : Peter A. Buhr
-## Last Modified On : Thu May 25 14:39:15 2017
-## Update Count     : 43
+## Last Modified On : Thu Jun  8 07:41:43 2017
+## Update Count     : 44
 ###############################################################################
 
@@ -20,7 +20,7 @@
 
 if BUILD_CONCURRENCY
-concurrent=yes
-quick_test+= coroutine thread monitor
-concurrent_test=coroutine thread monitor multi-monitor sched-int-barge sched-int-block sched-int-disjoint sched-int-wait sched-ext sched-ext-multi preempt
+concurrent = yes
+quick_test += coroutine thread monitor
+concurrent_test = coroutine thread monitor multi-monitor sched-int-barge sched-int-block sched-int-disjoint sched-int-wait sched-ext sched-ext-multi preempt
 else
 concurrent=no
Index: src/tests/coroutine.c
===================================================================
--- src/tests/coroutine.c	(revision d7dc82447d825854b37e78a7aa777b1a58e7e1b2)
+++ src/tests/coroutine.c	(revision ec95d1177c41ea894d346d43b00af99c7f01bb8b)
@@ -1,43 +1,61 @@
+// 
+// Cforall Version 1.0.0 Copyright (C) 2017 University of Waterloo
+//
+// The contents of this file are covered under the licence agreement in the
+// file "LICENCE" distributed with Cforall.
+// 
+// fibonacci.c -- 
+// 
+// Author           : Thierry Delisle
+// Created On       : Thu Jun  8 07:29:37 2017
+// Last Modified By : Peter A. Buhr
+// Last Modified On : Thu Jun  8 07:37:12 2017
+// Update Count     : 5
+// 
+
 #include <fstream>
 #include <coroutine>
 
 coroutine Fibonacci {
-      int fn; // used for communication
+	int fn;						// used for communication
 };
 
-void ?{}(Fibonacci* this) {
-      this->fn = 0;
+void ?{}( Fibonacci * this ) {
+	this->fn = 0;
 }
 
-void main(Fibonacci* this) {
-      int fn1, fn2; 		// retained between resumes
-      this->fn = 0;
-      fn1 = this->fn;
-      suspend(); 		// return to last resume
+void main( Fibonacci * this ) {
+	int fn1, fn2;					// retained between resumes
+	this->fn = 0;					// case 0
+	fn1 = this->fn;
+	suspend();						// return to last resume
 
-      this->fn = 1;
-      fn2 = fn1;
-      fn1 = this->fn;
-      suspend(); 		// return to last resume
+	this->fn = 1;					// case 1
+	fn2 = fn1;
+	fn1 = this->fn;
+	suspend();						// return to last resume
 
-      for ( ;; ) {
-            this->fn = fn1 + fn2;
-            fn2 = fn1;
-            fn1 = this->fn;
-            suspend(); 	// return to last resume
-      }
+	for ( ;; ) {					// general case
+		this->fn = fn1 + fn2;
+		fn2 = fn1;
+		fn1 = this->fn;
+		suspend();					// return to last resume
+	} // for
 }
 
-int next(Fibonacci* this) {
-      resume(this); // transfer to last suspend
-      return this->fn;
+int next( Fibonacci * this ) {
+	resume( this );					// transfer to last suspend
+	return this->fn;
 }
 
 int main() {
-      Fibonacci f1, f2;
-      for ( int i = 1; i <= 10; i += 1 ) {
-            sout | next(&f1) | ' ' | next(&f2) | endl;
-      }
+	Fibonacci f1, f2;
+	for ( int i = 1; i <= 10; i += 1 ) {
+		sout | next( &f1 ) | ' ' | next( &f2 ) | endl;
+	} // for
+}
 
-      return 0;
-}
+// Local Variables: //
+// tab-width: 4 //
+// compile-command: "cfa fibonacci.c" //
+// End: //