diff options
Diffstat (limited to 'source/blender/blenlib/BLI_linklist_lockfree.h')
-rw-r--r-- | source/blender/blenlib/BLI_linklist_lockfree.h | 31 |
1 files changed, 13 insertions, 18 deletions
diff --git a/source/blender/blenlib/BLI_linklist_lockfree.h b/source/blender/blenlib/BLI_linklist_lockfree.h index 0a191b773b9..647b00ec658 100644 --- a/source/blender/blenlib/BLI_linklist_lockfree.h +++ b/source/blender/blenlib/BLI_linklist_lockfree.h @@ -29,18 +29,18 @@ extern "C" { #endif typedef struct LockfreeLinkNode { - struct LockfreeLinkNode *next; - /* NOTE: "Subclass" this structure to add custom-defined data. */ + struct LockfreeLinkNode *next; + /* NOTE: "Subclass" this structure to add custom-defined data. */ } LockfreeLinkNode; typedef struct LockfreeLinkList { - /* We keep a dummy node at the beginning of the list all the time. - * This allows us to make sure head and tail pointers are always - * valid, and saves from annoying exception cases in insert(). - */ - LockfreeLinkNode dummy_node; - /* NOTE: This fields might point to a dummy node. */ - LockfreeLinkNode *head, *tail; + /* We keep a dummy node at the beginning of the list all the time. + * This allows us to make sure head and tail pointers are always + * valid, and saves from annoying exception cases in insert(). + */ + LockfreeLinkNode dummy_node; + /* NOTE: This fields might point to a dummy node. */ + LockfreeLinkNode *head, *tail; } LockfreeLinkList; typedef void (*LockfreeeLinkNodeFreeFP)(void *link); @@ -53,30 +53,25 @@ typedef void (*LockfreeeLinkNodeFreeFP)(void *link); void BLI_linklist_lockfree_init(LockfreeLinkList *list); /* Completely free the whole list, it is NOT re-usable after this. */ -void BLI_linklist_lockfree_free(LockfreeLinkList *list, - LockfreeeLinkNodeFreeFP free_func); +void BLI_linklist_lockfree_free(LockfreeLinkList *list, LockfreeeLinkNodeFreeFP free_func); /* Remove all the elements from the list, keep it usable for further * inserts. */ -void BLI_linklist_lockfree_clear(LockfreeLinkList *list, - LockfreeeLinkNodeFreeFP free_func); - +void BLI_linklist_lockfree_clear(LockfreeLinkList *list, LockfreeeLinkNodeFreeFP free_func); /* Begin iteration of lock-free linked list, starting with a * first user=defined node. Will ignore the dummy node. */ LockfreeLinkNode *BLI_linklist_lockfree_begin(LockfreeLinkList *list); - /* ************************************************************************** */ /* NOTE: These functions are safe for use from threads. */ -void BLI_linklist_lockfree_insert(LockfreeLinkList *list, - LockfreeLinkNode *node); +void BLI_linklist_lockfree_insert(LockfreeLinkList *list, LockfreeLinkNode *node); #ifdef __cplusplus } #endif -#endif /* __BLI_LINKLIST_H__ */ +#endif /* __BLI_LINKLIST_H__ */ |