On 7/18/2017 9:45 PM, Davidlohr Bueso wrote: > Allow interval trees to quickly check for overlaps to avoid > unnecesary tree lookups in interval_tree_iter_first(). > > As of this patch, all interval tree flavors will require > using a 'rb_root_cached' such that we can have the leftmost > node easily available. While most users will make use of this > feature, those with special functions (in addition to the generic > insert, delete, search calls) will avoid using the cached > option as they can do funky things with insertions -- for example, > vma_interval_tree_insert_after(). > > Cc: David Airlie > Cc: dri-devel-PD4FTy7X32lNgt0PjOBp9y5qC8QIuHrW@public.gmane.org > Cc: "Michael S. Tsirkin" > Cc: Jason Wang > Cc: Doug Ledford > Cc: Christian Benvenuti > Cc: linux-rdma-u79uwXL29TY76Z2rM5mHXA@public.gmane.org > Acked-by: Christian König > Acked-by: Peter Zijlstra (Intel) > Signed-off-by: Davidlohr Bueso Ack for the RDMA parts. Acked-by: Doug Ledford -- Doug Ledford GPG Key ID: B826A3330E572FDD Key fingerprint = AE6B 1BDA 122B 23B4 265B 1274 B826 A333 0E57 2FDD