Searched refs:nodeId (Results 1 - 3 of 3) sorted by relevance

/freebsd-10.2-release/contrib/llvm/include/llvm/CodeGen/PBQP/
H A DSolution.h73 /// @param nodeId Node id.
74 /// @param selection Selection for nodeId.
75 void setSelection(Graph::NodeId nodeId, unsigned selection) { argument
76 selections[nodeId] = selection;
80 /// @param nodeId Node id.
81 /// @return The selection for nodeId;
82 unsigned getSelection(Graph::NodeId nodeId) const {
83 SelectionsMap::const_iterator sItr = selections.find(nodeId);
H A DGraph.h111 NodeId nodeId = 0; local
113 nodeId = freeNodes.back();
115 nodes[nodeId] = n;
117 nodeId = nodes.size();
120 return nodeId;
157 NodeItr(NodeId nodeId, const Graph &g) argument
158 : nodeId(nodeId), endNodeId(g.nodes.size()), freeNodes(g.freeNodes) {
159 this->nodeId = findNextInUse(nodeId); // Mov
177 NodeId nodeId, endNodeId; member in class:PBQP::Graph::NodeItr
[all...]
/freebsd-10.2-release/contrib/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h55 void recordVReg(unsigned vreg, PBQP::Graph::NodeId nodeId, argument
57 assert(node2VReg.find(nodeId) == node2VReg.end() && "Re-mapping node.");
61 node2VReg[nodeId] = vreg;
62 vreg2Node[vreg] = nodeId;
67 unsigned getVRegForNode(PBQP::Graph::NodeId nodeId) const;

Completed in 100 milliseconds