HomeSort by relevance Sort by last modified time
    Searched refs:nodeItr (Results 1 - 2 of 2) sorted by null

  /external/llvm/include/llvm/CodeGen/PBQP/
Graph.h 39 typedef NodeList::iterator NodeItr;
82 NodeItr node1, node2;
87 EdgeEntry(NodeItr node1, NodeItr node2, const Matrix &costs)
89 NodeItr getNode1() const { return node1; }
90 NodeItr getNode2() const { return node2; }
111 NodeEntry& getNode(NodeItr nItr) { return *nItr; }
117 NodeItr addConstructedNode(const NodeEntry &n) {
168 NodeItr addNode(const Vector &costs) {
176 EdgeItr addEdge(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr
    [all...]
  /external/llvm/lib/CodeGen/
RegAllocPBQP.cpp 123 typedef std::vector<PBQP::Graph::NodeItr> NodeVector;
170 PBQP::Graph::NodeItr PBQPRAProblem::getNodeForVReg(unsigned vreg) const {
171 VReg2Node::const_iterator nodeItr = vreg2Node.find(vreg);
172 assert(nodeItr != vreg2Node.end() && "No node for vreg.");
173 return nodeItr->second;
308 PBQP::Graph::NodeItr node =
426 PBQP::Graph::NodeItr node = p->getNodeForVReg(src);
432 PBQP::Graph::NodeItr node1 = p->getNodeForVReg(dst);
433 PBQP::Graph::NodeItr node2 = p->getNodeForVReg(src);

Completed in 858 milliseconds