Home
last modified time | relevance | path

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

1234

/netbsd-src/external/apache2/llvm/dist/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()
314 FencesInserted = hardenLoadsWithPlugin(MF, std::move(Graph)); in runOnMachineFunction()
316 FencesInserted = hardenLoadsWithHeuristic(MF, std::move(Graph)); in runOnMachineFunction()
599 std::unique_ptr<MachineGadgetGraph> Graph) const { in trimMitigatedEdges()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
H A DDOTGraphTraitsPass.h52 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); in runOnFunction() local
53 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnFunction()
56 ViewGraph(Graph, Name, IsSimple, Title); in runOnFunction()
94 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); in runOnFunction() local
101 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnFunction()
105 WriteGraph(File, Graph, IsSimple, Title); in runOnFunction()
131 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); in runOnModule() local
132 std::string Title = DOTGraphTraits<GraphT>::getGraphName(Graph); in runOnModule()
134 ViewGraph(Graph, Name, IsSimple, Title); in runOnModule()
157 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); in runOnModule() local
[all …]
H A DDDG.h364 Graph.addNode(*RN); in createRootNode()
370 Graph.addNode(*SN); in createFineGrainedNode()
376 Graph.addNode(*Pi); in createPiBlock()
382 Graph.connect(Src, Tgt, *E); in createDefUseEdge()
388 Graph.connect(Src, Tgt, *E); in createMemoryEdge()
395 Graph.connect(Src, Tgt, *E); in createRootedEdge()
H A DDependenceGraphBuilder.h45 : Graph(G), DI(D), BBList(BBs) {} in AbstractDependenceGraphBuilder()
180 GraphType &Graph; variable
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/
H A DCFLGraph.h169 CFLGraph Graph; variable
179 CFLGraph &Graph; variable
207 if (Graph.addNode(InstantiatedValue{GVal, 0},
209 Graph.addNode(InstantiatedValue{GVal, 1}, getAttrUnknown());
212 if (Graph.addNode(InstantiatedValue{CExpr, 0}))
216 Graph.addNode(InstantiatedValue{Val, 0}, Attr);
226 Graph.addEdge(InstantiatedValue{From, 0}, InstantiatedValue{To, 0},
243 Graph.addNode(InstantiatedValue{From, 1}); in addDerefEdge()
244 Graph.addEdge(InstantiatedValue{From, 1}, InstantiatedValue{To, 0}); in addDerefEdge()
246 Graph.addNode(InstantiatedValue{To, 1}); in addDerefEdge()
[all …]
H A DDependenceGraphBuilder.cpp81 for (auto *N : Graph) { in createAndConnectRootNode()
112 for (auto &SCC : make_range(scc_begin(&Graph), scc_end(&Graph))) { in createPiBlocks()
137 for (NodeType *N : Graph) { in createPiBlocks()
228 for (NodeType *N : Graph) { in createDefUseEdges()
282 for (DGIterator SrcIt = Graph.begin(), E = Graph.end(); SrcIt != E; ++SrcIt) { in createMemoryDependencyEdges()
393 for (NodeType *N : Graph) { in simplify()
414 for (NodeType *N : Graph) { in simplify()
489 for (NodeType *N : post_order(&Graph)) { in sortNodesTopologically()
499 size_t OldSize = Graph.Nodes.size(); in sortNodesTopologically()
500 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.cpp607 const CFLGraph &Graph) { in initializeWorkList() argument
608 for (const auto &Mapping : Graph.value_mappings()) { in initializeWorkList()
628 static Optional<InstantiatedValue> getNodeBelow(const CFLGraph &Graph, in getNodeBelow() argument
631 if (Graph.getNode(NodeBelow)) in getNodeBelow()
636 static void processWorkListItem(const WorkListItem &Item, const CFLGraph &Graph, in processWorkListItem() argument
642 auto NodeInfo = Graph.getNode(ToNode); in processWorkListItem()
653 auto FromNodeBelow = getNodeBelow(Graph, FromNode); in processWorkListItem()
654 auto ToNodeBelow = getNodeBelow(Graph, ToNode); in processWorkListItem()
735 static AliasAttrMap buildAttrMap(const CFLGraph &Graph, in buildAttrMap() argument
741 for (const auto &Mapping : Graph.value_mappings()) { in buildAttrMap()
[all …]
H A DBlockFrequencyInfo.cpp134 const BlockFrequencyInfo *Graph) { in getNodeLabel()
136 return BFIDOTGTraitsBase::getNodeLabel(Node, Graph, getGVDT()); in getNodeLabel()
140 const BlockFrequencyInfo *Graph) { in getNodeAttributes()
141 return BFIDOTGTraitsBase::getNodeAttributes(Node, Graph, in getNodeAttributes()
H A DTFUtils.cpp308 TFGraphPtr Graph; member in llvm::TFModelEvaluatorImpl
339 : Graph(createTFGraph()), Options(createTFSessionOptions()), in TFModelEvaluatorImpl()
350 Graph.get(), nullptr, Status.get()); in TFModelEvaluatorImpl()
358 TF_GraphOperationByName(Graph.get(), (InputSpec.name()).c_str()), in TFModelEvaluatorImpl()
368 TF_GraphOperationByName(Graph.get(), (OutputSpec.name()).c_str()), in TFModelEvaluatorImpl()
/netbsd-src/external/apache2/llvm/dist/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 …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/
H A DWebAssemblyFixIrreducibleControlFlow.cpp245 MachineFunction &MF, const ReachabilityGraph &Graph);
258 ReachabilityGraph Graph(Entry, Blocks); in processRegion() local
262 for (auto *LoopEntry : getSortedEntries(Graph.getLoopEntries())) { in processRegion()
290 for (auto *OtherLoopEntry : Graph.getLoopEntries()) { in processRegion()
292 Graph.canReach(LoopEntry, OtherLoopEntry) && in processRegion()
293 Graph.canReach(OtherLoopEntry, LoopEntry)) { in processRegion()
299 makeSingleEntryLoop(MutualLoopEntries, Blocks, MF, Graph); in processRegion()
315 for (auto *LoopEntry : Graph.getLoopEntries()) { in processRegion()
316 LoopBlocks InnerBlocks(LoopEntry, Graph.getLoopEnterers(LoopEntry)); in processRegion()
340 const ReachabilityGraph &Graph) { in makeSingleEntryLoop() argument
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/
H A DScheduleDAGPrinter.cpp43 const ScheduleDAG *Graph) { in getNodeIdentifierLabel()
54 const ScheduleDAG *Graph) { in getEdgeAttributes()
63 std::string getNodeLabel(const SUnit *SU, const ScheduleDAG *Graph);
65 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()
/netbsd-src/external/apache2/llvm/dist/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 …]
H A DFileAnalysis.h154 CFIProtectionStatus validateCFIProtection(const GraphResult &Graph) const;
164 uint64_t indirectCFOperandClobber(const GraphResult& Graph) const;
/netbsd-src/usr.bin/make/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'
/netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-cfi-verify/
H A Dllvm-cfi-verify.cpp89 const GraphResult &Graph, in printInstructionInformation() argument
97 Graph.printToDOT(Analysis, outs()); in printInstructionInformation()
137 GraphResult Graph = GraphBuilder::buildFlowGraph(Analysis, Address); in printIndirectCFInstructions() local
140 Analysis.validateCFIProtection(Graph); in printIndirectCFInstructions()
145 printInstructionInformation(Analysis, InstrMeta, Graph, ProtectionStatus); in printIndirectCFInstructions()
/netbsd-src/external/apache2/llvm/dist/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>;
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGPrinter.cpp81 const SelectionDAG *Graph) { in getNodeIdentifierLabel()
96 const SelectionDAG *Graph) { in getEdgeAttributes()
116 std::string getNodeLabel(const SDNode *Node, const SelectionDAG *Graph);
118 const SelectionDAG *Graph) { in getNodeAttributes()
120 const std::string &Attrs = Graph->getGraphAttrs(N); in getNodeAttributes()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h287 using Graph = PBQP::Graph<RegAllocSolverImpl>; variable
289 RegAllocSolverImpl(Graph &G) : G(G) {} in RegAllocSolverImpl()
481 SpillCostComparator(const Graph& G) : G(G) {} in SpillCostComparator()
492 const Graph& G;
495 Graph& G;
502 class PBQPRAGraph : public PBQP::Graph<RegAllocSolverImpl> {
504 using BaseT = PBQP::Graph<RegAllocSolverImpl>;
/netbsd-src/external/apache2/llvm/dist/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…
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Passes/
H A DStandardInstrumentations.cpp940 Graph[&BB][Succ]++; in CFG()
983 if (Before.Graph.size() != After.Graph.size()) in printDiff()
985 << Before.Graph.size() << ", after=" << After.Graph.size() << "\n"; in printDiff()
987 for (auto &BB : Before.Graph) { in printDiff()
988 auto BA = After.Graph.find(BB.first); in printDiff()
989 if (BA == After.Graph.end()) { in printDiff()
996 for (auto &BA : After.Graph) { in printDiff()
997 auto BB = Before.Graph.find(BA.first); in printDiff()
998 if (BB == Before.Graph.end()) { in printDiff()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
H A DGraphTraits.h96 const GraphType &Graph; member
98 inline Inverse(const GraphType &G) : Graph(G) {} in Inverse()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/IR/
H A DCFG.h329 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
338 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
393 return &G.Graph->getEntryBlock();
399 return &G.Graph->getEntryBlock();

1234