[PATCH] drm: Convert prime dma-buf <-> handle to rbtree

2016-09-29 Thread Daniel Vetter
On Tue, Sep 27, 2016 at 12:18:13PM -0400, Sean Paul wrote: > On Tue, Sep 27, 2016 at 2:36 AM, David Herrmann > wrote: > > Hi Chris > > > > On Mon, Sep 26, 2016 at 10:44 PM, Chris Wilson > chris-wilson.co.uk> wrote: > >> Currently we use a linear walk to lookup a handle and return a dma-buf, > >>

[PATCH] drm: Convert prime dma-buf <-> handle to rbtree

2016-09-27 Thread Sean Paul
On Tue, Sep 27, 2016 at 2:36 AM, David Herrmann wrote: > Hi Chris > > On Mon, Sep 26, 2016 at 10:44 PM, Chris Wilson > wrote: >> Currently we use a linear walk to lookup a handle and return a dma-buf, >> and vice versa. A long overdue TODO task is to convert that to a >> hashtable. Since the in

[PATCH] drm: Convert prime dma-buf <-> handle to rbtree

2016-09-27 Thread David Herrmann
Hi Chris On Mon, Sep 26, 2016 at 10:44 PM, Chris Wilson wrote: > Currently we use a linear walk to lookup a handle and return a dma-buf, > and vice versa. A long overdue TODO task is to convert that to a > hashtable. Since the initial implementation of dma-buf/prime, we now > have resizeable has

[PATCH] drm: Convert prime dma-buf <-> handle to rbtree

2016-09-26 Thread Chris Wilson
Currently we use a linear walk to lookup a handle and return a dma-buf, and vice versa. A long overdue TODO task is to convert that to a hashtable. Since the initial implementation of dma-buf/prime, we now have resizeable hashtables we can use (and now a future task is to RCU enable the lookup!). H