btrfs: Ensure the tree search ioctl returns the right number of records
authorHugo Mills <hugo@carfax.org.uk>
Sat, 14 May 2011 17:43:41 +0000 (17:43 +0000)
committerChris Mason <chris.mason@oracle.com>
Mon, 23 May 2011 17:05:39 +0000 (13:05 -0400)
Btrfs's tree search ioctl has a field to indicate that no more than a
given number of records should be returned. The ioctl doesn't honour
this, as the tested value is not incremented until the end of the
copy_to_sk function. This patch removes an unnecessary local variable,
and updates the num_found counter as each key is found in the tree.

Signed-off-by: Hugo Mills <hugo@carfax.org.uk>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
fs/btrfs/ioctl.c

index 2616f7ed47996a21df8b0c5de224c4b6c1aebf70..ce773fb736a119a4738080157ff60140a2c6908a 100644 (file)
@@ -1279,7 +1279,6 @@ static noinline int copy_to_sk(struct btrfs_root *root,
        int nritems;
        int i;
        int slot;
-       int found = 0;
        int ret = 0;
 
        leaf = path->nodes[0];
@@ -1326,7 +1325,7 @@ static noinline int copy_to_sk(struct btrfs_root *root,
                                           item_off, item_len);
                        *sk_offset += item_len;
                }
-               found++;
+               (*num_found)++;
 
                if (*num_found >= sk->nr_items)
                        break;
@@ -1345,7 +1344,6 @@ advance_key:
        } else
                ret = 1;
 overflow:
-       *num_found += found;
        return ret;
 }