/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/PBQP/ |
H A D | HeuristicBase.h | 25 /// <li> void addToHeuristicList(Graph::NodeItr) : Add a node to the 28 /// <li> void preUpdateEdgeCosts(Graph::EdgeItr) : Handle the (imminent) 30 /// <li> void postUpdateEdgeCostts(Graph::EdgeItr) : Handle the new 32 /// <li> void handleAddEdge(Graph::EdgeItr) : Handle the addition of a new 34 /// <li> void handleRemoveEdge(Graph::EdgeItr, Graph::NodeItr) : Handle the 55 typedef std::list<Graph::NodeId> OptimalList; 58 Graph &g; 66 void addToOptimalReductionList(Graph::NodeId nId) { 86 Graph [all...] |
H A D | Solution.h | 17 #include "Graph.h" 29 typedef std::map<Graph::NodeId, unsigned> SelectionsMap; 75 void setSelection(Graph::NodeId nodeId, unsigned selection) { 82 unsigned getSelection(Graph::NodeId nodeId) const {
|
H A D | HeuristicSolver.h | 19 #include "Graph.h" 29 /// to HeuristicSolver<HImpl>::solve(Graph&). 43 typedef std::list<Graph::EdgeId> SolverEdges; 58 SolverEdgeItr addSolverEdge(Graph::EdgeId eId) { 104 Graph &g; 107 std::vector<Graph::NodeId> stack; 120 HeuristicSolverImpl(Graph &g) : g(g), h(*this) {} 125 Graph& getGraph() { return g; } 130 HeuristicNodeData& getHeuristicNodeData(Graph::NodeId nId) { 137 HeuristicEdgeData& getHeuristicEdgeData(Graph [all...] |
H A D | Graph.h | 1 //===-------------------- Graph.h - PBQP Graph ------------------*- C++ -*-===// 10 // PBQP Graph class. 27 /// PBQP Graph class. 29 class Graph { class in namespace:PBQP 150 Graph(const Graph &other) {} function in class:PBQP::Graph 151 void operator=(const Graph &other) {} 157 NodeItr(NodeId nodeId, const Graph &g) 183 EdgeItr(EdgeId edgeId, const Graph 208 Graph() {} function in class:PBQP::Graph [all...] |
/freebsd-9.3-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-9.3-release/contrib/llvm/include/llvm/Analysis/ |
H A D | DOTGraphTraitsPass.h | 29 Analysis *Graph = &getAnalysis<Analysis>(); local 30 std::string GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph); 33 ViewGraph(Graph, Name, Simple, Title); 54 Analysis *Graph = &getAnalysis<Analysis>(); local 61 std::string GraphName = DOTGraphTraits<Analysis*>::getGraphName(Graph); 65 WriteGraph(File, Graph, Simple, Title); 89 Analysis *Graph = &getAnalysis<Analysis>(); local 90 std::string Title = DOTGraphTraits<Analysis*>::getGraphName(Graph); 92 ViewGraph(Graph, Name, Simple, Title); 113 Analysis *Graph local [all...] |
H A D | CFGPrinter.h | 93 const Function *Graph) { 95 return getSimpleNodeLabel(Node, Graph); 97 return getCompleteNodeLabel(Node, Graph); 92 getNodeLabel(const BasicBlock *Node, const Function *Graph) argument
|
H A D | Interval.h | 142 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
|
/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/PBQP/Heuristics/ |
H A D | Briggs.h | 50 bool operator()(Graph::NodeId n1Id, Graph::NodeId n2Id) const { 63 bool operator()(Graph::NodeId n1Id, Graph::NodeId n2Id) const { 77 Graph *g; 80 typedef std::list<Graph::NodeId> RNAllocableList; 83 typedef std::list<Graph::NodeId> RNUnallocableList; 126 bool shouldOptimallyReduce(Graph::NodeId nId) { 136 void addToHeuristicReduceList(Graph::NodeId nId) { 162 Graph [all...] |
/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | RegAllocPBQP.h | 21 #include "llvm/CodeGen/PBQP/Graph.h" 44 PBQP::Graph& getGraph() { return graph; } 46 const PBQP::Graph& getGraph() const { return graph; } 55 void recordVReg(unsigned vreg, PBQP::Graph::NodeId nodeId, 67 unsigned getVRegForNode(PBQP::Graph::NodeId nodeId) const; 70 PBQP::Graph::NodeId getNodeForVReg(unsigned vreg) const; 95 typedef std::map<PBQP::Graph::NodeId, unsigned> Node2VReg; 96 typedef DenseMap<unsigned, PBQP::Graph::NodeId> VReg2Node; 99 PBQP::Graph graph;
|
H A D | MachineFunction.h | 511 return &G.Graph->front(); 517 return &G.Graph->front();
|
H A D | MachineBasicBlock.h | 712 return G.Graph; 726 return G.Graph;
|
/freebsd-9.3-release/contrib/llvm/lib/CodeGen/ |
H A D | ScheduleDAGPrinter.cpp | 49 const ScheduleDAG *Graph) { 57 const ScheduleDAG *Graph) { 66 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph); 68 const ScheduleDAG *Graph) { 99 viewGraph(getDAGName(), "Scheduling-Units Graph for " + getDAGName()); 48 hasNodeAddressLabel(const SUnit *Node, const ScheduleDAG *Graph) argument 55 getEdgeAttributes(const SUnit *Node, SUnitIterator EI, const ScheduleDAG *Graph) argument 67 getNodeAttributes(const SUnit *N, const ScheduleDAG *Graph) argument
|
H A D | RegAllocPBQP.cpp | 48 #include "llvm/CodeGen/PBQP/Graph.h" 160 unsigned PBQPRAProblem::getVRegForNode(PBQP::Graph::NodeId node) const { 166 PBQP::Graph::NodeId PBQPRAProblem::getNodeForVReg(unsigned vreg) const { 198 PBQP::Graph &g = p->getGraph(); 249 PBQP::Graph::NodeId node = 275 PBQP::Graph::EdgeId edge = 319 PBQP::Graph &g = p->getGraph(); 366 PBQP::Graph::NodeId node = p->getNodeForVReg(src); 372 PBQP::Graph::NodeId node1 = p->getNodeForVReg(dst); 373 PBQP::Graph [all...] |
/freebsd-9.3-release/contrib/llvm/lib/Analysis/IPA/ |
H A D | CallPrinter.cpp | 29 static std::string getGraphName(CallGraph *Graph) { argument 33 std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) { argument
|
/freebsd-9.3-release/contrib/llvm/lib/Analysis/ |
H A D | BlockFrequencyInfo.cpp | 82 const BlockFrequencyInfo *Graph) { 89 Graph->getBlockFreq(Node).print(OS); 92 OS << Graph->getBlockFreq(Node).getFrequency(); 81 getNodeLabel(const BasicBlock *Node, const BlockFrequencyInfo *Graph) argument
|
H A D | DomPrinter.cpp | 34 std::string getNodeLabel(DomTreeNode *Node, DomTreeNode *Graph) { argument
|
H A D | RegionPrinter.cpp | 41 std::string getNodeLabel(RegionNode *Node, RegionNode *Graph) { argument 65 return "Region Graph";
|
/freebsd-9.3-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-9.3-release/contrib/llvm/include/llvm/Support/ |
H A D | DataFlow.h | 65 return G.Graph; 86 return G.Graph;
|
H A D | CFG.h | 291 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; } 304 return G.Graph; 353 return &G.Graph->getEntryBlock(); 359 return &G.Graph->getEntryBlock();
|
/freebsd-9.3-release/contrib/llvm/lib/CodeGen/SelectionDAG/ |
H A D | SelectionDAGPrinter.cpp | 83 const SelectionDAG *Graph) { 91 const SelectionDAG *Graph) { 111 std::string getNodeLabel(const SDNode *Node, const SelectionDAG *Graph); 113 const SelectionDAG *Graph) { 115 const std::string &Attrs = Graph->getGraphAttrs(N); 82 hasNodeAddressLabel(const SDNode *Node, const SelectionDAG *Graph) argument 90 getEdgeAttributes(const void *Node, EdgeIter EI, const SelectionDAG *Graph) argument 112 getNodeAttributes(const SDNode *N, const SelectionDAG *Graph) argument
|
/freebsd-9.3-release/contrib/bmake/unit-tests/ |
H A D | test.exp | 86 make: Graph cycles through `cycle.2.99' 87 make: Graph cycles through `cycle.2.98' 88 make: Graph cycles through `cycle.2.97'
|
/freebsd-9.3-release/contrib/ipfilter/perl/ |
H A D | Isbgraph | 17 "Data","Graph","Bar","Average","Graphnum","Title","Transparent","Rbgcolour", 28 Graph => './graphmaker.gif', 267 open (GRAPH,">$option{'Graph'}") || die "Error: Grafico.gif - $!\n";
|
/freebsd-9.3-release/usr.sbin/bsdconfig/dot/ |
H A D | dot | 322 printf '\n\t/*\n\t * Graph setup and orientation\n\t */\n'
|