Home
last modified time | relevance | path

Searched refs:Graph (Results 1 – 25 of 34) sorted by relevance

12

/NextBSD/contrib/llvm/include/llvm/Analysis/
HDDOTGraphTraitsPass.h40 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); in runOnFunction() local
41 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnFunction()
44 ViewGraph(Graph, Name, IsSimple, Title); in runOnFunction()
67 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); in runOnFunction() local
74 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnFunction()
78 WriteGraph(File, Graph, IsSimple, Title); in runOnFunction()
104 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); in runOnModule() local
105 std::string Title = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnModule()
107 ViewGraph(Graph, Name, IsSimple, Title); in runOnModule()
130 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); in runOnModule() local
[all …]
HDCFGPrinter.h92 const Function *Graph) {
94 return getSimpleNodeLabel(Node, Graph);
96 return getCompleteNodeLabel(Node, Graph);
HDInterval.h139 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
/NextBSD/contrib/llvm/include/llvm/CodeGen/PBQP/
HDGraph.h49 class Graph : public GraphBase {
83 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) { in removeAdjEdgeId()
114 NIds[0] = NIds[1] = Graph::invalidNodeId(); in invalidate()
120 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) { in connectToN()
127 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) { in connectTo()
136 void connect(Graph &G, EdgeId ThisEdgeId) { in connect()
150 void disconnectFromN(Graph &G, unsigned NIdx) { in disconnectFromN()
158 void disconnectFrom(Graph &G, NodeId NId) { in disconnectFrom()
239 Graph(const Graph &Other) {} in Graph() function
240 void operator=(const Graph &Other) {}
[all …]
/NextBSD/contrib/llvm/include/llvm/ADT/
HDGraphTraits.h79 const GraphType &Graph; member
81 inline Inverse(const GraphType &G) : Graph(G) {} in Inverse()
92 return GraphTraits<T>::getEntryNode(G->Graph.Graph);
/NextBSD/contrib/llvm/lib/CodeGen/
HDScheduleDAGPrinter.cpp47 const ScheduleDAG *Graph) { in hasNodeAddressLabel()
55 const ScheduleDAG *Graph) { in getEdgeAttributes()
64 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph);
66 const ScheduleDAG *Graph) { in getNodeAttributes()
HDMachineBlockFrequencyInfo.cpp91 const MachineBlockFrequencyInfo *Graph) { in getNodeLabel()
98 Graph->printBlockFreq(OS, Node); in getNodeLabel()
101 OS << Graph->getBlockFreq(Node).getFrequency(); in getNodeLabel()
HDRegAllocPBQP.cpp812 typedef PBQP::RegAlloc::PBQPRAGraph Graph; typedef in __anon03a1d19f0211::PrintNodeInfo
815 PrintNodeInfo(NodeId NId, const Graph &G) : G(G), NId(NId) {} in PrintNodeInfo()
826 const Graph &G;
/NextBSD/contrib/bmake/unit-tests/
HDdotwait.exp25 make: Graph cycles through `cycle.2.99'
26 make: Graph cycles through `cycle.2.98'
27 make: Graph cycles through `cycle.2.97'
/NextBSD/contrib/llvm/lib/CodeGen/SelectionDAG/
HDSelectionDAGPrinter.cpp84 const SelectionDAG *Graph) { in hasNodeAddressLabel()
92 const SelectionDAG *Graph) { in getEdgeAttributes()
112 std::string getNodeLabel(const SDNode *Node, const SelectionDAG *Graph);
114 const SelectionDAG *Graph) { in getNodeAttributes()
116 const std::string &Attrs = Graph->getGraphAttrs(N); in getNodeAttributes()
/NextBSD/contrib/llvm/include/llvm/CodeGen/
HDRegAllocPBQP.h345 typedef PBQP::Graph<RegAllocSolverImpl> Graph; typedef
347 RegAllocSolverImpl(Graph &G) : G(G) {} in RegAllocSolverImpl()
545 SpillCostComparator(const Graph& G) : G(G) {} in SpillCostComparator()
554 const Graph& G;
557 Graph& G;
564 class PBQPRAGraph : public PBQP::Graph<RegAllocSolverImpl> {
566 typedef PBQP::Graph<RegAllocSolverImpl> BaseT;
HDMachineFunction.h542 return &G.Graph->front();
548 return &G.Graph->front();
HDMachineBasicBlock.h768 return G.Graph;
782 return G.Graph;
HDScheduleDAG.h41 template<class Graph> class GraphWriter;
/NextBSD/contrib/llvm/lib/Analysis/
HDBlockFrequencyInfo.cpp84 const BlockFrequencyInfo *Graph) { in getNodeLabel()
91 Graph->printBlockFreq(OS, Node); in getNodeLabel()
94 OS << Graph->getBlockFreq(Node).getFrequency(); in getNodeLabel()
HDCFLAliasAnalysis.cpp924 NodeMapT &Map, GraphT &Graph) { in addInstructionToGraph() argument
925 const auto findOrInsertNode = [&Map, &Graph](Value *Val) { in addInstructionToGraph()
929 auto NewNode = Graph.addNode(); in addInstructionToGraph()
956 const auto addEdgeToGraph = [&Graph, &findOrInsertNode](const Edge &E) { in addInstructionToGraph()
961 Graph.addEdge(From, To, std::make_pair(E.Weight, Attrs), in addInstructionToGraph()
987 NodeMapT &Map, GraphT &Graph) { in buildGraphFrom() argument
990 addInstructionToGraph(Analysis, Inst, ReturnedValues, Map, Graph); in buildGraphFrom()
1017 GraphT Graph; in buildSetsFrom() local
1020 buildGraphFrom(Analysis, Fn, ReturnedValues, Map, Graph); in buildSetsFrom()
1049 for (const auto &EdgeTuple : Graph.edgesFor(Node)) { in buildSetsFrom()
HDDomPrinter.cpp34 std::string getNodeLabel(DomTreeNode *Node, DomTreeNode *Graph) { in getNodeLabel()
HDRegionPrinter.cpp41 std::string getNodeLabel(RegionNode *Node, RegionNode *Graph) { in getNodeLabel()
/NextBSD/contrib/llvm/lib/Analysis/IPA/
HDCallPrinter.cpp28 static std::string getGraphName(CallGraph *Graph) { return "Call graph"; } in getGraphName()
30 std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) { in getNodeLabel()
/NextBSD/contrib/llvm/include/llvm/IR/
HDCFG.h327 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
340 return G.Graph;
389 return &G.Graph->getEntryBlock();
395 return &G.Graph->getEntryBlock();
/NextBSD/contrib/file/magic/Magdir/
HDmsx89 >>>3 uleshort 0x6A00 MSX Graph Saurus SR5 raw image
94 >>>3 uleshort 0xD400 MSX Graph Saurus SR7/SR8/SRS raw image
96 # Graph Saurus compressed images
100 >>>3 uleshort >0x013D MSX Graph Saurus compressed image
/NextBSD/contrib/llvm/tools/clang/lib/AST/
HDStmtViz.cpp35 static std::string getNodeLabel(const Stmt* Node, const Stmt* Graph) { in getNodeLabel()
/NextBSD/usr.sbin/bsdconfig/dot/
HDdot317 printf '\n\t/*\n\t * Graph setup and orientation\n\t */\n'
/NextBSD/contrib/llvm/tools/clang/include/clang/Analysis/
HDCFG.h1034 { return G.Graph; }
1048 { return G.Graph; }
/NextBSD/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/
HDCheckers.td514 HelpText<"View Call Graph using GraphViz">,
518 HelpText<"Display Call Graph">,

12