>>> On 21.11.17 at 16:20, <[email protected]> wrote: > From: Michel Lespinasse <[email protected]> > > In __rb_erase_color(), we have to select one of 3 cases depending on the > color on the 'other' node children. If both children are black, we flip a > few node colors and iterate. Otherwise, we do either one or two tree > rotations, depending on the color of the 'other' child opposite to 'node', > and then we are done. > > The corresponding logic had duplicate checks for the color of the 'other' > child opposite to 'node'. It was checking it first to determine if both > children are black, and then to determine how many tree rotations are > required. Rearrange the logic to avoid that extra check. > > Signed-off-by: Michel Lespinasse <[email protected]> > Cc: Andrea Arcangeli <[email protected]> > Acked-by: David Woodhouse <[email protected]> > Cc: Rik van Riel <[email protected]> > Cc: Peter Zijlstra <[email protected]> > Cc: Daniel Santos <[email protected]> > Cc: Jens Axboe <[email protected]> > Cc: "Eric W. Biederman" <[email protected]> > Signed-off-by: Andrew Morton <[email protected]> > Signed-off-by: Linus Torvalds <[email protected]> > [Linux commit e125d1471a4f8f1bf7ea9a83deb8d23cb40bd712] > > Ported to Xen. > > Signed-off-by: Praveen Kumar <[email protected]>
Acked-by: Jan Beulich <[email protected]> _______________________________________________ Xen-devel mailing list [email protected] https://lists.xenproject.org/mailman/listinfo/xen-devel
