lkml.org 
[lkml]   [2013]   [Aug]   [29]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [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.
[unhandled content-type:application/pgp-signature]
\
 
 \ /
  Last update: 2013-08-29 15:01    [W:0.040 / U:1.008 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site