diff options
Diffstat (limited to 'drivers/md/persistent-data/dm-btree-remove.c')
-rw-r--r-- | drivers/md/persistent-data/dm-btree-remove.c | 28 |
1 files changed, 14 insertions, 14 deletions
diff --git a/drivers/md/persistent-data/dm-btree-remove.c b/drivers/md/persistent-data/dm-btree-remove.c index 1a35caf2563d..aa71e2359a07 100644 --- a/drivers/md/persistent-data/dm-btree-remove.c +++ b/drivers/md/persistent-data/dm-btree-remove.c | |||
@@ -61,20 +61,20 @@ static void node_shift(struct node *n, int shift) | |||
61 | if (shift < 0) { | 61 | if (shift < 0) { |
62 | shift = -shift; | 62 | shift = -shift; |
63 | BUG_ON(shift > nr_entries); | 63 | BUG_ON(shift > nr_entries); |
64 | BUG_ON((void *) key_ptr(n, shift) >= value_ptr(n, shift, value_size)); | 64 | BUG_ON((void *) key_ptr(n, shift) >= value_ptr(n, shift)); |
65 | memmove(key_ptr(n, 0), | 65 | memmove(key_ptr(n, 0), |
66 | key_ptr(n, shift), | 66 | key_ptr(n, shift), |
67 | (nr_entries - shift) * sizeof(__le64)); | 67 | (nr_entries - shift) * sizeof(__le64)); |
68 | memmove(value_ptr(n, 0, value_size), | 68 | memmove(value_ptr(n, 0), |
69 | value_ptr(n, shift, value_size), | 69 | value_ptr(n, shift), |
70 | (nr_entries - shift) * value_size); | 70 | (nr_entries - shift) * value_size); |
71 | } else { | 71 | } else { |
72 | BUG_ON(nr_entries + shift > le32_to_cpu(n->header.max_entries)); | 72 | BUG_ON(nr_entries + shift > le32_to_cpu(n->header.max_entries)); |
73 | memmove(key_ptr(n, shift), | 73 | memmove(key_ptr(n, shift), |
74 | key_ptr(n, 0), | 74 | key_ptr(n, 0), |
75 | nr_entries * sizeof(__le64)); | 75 | nr_entries * sizeof(__le64)); |
76 | memmove(value_ptr(n, shift, value_size), | 76 | memmove(value_ptr(n, shift), |
77 | value_ptr(n, 0, value_size), | 77 | value_ptr(n, 0), |
78 | nr_entries * value_size); | 78 | nr_entries * value_size); |
79 | } | 79 | } |
80 | } | 80 | } |
@@ -91,16 +91,16 @@ static void node_copy(struct node *left, struct node *right, int shift) | |||
91 | memcpy(key_ptr(left, nr_left), | 91 | memcpy(key_ptr(left, nr_left), |
92 | key_ptr(right, 0), | 92 | key_ptr(right, 0), |
93 | shift * sizeof(__le64)); | 93 | shift * sizeof(__le64)); |
94 | memcpy(value_ptr(left, nr_left, value_size), | 94 | memcpy(value_ptr(left, nr_left), |
95 | value_ptr(right, 0, value_size), | 95 | value_ptr(right, 0), |
96 | shift * value_size); | 96 | shift * value_size); |
97 | } else { | 97 | } else { |
98 | BUG_ON(shift > le32_to_cpu(right->header.max_entries)); | 98 | BUG_ON(shift > le32_to_cpu(right->header.max_entries)); |
99 | memcpy(key_ptr(right, 0), | 99 | memcpy(key_ptr(right, 0), |
100 | key_ptr(left, nr_left - shift), | 100 | key_ptr(left, nr_left - shift), |
101 | shift * sizeof(__le64)); | 101 | shift * sizeof(__le64)); |
102 | memcpy(value_ptr(right, 0, value_size), | 102 | memcpy(value_ptr(right, 0), |
103 | value_ptr(left, nr_left - shift, value_size), | 103 | value_ptr(left, nr_left - shift), |
104 | shift * value_size); | 104 | shift * value_size); |
105 | } | 105 | } |
106 | } | 106 | } |
@@ -120,8 +120,8 @@ static void delete_at(struct node *n, unsigned index) | |||
120 | key_ptr(n, index + 1), | 120 | key_ptr(n, index + 1), |
121 | nr_to_copy * sizeof(__le64)); | 121 | nr_to_copy * sizeof(__le64)); |
122 | 122 | ||
123 | memmove(value_ptr(n, index, value_size), | 123 | memmove(value_ptr(n, index), |
124 | value_ptr(n, index + 1, value_size), | 124 | value_ptr(n, index + 1), |
125 | nr_to_copy * value_size); | 125 | nr_to_copy * value_size); |
126 | } | 126 | } |
127 | 127 | ||
@@ -166,7 +166,7 @@ static int init_child(struct dm_btree_info *info, struct node *parent, | |||
166 | if (inc) | 166 | if (inc) |
167 | inc_children(info->tm, result->n, &le64_type); | 167 | inc_children(info->tm, result->n, &le64_type); |
168 | 168 | ||
169 | *((__le64 *) value_ptr(parent, index, sizeof(__le64))) = | 169 | *((__le64 *) value_ptr(parent, index)) = |
170 | cpu_to_le64(dm_block_location(result->block)); | 170 | cpu_to_le64(dm_block_location(result->block)); |
171 | 171 | ||
172 | return 0; | 172 | return 0; |
@@ -520,7 +520,7 @@ static int remove_raw(struct shadow_spine *s, struct dm_btree_info *info, | |||
520 | */ | 520 | */ |
521 | if (shadow_has_parent(s)) { | 521 | if (shadow_has_parent(s)) { |
522 | __le64 location = cpu_to_le64(dm_block_location(shadow_current(s))); | 522 | __le64 location = cpu_to_le64(dm_block_location(shadow_current(s))); |
523 | memcpy(value_ptr(dm_block_data(shadow_parent(s)), i, sizeof(__le64)), | 523 | memcpy(value_ptr(dm_block_data(shadow_parent(s)), i), |
524 | &location, sizeof(__le64)); | 524 | &location, sizeof(__le64)); |
525 | } | 525 | } |
526 | 526 | ||
@@ -577,7 +577,7 @@ int dm_btree_remove(struct dm_btree_info *info, dm_block_t root, | |||
577 | 577 | ||
578 | if (info->value_type.dec) | 578 | if (info->value_type.dec) |
579 | info->value_type.dec(info->value_type.context, | 579 | info->value_type.dec(info->value_type.context, |
580 | value_ptr(n, index, info->value_type.size)); | 580 | value_ptr(n, index)); |
581 | 581 | ||
582 | delete_at(n, index); | 582 | delete_at(n, index); |
583 | } | 583 | } |