On Mon, May 29, 2017 at 07:09:35PM -0700, Davidlohr Bueso wrote: > Davidlohr Bueso (5): > rbtree: Cache leftmost node internally > sched/fair: Replace cfs_rq->rb_leftmost > locking/rtmutex: Replace top-waiter and pi_waiters leftmost caching > sched/deadline: Replace earliest deadline and runqueue leftmost caching > lib/interval_tree: Fast overlap detection
Seems mostly OK. Except that last patch is unfortunately large, but I must admit to not seeing a sensible way to shrink that either :/
