H A D | dict.c | 93 the sentinel nil node, and root->parent->left points back to root */ in rotate_left() 135 static void free_nodes(dict_t *dict, dnode_t *node, dnode_t *nil) in free_nodes() argument 137 if (node == nil) in free_nodes() 139 free_nodes(dict, node->left, nil); in free_nodes() 140 free_nodes(dict, node->right, nil); in free_nodes() 182 * mismatches. It does not check for every nil node being black, because there 183 * is only one sentinel nil node. The return value of this function is the 187 static unsigned int verify_redblack(dnode_t *nil, dnode_t *root) in verify_redblack() argument 191 if (root != nil) { in verify_redblack() 192 height_left = verify_redblack(nil, roo in verify_redblack() 217 verify_node_count(dnode_t *nil, dnode_t *root) verify_node_count() argument 233 verify_dict_has_node(dnode_t *nil, dnode_t *root, dnode_t *node) verify_dict_has_node() argument 300 dnode_t *nil = dict_nil(dict), *root = dict_root(dict); dict_free_nodes() local 382 dnode_t *nil = dict_nil(dict), *root = dict_root(dict); dict_verify() local 441 dnode_t *nil = dict_nil(dict); dict_lookup() local 479 dnode_t *nil = dict_nil(dict); dict_lower_bound() local 510 dnode_t *nil = dict_nil(dict); dict_upper_bound() local 544 dnode_t *where = dict_root(dict), *nil = dict_nil(dict); dict_insert() local 641 dnode_t *nil = dict_nil(dict), *child, *delparent = delete->parent; dict_delete() local 839 dnode_t *nil = dict_nil(dict), *root = dict_root(dict), *left; dict_first() local 854 dnode_t *nil = dict_nil(dict), *root = dict_root(dict), *right; dict_last() local 871 dnode_t *nil = dict_nil(dict), *parent, *left; dict_next() local 896 dnode_t *nil = dict_nil(dict), *parent, *right; dict_prev() local 1039 dnode_t *nil = &load->nilnode; dict_load_next() local [all...] |