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
|
/* This file is part of KDevelop
Copyright 2010 Aleix Pol Gonzalez <aleixpol@kde.org>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License version 2 as published by the Free Software Foundation.
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
Library General Public License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
*/
#include "controlflowgraph.h"
#include "controlflownode.h"
using namespace KDevelop;
class KDevelop::ControlFlowGraphPrivate
{
public:
QList<ControlFlowNode*> m_nodes;
QMap<KDevelop::Declaration*, ControlFlowNode*> m_funcNodes;
QVector<ControlFlowNode*> m_deadNodes;
};
ControlFlowGraph::ControlFlowGraph()
: d_ptr(new ControlFlowGraphPrivate)
{}
ControlFlowGraph::~ControlFlowGraph()
{
clear();
}
void ControlFlowGraph::addEntry(ControlFlowNode* n)
{
Q_D(ControlFlowGraph);
d->m_nodes += n;
}
void ControlFlowGraph::addEntry(Declaration* decl, ControlFlowNode* n)
{
Q_D(ControlFlowGraph);
Q_ASSERT(d);
Q_ASSERT(decl);
d->m_funcNodes.insert(decl, n);
}
void ControlFlowGraph::addDeadNode(ControlFlowNode* n)
{
Q_D(ControlFlowGraph);
d->m_deadNodes += n;
}
void clearNodeRecursively(ControlFlowNode* node, QSet<ControlFlowNode*>& deleted)
{
if (!node || deleted.contains(node))
return;
deleted += node;
clearNodeRecursively(node->next(), deleted);
clearNodeRecursively(node->alternative(), deleted);
delete node;
}
void ControlFlowGraph::clear()
{
Q_D(ControlFlowGraph);
QSet<ControlFlowNode*> deleted;
for (ControlFlowNode* node : qAsConst(d->m_funcNodes)) {
clearNodeRecursively(node, deleted);
}
for (ControlFlowNode* node : qAsConst(d->m_nodes)) {
clearNodeRecursively(node, deleted);
}
for (ControlFlowNode* node : qAsConst(d->m_deadNodes)) {
clearNodeRecursively(node, deleted);
}
d->m_nodes.clear();
d->m_funcNodes.clear();
d->m_deadNodes.clear();
}
QList<ControlFlowNode*> ControlFlowGraph::rootNodes() const
{
Q_D(const ControlFlowGraph);
return d->m_funcNodes.values() + d->m_nodes;
}
QVector<ControlFlowNode*> ControlFlowGraph::deadNodes() const
{
Q_D(const ControlFlowGraph);
return d->m_deadNodes;
}
QList<Declaration*> ControlFlowGraph::declarations() const
{
Q_D(const ControlFlowGraph);
return d->m_funcNodes.keys();
}
ControlFlowNode* ControlFlowGraph::nodeForDeclaration(Declaration* decl) const
{
Q_D(const ControlFlowGraph);
return d->m_funcNodes.value(decl);
}
|
