Btrfs: Simplify the logic in alloc_extent_buffer() for existing extent buffer case
authorChandra Seetharaman <sekharan@us.ibm.com>
Mon, 7 Oct 2013 15:45:25 +0000 (10:45 -0500)
committerChris Mason <chris.mason@fusionio.com>
Tue, 12 Nov 2013 02:59:11 +0000 (21:59 -0500)
commit452c75c3d2187089f6e846710e6ea7883bf30f8a
tree0747512f55c254c1102fd878c9fca20c0138ea33
parent7f4ca37c486733da008778a1f4058fbc194a4fdd
Btrfs: Simplify the logic in alloc_extent_buffer() for existing extent buffer case

alloc_extent_buffer() uses radix_tree_lookup() when radix_tree_insert()
fails with EEXIST. That part of the code is very similar to the code in
find_extent_buffer(). This patch replaces radix_tree_lookup() and
surrounding code in alloc_extent_buffer() with find_extent_buffer().

Note that radix_tree_lookup() does not need to be protected by
tree->buffer_lock. It is protected by eb->refs.

While at it, this patch
  - changes the other usage of radix_tree_lookup() in alloc_extent_buffer()
    with find_extent_buffer() to reduce redundancy.
  - removes the unused argument 'len' to find_extent_buffer().

Signed-Off-by: Chandra Seetharaman <sekharan@us.ibm.com>
Reviewed-by: Zach Brown <zab@redhat.com>
Signed-off-by: Josef Bacik <jbacik@fusionio.com>
Signed-off-by: Chris Mason <chris.mason@fusionio.com>
fs/btrfs/disk-io.c
fs/btrfs/extent_io.c
fs/btrfs/extent_io.h