Changeset 18cf979

Timestamp:

Dec 12, 2018, 11:24:32 PM (6 years ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, deferred_resn, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, no_list, persistent-indexer, pthread-emulation, qualifiedEnum

Children:

24662ff, 9d6497a

Parents:

5dd3098

Message:

update

File:

• tests/coroutine/prodcons.c (modified) (6 diffs)

tests/coroutine/prodcons.c

@@ -10 +10 @@
 // Created On       : Mon Sep 18 12:23:39 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Tue Dec 11 21:58:25 2018
-// Update Count     : 52
+// Last Modified On : Wed Dec 12 23:04:49 2018
+// Update Count     : 53
 //
 
@@ -24 +24 @@
 
 coroutine Prod {
-        Cons * c;
+        Cons & c;
         int N, money, receipt;
 };
@@ -30 +30 @@
         // 1st resume starts here
         for ( i; N ) {                                                                          // N pairs of values
-                int p1 = random( 100 );
-                int p2 = random( 100 );
+                int p1 = random( 100 ), p2 = random( 100 );
                 sout | p1 | " " | p2;
-                int status = delivery( *c, p1, p2 );
-                sout | " $" | money;
-                sout | status;
+                int status = delivery( c, p1, p2 );
+                sout | " $" | money | nl | status;
                 receipt += 1;
         }
-        stop( *c );
+        stop( c );
         sout | "prod stops";
 }
@@ -47 +45 @@
 }
 void start( Prod & prod, int N, Cons &c ) {
-        prod.N = N;
-        prod.c = &c;
-        prod.receipt = 0;
+        &prod.c = &c;
+        prod.[N, receipt] = [N, 0];
         resume( prod );                                                                         // activate main
 }
 
 coroutine Cons {
-        Prod * p;
+        Prod & p;
         int p1, p2, status;
         bool done;
 };
 void ?{}( Cons & cons, Prod & p ) {
-        cons.p = &p;
-        cons.status = 0;
-        cons.done = false;
+        &cons.p = &p;
+        cons.[status, done ] = [0, false];
 }
 void ^?{}( Cons & cons ) {}
@@ -68 +64 @@
         int money = 1, receipt;
         for ( ; ! done; ) {
-                sout | p1 | " " | p2;
-                sout | " $" | money;
+                sout | p1 | " " | p2 | nl | " $" | money;
                 status += 1;
-                receipt = payment( *p, money );
+                receipt = payment( p, money );
                 sout | " #" | receipt;
                 money += 1;
@@ -78 +73 @@
 }
 int delivery( Cons & cons, int p1, int p2 ) {
-        cons.p1 = p1;
-        cons.p2 = p2;
+        cons.[p1, p2] = [p1, p2];
         resume( cons );                                                                         // main 1st time, then
         return cons.status;                                                                     // cons in payment