978 	struct discard_cmd *cur_dc, *next_dc;  in f2fs_check_discard_tree()  local
986 		next_dc = rb_entry(next, struct discard_cmd, rb_node);  in f2fs_check_discard_tree()
988 		if (cur_dc->di.lstart + cur_dc->di.len > next_dc->di.lstart) {  in f2fs_check_discard_tree()
992 				next_dc->di.lstart, next_dc->di.len);  in f2fs_check_discard_tree()
1457 	struct discard_cmd *prev_dc = NULL, *next_dc = NULL;  in __update_discard_tree_range()  local
1466 				&prev_dc, &next_dc, &insert_p, &insert_parent);  in __update_discard_tree_range()
1472 		di.len = next_dc ? next_dc->di.lstart - lstart : len;  in __update_discard_tree_range()
1489 			if (!next_dc || next_dc->di.lstart > end)  in __update_discard_tree_range()
1492 				di.len = next_dc->di.lstart - di.lstart;  in __update_discard_tree_range()
1511 		if (next_dc && next_dc->state == D_PREP &&  in __update_discard_tree_range()
1512 			next_dc->bdev == bdev &&  in __update_discard_tree_range()
1513 			__is_discard_front_mergeable(&di, &next_dc->di,  in __update_discard_tree_range()
1515 			next_dc->di.lstart = di.lstart;  in __update_discard_tree_range()
1516 			next_dc->di.len += di.len;  in __update_discard_tree_range()
1517 			next_dc->di.start = di.start;  in __update_discard_tree_range()
1519 			__relocate_discard_cmd(dcc, next_dc);  in __update_discard_tree_range()
1529 		prev_dc = next_dc;  in __update_discard_tree_range()
1534 		next_dc = rb_entry_safe(node, struct discard_cmd, rb_node);  in __update_discard_tree_range()
1575 	struct discard_cmd *prev_dc = NULL, *next_dc = NULL;  in __issue_discard_cmd_orderly()  local
1583 				&prev_dc, &next_dc, &insert_p, &insert_parent);  in __issue_discard_cmd_orderly()
1585 		dc = next_dc;  in __issue_discard_cmd_orderly()
3183 	struct discard_cmd *prev_dc = NULL, *next_dc = NULL;  in __issue_discard_cmd_range()  local
3198 				&prev_dc, &next_dc, &insert_p, &insert_parent);  in __issue_discard_cmd_range()
3200 		dc = next_dc;  in __issue_discard_cmd_range()