Home
last modified time | relevance | path

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

123

/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86LoadValueInjectionLoadHardening.cpp165 std::unique_ptr<MachineGadgetGraph> Graph) const;
167 std::unique_ptr<MachineGadgetGraph> Graph) const;
172 trimMitigatedEdges(std::unique_ptr<MachineGadgetGraph> Graph) const;
275 std::unique_ptr<MachineGadgetGraph> Graph = getGadgetGraph(MF, MLI, MDT, MDF); in runOnMachineFunction() local
277 if (Graph == nullptr) in runOnMachineFunction()
281 writeGadgetGraph(outs(), MF, Graph.get()); in runOnMachineFunction()
294 writeGadgetGraph(FileOut, MF, Graph.get()); in runOnMachineFunction()
314 FencesInserted = hardenLoadsWithPlugin(MF, std::move(Graph)); in runOnMachineFunction()
316 FencesInserted = hardenLoadsWithHeuristic(MF, std::move(Graph)); in runOnMachineFunction()
596 std::unique_ptr<MachineGadgetGraph> Graph) const { in trimMitigatedEdges()
[all …]
/freebsd/contrib/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()
105 void printGraphForFunction(Function &F, GraphT Graph, StringRef Name, in printGraphForFunction() argument
115 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in printGraphForFunction()
118 WriteGraph(File, Graph, IsSimple, in printGraphForFunction()
150 GraphT Graph = AnalysisGraphTraitsT::getGraph(Result); in run() local
152 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()
179 GraphType &Graph;
180 GraphType &Graph; global() variable
H A DRegionPrinter.h34 std::string getNodeLabel(RegionNode *Node, RegionNode *Graph);
H A DBlockFrequencyInfoImpl.h1815 std::string getNodeAttributes(NodeRef Node, const BlockFrequencyInfoT *Graph,
1823 for (NodeIter I = GTraits::nodes_begin(Graph),
1824 E = GTraits::nodes_end(Graph);
1828 std::max(MaxFrequency, Graph->getBlockFreq(N).getFrequency());
1831 BlockFrequency Freq = Graph->getBlockFreq(Node);
1845 std::string getNodeLabel(NodeRef Node, const BlockFrequencyInfoT *Graph,
1856 OS << printBlockFreq(*Graph, *Node);
1859 OS << Graph->getBlockFreq(Node).getFrequency();
1862 auto Count = Graph->getBlockProfileCount(Node);
/freebsd/contrib/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()
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()
/freebsd/contrib/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 …]
/freebsd/contrib/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 …]
/freebsd/contrib/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()
/freebsd/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'
H A Dsuff-self.exp1 make: Graph cycles through suff-self.suff
/freebsd/contrib/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()
/freebsd/contrib/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...]
/freebsd/contrib/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>;
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGraphTraits.h98 const GraphType &Graph; member
100 inline Inverse(const GraphType &G) : Graph(G) {} in Inverse()
/freebsd/contrib/llvm-project/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();
/freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/
H A DSPIRVDuplicatesTracker.cpp34 std::vector<SPIRV::DTSortableEntry *> &Graph, in buildDepsGraph() argument
47 Graph.push_back(E); in buildDepsGraph()
/freebsd/contrib/llvm-project/llvm/lib/Passes/
H A DStandardInstrumentations.cpp1180 Graph[&BB][Succ]++; in CFG()
1223 if (Before.Graph.size() != After.Graph.size()) in printDiff()
1225 << Before.Graph.size() << ", after=" << After.Graph.size() << "\n"; in printDiff()
1227 for (auto &BB : Before.Graph) { in printDiff()
1228 auto BA = After.Graph.find(BB.first); in printDiff()
1229 if (BA == After.Graph.end()) { in printDiff()
1236 for (auto &BA : After.Graph) { in printDiff()
1237 auto BB = Before.Graph.find(BA.first); in printDiff()
1238 if (BB == Before.Graph.end()) { in printDiff()
1794 : Graph(G), N(N), Data{&BD, nullptr}, Colour(Colour) {} in DotCfgDiffNode()
[all …]
/freebsd/sys/contrib/device-tree/Bindings/sound/
H A Daudio-graph-card.txt1 Audio Graph Card:
3 Audio Graph Card specifies audio DAI connections of SoC <-> codec.
7 Basically, Audio Graph Card property is same as Simple Card.
/freebsd/contrib/llvm-project/clang/lib/AST/
H A DStmtViz.cpp34 static std::string getNodeLabel(const Stmt* Node, const Stmt* Graph) { in getNodeLabel()
/freebsd/sys/contrib/device-tree/src/arm64/renesas/
H A Dulcb-audio-graph-card2.dtsi3 * Device Tree for ULCB + Audio Graph Card2

123