kernel-shark-qt: Fix potential memory leak when searching in collections
In some cases the Data Collection can map the original data request into
a list of data requests. This is done in the cases when the range of the
original request overlaps with more the one data interval (as defined by
the collection). In such a case we must free the entire list of requests.
Signed-off-by: Yordan Karadzhov <ykaradzhov@vmware.com>
Signed-off-by: Steven Rostedt (VMware) <rostedt@goodmis.org>
diff --git a/kernel-shark-qt/src/libkshark-model.c b/kernel-shark-qt/src/libkshark-model.c
index 246a60c..7800090 100644
--- a/kernel-shark-qt/src/libkshark-model.c
+++ b/kernel-shark-qt/src/libkshark-model.c
@@ -900,7 +900,7 @@
else
entry = kshark_get_entry_front(req, histo->data, index);
- free(req);
+ kshark_free_entry_request(req);
return entry;
}
@@ -947,7 +947,7 @@
else
entry = kshark_get_entry_back(req, histo->data, index);
- free(req);
+ kshark_free_entry_request(req);
return entry;
}
@@ -1160,7 +1160,7 @@
else
entry = kshark_get_entry_front(req, histo->data, index);
- free(req);
+ kshark_free_entry_request(req);
if (!entry || !entry->visible) {
/* No visible entry has been found. */
@@ -1213,7 +1213,7 @@
else
entry = kshark_get_entry_front(req, histo->data, index);
- free(req);
+ kshark_free_entry_request(req);
if (!entry || !entry->visible) {
/* No visible entry has been found. */
