Re: [patch 1/2] x86_64 page fault NMI-safe
From: Mathieu Desnoyers
Date: Thu Aug 05 2010 - 21:49:37 EST
* Peter Zijlstra (peterz@xxxxxxxxxxxxx) wrote:
> On Wed, 2010-08-04 at 10:45 -0400, Mathieu Desnoyers wrote:
> > How do you plan to read the data concurrently with the writer overwriting the
> > data while you are reading it without corruption ?
> I don't consider reading while writing (in overwrite mode) a valid case.
> If you want to use overwrite, stop the writer before reading it.
How inconvenient. It happens that the relatively large group of users I am
working for do care for this use-case. They cannot afford to stop tracing as
soon as they hit "one bug". This "bug" could be a simple odd scenario that they
want to snapshot, but in all cases they want tracing to continue.
> > I think that the stack dump
> > should simply be saved directly to the ring buffer, without copy. The
> > dump_stack() functions might have to be extended so they don't just save text
> > dumbly, but can also be used to save events into the trace in binary format,
> > perhaps with the continuation cookie Linus was proposing.
> Because I don't want to support truncating reservations (because that
> leads to large nops for nested events)
Agreed in this case. Truncating reservations might make sense for filtering, but
even there I have a strong preference for filtering directly on the information
received as parameter, before performing buffer space reservation, whenever
> and when the event needs to go to
> multiple buffers you can re-use the stack-dump without having to do the
> unwind again.
> The problem with the continuation thing Linus suggested is that it would
> bloat the output 3 fold. A stack entry is a single u64. If you want to
> wrap that in a continuation event you need: a header (u64), a cookie
> (u64) and the entry (u64).
Agreed, it's probably not such a good fit for these small pieces of information.
> Continuation events might make heaps of sense for larger data pieces,
> but I don't see them being practical for such small pieces.
What I did in a past life in earlier LTTng versions was to use a 2-pass unwind.
The first pass is the most costly because it brings all the data into the L1
cache. This first pass is used to compute the array size you need to save the
whole stack frame, but it does not copy anything. The second pass performs the
copy. This was surprisingly efficient.
Operating System Efficiency R&D Consultant
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/