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
|
/*
This file is part of Massif Visualizer
Copyright 2014 Milian Wolff <mail@milianw.de>
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
published by the Free Software Foundation; either version 2 of
the License or (at your option) version 3 or any later version
accepted by the membership of KDE e.V. (or its successor approved
by the membership of KDE e.V.), which shall act as a proxy
defined in Section 14 of version 3 of the license.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "allocatorsmodel.h"
#include "massifdata/snapshotitem.h"
#include "massifdata/filedata.h"
#include "massifdata/treeleafitem.h"
#include <KLocalizedString>
using namespace Massif;
namespace {
ParsedLabel labelForNode(const TreeLeafItem* node)
{
ParsedLabel label;
if (!isBelowThreshold(node->label())) {
label = parseLabel(node->label());
label.address.clear();
}
return label;
}
}
AllocatorsModel::AllocatorsModel(const FileData* data, QObject* parent)
: QAbstractItemModel(parent)
{
m_data.reserve(1024);
QHash<ParsedLabel, int> labelToData;
foreach (const SnapshotItem* snapshot, data->snapshots()) {
if (!snapshot->heapTree()) {
continue;
}
foreach (const TreeLeafItem* node, snapshot->heapTree()->children()) {
const ParsedLabel label = labelForNode(node);
int idx = labelToData.value(label, -1);
if (idx == -1) {
idx = m_data.size();
labelToData[label] = idx;
Data data;
data.label = label;
data.peak = node;
m_data << data;
}
Data& data = m_data[idx];
if (data.peak->cost() < node->cost()) {
data.peak = node;
}
}
}
}
AllocatorsModel::~AllocatorsModel()
{
}
int AllocatorsModel::columnCount(const QModelIndex& parent) const
{
if (parent.isValid()) {
return 0;
}
return NUM_COLUMNS;
}
int AllocatorsModel::rowCount(const QModelIndex& parent) const
{
if (parent.isValid()) {
return 0;
}
return m_data.size();
}
QModelIndex AllocatorsModel::index(int row, int column, const QModelIndex& parent) const
{
if (parent.isValid() || row < 0 || column < 0 || row >= m_data.size() || column >= NUM_COLUMNS) {
return QModelIndex();
}
return createIndex(row, column);
}
QModelIndex AllocatorsModel::parent(const QModelIndex& /*child*/) const
{
return QModelIndex();
}
QVariant AllocatorsModel::data(const QModelIndex& index, int role) const
{
if (role != Qt::DisplayRole && role != Qt::ToolTipRole && role != SortRole && role != ItemRole) {
return QVariant();
}
if (!index.isValid() || index.parent().isValid() || index.row() < 0 || index.row() >= m_data.size()
|| index.column() < 0 || index.column() >= NUM_COLUMNS)
{
return QVariant();
}
const Data& data = m_data.value(index.row());
if (role == Qt::ToolTipRole) {
QString tooltip = i18n("<dt>peak cost:</dt><dd>%1</dd>", prettyCost(data.peak->cost()));
tooltip += formatLabelForTooltip(data.label);
return finalizeTooltip(tooltip);
} else if (role == ItemRole) {
return QVariant::fromValue(ModelItem(data.peak, nullptr));
}
switch (index.column()) {
case Function:
if (data.label.function.isEmpty()) {
return i18n("below threshold");
}
return shortenTemplates(data.label.function);
case Location:
return data.label.location;
case Peak:
if (role == SortRole) {
return data.peak->cost();
}
return prettyCost(data.peak->cost());
}
return QVariant();
}
QVariant AllocatorsModel::headerData(int section, Qt::Orientation orientation, int role) const
{
if (role != Qt::DisplayRole || orientation != Qt::Horizontal || section < 0 || section >= NUM_COLUMNS) {
return QVariant();
}
switch (section) {
case Function:
return i18n("Function");
case Location:
return i18n("Location");
case Peak:
return i18n("Peak");
}
return QVariant();
}
QModelIndex AllocatorsModel::indexForItem(const ModelItem& item) const
{
if (!item.first) {
return QModelIndex();
}
const ParsedLabel label = labelForNode(item.first);
for (int i = 0; i < m_data.size(); ++i) {
if (m_data[i].label == label) {
return createIndex(i, Function);
}
}
return QModelIndex();
}
void AllocatorsModel::settingsChanged()
{
if (m_data.isEmpty()) {
return;
}
// update shorten templates
dataChanged(createIndex(0, Function),
createIndex(m_data.size() - 1, Function));
}
#include "moc_allocatorsmodel.cpp"
|
