OpenE2K
/
linux
6
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

fs/reiserfs/stree.c: remove set but not used variables 

Fixes gcc '-Wunused-but-set-variable' warning:

fs/reiserfs/stree.c: In function search_by_key:
fs/reiserfs/stree.c:596:6: warning: variable right_neighbor_of_leaf_node set but not used [-Wunused-but-set-variable]

Link: http://lkml.kernel.org/r/1566379929-118398-3-git-send-email-zhengbin13@huawei.com
Signed-off-by: zhengbin <zhengbin13@huawei.com>
Reported-by: Hulk Robot <hulkci@huawei.com>
Cc: Jan Kara <jack@suse.cz>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
This commit is contained in:
zhengbin 2019-09-25 16:47:01 -07:00 committed by Linus Torvalds
parent 6e9ca45f77
commit 66985cb9ee
1 changed files with 0 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
fs/reiserfs/stree.c
View File

@ -593,7 +593,6 @@ int search_by_key(struct super_block *sb, const struct cpu_key *key,
struct buffer_head *bh; struct buffer_head *bh;
struct path_element *last_element; struct path_element *last_element;
int node_level, retval; int node_level, retval;
int right_neighbor_of_leaf_node;
int fs_gen; int fs_gen;
struct buffer_head *reada_bh[SEARCH_BY_KEY_READA]; struct buffer_head *reada_bh[SEARCH_BY_KEY_READA];
b_blocknr_t reada_blocks[SEARCH_BY_KEY_READA]; b_blocknr_t reada_blocks[SEARCH_BY_KEY_READA];
@ -614,8 +613,6 @@ int search_by_key(struct super_block *sb, const struct cpu_key *key,
pathrelse(search_path); pathrelse(search_path);
right_neighbor_of_leaf_node = 0;
/* /*
* With each iteration of this loop we search through the items in the * With each iteration of this loop we search through the items in the
* current node, and calculate the next current node(next path element) * current node, and calculate the next current node(next path element)
@ -701,7 +698,6 @@ io_error:
*/ */
block_number = SB_ROOT_BLOCK(sb); block_number = SB_ROOT_BLOCK(sb);
expected_level = -1; expected_level = -1;
right_neighbor_of_leaf_node = 0;
/* repeat search from the root */ /* repeat search from the root */
continue; continue;