1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
|
/*
* Copyright 2015-2017 Milian Wolff <mail@milianw.de>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "treemodel.h"
#include <QDebug>
#include <QTextStream>
#include <KFormat>
#include <KLocalizedString>
#include <cmath>
namespace {
int indexOf(const RowData* row, const TreeData& siblings)
{
Q_ASSERT(siblings.data() <= row);
Q_ASSERT(siblings.data() + siblings.size() > row);
return row - siblings.data();
}
const RowData* rowAt(const TreeData& rows, int row)
{
Q_ASSERT(rows.size() > row);
return rows.data() + row;
}
/// @return the parent row containing @p index
const RowData* toParentRow(const QModelIndex& index)
{
return static_cast<const RowData*>(index.internalPointer());
}
QString basename(const QString& path)
{
int idx = path.lastIndexOf(QLatin1Char('/'));
return path.mid(idx + 1);
}
}
TreeModel::TreeModel(QObject* parent)
: QAbstractItemModel(parent)
{
qRegisterMetaType<TreeData>();
}
TreeModel::~TreeModel()
{
}
QVariant TreeModel::headerData(int section, Qt::Orientation orientation, int role) const
{
if (orientation != Qt::Horizontal || section < 0 || section >= NUM_COLUMNS) {
return {};
}
if (role == Qt::InitialSortOrderRole) {
if (section == AllocatedColumn || section == AllocationsColumn || section == PeakColumn
|| section == PeakInstancesColumn || section == LeakedColumn || section == TemporaryColumn) {
return Qt::DescendingOrder;
}
}
if (role == Qt::DisplayRole) {
switch (static_cast<Columns>(section)) {
case FileColumn:
return i18n("File");
case LineColumn:
return i18n("Line");
case FunctionColumn:
return i18n("Function");
case ModuleColumn:
return i18n("Module");
case AllocationsColumn:
return i18n("Allocations");
case TemporaryColumn:
return i18n("Temporary");
case PeakColumn:
return i18n("Peak");
case PeakInstancesColumn:
return i18n("Peak instances");
case LeakedColumn:
return i18n("Leaked");
case AllocatedColumn:
return i18n("Allocated");
case LocationColumn:
return i18n("Location");
case NUM_COLUMNS:
break;
}
} else if (role == Qt::ToolTipRole) {
switch (static_cast<Columns>(section)) {
case FileColumn:
return i18n("<qt>The file where the allocation function was called from. "
"May be empty when debug information is missing.</qt>");
case LineColumn:
return i18n("<qt>The line number where the allocation function was called from. "
"May be empty when debug information is missing.</qt>");
case FunctionColumn:
return i18n("<qt>The parent function that called an allocation function. "
"May be unknown when debug information is missing.</qt>");
case ModuleColumn:
return i18n("<qt>The module, i.e. executable or shared library, from "
"which an allocation function was "
"called.</qt>");
case AllocationsColumn:
return i18n("<qt>The number of times an allocation function was called "
"from this location.</qt>");
case TemporaryColumn:
return i18n("<qt>The number of temporary allocations. These allocations "
"are directly followed by a free "
"without any other allocations in-between.</qt>");
case PeakColumn:
return i18n("<qt>The contributions from a given location to the maximum heap "
"memory consumption in bytes. This takes deallocations "
"into account.</qt>");
case PeakInstancesColumn:
return i18n("<qt>The contributions from a given location to the maximum heap "
"memory consumption in number of instances. This takes deallocations "
"into account (i.e. number of allocations minus number of deallocations).</qt>");
case LeakedColumn:
return i18n("<qt>The bytes allocated at this location that have not been "
"deallocated.</qt>");
case AllocatedColumn:
return i18n("<qt>The sum of all bytes allocated from this location, "
"ignoring deallocations.</qt>");
case LocationColumn:
return i18n("<qt>The location from which an allocation function was "
"called. Function symbol and file "
"information "
"may be unknown when debug information was missing when "
"heaptrack was run.</qt>");
case NUM_COLUMNS:
break;
}
}
return {};
}
QVariant TreeModel::data(const QModelIndex& index, int role) const
{
if (index.row() < 0 || index.column() < 0 || index.column() > NUM_COLUMNS) {
return {};
}
const auto row = (role == MaxCostRole) ? &m_maxCost : toRow(index);
if (role == Qt::DisplayRole || role == SortRole || role == MaxCostRole) {
switch (static_cast<Columns>(index.column())) {
case AllocatedColumn:
if (role == SortRole || role == MaxCostRole) {
return static_cast<qint64>(abs(row->cost.allocated));
}
return m_format.formatByteSize(row->cost.allocated, 1, KFormat::MetricBinaryDialect);
case AllocationsColumn:
if (role == SortRole || role == MaxCostRole) {
return static_cast<qint64>(abs(row->cost.allocations));
}
return static_cast<qint64>(row->cost.allocations);
case TemporaryColumn:
if (role == SortRole || role == MaxCostRole) {
return static_cast<qint64>(abs(row->cost.temporary));
}
return static_cast<qint64>(row->cost.temporary);
case PeakColumn:
if (role == SortRole || role == MaxCostRole) {
return static_cast<qint64>(abs(row->cost.peak));
} else {
return m_format.formatByteSize(row->cost.peak, 1, KFormat::MetricBinaryDialect);
}
case PeakInstancesColumn:
if (role == SortRole || role == MaxCostRole) {
return static_cast<qint64>(abs(row->cost.peak_instances));
}
return static_cast<qint64>(row->cost.peak_instances);
case LeakedColumn:
if (role == SortRole || role == MaxCostRole) {
return static_cast<qint64>(abs(row->cost.leaked));
} else {
return m_format.formatByteSize(row->cost.leaked, 1, KFormat::MetricBinaryDialect);
}
case FunctionColumn:
return row->location->function;
case ModuleColumn:
return row->location->module;
case FileColumn:
return row->location->file;
case LineColumn:
return row->location->line;
case LocationColumn:
if (row->location->file.isEmpty()) {
return i18n("%1 in ?? (%2)", basename(row->location->function), basename(row->location->module));
} else {
return i18n("%1 in %2:%3 (%4)", row->location->function, basename(row->location->file),
row->location->line, basename(row->location->module));
}
case NUM_COLUMNS:
break;
}
} else if (role == Qt::ToolTipRole) {
QString tooltip;
QTextStream stream(&tooltip);
stream << "<qt><pre style='font-family:monospace;'>";
if (row->location->line > 0) {
stream << i18nc("1: function, 2: file, 3: line, 4: module", "%1\n at %2:%3\n in %4",
row->location->function.toHtmlEscaped(), row->location->file.toHtmlEscaped(),
row->location->line, row->location->module.toHtmlEscaped());
} else {
stream << i18nc("1: function, 2: module", "%1\n in %2", row->location->function.toHtmlEscaped(),
row->location->module.toHtmlEscaped());
}
stream << '\n';
stream << '\n';
KFormat format;
const auto allocatedFraction =
QString::number(double(row->cost.allocated) * 100. / m_maxCost.cost.allocated, 'g', 3);
const auto peakFraction = QString::number(double(row->cost.peak) * 100. / m_maxCost.cost.peak, 'g', 3);
const auto leakedFraction = QString::number(double(row->cost.leaked) * 100. / m_maxCost.cost.leaked, 'g', 3);
const auto allocationsFraction =
QString::number(double(row->cost.allocations) * 100. / m_maxCost.cost.allocations, 'g', 3);
const auto temporaryFraction =
QString::number(double(row->cost.temporary) * 100. / row->cost.allocations, 'g', 3);
const auto temporaryFractionTotal =
QString::number(double(row->cost.temporary) * 100. / m_maxCost.cost.temporary, 'g', 3);
stream << i18n("allocated: %1 (%2% of total)\n",
format.formatByteSize(row->cost.allocated, 1, KFormat::MetricBinaryDialect), allocatedFraction);
stream << i18n("peak contribution: %1 (%2% of total)\n",
format.formatByteSize(row->cost.peak, 1, KFormat::MetricBinaryDialect), peakFraction);
stream << i18n("leaked: %1 (%2% of total)\n",
format.formatByteSize(row->cost.leaked, 1, KFormat::MetricBinaryDialect), leakedFraction);
stream << i18n("allocations: %1 (%2% of total)\n", row->cost.allocations, allocationsFraction);
stream << i18n("temporary: %1 (%2% of allocations, %3% of total)\n", row->cost.temporary, temporaryFraction,
temporaryFractionTotal);
if (!row->children.isEmpty()) {
auto child = row;
int max = 5;
if (child->children.count() == 1) {
stream << '\n' << i18n("backtrace:") << '\n';
}
while (child->children.count() == 1 && max-- > 0) {
stream << "\n";
if (child->location->line > 0) {
stream << i18nc("1: function, 2: file, 3: line, 4: module", "%1\n at %2:%3\n in %4",
child->location->function.toHtmlEscaped(), child->location->file.toHtmlEscaped(),
child->location->line, child->location->module.toHtmlEscaped());
} else {
stream << i18nc("1: function, 2: module", "%1\n in %2", child->location->function.toHtmlEscaped(),
child->location->module.toHtmlEscaped());
}
child = child->children.data();
}
if (child->children.count() > 1) {
stream << "\n";
stream << i18np("called from one location", "called from %1 locations", child->children.count());
}
}
stream << "</pre></qt>";
return tooltip;
} else if (role == LocationRole) {
return QVariant::fromValue(row->location);
}
return {};
}
QModelIndex TreeModel::index(int row, int column, const QModelIndex& parent) const
{
if (row < 0 || column < 0 || column >= NUM_COLUMNS || row >= rowCount(parent)) {
return QModelIndex();
}
return createIndex(row, column, const_cast<void*>(reinterpret_cast<const void*>(toRow(parent))));
}
QModelIndex TreeModel::parent(const QModelIndex& child) const
{
if (!child.isValid()) {
return {};
}
const auto parent = toParentRow(child);
if (!parent) {
return {};
}
return createIndex(rowOf(parent), 0, const_cast<void*>(reinterpret_cast<const void*>(parent->parent)));
}
int TreeModel::rowCount(const QModelIndex& parent) const
{
if (!parent.isValid()) {
return m_data.size();
} else if (parent.column() != 0) {
return 0;
}
auto row = toRow(parent);
Q_ASSERT(row);
return row->children.size();
}
int TreeModel::columnCount(const QModelIndex& /*parent*/) const
{
return NUM_COLUMNS;
}
void TreeModel::resetData(const TreeData& data)
{
beginResetModel();
m_data = data;
endResetModel();
}
void TreeModel::setSummary(const SummaryData& data)
{
beginResetModel();
m_maxCost.cost = data.cost;
endResetModel();
}
void TreeModel::clearData()
{
beginResetModel();
m_data = {};
m_maxCost = {};
endResetModel();
}
const RowData* TreeModel::toRow(const QModelIndex& index) const
{
if (!index.isValid()) {
return nullptr;
}
if (const auto parent = toParentRow(index)) {
return rowAt(parent->children, index.row());
} else {
return rowAt(m_data, index.row());
}
}
int TreeModel::rowOf(const RowData* row) const
{
if (auto parent = row->parent) {
return indexOf(row, parent->children);
} else {
return indexOf(row, m_data);
}
}
|