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
|
/******************************************************************************
*
* Copyright (C) 1997-2020 by Dimitri van Heesch.
*
* Permission to use, copy, modify, and distribute this software and its
* documentation under the terms of the GNU General Public License is hereby
* granted. No representations are made about the suitability of this software
* for any purpose. It is provided "as is" without express or implied warranty.
* See the GNU General Public License for more details.
*
* Documents produced by Doxygen are derivative works derived from the
* input used in their production; they are not affected by this license.
*
*/
#include "dotcallgraph.h"
#include "dotnode.h"
#include "memberlist.h"
#include "config.h"
#include "util.h"
static QCString getUniqueId(const MemberDef *md)
{
QCString result = md->getReference()+"$"+
md->getOutputFileBase()+"#"+
md->anchor();
return result;
}
void DotCallGraph::buildGraph(DotNode *n,const MemberDef *md,int distance)
{
auto refs = m_inverse ? md->getReferencedByMembers() : md->getReferencesMembers();
for (const auto &rmd : refs)
{
if (rmd->showInCallGraph())
{
QCString uniqueId = getUniqueId(rmd);
auto it = m_usedNodes.find(uniqueId.str());
if (it!=m_usedNodes.end()) // file is already a node in the graph
{
DotNode *bn = it->second;
n->addChild(bn,0,0);
bn->addParent(n);
bn->setDistance(distance);
}
else
{
QCString name;
if (Config_getBool(HIDE_SCOPE_NAMES))
{
name = rmd->getOuterScope()==m_scope ?
rmd->name() : rmd->qualifiedName();
}
else
{
name = rmd->qualifiedName();
}
QCString tooltip = rmd->briefDescriptionAsTooltip();
DotNode *bn = new DotNode(
getNextNodeNumber(),
linkToText(rmd->getLanguage(),name,FALSE),
tooltip,
uniqueId,
0 //distance
);
n->addChild(bn,0,0);
bn->addParent(n);
bn->setDistance(distance);
m_usedNodes.insert(std::make_pair(uniqueId.str(),bn));
buildGraph(bn,rmd,distance+1);
}
}
}
}
void DotCallGraph::determineVisibleNodes(DotNodeDeque &queue, int &maxNodes)
{
while (!queue.empty() && maxNodes>0)
{
DotNode *n = queue.front();
queue.pop_front();
if (!n->isVisible() && n->distance()<=Config_getInt(MAX_DOT_GRAPH_DEPTH)) // not yet processed
{
n->markAsVisible();
maxNodes--;
// add direct children
for (const auto &dn : n->children())
{
queue.push_back(dn);
}
}
}
}
void DotCallGraph::determineTruncatedNodes(DotNodeDeque &queue)
{
while (!queue.empty())
{
DotNode *n = queue.front();
queue.pop_front();
if (n->isVisible() && n->isTruncated()==DotNode::Unknown)
{
bool truncated = FALSE;
for (const auto &dn : n->children())
{
if (!dn->isVisible())
truncated = TRUE;
else
queue.push_back(dn);
}
n->markAsTruncated(truncated);
}
}
}
DotCallGraph::DotCallGraph(const MemberDef *md,bool inverse)
{
m_inverse = inverse;
m_diskName = md->getOutputFileBase()+"_"+md->anchor();
m_scope = md->getOuterScope();
QCString uniqueId = getUniqueId(md);
QCString name;
if (Config_getBool(HIDE_SCOPE_NAMES))
{
name = md->name();
}
else
{
name = md->qualifiedName();
}
QCString tooltip = md->briefDescriptionAsTooltip();
m_startNode = new DotNode(getNextNodeNumber(),
linkToText(md->getLanguage(),name,FALSE),
tooltip,
uniqueId,
TRUE // root node
);
m_startNode->setDistance(0);
m_usedNodes.insert(std::make_pair(uniqueId.str(),m_startNode));
buildGraph(m_startNode,md,1);
int maxNodes = Config_getInt(DOT_GRAPH_MAX_NODES);
DotNodeDeque openNodeQueue;
openNodeQueue.push_back(m_startNode);
determineVisibleNodes(openNodeQueue,maxNodes);
openNodeQueue.clear();
openNodeQueue.push_back(m_startNode);
determineTruncatedNodes(openNodeQueue);
}
DotCallGraph::~DotCallGraph()
{
DotNode::deleteNodes(m_startNode);
}
QCString DotCallGraph::getBaseName() const
{
return m_diskName + (m_inverse ? "_icgraph" : "_cgraph");
}
void DotCallGraph::computeTheGraph()
{
computeGraph(
m_startNode,
CallGraph,
m_graphFormat,
m_inverse ? "RL" : "LR",
FALSE,
m_inverse,
m_startNode->label(),
m_theGraph);
}
QCString DotCallGraph::getMapLabel() const
{
return m_baseName;
}
QCString DotCallGraph::writeGraph(
TextStream &out,
GraphOutputFormat graphFormat,
EmbeddedOutputFormat textFormat,
const QCString &path,
const QCString &fileName,
const QCString &relPath,bool generateImageMap,
int graphId)
{
return DotGraph::writeGraph(out, graphFormat, textFormat, path, fileName, relPath, generateImageMap, graphId);
}
bool DotCallGraph::isTrivial() const
{
return m_startNode->children().empty();
}
bool DotCallGraph::isTooBig() const
{
return numNodes()>=Config_getInt(DOT_GRAPH_MAX_NODES);
}
int DotCallGraph::numNodes() const
{
return (int)m_startNode->children().size();
}
|
