1 #include "lfds601_queue_internal.h"
\r
7 /****************************************************************************/
\r
8 int lfds601_queue_new( struct lfds601_queue_state **qs, lfds601_atom_t number_elements )
\r
13 struct lfds601_queue_element
\r
14 *qe[LFDS601_QUEUE_PAC_SIZE];
\r
16 assert( qs != NULL );
\r
17 // TRD : number_elements can be any value in its range
\r
19 *qs = (struct lfds601_queue_state *) lfds601_abstraction_aligned_malloc( sizeof(struct lfds601_queue_state), LFDS601_ALIGN_DOUBLE_POINTER );
\r
23 // TRD : the size of the lfds601_freelist is the size of the lfds601_queue (+1 for the leading dummy element, which is hidden from the caller)
\r
24 lfds601_freelist_new( &(*qs)->fs, number_elements+1, lfds601_queue_internal_freelist_init_function, NULL );
\r
26 if( (*qs)->fs != NULL )
\r
28 lfds601_queue_internal_new_element_from_freelist( *qs, qe, NULL );
\r
29 (*qs)->enqueue[LFDS601_QUEUE_POINTER] = (*qs)->dequeue[LFDS601_QUEUE_POINTER] = qe[LFDS601_QUEUE_POINTER];
\r
30 (*qs)->aba_counter = 0;
\r
34 if( (*qs)->fs == NULL )
\r
36 lfds601_abstraction_aligned_free( *qs );
\r
48 /****************************************************************************/
\r
49 #pragma warning( disable : 4100 )
\r
51 int lfds601_queue_internal_freelist_init_function( void **user_data, void *user_state )
\r
56 assert( user_data != NULL );
\r
57 assert( user_state == NULL );
\r
59 *user_data = lfds601_abstraction_aligned_malloc( sizeof(struct lfds601_queue_element), LFDS601_ALIGN_DOUBLE_POINTER );
\r
61 if( *user_data != NULL )
\r
67 #pragma warning( default : 4100 )
\r
73 /****************************************************************************/
\r
74 void lfds601_queue_internal_new_element_from_freelist( struct lfds601_queue_state *qs, struct lfds601_queue_element *qe[LFDS601_QUEUE_PAC_SIZE], void *user_data )
\r
76 struct lfds601_freelist_element
\r
79 assert( qs != NULL );
\r
80 assert( qe != NULL );
\r
81 // TRD : user_data can be any value in its range
\r
83 qe[LFDS601_QUEUE_POINTER] = NULL;
\r
85 lfds601_freelist_pop( qs->fs, &fe );
\r
88 lfds601_queue_internal_init_element( qs, qe, fe, user_data );
\r
97 /****************************************************************************/
\r
98 void lfds601_queue_internal_guaranteed_new_element_from_freelist( struct lfds601_queue_state *qs, struct lfds601_queue_element *qe[LFDS601_QUEUE_PAC_SIZE], void *user_data )
\r
100 struct lfds601_freelist_element
\r
103 assert( qs != NULL );
\r
104 assert( qe != NULL );
\r
105 // TRD : user_data can be any value in its range
\r
107 qe[LFDS601_QUEUE_POINTER] = NULL;
\r
109 lfds601_freelist_guaranteed_pop( qs->fs, &fe );
\r
112 lfds601_queue_internal_init_element( qs, qe, fe, user_data );
\r
121 /****************************************************************************/
\r
122 void lfds601_queue_internal_init_element( struct lfds601_queue_state *qs, struct lfds601_queue_element *qe[LFDS601_QUEUE_PAC_SIZE], struct lfds601_freelist_element *fe, void *user_data )
\r
124 assert( qs != NULL );
\r
125 assert( qe != NULL );
\r
126 assert( fe != NULL );
\r
127 // TRD : user_data can be any value in its range
\r
129 lfds601_freelist_get_user_data_from_element( fe, (void **) &qe[LFDS601_QUEUE_POINTER] );
\r
130 qe[LFDS601_QUEUE_COUNTER] = (struct lfds601_queue_element *) lfds601_abstraction_increment( (lfds601_atom_t *) &qs->aba_counter );
\r
132 qe[LFDS601_QUEUE_POINTER]->next[LFDS601_QUEUE_POINTER] = NULL;
\r
133 qe[LFDS601_QUEUE_POINTER]->next[LFDS601_QUEUE_COUNTER] = (struct lfds601_queue_element *) lfds601_abstraction_increment( (lfds601_atom_t *) &qs->aba_counter );
\r
135 qe[LFDS601_QUEUE_POINTER]->fe = fe;
\r
136 qe[LFDS601_QUEUE_POINTER]->user_data = user_data;
\r