Messages in this thread | | | Date | Sun, 05 Aug 2012 19:20:34 -0400 | From | Rik van Riel <> | Subject | Re: [PATCH v2 2/9] rbtree: optimize fetching of sibling node |
| |
On 08/02/2012 06:34 PM, Michel Lespinasse wrote: > When looking to fetch a node's sibling, we went through a sequence of: > - check if node is the parent's left child > - if it is, then fetch the parent's right child > > This can be replaced with: > - fetch the parent's right child as an assumed sibling > - check that node is NOT the fetched child > > This avoids fetching the parent's left child when node is actually > that child. Saves a bit on code size, though it doesn't seem to make > a large difference in speed. > > Signed-off-by: Michel Lespinasse<walken@google.com>
Acked-by: Rik van Riel <riel@redhat.com>
-- All rights reversed
| |