Skip to content

Commit

Permalink
---
Browse files Browse the repository at this point in the history
yaml
---
r: 349913
b: refs/heads/master
c: 9afcf93
h: refs/heads/master
i:
  349911: 3df6b0c
v: v3
  • Loading branch information
Namhyung Kim authored and Arnaldo Carvalho de Melo committed Jan 24, 2013
1 parent 7005962 commit d759de6
Show file tree
Hide file tree
Showing 3 changed files with 11 additions and 5 deletions.
2 changes: 1 addition & 1 deletion [refs]
Original file line number Diff line number Diff line change
@@ -1,2 +1,2 @@
---
refs/heads/master: 203e04c16330c880538588e932743f404ee4fd66
refs/heads/master: 9afcf930b1fa1158b0878afeba3eff299300dc65
2 changes: 1 addition & 1 deletion trunk/tools/perf/builtin-diff.c
Original file line number Diff line number Diff line change
Expand Up @@ -285,7 +285,7 @@ static void insert_hist_entry_by_name(struct rb_root *root,
while (*p != NULL) {
parent = *p;
iter = rb_entry(parent, struct hist_entry, rb_node);
if (hist_entry__cmp(he, iter) < 0)
if (hist_entry__cmp(iter, he) < 0)
p = &(*p)->rb_left;
else
p = &(*p)->rb_right;
Expand Down
12 changes: 9 additions & 3 deletions trunk/tools/perf/util/hist.c
Original file line number Diff line number Diff line change
Expand Up @@ -285,7 +285,13 @@ static struct hist_entry *add_hist_entry(struct hists *hists,
parent = *p;
he = rb_entry(parent, struct hist_entry, rb_node_in);

cmp = hist_entry__cmp(entry, he);
/*
* Make sure that it receives arguments in a same order as
* hist_entry__collapse() so that we can use an appropriate
* function when searching an entry regardless which sort
* keys were used.
*/
cmp = hist_entry__cmp(he, entry);

if (!cmp) {
he_stat__add_period(&he->stat, period);
Expand Down Expand Up @@ -729,7 +735,7 @@ static struct hist_entry *hists__add_dummy_entry(struct hists *hists,
parent = *p;
he = rb_entry(parent, struct hist_entry, rb_node);

cmp = hist_entry__cmp(pair, he);
cmp = hist_entry__cmp(he, pair);

if (!cmp)
goto out;
Expand Down Expand Up @@ -759,7 +765,7 @@ static struct hist_entry *hists__find_entry(struct hists *hists,

while (n) {
struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node);
int64_t cmp = hist_entry__cmp(he, iter);
int64_t cmp = hist_entry__cmp(iter, he);

if (cmp < 0)
n = n->rb_left;
Expand Down

0 comments on commit d759de6

Please sign in to comment.