btrfs-progs: make private symbols to static
Signed-off-by: Byongho Lee <bhlee.kernel@gmail.com> Signed-off-by: David Sterba <dsterba@suse.com>
This commit is contained in:
parent
83d0a1727b
commit
24b73dff7b
|
@ -334,7 +334,7 @@ struct readable_flag_entry {
|
|||
#define DEF_INCOMPAT_FLAG_ENTRY(bit_name) \
|
||||
{BTRFS_FEATURE_INCOMPAT_##bit_name, #bit_name}
|
||||
|
||||
struct readable_flag_entry incompat_flags_array[] = {
|
||||
static struct readable_flag_entry incompat_flags_array[] = {
|
||||
DEF_INCOMPAT_FLAG_ENTRY(MIXED_BACKREF),
|
||||
DEF_INCOMPAT_FLAG_ENTRY(DEFAULT_SUBVOL),
|
||||
DEF_INCOMPAT_FLAG_ENTRY(MIXED_GROUPS),
|
||||
|
@ -354,7 +354,7 @@ static const int incompat_flags_num = sizeof(incompat_flags_array) /
|
|||
#define DEF_SUPER_FLAG_ENTRY(bit_name) \
|
||||
{BTRFS_SUPER_FLAG_##bit_name, #bit_name}
|
||||
|
||||
struct readable_flag_entry super_flags_array[] = {
|
||||
static struct readable_flag_entry super_flags_array[] = {
|
||||
DEF_HEADER_FLAG_ENTRY(WRITTEN),
|
||||
DEF_HEADER_FLAG_ENTRY(RELOC),
|
||||
DEF_SUPER_FLAG_ENTRY(CHANGING_FSID),
|
||||
|
|
|
@ -49,12 +49,12 @@ struct qgroup_count {
|
|||
struct rb_node rb_node;
|
||||
};
|
||||
|
||||
struct counts_tree {
|
||||
static struct counts_tree {
|
||||
struct rb_root root;
|
||||
unsigned int num_groups;
|
||||
} counts = { .root = RB_ROOT };
|
||||
|
||||
struct rb_root by_bytenr = RB_ROOT;
|
||||
static struct rb_root by_bytenr = RB_ROOT;
|
||||
|
||||
/*
|
||||
* List of interior tree blocks. We walk this list after loading the
|
||||
|
@ -68,8 +68,8 @@ struct rb_root by_bytenr = RB_ROOT;
|
|||
* exist further down the tree, the fact that our interior node has a
|
||||
* ref means we need to account anything below it to all its roots.
|
||||
*/
|
||||
struct ulist *tree_blocks = NULL; /* unode->val = bytenr, ->aux
|
||||
* = tree_block pointer */
|
||||
static struct ulist *tree_blocks = NULL; /* unode->val = bytenr, ->aux
|
||||
* = tree_block pointer */
|
||||
struct tree_block {
|
||||
int level;
|
||||
u64 num_bytes;
|
||||
|
|
Loading…
Reference in New Issue