Lines Matching refs:dnode_t
44 * Such a macro would interfere with the dnode_t struct definition.
73 static dnode_t *dnode_alloc(void *context);
74 static void dnode_free(dnode_t *node, void *context);
83 static void rotate_left(dnode_t *upper)
85 dnode_t *lower, *lowleft, *upparent;
112 static void rotate_right(dnode_t *upper)
114 dnode_t *lower, *lowright, *upparent;
138 static void free_nodes(dict_t *dict, dnode_t *node, dnode_t *nil)
158 dnode_t *first, *next;
191 static unsigned int verify_redblack(dnode_t *nil, dnode_t *root)
222 static dictcount_t verify_node_count(dnode_t *nil, dnode_t *root)
239 static int verify_dict_has_node(dnode_t *nil, dnode_t *root, dnode_t *node)
311 dnode_t *nil = dict_nil(dict), *root = dict_root(dict);
397 dnode_t *nil = dict_nil(dict), *root = dict_root(dict);
454 dnode_t *dict_lookup(dict_t *dict, const void *key)
456 dnode_t *root = dict_root(dict);
457 dnode_t *nil = dict_nil(dict);
458 dnode_t *saved;
493 dnode_t *dict_lower_bound(dict_t *dict, const void *key)
495 dnode_t *root = dict_root(dict);
496 dnode_t *nil = dict_nil(dict);
497 dnode_t *tentative = 0;
525 dnode_t *dict_upper_bound(dict_t *dict, const void *key)
527 dnode_t *root = dict_root(dict);
528 dnode_t *nil = dict_nil(dict);
529 dnode_t *tentative = 0;
561 void dict_insert(dict_t *dict, dnode_t *node, const void *key)
563 dnode_t *where = dict_root(dict), *nil = dict_nil(dict);
564 dnode_t *parent = nil, *uncle, *grandpa;
659 dnode_t *dict_delete(dict_t *dict, dnode_t *delete)
661 dnode_t *nil = dict_nil(dict), *child, *delparent = delete->parent;
681 dnode_t *next = dict_next(dict, delete);
682 dnode_t *nextparent = next->parent;
751 dnode_t *parent, *sister;
836 dnode_t *node = dict->allocnode(dict->context);
847 void dict_delete_free(dict_t *dict, dnode_t *node)
859 dnode_t *dict_first(dict_t *dict)
861 dnode_t *nil = dict_nil(dict), *root = dict_root(dict), *left;
875 dnode_t *dict_last(dict_t *dict)
877 dnode_t *nil = dict_nil(dict), *root = dict_root(dict), *right;
893 dnode_t *dict_next(dict_t *dict, dnode_t *curr)
895 dnode_t *nil = dict_nil(dict), *parent, *left;
919 dnode_t *dict_prev(dict_t *dict, dnode_t *curr)
921 dnode_t *nil = dict_nil(dict), *parent, *right;
967 int dict_contains(dict_t *dict, dnode_t *node)
972 static dnode_t *dnode_alloc(void *context EXT2FS_ATTR((unused)))
977 static void dnode_free(dnode_t *node, void *context EXT2FS_ATTR((unused)))
982 dnode_t *dnode_create(void *data)
984 dnode_t *new = malloc(sizeof *new);
994 dnode_t *dnode_init(dnode_t *dnode, void *data)
1003 void dnode_destroy(dnode_t *dnode)
1009 void *dnode_get(dnode_t *dnode)
1014 const void *dnode_getkey(dnode_t *dnode)
1020 void dnode_put(dnode_t *dnode, void *data)
1025 int dnode_is_in_a_dict(dnode_t *dnode)
1032 dnode_t *node = dict_first(dict), *next;
1057 void dict_load_next(dict_load_t *load, dnode_t *newnode, const void *key)
1060 dnode_t *nil = &load->nilnode;
1084 dnode_t *tree[DICT_DEPTH_MAX] = { 0 };
1085 dnode_t *curr, *dictnil = dict_nil(dict), *loadnil = &load->nilnode, *next;
1086 dnode_t *complete = 0;
1165 dnode_t *leftnode = dict_first(dest), *rightnode = dict_first(source);
1192 dnode_t *next = dict_next(dest, leftnode);
1203 dnode_t *next = dict_next(source, rightnode);
1268 static dnode_t *new_node(void *c)
1270 static dnode_t few[5];
1279 static void del_node(dnode_t *n, void *c)
1290 dnode_t *dn;
1355 dnode_t *dn;
