fs/f2fs/segment.c

976 	struct discard_cmd *cur_dc, *next_dc;
984 		next_dc = rb_entry(next, struct discard_cmd, rb_node);
986 		if (cur_dc->di.lstart + cur_dc->di.len > next_dc->di.lstart) {
990 				next_dc->di.lstart, next_dc->di.len);
1451 	struct discard_cmd *prev_dc = NULL, *next_dc = NULL;
1460 				&prev_dc, &next_dc, &insert_p, &insert_parent);
1466 		di.len = next_dc ? next_dc->di.lstart - lstart : len;
1483 			if (!next_dc || next_dc->di.lstart > end)
1486 				di.len = next_dc->di.lstart - di.lstart;
1505 		if (next_dc && next_dc->state == D_PREP &&
1506 			next_dc->bdev == bdev &&
1507 			__is_discard_front_mergeable(&di, &next_dc->di,
1509 			next_dc->di.lstart = di.lstart;
1510 			next_dc->di.len += di.len;
1511 			next_dc->di.start = di.start;
1513 			__relocate_discard_cmd(dcc, next_dc);
1523 		prev_dc = next_dc;
1528 		next_dc = rb_entry_safe(node, struct discard_cmd, rb_node);
1569 	struct discard_cmd *prev_dc = NULL, *next_dc = NULL;
1577 				&prev_dc, &next_dc, &insert_p, &insert_parent);
1579 		dc = next_dc;
3221 	struct discard_cmd *prev_dc = NULL, *next_dc = NULL;
3236 				&prev_dc, &next_dc, &insert_p, &insert_parent);
3238 		dc = next_dc;