Lines Matching defs:vreg
146 /// \brief Finds the initial set of vreg intervals to allocate.
166 assert(vregItr != node2VReg.end() && "No vreg for node.");
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.");
178 PBQPRAProblem::getAllowedSet(unsigned vreg) const {
179 AllowedSetMap::const_iterator allowedSetItr = allowedSets.find(vreg);
180 assert(allowedSetItr != allowedSets.end() && "No pregs for vreg.");
185 unsigned PBQPRAProblem::getPRegForOption(unsigned vreg, unsigned option) const {
186 assert(isPRegOption(vreg, option) && "Not a preg option.");
188 const AllowedSet& allowedSet = getAllowedSet(vreg);
221 unsigned vreg = *vregItr;
222 const TargetRegisterClass *trc = mri->getRegClass(vreg);
223 const LiveInterval *vregLI = &lis->getInterval(vreg);
225 // Compute an initial allowed set for the current vreg.
312 p->recordVReg(vreg, node, vrAllowed.begin(), vrAllowed.end());
332 assert(!l2.empty() && "Empty interval in vreg set?");
542 unsigned vreg = problem.getVRegForNode(node);
545 if (problem.isPRegOption(vreg, alloc)) {
546 unsigned preg = problem.getPRegForOption(vreg, alloc);
547 DEBUG(dbgs() << "VREG " << vreg << " -> " << tri->getName(preg) << "\n");
549 vrm->assignVirt2Phys(vreg, preg);
550 } else if (problem.isSpillOption(vreg, alloc)) {
551 vregsToAlloc.erase(vreg);
553 LiveRangeEdit LRE(lis->getInterval(vreg), newSpills, *mf, *lis, vrm);
556 DEBUG(dbgs() << "VREG " << vreg << " -> SPILLED (Cost: "
676 // Find the vreg intervals in need of allocation.
