- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
tests/concurrency/examples/boundedBufferTHREAD.cfa
r0048327 rc26bea2a 10 10 // Created On : Wed Apr 18 22:52:12 2018 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Wed Nov 5 08:05:24 202513 // Update Count : 2 812 // Last Modified On : Thu Jan 16 23:09:43 2020 13 // Update Count : 25 14 14 // 15 15 16 #include <stdlib.hfa> // random 16 17 #include <fstream.hfa> 17 18 #include <kernel.hfa> … … 64 65 void main( Producer & prod ) with( prod ) { 65 66 for ( i; 1 ~= N ) { 66 yield( prng( 5 ) );67 yield( random( 5 ) ); 67 68 insert( buffer, 1 ); 68 69 } // for … … 80 81 sum = 0; 81 82 for () { 82 yield( prng( 5 ) );83 yield( random( 5 ) ); 83 84 int item = remove( buffer ); 84 85 if ( item == Sentinel ) break; // sentinel ? … … 100 101 processor p; 101 102 102 set_seed( 1003 ); 103 //srandom( getpid() ); 104 srandom( 1003 ); 103 105 104 106 for ( i; Cons ) { // create consumers 105 cons[i] = new( &buffer, sums[i] ); // NEW CANNOT HANDLE BUFFER REFERENCE107 cons[i] = new( &buffer, sums[i] ); 106 108 } // for 107 109 for ( i; Prods ) { // create producers
Note:
See TracChangeset
for help on using the changeset viewer.