18 	struct rb_node node;  member
38 	struct rb_node *node = root->rb_node;  in dust_rb_search()  local
40 	while (node) {  in dust_rb_search()
41 		struct badblock *bblk = rb_entry(node, struct badblock, node);  in dust_rb_search()
44 			node = node->rb_left;  in dust_rb_search()
46 			node = node->rb_right;  in dust_rb_search()
62 		bblk = rb_entry(parent, struct badblock, node);  in dust_rb_insert()
72 	rb_link_node(&new->node, parent, link);  in dust_rb_insert()
73 	rb_insert_color(&new->node, root);  in dust_rb_insert()
95 	rb_erase(&bblock->node, &dd->badblocklist);  in dust_remove_block()
195 		rb_erase(&bblk->node, &dd->badblocklist);  in __dust_map_write()
243 	struct rb_node *node = NULL, *nnode = NULL;  in __dust_clear_badblocks()  local
252 		node = nnode;  in __dust_clear_badblocks()
253 		nnode = rb_next(node);  in __dust_clear_badblocks()
254 		rb_erase(node, tree);  in __dust_clear_badblocks()
256 		kfree(node);  in __dust_clear_badblocks()
292 	struct rb_node *node;  in dust_list_badblocks()  local
299 	for (node = rb_first(&badblocklist); node; node = rb_next(node)) {  in dust_list_badblocks()
300 		bblk = rb_entry(node, struct badblock, node);  in dust_list_badblocks()