list.h

#ifndef _LIST_H_
#define _LIST_H_

#include <stdint.h>

typedef uint8_t(*sort_fn_t)(void*, void*);

typedef uint8_t(*identify_fn_t)(void*, void*);

typedef struct list_link_t {
    void* item_ptr; 
    struct list_link_t* next; 
    struct list_link_t* previous; 
} list_link_t;

typedef struct list_t {
    list_link_t* first; 
    list_link_t* last; 
    uint16_t length; 
    uint16_t array_length; 
    list_link_t* links; 
    uint16_t* item_array; 
    uint16_t item_size; 
    sort_fn_t sort_fn; 
    identify_fn_t identify_fn; 
    // the following overhead members are only needed
    // to make the list module faster
    list_link_t * working[2]; 
    list_link_t * unlinked[2]; 
    list_link_t * unused[2]; 
} list_t;

// not interrupt safe
void List_Init(list_t* list, uint16_t item_size, void* item_array, uint16_t item_array_length, list_link_t* link_array);

void List_SetSortFunction(list_t* list, uint8_t(*sort_fn)(void* a, void* b));

void List_SetIdentifyFunction(list_t* list, uint8_t(*identify_fn)(void* identifier, void* item));

// not interrupt safe
void* List_AddAndLink(list_t* list, void* item);

void* List_Add(list_t* list, void* item);

void* List_AddIndirect(list_t* list);

// not interrupt safe
void List_Link(list_t* list);

// not interrupt safe
void List_ResortFirst(list_t* list);

// not interrupt safe
void List_ResortLast(list_t* list);

// not interrupt safe
void List_LinkItem(list_t* list, void* item);

void* List_GetFirst(list_t* list);

void* List_GetLast(list_t* list);

void* List_GetNext(list_t* list, void* item);

void* List_GetItem(list_t* list, void* identifier);

void List_RemoveFirst(list_t* list);

void List_RemoveLast(list_t* list);

void List_Remove(list_t* list, void* item);

void List_RemoveAll(list_t* list);

void List_UnlinkItem(list_t* list, void* item);

void List_UnlinkFirst(list_t* list);

void List_UnlinkLast(list_t* list);


#endif //_LIST_H_