/freebsd-11.0-release/contrib/llvm/include/llvm/ADT/ |
H A D | GraphTraits.h | 1 //===-- llvm/ADT/GraphTraits.h - Graph traits template ----------*- C++ -*-===// 79 const GraphType &Graph; member in struct:llvm::Inverse 81 inline Inverse(const GraphType &G) : Graph(G) {} 92 return GraphTraits<T>::getEntryNode(G->Graph.Graph);
|
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/ |
H A D | ScheduleDAGPrinter.cpp | 47 const ScheduleDAG *Graph) { 58 const ScheduleDAG *Graph) { 67 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph); 69 const ScheduleDAG *Graph) { 100 viewGraph(getDAGName(), "Scheduling-Units Graph for " + getDAGName()); 46 getNodeIdentifierLabel(const SUnit *Node, const ScheduleDAG *Graph) argument 56 getEdgeAttributes(const SUnit *Node, SUnitIterator EI, const ScheduleDAG *Graph) argument 68 getNodeAttributes(const SUnit *N, const ScheduleDAG *Graph) argument
|
H A D | MachineBlockFrequencyInfo.cpp | 91 const MachineBlockFrequencyInfo *Graph) { 98 Graph->printBlockFreq(OS, Node); 101 OS << Graph->getBlockFreq(Node).getFrequency(); 90 getNodeLabel(const MachineBasicBlock *Node, const MachineBlockFrequencyInfo *Graph) argument
|
H A D | MachineFunction.cpp | 426 const MachineFunction *Graph) { 425 getNodeLabel(const MachineBasicBlock *Node, const MachineFunction *Graph) argument
|
/freebsd-11.0-release/contrib/bmake/unit-tests/ |
H A D | dotwait.exp | 25 make: Graph cycles through `cycle.2.99' 26 make: Graph cycles through `cycle.2.98' 27 make: Graph cycles through `cycle.2.97'
|
/freebsd-11.0-release/contrib/llvm/lib/Analysis/ |
H A D | CallPrinter.cpp | 28 static std::string getGraphName(CallGraph *Graph) { return "Call graph"; } argument 30 std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) { argument
|
H A D | BlockFrequencyInfo.cpp | 84 const BlockFrequencyInfo *Graph) { 91 Graph->printBlockFreq(OS, Node); 94 OS << Graph->getBlockFreq(Node).getFrequency(); 83 getNodeLabel(const BasicBlock *Node, const BlockFrequencyInfo *Graph) argument
|
H A D | CFLAliasAnalysis.cpp | 814 NodeMapT &Map, GraphT &Graph) { 815 const auto findOrInsertNode = [&Map, &Graph](Value *Val) { 819 auto NewNode = Graph.addNode(); 846 const auto addEdgeToGraph = [&Graph, &findOrInsertNode](const Edge &E) { 851 Graph.addEdge(From, To, std::make_pair(E.Weight, Attrs), 877 NodeMapT &Map, GraphT &Graph) { 880 addInstructionToGraph(Analysis, Inst, ReturnedValues, Map, Graph); 908 GraphT Graph; local 911 buildGraphFrom(*this, Fn, ReturnedValues, Map, Graph); 940 for (const auto &EdgeTuple : Graph 812 addInstructionToGraph(CFLAAResult &Analysis, Instruction &Inst, SmallVectorImpl<Value *> &ReturnedValues, NodeMapT &Map, GraphT &Graph) argument 875 buildGraphFrom(CFLAAResult &Analysis, Function *Fn, SmallVectorImpl<Value *> &ReturnedValues, NodeMapT &Map, GraphT &Graph) argument [all...] |
H A D | DomPrinter.cpp | 34 std::string getNodeLabel(DomTreeNode *Node, DomTreeNode *Graph) { argument
|
H A D | RegionPrinter.cpp | 44 std::string getNodeLabel(RegionNode *Node, RegionNode *Graph) { argument 67 static std::string getGraphName(const RegionInfo *) { return "Region Graph"; }
|
/freebsd-11.0-release/contrib/llvm/include/llvm/Analysis/ |
H A D | DOTGraphTraitsPass.h | 55 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); 56 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); 59 ViewGraph(Graph, Name, IsSimple, Title); 97 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); 104 std::string GraphName = DOTGraphTraits<GraphT>::getGraphName(Graph); 108 WriteGraph(File, Graph, IsSimple, Title); 134 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); variable 135 std::string Title = DOTGraphTraits<GraphT>::getGraphName(Graph); 137 ViewGraph(Graph, Name, IsSimple, Title); 160 GraphT Graph variable [all...] |
H A D | CFGPrinter.h | 92 const Function *Graph) { 94 return getSimpleNodeLabel(Node, Graph); 96 return getCompleteNodeLabel(Node, Graph); 91 getNodeLabel(const BasicBlock *Node, const Function *Graph) argument
|
H A D | Interval.h | 139 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
/freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 1 //===-------------------- Graph.h - PBQP Graph ------------------*- C++ -*-===// 10 // PBQP Graph class. 45 /// PBQP Graph class. 49 class Graph : public GraphBase { class in namespace:llvm::PBQP 83 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) { 114 NIds[0] = NIds[1] = Graph::invalidNodeId(); 120 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) { 127 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) { 136 void connect(Graph [all...] |
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/AST/ |
H A D | StmtViz.cpp | 35 static std::string getNodeLabel(const Stmt* Node, const Stmt* Graph) { argument
|
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/SelectionDAG/ |
H A D | SelectionDAGPrinter.cpp | 84 const SelectionDAG *Graph) { 99 const SelectionDAG *Graph) { 119 std::string getNodeLabel(const SDNode *Node, const SelectionDAG *Graph); 121 const SelectionDAG *Graph) { 123 const std::string &Attrs = Graph->getGraphAttrs(N); 83 getNodeIdentifierLabel(const SDNode *Node, const SelectionDAG *Graph) argument 98 getEdgeAttributes(const void *Node, EdgeIter EI, const SelectionDAG *Graph) argument 120 getNodeAttributes(const SDNode *N, const SelectionDAG *Graph) argument
|
/freebsd-11.0-release/contrib/llvm/include/llvm/IR/ |
H A D | CFG.h | 191 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; } 204 return G.Graph; 253 return &G.Graph->getEntryBlock(); 259 return &G.Graph->getEntryBlock();
|
/freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | RegAllocPBQP.h | 345 typedef PBQP::Graph<RegAllocSolverImpl> Graph; typedef in class:llvm::PBQP::RegAlloc::RegAllocSolverImpl 347 RegAllocSolverImpl(Graph &G) : G(G) {} 360 "PBQP Graph should not contain single or zero-option nodes"); 545 SpillCostComparator(const Graph& G) : G(G) {} 554 const Graph& G; 557 Graph& G; 564 class PBQPRAGraph : public PBQP::Graph<RegAllocSolverImpl> { 566 typedef PBQP::Graph<RegAllocSolverImpl> BaseT;
|
H A D | MachineFunction.h | 573 return &G.Graph->front(); 579 return &G.Graph->front();
|
H A D | MachineBasicBlock.h | 832 return G.Graph; 846 return G.Graph;
|
H A D | ScheduleDAG.h | 41 template<class Graph> class GraphWriter;
|
/freebsd-11.0-release/usr.sbin/bsdconfig/dot/ |
H A D | dot | 317 printf '\n\t/*\n\t * Graph setup and orientation\n\t */\n'
|
/freebsd-11.0-release/contrib/llvm/tools/clang/include/clang/Analysis/ |
H A D | CFG.h | 1033 { return G.Graph; } 1047 { return G.Graph; }
|
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Analysis/ |
H A D | CFG.cpp | 4626 static std::string getNodeLabel(const CFGBlock *Node, const CFG* Graph) { argument 4631 print_block(Out,Graph, *Node, *GraphHelper, false, false);
|
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/ |
H A D | BugReporter.cpp | 2795 std::unique_ptr<ExplodedGraph> Graph; member in class:__anon4238::ReportGraph 2953 GraphWrapper.Graph = std::move(GNew);
|