27 	struct rb_node node;  member
67 	struct rb_node *node;  in regcache_rbtree_lookup()  local
79 	node = rbtree_ctx->root.rb_node;  in regcache_rbtree_lookup()
80 	while (node) {  in regcache_rbtree_lookup()
81 		rbnode = container_of(node, struct regcache_rbtree_node, node);  in regcache_rbtree_lookup()
88 			node = node->rb_right;  in regcache_rbtree_lookup()
90 			node = node->rb_left;  in regcache_rbtree_lookup()
109 					  node);  in regcache_rbtree_insert()
127 	rb_link_node(&rbnode->node, parent, new);  in regcache_rbtree_insert()
128 	rb_insert_color(&rbnode->node, root);  in regcache_rbtree_insert()
139 	struct rb_node *node;  in rbtree_show()  local
151 	for (node = rb_first(&rbtree_ctx->root); node != NULL;  in rbtree_show()
152 	     node = rb_next(node)) {  in rbtree_show()
153 		n = container_of(node, struct regcache_rbtree_node, node);  in rbtree_show()
245 		rbtree_node = rb_entry(next, struct regcache_rbtree_node, node);  in regcache_rbtree_exit()
246 		next = rb_next(&rbtree_node->node);  in regcache_rbtree_exit()
247 		rb_erase(&rbtree_node->node, &rbtree_ctx->root);  in regcache_rbtree_exit()
312 	struct rb_node *node;  in regcache_rbtree_write()  local
333 		for (node = rb_first(&rbtree_ctx->root); node;  in regcache_rbtree_write()
334 		     node = rb_next(node)) {  in regcache_rbtree_write()
335 			rbnode_tmp = rb_entry(node, struct regcache_rbtree_node,  in regcache_rbtree_write()
336 					      node);  in regcache_rbtree_write()
385 	struct rb_node *node;  in regcache_rbtree_sync()  local
391 	for (node = rb_first(&rbtree_ctx->root); node; node = rb_next(node)) {  in regcache_rbtree_sync()
392 		rbnode = rb_entry(node, struct regcache_rbtree_node, node);  in regcache_rbtree_sync()