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

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [day] [month] [year] [list]

Message-ID: <4C16BE39.2080303@gmail.com>
Date:	Mon, 14 Jun 2010 16:41:45 -0700
From:	"Justin P. Mattock" <justinmattock@...il.com>
To:	"Justin P. Mattock" <justinmattock@...il.com>
CC:	reiserfs-devel@...r.kernel.org, edward.shishkin@...il.com,
	linux-kernel@...r.kernel.org
Subject: Re: [PATCH 1/8 v2]reiserfs:stree.c Fix variable set but not used.

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@...il.com>
>   Acked-by: Edward Shishkin<edward.shishkin@...il.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
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/