2004-09-01 22:55:40 +00:00
|
|
|
//===-- llvm/Support/DotGraphTraits.h - Customize .dot output ---*- C++ -*-===//
|
2005-04-21 20:48:15 +00:00
|
|
|
//
|
2003-10-20 19:46:57 +00:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 19:59:42 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-21 20:48:15 +00:00
|
|
|
//
|
2003-10-20 19:46:57 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2002-10-07 18:37:10 +00:00
|
|
|
//
|
|
|
|
// This file defines a template class that can be used to customize dot output
|
|
|
|
// graphs generated by the GraphWriter.h file. The default implementation of
|
|
|
|
// this file will produce a simple, but not very polished graph. By
|
|
|
|
// specializing this template, lots of customization opportunities are possible.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2004-09-01 22:55:40 +00:00
|
|
|
#ifndef LLVM_SUPPORT_DOTGRAPHTRAITS_H
|
|
|
|
#define LLVM_SUPPORT_DOTGRAPHTRAITS_H
|
2002-10-07 18:37:10 +00:00
|
|
|
|
|
|
|
#include <string>
|
|
|
|
|
2003-11-11 22:41:34 +00:00
|
|
|
namespace llvm {
|
|
|
|
|
2002-10-07 18:37:10 +00:00
|
|
|
/// DefaultDOTGraphTraits - This class provides the default implementations of
|
|
|
|
/// all of the DOTGraphTraits methods. If a specialization does not need to
|
|
|
|
/// override all methods here it should inherit so that it can get the default
|
|
|
|
/// implementations.
|
|
|
|
///
|
|
|
|
struct DefaultDOTGraphTraits {
|
2009-11-30 12:38:13 +00:00
|
|
|
private:
|
|
|
|
bool IsSimple;
|
|
|
|
|
|
|
|
protected:
|
|
|
|
bool isSimple() {
|
|
|
|
return IsSimple;
|
|
|
|
}
|
|
|
|
|
|
|
|
public:
|
2010-05-10 20:14:02 +00:00
|
|
|
explicit DefaultDOTGraphTraits(bool simple=false) : IsSimple (simple) {}
|
2009-11-30 12:38:13 +00:00
|
|
|
|
2002-10-07 18:37:10 +00:00
|
|
|
/// getGraphName - Return the label for the graph as a whole. Printed at the
|
|
|
|
/// top of the graph.
|
|
|
|
///
|
2007-05-14 14:23:27 +00:00
|
|
|
template<typename GraphType>
|
2007-12-16 00:42:19 +00:00
|
|
|
static std::string getGraphName(const GraphType& Graph) { return ""; }
|
2002-10-07 18:37:10 +00:00
|
|
|
|
2002-10-10 22:29:10 +00:00
|
|
|
/// getGraphProperties - Return any custom properties that should be included
|
2004-05-05 06:10:06 +00:00
|
|
|
/// in the top level graph structure for dot.
|
2002-10-10 22:29:10 +00:00
|
|
|
///
|
2007-05-14 14:23:27 +00:00
|
|
|
template<typename GraphType>
|
2007-12-16 00:42:19 +00:00
|
|
|
static std::string getGraphProperties(const GraphType& Graph) {
|
2004-05-05 06:10:06 +00:00
|
|
|
return "";
|
2002-10-10 22:29:10 +00:00
|
|
|
}
|
|
|
|
|
2005-01-11 00:24:59 +00:00
|
|
|
/// renderGraphFromBottomUp - If this function returns true, the graph is
|
|
|
|
/// emitted bottom-up instead of top-down. This requires graphviz 2.0 to work
|
|
|
|
/// though.
|
|
|
|
static bool renderGraphFromBottomUp() {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2010-05-27 09:48:47 +00:00
|
|
|
/// isNodeHidden - If the function returns true, the given node is not
|
2010-05-14 15:29:31 +00:00
|
|
|
/// displayed in the graph.
|
|
|
|
static bool isNodeHidden(const void *Node) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2002-10-07 18:37:10 +00:00
|
|
|
/// getNodeLabel - Given a node and a pointer to the top level graph, return
|
|
|
|
/// the label to print in the node.
|
2007-05-14 14:23:27 +00:00
|
|
|
template<typename GraphType>
|
2009-11-30 12:38:47 +00:00
|
|
|
std::string getNodeLabel(const void *Node, const GraphType& Graph) {
|
2002-10-17 00:16:39 +00:00
|
|
|
return "";
|
|
|
|
}
|
2009-02-20 22:51:36 +00:00
|
|
|
|
2005-10-01 00:17:07 +00:00
|
|
|
/// hasNodeAddressLabel - If this method returns true, the address of the node
|
|
|
|
/// is added to the label of the node.
|
2007-05-14 14:23:27 +00:00
|
|
|
template<typename GraphType>
|
2007-12-16 00:42:19 +00:00
|
|
|
static bool hasNodeAddressLabel(const void *Node, const GraphType& Graph) {
|
2005-10-01 00:17:07 +00:00
|
|
|
return false;
|
|
|
|
}
|
2002-10-07 18:37:10 +00:00
|
|
|
|
|
|
|
/// If you want to specify custom node attributes, this is the place to do so
|
|
|
|
///
|
2007-05-14 14:23:27 +00:00
|
|
|
template<typename GraphType>
|
2007-12-16 00:42:19 +00:00
|
|
|
static std::string getNodeAttributes(const void *Node,
|
|
|
|
const GraphType& Graph) {
|
2006-10-02 12:26:53 +00:00
|
|
|
return "";
|
|
|
|
}
|
2002-10-07 18:37:10 +00:00
|
|
|
|
|
|
|
/// If you want to override the dot attributes printed for a particular edge,
|
|
|
|
/// override this method.
|
|
|
|
template<typename EdgeIter>
|
2002-10-17 00:16:39 +00:00
|
|
|
static std::string getEdgeAttributes(const void *Node, EdgeIter EI) {
|
|
|
|
return "";
|
|
|
|
}
|
2002-10-07 18:37:10 +00:00
|
|
|
|
|
|
|
/// getEdgeSourceLabel - If you want to label the edge source itself,
|
|
|
|
/// implement this method.
|
|
|
|
template<typename EdgeIter>
|
2002-10-17 00:16:39 +00:00
|
|
|
static std::string getEdgeSourceLabel(const void *Node, EdgeIter I) {
|
|
|
|
return "";
|
|
|
|
}
|
2002-10-07 18:37:10 +00:00
|
|
|
|
|
|
|
/// edgeTargetsEdgeSource - This method returns true if this outgoing edge
|
|
|
|
/// should actually target another edge source, not a node. If this method is
|
|
|
|
/// implemented, getEdgeTarget should be implemented.
|
|
|
|
template<typename EdgeIter>
|
2002-10-17 00:16:39 +00:00
|
|
|
static bool edgeTargetsEdgeSource(const void *Node, EdgeIter I) {
|
|
|
|
return false;
|
|
|
|
}
|
2002-10-07 18:37:10 +00:00
|
|
|
|
|
|
|
/// getEdgeTarget - If edgeTargetsEdgeSource returns true, this method is
|
|
|
|
/// called to determine which outgoing edge of Node is the target of this
|
|
|
|
/// edge.
|
|
|
|
template<typename EdgeIter>
|
2002-10-17 00:16:39 +00:00
|
|
|
static EdgeIter getEdgeTarget(const void *Node, EdgeIter I) {
|
|
|
|
return I;
|
|
|
|
}
|
2002-10-16 01:44:59 +00:00
|
|
|
|
2008-07-21 21:06:55 +00:00
|
|
|
/// hasEdgeDestLabels - If this function returns true, the graph is able
|
|
|
|
/// to provide labels for edge destinations.
|
|
|
|
static bool hasEdgeDestLabels() {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// numEdgeDestLabels - If hasEdgeDestLabels, this function returns the
|
|
|
|
/// number of incoming edge labels the given node has.
|
|
|
|
static unsigned numEdgeDestLabels(const void *Node) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getEdgeDestLabel - If hasEdgeDestLabels, this function returns the
|
|
|
|
/// incoming edge label with the given index in the given node.
|
|
|
|
static std::string getEdgeDestLabel(const void *Node, unsigned i) {
|
|
|
|
return "";
|
|
|
|
}
|
|
|
|
|
2002-10-16 01:44:59 +00:00
|
|
|
/// addCustomGraphFeatures - If a graph is made up of more than just
|
|
|
|
/// straight-forward nodes and edges, this is the place to put all of the
|
2003-08-18 14:43:39 +00:00
|
|
|
/// custom stuff necessary. The GraphWriter object, instantiated with your
|
2002-10-16 01:44:59 +00:00
|
|
|
/// GraphType is passed in as an argument. You may call arbitrary methods on
|
|
|
|
/// it to add things to the output graph.
|
|
|
|
///
|
2007-05-14 14:23:27 +00:00
|
|
|
template<typename GraphType, typename GraphWriter>
|
2007-12-16 00:42:19 +00:00
|
|
|
static void addCustomGraphFeatures(const GraphType& Graph, GraphWriter &GW) {}
|
2002-10-07 18:37:10 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/// DOTGraphTraits - Template class that can be specialized to customize how
|
|
|
|
/// graphs are converted to 'dot' graphs. When specializing, you may inherit
|
|
|
|
/// from DefaultDOTGraphTraits if you don't need to override everything.
|
|
|
|
///
|
|
|
|
template <typename Ty>
|
2009-11-30 12:38:13 +00:00
|
|
|
struct DOTGraphTraits : public DefaultDOTGraphTraits {
|
|
|
|
DOTGraphTraits (bool simple=false) : DefaultDOTGraphTraits (simple) {}
|
|
|
|
};
|
2002-10-07 18:37:10 +00:00
|
|
|
|
2003-11-11 22:41:34 +00:00
|
|
|
} // End llvm namespace
|
|
|
|
|
2002-10-07 18:37:10 +00:00
|
|
|
#endif
|