Home
last modified time | relevance | path

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

123456

/llvm-project/llvm/lib/Target/X86/
H A DX86LoadValueInjectionLoadHardening.cpp164 std::unique_ptr<MachineGadgetGraph> Graph) const;
166 std::unique_ptr<MachineGadgetGraph> Graph) const;
171 trimMitigatedEdges(std::unique_ptr<MachineGadgetGraph> Graph) const;
274 std::unique_ptr<MachineGadgetGraph> Graph = getGadgetGraph(MF, MLI, MDT, MDF); in runOnMachineFunction()
276 if (Graph == nullptr) in runOnMachineFunction()
280 writeGadgetGraph(outs(), MF, Graph.get()); in runOnMachineFunction()
293 writeGadgetGraph(FileOut, MF, Graph.get()); in runOnMachineFunction()
313 FencesInserted = hardenLoadsWithPlugin(MF, std::move(Graph)); in runOnMachineFunction()
315 FencesInserted = hardenLoadsWithHeuristic(MF, std::move(Graph)); in runOnMachineFunction()
331 // Build the Register Dataflow Graph usin in getGadgetGraph()
275 std::unique_ptr<MachineGadgetGraph> Graph = getGadgetGraph(MF, MLI, MDT, MDF); runOnMachineFunction() local
[all...]
/llvm-project/clang/lib/Analysis/
H A DIntervalPartition.cpp105 static void fillIntervalNode(CFGIntervalGraph &Graph, in fillIntervalNode() argument
113 CFGIntervalNode &Interval = Graph.emplace_back(Graph.size()); in fillIntervalNode()
144 CFGIntervalGraph Graph; in partitionIntoIntervalsImpl() local
158 fillIntervalNode(Graph, Index, Successors, Partitioned, EntryBlock); in partitionIntoIntervalsImpl()
159 Intervals.emplace_back(EntryBlock, &Graph.back()); in partitionIntoIntervalsImpl()
170 fillIntervalNode(Graph, Index, Successors, Partitioned, B); in partitionIntoIntervalsImpl()
171 Intervals.emplace_back(B, &Graph.back()); in partitionIntoIntervalsImpl()
196 return Graph; in partitionIntoIntervalsImpl()
208 CFGIntervalGraph partitionIntoIntervals(const CFGIntervalGraph &Graph) { in partitionIntoIntervals() argument
218 internal::CFGIntervalGraph Graph = internal::partitionIntoIntervals(Cfg); getIntervalWTO() local
[all...]
/llvm-project/llvm/include/llvm/Analysis/
H A DDOTGraphTraitsPass.h34 void viewGraphForFunction(Function &F, GraphT Graph, StringRef Name, in viewGraphForFunction() argument
36 std::string GraphName = DOTGraphTraits<GraphT *>::getGraphName(&Graph); in viewGraphForFunction()
38 ViewGraph(Graph, Name, IsSimple, in viewGraphForFunction()
67 GraphT Graph = AnalysisGraphTraitsT::getGraph(Result); in run() local
68 viewGraphForFunction(F, Graph, Name, IsSimple); in run()
102 void printGraphForFunction(Function &F, GraphT Graph, StringRef Name,
112 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in printGraphForFunction()
115 WriteGraph(File, Graph, IsSimple, in printGraphForFunction()
147 GraphT Graph = AnalysisGraphTraitsT::getGraph(Result); in run()
149 printGraphForFunction(F, Graph, Nam in run()
105 printGraphForFunction(Function & F,GraphT Graph,StringRef Name,bool IsSimple) printGraphForFunction() argument
150 GraphT Graph = AnalysisGraphTraitsT::getGraph(Result); run() local
205 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); runOnFunction() local
244 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); runOnFunction() local
268 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); runOnModule() local
294 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); runOnModule() local
323 WriteDOTGraphToFile(Function & F,GraphT && Graph,std::string FileNamePrefix,bool IsSimple) WriteDOTGraphToFile() argument
[all...]
/llvm-project/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.cpp24 typedef bf_iterator<Graph<4>> BFIter; in TEST()
26 Graph<4> G; in TEST()
49 typedef bf_iterator<Graph<4>> BFIter; in TEST()
51 Graph<4> G; in TEST()
80 std::is_convertible_v<decltype(*std::declval<bf_iterator<Graph<3>>>()),
81 typename bf_iterator<Graph<3>>::reference>);
85 bf_iterator<Graph<4>>::iterator_category>);
88 Graph<4> G;
H A DDepthFirstIteratorTest.cpp47 typedef CountedSet<Graph<3>::NodeType *> StorageT; in TEST()
48 typedef df_iterator<Graph<3>, StorageT, true> DFIter; in TEST()
50 Graph<3> G; in TEST()
61 std::is_convertible_v<decltype(*std::declval<df_iterator<Graph<3>>>()),
62 typename df_iterator<Graph<3>>::reference>);
66 df_iterator<Graph<4>>::iterator_category>);
70 static_assert(std::is_same_v<df_ext_iterator<Graph<4>>::iterator_category,
74 Graph<4> G;
H A DPostOrderIteratorTest.cpp46 std::is_convertible_v<decltype(*std::declval<po_iterator<Graph<3>>>()), in TEST()
47 typename po_iterator<Graph<3>>::reference>); in TEST()
51 Graph<6> G; in TEST()
73 ReversePostOrderTraversal<Graph<6>> RPOT(G); in TEST()
87 po_iterator<Graph<4>>::iterator_category>);
91 static_assert(std::is_same_v<po_ext_iterator<Graph<4>>::iterator_category,
95 Graph<4> G;
/llvm-project/clang/unittests/Analysis/
H A DIntervalPartitionTest.cpp192 auto Graph = partitionIntoIntervals(*Result.getCFG()); in TEST() local
193 EXPECT_EQ(Graph.size(), 1u); in TEST()
194 EXPECT_THAT(Graph, ElementsAre(isInterval(0, IsEmpty(), IsEmpty()))); in TEST()
207 auto Graph = partitionIntoIntervals(*Result.getCFG()); in TEST() local
209 Graph, in TEST()
228 auto Graph = partitionIntoIntervals(*Result.getCFG()); in TEST() local
230 Graph, in TEST()
252 auto Graph = partitionIntoIntervals(*Result.getCFG()); in TEST() local
254 Graph, in TEST()
275 auto Graph = partitionIntoIntervals(*Result.getCFG()); in TEST() local
[all …]
/llvm-project/llvm/lib/Analysis/
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()
/llvm-project/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h46 class Graph : public GraphBase {
80 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) { in removeAdjEdgeId()
111 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) { in connectToN()
118 void connect(Graph &G, EdgeId ThisEdgeId) { in connect()
132 void disconnectFromN(Graph &G, unsigned NIdx) { in disconnectFromN()
140 void disconnectFrom(Graph &G, NodeId NId) { in disconnectFrom()
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()
[all …]
/llvm-project/clang-tools-extra/pseudo/lib/grammar/
H A DLRTableBuild.cpp
/llvm-project/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/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/mlir/include/mlir/IR/
H A DRegionGraphTraits.h42 return inverseGraph.Graph;
75 return inverseGraph.Graph;
108 static NodeRef getEntryNode(GraphType fn) { return &fn.Graph->front(); }
112 return nodes_iterator(fn.Graph->begin());
115 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/llvm/tools/llvm-cfi-verify/lib/
H A DFileAnalysis.cpp286 FileAnalysis::validateCFIProtection(const GraphResult &Graph) const { in validateCFIProtection()
287 const Instr *InstrMetaPtr = getInstruction(Graph.BaseAddress); in validateCFIProtection()
298 if (!Graph.OrphanedNodes.empty()) in validateCFIProtection()
301 for (const auto &BranchNode : Graph.ConditionalBranchNodes) { in validateCFIProtection()
306 if (indirectCFOperandClobber(Graph) != Graph.BaseAddress) in validateCFIProtection()
312 uint64_t FileAnalysis::indirectCFOperandClobber(const GraphResult &Graph) const { in indirectCFOperandClobber()
313 assert(Graph.OrphanedNodes.empty() && "Orphaned nodes should be empty."); in indirectCFOperandClobber()
316 const Instr &IndirectCF = getInstructionOrDie(Graph.BaseAddress); in indirectCFOperandClobber()
325 for (const auto &Branch : Graph.ConditionalBranchNodes) { in indirectCFOperandClobber()
339 std::vector<uint64_t> Nodes = Graph.flattenAddress(Node); in indirectCFOperandClobber()
[all …]
/llvm-project/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/llvm/unittests/XRay/
H A DGraphTest.cpp25 typedef Graph<VAttr, EAttr, unsigned> GraphT;
32 T Graph = getTestGraph(); member in __anonf740e1440111::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/llvm/include/llvm/XRay/
H A DGraph.h1 //===-- Graph.h - XRay Graph Class ------------------------------*- C++ -*-===//
9 // A Graph Datatype for XRay.
29 /// A Graph object represents a Directed Graph and is used in XRay to compute
45 /// Graph is CopyConstructible, CopyAssignable, MoveConstructible and
48 /// Usage Example Graph with weighted edges and vertices:
49 /// Graph<int, int, int> G;
63 /// Graph<int, double, StrRef> StrG;
74 class Graph {
[all...]
/llvm-project/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/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h288 using Graph = PBQP::Graph<RegAllocSolverImpl>; variable
290 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>;
/llvm-project/clang/test/Analysis/exploded-graph-rewriter/
H A Dempty.dot5 digraph "Exploded Graph" {
6 label="Exploded Graph";
/llvm-project/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";

123456