7 /****************************************************************************/
8 void test_lfds600_queue( void )
14 queue_test_enqueuing();
15 queue_test_dequeuing();
16 queue_test_enqueuing_and_dequeuing();
17 queue_test_rapid_enqueuing_and_dequeuing();
26 /****************************************************************************/
27 void queue_test_enqueuing( void )
36 struct lfds600_queue_state
39 struct queue_test_enqueuing_state
48 struct lfds600_validation_info
49 vi = { 1000000, 1000000 };
51 enum data_structure_validity
54 /* TRD : create an empty queue with 1,000,000 elements in its freelist
55 then run one thread per CPU
56 where each thread busy-works, enqueuing elements (until there are no more elements)
57 each element's void pointer of user data is (thread number | element number)
58 where element_number is a thread-local counter starting at 0
59 where the thread_number occupies the top byte
61 when we're done, we check that all the elements are present
62 and increment on a per-thread basis
65 internal_display_test_name( "Enqueuing" );
67 cpu_count = abstraction_cpu_count();
69 lfds600_queue_new( &qs, 1000000 );
71 qtes = malloc( sizeof(struct queue_test_enqueuing_state) * cpu_count );
73 for( loop = 0 ; loop < cpu_count ; loop++ )
76 (qtes+loop)->counter = (lfds600_atom_t) loop << (sizeof(lfds600_atom_t)*8-8);
79 thread_handles = malloc( sizeof(thread_state_t) * cpu_count );
81 for( loop = 0 ; loop < cpu_count ; loop++ )
82 abstraction_thread_start( &thread_handles[loop], loop, queue_test_internal_thread_simple_enqueuer, qtes+loop );
84 for( loop = 0 ; loop < cpu_count ; loop++ )
85 abstraction_thread_wait( thread_handles[loop] );
87 free( thread_handles );
91 /* TRD : first, validate the queue
94 we expect to find element numbers increment on a per thread basis
97 lfds600_queue_query( qs, LFDS600_QUEUE_QUERY_VALIDATE, &vi, dvs );
99 per_thread_counters = malloc( sizeof(lfds600_atom_t) * cpu_count );
101 for( loop = 0 ; loop < cpu_count ; loop++ )
102 *(per_thread_counters+loop) = 0;
104 while( dvs[0] == VALIDITY_VALID and dvs[1] == VALIDITY_VALID and lfds600_queue_dequeue(qs, (void *) &user_data) )
106 thread = user_data >> (sizeof(lfds600_atom_t)*8-8);
107 count = (user_data << 8) >> 8;
109 if( thread >= cpu_count )
111 dvs[0] = VALIDITY_INVALID_TEST_DATA;
115 if( count < per_thread_counters[thread] )
116 dvs[0] = VALIDITY_INVALID_ADDITIONAL_ELEMENTS;
118 if( count > per_thread_counters[thread] )
119 dvs[0] = VALIDITY_INVALID_MISSING_ELEMENTS;
121 if( count == per_thread_counters[thread] )
122 per_thread_counters[thread]++;
125 free( per_thread_counters );
127 lfds600_queue_delete( qs, NULL, NULL );
129 internal_display_test_result( 2, "queue", dvs[0], "queue freelist", dvs[1] );
138 /****************************************************************************/
139 thread_return_t CALLING_CONVENTION queue_test_internal_thread_simple_enqueuer( void *queue_test_enqueuing_state )
141 struct queue_test_enqueuing_state
144 assert( queue_test_enqueuing_state != NULL );
146 qtes = (struct queue_test_enqueuing_state *) queue_test_enqueuing_state;
148 // TRD : top byte of counter is already our thread number
149 while( lfds600_queue_enqueue(qtes->qs, (void *) qtes->counter++) );
151 return( (thread_return_t) EXIT_SUCCESS );
158 /****************************************************************************/
159 void queue_test_dequeuing( void )
168 struct lfds600_queue_state
171 struct queue_test_dequeuing_state
174 struct lfds600_validation_info
177 enum data_structure_validity
180 /* TRD : create a queue with 1,000,000 elements
182 use a single thread to enqueue every element
183 each elements user data is an incrementing counter
185 then run one thread per CPU
186 where each busy-works dequeuing
188 when an element is dequeued, we check (on a per-thread basis) the
189 value deqeued is greater than the element previously dequeued
192 internal_display_test_name( "Dequeuing" );
194 cpu_count = abstraction_cpu_count();
196 lfds600_queue_new( &qs, 1000000 );
198 for( loop = 0 ; loop < 1000000 ; loop++ )
199 lfds600_queue_enqueue( qs, (void *) (lfds600_atom_t) loop );
201 qtds = malloc( sizeof(struct queue_test_dequeuing_state) * cpu_count );
203 for( loop = 0 ; loop < cpu_count ; loop++ )
205 (qtds+loop)->qs = qs;
206 (qtds+loop)->error_flag = LOWERED;
209 thread_handles = malloc( sizeof(thread_state_t) * cpu_count );
211 for( loop = 0 ; loop < cpu_count ; loop++ )
212 abstraction_thread_start( &thread_handles[loop], loop, queue_test_internal_thread_simple_dequeuer, qtds+loop );
214 for( loop = 0 ; loop < cpu_count ; loop++ )
215 abstraction_thread_wait( thread_handles[loop] );
217 free( thread_handles );
219 // TRD : check queue is empty
220 lfds600_queue_query( qs, LFDS600_QUEUE_QUERY_VALIDATE, (void *) &vi, (void *) dvs );
222 // TRD : check for raised error flags
223 for( loop = 0 ; loop < cpu_count ; loop++ )
224 if( (qtds+loop)->error_flag == RAISED )
225 dvs[0] = VALIDITY_INVALID_TEST_DATA;
229 lfds600_queue_delete( qs, NULL, NULL );
231 internal_display_test_result( 2, "queue", dvs[0], "queue freelist", dvs[1] );
240 /****************************************************************************/
241 thread_return_t CALLING_CONVENTION queue_test_internal_thread_simple_dequeuer( void *queue_test_dequeuing_state )
243 struct queue_test_dequeuing_state
250 assert( queue_test_dequeuing_state != NULL );
252 qtds = (struct queue_test_dequeuing_state *) queue_test_dequeuing_state;
254 lfds600_queue_dequeue( qtds->qs, (void *) &prev_user_data );
256 while( lfds600_queue_dequeue(qtds->qs, (void *) &user_data) )
258 if( user_data <= prev_user_data )
259 qtds->error_flag = RAISED;
261 prev_user_data = user_data;
264 return( (thread_return_t) EXIT_SUCCESS );
271 /****************************************************************************/
272 void queue_test_enqueuing_and_dequeuing( void )
282 struct lfds600_queue_state
285 struct queue_test_enqueuing_and_dequeuing_state
288 struct lfds600_validation_info
291 enum data_structure_validity
294 internal_display_test_name( "Enqueuing and dequeuing (10 seconds)" );
296 cpu_count = abstraction_cpu_count();
298 lfds600_queue_new( &qs, cpu_count );
300 qteds = malloc( sizeof(struct queue_test_enqueuing_and_dequeuing_state) * cpu_count );
302 for( loop = 0 ; loop < cpu_count ; loop++ )
304 (qteds+loop)->qs = qs;
305 (qteds+loop)->thread_number = loop;
306 (qteds+loop)->counter = (lfds600_atom_t) loop << (sizeof(lfds600_atom_t)*8-8);
307 (qteds+loop)->cpu_count = cpu_count;
308 (qteds+loop)->error_flag = LOWERED;
309 (qteds+loop)->per_thread_counters = malloc( sizeof(lfds600_atom_t) * cpu_count );
311 for( subloop = 0 ; subloop < cpu_count ; subloop++ )
312 *((qteds+loop)->per_thread_counters+subloop) = 0;
315 thread_handles = malloc( sizeof(thread_state_t) * cpu_count );
317 for( loop = 0 ; loop < cpu_count ; loop++ )
318 abstraction_thread_start( &thread_handles[loop], loop, queue_test_internal_thread_enqueuer_and_dequeuer, qteds+loop );
320 for( loop = 0 ; loop < cpu_count ; loop++ )
321 abstraction_thread_wait( thread_handles[loop] );
323 free( thread_handles );
325 lfds600_queue_query( qs, LFDS600_QUEUE_QUERY_VALIDATE, (void *) &vi, (void *) dvs );
327 for( loop = 0 ; loop < cpu_count ; loop++ )
328 if( (qteds+loop)->error_flag == RAISED )
329 dvs[0] = VALIDITY_INVALID_TEST_DATA;
331 for( loop = 0 ; loop < cpu_count ; loop++ )
332 free( (qteds+loop)->per_thread_counters );
336 lfds600_queue_delete( qs, NULL, NULL );
338 internal_display_test_result( 2, "queue", dvs[0], "queue freelist", dvs[1] );
347 /****************************************************************************/
348 thread_return_t CALLING_CONVENTION queue_test_internal_thread_enqueuer_and_dequeuer( void *queue_test_enqueuing_and_dequeuing_state )
350 struct queue_test_enqueuing_and_dequeuing_state
361 assert( queue_test_enqueuing_and_dequeuing_state != NULL );
363 qteds = (struct queue_test_enqueuing_and_dequeuing_state *) queue_test_enqueuing_and_dequeuing_state;
367 while( time(NULL) < start_time + 10 )
369 lfds600_queue_enqueue( qteds->qs, (void *) (qteds->counter++) );
370 lfds600_queue_dequeue( qteds->qs, (void *) &user_data );
372 thread = user_data >> (sizeof(lfds600_atom_t)*8-8);
373 count = (user_data << 8) >> 8;
375 if( thread >= qteds->cpu_count )
376 qteds->error_flag = RAISED;
379 if( count < qteds->per_thread_counters[thread] )
380 qteds->error_flag = RAISED;
382 if( count >= qteds->per_thread_counters[thread] )
383 qteds->per_thread_counters[thread] = count+1;
387 return( (thread_return_t) EXIT_SUCCESS );
394 /****************************************************************************/
395 void queue_test_rapid_enqueuing_and_dequeuing( void )
404 struct lfds600_queue_state
407 struct queue_test_rapid_enqueuing_and_dequeuing_state
410 struct lfds600_validation_info
411 vi = { 50000, 50000 };
417 *per_thread_counters;
419 enum data_structure_validity
422 internal_display_test_name( "Rapid enqueuing and dequeuing (10 seconds)" );
424 cpu_count = abstraction_cpu_count();
426 lfds600_queue_new( &qs, 100000 );
428 for( loop = 0 ; loop < 50000 ; loop++ )
429 lfds600_queue_enqueue( qs, NULL );
431 qtreds = malloc( sizeof(struct queue_test_rapid_enqueuing_and_dequeuing_state) * cpu_count );
433 for( loop = 0 ; loop < cpu_count ; loop++ )
435 (qtreds+loop)->qs = qs;
436 (qtreds+loop)->counter = (lfds600_atom_t) loop << (sizeof(lfds600_atom_t)*8-8);
439 thread_handles = malloc( sizeof(thread_state_t) * cpu_count );
441 for( loop = 0 ; loop < cpu_count ; loop++ )
442 abstraction_thread_start( &thread_handles[loop], loop, queue_test_internal_thread_rapid_enqueuer_and_dequeuer, qtreds+loop );
444 for( loop = 0 ; loop < cpu_count ; loop++ )
445 abstraction_thread_wait( thread_handles[loop] );
447 free( thread_handles );
449 lfds600_queue_query( qs, LFDS600_QUEUE_QUERY_VALIDATE, (void *) &vi, (void *) dvs );
451 // TRD : now check results
452 per_thread_counters = malloc( sizeof(lfds600_atom_t) * cpu_count );
454 for( loop = 0 ; loop < cpu_count ; loop++ )
455 *(per_thread_counters+loop) = 0;
457 while( dvs[0] == VALIDITY_VALID and dvs[1] == VALIDITY_VALID and lfds600_queue_dequeue(qs, (void *) &user_data) )
459 thread = user_data >> (sizeof(lfds600_atom_t)*8-8);
460 count = (user_data << 8) >> 8;
462 if( thread >= cpu_count )
464 dvs[0] = VALIDITY_INVALID_TEST_DATA;
468 if( per_thread_counters[thread] == 0 )
469 per_thread_counters[thread] = count;
471 if( count < per_thread_counters[thread] )
472 dvs[0] = VALIDITY_INVALID_ADDITIONAL_ELEMENTS;
474 if( count >= per_thread_counters[thread] )
475 per_thread_counters[thread] = count+1;
478 free( per_thread_counters );
482 lfds600_queue_delete( qs, NULL, NULL );
484 internal_display_test_result( 2, "queue", dvs[0], "queue freelist", dvs[1] );
493 /****************************************************************************/
494 thread_return_t CALLING_CONVENTION queue_test_internal_thread_rapid_enqueuer_and_dequeuer( void *queue_test_rapid_enqueuing_and_dequeuing_state )
496 struct queue_test_rapid_enqueuing_and_dequeuing_state
505 assert( queue_test_rapid_enqueuing_and_dequeuing_state != NULL );
507 qtreds = (struct queue_test_rapid_enqueuing_and_dequeuing_state *) queue_test_rapid_enqueuing_and_dequeuing_state;
511 while( time(NULL) < start_time + 10 )
513 lfds600_queue_enqueue( qtreds->qs, (void *) (qtreds->counter++) );
514 lfds600_queue_dequeue( qtreds->qs, (void *) &user_data );
517 return( (thread_return_t) EXIT_SUCCESS );