Home
last modified time | relevance | path

Searched refs:raxNode (Results 1 – 4 of 4) sorted by relevance

/f-stack/app/redis-5.0.5/src/
H A Drax.c178 ((n)->iscompr ? sizeof(raxNode*) : sizeof(raxNode*)*(n)->size)+ \
217 raxNode *raxReallocForData(raxNode *n, void *data) { in raxReallocForData()
254 raxNode *raxAddChild(raxNode *n, unsigned char c, raxNode **childptr, raxNode ***parentlink) { in raxAddChild()
380 raxNode **childfield = (raxNode**)(src+sizeof(raxNode*)*pos); in raxAddChild()
395 raxNode *raxCompressNode(raxNode *n, unsigned char *s, size_t len, raxNode **child) { in raxCompressNode()
407 newsize = sizeof(raxNode)+len+raxPadding(len)+sizeof(raxNode*); in raxCompressNode()
917 raxNode *h; in raxFind()
932 raxNode **raxFindParentLink(raxNode *parent, raxNode *child) { in raxFindParentLink()
934 raxNode *c; in raxFindParentLink()
947 raxNode *raxRemoveChild(raxNode *parent, raxNode *child) { in raxRemoveChild()
[all …]
H A Drax.h98 typedef struct raxNode { struct
131 } raxNode; typedef
134 raxNode *head;
165 typedef int (*raxNodeCallback)(raxNode **noderef);
183 raxNode *node; /* Current node. Only for unsafe iteration. */
209 unsigned long raxTouch(raxNode *n);
214 void raxSetData(raxNode *n, void *data);
H A Ddefrag.c597 int defragRaxNode(raxNode **noderef) { in defragRaxNode()
598 raxNode *newnode = activeDefragAlloc(*noderef); in defragRaxNode()
H A Dobject.c769 size += rax->numnodes * sizeof(raxNode); in streamRadixTreeMemoryUsage()