[PATCH 1/8 v2]reiserfs:stree.c Fix variable set but not used.

[PATCH 1/8 v2]reiserfs:stree.c Fix variable set but not used.

[Justin P. Mattock]

Resend of this patch due to previous whitespace issues.
The below fixes this warning:
fs/reiserfs/stree.c: In function 'search_by_key':
fs/reiserfs/stree.c:602:6: warning: variable 'right_neighbor_of_leaf_node' set but not used

 Signed-off-by: Justin P. Mattock <justinmattock@gmail.com>
 Acked-by: Edward Shishkin <edward.shishkin@gmail.com> 

---
 fs/reiserfs/stree.c |    3 ---
 1 files changed, 0 insertions(+), 3 deletions(-)

diff --git a/fs/reiserfs/stree.c b/fs/reiserfs/stree.c
index 313d39d..f268067 100644
--- a/fs/reiserfs/stree.c
+++ b/fs/reiserfs/stree.c
@@ -599,7 +599,6 @@ int search_by_key(struct super_block *sb, const struct cpu_key *key,	/* Key to s
 	struct buffer_head *bh;
 	struct path_element *last_element;
 	int node_level, retval;
-	int right_neighbor_of_leaf_node;
 	int fs_gen;
 	struct buffer_head *reada_bh[SEARCH_BY_KEY_READA];
 	b_blocknr_t reada_blocks[SEARCH_BY_KEY_READA];
@@ -617,8 +616,6 @@ int search_by_key(struct super_block *sb, const struct cpu_key *key,	/* Key to s
 
 	pathrelse(search_path);
 
-	right_neighbor_of_leaf_node = 0;
-
 	/* With each iteration of this loop we search through the items in the
 	   current node, and calculate the next current node(next path element)
 	   for the next iteration of this loop.. */
-- 
1.7.1.rc1.21.gf3bd6

Re: [PATCH 1/8 v2]reiserfs:stree.c Fix variable set but not used.

[Justin P. Mattock]

On 06/14/2010 03:46 PM, Justin P. Mattock wrote:
> Resend of this patch due to previous whitespace issues.
> The below fixes this warning:
> fs/reiserfs/stree.c: In function 'search_by_key':
> fs/reiserfs/stree.c:602:6: warning: variable 'right_neighbor_of_leaf_node' set but not used
>
>   Signed-off-by: Justin P. Mattock<justinmattock@gmail.com>
>   Acked-by: Edward Shishkin<edward.shishkin@gmail.com>
>
> ---
>   fs/reiserfs/stree.c |    3 ---
>   1 files changed, 0 insertions(+), 3 deletions(-)
>
> diff --git a/fs/reiserfs/stree.c b/fs/reiserfs/stree.c
> index 313d39d..f268067 100644
> --- a/fs/reiserfs/stree.c
> +++ b/fs/reiserfs/stree.c
> @@ -599,7 +599,6 @@ int search_by_key(struct super_block *sb, const struct cpu_key *key,	/* Key to s
>   	struct buffer_head *bh;
>   	struct path_element *last_element;
>   	int node_level, retval;
> -	int right_neighbor_of_leaf_node;
>   	int fs_gen;
>   	struct buffer_head *reada_bh[SEARCH_BY_KEY_READA];
>   	b_blocknr_t reada_blocks[SEARCH_BY_KEY_READA];
> @@ -617,8 +616,6 @@ int search_by_key(struct super_block *sb, const struct cpu_key *key,	/* Key to s
>
>   	pathrelse(search_path);
>
> -	right_neighbor_of_leaf_node = 0;
> -
>   	/* With each iteration of this loop we search through the items in the
>   	   current node, and calculate the next current node(next path element)
>   	   for the next iteration of this loop.. */



shit I messed up.. forgot the last bit for this.
sorry about that I'll resend.

Justin P. Mattock