|
@@ -108,7 +108,7 @@ static bool hists__decay_entry(struct hists *hists, struct hist_entry *he)
|
|
|
return he->period == 0;
|
|
|
}
|
|
|
|
|
|
-void hists__decay_entries(struct hists *hists)
|
|
|
+static void __hists__decay_entries(struct hists *hists, bool threaded)
|
|
|
{
|
|
|
struct rb_node *next = rb_first(&hists->entries);
|
|
|
struct hist_entry *n;
|
|
@@ -124,7 +124,7 @@ void hists__decay_entries(struct hists *hists)
|
|
|
if (hists__decay_entry(hists, n) && !n->used) {
|
|
|
rb_erase(&n->rb_node, &hists->entries);
|
|
|
|
|
|
- if (sort__need_collapse)
|
|
|
+ if (sort__need_collapse || threaded)
|
|
|
rb_erase(&n->rb_node_in, &hists->entries_collapsed);
|
|
|
|
|
|
hist_entry__free(n);
|
|
@@ -133,6 +133,16 @@ void hists__decay_entries(struct hists *hists)
|
|
|
}
|
|
|
}
|
|
|
|
|
|
+void hists__decay_entries(struct hists *hists)
|
|
|
+{
|
|
|
+ return __hists__decay_entries(hists, false);
|
|
|
+}
|
|
|
+
|
|
|
+void hists__decay_entries_threaded(struct hists *hists)
|
|
|
+{
|
|
|
+ return __hists__decay_entries(hists, true);
|
|
|
+}
|
|
|
+
|
|
|
/*
|
|
|
* histogram, sorted on item, collects periods
|
|
|
*/
|