003 File Manager
Current Path:
/usr/src/contrib/llvm-project/llvm/include/llvm/Support
usr
/
src
/
contrib
/
llvm-project
/
llvm
/
include
/
llvm
/
Support
/
📁
..
📄
AArch64TargetParser.def
(12.01 KB)
📄
AArch64TargetParser.h
(4.89 KB)
📄
AMDGPUMetadata.h
(17.98 KB)
📄
AMDHSAKernelDescriptor.h
(7.63 KB)
📄
ARMAttributeParser.h
(3.2 KB)
📄
ARMBuildAttributes.h
(8.6 KB)
📄
ARMEHABI.h
(3.72 KB)
📄
ARMTargetParser.def
(18.94 KB)
📄
ARMTargetParser.h
(8.76 KB)
📄
ARMWinEH.h
(18.27 KB)
📄
AlignOf.h
(1.56 KB)
📄
Alignment.h
(12.95 KB)
📄
Allocator.h
(16.54 KB)
📄
AllocatorBase.h
(3.87 KB)
📄
ArrayRecycler.h
(4.78 KB)
📄
Atomic.h
(1.09 KB)
📄
AtomicOrdering.h
(6.01 KB)
📄
Automaton.h
(9.64 KB)
📄
Base64.h
(1.84 KB)
📄
BinaryByteStream.h
(9.14 KB)
📄
BinaryItemStream.h
(3.63 KB)
📄
BinaryStream.h
(3.75 KB)
📄
BinaryStreamArray.h
(12.46 KB)
📄
BinaryStreamError.h
(1.29 KB)
📄
BinaryStreamReader.h
(11.01 KB)
📄
BinaryStreamRef.h
(10.09 KB)
📄
BinaryStreamWriter.h
(7.79 KB)
📄
BlockFrequency.h
(2.41 KB)
📄
BranchProbability.h
(7.92 KB)
📄
BuryPointer.h
(1.03 KB)
📄
CBindingWrapping.h
(1.86 KB)
📄
CFGDiff.h
(9.95 KB)
📄
CFGUpdate.h
(4.12 KB)
📄
COM.h
(1004 B)
📄
CRC.h
(1.63 KB)
📄
CachePruning.h
(3.5 KB)
📄
Capacity.h
(972 B)
📄
Casting.h
(13.92 KB)
📄
CheckedArithmetic.h
(3.71 KB)
📄
Chrono.h
(5.78 KB)
📄
CodeGen.h
(1.96 KB)
📄
CodeGenCoverage.h
(1.18 KB)
📄
CommandLine.h
(71.22 KB)
📄
Compiler.h
(19.5 KB)
📄
Compression.h
(1.39 KB)
📄
ConvertUTF.h
(11.4 KB)
📄
CrashRecoveryContext.h
(9.26 KB)
📄
DJB.h
(1.05 KB)
📄
DOTGraphTraits.h
(5.58 KB)
📄
DataExtractor.h
(30.28 KB)
📄
DataTypes.h
(775 B)
📄
Debug.h
(4.7 KB)
📄
DebugCounter.h
(7.01 KB)
📄
DynamicLibrary.h
(5.77 KB)
📄
ELFAttributeParser.h
(2.22 KB)
📄
ELFAttributes.h
(1.02 KB)
📄
Endian.h
(14.28 KB)
📄
EndianStream.h
(1.93 KB)
📄
Errc.h
(3.8 KB)
📄
Errno.h
(1.45 KB)
📄
Error.h
(43.82 KB)
📄
ErrorHandling.h
(6.39 KB)
📄
ErrorOr.h
(7.48 KB)
📄
ExtensibleRTTI.h
(4.02 KB)
📄
FileCheck.h
(6.69 KB)
📄
FileCollector.h
(3.74 KB)
📄
FileOutputBuffer.h
(3.36 KB)
📄
FileSystem.h
(53.03 KB)
📄
FileUtilities.h
(3.83 KB)
📄
Format.h
(9.45 KB)
📄
FormatAdapters.h
(3.38 KB)
📄
FormatCommon.h
(2.05 KB)
📄
FormatProviders.h
(15.27 KB)
📄
FormatVariadic.h
(9.88 KB)
📄
FormatVariadicDetails.h
(5.3 KB)
📄
FormattedStream.h
(6.42 KB)
📄
GenericDomTree.h
(30.89 KB)
📄
GenericDomTreeConstruction.h
(63.42 KB)
📄
GenericIteratedDominanceFrontier.h
(7.31 KB)
📄
GlobPattern.h
(1.35 KB)
📄
GraphWriter.h
(11.79 KB)
📄
Host.h
(2.68 KB)
📄
InitLLVM.h
(1.79 KB)
📄
ItaniumManglingCanonicalizer.h
(3.17 KB)
📄
JSON.h
(28.25 KB)
📄
KnownBits.h
(8.35 KB)
📄
LEB128.h
(5.74 KB)
📄
LineIterator.h
(2.62 KB)
📄
Locale.h
(223 B)
📄
LockFileManager.h
(3.13 KB)
📄
LowLevelTypeImpl.h
(11.94 KB)
📄
MD5.h
(3.39 KB)
📄
MSVCErrorWorkarounds.h
(2.62 KB)
📄
MachineValueType.h
(42.37 KB)
📄
ManagedStatic.h
(4.21 KB)
📄
MathExtras.h
(32.81 KB)
📄
MemAlloc.h
(3.21 KB)
📄
Memory.h
(6.94 KB)
📄
MemoryBuffer.h
(10.98 KB)
📄
MipsABIFlags.h
(3.92 KB)
📄
Mutex.h
(2.14 KB)
📄
NativeFormatting.h
(1.64 KB)
📄
OnDiskHashTable.h
(21.97 KB)
📄
OptimizedStructLayout.h
(5.89 KB)
📄
Parallel.h
(5.99 KB)
📄
Path.h
(15.6 KB)
📄
PluginLoader.h
(1.29 KB)
📄
PointerLikeTypeTraits.h
(5.69 KB)
📄
PrettyStackTrace.h
(4.45 KB)
📄
Printable.h
(1.5 KB)
📄
Process.h
(9.31 KB)
📄
Program.h
(10.35 KB)
📄
RISCVAttributeParser.h
(1.15 KB)
📄
RISCVAttributes.h
(1.2 KB)
📄
RISCVTargetParser.def
(446 B)
📄
RWMutex.h
(5.65 KB)
📄
RandomNumberGenerator.h
(2.29 KB)
📄
Recycler.h
(3.47 KB)
📄
RecyclingAllocator.h
(2.38 KB)
📄
Regex.h
(4.37 KB)
📄
Registry.h
(5.14 KB)
📄
ReverseIteration.h
(360 B)
📄
SHA1.h
(2.37 KB)
📄
SMLoc.h
(1.78 KB)
📄
SMTAPI.h
(16.33 KB)
📄
SaveAndRestore.h
(1.02 KB)
📄
ScaledNumber.h
(30.65 KB)
📄
ScopedPrinter.h
(11.39 KB)
📄
Signals.h
(5.22 KB)
📄
Signposts.h
(1.29 KB)
📄
SmallVectorMemoryBuffer.h
(2.28 KB)
📁
Solaris
📄
SourceMgr.h
(10.37 KB)
📄
SpecialCaseList.h
(6.01 KB)
📄
StringSaver.h
(1.94 KB)
📄
SuffixTree.h
(13.15 KB)
📄
SwapByteOrder.h
(4.8 KB)
📄
SymbolRemappingReader.h
(4.36 KB)
📄
SystemUtils.h
(1.02 KB)
📄
TarWriter.h
(941 B)
📄
TargetOpcodes.def
(22.01 KB)
📄
TargetParser.h
(4.08 KB)
📄
TargetRegistry.h
(46.87 KB)
📄
TargetSelect.h
(6.2 KB)
📄
TaskQueue.h
(4.24 KB)
📄
ThreadLocal.h
(2.08 KB)
📄
ThreadPool.h
(3.44 KB)
📄
Threading.h
(10.62 KB)
📄
TimeProfiler.h
(3.46 KB)
📄
Timer.h
(8.93 KB)
📄
ToolOutputFile.h
(2.24 KB)
📄
TrailingObjects.h
(15.19 KB)
📄
TrigramIndex.h
(2.84 KB)
📄
TypeName.h
(2.13 KB)
📄
TypeSize.h
(8.53 KB)
📄
Unicode.h
(2.5 KB)
📄
UnicodeCharRanges.h
(3.27 KB)
📄
Valgrind.h
(1.16 KB)
📄
VersionTuple.h
(5.22 KB)
📄
VirtualFileSystem.h
(28.28 KB)
📄
Watchdog.h
(1.15 KB)
📄
Win64EH.h
(4.82 KB)
📁
Windows
📄
WindowsError.h
(541 B)
📄
WithColor.h
(4.64 KB)
📄
X86DisassemblerDecoderCommon.h
(29.39 KB)
📄
X86TargetParser.def
(8.21 KB)
📄
X86TargetParser.h
(3.57 KB)
📄
YAMLParser.h
(16.29 KB)
📄
YAMLTraits.h
(67.62 KB)
📄
circular_raw_ostream.h
(4.97 KB)
📄
raw_os_ostream.h
(1.29 KB)
📄
raw_ostream.h
(20.82 KB)
📄
raw_sha1_ostream.h
(1.29 KB)
📄
thread.h
(1.33 KB)
📄
type_traits.h
(6.75 KB)
📄
xxhash.h
(1.92 KB)
Editing: GraphWriter.h
//===- llvm/Support/GraphWriter.h - Write graph to a .dot file --*- C++ -*-===// // // 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 a simple interface that can be used to print out generic // LLVM graphs to ".dot" files. "dot" is a tool that is part of the AT&T // graphviz package (http://www.research.att.com/sw/tools/graphviz/) which can // be used to turn the files output by this interface into a variety of // different graphics formats. // // Graphs do not need to implement any interface past what is already required // by the GraphTraits template, but they can choose to implement specializations // of the DOTGraphTraits template if they want to customize the graphs output in // any way. // //===----------------------------------------------------------------------===// #ifndef LLVM_SUPPORT_GRAPHWRITER_H #define LLVM_SUPPORT_GRAPHWRITER_H #include "llvm/ADT/GraphTraits.h" #include "llvm/ADT/StringRef.h" #include "llvm/ADT/Twine.h" #include "llvm/Support/DOTGraphTraits.h" #include "llvm/Support/FileSystem.h" #include "llvm/Support/raw_ostream.h" #include <algorithm> #include <cstddef> #include <iterator> #include <string> #include <type_traits> #include <vector> namespace llvm { namespace DOT { // Private functions... std::string EscapeString(const std::string &Label); /// Get a color string for this node number. Simply round-robin selects /// from a reasonable number of colors. StringRef getColorString(unsigned NodeNumber); } // end namespace DOT namespace GraphProgram { enum Name { DOT, FDP, NEATO, TWOPI, CIRCO }; } // end namespace GraphProgram bool DisplayGraph(StringRef Filename, bool wait = true, GraphProgram::Name program = GraphProgram::DOT); template<typename GraphType> class GraphWriter { raw_ostream &O; const GraphType &G; using DOTTraits = DOTGraphTraits<GraphType>; using GTraits = GraphTraits<GraphType>; using NodeRef = typename GTraits::NodeRef; using node_iterator = typename GTraits::nodes_iterator; using child_iterator = typename GTraits::ChildIteratorType; DOTTraits DTraits; static_assert(std::is_pointer<NodeRef>::value, "FIXME: Currently GraphWriter requires the NodeRef type to be " "a pointer.\nThe pointer usage should be moved to " "DOTGraphTraits, and removed from GraphWriter itself."); // Writes the edge labels of the node to O and returns true if there are any // edge labels not equal to the empty string "". bool getEdgeSourceLabels(raw_ostream &O, NodeRef Node) { child_iterator EI = GTraits::child_begin(Node); child_iterator EE = GTraits::child_end(Node); bool hasEdgeSourceLabels = false; for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i) { std::string label = DTraits.getEdgeSourceLabel(Node, EI); if (label.empty()) continue; hasEdgeSourceLabels = true; if (i) O << "|"; O << "<s" << i << ">" << DOT::EscapeString(label); } if (EI != EE && hasEdgeSourceLabels) O << "|<s64>truncated..."; return hasEdgeSourceLabels; } public: GraphWriter(raw_ostream &o, const GraphType &g, bool SN) : O(o), G(g) { DTraits = DOTTraits(SN); } void writeGraph(const std::string &Title = "") { // Output the header for the graph... writeHeader(Title); // Emit all of the nodes in the graph... writeNodes(); // Output any customizations on the graph DOTGraphTraits<GraphType>::addCustomGraphFeatures(G, *this); // Output the end of the graph writeFooter(); } void writeHeader(const std::string &Title) { std::string GraphName(DTraits.getGraphName(G)); if (!Title.empty()) O << "digraph \"" << DOT::EscapeString(Title) << "\" {\n"; else if (!GraphName.empty()) O << "digraph \"" << DOT::EscapeString(GraphName) << "\" {\n"; else O << "digraph unnamed {\n"; if (DTraits.renderGraphFromBottomUp()) O << "\trankdir=\"BT\";\n"; if (!Title.empty()) O << "\tlabel=\"" << DOT::EscapeString(Title) << "\";\n"; else if (!GraphName.empty()) O << "\tlabel=\"" << DOT::EscapeString(GraphName) << "\";\n"; O << DTraits.getGraphProperties(G); O << "\n"; } void writeFooter() { // Finish off the graph O << "}\n"; } void writeNodes() { // Loop over the graph, printing it out... for (const auto Node : nodes<GraphType>(G)) if (!isNodeHidden(Node)) writeNode(Node); } bool isNodeHidden(NodeRef Node) { return DTraits.isNodeHidden(Node); } void writeNode(NodeRef Node) { std::string NodeAttributes = DTraits.getNodeAttributes(Node, G); O << "\tNode" << static_cast<const void*>(Node) << " [shape=record,"; if (!NodeAttributes.empty()) O << NodeAttributes << ","; O << "label=\"{"; if (!DTraits.renderGraphFromBottomUp()) { O << DOT::EscapeString(DTraits.getNodeLabel(Node, G)); // If we should include the address of the node in the label, do so now. std::string Id = DTraits.getNodeIdentifierLabel(Node, G); if (!Id.empty()) O << "|" << DOT::EscapeString(Id); std::string NodeDesc = DTraits.getNodeDescription(Node, G); if (!NodeDesc.empty()) O << "|" << DOT::EscapeString(NodeDesc); } std::string edgeSourceLabels; raw_string_ostream EdgeSourceLabels(edgeSourceLabels); bool hasEdgeSourceLabels = getEdgeSourceLabels(EdgeSourceLabels, Node); if (hasEdgeSourceLabels) { if (!DTraits.renderGraphFromBottomUp()) O << "|"; O << "{" << EdgeSourceLabels.str() << "}"; if (DTraits.renderGraphFromBottomUp()) O << "|"; } if (DTraits.renderGraphFromBottomUp()) { O << DOT::EscapeString(DTraits.getNodeLabel(Node, G)); // If we should include the address of the node in the label, do so now. std::string Id = DTraits.getNodeIdentifierLabel(Node, G); if (!Id.empty()) O << "|" << DOT::EscapeString(Id); std::string NodeDesc = DTraits.getNodeDescription(Node, G); if (!NodeDesc.empty()) O << "|" << DOT::EscapeString(NodeDesc); } if (DTraits.hasEdgeDestLabels()) { O << "|{"; unsigned i = 0, e = DTraits.numEdgeDestLabels(Node); for (; i != e && i != 64; ++i) { if (i) O << "|"; O << "<d" << i << ">" << DOT::EscapeString(DTraits.getEdgeDestLabel(Node, i)); } if (i != e) O << "|<d64>truncated..."; O << "}"; } O << "}\"];\n"; // Finish printing the "node" line // Output all of the edges now child_iterator EI = GTraits::child_begin(Node); child_iterator EE = GTraits::child_end(Node); for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i) if (!DTraits.isNodeHidden(*EI)) writeEdge(Node, i, EI); for (; EI != EE; ++EI) if (!DTraits.isNodeHidden(*EI)) writeEdge(Node, 64, EI); } void writeEdge(NodeRef Node, unsigned edgeidx, child_iterator EI) { if (NodeRef TargetNode = *EI) { int DestPort = -1; if (DTraits.edgeTargetsEdgeSource(Node, EI)) { child_iterator TargetIt = DTraits.getEdgeTarget(Node, EI); // Figure out which edge this targets... unsigned Offset = (unsigned)std::distance(GTraits::child_begin(TargetNode), TargetIt); DestPort = static_cast<int>(Offset); } if (DTraits.getEdgeSourceLabel(Node, EI).empty()) edgeidx = -1; emitEdge(static_cast<const void*>(Node), edgeidx, static_cast<const void*>(TargetNode), DestPort, DTraits.getEdgeAttributes(Node, EI, G)); } } /// emitSimpleNode - Outputs a simple (non-record) node void emitSimpleNode(const void *ID, const std::string &Attr, const std::string &Label, unsigned NumEdgeSources = 0, const std::vector<std::string> *EdgeSourceLabels = nullptr) { O << "\tNode" << ID << "[ "; if (!Attr.empty()) O << Attr << ","; O << " label =\""; if (NumEdgeSources) O << "{"; O << DOT::EscapeString(Label); if (NumEdgeSources) { O << "|{"; for (unsigned i = 0; i != NumEdgeSources; ++i) { if (i) O << "|"; O << "<s" << i << ">"; if (EdgeSourceLabels) O << DOT::EscapeString((*EdgeSourceLabels)[i]); } O << "}}"; } O << "\"];\n"; } /// emitEdge - Output an edge from a simple node into the graph... void emitEdge(const void *SrcNodeID, int SrcNodePort, const void *DestNodeID, int DestNodePort, const std::string &Attrs) { if (SrcNodePort > 64) return; // Eminating from truncated part? if (DestNodePort > 64) DestNodePort = 64; // Targeting the truncated part? O << "\tNode" << SrcNodeID; if (SrcNodePort >= 0) O << ":s" << SrcNodePort; O << " -> Node" << DestNodeID; if (DestNodePort >= 0 && DTraits.hasEdgeDestLabels()) O << ":d" << DestNodePort; if (!Attrs.empty()) O << "[" << Attrs << "]"; O << ";\n"; } /// getOStream - Get the raw output stream into the graph file. Useful to /// write fancy things using addCustomGraphFeatures(). raw_ostream &getOStream() { return O; } }; template<typename GraphType> raw_ostream &WriteGraph(raw_ostream &O, const GraphType &G, bool ShortNames = false, const Twine &Title = "") { // Start the graph emission process... GraphWriter<GraphType> W(O, G, ShortNames); // Emit the graph. W.writeGraph(Title.str()); return O; } std::string createGraphFilename(const Twine &Name, int &FD); /// Writes graph into a provided {@code Filename}. /// If {@code Filename} is empty, generates a random one. /// \return The resulting filename, or an empty string if writing /// failed. template <typename GraphType> std::string WriteGraph(const GraphType &G, const Twine &Name, bool ShortNames = false, const Twine &Title = "", std::string Filename = "") { int FD; if (Filename.empty()) { Filename = createGraphFilename(Name.str(), FD); } else { std::error_code EC = sys::fs::openFileForWrite(Filename, FD); // Writing over an existing file is not considered an error. if (EC == std::errc::file_exists) { errs() << "file exists, overwriting" << "\n"; } else if (EC) { errs() << "error writing into file" << "\n"; return ""; } else { errs() << "writing to the newly created file " << Filename << "\n"; } } raw_fd_ostream O(FD, /*shouldClose=*/ true); if (FD == -1) { errs() << "error opening file '" << Filename << "' for writing!\n"; return ""; } llvm::WriteGraph(O, G, ShortNames, Title); errs() << " done. \n"; return Filename; } /// DumpDotGraph - Just dump a dot graph to the user-provided file name. #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP) template <typename GraphType> LLVM_DUMP_METHOD void dumpDotGraphToFile(const GraphType &G, const Twine &FileName, const Twine &Title, bool ShortNames = false, const Twine &Name = "") { llvm::WriteGraph(G, Name, ShortNames, Title, FileName.str()); } #endif /// ViewGraph - Emit a dot graph, run 'dot', run gv on the postscript file, /// then cleanup. For use from the debugger. /// template<typename GraphType> void ViewGraph(const GraphType &G, const Twine &Name, bool ShortNames = false, const Twine &Title = "", GraphProgram::Name Program = GraphProgram::DOT) { std::string Filename = llvm::WriteGraph(G, Name, ShortNames, Title); if (Filename.empty()) return; DisplayGraph(Filename, false, Program); } } // end namespace llvm #endif // LLVM_SUPPORT_GRAPHWRITER_H
Upload File
Create Folder