@@ -35,7 +35,7 @@ static struct btrfs_root *btrfs_free_space_root(
35
35
return btrfs_global_root (block_group -> fs_info , & key );
36
36
}
37
37
38
- void set_free_space_tree_thresholds (struct btrfs_block_group * cache )
38
+ void btrfs_set_free_space_tree_thresholds (struct btrfs_block_group * cache )
39
39
{
40
40
u32 bitmap_range ;
41
41
size_t bitmap_size ;
@@ -94,7 +94,7 @@ static int add_new_free_space_info(struct btrfs_trans_handle *trans,
94
94
}
95
95
96
96
EXPORT_FOR_TESTS
97
- struct btrfs_free_space_info * search_free_space_info (
97
+ struct btrfs_free_space_info * btrfs_search_free_space_info (
98
98
struct btrfs_trans_handle * trans ,
99
99
struct btrfs_block_group * block_group ,
100
100
struct btrfs_path * path , int cow )
@@ -198,9 +198,9 @@ static void le_bitmap_set(unsigned long *map, unsigned int start, int len)
198
198
}
199
199
200
200
EXPORT_FOR_TESTS
201
- int convert_free_space_to_bitmaps (struct btrfs_trans_handle * trans ,
202
- struct btrfs_block_group * block_group ,
203
- struct btrfs_path * path )
201
+ int btrfs_convert_free_space_to_bitmaps (struct btrfs_trans_handle * trans ,
202
+ struct btrfs_block_group * block_group ,
203
+ struct btrfs_path * path )
204
204
{
205
205
struct btrfs_fs_info * fs_info = trans -> fs_info ;
206
206
struct btrfs_root * root = btrfs_free_space_root (block_group );
@@ -278,7 +278,7 @@ int convert_free_space_to_bitmaps(struct btrfs_trans_handle *trans,
278
278
btrfs_release_path (path );
279
279
}
280
280
281
- info = search_free_space_info (trans , block_group , path , 1 );
281
+ info = btrfs_search_free_space_info (trans , block_group , path , 1 );
282
282
if (IS_ERR (info )) {
283
283
ret = PTR_ERR (info );
284
284
btrfs_abort_transaction (trans , ret );
@@ -340,9 +340,9 @@ int convert_free_space_to_bitmaps(struct btrfs_trans_handle *trans,
340
340
}
341
341
342
342
EXPORT_FOR_TESTS
343
- int convert_free_space_to_extents (struct btrfs_trans_handle * trans ,
344
- struct btrfs_block_group * block_group ,
345
- struct btrfs_path * path )
343
+ int btrfs_convert_free_space_to_extents (struct btrfs_trans_handle * trans ,
344
+ struct btrfs_block_group * block_group ,
345
+ struct btrfs_path * path )
346
346
{
347
347
struct btrfs_fs_info * fs_info = trans -> fs_info ;
348
348
struct btrfs_root * root = btrfs_free_space_root (block_group );
@@ -425,7 +425,7 @@ int convert_free_space_to_extents(struct btrfs_trans_handle *trans,
425
425
btrfs_release_path (path );
426
426
}
427
427
428
- info = search_free_space_info (trans , block_group , path , 1 );
428
+ info = btrfs_search_free_space_info (trans , block_group , path , 1 );
429
429
if (IS_ERR (info )) {
430
430
ret = PTR_ERR (info );
431
431
btrfs_abort_transaction (trans , ret );
@@ -490,7 +490,7 @@ static int update_free_space_extent_count(struct btrfs_trans_handle *trans,
490
490
if (new_extents == 0 )
491
491
return 0 ;
492
492
493
- info = search_free_space_info (trans , block_group , path , 1 );
493
+ info = btrfs_search_free_space_info (trans , block_group , path , 1 );
494
494
if (IS_ERR (info ))
495
495
return PTR_ERR (info );
496
496
@@ -503,18 +503,18 @@ static int update_free_space_extent_count(struct btrfs_trans_handle *trans,
503
503
504
504
if (!(flags & BTRFS_FREE_SPACE_USING_BITMAPS ) &&
505
505
extent_count > block_group -> bitmap_high_thresh ) {
506
- ret = convert_free_space_to_bitmaps (trans , block_group , path );
506
+ ret = btrfs_convert_free_space_to_bitmaps (trans , block_group , path );
507
507
} else if ((flags & BTRFS_FREE_SPACE_USING_BITMAPS ) &&
508
508
extent_count < block_group -> bitmap_low_thresh ) {
509
- ret = convert_free_space_to_extents (trans , block_group , path );
509
+ ret = btrfs_convert_free_space_to_extents (trans , block_group , path );
510
510
}
511
511
512
512
return ret ;
513
513
}
514
514
515
515
EXPORT_FOR_TESTS
516
- bool free_space_test_bit (struct btrfs_block_group * block_group ,
517
- struct btrfs_path * path , u64 offset )
516
+ bool btrfs_free_space_test_bit (struct btrfs_block_group * block_group ,
517
+ struct btrfs_path * path , u64 offset )
518
518
{
519
519
struct extent_buffer * leaf ;
520
520
struct btrfs_key key ;
@@ -632,7 +632,7 @@ static int modify_free_space_bitmap(struct btrfs_trans_handle *trans,
632
632
if (ret )
633
633
return ret ;
634
634
635
- prev_bit_set = free_space_test_bit (block_group , path , prev_block );
635
+ prev_bit_set = btrfs_free_space_test_bit (block_group , path , prev_block );
636
636
637
637
/* The previous block may have been in the previous bitmap. */
638
638
btrfs_item_key_to_cpu (path -> nodes [0 ], & key , path -> slots [0 ]);
@@ -680,7 +680,7 @@ static int modify_free_space_bitmap(struct btrfs_trans_handle *trans,
680
680
return ret ;
681
681
}
682
682
683
- next_bit_set = free_space_test_bit (block_group , path , end );
683
+ next_bit_set = btrfs_free_space_test_bit (block_group , path , end );
684
684
}
685
685
686
686
if (remove ) {
@@ -792,9 +792,9 @@ static int remove_free_space_extent(struct btrfs_trans_handle *trans,
792
792
}
793
793
794
794
EXPORT_FOR_TESTS
795
- int __remove_from_free_space_tree (struct btrfs_trans_handle * trans ,
796
- struct btrfs_block_group * block_group ,
797
- struct btrfs_path * path , u64 start , u64 size )
795
+ int __btrfs_remove_from_free_space_tree (struct btrfs_trans_handle * trans ,
796
+ struct btrfs_block_group * block_group ,
797
+ struct btrfs_path * path , u64 start , u64 size )
798
798
{
799
799
struct btrfs_free_space_info * info ;
800
800
u32 flags ;
@@ -804,7 +804,7 @@ int __remove_from_free_space_tree(struct btrfs_trans_handle *trans,
804
804
if (ret )
805
805
return ret ;
806
806
807
- info = search_free_space_info (NULL , block_group , path , 0 );
807
+ info = btrfs_search_free_space_info (NULL , block_group , path , 0 );
808
808
if (IS_ERR (info ))
809
809
return PTR_ERR (info );
810
810
flags = btrfs_free_space_flags (path -> nodes [0 ], info );
@@ -819,8 +819,8 @@ int __remove_from_free_space_tree(struct btrfs_trans_handle *trans,
819
819
}
820
820
}
821
821
822
- int remove_from_free_space_tree (struct btrfs_trans_handle * trans ,
823
- u64 start , u64 size )
822
+ int btrfs_remove_from_free_space_tree (struct btrfs_trans_handle * trans ,
823
+ u64 start , u64 size )
824
824
{
825
825
struct btrfs_block_group * block_group ;
826
826
struct btrfs_path * path ;
@@ -845,8 +845,7 @@ int remove_from_free_space_tree(struct btrfs_trans_handle *trans,
845
845
}
846
846
847
847
mutex_lock (& block_group -> free_space_lock );
848
- ret = __remove_from_free_space_tree (trans , block_group , path , start ,
849
- size );
848
+ ret = __btrfs_remove_from_free_space_tree (trans , block_group , path , start , size );
850
849
mutex_unlock (& block_group -> free_space_lock );
851
850
if (ret )
852
851
btrfs_abort_transaction (trans , ret );
@@ -981,9 +980,9 @@ static int add_free_space_extent(struct btrfs_trans_handle *trans,
981
980
}
982
981
983
982
EXPORT_FOR_TESTS
984
- int __add_to_free_space_tree (struct btrfs_trans_handle * trans ,
985
- struct btrfs_block_group * block_group ,
986
- struct btrfs_path * path , u64 start , u64 size )
983
+ int __btrfs_add_to_free_space_tree (struct btrfs_trans_handle * trans ,
984
+ struct btrfs_block_group * block_group ,
985
+ struct btrfs_path * path , u64 start , u64 size )
987
986
{
988
987
struct btrfs_free_space_info * info ;
989
988
u32 flags ;
@@ -993,7 +992,7 @@ int __add_to_free_space_tree(struct btrfs_trans_handle *trans,
993
992
if (ret )
994
993
return ret ;
995
994
996
- info = search_free_space_info (NULL , block_group , path , 0 );
995
+ info = btrfs_search_free_space_info (NULL , block_group , path , 0 );
997
996
if (IS_ERR (info ))
998
997
return PTR_ERR (info );
999
998
flags = btrfs_free_space_flags (path -> nodes [0 ], info );
@@ -1008,8 +1007,8 @@ int __add_to_free_space_tree(struct btrfs_trans_handle *trans,
1008
1007
}
1009
1008
}
1010
1009
1011
- int add_to_free_space_tree (struct btrfs_trans_handle * trans ,
1012
- u64 start , u64 size )
1010
+ int btrfs_add_to_free_space_tree (struct btrfs_trans_handle * trans ,
1011
+ u64 start , u64 size )
1013
1012
{
1014
1013
struct btrfs_block_group * block_group ;
1015
1014
struct btrfs_path * path ;
@@ -1034,7 +1033,7 @@ int add_to_free_space_tree(struct btrfs_trans_handle *trans,
1034
1033
}
1035
1034
1036
1035
mutex_lock (& block_group -> free_space_lock );
1037
- ret = __add_to_free_space_tree (trans , block_group , path , start , size );
1036
+ ret = __btrfs_add_to_free_space_tree (trans , block_group , path , start , size );
1038
1037
mutex_unlock (& block_group -> free_space_lock );
1039
1038
if (ret )
1040
1039
btrfs_abort_transaction (trans , ret );
@@ -1114,11 +1113,11 @@ static int populate_free_space_tree(struct btrfs_trans_handle *trans,
1114
1113
break ;
1115
1114
1116
1115
if (start < key .objectid ) {
1117
- ret = __add_to_free_space_tree (trans ,
1118
- block_group ,
1119
- path2 , start ,
1120
- key .objectid -
1121
- start );
1116
+ ret = __btrfs_add_to_free_space_tree (trans ,
1117
+ block_group ,
1118
+ path2 , start ,
1119
+ key .objectid -
1120
+ start );
1122
1121
if (ret )
1123
1122
goto out_locked ;
1124
1123
}
@@ -1137,8 +1136,8 @@ static int populate_free_space_tree(struct btrfs_trans_handle *trans,
1137
1136
goto out_locked ;
1138
1137
}
1139
1138
if (start < end ) {
1140
- ret = __add_to_free_space_tree (trans , block_group , path2 ,
1141
- start , end - start );
1139
+ ret = __btrfs_add_to_free_space_tree (trans , block_group , path2 ,
1140
+ start , end - start );
1142
1141
if (ret )
1143
1142
goto out_locked ;
1144
1143
}
@@ -1424,8 +1423,8 @@ static int __add_block_group_free_space(struct btrfs_trans_handle *trans,
1424
1423
goto out ;
1425
1424
}
1426
1425
1427
- ret = __add_to_free_space_tree (trans , block_group , path ,
1428
- block_group -> start , block_group -> length );
1426
+ ret = __btrfs_add_to_free_space_tree (trans , block_group , path ,
1427
+ block_group -> start , block_group -> length );
1429
1428
if (ret )
1430
1429
btrfs_abort_transaction (trans , ret );
1431
1430
@@ -1436,8 +1435,8 @@ static int __add_block_group_free_space(struct btrfs_trans_handle *trans,
1436
1435
return ret ;
1437
1436
}
1438
1437
1439
- int add_block_group_free_space (struct btrfs_trans_handle * trans ,
1440
- struct btrfs_block_group * block_group )
1438
+ int btrfs_add_block_group_free_space (struct btrfs_trans_handle * trans ,
1439
+ struct btrfs_block_group * block_group )
1441
1440
{
1442
1441
int ret ;
1443
1442
@@ -1450,8 +1449,8 @@ int add_block_group_free_space(struct btrfs_trans_handle *trans,
1450
1449
return ret ;
1451
1450
}
1452
1451
1453
- int remove_block_group_free_space (struct btrfs_trans_handle * trans ,
1454
- struct btrfs_block_group * block_group )
1452
+ int btrfs_remove_block_group_free_space (struct btrfs_trans_handle * trans ,
1453
+ struct btrfs_block_group * block_group )
1455
1454
{
1456
1455
struct btrfs_root * root = btrfs_free_space_root (block_group );
1457
1456
struct btrfs_path * path ;
@@ -1570,7 +1569,7 @@ static int load_free_space_bitmaps(struct btrfs_caching_control *caching_ctl,
1570
1569
while (offset < key .objectid + key .offset ) {
1571
1570
bool bit_set ;
1572
1571
1573
- bit_set = free_space_test_bit (block_group , path , offset );
1572
+ bit_set = btrfs_free_space_test_bit (block_group , path , offset );
1574
1573
if (!prev_bit_set && bit_set ) {
1575
1574
extent_start = offset ;
1576
1575
} else if (prev_bit_set && !bit_set ) {
@@ -1673,7 +1672,7 @@ static int load_free_space_extents(struct btrfs_caching_control *caching_ctl,
1673
1672
return 0 ;
1674
1673
}
1675
1674
1676
- int load_free_space_tree (struct btrfs_caching_control * caching_ctl )
1675
+ int btrfs_load_free_space_tree (struct btrfs_caching_control * caching_ctl )
1677
1676
{
1678
1677
struct btrfs_block_group * block_group ;
1679
1678
struct btrfs_free_space_info * info ;
@@ -1694,7 +1693,7 @@ int load_free_space_tree(struct btrfs_caching_control *caching_ctl)
1694
1693
path -> search_commit_root = 1 ;
1695
1694
path -> reada = READA_FORWARD ;
1696
1695
1697
- info = search_free_space_info (NULL , block_group , path , 0 );
1696
+ info = btrfs_search_free_space_info (NULL , block_group , path , 0 );
1698
1697
if (IS_ERR (info ))
1699
1698
return PTR_ERR (info );
1700
1699
0 commit comments