On Fri, Feb 07, 2020 at 10:03:02AM -0800, Davidlohr Bueso wrote: > This patch coverts struct ctl_dir to use an llrbtree > instead of a regular rbtree such that computing nodes for > potential usable entries becomes a branchless O(1) operation, > therefore optimizing first_usable_entry(). The cost are > mainly three additional pointers: one for the root and two > for each struct ctl_node next/prev nodes, enlarging it from > 32 to 48 bytes on x86-64. Acked-by: Luis Chamberlain <mcgrof@xxxxxxxxxx> Luis
