Lines Matching refs:start
31 u64 start;
113 block_group->start);
207 ino, block_group->start);
552 * If we aren't at the start of the current page, unmap this one and
907 path, block_group->start);
921 block_group->start);
934 block_group->start);
1004 ret = io_ctl_add_entry(io_ctl, trim_entry->start,
1077 u64 start, extent_start, extent_end, len;
1093 start = block_group->start;
1095 while (start < block_group->start + block_group->length) {
1096 ret = find_first_extent_bit(unpin, start,
1103 if (extent_start >= block_group->start + block_group->length)
1106 extent_start = max(extent_start, start);
1107 extent_end = min(block_group->start + block_group->length,
1116 start = extent_end;
1197 block_group->start, ret);
1242 path, block_group->start);
1420 block_group->start, ret);
1457 bitmap_start = offset - ctl->start;
1460 bitmap_start += ctl->start;
1722 unsigned long start, count, end;
1725 start = offset_to_bit(info->offset, ctl->unit, offset);
1727 end = start + count;
1730 bitmap_clear(info->bitmap, start, count);
1736 if (start && test_bit(start - 1, info->bitmap))
1761 unsigned long start, count, end;
1764 start = offset_to_bit(info->offset, ctl->unit, offset);
1766 end = start + count;
1769 bitmap_set(info->bitmap, start, count);
1774 if (start && test_bit(start - 1, info->bitmap))
1881 tmp = entry->offset - ctl->start + align - 1;
1883 tmp = tmp * align + ctl->start;
2689 ctl->start = block_group->start;
2698 * start converting things over to using bitmaps
3089 unsigned long start = 0;
3127 start = i;
3141 cluster->window_start = start * ctl->unit + entry->offset;
3264 * is just its start offset.
3391 u64 *total_trimmed, u64 start, u64 bytes,
3401 const u64 end = start + bytes;
3416 ret = btrfs_discard_extent(fs_info, start, bytes, &trimmed);
3423 if (reserved_start < start)
3425 start - reserved_start,
3427 if (start + bytes < reserved_start + reserved_bytes)
3430 __btrfs_add_free_space(fs_info, ctl, start, bytes, trim_state);
3452 u64 *total_trimmed, u64 start, u64 end, u64 minlen,
3467 while (start < end) {
3476 entry = tree_search_offset(ctl, start, 0, 1);
3497 start = entry->offset;
3522 start = max(start, extent_start);
3523 bytes = min(extent_start + extent_bytes, end) - start;
3535 trim_entry.start = extent_start;
3540 ret = do_trimming(block_group, total_trimmed, start, bytes,
3544 block_group->discard_cursor = start + bytes;
3548 start += bytes;
3549 block_group->discard_cursor = start;
3576 * start = start of bitmap
3580 * trim_bitmaps(start)
3618 u64 *total_trimmed, u64 start, u64 end, u64 minlen,
3628 u64 offset = offset_to_bitmap(ctl, start);
3655 if (!entry || (async && minlen && start == offset &&
3664 * Async discard bitmap trimming begins at by setting the start
3666 * start of the bitmap. This lets us know we are fully
3669 if (start == offset)
3673 ret2 = search_bitmap(ctl, entry, &start, &bytes, false);
3674 if (ret2 || start >= end) {
3699 bytes = min(bytes, end - start);
3717 bitmap_clear_bits(ctl, entry, start, bytes);
3722 trim_entry.start = start;
3727 ret = do_trimming(block_group, total_trimmed, start, bytes,
3728 start, bytes, 0, &trim_entry);
3738 start = offset;
3740 start += bytes;
3742 block_group->discard_cursor = start;
3745 if (start != offset)
3762 u64 *trimmed, u64 start, u64 end, u64 minlen)
3778 ret = trim_no_bitmap(block_group, trimmed, start, end, minlen, false);
3782 ret = trim_bitmaps(block_group, trimmed, start, end, minlen, 0, false);
3793 u64 *trimmed, u64 start, u64 end, u64 minlen,
3808 ret = trim_no_bitmap(block_group, trimmed, start, end, minlen, async);
3815 u64 *trimmed, u64 start, u64 end, u64 minlen,
3830 ret = trim_bitmaps(block_group, trimmed, start, end, minlen, maxlen,