r6.1.1:lfds611_stack

Source Files

/liblfds611/src/lfds611_stack/lfds611_stack_delete.c
/liblfds611/src/lfds611_stack/lfds611_stack_new.c
/liblfds611/src/lfds611_stack/lfds611_stack_push_pop.c
/liblfds611/src/lfds611_stack/lfds611_stack_query.c
/liblfds611/src/lfds611_stack/lfds611_stack_internal.h
/liblfds611/inc/liblfds611.h

Incomplete Types

struct lfds611_stack_state;

Enums

enum lfds611_stack_query_type
{
  LFDS611_STACK_QUERY_ELEMENT_COUNT,
  LFDS611_STACK_QUERY_VALIDATE
};

Prototypes

int lfds611_stack_new( struct lfds611_stack_state **ss, lfds611_atom_t number_elements );
void lfds611_stack_use( struct lfds611_stack_state *ss );
void lfds611_stack_delete( struct lfds611_stack_state *ss,
                           void (*user_data_delete_function)(void *user_data, void *user_state),
                           void *user_state );

void lfds611_stack_clear( struct lfds611_stack_state *ss,
                          void (*user_data_clear_function)(void *user_data, void *user_state),
                          void *user_state );

int lfds611_stack_push( struct lfds611_stack_state *ss, void *user_data );
int lfds611_stack_guaranteed_push( struct lfds611_stack_state *ss, void *user_data );
int lfds611_stack_pop( struct lfds611_stack_state *ss, void **user_data );

void lfds611_stack_query( struct lfds611_stack_state *ss, enum lfds611_stack_query_type query_type, void *query_input, void *query_output );

Overview

This API implements a stack. A new stack is instantiated by the lfds611_stack_new function, where the argument number_elements is the maximum number of elements which can be pushed to the stack at any one time. The caller then uses the stack by pushing and popping, via the lfds611_stack_push and lfds611_stack_pop functions, respectively. A push or pop operation will push or pop a single void pointer of user data. These void pointers are expected to point to user allocated state although of course they can be used directly to store a single value. Finally, the stack is deleted using lfds611_stack_delete.

The function lfds611_stack_push only fails when there are no elements available in the stack. In this case, the function lfds611_stack_guaranteed_push can be called. This allocates a single new element and then pushes that element. This permanently increases the maximum number of elements in the stack by one. This function only fails when malloc fails.

Lock-free Specific Behaviour

The maximum number of elements in the stack must be specified when the stack is created and these elements are allocated in full when the stack is created. It is possible after the stack is created to increase the number of elements in the stack, by using the function lfds611_stack_guaranteed_push, but it is never possible to decrease the number of elements in the stack; the stack can only grow.

Algorithm

This freelist implements Treiber's stack algorithm. As such it does not truly scale; contention for entry and exit to and from the stack ultimately reduces performance as the CPU count increases. Indeed, with enough CPUs, performance becomes less than with fewer CPUs, for there are so many threads, they almost always fail in their attempt to enter or leave the stack and so are prevented from doing other work.

There is a far more scalable stack, based on the work done by Hendler, Shavit and Yerushalmi, which I understand (I've not looked at in depth) is basically the Treiber stack but with a layer in front of the stack where any threads which at the same time wish to push and pop can exchange their respective operations (the pusher giving his element to the popper) and so avoid having to touch the stack. I intend to implement this in the future.