return 0;
}
-static struct btrfs_block_group_cache *lookup_block_group(struct
- btrfs_fs_info *info,
- u64 blocknr)
+struct btrfs_block_group_cache *btrfs_lookup_block_group(struct
+ btrfs_fs_info *info,
+ u64 blocknr)
{
struct btrfs_block_group_cache *block_group;
int ret;
return max(cache->last_alloc, search_start);
new_group:
- cache = lookup_block_group(root->fs_info, last + cache->key.offset - 1);
+ cache = btrfs_lookup_block_group(root->fs_info,
+ last + cache->key.offset - 1);
if (!cache) {
return max((*cache_ret)->last_alloc, search_start);
}
if (search_start) {
struct btrfs_block_group_cache *shint;
- shint = lookup_block_group(info, search_start);
+ shint = btrfs_lookup_block_group(info, search_start);
if (shint->data == data) {
used = btrfs_block_group_used(&shint->item);
if (used + shint->pinned <
int ret;
while(total) {
- cache = lookup_block_group(info, blocknr);
+ cache = btrfs_lookup_block_group(info, blocknr);
if (!cache) {
printk(KERN_CRIT "blocknr %Lu lookup failed\n",
blocknr);
first = gang[0];
for (i = 0; i < ret; i++) {
clear_radix_bit(pinned_radix, gang[i]);
- block_group = lookup_block_group(root->fs_info,
- gang[i]);
+ block_group = btrfs_lookup_block_group(root->fs_info,
+ gang[i]);
if (block_group) {
WARN_ON(block_group->pinned == 0);
block_group->pinned--;
err = set_radix_bit(&root->fs_info->pinned_radix, blocknr);
if (!err) {
struct btrfs_block_group_cache *cache;
- cache = lookup_block_group(root->fs_info, blocknr);
+ cache = btrfs_lookup_block_group(root->fs_info,
+ blocknr);
if (cache)
cache->pinned++;
}
for (i = 0; i < ret; i++) {
wret = set_radix_bit(pinned_radix, gang[i]);
if (wret == 0) {
- cache = lookup_block_group(extent_root->fs_info,
+ cache =
+ btrfs_lookup_block_group(extent_root->fs_info,
gang[i]);
if (cache)
cache->pinned++;
if (search_end == (u64)-1)
search_end = btrfs_super_total_blocks(info->disk_super);
if (hint_block) {
- block_group = lookup_block_group(info, hint_block);
+ block_group = btrfs_lookup_block_group(info, hint_block);
block_group = btrfs_find_block_group(root, block_group,
hint_block, data, 1);
} else {
info->extent_tree_prealloc_nr = total_found;
}
if (!data) {
- block_group = lookup_block_group(info, ins->objectid);
+ block_group = btrfs_lookup_block_group(info, ins->objectid);
if (block_group) {
if (fill_prealloc)
block_group->last_prealloc =
else
wrapped = 1;
}
- block_group = lookup_block_group(info, search_start);
+ block_group = btrfs_lookup_block_group(info, search_start);
cond_resched();
if (!full_scan)
block_group = btrfs_find_block_group(root, block_group,
struct btrfs_inode_item *inode_item;
struct btrfs_root *root = BTRFS_I(inode)->root;
struct btrfs_key location;
- struct btrfs_block_group_cache *alloc_group;
u64 alloc_group_block;
int ret;
inode->i_blocks = btrfs_inode_nblocks(inode_item);
inode->i_generation = btrfs_inode_generation(inode_item);
alloc_group_block = btrfs_inode_block_group(inode_item);
- ret = radix_tree_gang_lookup(&root->fs_info->block_group_radix,
- (void **)&alloc_group,
- alloc_group_block, 1);
- BUG_ON(!ret);
- BTRFS_I(inode)->block_group = alloc_group;
+ BTRFS_I(inode)->block_group = btrfs_lookup_block_group(root->fs_info,
+ alloc_group_block);
btrfs_free_path(path);
inode_item = NULL;