Skip to contentSkip to conversation

reiserfs:stree.c Fix variable set but not used.

PATCH Superseded Justin P. Mattock 1 participant 2 messages Jun 14, 2010

v2 of 3 Superseded Latest is v3 →

lore
Share & tools
lore
#0 lore raw

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

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

---
 fs/reiserfs/stree.c |    3 ---
 1 files changed, 0 insertions(+), 3 deletions(-)
fs/reiserfs/stree.c +0 -3
index 313d39d..f268067 100644
@@ -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.. */
Signature · 1 line
1.7.1.rc1.21.gf3bd6
#1 lore raw
Quoted 25 lines · 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

---
  fs/reiserfs/stree.c |    3 ---
  1 files changed, 0 insertions(+), 3 deletions(-)
fs/reiserfs/stree.c +0 -1
index 313d39d..f268067 100644
@@ -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];

fs/reiserfs/stree.c int search_by_key(struct super_block *sb, const struct cpu_key *key, /* Key to s · line 621

Quoted 8 lines
fs/reiserfs/stree.c +0 -2
@@ -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