linux-kernel - Re: [PATCH v0 04/71] itrace: Infrastructure for instruction flow tracing units

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]

Message-ID: <20131219123955.GA18186@gmail.com>
Date:	Thu, 19 Dec 2013 13:39:55 +0100
From:	Ingo Molnar <mingo@...nel.org>
To:	Peter Zijlstra <peterz@...radead.org>
Cc:	Alexander Shishkin <alexander.shishkin@...ux.intel.com>,
	Arnaldo Carvalho de Melo <acme@...stprotocols.net>,
	Ingo Molnar <mingo@...hat.com>, linux-kernel@...r.kernel.org,
	David Ahern <dsahern@...il.com>,
	Frederic Weisbecker <fweisbec@...il.com>,
	Jiri Olsa <jolsa@...hat.com>, Mike Galbraith <efault@....de>,
	Namhyung Kim <namhyung@...il.com>,
	Paul Mackerras <paulus@...ba.org>,
	Stephane Eranian <eranian@...gle.com>,
	Andi Kleen <ak@...ux.intel.com>
Subject: Re: [PATCH v0 04/71] itrace: Infrastructure for instruction flow
 tracing units


* Peter Zijlstra <peterz@...radead.org> wrote:

> On Thu, Dec 19, 2013 at 01:17:51PM +0200, Alexander Shishkin wrote:
> > Peter Zijlstra <peterz@...radead.org> writes:
> > 
> > > On Thu, Dec 19, 2013 at 09:53:44AM +0200, Alexander Shishkin wrote:
> > >> Yes and some implementations of PT have the same issue, but you can do a
> > >> sufficiently large high order allocation and map it to userspace and
> > >> still no copying (or parsing/decoding) in kernel space required.
> > >
> > > What's sufficiently large? The largest we could possibly allocate is
> > > something like 4k^11 which is 8M or so. That's not all that big given
> > > you keep saying it generates in the order of 100 MB/s.
> > 
> > One chunk is 8M. You can have as many as the buddy allocator permits you
> > to have. When you get a PMI, you simply switch one chunk for another and
> > on the tracing goes.
> 
> This document you referred me to looks to specify something with a
> proper s/g implementation; called ToPA. There doesn't appear to be a
> limit to the linked entries and you can specify a size per entry, and I
> don't see anywhere why 4k would be bad.
> 
> That said, I'm still reading..
> 
> > > Also, 'some implementations', that sounds like a fail right there. Why
> > > are there already different implementations, and some which such stupid
> > > design, of something this new?
> > >
> > > How about just saying NO to the ones that requires physically contiguous
> > > allocations?
> > 
> > No reason to leave those out, because they are still extremely useful
> > for tracing and fit perfectly fine in a model with two buffers.
> 
> Maybe; but lets start with the sane hardware. Then we'll look at the 
> amount of pain needed to support these broken pieces of crap and 
> decide later.
> 
> So drop all support for crappy hardware now.

Absolutely agreed ...

The thing is, BTS itself is rarely used (and not primarily because 
it's slow, but because its tooling and thus its utility is poor), so 
the last thing we want is another piece of broken hardware with a 
quirky software interface to it that tooling has trouble utilizing.

Sigh, when will Intel learn to talk to Linux PMU experts _before_ 
committing to a hardware interface??

Thanks,

	Ingo
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/