Home
last modified time | relevance | path

Searched refs:quicklistNode (Results 1 – 6 of 6) sorted by relevance

/f-stack/app/redis-5.0.5/src/
H A Dquicklist.h44 typedef struct quicklistNode { struct
45 struct quicklistNode *prev; argument
46 struct quicklistNode *next; argument
55 } quicklistNode; argument
74 quicklistNode *head;
75 quicklistNode *tail;
84 quicklistNode *current;
92 quicklistNode *node;
159 size_t quicklistGetLzf(const quicklistNode *node, void **data);
H A Dquicklist.c139 quicklistNode *node; in quicklistCreateNode()
157 quicklistNode *current, *next; in quicklistRelease()
797 REDIS_STATIC quicklistNode *_quicklistSplitNode(quicklistNode *node, int offset, in _quicklistSplitNode()
836 quicklistNode *node = entry->node; in _quicklistInsert()
837 quicklistNode *new_node = NULL; in _quicklistInsert()
979 quicklistNode *node = entry.node; in quicklistDelRange()
983 quicklistNode *next = node->next; in quicklistDelRange()
1227 quicklistNode *n; in quicklistIndex()
1343 quicklistNode *node; in quicklistPopCustom()
1488 quicklistNode *prev = NULL; in _itrprintr()
[all …]
H A Dobject.c800 quicklistNode *node = ql->head; in objectComputeSize()
803 elesize += sizeof(quicklistNode)+ziplistBlobLen(node->zl); in objectComputeSize()
H A Ddefrag.c412 quicklistNode *node = ql->head, *newnode; in activeDefragQuickListNodes()
H A Ddebug.c423 for (quicklistNode *node = ql->head; node; node = node->next) { in debugCommand()
H A Drdb.c765 quicklistNode *node = ql->head; in rdbSaveObject()