diff options
Diffstat (limited to 'fs/btrfs/ref-cache.c')
-rw-r--r-- | fs/btrfs/ref-cache.c | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/fs/btrfs/ref-cache.c b/fs/btrfs/ref-cache.c index a50ebb67055d..6f0acc4c9eab 100644 --- a/fs/btrfs/ref-cache.c +++ b/fs/btrfs/ref-cache.c | |||
@@ -74,11 +74,11 @@ void btrfs_free_leaf_ref(struct btrfs_root *root, struct btrfs_leaf_ref *ref) | |||
74 | static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, | 74 | static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, |
75 | struct rb_node *node) | 75 | struct rb_node *node) |
76 | { | 76 | { |
77 | struct rb_node ** p = &root->rb_node; | 77 | struct rb_node **p = &root->rb_node; |
78 | struct rb_node * parent = NULL; | 78 | struct rb_node *parent = NULL; |
79 | struct btrfs_leaf_ref *entry; | 79 | struct btrfs_leaf_ref *entry; |
80 | 80 | ||
81 | while(*p) { | 81 | while (*p) { |
82 | parent = *p; | 82 | parent = *p; |
83 | entry = rb_entry(parent, struct btrfs_leaf_ref, rb_node); | 83 | entry = rb_entry(parent, struct btrfs_leaf_ref, rb_node); |
84 | 84 | ||
@@ -98,10 +98,10 @@ static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, | |||
98 | 98 | ||
99 | static struct rb_node *tree_search(struct rb_root *root, u64 bytenr) | 99 | static struct rb_node *tree_search(struct rb_root *root, u64 bytenr) |
100 | { | 100 | { |
101 | struct rb_node * n = root->rb_node; | 101 | struct rb_node *n = root->rb_node; |
102 | struct btrfs_leaf_ref *entry; | 102 | struct btrfs_leaf_ref *entry; |
103 | 103 | ||
104 | while(n) { | 104 | while (n) { |
105 | entry = rb_entry(n, struct btrfs_leaf_ref, rb_node); | 105 | entry = rb_entry(n, struct btrfs_leaf_ref, rb_node); |
106 | WARN_ON(!entry->in_tree); | 106 | WARN_ON(!entry->in_tree); |
107 | 107 | ||
@@ -127,7 +127,7 @@ int btrfs_remove_leaf_refs(struct btrfs_root *root, u64 max_root_gen, | |||
127 | return 0; | 127 | return 0; |
128 | 128 | ||
129 | spin_lock(&tree->lock); | 129 | spin_lock(&tree->lock); |
130 | while(!list_empty(&tree->list)) { | 130 | while (!list_empty(&tree->list)) { |
131 | ref = list_entry(tree->list.next, struct btrfs_leaf_ref, list); | 131 | ref = list_entry(tree->list.next, struct btrfs_leaf_ref, list); |
132 | BUG_ON(ref->tree != tree); | 132 | BUG_ON(ref->tree != tree); |
133 | if (ref->root_gen > max_root_gen) | 133 | if (ref->root_gen > max_root_gen) |