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
|
//===- DDGPrinter.cpp - DOT printer for the data dependence graph ----------==//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
//===----------------------------------------------------------------------===//
//
// This file defines the `-dot-ddg` analysis pass, which emits DDG in DOT format
// in a file named `ddg.<graph-name>.dot` for each loop in a function.
//===----------------------------------------------------------------------===//
#include "llvm/Analysis/DDGPrinter.h"
#include "llvm/Support/CommandLine.h"
#include "llvm/Support/GraphWriter.h"
using namespace llvm;
static cl::opt<bool> DotOnly("dot-ddg-only", cl::init(false), cl::Hidden,
cl::ZeroOrMore, cl::desc("simple ddg dot graph"));
static cl::opt<std::string> DDGDotFilenamePrefix(
"dot-ddg-filename-prefix", cl::init("ddg"), cl::Hidden,
cl::desc("The prefix used for the DDG dot file names."));
static void writeDDGToDotFile(DataDependenceGraph &G, bool DOnly = false);
//===--------------------------------------------------------------------===//
// Implementation of DDG DOT Printer for a loop
//===--------------------------------------------------------------------===//
PreservedAnalyses DDGDotPrinterPass::run(Loop &L, LoopAnalysisManager &AM,
LoopStandardAnalysisResults &AR,
LPMUpdater &U) {
writeDDGToDotFile(*AM.getResult<DDGAnalysis>(L, AR), DotOnly);
return PreservedAnalyses::all();
}
static void writeDDGToDotFile(DataDependenceGraph &G, bool DOnly) {
std::string Filename =
Twine(DDGDotFilenamePrefix + "." + G.getName() + ".dot").str();
errs() << "Writing '" << Filename << "'...";
std::error_code EC;
raw_fd_ostream File(Filename, EC, sys::fs::F_Text);
if (!EC)
// We only provide the constant verson of the DOTGraphTrait specialization,
// hence the conversion to const pointer
WriteGraph(File, (const DataDependenceGraph *)&G, DOnly);
else
errs() << " error opening file for writing!";
errs() << "\n";
}
//===--------------------------------------------------------------------===//
// DDG DOT Printer Implementation
//===--------------------------------------------------------------------===//
std::string DDGDotGraphTraits::getNodeLabel(const DDGNode *Node,
const DataDependenceGraph *Graph) {
if (isSimple())
return getSimpleNodeLabel(Node, Graph);
else
return getVerboseNodeLabel(Node, Graph);
}
std::string DDGDotGraphTraits::getEdgeAttributes(
const DDGNode *Node, GraphTraits<const DDGNode *>::ChildIteratorType I,
const DataDependenceGraph *G) {
const DDGEdge *E = static_cast<const DDGEdge *>(*I.getCurrent());
if (isSimple())
return getSimpleEdgeAttributes(Node, E, G);
else
return getVerboseEdgeAttributes(Node, E, G);
}
bool DDGDotGraphTraits::isNodeHidden(const DDGNode *Node,
const DataDependenceGraph *Graph) {
if (isSimple() && isa<RootDDGNode>(Node))
return true;
assert(Graph && "expected a valid graph pointer");
return Graph->getPiBlock(*Node) != nullptr;
}
std::string
DDGDotGraphTraits::getSimpleNodeLabel(const DDGNode *Node,
const DataDependenceGraph *G) {
std::string Str;
raw_string_ostream OS(Str);
if (isa<SimpleDDGNode>(Node))
for (auto *II : static_cast<const SimpleDDGNode *>(Node)->getInstructions())
OS << *II << "\n";
else if (isa<PiBlockDDGNode>(Node))
OS << "pi-block\nwith\n"
<< cast<PiBlockDDGNode>(Node)->getNodes().size() << " nodes\n";
else if (isa<RootDDGNode>(Node))
OS << "root\n";
else
llvm_unreachable("Unimplemented type of node");
return OS.str();
}
std::string
DDGDotGraphTraits::getVerboseNodeLabel(const DDGNode *Node,
const DataDependenceGraph *G) {
std::string Str;
raw_string_ostream OS(Str);
OS << "<kind:" << Node->getKind() << ">\n";
if (isa<SimpleDDGNode>(Node))
for (auto *II : static_cast<const SimpleDDGNode *>(Node)->getInstructions())
OS << *II << "\n";
else if (isa<PiBlockDDGNode>(Node)) {
OS << "--- start of nodes in pi-block ---\n";
unsigned Count = 0;
const auto &PNodes = cast<PiBlockDDGNode>(Node)->getNodes();
for (auto *PN : PNodes) {
OS << getVerboseNodeLabel(PN, G);
if (++Count != PNodes.size())
OS << "\n";
}
OS << "--- end of nodes in pi-block ---\n";
} else if (isa<RootDDGNode>(Node))
OS << "root\n";
else
llvm_unreachable("Unimplemented type of node");
return OS.str();
}
std::string DDGDotGraphTraits::getSimpleEdgeAttributes(
const DDGNode *Src, const DDGEdge *Edge, const DataDependenceGraph *G) {
std::string Str;
raw_string_ostream OS(Str);
DDGEdge::EdgeKind Kind = Edge->getKind();
OS << "label=\"[" << Kind << "]\"";
return OS.str();
}
std::string DDGDotGraphTraits::getVerboseEdgeAttributes(
const DDGNode *Src, const DDGEdge *Edge, const DataDependenceGraph *G) {
std::string Str;
raw_string_ostream OS(Str);
DDGEdge::EdgeKind Kind = Edge->getKind();
OS << "label=\"[";
if (Kind == DDGEdge::EdgeKind::MemoryDependence)
OS << G->getDependenceString(*Src, Edge->getTargetNode());
else
OS << Kind;
OS << "]\"";
return OS.str();
}
|
