Re: [PATCH] perf/core: introduce context per CPU event list

[Mark Rutland]

On Thu, Nov 10, 2016 at 01:58:04PM +0100, Peter Zijlstra wrote:
> On Thu, Nov 10, 2016 at 12:26:18PM +0000, Mark Rutland wrote:
> > On Thu, Nov 10, 2016 at 01:12:53PM +0100, Peter Zijlstra wrote:
> 
> > > Ah, so the tree would in fact only contain 'INACTIVE' events :-)
> > 
> > Ah. :)
> > 
> > That explains some of the magic, but...
> > 
> > > That is, when no events are on the hardware, all events (if there are
> > > any) are INACTIVE.
> > > 
> > > Then on sched-in, we find the relevant subtree, and linearly try and
> > > program all events from that subtree onto the PMU. Once adding an event
> > > fails programming, we stop (like we do now).
> > > 
> > > These programmed events transition from INACTIVE to ACTIVE, and we take
> > > them out of the tree.
> > > 
> > > Then on sched-out, we remove all events from the hardware, increase the
> > > events their runtime value by however long they were ACTIVE, flip them
> > > to INACTIVE and stuff them back in the tree.
> > 
> > ... per the above, won't the tree also contain 'OFF' events (and
> > 'ERROR', etc)?
> > 
> > ... or do we keep them somewhere else (another list or sub-tree)?
> 
> I don't think those need be tracked at all, they're immaterial for
> actual scheduling. Once we ioctl() them back to life we can insert them
> into the tree.

Sure, that sounds fine for scheduling (including big.LITTLE).

I might still be misunderstanding something, but I don't think that
helps Kan's case: since INACTIVE events which will fail their filters
(including the CPU check) will still be in the tree, they will still
have to be iterated over.

That is, unless we also sort the tree by event->cpu, or if in those
cases we only care about ACTIVE events and can use an active list.

Thanks,
Mark.