On Thu, 29 Nov 2018 22:24:35 -0500
Steven Rostedt wrote:
> On Fri, 30 Nov 2018 11:26:58 +0900
> Masami Hiramatsu wrote:
>
> > On Thu, 29 Nov 2018 11:46:52 -0500
> > Steven Rostedt wrote:
> >
> > > On Thu, 29 Nov 2018 23:29:27 +0900
> > > Masami Hiramatsu wrote:
> > >
> > > > > One way to
On Fri, 30 Nov 2018 11:26:58 +0900
Masami Hiramatsu wrote:
> On Thu, 29 Nov 2018 11:46:52 -0500
> Steven Rostedt wrote:
>
> > On Thu, 29 Nov 2018 23:29:27 +0900
> > Masami Hiramatsu wrote:
> >
> > > > One way to solve this is to also have a counter array that gets updated
> > > > every time
On Thu, 29 Nov 2018 11:46:52 -0500
Steven Rostedt wrote:
> On Thu, 29 Nov 2018 23:29:27 +0900
> Masami Hiramatsu wrote:
>
> > > One way to solve this is to also have a counter array that gets updated
> > > every time the index array gets updated. And save the counter to the
> > > shadow stack i
On Thu, 29 Nov 2018 23:29:27 +0900
Masami Hiramatsu wrote:
> > One way to solve this is to also have a counter array that gets updated
> > every time the index array gets updated. And save the counter to the
> > shadow stack index as well. This way, we only call the return if the
> > counter on t
Hi Steve,
On Mon, 26 Nov 2018 11:32:15 -0500
Steven Rostedt wrote:
> On Mon, 26 Nov 2018 18:21:12 +0900
> Masami Hiramatsu wrote:
>
>
> > > Note, if another fgraph_ops is registered in the same location, its
> > > retfunc may be called that was set by a previous fgraph_ops. This
> > > is not
On Mon, 26 Nov 2018 18:21:12 +0900
Masami Hiramatsu wrote:
> > Note, if another fgraph_ops is registered in the same location, its
> > retfunc may be called that was set by a previous fgraph_ops. This
> > is not a regression because that's what can happen today if you unregister
> > a callback f
Hi Steve,
On Wed, 21 Nov 2018 20:27:08 -0500
Steven Rostedt wrote:
>
> I talked with many of you at Plumbers about rewriting the function graph
> tracer. Well, this is it. I was originally going to produce just a
> proof of concept, but when I found that I had to fix a design flaw
> and that co
On Thu, Nov 22, 2018 at 07:46:05AM -0500, Steven Rostedt wrote:
> On Thu, 22 Nov 2018 11:08:12 +0100
> Peter Zijlstra wrote:
>
> > On Wed, Nov 21, 2018 at 08:27:08PM -0500, Steven Rostedt wrote:
> > > Well the fuction graph tracer is arguably the strongest of the tracers.
> > > It shows both the
On Thu, 22 Nov 2018 11:08:12 +0100
Peter Zijlstra wrote:
> On Wed, Nov 21, 2018 at 08:27:08PM -0500, Steven Rostedt wrote:
> > Well the fuction graph tracer is arguably the strongest of the tracers.
> > It shows both the entrance and exit of a function, can give the timings
> > of a function, and
On Wed, Nov 21, 2018 at 08:27:08PM -0500, Steven Rostedt wrote:
> Well the fuction graph tracer is arguably the strongest of the tracers.
> It shows both the entrance and exit of a function, can give the timings
> of a function, and shows the execution of the code quite nicely.
>
> But it has one
I talked with many of you at Plumbers about rewriting the function graph
tracer. Well, this is it. I was originally going to produce just a
proof of concept, but when I found that I had to fix a design flaw
and that covered all the arch code anyway, I decided to do more of a
RFC patch set.
I pro
11 matches
Mail list logo
