Lines Matching refs:node_t
14 typedef struct node_s node_t;
19 rb_node(node_t) link;
24 node_cmp(node_t *a, node_t *b) {
42 typedef rb_tree(node_t) tree_t;
43 rb_gen(static, tree_, tree_t, node_t, link, node_cmp);
48 node_t key;
70 tree_recurse(node_t *node, unsigned black_height, unsigned black_depth,
71 node_t *nil)
74 node_t *left_node = rbtn_left_get(node_t, link, node);
75 node_t *right_node = rbtn_right_get(node_t, link, node);
77 if (rbtn_red_get(node_t, link, node) == false)
81 if (rbtn_red_get(node_t, link, node)) {
82 assert_false(rbtn_red_get(node_t, link, left_node),
84 assert_false(rbtn_red_get(node_t, link, right_node),
108 static node_t *
109 tree_iterate_cb(tree_t *tree, node_t *node, void *data)
112 node_t *search_node;
159 node_remove(tree_t *tree, node_t *node, unsigned nnodes)
161 node_t *search_node;
182 rbtn_black_height(node_t, link, tree, black_height);
192 static node_t *
193 remove_iterate_cb(tree_t *tree, node_t *node, void *data)
196 node_t *ret = tree_next(tree, node);
203 static node_t *
204 remove_reverse_iterate_cb(tree_t *tree, node_t *node, void *data)
207 node_t *ret = tree_prev(tree, node);
222 node_t nodes[NNODES];
256 rbtn_black_height(node_t, link, &tree,
288 node_t *start;
301 node_t *start;
