80 lines
2.3 KiB
C
80 lines
2.3 KiB
C
/* adlist.h - A generic doubly linked list implementation
|
|
*
|
|
* Copyright (c) 2006-Present, Redis Ltd.
|
|
* All rights reserved.
|
|
*
|
|
* Licensed under your choice of the Redis Source Available License 2.0
|
|
* (RSALv2) or the Server Side Public License v1 (SSPLv1).
|
|
*/
|
|
|
|
#ifndef __ADLIST_H__
|
|
#define __ADLIST_H__
|
|
|
|
/* Node, List, and Iterator are the only data structures used currently. */
|
|
|
|
typedef struct listNode {
|
|
struct listNode *prev;
|
|
struct listNode *next;
|
|
void *value;
|
|
} listNode;
|
|
|
|
typedef struct listIter {
|
|
listNode *next;
|
|
int direction;
|
|
} listIter;
|
|
|
|
typedef struct list {
|
|
listNode *head;
|
|
listNode *tail;
|
|
void *(*dup)(void *ptr);
|
|
void (*free)(void *ptr);
|
|
int (*match)(void *ptr, void *key);
|
|
unsigned long len;
|
|
} list;
|
|
|
|
/* Functions implemented as macros */
|
|
#define listLength(l) ((l)->len)
|
|
#define listFirst(l) ((l)->head)
|
|
#define listLast(l) ((l)->tail)
|
|
#define listPrevNode(n) ((n)->prev)
|
|
#define listNextNode(n) ((n)->next)
|
|
#define listNodeValue(n) ((n)->value)
|
|
|
|
#define listSetDupMethod(l,m) ((l)->dup = (m))
|
|
#define listSetFreeMethod(l,m) ((l)->free = (m))
|
|
#define listSetMatchMethod(l,m) ((l)->match = (m))
|
|
|
|
#define listGetDupMethod(l) ((l)->dup)
|
|
#define listGetFreeMethod(l) ((l)->free)
|
|
#define listGetMatchMethod(l) ((l)->match)
|
|
|
|
/* Prototypes */
|
|
list *listCreate(void);
|
|
void listRelease(list *list);
|
|
void listEmpty(list *list);
|
|
list *listAddNodeHead(list *list, void *value);
|
|
list *listAddNodeTail(list *list, void *value);
|
|
list *listInsertNode(list *list, listNode *old_node, void *value, int after);
|
|
void listDelNode(list *list, listNode *node);
|
|
listIter *listGetIterator(list *list, int direction);
|
|
listNode *listNext(listIter *iter);
|
|
void listReleaseIterator(listIter *iter);
|
|
list *listDup(list *orig);
|
|
listNode *listSearchKey(list *list, void *key);
|
|
listNode *listIndex(list *list, long index);
|
|
void listRewind(list *list, listIter *li);
|
|
void listRewindTail(list *list, listIter *li);
|
|
void listRotateTailToHead(list *list);
|
|
void listRotateHeadToTail(list *list);
|
|
void listJoin(list *l, list *o);
|
|
void listInitNode(listNode *node, void *value);
|
|
void listLinkNodeHead(list *list, listNode *node);
|
|
void listLinkNodeTail(list *list, listNode *node);
|
|
void listUnlinkNode(list *list, listNode *node);
|
|
|
|
/* Directions for iterators */
|
|
#define AL_START_HEAD 0
|
|
#define AL_START_TAIL 1
|
|
|
|
#endif /* __ADLIST_H__ */
|