1 #include "lfds610_queue_internal.h"
7 /****************************************************************************/
8 void lfds610_queue_delete( struct lfds610_queue_state *qs, void (*user_data_delete_function)(void *user_data, void *user_state), void *user_state )
14 // TRD : user_data_delete_function can be NULL
15 // TRD : user_state can be NULL
17 // TRD : leading load barrier not required as it will be performed by the dequeue
19 while( lfds610_queue_dequeue(qs, &user_data) )
20 if( user_data_delete_function != NULL )
21 user_data_delete_function( user_data, user_state );
23 /* TRD : fully dequeuing will leave us
24 with a single dummy element
25 which both qs->enqueue and qs->dequeue point at
26 we push this back onto the lfds610_freelist
27 before we delete the lfds610_freelist
30 lfds610_freelist_push( qs->fs, qs->enqueue[LFDS610_QUEUE_POINTER]->fe );
32 lfds610_freelist_delete( qs->fs, lfds610_queue_internal_freelist_delete_function, NULL );
34 lfds610_liblfds_aligned_free( qs );
43 /****************************************************************************/
44 #pragma warning( disable : 4100 )
46 void lfds610_queue_internal_freelist_delete_function( void *user_data, void *user_state )
48 assert( user_data != NULL );
49 assert( user_state == NULL );
51 lfds610_liblfds_aligned_free( user_data );
56 #pragma warning( default : 4100 )