Lines Matching defs:bitmap_info
335 struct btrfs_free_space *bitmap_info, u64 *offset,
342 i = offset_to_bit(bitmap_info->offset, block_group->sectorsize,
343 max_t(u64, *offset, bitmap_info->offset));
346 for (i = find_next_bit(bitmap_info->bitmap, BITS_PER_BITMAP, i);
348 i = find_next_bit(bitmap_info->bitmap, BITS_PER_BITMAP, i + 1)) {
349 next_zero = find_next_zero_bit(bitmap_info->bitmap,
360 bitmap_info->offset;
422 struct btrfs_free_space *bitmap_info,
430 end = bitmap_info->offset +
435 ret = search_bitmap(block_group, bitmap_info, &search_start,
439 if (*offset > bitmap_info->offset && *offset + *bytes > end) {
440 bitmap_clear_bits(block_group, bitmap_info, *offset,
444 } else if (*offset >= bitmap_info->offset && *offset + *bytes <= end) {
445 bitmap_clear_bits(block_group, bitmap_info, *offset, *bytes);
450 struct rb_node *next = rb_next(&bitmap_info->offset_index);
451 if (!bitmap_info->bytes) {
452 unlink_free_space(block_group, bitmap_info);
453 kfree(bitmap_info->bitmap);
454 kfree(bitmap_info);
466 bitmap_info = rb_entry(next, struct btrfs_free_space,
473 if (!bitmap_info->bitmap)
484 ret = search_bitmap(block_group, bitmap_info, &search_start,
490 } else if (!bitmap_info->bytes) {
491 unlink_free_space(block_group, bitmap_info);
492 kfree(bitmap_info->bitmap);
493 kfree(bitmap_info);
504 struct btrfs_free_space *bitmap_info;
529 bitmap_info = tree_search_offset(block_group,
532 if (!bitmap_info) {
537 end = bitmap_info->offset +
540 if (offset >= bitmap_info->offset && offset + bytes > end) {
541 bitmap_set_bits(block_group, bitmap_info, offset,
546 } else if (offset >= bitmap_info->offset && offset + bytes <= end) {
547 bitmap_set_bits(block_group, bitmap_info, offset, bytes);