Home
last modified time | relevance | path

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

12

/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DDOTGraphTraitsPass.h55 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); in runOnFunction() local
56 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnFunction()
59 ViewGraph(Graph, Name, IsSimple, Title); in runOnFunction()
97 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); in runOnFunction() local
104 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnFunction()
108 WriteGraph(File, Graph, IsSimple, Title); in runOnFunction()
134 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); in runOnModule() local
135 std::string Title = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnModule()
137 ViewGraph(Graph, Name, IsSimple, Title); in runOnModule()
167 std::string Title = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnModule()
[all …]
H A DCFGPrinter.h121 const Function *Graph) {
123 return getSimpleNodeLabel(Node, Graph);
125 return getCompleteNodeLabel(Node, Graph);
H A DBlockFrequencyInfoImpl.h1381 std::string getNodeAttributes(NodeRef Node, const BlockFrequencyInfoT *Graph,
1389 for (NodeIter I = GTraits::nodes_begin(Graph),
1390 E = GTraits::nodes_end(Graph);
1394 std::max(MaxFrequency, Graph->getBlockFreq(N).getFrequency());
1397 BlockFrequency Freq = Graph->getBlockFreq(Node);
1411 std::string getNodeLabel(NodeRef Node, const BlockFrequencyInfoT *Graph,
1422 Graph->printBlockFreq(OS, Node);
1425 OS << Graph->getBlockFreq(Node).getFrequency();
1428 auto Count = Graph->getBlockProfileCount(Node);
H A DInterval.h135 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DCFLGraph.h171 CFLGraph Graph; variable
181 CFLGraph &Graph; variable
210 if (Graph.addNode(InstantiatedValue{GVal, 0},
219 Graph.addNode(InstantiatedValue{Val, 0}, Attr);
246 Graph.addNode(InstantiatedValue{From, 1}); in addDerefEdge()
249 Graph.addNode(InstantiatedValue{To, 1}); in addDerefEdge()
259 : AA(Builder.Analysis), DL(DL), TLI(Builder.TLI), Graph(Builder.Graph), in GetEdgesVisitor()
398 Graph.addNode(IRelation->From); in tryInterproceduralAnalysis()
399 Graph.addNode(IRelation->To); in tryInterproceduralAnalysis()
408 Graph.addNode(IAttr->IValue, IAttr->Attr); in tryInterproceduralAnalysis()
[all …]
H A DCFLAndersAliasAnalysis.cpp607 for (const auto &Mapping : Graph.value_mappings()) { in initializeWorkList()
630 if (Graph.getNode(NodeBelow)) in getNodeBelow()
641 auto NodeInfo = Graph.getNode(ToNode); in processWorkListItem()
652 auto FromNodeBelow = getNodeBelow(Graph, FromNode); in processWorkListItem()
653 auto ToNodeBelow = getNodeBelow(Graph, ToNode); in processWorkListItem()
740 for (const auto &Mapping : Graph.value_mappings()) { in buildAttrMap()
764 auto DstBelow = getNodeBelow(Graph, Dst); in buildAttrMap()
770 DstBelow = getNodeBelow(Graph, *DstBelow); in buildAttrMap()
786 auto &Graph = GraphBuilder.getCFLGraph(); in buildInfoFrom() local
792 initializeWorkList(WorkList, ReachSet, Graph); in buildInfoFrom()
[all …]
H A DCallPrinter.cpp28 static std::string getGraphName(CallGraph *Graph) { return "Call graph"; } in getGraphName()
30 std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) { in getNodeLabel()
H A DBlockFrequencyInfo.cpp132 const BlockFrequencyInfo *Graph) { in getNodeLabel()
134 return BFIDOTGTraitsBase::getNodeLabel(Node, Graph, getGVDT()); in getNodeLabel()
138 const BlockFrequencyInfo *Graph) { in getNodeAttributes()
139 return BFIDOTGTraitsBase::getNodeAttributes(Node, Graph, in getNodeAttributes()
H A DCFLSteensAliasAnalysis.cpp189 auto &Graph = GraphBuilder.getCFLGraph(); in buildSetsFrom() local
190 for (const auto &Mapping : Graph.value_mappings()) { in buildSetsFrom()
210 for (const auto &Mapping : Graph.value_mappings()) { in buildSetsFrom()
H A DDomPrinter.cpp34 std::string getNodeLabel(DomTreeNode *Node, DomTreeNode *Graph) { in getNodeLabel()
H A DRegionPrinter.cpp44 std::string getNodeLabel(RegionNode *Node, RegionNode *Graph) { in getNodeLabel()
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h47 class Graph : public GraphBase {
119 void connect(Graph &G, EdgeId ThisEdgeId) { in connect()
177 Graph(const Graph &Other) {} in Graph() function
226 void operator=(const Graph &Other) {}
239 NodeItr(NodeId CurNId, const Graph &G) in NodeItr()
263 EdgeItr(EdgeId CurEId, const Graph &G) in EdgeItr()
287 NodeIdSet(const Graph &G) : G(G) {} in NodeIdSet()
299 const Graph& G;
304 EdgeIdSet(const Graph &G) : G(G) {} in EdgeIdSet()
316 const Graph& G;
[all …]
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DScheduleDAGPrinter.cpp44 const ScheduleDAG *Graph) { in getNodeIdentifierLabel()
55 const ScheduleDAG *Graph) { in getEdgeAttributes()
64 std::string getNodeLabel(const SUnit *SU, const ScheduleDAG *Graph);
66 const ScheduleDAG *Graph) { in getNodeAttributes()
H A DMachineBlockFrequencyInfo.cpp126 const MachineBlockFrequencyInfo *Graph) { in getNodeLabel()
143 return MBFIDOTGraphTraitsBase::getNodeLabel(Node, Graph, getGVDT(), in getNodeLabel()
148 const MachineBlockFrequencyInfo *Graph) { in getNodeAttributes()
149 return MBFIDOTGraphTraitsBase::getNodeAttributes(Node, Graph, in getNodeAttributes()
/freebsd-12.1/contrib/bmake/unit-tests/
H A Ddotwait.exp27 make: Graph cycles through `cycle.2.99'
28 make: Graph cycles through `cycle.2.98'
29 make: Graph cycles through `cycle.2.97'
/freebsd-12.1/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGPrinter.cpp82 const SelectionDAG *Graph) { in getNodeIdentifierLabel()
97 const SelectionDAG *Graph) { in getEdgeAttributes()
117 std::string getNodeLabel(const SDNode *Node, const SelectionDAG *Graph);
119 const SelectionDAG *Graph) { in getNodeAttributes()
121 const std::string &Attrs = Graph->getGraphAttrs(N); in getNodeAttributes()
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h286 using Graph = PBQP::Graph<RegAllocSolverImpl>; variable
288 RegAllocSolverImpl(Graph &G) : G(G) {} in RegAllocSolverImpl()
480 SpillCostComparator(const Graph& G) : G(G) {} in SpillCostComparator()
491 const Graph& G;
494 Graph& G;
501 class PBQPRAGraph : public PBQP::Graph<RegAllocSolverImpl> {
503 using BaseT = PBQP::Graph<RegAllocSolverImpl>;
/freebsd-12.1/contrib/llvm/include/llvm/XRay/
H A DGraph.h75 class Graph {
203 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
279 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
316 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
/freebsd-12.1/contrib/llvm/include/llvm/ADT/
H A DGraphTraits.h97 const GraphType &Graph; member
99 inline Inverse(const GraphType &G) : Graph(G) {} in Inverse()
/freebsd-12.1/contrib/llvm/include/llvm/IR/
H A DCFG.h331 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
340 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
395 return &G.Graph->getEntryBlock();
401 return &G.Graph->getEntryBlock();
/freebsd-12.1/contrib/llvm/tools/clang/lib/AST/
H A DStmtViz.cpp35 static std::string getNodeLabel(const Stmt* Node, const Stmt* Graph) { in getNodeLabel()
/freebsd-12.1/contrib/llvm/tools/llvm-xray/
H A Dxray-graph-diff.h46 using GraphT = Graph<VertexAttribute, EdgeAttribute, StringRef>;
H A Dxray-graph.h85 class GraphT : public Graph<FunctionStats, CallStats, int32_t> {
/freebsd-12.1/contrib/file/magic/Magdir/
H A Dmsx89 >>>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
H A Dcoverage60 >&0 search/128 \x20\x20\x20\x20\x20\x20\x20\x20-:\x20\x20\x20\ 0:Graph:

12