Changeset adb6b30f for tests/concurrent
- Timestamp:
- Aug 16, 2018, 9:35:06 AM (6 years ago)
- Branches:
- ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, deferred_resn, demangler, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, no_list, persistent-indexer, pthread-emulation, qualifiedEnum
- Children:
- 0c1d240
- Parents:
- 3de9135
- Location:
- tests/concurrent/examples
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
tests/concurrent/examples/boundedBufferEXT.c
r3de9135 radb6b30f 8 8 // Created On : Wed Apr 18 22:52:12 2018 9 9 // Last Modified By : Peter A. Buhr 10 // Last Modified On : Wed May 2 16:12:58201811 // Update Count : 710 // Last Modified On : Thu Aug 16 08:17:03 2018 11 // Update Count : 8 12 12 // 13 13 … … 73 73 void main( Consumer & cons ) with( cons ) { 74 74 sum = 0; 75 for ( ;;) {75 for () { 76 76 yield( random( 5 ) ); 77 77 int item = remove( buffer ); -
tests/concurrent/examples/boundedBufferINT.c
r3de9135 radb6b30f 8 8 // Created On : Mon Oct 30 12:45:13 2017 9 9 // Last Modified By : Peter A. Buhr 10 // Last Modified On : Thu A pr 26 23:08:17201811 // Update Count : 8 210 // Last Modified On : Thu Aug 16 08:17:58 2018 11 // Update Count : 83 12 12 // 13 13 … … 74 74 void main( Consumer & cons ) with( cons ) { 75 75 sum = 0; 76 for ( ;;) {76 for () { 77 77 yield( random( 5 ) ); 78 78 int item = remove( buffer ); -
tests/concurrent/examples/quickSort.c
r3de9135 radb6b30f 9 9 // Created On : Wed Dec 6 12:15:52 2017 10 10 // Last Modified By : Peter A. Buhr 11 // Last Modified On : T ue Jan 30 15:58:58201812 // Update Count : 16 211 // Last Modified On : Thu Aug 16 08:17:41 2018 12 // Update Count : 163 13 13 // 14 14 … … 131 131 132 132 if ( &unsortedfile ) { // generate output ? 133 for ( ;;) {133 for () { 134 134 unsortedfile | size; // read number of elements in the list 135 135 if ( eof( unsortedfile ) ) break;
Note: See TracChangeset
for help on using the changeset viewer.