提交 df6c0cd9 编写于 作者: J Jun'ichi Nomura 提交者: Linus Torvalds

[PATCH] clean up add_bd_holder()

add_bd_holder() is called from bd_claim_by_kobject to put a given struct
bd_holder in the list if there is no matching entry.

There are 3 possible results of add_bd_holder():
  1. there is no matching entry and add the given one to the list
  2. there is matching entry, so just increment reference count of
     the existing one
  3. something failed during its course

1 and 2 are successful cases.  But for case 2, someone has to free the
unused struct bd_holder.

The current code frees it inside of add_bd_holder and returns same value
0 for both cases 1 and 2.  However, it's natural and less error-prone if
caller frees it since it's allocated by the caller.
Signed-off-by: NJun'ichi Nomura <j-nomura@ce.jp.nec.com>
Signed-off-by: NLinus Torvalds <torvalds@osdl.org>
上级 bcb55165
...@@ -641,17 +641,39 @@ static void free_bd_holder(struct bd_holder *bo) ...@@ -641,17 +641,39 @@ static void free_bd_holder(struct bd_holder *bo)
kfree(bo); kfree(bo);
} }
/**
* find_bd_holder - find matching struct bd_holder from the block device
*
* @bdev: struct block device to be searched
* @bo: target struct bd_holder
*
* Returns matching entry with @bo in @bdev->bd_holder_list.
* If found, increment the reference count and return the pointer.
* If not found, returns NULL.
*/
static int find_bd_holder(struct block_device *bdev, struct bd_holder *bo)
{
struct bd_holder *tmp;
list_for_each_entry(tmp, &bdev->bd_holder_list, list)
if (tmp->sdir == bo->sdir) {
tmp->count++;
return tmp;
}
return NULL;
}
/** /**
* add_bd_holder - create sysfs symlinks for bd_claim() relationship * add_bd_holder - create sysfs symlinks for bd_claim() relationship
* *
* @bdev: block device to be bd_claimed * @bdev: block device to be bd_claimed
* @bo: preallocated and initialized by alloc_bd_holder() * @bo: preallocated and initialized by alloc_bd_holder()
* *
* If there is no matching entry with @bo in @bdev->bd_holder_list, * Add @bo to @bdev->bd_holder_list, create symlinks.
* add @bo to the list, create symlinks.
* *
* Returns 0 if symlinks are created or already there. * Returns 0 if symlinks are created.
* Returns -ve if something fails and @bo can be freed. * Returns -ve if something fails.
*/ */
static int add_bd_holder(struct block_device *bdev, struct bd_holder *bo) static int add_bd_holder(struct block_device *bdev, struct bd_holder *bo)
{ {
...@@ -661,15 +683,6 @@ static int add_bd_holder(struct block_device *bdev, struct bd_holder *bo) ...@@ -661,15 +683,6 @@ static int add_bd_holder(struct block_device *bdev, struct bd_holder *bo)
if (!bo) if (!bo)
return -EINVAL; return -EINVAL;
list_for_each_entry(tmp, &bdev->bd_holder_list, list) {
if (tmp->sdir == bo->sdir) {
tmp->count++;
/* We've already done what we need to do here. */
free_bd_holder(bo);
return 0;
}
}
if (!bd_holder_grab_dirs(bdev, bo)) if (!bd_holder_grab_dirs(bdev, bo))
return -EBUSY; return -EBUSY;
...@@ -740,7 +753,7 @@ static int bd_claim_by_kobject(struct block_device *bdev, void *holder, ...@@ -740,7 +753,7 @@ static int bd_claim_by_kobject(struct block_device *bdev, void *holder,
struct kobject *kobj) struct kobject *kobj)
{ {
int res; int res;
struct bd_holder *bo; struct bd_holder *bo, *found;
if (!kobj) if (!kobj)
return -EINVAL; return -EINVAL;
...@@ -752,11 +765,15 @@ static int bd_claim_by_kobject(struct block_device *bdev, void *holder, ...@@ -752,11 +765,15 @@ static int bd_claim_by_kobject(struct block_device *bdev, void *holder,
mutex_lock_nested(&bdev->bd_mutex, BD_MUTEX_PARTITION); mutex_lock_nested(&bdev->bd_mutex, BD_MUTEX_PARTITION);
res = bd_claim(bdev, holder); res = bd_claim(bdev, holder);
if (res == 0) { if (res == 0) {
res = add_bd_holder(bdev, bo); found = find_bd_holder(bdev, bo);
if (res) if (found == NULL) {
bd_release(bdev); res = add_bd_holder(bdev, bo);
if (res)
bd_release(bdev);
}
} }
if (res)
if (res || found)
free_bd_holder(bo); free_bd_holder(bo);
mutex_unlock(&bdev->bd_mutex); mutex_unlock(&bdev->bd_mutex);
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册