[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <20171215140218.GC19821@e110439-lin>
Date: Fri, 15 Dec 2017 14:02:18 +0000
From: Patrick Bellasi <patrick.bellasi@....com>
To: Peter Zijlstra <peterz@...radead.org>
Cc: linux-kernel@...r.kernel.org, linux-pm@...r.kernel.org,
Ingo Molnar <mingo@...hat.com>,
"Rafael J . Wysocki" <rafael.j.wysocki@...el.com>,
Viresh Kumar <viresh.kumar@...aro.org>,
Vincent Guittot <vincent.guittot@...aro.org>,
Paul Turner <pjt@...gle.com>,
Dietmar Eggemann <dietmar.eggemann@....com>,
Morten Rasmussen <morten.rasmussen@....com>,
Juri Lelli <juri.lelli@...hat.com>,
Todd Kjos <tkjos@...roid.com>,
Joel Fernandes <joelaf@...gle.com>
Subject: Re: [PATCH v2 2/4] sched/fair: add util_est on top of PELT
On 13-Dec 17:05, Peter Zijlstra wrote:
> On Tue, Dec 05, 2017 at 05:10:16PM +0000, Patrick Bellasi wrote:
> > + if (cfs_rq->nr_running > 0) {
> > + util_est = cfs_rq->util_est_runnable;
> > + util_est -= task_util_est(p);
> > + if (util_est < 0)
> > + util_est = 0;
> > + cfs_rq->util_est_runnable = util_est;
> > + } else {
>
> I'm thinking that's an explicit load-store to avoid intermediate values
> landing in cfs_rq->util_esp_runnable, right?
Was mainly to have an unsigned util_est for the following "sub"...
> That would need READ_ONCE() / WRITE_ONCE() I think, without that the
> compiler is free to munge the lot together.
... do we still need the {READ,WRITE}_ONCE() in this case?
I guess adding them however does not hurts.
Steering back at that code however it can likely by optimized to avoid
the else branch... will update and add the barriers.
Cheers Patrick.
--
#include <best/regards.h>
Patrick Bellasi
Powered by blists - more mailing lists