1049 	struct discard_cmd *cur_dc, *next_dc;  in f2fs_check_discard_tree()  local
1057 		next_dc = rb_entry(next, struct discard_cmd, rb_node);  in f2fs_check_discard_tree()
1059 		if (cur_dc->di.lstart + cur_dc->di.len > next_dc->di.lstart) {  in f2fs_check_discard_tree()
1063 				next_dc->di.lstart, next_dc->di.len);  in f2fs_check_discard_tree()
1516 	struct discard_cmd *prev_dc = NULL, *next_dc = NULL;  in __update_discard_tree_range()  local
1525 				&prev_dc, &next_dc, &insert_p, &insert_parent);  in __update_discard_tree_range()
1531 		di.len = next_dc ? next_dc->di.lstart - lstart : len;  in __update_discard_tree_range()
1548 			if (!next_dc || next_dc->di.lstart > end)  in __update_discard_tree_range()
1551 				di.len = next_dc->di.lstart - di.lstart;  in __update_discard_tree_range()
1570 		if (next_dc && next_dc->state == D_PREP &&  in __update_discard_tree_range()
1571 			next_dc->bdev == bdev &&  in __update_discard_tree_range()
1572 			__is_discard_front_mergeable(&di, &next_dc->di,  in __update_discard_tree_range()
1574 			next_dc->di.lstart = di.lstart;  in __update_discard_tree_range()
1575 			next_dc->di.len += di.len;  in __update_discard_tree_range()
1576 			next_dc->di.start = di.start;  in __update_discard_tree_range()
1578 			__relocate_discard_cmd(dcc, next_dc);  in __update_discard_tree_range()
1588 		prev_dc = next_dc;  in __update_discard_tree_range()
1593 		next_dc = rb_entry_safe(node, struct discard_cmd, rb_node);  in __update_discard_tree_range()
1634 	struct discard_cmd *prev_dc = NULL, *next_dc = NULL;  in __issue_discard_cmd_orderly()  local
1642 				&prev_dc, &next_dc, &insert_p, &insert_parent);  in __issue_discard_cmd_orderly()
1644 		dc = next_dc;  in __issue_discard_cmd_orderly()
3530 	struct discard_cmd *prev_dc = NULL, *next_dc = NULL;  in __issue_discard_cmd_range()  local
3545 				&prev_dc, &next_dc, &insert_p, &insert_parent);  in __issue_discard_cmd_range()
3547 		dc = next_dc;  in __issue_discard_cmd_range()