summaryrefslogtreecommitdiff
path: root/lib/decompress_unlzma.c
diff options
context:
space:
mode:
authorMichel Lespinasse <walken@google.com>2012-10-09 03:31:10 +0400
committerLinus Torvalds <torvalds@linux-foundation.org>2012-10-09 11:22:36 +0400
commit60670b8034d6e2ba860af79c9379b7788d09db73 (patch)
tree5fed30a98d29a03c078f756275ba34c830fee36c /lib/decompress_unlzma.c
parent7abc704ae399fcb9c51ca200b0456f8a975a8011 (diff)
downloadlinux-60670b8034d6e2ba860af79c9379b7788d09db73.tar.xz
rbtree: place easiest case first in rb_erase()
In rb_erase, move the easy case (node to erase has no more than 1 child) first. I feel the code reads easier that way. Signed-off-by: Michel Lespinasse <walken@google.com> Reviewed-by: Rik van Riel <riel@redhat.com> Cc: Peter Zijlstra <a.p.zijlstra@chello.nl> Cc: Andrea Arcangeli <aarcange@redhat.com> Cc: David Woodhouse <dwmw2@infradead.org> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Diffstat (limited to 'lib/decompress_unlzma.c')
0 files changed, 0 insertions, 0 deletions