18 static struct rbnode nodes[MAX_NODES];  variable
23 /* Array of nodes dumped via rb_walk */
48 	return (int)(n - &nodes[0]);  in node_index()
107 			/* Can't have adjacent red nodes */  in check_rbnode()
113 			/* All leaf nodes must be at the same black height */  in check_rbnode()
150 	/* Make sure all found nodes are in-order and marked in the tree */  in _check_tree()
164 	/* Make sure all tree bits properly reflect the set of nodes we found */  in _check_tree()
167 		_CHECK(get_node_mask(i) == rb_contains(&test_rbtree, &nodes[i]));  in _check_tree()
205 	(void)memset(nodes, 0, sizeof(nodes));  in test_tree()
213 				rb_insert(&test_rbtree, &nodes[node]);  in test_tree()
216 				rb_remove(&test_rbtree, &nodes[node]);  in test_tree()
242 		TC_PRINT("Checking trees built from %d nodes...\n", size);  in ZTEST()
265 	(void)memset(nodes, 0, sizeof(nodes));  in ZTEST()
270 		rb_insert(&test_rbtree, &nodes[i]);  in ZTEST()
276 	zassert_true(rb_get_min(&test_rbtree) == &nodes[0], "the tree is invalid");  in ZTEST()
277 	zassert_true(rb_get_max(&test_rbtree) == &nodes[7], "the tree is invalid");  in ZTEST()