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