Searched refs:nId (Results 1 - 4 of 4) sorted by relevance
/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/PBQP/ |
H A D | HeuristicBase.h | 66 void addToOptimalReductionList(Graph::NodeId nId) { argument 67 optimalList.insert(optimalList.end(), nId); 108 bool shouldOptimallyReduce(Graph::NodeId nId) { argument 109 if (g.getNodeDegree(nId) < 3) 116 /// @param nId Node id to be added. 121 void addToOptimalReduceList(Graph::NodeId nId) { argument 122 optimalList.push_back(nId); 153 Graph::NodeId nId = optimalList.front(); 156 switch (s.getSolverDegree(nId)) { 157 case 0: s.applyR0(nId); brea 188 addToHeuristicList(Graph::NodeId nId) argument 226 handleRemoveEdge(Graph::EdgeId eId, Graph::NodeId nId) argument [all...] |
H A D | Graph.h | 104 NodeEntry& getNode(NodeId nId) { return nodes[nId]; } argument 105 const NodeEntry& getNode(NodeId nId) const { return nodes[nId]; } 237 /// @param nId Node id. 239 Vector& getNodeCosts(NodeId nId) { return getNode(nId).getCosts(); } argument 242 /// @param nId Node id. 244 const Vector& getNodeCosts(NodeId nId) const { 245 return getNode(nId) 253 setNodeData(NodeId nId, void *data) argument 258 getNodeData(NodeId nId) argument 306 adjEdgesBegin(NodeId nId) argument 313 adjEdgesEnd(NodeId nId) argument 335 getEdgeOtherNode(EdgeId eId, NodeId nId) argument 365 removeNode(NodeId nId) argument [all...] |
H A D | HeuristicSolver.h | 128 /// @param nId Node id. 130 HeuristicNodeData& getHeuristicNodeData(Graph::NodeId nId) { argument 131 return getSolverNodeData(nId).getHeuristicData(); 143 /// @param nId Node id. 146 SolverEdgeItr solverEdgesBegin(Graph::NodeId nId) { argument 147 return getSolverNodeData(nId).solverEdgesBegin(); 152 /// @param nId Node id. 155 SolverEdgeItr solverEdgesEnd(Graph::NodeId nId) { argument 156 return getSolverNodeData(nId).solverEdgesEnd(); 191 /// @param nId Nod 192 pushToStack(Graph::NodeId nId) argument 200 getSolverDegree(Graph::NodeId nId) argument 207 setSolution(const Graph::NodeId &nId, unsigned selection) argument 223 applyR0(Graph::NodeId nId) argument 394 getSolverNodeData(Graph::NodeId nId) argument 444 Graph::NodeId nId = *nItr; local 559 computeSolution(Graph::NodeId nId) argument [all...] |
/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/PBQP/Heuristics/ |
H A D | Briggs.h | 117 /// @param nId Node id to be considered. 126 bool shouldOptimallyReduce(Graph::NodeId nId) { argument 127 if (getSolver().getSolverDegree(nId) < 3) { 135 /// @param nId Node id to add to the heuristic reduce list. 136 void addToHeuristicReduceList(Graph::NodeId nId) { argument 137 NodeData &nd = getHeuristicNodeData(nId); 138 initializeNode(nId); 141 nd.rnaItr = rnAllocableList.insert(rnAllocableList.end(), nId); 143 nd.rnuItr = rnUnallocableList.insert(rnUnallocableList.end(), nId); 162 Graph::NodeId nId local 171 Graph::NodeId nId = *rnuItr; local 259 handleRemoveEdge(Graph::EdgeId eId, Graph::NodeId nId) argument 297 getHeuristicNodeData(Graph::NodeId nId) argument 355 addEdgeContributions(Graph::EdgeId eId, Graph::NodeId nId) argument 382 subtractEdgeContributions(Graph::EdgeId eId, Graph::NodeId nId) argument 405 updateAllocability(Graph::NodeId nId) argument 411 initializeNode(Graph::NodeId nId) argument [all...] |
Completed in 47 milliseconds