Home
last modified time | relevance | path

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

12345

/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DDOTGraphTraitsPass.h35 ViewGraph(Graph, Name, IsSimple, in viewGraphForFunction()
64 GraphT Graph = AnalysisGraphTraitsT::getGraph(Result); in run() local
65 viewGraphForFunction(F, Graph, Name, IsSimple); in run()
98 WriteGraph(File, Graph, IsSimple, in printGraphForFunction()
132 printGraphForFunction(F, Graph, Name, IsSimple); in run()
186 viewGraphForFunction(F, Graph, Name, IsSimple); in runOnFunction()
225 printGraphForFunction(F, Graph, Name, IsSimple); in runOnFunction()
251 ViewGraph(Graph, Name, IsSimple, Title); in runOnModule()
284 WriteGraph(File, Graph, IsSimple, Title); in runOnModule()
302 void WriteDOTGraphToFile(Function &F, GraphT &&Graph, in WriteDOTGraphToFile() argument
[all …]
/llvm-project-15.0.7/llvm/lib/Target/X86/
H A DX86LoadValueInjectionLoadHardening.cpp278 if (Graph == nullptr) in runOnMachineFunction()
605 Graph->NumFences = 0; in trimMitigatedEdges()
608 Graph = GraphBuilder::trim(*Graph, ElimNodes, ElimEdges, 0 /* NumFences */, in trimMitigatedEdges()
611 return Graph; in trimMitigatedEdges()
620 Graph = trimMitigatedEdges(std::move(Graph)); in hardenLoadsWithPlugin()
633 Nodes[Graph->getNodeIndex(N)] = Graph->getEdgeIndex(*N.edges_begin()); in hardenLoadsWithPlugin()
635 Nodes[Graph->nodes_size()] = Graph->edges_size(); // terminator node in hardenLoadsWithPlugin()
637 Edges[Graph->getEdgeIndex(E)] = Graph->getNodeIndex(*E.getDest()); in hardenLoadsWithPlugin()
653 Graph = GraphBuilder::trim(*Graph, NodeSet{*Graph}, CutEdges); in hardenLoadsWithPlugin()
665 Graph = trimMitigatedEdges(std::move(Graph)); in hardenLoadsWithHeuristic()
[all …]
/llvm-project-15.0.7/llvm/unittests/ADT/
H A DTestGraph.h25 class Graph {
28 Graph(const Graph&);
29 Graph& operator=(const Graph&);
108 Graph() { in Graph() function
164 friend class Graph; variable
235 struct GraphTraits<Graph<N> > {
236 typedef typename Graph<N>::NodeType *NodeRef;
237 typedef typename Graph<N>::ChildIterator ChildIteratorType;
239 static NodeRef getEntryNode(const Graph<N> &G) { return G.AccessNode(0); }
241 return Graph<N>::child_begin(Node);
[all …]
H A DBreadthFirstIteratorTest.cpp18 typedef bf_iterator<Graph<4>> BFIter; in TEST()
20 Graph<4> G; in TEST()
43 typedef bf_iterator<Graph<4>> BFIter; in TEST()
45 Graph<4> G; in TEST()
H A DDepthFirstIteratorTest.cpp41 typedef CountedSet<Graph<3>::NodeType *> StorageT; in TEST()
42 typedef df_iterator<Graph<3>, StorageT, true> DFIter; in TEST()
44 Graph<3> G; in TEST()
H A DPostOrderIteratorTest.cpp41 Graph<6> G; in TEST()
63 ReversePostOrderTraversal<Graph<6>> RPOT(G); in TEST()
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DCFLGraph.h169 CFLGraph Graph; variable
179 CFLGraph &Graph; variable
207 if (Graph.addNode(InstantiatedValue{GVal, 0},
216 Graph.addNode(InstantiatedValue{Val, 0}, Attr);
243 Graph.addNode(InstantiatedValue{From, 1}); in addDerefEdge()
246 Graph.addNode(InstantiatedValue{To, 1}); in addDerefEdge()
256 : AA(Builder.Analysis), DL(DL), TLI(Builder.TLI), Graph(Builder.Graph), in GetEdgesVisitor()
407 Graph.addNode(IRelation->From); in tryInterproceduralAnalysis()
408 Graph.addNode(IRelation->To); in tryInterproceduralAnalysis()
417 Graph.addNode(IAttr->IValue, IAttr->Attr); in tryInterproceduralAnalysis()
[all …]
H A DDependenceGraphBuilder.cpp82 for (auto *N : Graph) { in createAndConnectRootNode()
113 for (auto &SCC : make_range(scc_begin(&Graph), scc_end(&Graph))) { in createPiBlocks()
138 for (NodeType *N : Graph) { in createPiBlocks()
229 for (NodeType *N : Graph) { in createDefUseEdges()
283 for (DGIterator SrcIt = Graph.begin(), E = Graph.end(); SrcIt != E; ++SrcIt) { in createMemoryDependencyEdges()
394 for (NodeType *N : Graph) { in simplify()
415 for (NodeType *N : Graph) { in simplify()
490 for (NodeType *N : post_order(&Graph)) { in sortNodesTopologically()
500 size_t OldSize = Graph.Nodes.size(); in sortNodesTopologically()
501 Graph.Nodes.clear(); in sortNodesTopologically()
[all …]
H A DDDGPrinter.cpp60 const DataDependenceGraph *Graph) { in getNodeLabel() argument
62 return getSimpleNodeLabel(Node, Graph); in getNodeLabel()
64 return getVerboseNodeLabel(Node, Graph); in getNodeLabel()
78 const DataDependenceGraph *Graph) { in isNodeHidden() argument
81 assert(Graph && "expected a valid graph pointer"); in isNodeHidden()
82 return Graph->getPiBlock(*Node) != nullptr; in isNodeHidden()
H A DCFLAndersAliasAnalysis.cpp608 for (const auto &Mapping : Graph.value_mappings()) { in initializeWorkList()
631 if (Graph.getNode(NodeBelow)) in getNodeBelow()
642 auto NodeInfo = Graph.getNode(ToNode); in processWorkListItem()
653 auto FromNodeBelow = getNodeBelow(Graph, FromNode); in processWorkListItem()
654 auto ToNodeBelow = getNodeBelow(Graph, ToNode); in processWorkListItem()
741 for (const auto &Mapping : Graph.value_mappings()) { in buildAttrMap()
765 auto DstBelow = getNodeBelow(Graph, Dst); in buildAttrMap()
771 DstBelow = getNodeBelow(Graph, *DstBelow); in buildAttrMap()
787 auto &Graph = GraphBuilder.getCFLGraph(); in buildInfoFrom() local
793 initializeWorkList(WorkList, ReachSet, Graph); in buildInfoFrom()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h46 class Graph : public GraphBase {
118 void connect(Graph &G, EdgeId ThisEdgeId) { in connect()
176 Graph(const Graph &Other) {} in Graph() function
225 void operator=(const Graph &Other) {}
238 NodeItr(NodeId CurNId, const Graph &G) in NodeItr()
262 EdgeItr(EdgeId CurEId, const Graph &G) in EdgeItr()
286 NodeIdSet(const Graph &G) : G(G) {} in NodeIdSet()
298 const Graph& G;
303 EdgeIdSet(const Graph &G) : G(G) {} in EdgeIdSet()
315 const Graph& G;
[all …]
/llvm-project-15.0.7/clang-tools-extra/pseudo/lib/grammar/
H A DLRTableBuild.cpp92 auto Graph = LRGraph::buildLR0(G); in buildSLR() local
94 Build.StartStates = Graph.startStates(); in buildSLR()
95 for (const auto &T : Graph.edges()) in buildSLR()
97 for (const auto &Entry : Graph.recoveries()) in buildSLR()
101 assert(Graph.states().size() <= (1 << StateBits) && in buildSLR()
104 for (StateID SID = 0; SID < Graph.states().size(); ++SID) { in buildSLR()
105 for (const Item &I : Graph.states()[SID].Items) { in buildSLR()
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DScheduleDAGPrinter.cpp38 const ScheduleDAG *Graph) { in getNodeIdentifierLabel()
49 const ScheduleDAG *Graph) { in getEdgeAttributes()
58 std::string getNodeLabel(const SUnit *SU, const ScheduleDAG *Graph);
60 const ScheduleDAG *Graph) { in getNodeAttributes()
H A DMachineBlockFrequencyInfo.cpp128 const MachineBlockFrequencyInfo *Graph) { in getNodeLabel()
145 return MBFIDOTGraphTraitsBase::getNodeLabel(Node, Graph, getGVDT(), in getNodeLabel()
150 const MachineBlockFrequencyInfo *Graph) { in getNodeAttributes()
151 return MBFIDOTGraphTraitsBase::getNodeAttributes(Node, Graph, in getNodeAttributes()
/llvm-project-15.0.7/llvm/lib/Target/WebAssembly/
H A DWebAssemblyFixIrreducibleControlFlow.cpp244 MachineFunction &MF, const ReachabilityGraph &Graph);
257 ReachabilityGraph Graph(Entry, Blocks); in processRegion() local
261 for (auto *LoopEntry : getSortedEntries(Graph.getLoopEntries())) { in processRegion()
289 for (auto *OtherLoopEntry : Graph.getLoopEntries()) { in processRegion()
291 Graph.canReach(LoopEntry, OtherLoopEntry) && in processRegion()
292 Graph.canReach(OtherLoopEntry, LoopEntry)) { in processRegion()
298 makeSingleEntryLoop(MutualLoopEntries, Blocks, MF, Graph); in processRegion()
314 for (auto *LoopEntry : Graph.getLoopEntries()) { in processRegion()
315 LoopBlocks InnerBlocks(LoopEntry, Graph.getLoopEnterers(LoopEntry)); in processRegion()
339 const ReachabilityGraph &Graph) { in makeSingleEntryLoop() argument
[all …]
/llvm-project-15.0.7/mlir/include/mlir/IR/
H A DRegionGraphTraits.h42 return inverseGraph.Graph;
74 static NodeRef getEntryNode(GraphType fn) { return &fn.Graph->front(); }
78 return nodes_iterator(fn.Graph->begin());
81 return nodes_iterator(fn.Graph->end());
H A DRegionKindInterface.h28 Graph, enumerator
36 static RegionKind getRegionKind(unsigned index) { return RegionKind::Graph; } in getRegionKind()
/llvm-project-15.0.7/llvm/tools/llvm-cfi-verify/lib/
H A DFileAnalysis.cpp282 FileAnalysis::validateCFIProtection(const GraphResult &Graph) const { in validateCFIProtection()
283 const Instr *InstrMetaPtr = getInstruction(Graph.BaseAddress); in validateCFIProtection()
294 if (!Graph.OrphanedNodes.empty()) in validateCFIProtection()
297 for (const auto &BranchNode : Graph.ConditionalBranchNodes) { in validateCFIProtection()
302 if (indirectCFOperandClobber(Graph) != Graph.BaseAddress) in validateCFIProtection()
308 uint64_t FileAnalysis::indirectCFOperandClobber(const GraphResult &Graph) const { in indirectCFOperandClobber()
309 assert(Graph.OrphanedNodes.empty() && "Orphaned nodes should be empty."); in indirectCFOperandClobber()
312 const Instr &IndirectCF = getInstructionOrDie(Graph.BaseAddress); in indirectCFOperandClobber()
321 for (const auto &Branch : Graph.ConditionalBranchNodes) { in indirectCFOperandClobber()
335 std::vector<uint64_t> Nodes = Graph.flattenAddress(Node); in indirectCFOperandClobber()
[all …]
/llvm-project-15.0.7/llvm/tools/llvm-cfi-verify/
H A Dllvm-cfi-verify.cpp93 const GraphResult &Graph, in printInstructionInformation() argument
101 Graph.printToDOT(Analysis, outs()); in printInstructionInformation()
141 GraphResult Graph = GraphBuilder::buildFlowGraph(Analysis, Address); in printIndirectCFInstructions() local
144 Analysis.validateCFIProtection(Graph); in printIndirectCFInstructions()
149 printInstructionInformation(Analysis, InstrMeta, Graph, ProtectionStatus); in printIndirectCFInstructions()
/llvm-project-15.0.7/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGPrinter.cpp77 const SelectionDAG *Graph) { in getNodeIdentifierLabel()
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()
/llvm-project-15.0.7/clang/test/Analysis/exploded-graph-rewriter/
H A Dempty.dot5 digraph "Exploded Graph" {
6 label="Exploded Graph";
/llvm-project-15.0.7/llvm/unittests/XRay/
H A DGraphTest.cpp25 typedef Graph<VAttr, EAttr, unsigned> GraphT;
32 T Graph = getTestGraph(); member in __anon607010c10111::GraphTest
148 auto &G = this->Graph; in TYPED_TEST()
154 auto &G = this->Graph; in TYPED_TEST()
160 TypeParam G(this->Graph); in TYPED_TEST()
167 TypeParam G = this->Graph; in TYPED_TEST()
174 TypeParam G(std::move(this->Graph)); in TYPED_TEST()
/llvm-project-15.0.7/llvm/include/llvm/XRay/
H A DGraph.h74 class Graph {
202 using GraphT = std::conditional_t<isConst, const Graph, Graph>;
278 using GraphT = std::conditional_t<isConst, const Graph, Graph>;
315 using GraphT = std::conditional_t<isConst, const Graph, Graph>;
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h288 using Graph = PBQP::Graph<RegAllocSolverImpl>; variable
290 RegAllocSolverImpl(Graph &G) : G(G) {} in RegAllocSolverImpl()
482 SpillCostComparator(const Graph& G) : G(G) {} in SpillCostComparator()
493 const Graph& G;
496 Graph& G;
503 class PBQPRAGraph : public PBQP::Graph<RegAllocSolverImpl> {
505 using BaseT = PBQP::Graph<RegAllocSolverImpl>;
/llvm-project-15.0.7/polly/docs/experiments/matmul/
H A Dscopsonly.init_array.dot1 digraph "Scop Graph for 'init_array' function" {
2 label="Scop Graph for 'init_array' function";

12345