Messages in this thread | | | Subject | Re: [PATCH 11/17] lib/interval_tree: fast overlap detection | From | Doug Ledford <> | Date | Sat, 22 Jul 2017 13:52:28 -0400 |
| |
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 <airlied@linux.ie> > Cc: dri-devel@lists.freedesktop.org > Cc: "Michael S. Tsirkin" <mst@redhat.com> > Cc: Jason Wang <jasowang@redhat.com> > Cc: Doug Ledford <dledford@redhat.com> > Cc: Christian Benvenuti <benve@cisco.com> > Cc: linux-rdma@vger.kernel.org > Acked-by: Christian König <christian.koenig@amd.com> > Acked-by: Peter Zijlstra (Intel) <peterz@infradead.org> > Signed-off-by: Davidlohr Bueso <dbueso@suse.de>
Ack for the RDMA parts.
Acked-by: Doug Ledford <dledford@redhat.com>
-- Doug Ledford <dledford@redhat.com> GPG Key ID: B826A3330E572FDD Key fingerprint = AE6B 1BDA 122B 23B4 265B 1274 B826 A333 0E57 2FDD
[unhandled content-type:application/pgp-signature] | |