diff options
| author | Zhiqiang Liu <liuzhiqiang26@huawei.com> | 2020-04-15 19:57:31 +0800 |
|---|---|---|
| committer | Mike Snitzer <snitzer@redhat.com> | 2020-05-15 10:29:35 -0400 |
| commit | 9431cf6efc3659eaa1cdd591e02a09045bc9983f (patch) | |
| tree | e8365c1cb21ace66a95914da1963f39f8bc8f2f5 /drivers/md/persistent-data | |
| parent | a86fe8be514534363c8fb12a3a38bdba6354316b (diff) | |
| download | linux-9431cf6efc3659eaa1cdd591e02a09045bc9983f.tar.bz2 | |
dm persistent data: switch exit_ro_spine to return void
In commit 4c7da06f5a78 ("dm persistent data: eliminate unnecessary
return values"), r value in exit_ro_spine will not change, so
exit_ro_spine doesn't need a return value.
Signed-off-by: Zhiqiang Liu <liuzhiqiang26@huawei.com>
Signed-off-by: Mike Snitzer <snitzer@redhat.com>
Diffstat (limited to 'drivers/md/persistent-data')
| -rw-r--r-- | drivers/md/persistent-data/dm-btree-internal.h | 2 | ||||
| -rw-r--r-- | drivers/md/persistent-data/dm-btree-spine.c | 6 |
2 files changed, 3 insertions, 5 deletions
diff --git a/drivers/md/persistent-data/dm-btree-internal.h b/drivers/md/persistent-data/dm-btree-internal.h index a240990a7f33..55a4096f1334 100644 --- a/drivers/md/persistent-data/dm-btree-internal.h +++ b/drivers/md/persistent-data/dm-btree-internal.h @@ -68,7 +68,7 @@ struct ro_spine { }; void init_ro_spine(struct ro_spine *s, struct dm_btree_info *info); -int exit_ro_spine(struct ro_spine *s); +void exit_ro_spine(struct ro_spine *s); int ro_step(struct ro_spine *s, dm_block_t new_child); void ro_pop(struct ro_spine *s); struct btree_node *ro_node(struct ro_spine *s); diff --git a/drivers/md/persistent-data/dm-btree-spine.c b/drivers/md/persistent-data/dm-btree-spine.c index b27b8091a1ca..e03cb9e48773 100644 --- a/drivers/md/persistent-data/dm-btree-spine.c +++ b/drivers/md/persistent-data/dm-btree-spine.c @@ -132,15 +132,13 @@ void init_ro_spine(struct ro_spine *s, struct dm_btree_info *info) s->nodes[1] = NULL; } -int exit_ro_spine(struct ro_spine *s) +void exit_ro_spine(struct ro_spine *s) { - int r = 0, i; + int i; for (i = 0; i < s->count; i++) { unlock_block(s->info, s->nodes[i]); } - - return r; } int ro_step(struct ro_spine *s, dm_block_t new_child) |