41 		struct badblock *bblk = rb_entry(node, struct badblock, node);  in dust_rb_search()  local
43 		if (bblk->bb > blk)  in dust_rb_search()
45 		else if (bblk->bb < blk)  in dust_rb_search()
48 			return bblk;  in dust_rb_search()
56 	struct badblock *bblk;  in dust_rb_insert()  local
62 		bblk = rb_entry(parent, struct badblock, node);  in dust_rb_insert()
64 		if (bblk->bb > value)  in dust_rb_insert()
66 		else if (bblk->bb < value)  in dust_rb_insert()
161 	struct badblock *bblk = dust_rb_search(&dd->badblocklist, thisblock);  in __dust_map_read()  local
163 	if (bblk)  in __dust_map_read()
187 	struct badblock *bblk = dust_rb_search(&dd->badblocklist, thisblock);  in __dust_map_write()  local
189 	if (bblk && bblk->wr_fail_cnt > 0) {  in __dust_map_write()
190 		bblk->wr_fail_cnt--;  in __dust_map_write()
194 	if (bblk) {  in __dust_map_write()
195 		rb_erase(&bblk->node, &dd->badblocklist);  in __dust_map_write()
197 		kfree(bblk);  in __dust_map_write()
293 	struct badblock *bblk;  in dust_list_badblocks()  local
300 		bblk = rb_entry(node, struct badblock, node);  in dust_list_badblocks()
301 		DMEMIT("%llu\n", bblk->bb);  in dust_list_badblocks()