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
|
/******************************************************************************
*
* Copyright (C) 1997-2019 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 "dotincldepgraph.h"
#include "dotnode.h"
#include "util.h"
#include "config.h"
void DotInclDepGraph::buildGraph(DotNode *n,const FileDef *fd,int distance)
{
const IncludeInfoList &includeFiles = m_inverse ? fd->includedByFileList() : fd->includeFileList();
for (const auto &ii : includeFiles)
{
const FileDef *bfd = ii.fileDef;
QCString in = ii.includeName;
//printf(">>>> in='%s' bfd=%p\n",ii->includeName.data(),bfd);
bool doc=TRUE,src=FALSE;
if (bfd)
{
in = bfd->absFilePath();
doc = bfd->isLinkable() && !bfd->isHidden();
src = bfd->generateSourceFile();
}
if (doc || src || !Config_getBool(HIDE_UNDOC_RELATIONS))
{
QCString url="";
if (bfd) url=bfd->getOutputFileBase().copy();
if (!doc && src)
{
url=bfd->getSourceFileBase();
}
auto it = m_usedNodes.find(in.str());
if (it!=m_usedNodes.end()) // file is already a node in the graph
{
DotNode *bn = it->second;
n->addChild(bn,0,0,0);
bn->addParent(n);
bn->setDistance(distance);
}
else
{
QCString tmp_url;
QCString tooltip;
if (bfd)
{
tmp_url=doc || src ? bfd->getReference()+"$"+url : QCString();
tooltip = bfd->briefDescriptionAsTooltip();
}
DotNode *bn = new DotNode(getNextNodeNumber(),// n
ii.includeName, // label
tooltip, // tip
tmp_url, // url
FALSE, // rootNode
0); // cd
n->addChild(bn,0,0,0);
bn->addParent(n);
m_usedNodes.insert(std::make_pair(in.str(),bn));
bn->setDistance(distance);
if (bfd) buildGraph(bn,bfd,distance+1);
}
}
}
}
void DotInclDepGraph::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 DotInclDepGraph::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);
}
}
}
DotInclDepGraph::DotInclDepGraph(const FileDef *fd,bool inverse)
{
m_inverse = inverse;
ASSERT(fd!=0);
m_inclDepFileName = fd->includeDependencyGraphFileName();
m_inclByDepFileName = fd->includedByDependencyGraphFileName();
QCString tmp_url=fd->getReference()+"$"+fd->getOutputFileBase();
QCString tooltip = fd->briefDescriptionAsTooltip();
m_startNode = new DotNode(getNextNodeNumber(),
fd->docName(),
tooltip,
tmp_url.data(),
TRUE); // root node
m_startNode->setDistance(0);
m_usedNodes.insert(std::make_pair(fd->absFilePath().str(),m_startNode));
buildGraph(m_startNode,fd,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);
}
DotInclDepGraph::~DotInclDepGraph()
{
DotNode::deleteNodes(m_startNode);
}
QCString DotInclDepGraph::getBaseName() const
{
if (m_inverse)
{
return m_inclByDepFileName;
}
else
{
return m_inclDepFileName;
}
}
void DotInclDepGraph::computeTheGraph()
{
computeGraph(m_startNode, Dependency, m_graphFormat, "", FALSE,
m_inverse, m_startNode->label(), m_theGraph);
}
QCString DotInclDepGraph::getMapLabel() const
{
if (m_inverse)
{
return escapeCharsInString(m_startNode->label(),FALSE) + "dep";
}
else
{
return escapeCharsInString(m_startNode->label(),FALSE);
}
}
QCString DotInclDepGraph::writeGraph(FTextStream &out,
GraphOutputFormat graphFormat,
EmbeddedOutputFormat textFormat,
const char *path,
const char *fileName,
const char *relPath,
bool generateImageMap,
int graphId)
{
return DotGraph::writeGraph(out, graphFormat, textFormat, path, fileName, relPath, generateImageMap, graphId);
}
bool DotInclDepGraph::isTrivial() const
{
return m_startNode->children().empty();
}
bool DotInclDepGraph::isTooBig() const
{
return numNodes()>=Config_getInt(DOT_GRAPH_MAX_NODES);
}
int DotInclDepGraph::numNodes() const
{
return (int)m_startNode->children().size();
}
void DotInclDepGraph::writeXML(FTextStream &t)
{
for (const auto &kv : m_usedNodes)
{
kv.second->writeXML(t,FALSE);
}
}
void DotInclDepGraph::writeDocbook(FTextStream &t)
{
for (const auto &kv : m_usedNodes)
{
kv.second->writeDocbook(t,FALSE);
}
}
|
