1 //===--- CompilationGraph.h - The LLVM Compiler Driver ----------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open
6 // Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // Compilation graph - definition.
12 //===----------------------------------------------------------------------===//
14 #ifndef LLVM_TOOLS_LLVMC2_COMPILATION_GRAPH_H
15 #define LLVM_TOOLS_LLVMC2_COMPILATION_GRAPH_H
17 #include "AutoGenerated.h"
20 #include "llvm/ADT/GraphTraits.h"
21 #include "llvm/ADT/IntrusiveRefCntPtr.h"
22 #include "llvm/ADT/iterator"
23 #include "llvm/ADT/SmallVector.h"
24 #include "llvm/ADT/StringMap.h"
25 #include "llvm/System/Path.h"
31 // An edge in the graph.
32 class Edge : public llvm::RefCountedBaseVPTR<Edge> {
34 Edge(const std::string& T) : ToolName_(T) {}
37 const std::string& ToolName() const { return ToolName_; }
38 virtual bool isEnabled() const = 0;
39 virtual bool isDefault() const = 0;
41 std::string ToolName_;
44 // Edges with no properties are instances of this class.
45 class SimpleEdge : public Edge {
47 SimpleEdge(const std::string& T) : Edge(T) {}
48 bool isEnabled() const { return false;}
49 bool isDefault() const { return true;}
52 // A node in the graph.
54 typedef llvm::SmallVector<llvm::IntrusiveRefCntPtr<Edge>, 3> container_type;
55 typedef container_type::iterator iterator;
56 typedef container_type::const_iterator const_iterator;
58 Node() : OwningGraph(0), InEdges(0) {}
59 Node(CompilationGraph* G) : OwningGraph(G), InEdges(0) {}
60 Node(CompilationGraph* G, Tool* T) :
61 OwningGraph(G), ToolPtr(T), InEdges(0) {}
63 bool HasChildren() const { return !OutEdges.empty(); }
64 const std::string Name() const { return ToolPtr->Name(); }
67 iterator EdgesBegin() { return OutEdges.begin(); }
68 const_iterator EdgesBegin() const { return OutEdges.begin(); }
69 iterator EdgesEnd() { return OutEdges.end(); }
70 const_iterator EdgesEnd() const { return OutEdges.end(); }
72 // Add an outward edge. Takes ownership of the Edge object.
74 { OutEdges.push_back(llvm::IntrusiveRefCntPtr<Edge>(E)); }
76 // Inward edge counter. Used by Build() to implement topological
78 void IncrInEdges() { ++InEdges; }
79 void DecrInEdges() { --InEdges; }
80 bool HasNoInEdges() const { return InEdges == 0; }
82 // Needed to implement NodeChildIterator/GraphTraits
83 CompilationGraph* OwningGraph;
84 // The corresponding Tool.
85 llvm::IntrusiveRefCntPtr<Tool> ToolPtr;
87 container_type OutEdges;
94 class CompilationGraph {
95 // Main data structure.
96 typedef llvm::StringMap<Node> nodes_map_type;
97 // These are used to map from language names-> tools. (We can have
98 // several tools associated with each language name.)
100 llvm::SmallVector<llvm::IntrusiveRefCntPtr<Edge>, 3> tools_vector_type;
101 typedef llvm::StringMap<tools_vector_type> tools_map_type;
103 // Map from file extensions to language names.
104 LanguageMap ExtsToLangs;
105 // Map from language names to lists of tool names.
106 tools_map_type ToolsMap;
107 // Map from tool names to Tool objects.
108 nodes_map_type NodesMap;
114 // insertVertex - insert a new node into the graph. Takes
115 // ownership of the object.
116 void insertNode(Tool* T);
118 // insertEdge - Insert a new edge into the graph. Takes ownership
119 // of the Edge object.
120 void insertEdge(const std::string& A, Edge* E);
122 // Build - Build target(s) from the input file set. Command-line
123 // options are passed implicitly as global variables.
124 int Build(llvm::sys::Path const& tempDir) const;
126 // Return a reference to the node correponding to the given tool
127 // name. Throws std::runtime_error.
128 Node& getNode(const std::string& ToolName);
129 const Node& getNode(const std::string& ToolName) const;
131 // viewGraph - This function is meant for use from the debugger.
132 // You can just say 'call G->viewGraph()' and a ghostview window
133 // should pop up from the program, displaying the compilation
134 // graph. This depends on there being a 'dot' and 'gv' program
138 // Write a CompilationGraph.dot file.
141 // GraphTraits support
142 friend NodesIterator GraphBegin(CompilationGraph*);
143 friend NodesIterator GraphEnd(CompilationGraph*);
144 friend void PopulateCompilationGraph(CompilationGraph&);
149 // Find out which language corresponds to the suffix of this file.
150 const std::string& getLanguage(const llvm::sys::Path& File) const;
152 // Return a reference to the list of tool names corresponding to
153 // the given language name. Throws std::runtime_error.
154 const tools_vector_type& getToolsVector(const std::string& LangName) const;
156 // Pass the input file through the toolchain.
157 const JoinTool* PassThroughGraph (llvm::sys::Path& In,
158 const Node* StartNode,
159 const llvm::sys::Path& TempDir) const;
163 /// GraphTraits support code.
165 // Auxiliary class needed to implement GraphTraits support. Can be
166 // generalised to something like value_iterator for map-like
168 class NodesIterator : public llvm::StringMap<Node>::iterator {
169 typedef llvm::StringMap<Node>::iterator super;
170 typedef NodesIterator ThisType;
171 typedef Node* pointer;
172 typedef Node& reference;
175 NodesIterator(super I) : super(I) {}
177 inline reference operator*() const {
178 return super::operator->()->second;
180 inline pointer operator->() const {
181 return &super::operator->()->second;
185 inline NodesIterator GraphBegin(CompilationGraph* G) {
186 return NodesIterator(G->NodesMap.begin());
189 inline NodesIterator GraphEnd(CompilationGraph* G) {
190 return NodesIterator(G->NodesMap.end());
194 // Another auxiliary class needed by GraphTraits.
195 class NodeChildIterator : public bidirectional_iterator<Node, ptrdiff_t> {
196 typedef NodeChildIterator ThisType;
197 typedef Node::container_type::iterator iterator;
199 CompilationGraph* OwningGraph;
202 typedef Node* pointer;
203 typedef Node& reference;
205 NodeChildIterator(Node* N, iterator I) :
206 OwningGraph(N->OwningGraph), EdgeIter(I) {}
208 const ThisType& operator=(const ThisType& I) {
209 assert(OwningGraph == I.OwningGraph);
210 EdgeIter = I.EdgeIter;
214 inline bool operator==(const ThisType& I) const
215 { return EdgeIter == I.EdgeIter; }
216 inline bool operator!=(const ThisType& I) const
217 { return EdgeIter != I.EdgeIter; }
219 inline pointer operator*() const {
220 return &OwningGraph->getNode((*EdgeIter)->ToolName());
222 inline pointer operator->() const {
223 return &OwningGraph->getNode((*EdgeIter)->ToolName());
226 ThisType& operator++() { ++EdgeIter; return *this; } // Preincrement
227 ThisType operator++(int) { // Postincrement
228 ThisType tmp = *this;
233 inline ThisType& operator--() { --EdgeIter; return *this; } // Predecrement
234 inline ThisType operator--(int) { // Postdecrement
235 ThisType tmp = *this;
245 struct GraphTraits<llvmcc::CompilationGraph*> {
246 typedef llvmcc::CompilationGraph GraphType;
247 typedef llvmcc::Node NodeType;
248 typedef llvmcc::NodeChildIterator ChildIteratorType;
250 static NodeType* getEntryNode(GraphType* G) {
251 return &G->getNode("root");
254 static ChildIteratorType child_begin(NodeType* N) {
255 return ChildIteratorType(N, N->OutEdges.begin());
257 static ChildIteratorType child_end(NodeType* N) {
258 return ChildIteratorType(N, N->OutEdges.end());
261 typedef llvmcc::NodesIterator nodes_iterator;
262 static nodes_iterator nodes_begin(GraphType *G) {
263 return GraphBegin(G);
265 static nodes_iterator nodes_end(GraphType *G) {
272 #endif // LLVM_TOOLS_LLVMC2_COMPILATION_GRAPH_H