29 void set_node_mask(int node, int val)  in set_node_mask()  argument
31 	unsigned int *p = &node_mask[node / 32];  in set_node_mask()
32 	unsigned int bit = 1u << (node % 32);  in set_node_mask()
38 int get_node_mask(int node)  in get_node_mask()  argument
40 	unsigned int *p = &node_mask[node / 32];  in get_node_mask()
41 	unsigned int bit = 1u << (node % 32);  in get_node_mask()
77 void visit_node(struct rbnode *node, void *cookie)  in visit_node()  argument
83 	walked_nodes[*nwalked] = node;  in visit_node()
92 void check_rbnode(struct rbnode *node, int blacks_above)  in check_rbnode()  argument
94 	int side, bheight = blacks_above + z_rb_is_black(node);  in check_rbnode()
97 		struct rbnode *ch = z_rb_child(node, side);  in check_rbnode()
102 				_CHECK(node_lessthan(ch, node));  in check_rbnode()
104 				_CHECK(node_lessthan(node, ch));  in check_rbnode()
108 			_CHECK(z_rb_is_black(node) || z_rb_is_black(ch));  in check_rbnode()
189 void checked_insert(struct rbtree *tree, struct rbnode *node)  in checked_insert()  argument
191 	current_insertee = node;  in checked_insert()
192 	rb_insert(tree, node);  in checked_insert()
210 			int node = next_rand_mod(size);  in test_tree()  local
212 			if (!get_node_mask(node)) {  in test_tree()
213 				rb_insert(&tree, &nodes[node]);  in test_tree()
214 				set_node_mask(node, 1);  in test_tree()
216 				rb_remove(&tree, &nodes[node]);  in test_tree()
217 				set_node_mask(node, 0);  in test_tree()