summaryrefslogtreecommitdiffstats
path: root/tools/perf/util/rblist.c
diff options
context:
space:
mode:
authorJin Yao <yao.jin@linux.intel.com>2017-12-01 18:57:25 +0800
committerArnaldo Carvalho de Melo <acme@redhat.com>2017-12-05 10:24:31 -0300
commit33fec3e393dc1c55737cfb9c876b5c0da0d6f380 (patch)
tree12da9860e4e7d26ad85a99b6ecd5127d0a9d9fec /tools/perf/util/rblist.c
parent35a8a148d8c1ee9e5ae18f9565a880490f816f89 (diff)
downloadlinux-stable-33fec3e393dc1c55737cfb9c876b5c0da0d6f380.tar.gz
linux-stable-33fec3e393dc1c55737cfb9c876b5c0da0d6f380.tar.bz2
linux-stable-33fec3e393dc1c55737cfb9c876b5c0da0d6f380.zip
perf rblist: Create rblist__exit() function
Currently we have a rblist__delete() which is used to delete a rblist. While rblist__delete() will free the pointer of rblist at the end. It's an inconvenience for the user to delete a rblist which is not allocated by something like malloc(). For example, the rblist is embedded in a larger data structure. This patch creates a new function rblist__exit() which is similar to rblist__delete() but it will not free the pointer of rblist. Signed-off-by: Jin Yao <yao.jin@linux.intel.com> Acked-by: Jiri Olsa <jolsa@kernel.org> Cc: Alexander Shishkin <alexander.shishkin@linux.intel.com> Cc: Andi Kleen <ak@linux.intel.com> Cc: Kan Liang <kan.liang@intel.com> Cc: Peter Zijlstra <peterz@infradead.org> Link: http://lkml.kernel.org/r/1512125856-22056-2-git-send-email-yao.jin@linux.intel.com Signed-off-by: Arnaldo Carvalho de Melo <acme@redhat.com>
Diffstat (limited to 'tools/perf/util/rblist.c')
-rw-r--r--tools/perf/util/rblist.c19
1 files changed, 12 insertions, 7 deletions
diff --git a/tools/perf/util/rblist.c b/tools/perf/util/rblist.c
index 0dfe27d99458..0efc3258c648 100644
--- a/tools/perf/util/rblist.c
+++ b/tools/perf/util/rblist.c
@@ -101,16 +101,21 @@ void rblist__init(struct rblist *rblist)
return;
}
+void rblist__exit(struct rblist *rblist)
+{
+ struct rb_node *pos, *next = rb_first(&rblist->entries);
+
+ while (next) {
+ pos = next;
+ next = rb_next(pos);
+ rblist__remove_node(rblist, pos);
+ }
+}
+
void rblist__delete(struct rblist *rblist)
{
if (rblist != NULL) {
- struct rb_node *pos, *next = rb_first(&rblist->entries);
-
- while (next) {
- pos = next;
- next = rb_next(pos);
- rblist__remove_node(rblist, pos);
- }
+ rblist__exit(rblist);
free(rblist);
}
}