Home
last modified time | relevance | path

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

1234

/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86LoadValueInjectionLoadHardening.cpp277 if (Graph == nullptr) in runOnMachineFunction()
603 Graph->NumFences = 0; in trimMitigatedEdges()
606 Graph = GraphBuilder::trim(*Graph, ElimNodes, ElimEdges, 0 /* NumFences */, in trimMitigatedEdges()
609 return Graph; in trimMitigatedEdges()
618 Graph = trimMitigatedEdges(std::move(Graph)); in hardenLoadsWithPlugin()
631 Nodes[Graph->getNodeIndex(N)] = Graph->getEdgeIndex(*N.edges_begin()); in hardenLoadsWithPlugin()
633 Nodes[Graph->nodes_size()] = Graph->edges_size(); // terminator node in hardenLoadsWithPlugin()
635 Edges[Graph->getEdgeIndex(E)] = Graph->getNodeIndex(*E.getDest()); in hardenLoadsWithPlugin()
651 Graph = GraphBuilder::trim(*Graph, NodeSet{*Graph}, CutEdges); in hardenLoadsWithPlugin()
663 Graph = trimMitigatedEdges(std::move(Graph)); in hardenLoadsWithHeuristic()
[all …]
/freebsd-14.2/contrib/llvm-project/clang/lib/Analysis/
H A DIntervalPartition.cpp105 void fillIntervalNode(CFGIntervalGraph &Graph, in fillIntervalNode() argument
113 CFGIntervalNode &Interval = Graph.emplace_back(Graph.size()); in fillIntervalNode()
144 CFGIntervalGraph Graph; in partitionIntoIntervalsImpl() local
171 Intervals.emplace_back(B, &Graph.back()); in partitionIntoIntervalsImpl()
196 return Graph; in partitionIntoIntervalsImpl()
209 return partitionIntoIntervalsImpl(Graph.size(), &Graph[0]); in partitionIntoIntervals()
219 unsigned Size = Graph.size(); in getIntervalWTO()
221 PrevSize = Graph.size(); in getIntervalWTO()
222 Graph = internal::partitionIntoIntervals(Graph); in getIntervalWTO()
223 Size = Graph.size(); in getIntervalWTO()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DDOTGraphTraitsPass.h38 ViewGraph(Graph, Name, IsSimple, in viewGraphForFunction()
67 GraphT Graph = AnalysisGraphTraitsT::getGraph(Result); in run() local
68 viewGraphForFunction(F, Graph, Name, IsSimple); in run()
119 WriteGraph(File, Graph, IsSimple, in printGraphForFunction()
153 printGraphForFunction(F, Graph, Name, IsSimple); in run()
207 viewGraphForFunction(F, Graph, Name, IsSimple); in runOnFunction()
246 printGraphForFunction(F, Graph, Name, IsSimple); in runOnFunction()
272 ViewGraph(Graph, Name, IsSimple, Title); in runOnModule()
306 WriteGraph(File, Graph, IsSimple, Title); in runOnModule()
324 void WriteDOTGraphToFile(Function &F, GraphT &&Graph, in WriteDOTGraphToFile() argument
[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; variable
H A DRegionPrinter.h34 std::string getNodeLabel(RegionNode *Node, RegionNode *Graph);
/freebsd-14.2/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-14.2/contrib/llvm-project/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 …]
/freebsd-14.2/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-14.2/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-14.2/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-14.2/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-14.2/contrib/llvm-project/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>;
/freebsd-14.2/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()
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>;
/freebsd-14.2/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-14.2/contrib/llvm-project/llvm/lib/Target/SPIRV/
H A DSPIRVDuplicatesTracker.cpp34 std::vector<SPIRV::DTSortableEntry *> &Graph, in buildDepsGraph() argument
46 Graph.push_back(E); in buildDepsGraph()
/freebsd-14.2/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-14.2/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-14.2/contrib/llvm-project/llvm/lib/Passes/
H A DStandardInstrumentations.cpp1106 Graph[&BB][Succ]++; in CFG()
1149 if (Before.Graph.size() != After.Graph.size()) in printDiff()
1151 << Before.Graph.size() << ", after=" << After.Graph.size() << "\n"; in printDiff()
1153 for (auto &BB : Before.Graph) { in printDiff()
1154 auto BA = After.Graph.find(BB.first); in printDiff()
1155 if (BA == After.Graph.end()) { in printDiff()
1162 for (auto &BA : After.Graph) { in printDiff()
1163 auto BB = Before.Graph.find(BA.first); in printDiff()
1164 if (BB == Before.Graph.end()) { in printDiff()
1703 : Graph(DN.Graph), N(DN.N), Data{DN.Data[0], DN.Data[1]}, in DotCfgDiffNode()
[all …]
/freebsd-14.2/contrib/llvm-project/clang/lib/AST/
H A DStmtViz.cpp34 static std::string getNodeLabel(const Stmt* Node, const Stmt* Graph) { in getNodeLabel()
/freebsd-14.2/sys/contrib/device-tree/src/arm64/renesas/
H A Dulcb-audio-graph-card2.dtsi3 * Device Tree for ULCB + Audio Graph Card2

1234