Re: [PATCH -next v3 0/9] rbtree: Cache leftmost node internally

2017-07-19 Thread Davidlohr Bueso
On Wed, 19 Jul 2017, Andrew Morton wrote: On Thu, 29 Jun 2017 10:15:44 -0700 Davidlohr Bueso wrote: Changes from v2 (https://lkml.org/lkml/2017/6/8/857): - Fixed 0day reported crash for drm_mm selftest program. We were not correctly using the cached version of rbtree with

Re: [PATCH -next v3 0/9] rbtree: Cache leftmost node internally

2017-07-19 Thread Davidlohr Bueso
On Wed, 19 Jul 2017, Andrew Morton wrote: On Thu, 29 Jun 2017 10:15:44 -0700 Davidlohr Bueso wrote: Changes from v2 (https://lkml.org/lkml/2017/6/8/857): - Fixed 0day reported crash for drm_mm selftest program. We were not correctly using the cached version of rbtree with the allocated

Re: [PATCH -next v3 0/9] rbtree: Cache leftmost node internally

2017-07-19 Thread Andrew Morton
On Thu, 29 Jun 2017 10:15:44 -0700 Davidlohr Bueso wrote: > Changes from v2 (https://lkml.org/lkml/2017/6/8/857): > - Fixed 0day reported crash for drm_mm selftest program. We were > not correctly using the cached version of rbtree with the allocated > nodes. > - Added cfq

Re: [PATCH -next v3 0/9] rbtree: Cache leftmost node internally

2017-07-19 Thread Andrew Morton
On Thu, 29 Jun 2017 10:15:44 -0700 Davidlohr Bueso wrote: > Changes from v2 (https://lkml.org/lkml/2017/6/8/857): > - Fixed 0day reported crash for drm_mm selftest program. We were > not correctly using the cached version of rbtree with the allocated > nodes. > - Added cfq patch to use internal

Re: [PATCH -next v3 0/9] rbtree: Cache leftmost node internally

2017-07-05 Thread Peter Zijlstra
On Thu, Jun 29, 2017 at 10:15:44AM -0700, Davidlohr Bueso wrote: > Here's a proposal for extending rbtrees to internally cache the leftmost > node such that we can have fast overlap check optimization for all interval > tree users[1]. The benefits of this series are that: > > (i) Unify users

Re: [PATCH -next v3 0/9] rbtree: Cache leftmost node internally

2017-07-05 Thread Peter Zijlstra
On Thu, Jun 29, 2017 at 10:15:44AM -0700, Davidlohr Bueso wrote: > Here's a proposal for extending rbtrees to internally cache the leftmost > node such that we can have fast overlap check optimization for all interval > tree users[1]. The benefits of this series are that: > > (i) Unify users

[PATCH -next v3 0/9] rbtree: Cache leftmost node internally

2017-06-29 Thread Davidlohr Bueso
Changes from v2 (https://lkml.org/lkml/2017/6/8/857): - Fixed 0day reported crash for drm_mm selftest program. We were not correctly using the cached version of rbtree with the allocated nodes. - Added cfq patch to use internal rbtree caching. - Added Christian's and Jan's reviews. Changes from

[PATCH -next v3 0/9] rbtree: Cache leftmost node internally

2017-06-29 Thread Davidlohr Bueso
Changes from v2 (https://lkml.org/lkml/2017/6/8/857): - Fixed 0day reported crash for drm_mm selftest program. We were not correctly using the cached version of rbtree with the allocated nodes. - Added cfq patch to use internal rbtree caching. - Added Christian's and Jan's reviews. Changes from