1*67e74705SXin Li //===--- DependencyGraph.cpp - Generate dependency file -------------------===//
2*67e74705SXin Li //
3*67e74705SXin Li // The LLVM Compiler Infrastructure
4*67e74705SXin Li //
5*67e74705SXin Li // This file is distributed under the University of Illinois Open Source
6*67e74705SXin Li // License. See LICENSE.TXT for details.
7*67e74705SXin Li //
8*67e74705SXin Li //===----------------------------------------------------------------------===//
9*67e74705SXin Li //
10*67e74705SXin Li // This code generates a header dependency graph in DOT format, for use
11*67e74705SXin Li // with, e.g., GraphViz.
12*67e74705SXin Li //
13*67e74705SXin Li //===----------------------------------------------------------------------===//
14*67e74705SXin Li
15*67e74705SXin Li #include "clang/Frontend/Utils.h"
16*67e74705SXin Li #include "clang/Basic/FileManager.h"
17*67e74705SXin Li #include "clang/Basic/SourceManager.h"
18*67e74705SXin Li #include "clang/Frontend/FrontendDiagnostic.h"
19*67e74705SXin Li #include "clang/Lex/PPCallbacks.h"
20*67e74705SXin Li #include "clang/Lex/Preprocessor.h"
21*67e74705SXin Li #include "llvm/ADT/SetVector.h"
22*67e74705SXin Li #include "llvm/Support/GraphWriter.h"
23*67e74705SXin Li #include "llvm/Support/raw_ostream.h"
24*67e74705SXin Li
25*67e74705SXin Li using namespace clang;
26*67e74705SXin Li namespace DOT = llvm::DOT;
27*67e74705SXin Li
28*67e74705SXin Li namespace {
29*67e74705SXin Li class DependencyGraphCallback : public PPCallbacks {
30*67e74705SXin Li const Preprocessor *PP;
31*67e74705SXin Li std::string OutputFile;
32*67e74705SXin Li std::string SysRoot;
33*67e74705SXin Li llvm::SetVector<const FileEntry *> AllFiles;
34*67e74705SXin Li typedef llvm::DenseMap<const FileEntry *,
35*67e74705SXin Li SmallVector<const FileEntry *, 2> > DependencyMap;
36*67e74705SXin Li
37*67e74705SXin Li DependencyMap Dependencies;
38*67e74705SXin Li
39*67e74705SXin Li private:
40*67e74705SXin Li raw_ostream &writeNodeReference(raw_ostream &OS,
41*67e74705SXin Li const FileEntry *Node);
42*67e74705SXin Li void OutputGraphFile();
43*67e74705SXin Li
44*67e74705SXin Li public:
DependencyGraphCallback(const Preprocessor * _PP,StringRef OutputFile,StringRef SysRoot)45*67e74705SXin Li DependencyGraphCallback(const Preprocessor *_PP, StringRef OutputFile,
46*67e74705SXin Li StringRef SysRoot)
47*67e74705SXin Li : PP(_PP), OutputFile(OutputFile.str()), SysRoot(SysRoot.str()) { }
48*67e74705SXin Li
49*67e74705SXin Li void InclusionDirective(SourceLocation HashLoc, const Token &IncludeTok,
50*67e74705SXin Li StringRef FileName, bool IsAngled,
51*67e74705SXin Li CharSourceRange FilenameRange, const FileEntry *File,
52*67e74705SXin Li StringRef SearchPath, StringRef RelativePath,
53*67e74705SXin Li const Module *Imported) override;
54*67e74705SXin Li
EndOfMainFile()55*67e74705SXin Li void EndOfMainFile() override {
56*67e74705SXin Li OutputGraphFile();
57*67e74705SXin Li }
58*67e74705SXin Li
59*67e74705SXin Li };
60*67e74705SXin Li }
61*67e74705SXin Li
AttachDependencyGraphGen(Preprocessor & PP,StringRef OutputFile,StringRef SysRoot)62*67e74705SXin Li void clang::AttachDependencyGraphGen(Preprocessor &PP, StringRef OutputFile,
63*67e74705SXin Li StringRef SysRoot) {
64*67e74705SXin Li PP.addPPCallbacks(llvm::make_unique<DependencyGraphCallback>(&PP, OutputFile,
65*67e74705SXin Li SysRoot));
66*67e74705SXin Li }
67*67e74705SXin Li
InclusionDirective(SourceLocation HashLoc,const Token & IncludeTok,StringRef FileName,bool IsAngled,CharSourceRange FilenameRange,const FileEntry * File,StringRef SearchPath,StringRef RelativePath,const Module * Imported)68*67e74705SXin Li void DependencyGraphCallback::InclusionDirective(SourceLocation HashLoc,
69*67e74705SXin Li const Token &IncludeTok,
70*67e74705SXin Li StringRef FileName,
71*67e74705SXin Li bool IsAngled,
72*67e74705SXin Li CharSourceRange FilenameRange,
73*67e74705SXin Li const FileEntry *File,
74*67e74705SXin Li StringRef SearchPath,
75*67e74705SXin Li StringRef RelativePath,
76*67e74705SXin Li const Module *Imported) {
77*67e74705SXin Li if (!File)
78*67e74705SXin Li return;
79*67e74705SXin Li
80*67e74705SXin Li SourceManager &SM = PP->getSourceManager();
81*67e74705SXin Li const FileEntry *FromFile
82*67e74705SXin Li = SM.getFileEntryForID(SM.getFileID(SM.getExpansionLoc(HashLoc)));
83*67e74705SXin Li if (!FromFile)
84*67e74705SXin Li return;
85*67e74705SXin Li
86*67e74705SXin Li Dependencies[FromFile].push_back(File);
87*67e74705SXin Li
88*67e74705SXin Li AllFiles.insert(File);
89*67e74705SXin Li AllFiles.insert(FromFile);
90*67e74705SXin Li }
91*67e74705SXin Li
92*67e74705SXin Li raw_ostream &
writeNodeReference(raw_ostream & OS,const FileEntry * Node)93*67e74705SXin Li DependencyGraphCallback::writeNodeReference(raw_ostream &OS,
94*67e74705SXin Li const FileEntry *Node) {
95*67e74705SXin Li OS << "header_" << Node->getUID();
96*67e74705SXin Li return OS;
97*67e74705SXin Li }
98*67e74705SXin Li
OutputGraphFile()99*67e74705SXin Li void DependencyGraphCallback::OutputGraphFile() {
100*67e74705SXin Li std::error_code EC;
101*67e74705SXin Li llvm::raw_fd_ostream OS(OutputFile, EC, llvm::sys::fs::F_Text);
102*67e74705SXin Li if (EC) {
103*67e74705SXin Li PP->getDiagnostics().Report(diag::err_fe_error_opening) << OutputFile
104*67e74705SXin Li << EC.message();
105*67e74705SXin Li return;
106*67e74705SXin Li }
107*67e74705SXin Li
108*67e74705SXin Li OS << "digraph \"dependencies\" {\n";
109*67e74705SXin Li
110*67e74705SXin Li // Write the nodes
111*67e74705SXin Li for (unsigned I = 0, N = AllFiles.size(); I != N; ++I) {
112*67e74705SXin Li // Write the node itself.
113*67e74705SXin Li OS.indent(2);
114*67e74705SXin Li writeNodeReference(OS, AllFiles[I]);
115*67e74705SXin Li OS << " [ shape=\"box\", label=\"";
116*67e74705SXin Li StringRef FileName = AllFiles[I]->getName();
117*67e74705SXin Li if (FileName.startswith(SysRoot))
118*67e74705SXin Li FileName = FileName.substr(SysRoot.size());
119*67e74705SXin Li
120*67e74705SXin Li OS << DOT::EscapeString(FileName)
121*67e74705SXin Li << "\"];\n";
122*67e74705SXin Li }
123*67e74705SXin Li
124*67e74705SXin Li // Write the edges
125*67e74705SXin Li for (DependencyMap::iterator F = Dependencies.begin(),
126*67e74705SXin Li FEnd = Dependencies.end();
127*67e74705SXin Li F != FEnd; ++F) {
128*67e74705SXin Li for (unsigned I = 0, N = F->second.size(); I != N; ++I) {
129*67e74705SXin Li OS.indent(2);
130*67e74705SXin Li writeNodeReference(OS, F->first);
131*67e74705SXin Li OS << " -> ";
132*67e74705SXin Li writeNodeReference(OS, F->second[I]);
133*67e74705SXin Li OS << ";\n";
134*67e74705SXin Li }
135*67e74705SXin Li }
136*67e74705SXin Li OS << "}\n";
137*67e74705SXin Li }
138*67e74705SXin Li
139