linux-kernel - Re: [PATCH v2 1/3] regmap: rbtree: Simplify adjacent node look-up

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: <20130829123640.GD10783@sirena.org.uk>
Date:	Thu, 29 Aug 2013 13:36:40 +0100
From:	Mark Brown <broonie@...nel.org>
To:	Lars-Peter Clausen <lars@...afoo.de>
Cc:	Dimitris Papastamos <dp@...nsource.wolfsonmicro.com>,
	David Jander <david.jander@...tonic.nl>,
	linux-kernel@...r.kernel.org
Subject: Re: [PATCH v2 1/3] regmap: rbtree: Simplify adjacent node look-up

On Thu, Aug 29, 2013 at 10:26:32AM +0200, Lars-Peter Clausen wrote:
> A register which is adjacent to a node will either be left to the first
> register or right to the last register. It will not be within the node's range,
> so there is no point in checking for each register cached by the node whether
> the new register is next to it. It is sufficient to check whether the register
> comes before the first register or after the last register of the node.

Applied all, thanks.

Download attachment "signature.asc" of type "application/pgp-signature" (837 bytes)