Lines Matching refs:start
27 cache->start);
60 key.objectid = block_group->start;
92 key.objectid = block_group->start;
101 block_group->start);
164 static void le_bitmap_set(unsigned long *map, unsigned int start, int len)
166 u8 *p = ((u8 *)map) + BIT_BYTE(start);
167 const unsigned int size = start + len;
168 int bits_to_set = BITS_PER_BYTE - (start % BITS_PER_BYTE);
169 u8 mask_to_set = BITMAP_FIRST_BYTE_MASK(start);
196 u64 start, end;
211 start = block_group->start;
212 end = block_group->start + block_group->length;
230 ASSERT(found_key.objectid == block_group->start);
237 ASSERT(found_key.objectid >= start);
241 first = div_u64(found_key.objectid - start,
243 last = div_u64(found_key.objectid + found_key.offset - start,
277 block_group->start, extent_count,
286 i = start;
335 u64 start, end;
350 start = block_group->start;
351 end = block_group->start + block_group->length;
369 ASSERT(found_key.objectid == block_group->start);
378 ASSERT(found_key.objectid >= start);
382 bitmap_pos = div_u64(found_key.objectid - start,
426 key.objectid = start + start_bit * block_group->fs_info->sectorsize;
443 block_group->start, extent_count,
520 struct btrfs_path *path, u64 *start, u64 *size,
526 u64 end = *start + *size;
536 ASSERT(*start >= found_start && *start < found_end);
543 first = div_u64(*start - found_start, fs_info->sectorsize);
551 *size -= end - *start;
552 *start = end;
589 u64 start, u64 size, int remove)
593 u64 end = start + size;
603 if (start > block_group->start) {
604 u64 prev_block = start - block_group->fs_info->sectorsize;
618 if (start >= key.objectid + key.offset) {
624 key.objectid = start;
639 cur_start = start;
655 if (end < block_group->start + block_group->length) {
702 u64 start, u64 size)
707 u64 end = start + size;
711 key.objectid = start;
725 ASSERT(start >= found_start && end <= found_end);
752 if (start > found_start) {
755 key.offset = start - found_start;
788 struct btrfs_path *path, u64 start, u64 size)
808 start, size, 1);
811 start, size);
816 u64 start, u64 size)
831 block_group = btrfs_lookup_block_group(trans->fs_info, start);
839 ret = __remove_from_free_space_tree(trans, block_group, path, start,
854 u64 start, u64 size)
859 u64 end = start + size;
881 new_key.objectid = start;
886 if (start == block_group->start)
888 key.objectid = start - 1;
906 ASSERT(found_start >= block_group->start &&
907 found_end > block_group->start);
908 ASSERT(found_start < start && found_end <= start);
914 if (found_end == start) {
926 if (end == block_group->start + block_group->length)
946 ASSERT(found_start >= block_group->start &&
947 found_end > block_group->start);
948 ASSERT((found_start < start && found_end <= start) ||
981 struct btrfs_path *path, u64 start, u64 size)
1001 start, size, 0);
1003 return add_free_space_extent(trans, block_group, path, start,
1009 u64 start, u64 size)
1024 block_group = btrfs_lookup_block_group(trans->fs_info, start);
1032 ret = __add_to_free_space_tree(trans, block_group, path, start, size);
1054 u64 start, end;
1081 key.objectid = block_group->start;
1090 start = block_group->start;
1091 end = block_group->start + block_group->length;
1100 if (start < key.objectid) {
1103 path2, start,
1105 start);
1109 start = key.objectid;
1111 start += trans->fs_info->nodesize;
1113 start += key.offset;
1115 if (key.objectid != block_group->start)
1125 if (start < end) {
1127 start, end - start);
1289 block_group->start,
1330 u64 start, end;
1348 start = block_group->start;
1349 end = block_group->start + block_group->length;
1367 ASSERT(found_key.objectid == block_group->start);
1375 ASSERT(found_key.objectid >= start);
1419 end = block_group->start + block_group->length;
1466 block_group->start, extent_count,
1497 end = block_group->start + block_group->length;
1528 block_group->start, extent_count,