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

2013-08-29 Thread Mark Brown
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

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

2013-08-29 Thread Lars-Peter Clausen
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