On Fri, Jan 17, 2014 at 04:56:18PM +0900, Namhyung Kim wrote:
> Hi Arnaldo and Frederic,
>
> On Thu, 16 Jan 2014 17:47:34 -0200, Arnaldo Carvalho de Melo wrote:
> > Em Thu, Jan 16, 2014 at 06:34:58PM +0100, Frederic Weisbecker escreveu:
> >> On Thu, Jan 16, 2014 at 10:17:53AM +0900, Namhyung Kim
On Fri, Jan 17, 2014 at 04:56:18PM +0900, Namhyung Kim wrote:
Hi Arnaldo and Frederic,
On Thu, 16 Jan 2014 17:47:34 -0200, Arnaldo Carvalho de Melo wrote:
Em Thu, Jan 16, 2014 at 06:34:58PM +0100, Frederic Weisbecker escreveu:
On Thu, Jan 16, 2014 at 10:17:53AM +0900, Namhyung Kim wrote:
Hi Arnaldo and Frederic,
On Thu, 16 Jan 2014 17:47:34 -0200, Arnaldo Carvalho de Melo wrote:
> Em Thu, Jan 16, 2014 at 06:34:58PM +0100, Frederic Weisbecker escreveu:
>> On Thu, Jan 16, 2014 at 10:17:53AM +0900, Namhyung Kim wrote:
>> > I think if the sort key doesn't contain "symbol", unmatch
Em Thu, Jan 16, 2014 at 06:34:58PM +0100, Frederic Weisbecker escreveu:
> On Thu, Jan 16, 2014 at 10:17:53AM +0900, Namhyung Kim wrote:
> > I think if the sort key doesn't contain "symbol", unmatch case would be
> > increased as more various callchains would go into a same entry.
>
> You mean -g
On Thu, Jan 16, 2014 at 10:17:53AM +0900, Namhyung Kim wrote:
> I think if the sort key doesn't contain "symbol", unmatch case would be
> increased as more various callchains would go into a same entry.
You mean -g fractal,0.5,callee,address ?
Hmm, actually I haven't seen much difference there.
On Thu, Jan 16, 2014 at 10:17:53AM +0900, Namhyung Kim wrote:
I think if the sort key doesn't contain symbol, unmatch case would be
increased as more various callchains would go into a same entry.
You mean -g fractal,0.5,callee,address ?
Hmm, actually I haven't seen much difference there.
Em Thu, Jan 16, 2014 at 06:34:58PM +0100, Frederic Weisbecker escreveu:
On Thu, Jan 16, 2014 at 10:17:53AM +0900, Namhyung Kim wrote:
I think if the sort key doesn't contain symbol, unmatch case would be
increased as more various callchains would go into a same entry.
You mean -g
Hi Arnaldo and Frederic,
On Thu, 16 Jan 2014 17:47:34 -0200, Arnaldo Carvalho de Melo wrote:
Em Thu, Jan 16, 2014 at 06:34:58PM +0100, Frederic Weisbecker escreveu:
On Thu, Jan 16, 2014 at 10:17:53AM +0900, Namhyung Kim wrote:
I think if the sort key doesn't contain symbol, unmatch case
Hi Frederic,
On Wed, 15 Jan 2014 17:59:30 +0100, Frederic Weisbecker wrote:
> On Wed, Jan 15, 2014 at 03:23:46PM +0900, Namhyung Kim wrote:
>> On Tue, 14 Jan 2014 16:37:15 +0100, Frederic Weisbecker wrote:
>> > When a new callchain child branch matches an existing one in the rbtree,
>> > the
On Wed, Jan 15, 2014 at 03:23:46PM +0900, Namhyung Kim wrote:
> On Tue, 14 Jan 2014 16:37:15 +0100, Frederic Weisbecker wrote:
> > When a new callchain child branch matches an existing one in the rbtree,
> > the comparison of its first entry is performed twice:
> >
> > 1) From
On Wed, Jan 15, 2014 at 03:23:46PM +0900, Namhyung Kim wrote:
On Tue, 14 Jan 2014 16:37:15 +0100, Frederic Weisbecker wrote:
When a new callchain child branch matches an existing one in the rbtree,
the comparison of its first entry is performed twice:
1) From append_chain_children() on
Hi Frederic,
On Wed, 15 Jan 2014 17:59:30 +0100, Frederic Weisbecker wrote:
On Wed, Jan 15, 2014 at 03:23:46PM +0900, Namhyung Kim wrote:
On Tue, 14 Jan 2014 16:37:15 +0100, Frederic Weisbecker wrote:
When a new callchain child branch matches an existing one in the rbtree,
the comparison of
On Tue, 14 Jan 2014 16:37:15 +0100, Frederic Weisbecker wrote:
> When a new callchain child branch matches an existing one in the rbtree,
> the comparison of its first entry is performed twice:
>
> 1) From append_chain_children() on branch lookup
>
> 2) If 1) reports a match, append_chain() then
When a new callchain child branch matches an existing one in the rbtree,
the comparison of its first entry is performed twice:
1) From append_chain_children() on branch lookup
2) If 1) reports a match, append_chain() then compares all entries of
the new branch against the matching node in the
When a new callchain child branch matches an existing one in the rbtree,
the comparison of its first entry is performed twice:
1) From append_chain_children() on branch lookup
2) If 1) reports a match, append_chain() then compares all entries of
the new branch against the matching node in the
On Tue, 14 Jan 2014 16:37:15 +0100, Frederic Weisbecker wrote:
When a new callchain child branch matches an existing one in the rbtree,
the comparison of its first entry is performed twice:
1) From append_chain_children() on branch lookup
2) If 1) reports a match, append_chain() then
16 matches
Mail list logo
