- Timestamp:
- Nov 6, 2023, 2:20:09 PM (18 months ago)
- Branches:
- master
- Children:
- 0d41b2e1
- Parents:
- 3d9d017
- Location:
- libcfa/src/concurrency
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
TabularUnified libcfa/src/concurrency/cofor.cfa ¶
r3d9d017 rba0e1bc 4 4 // cofor ( uC++ COFOR ) 5 5 6 thread cofor_ runner{6 thread cofor_task { 7 7 ssize_t low, high; 8 8 __cofor_body_t loop_body; 9 9 }; 10 10 11 static void ?{}( cofor_ runner& this, ssize_t low, ssize_t high, __cofor_body_t loop_body ) {11 static void ?{}( cofor_task & this, ssize_t low, ssize_t high, __cofor_body_t loop_body ) { 12 12 this.low = low; 13 13 this.high = high; … … 15 15 } 16 16 17 void main( cofor_ runner& this ) with( this ) {17 void main( cofor_task & this ) with( this ) { 18 18 for ( ssize_t i = low; i < high; i++ ) 19 19 loop_body(i); … … 29 29 ssize_t i = 0; 30 30 ssize_t stride_iter = low; 31 cofor_ runner* runners[ threads ];31 cofor_task * runners[ threads ]; 32 32 for ( i; threads ) { 33 33 runners[i] = alloc(); -
TabularUnified libcfa/src/concurrency/cofor.hfa ¶
r3d9d017 rba0e1bc 1 1 #include <thread.hfa> 2 #include <locks.hfa> 3 #include <list.hfa> 2 4 3 5 ////////////////////////////////////////////////////////////////////////////////////////// … … 14 16 __Cofor__( low, high, __CFA_loopLambda__ ); \ 15 17 } 18 19 struct runner_node { 20 void * value; 21 inline dlink(runner_node); 22 }; 23 P9_EMBEDDED( runner_node, dlink(runner_node) ) 24 25 thread cofor_runner { 26 go_mutex mutex_lock; // MX lock 27 dlist( runner_node ) items; 28 void (*func)(void *); 29 volatile bool done; 30 }; 31 32 void ?{}( cofor_runner & this ) { this.done = false; } 33 34 void main( cofor_runner & this ) with(this) { 35 while ( !done || !items`isEmpty ) { 36 lock( mutex_lock ); 37 runner_node * node = &try_pop_front( items ); 38 unlock( mutex_lock ); 39 func( node->value ); 40 free( node->value ); 41 free( node ); 42 } 43 } 44 45 void start_runners( cofor_runner * thds, unsigned nprocs, void (*func)(void *) ) { 46 for ( i; nprocs ) { 47 thds[i].func = func; 48 } 49 } 50 51 void end_runners( cofor_runner * thds, unsigned nprocs ) { 52 for ( i; nprocs ) { 53 thds[i].done = true; 54 } 55 } 56 57 void send_work( cofor_runner * thds, unsigned nprocs, unsigned & curr_proc, void * value ) { 58 runner_node * node = malloc(); 59 (*node){}; 60 node->value = value; 61 lock( thds[curr_proc].mutex_lock ); 62 insert_last( thds[curr_proc].items, *node ); 63 unlock( thds[curr_proc].mutex_lock ); 64 curr_proc = ( curr_proc + 1 ) % nprocs; 65 } 16 66 17 67 ////////////////////////////////////////////////////////////////////////////////////////// … … 42 92 delete( this.runner ); 43 93 } 44
Note: See TracChangeset
for help on using the changeset viewer.