Changeset ba0e1bc

Timestamp:

Nov 6, 2023, 2:20:09 PM (6 months ago)

Author:

caparson <caparson@…>

Branches:

master

Children:

0d41b2e

Parents:

3d9d017

Message:

Added supporting library routines for cofor impl

Location:

libcfa/src/concurrency

Files:

• cofor.cfa (modified) (3 diffs)
• cofor.hfa (modified) (3 diffs)

libcfa/src/concurrency/cofor.cfa

@@ -4 +4 @@
 // cofor ( uC++ COFOR )
 
-thread cofor_runner {
+thread cofor_task {
         ssize_t low, high;
         __cofor_body_t loop_body;
 };
 
-static void ?{}( cofor_runner & this, ssize_t low, ssize_t high, __cofor_body_t loop_body ) {
+static void ?{}( cofor_task & this, ssize_t low, ssize_t high, __cofor_body_t loop_body ) {
         this.low = low;
         this.high = high;
@@ -15 +15 @@
 }
 
-void main( cofor_runner & this ) with( this ) {
+void main( cofor_task & this ) with( this ) {
         for ( ssize_t i = low; i < high; i++ )
                 loop_body(i);
@@ -29 +29 @@
         ssize_t i = 0;
         ssize_t stride_iter = low;
-        cofor_runner * runners[ threads ];
+        cofor_task * runners[ threads ];
         for ( i; threads ) {
                 runners[i] = alloc();

libcfa/src/concurrency/cofor.hfa

@@ -1 +1 @@
 #include <thread.hfa>
+#include <locks.hfa>
+#include <list.hfa>
 
 //////////////////////////////////////////////////////////////////////////////////////////
@@ -14 +16 @@
                 __Cofor__( low, high, __CFA_loopLambda__ ); \
         }
+
+struct runner_node {
+    void * value;
+    inline dlink(runner_node);
+};
+P9_EMBEDDED( runner_node, dlink(runner_node) )
+
+thread cofor_runner {
+        go_mutex mutex_lock;              // MX lock
+    dlist( runner_node ) items;
+    void (*func)(void *);
+    volatile bool done;
+};
+
+void ?{}( cofor_runner & this ) { this.done = false; }
+
+void main( cofor_runner & this ) with(this) {
+    while ( !done || !items`isEmpty ) {
+                lock( mutex_lock );
+        runner_node * node = &try_pop_front( items );
+                unlock( mutex_lock );
+        func( node->value );
+        free( node->value );
+        free( node );
+    }
+}
+
+void start_runners( cofor_runner * thds, unsigned nprocs, void (*func)(void *) ) {
+        for ( i; nprocs ) {
+                thds[i].func = func;
+        }
+}
+
+void end_runners( cofor_runner * thds, unsigned nprocs ) {
+        for ( i; nprocs ) {
+                thds[i].done = true;
+        }
+}
+
+void send_work( cofor_runner * thds, unsigned nprocs, unsigned & curr_proc, void * value ) {
+        runner_node * node = malloc();
+        (*node){};
+        node->value = value;
+        lock( thds[curr_proc].mutex_lock );
+        insert_last( thds[curr_proc].items, *node );
+        unlock( thds[curr_proc].mutex_lock );
+        curr_proc = ( curr_proc + 1 ) % nprocs;
+}
 
 //////////////////////////////////////////////////////////////////////////////////////////
@@ -42 +92 @@
     delete( this.runner );
 }
-