Home
last modified time | relevance | path

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

1234

/openbsd-src/gnu/llvm/llvm/include/llvm/Analysis/
H A DDOTGraphTraitsPass.h31 void viewGraphForFunction(Function &F, GraphT Graph, StringRef Name, in viewGraphForFunction() argument
33 std::string GraphName = DOTGraphTraits<GraphT *>::getGraphName(&Graph); in viewGraphForFunction()
35 ViewGraph(Graph, Name, IsSimple, in viewGraphForFunction()
64 GraphT Graph = AnalysisGraphTraitsT::getGraph(Result); in run() local
65 viewGraphForFunction(F, Graph, Name, IsSimple); in run()
87 void printGraphForFunction(Function &F, GraphT Graph, StringRef Name, in printGraphForFunction() argument
95 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in printGraphForFunction()
98 WriteGraph(File, Graph, IsSimple, in printGraphForFunction()
130 GraphT Graph = AnalysisGraphTraitsT::getGraph(Result); in run() local
132 printGraphForFunction(F, Graph, Name, IsSimple); in run()
[all …]
H A DDDG.h354 Graph.addNode(*RN); in createRootNode()
360 Graph.addNode(*SN); in createFineGrainedNode()
366 Graph.addNode(*Pi); in createPiBlock()
372 Graph.connect(Src, Tgt, *E); in createDefUseEdge()
378 Graph.connect(Src, Tgt, *E); in createMemoryEdge()
385 Graph.connect(Src, Tgt, *E); in createRootedEdge()
H A DDependenceGraphBuilder.h45 : Graph(G), DI(D), BBList(BBs) {} in AbstractDependenceGraphBuilder()
180 GraphType &Graph; variable
/openbsd-src/gnu/llvm/llvm/lib/Target/X86/
H A DX86LoadValueInjectionLoadHardening.cpp166 std::unique_ptr<MachineGadgetGraph> Graph) const;
168 std::unique_ptr<MachineGadgetGraph> Graph) const;
173 trimMitigatedEdges(std::unique_ptr<MachineGadgetGraph> Graph) const;
276 std::unique_ptr<MachineGadgetGraph> Graph = getGadgetGraph(MF, MLI, MDT, MDF); in runOnMachineFunction() local
278 if (Graph == nullptr) in runOnMachineFunction()
282 writeGadgetGraph(outs(), MF, Graph.get()); in runOnMachineFunction()
295 writeGadgetGraph(FileOut, MF, Graph.get()); in runOnMachineFunction()
315 FencesInserted = hardenLoadsWithPlugin(MF, std::move(Graph)); in runOnMachineFunction()
317 FencesInserted = hardenLoadsWithHeuristic(MF, std::move(Graph)); in runOnMachineFunction()
598 std::unique_ptr<MachineGadgetGraph> Graph) const { in trimMitigatedEdges()
[all …]
/openbsd-src/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.mike/
H A Dp1989.C344 class Graph {
346 Graph();
347 Graph(const Graph&);
348 ~Graph();
377 Graph<T>::Graph(): in Graph() function
382 Graph<T>::Graph(const Graph& other): in Graph() function
393 Graph<T>::~Graph() in ~Graph()
400 Graph<T>::add(const T& from, const T& to) in add()
411 Graph<T>::contains(const T& from, const T& to) const in contains()
427 Graph<T>::lookup(const T& from) const in lookup()
[all …]
/openbsd-src/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.brendan/
H A Dcrash16.C4 class Graph {
7 Graph(void) {}; // ERROR - previously defined here in Graph() function
10 Graph::Graph(void) in Graph() function
/openbsd-src/gnu/llvm/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()
H A DBlockFrequencyInfo.cpp133 const BlockFrequencyInfo *Graph) { in getNodeLabel()
135 return BFIDOTGTraitsBase::getNodeLabel(Node, Graph, getGVDT()); in getNodeLabel()
139 const BlockFrequencyInfo *Graph) { in getNodeAttributes()
140 return BFIDOTGTraitsBase::getNodeAttributes(Node, Graph, in getNodeAttributes()
/openbsd-src/gnu/llvm/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 …]
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/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 …]
/openbsd-src/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.robertl/
H A Deb109.C21 class Graph
41 ostream& operator<<(ostream& os, Graph<VertexType,EdgeType>& G)
49 typename Graph<VertexType, EdgeType>::Successor::iterator
67 Graph<std::string, Empty> V(true); // ERROR - no bool constructor in main()
/openbsd-src/gnu/llvm/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 …]
H A DFileAnalysis.h154 CFIProtectionStatus validateCFIProtection(const GraphResult &Graph) const;
164 uint64_t indirectCFOperandClobber(const GraphResult& Graph) const;
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/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>;
/openbsd-src/gnu/llvm/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>;
/openbsd-src/gnu/llvm/llvm/include/llvm/ADT/
H A DGraphTraits.h98 const GraphType &Graph; member
100 inline Inverse(const GraphType &G) : Graph(G) {} in Inverse()
/openbsd-src/gnu/llvm/llvm/docs/DependenceGraphs/
H A Dindex.rst20 Data Dependence Graph
22 In its simplest form the Data Dependence Graph (or DDG) represents data
59 Program Dependence Graph
62 The Program Dependence Graph (or PDG) has a similar structure as the
78 Graph Construction
140 …ersity) and JOE D. WARREN (Rice University), 1987. The Program Dependence Graph and Its Use in Opt…
/openbsd-src/gnu/llvm/llvm/lib/Target/SPIRV/
H A DSPIRVDuplicatesTracker.cpp34 std::vector<SPIRV::DTSortableEntry *> &Graph, in buildDepsGraph() argument
46 Graph.push_back(E); in buildDepsGraph()
/openbsd-src/gnu/llvm/llvm/include/llvm/IR/
H A DCFG.h328 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
337 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
392 return &G.Graph->getEntryBlock();
398 return &G.Graph->getEntryBlock();
/openbsd-src/gnu/llvm/llvm/lib/Passes/
H A DStandardInstrumentations.cpp934 Graph[&BB][Succ]++; in CFG()
977 if (Before.Graph.size() != After.Graph.size()) in printDiff()
979 << Before.Graph.size() << ", after=" << After.Graph.size() << "\n"; in printDiff()
981 for (auto &BB : Before.Graph) { in printDiff()
982 auto BA = After.Graph.find(BB.first); in printDiff()
983 if (BA == After.Graph.end()) { in printDiff()
990 for (auto &BA : After.Graph) { in printDiff()
991 auto BB = Before.Graph.find(BA.first); in printDiff()
992 if (BB == Before.Graph.end()) { in printDiff()
1447 : Graph(G), N(N), Data{&BD, nullptr}, Colour(Colour) {} in DotCfgDiffNode()
[all …]

1234