1 #include "lfds601_stack_internal.h"
\r
7 /****************************************************************************/
\r
8 int lfds601_stack_new( struct lfds601_stack_state **ss, lfds601_atom_t number_elements )
\r
13 assert( ss != NULL );
\r
14 // TRD : number_elements can be any value in its range
\r
16 *ss = (struct lfds601_stack_state *) lfds601_abstraction_aligned_malloc( sizeof(struct lfds601_stack_state), LFDS601_ALIGN_DOUBLE_POINTER );
\r
20 // TRD : the size of the lfds601_freelist is the size of the lfds601_stack
\r
21 lfds601_freelist_new( &(*ss)->fs, number_elements, lfds601_stack_internal_freelist_init_function, NULL );
\r
23 if( (*ss)->fs == NULL )
\r
25 lfds601_abstraction_aligned_free( *ss );
\r
29 if( (*ss)->fs != NULL )
\r
31 (*ss)->top[LFDS601_STACK_POINTER] = NULL;
\r
32 (*ss)->top[LFDS601_STACK_COUNTER] = 0;
\r
33 (*ss)->aba_counter = 0;
\r
45 /****************************************************************************/
\r
46 #pragma warning( disable : 4100 )
\r
48 int lfds601_stack_internal_freelist_init_function( void **user_data, void *user_state )
\r
53 assert( user_data != NULL );
\r
54 assert( user_state == NULL );
\r
56 *user_data = lfds601_abstraction_aligned_malloc( sizeof(struct lfds601_stack_element), LFDS601_ALIGN_DOUBLE_POINTER );
\r
58 if( *user_data != NULL )
\r
64 #pragma warning( default : 4100 )
\r
70 /****************************************************************************/
\r
71 void lfds601_stack_internal_new_element_from_freelist( struct lfds601_stack_state *ss, struct lfds601_stack_element *se[LFDS601_STACK_PAC_SIZE], void *user_data )
\r
73 struct lfds601_freelist_element
\r
76 assert( ss != NULL );
\r
77 assert( se != NULL );
\r
78 // TRD : user_data can be any value in its range
\r
80 lfds601_freelist_pop( ss->fs, &fe );
\r
83 se[LFDS601_STACK_POINTER] = NULL;
\r
86 lfds601_stack_internal_init_element( ss, se, fe, user_data );
\r
95 /****************************************************************************/
\r
96 void lfds601_stack_internal_new_element( struct lfds601_stack_state *ss, struct lfds601_stack_element *se[LFDS601_STACK_PAC_SIZE], void *user_data )
\r
98 struct lfds601_freelist_element
\r
101 assert( ss != NULL );
\r
102 assert( se != NULL );
\r
103 // TRD : user_data can be any value in its range
\r
105 lfds601_freelist_guaranteed_pop( ss->fs, &fe );
\r
108 se[LFDS601_STACK_POINTER] = NULL;
\r
111 lfds601_stack_internal_init_element( ss, se, fe, user_data );
\r
120 /****************************************************************************/
\r
121 void lfds601_stack_internal_init_element( struct lfds601_stack_state *ss, struct lfds601_stack_element *se[LFDS601_STACK_PAC_SIZE], struct lfds601_freelist_element *fe, void *user_data )
\r
123 assert( ss != NULL );
\r
124 assert( se != NULL );
\r
125 assert( fe != NULL );
\r
126 // TRD : user_data can be any value in its range
\r
128 lfds601_freelist_get_user_data_from_element( fe, (void **) &se[LFDS601_STACK_POINTER] );
\r
130 se[LFDS601_STACK_COUNTER] = (struct lfds601_stack_element *) lfds601_abstraction_increment( (lfds601_atom_t *) &ss->aba_counter );
\r
132 se[LFDS601_STACK_POINTER]->next[LFDS601_STACK_POINTER] = NULL;
\r
133 se[LFDS601_STACK_POINTER]->next[LFDS601_STACK_COUNTER] = 0;
\r
134 se[LFDS601_STACK_POINTER]->fe = fe;
\r
135 se[LFDS601_STACK_POINTER]->user_data = user_data;
\r