Re: [RFC] perf: need to expose sched_clock to correlate user sampleswith kernel samples
From: Thomas Gleixner
Date: Tue Feb 19 2013 - 16:51:00 EST
On Tue, 19 Feb 2013, John Stultz wrote:
> On 02/19/2013 12:15 PM, Thomas Gleixner wrote:
> > Depending on the length of the delay which kept VCPU0 away from
> > executing and depending on the direction of the ntp update of the
> > timekeeping variables __vdso_clock_gettime()#2 can observe time going
> > backwards.
> > You can reproduce that by pinning VCPU0 to physical core 0 and VCPU1
> > to physical core 1. Now remove all load from physical core 1 except
> > VCPU1 and put massive load on physical core 0 and make sure that the
> > NTP adjustment lowers the mult factor.
> > Fun, isn't it ?
> Yea, this has always worried me. I had a patch for this way way back, blocking
> vdso readers for the entire timekeeping update.
> But it was ugly, hurt performance and no one seemed to be hitting the window
> you hit above. None the less, you're probably right, we should find a way to
> do it right. I'll try to revive those patches.
Let me summarize the IRC discussion we just had about that:
1) We really want to reduce the seq write hold time of the timekeeper
to the bare minimum.
That's doable and I have working patches for this by splitting the
timekeeper seqlock into a spin_lock and a seqcount and doing the
update calculations on a shadow timekeeper structure. The seq write
hold time then gets reduced to switching a pointer and updating the
So the sequence would look like:
It's really worth the trouble. On one of my optimized RT systems I
get the maximum latency of the non timekeeping cores (timekeeping
duty is pinned to core 0) down from 8us to 4 us. That's a whopping
factor of 2.
2) Doing #1 will allow to observe the described time going backwards
scenario in kernel as well.
The reason why we did not get complaints about that scenario at all
(yet) is that the window and the probability to hit it are small
enough. Nevertheless it's a real issue for virtualized systems.
Now you came up with the great idea, that the timekeeping core is
able to calculate what the approximate safe value is for the
clocksource readout to be in a state where wreckage relative to the
last update of the clocksource is not observable, not matter how
long the scheduled out delay is and in which direction the NTP
update is going.
So the writer side would still look like described in #1, but the
reader side would grow another sanity check:
Note, that's not relevant for CLOCK_MONOTONIC_RAW!
@@ -193,7 +193,7 @@ notrace static int __always_inline do_re
notrace static int do_monotonic(struct timespec *ts)
unsigned long seq;
- u64 ns;
+ u64 ns, d;
ts->tv_nsec = 0;
@@ -202,9 +202,10 @@ notrace static int do_monotonic(struct t
mode = gtod->clock.vclock_mode;
ts->tv_sec = gtod->monotonic_time_sec;
ns = gtod->monotonic_time_snsec;
- ns += vgetsns(&mode);
+ d = vgetsns(&mode);
+ ns += d;
ns >>= gtod->clock.shift;
- } while (unlikely(read_seqcount_retry(>od->seq, seq)));
+ } while (read_seqcount_retry(>od->seq, seq) || d > gtod->safe_delta);
Note, that this sanity check also needs to be applied to all in
kernel and real syscall interfaces.
I think that's a proper solution for this issue, unless you want to go
down the ugly road to expand the vsyscall seq write hold time to the
full timekeeper_lock hold time. The factor 2 reduction of latencies on
RT is argument enough for me to try that approach.
I'll polish up the shadow timekeeper patches in the next few days, so
you can have a go on the tk/gtod->safe_delta calulation, ok ?
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/