1 //===------ RegAllocPBQP.cpp ---- PBQP Register Allocator -------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file contains a Partitioned Boolean Quadratic Programming (PBQP) based
11 // register allocator for LLVM. This allocator works by constructing a PBQP
12 // problem representing the register allocation problem under consideration,
13 // solving this using a PBQP solver, and mapping the solution back to a
14 // register assignment. If any variables are selected for spilling then spill
15 // code is inserted and the process repeated.
17 // The PBQP solver (pbqp.c) provided for this allocator uses a heuristic tuned
18 // for register allocation. For more information on PBQP for register
19 // allocation, see the following papers:
21 // (1) Hames, L. and Scholz, B. 2006. Nearly optimal register allocation with
22 // PBQP. In Proceedings of the 7th Joint Modular Languages Conference
23 // (JMLC'06). LNCS, vol. 4228. Springer, New York, NY, USA. 346-361.
25 // (2) Scholz, B., Eckstein, E. 2002. Register allocation for irregular
26 // architectures. In Proceedings of the Joint Conference on Languages,
27 // Compilers and Tools for Embedded Systems (LCTES'02), ACM Press, New York,
30 //===----------------------------------------------------------------------===//
32 #define DEBUG_TYPE "regalloc"
35 #include "VirtRegMap.h"
36 #include "RegisterCoalescer.h"
37 #include "llvm/Module.h"
38 #include "llvm/Analysis/AliasAnalysis.h"
39 #include "llvm/CodeGen/CalcSpillWeights.h"
40 #include "llvm/CodeGen/LiveIntervalAnalysis.h"
41 #include "llvm/CodeGen/LiveRangeEdit.h"
42 #include "llvm/CodeGen/LiveStackAnalysis.h"
43 #include "llvm/CodeGen/RegAllocPBQP.h"
44 #include "llvm/CodeGen/MachineDominators.h"
45 #include "llvm/CodeGen/MachineFunctionPass.h"
46 #include "llvm/CodeGen/MachineLoopInfo.h"
47 #include "llvm/CodeGen/MachineRegisterInfo.h"
48 #include "llvm/CodeGen/PBQP/HeuristicSolver.h"
49 #include "llvm/CodeGen/PBQP/Graph.h"
50 #include "llvm/CodeGen/PBQP/Heuristics/Briggs.h"
51 #include "llvm/CodeGen/RegAllocRegistry.h"
52 #include "llvm/Support/Debug.h"
53 #include "llvm/Support/raw_ostream.h"
54 #include "llvm/Target/TargetInstrInfo.h"
55 #include "llvm/Target/TargetMachine.h"
64 static RegisterRegAlloc
65 registerPBQPRepAlloc("pbqp", "PBQP register allocator",
66 createDefaultPBQPRegisterAllocator);
69 pbqpCoalescing("pbqp-coalescing",
70 cl::desc("Attempt coalescing during PBQP register allocation."),
71 cl::init(false), cl::Hidden);
75 pbqpDumpGraphs("pbqp-dump-graphs",
76 cl::desc("Dump graphs for each function/round in the compilation unit."),
77 cl::init(false), cl::Hidden);
83 /// PBQP based allocators solve the register allocation problem by mapping
84 /// register allocation problems to Partitioned Boolean Quadratic
85 /// Programming problems.
86 class RegAllocPBQP : public MachineFunctionPass {
91 /// Construct a PBQP register allocator.
92 RegAllocPBQP(std::auto_ptr<PBQPBuilder> b, char *cPassID=0)
93 : MachineFunctionPass(ID), builder(b), customPassID(cPassID) {
94 initializeSlotIndexesPass(*PassRegistry::getPassRegistry());
95 initializeLiveIntervalsPass(*PassRegistry::getPassRegistry());
96 initializeCalculateSpillWeightsPass(*PassRegistry::getPassRegistry());
97 initializeLiveStacksPass(*PassRegistry::getPassRegistry());
98 initializeMachineLoopInfoPass(*PassRegistry::getPassRegistry());
99 initializeVirtRegMapPass(*PassRegistry::getPassRegistry());
102 /// Return the pass name.
103 virtual const char* getPassName() const {
104 return "PBQP Register Allocator";
107 /// PBQP analysis usage.
108 virtual void getAnalysisUsage(AnalysisUsage &au) const;
110 /// Perform register allocation
111 virtual bool runOnMachineFunction(MachineFunction &MF);
115 typedef std::map<const LiveInterval*, unsigned> LI2NodeMap;
116 typedef std::vector<const LiveInterval*> Node2LIMap;
117 typedef std::vector<unsigned> AllowedSet;
118 typedef std::vector<AllowedSet> AllowedSetMap;
119 typedef std::pair<unsigned, unsigned> RegPair;
120 typedef std::map<RegPair, PBQP::PBQPNum> CoalesceMap;
121 typedef std::vector<PBQP::Graph::NodeItr> NodeVector;
122 typedef std::set<unsigned> RegSet;
125 std::auto_ptr<PBQPBuilder> builder;
130 const TargetMachine *tm;
131 const TargetRegisterInfo *tri;
132 const TargetInstrInfo *tii;
133 const MachineLoopInfo *loopInfo;
134 MachineRegisterInfo *mri;
136 std::auto_ptr<Spiller> spiller;
141 RegSet vregsToAlloc, emptyIntervalVRegs;
143 /// \brief Finds the initial set of vreg intervals to allocate.
144 void findVRegIntervalsToAlloc();
146 /// \brief Given a solved PBQP problem maps this solution back to a register
148 bool mapPBQPToRegAlloc(const PBQPRAProblem &problem,
149 const PBQP::Solution &solution);
151 /// \brief Postprocessing before final spilling. Sets basic block "live in"
153 void finalizeAlloc() const;
157 char RegAllocPBQP::ID = 0;
159 } // End anonymous namespace.
161 unsigned PBQPRAProblem::getVRegForNode(PBQP::Graph::ConstNodeItr node) const {
162 Node2VReg::const_iterator vregItr = node2VReg.find(node);
163 assert(vregItr != node2VReg.end() && "No vreg for node.");
164 return vregItr->second;
167 PBQP::Graph::NodeItr PBQPRAProblem::getNodeForVReg(unsigned vreg) const {
168 VReg2Node::const_iterator nodeItr = vreg2Node.find(vreg);
169 assert(nodeItr != vreg2Node.end() && "No node for vreg.");
170 return nodeItr->second;
174 const PBQPRAProblem::AllowedSet&
175 PBQPRAProblem::getAllowedSet(unsigned vreg) const {
176 AllowedSetMap::const_iterator allowedSetItr = allowedSets.find(vreg);
177 assert(allowedSetItr != allowedSets.end() && "No pregs for vreg.");
178 const AllowedSet &allowedSet = allowedSetItr->second;
182 unsigned PBQPRAProblem::getPRegForOption(unsigned vreg, unsigned option) const {
183 assert(isPRegOption(vreg, option) && "Not a preg option.");
185 const AllowedSet& allowedSet = getAllowedSet(vreg);
186 assert(option <= allowedSet.size() && "Option outside allowed set.");
187 return allowedSet[option - 1];
190 std::auto_ptr<PBQPRAProblem> PBQPBuilder::build(MachineFunction *mf,
191 const LiveIntervals *lis,
192 const MachineLoopInfo *loopInfo,
193 const RegSet &vregs) {
195 typedef std::vector<const LiveInterval*> LIVector;
196 LiveIntervals *LIS = const_cast<LiveIntervals*>(lis);
197 MachineRegisterInfo *mri = &mf->getRegInfo();
198 const TargetRegisterInfo *tri = mf->getTarget().getRegisterInfo();
200 std::auto_ptr<PBQPRAProblem> p(new PBQPRAProblem());
201 PBQP::Graph &g = p->getGraph();
204 // Collect the set of preg intervals, record that they're used in the MF.
205 for (unsigned Reg = 1, e = tri->getNumRegs(); Reg != e; ++Reg) {
206 if (mri->def_empty(Reg))
209 mri->setPhysRegUsed(Reg);
212 BitVector reservedRegs = tri->getReservedRegs(*mf);
214 // Iterate over vregs.
215 for (RegSet::const_iterator vregItr = vregs.begin(), vregEnd = vregs.end();
216 vregItr != vregEnd; ++vregItr) {
217 unsigned vreg = *vregItr;
218 const TargetRegisterClass *trc = mri->getRegClass(vreg);
219 LiveInterval *vregLI = &LIS->getInterval(vreg);
221 // Record any overlaps with regmask operands.
222 BitVector regMaskOverlaps(tri->getNumRegs());
223 LIS->checkRegMaskInterference(*vregLI, regMaskOverlaps);
225 // Compute an initial allowed set for the current vreg.
226 typedef std::vector<unsigned> VRAllowed;
228 ArrayRef<uint16_t> rawOrder = trc->getRawAllocationOrder(*mf);
229 for (unsigned i = 0; i != rawOrder.size(); ++i) {
230 unsigned preg = rawOrder[i];
231 if (reservedRegs.test(preg))
234 // vregLI crosses a regmask operand that clobbers preg.
235 if (!regMaskOverlaps.empty() && !regMaskOverlaps.test(preg))
238 // vregLI overlaps fixed regunit interference.
239 if (LIS->trackingRegUnits()) {
240 bool Interference = false;
241 for (MCRegUnitIterator Units(preg, tri); Units.isValid(); ++Units) {
242 if (vregLI->overlaps(LIS->getRegUnit(*Units))) {
251 // preg is usable for this virtual register.
252 vrAllowed.push_back(preg);
255 RegSet overlappingPRegs;
257 // Record physical registers whose ranges overlap.
258 for (RegSet::const_iterator pregItr = pregs.begin(),
259 pregEnd = pregs.end();
260 pregItr != pregEnd; ++pregItr) {
261 unsigned preg = *pregItr;
262 if (!LIS->hasInterval(preg))
264 const LiveInterval *pregLI = &LIS->getInterval(preg);
266 if (pregLI->empty()) {
270 if (vregLI->overlaps(*pregLI))
271 overlappingPRegs.insert(preg);
274 for (RegSet::const_iterator pregItr = overlappingPRegs.begin(),
275 pregEnd = overlappingPRegs.end();
276 pregItr != pregEnd; ++pregItr) {
277 unsigned preg = *pregItr;
279 // Remove the register from the allowed set.
280 VRAllowed::iterator eraseItr =
281 std::find(vrAllowed.begin(), vrAllowed.end(), preg);
283 if (eraseItr != vrAllowed.end()) {
284 vrAllowed.erase(eraseItr);
287 // Also remove any aliases.
288 for (MCRegAliasIterator AI(preg, tri, false); AI.isValid(); ++AI) {
289 VRAllowed::iterator eraseItr =
290 std::find(vrAllowed.begin(), vrAllowed.end(), *AI);
291 if (eraseItr != vrAllowed.end()) {
292 vrAllowed.erase(eraseItr);
297 // Construct the node.
298 PBQP::Graph::NodeItr node =
299 g.addNode(PBQP::Vector(vrAllowed.size() + 1, 0));
301 // Record the mapping and allowed set in the problem.
302 p->recordVReg(vreg, node, vrAllowed.begin(), vrAllowed.end());
304 PBQP::PBQPNum spillCost = (vregLI->weight != 0.0) ?
305 vregLI->weight : std::numeric_limits<PBQP::PBQPNum>::min();
307 addSpillCosts(g.getNodeCosts(node), spillCost);
310 for (RegSet::const_iterator vr1Itr = vregs.begin(), vrEnd = vregs.end();
311 vr1Itr != vrEnd; ++vr1Itr) {
312 unsigned vr1 = *vr1Itr;
313 const LiveInterval &l1 = lis->getInterval(vr1);
314 const PBQPRAProblem::AllowedSet &vr1Allowed = p->getAllowedSet(vr1);
316 for (RegSet::const_iterator vr2Itr = llvm::next(vr1Itr);
317 vr2Itr != vrEnd; ++vr2Itr) {
318 unsigned vr2 = *vr2Itr;
319 const LiveInterval &l2 = lis->getInterval(vr2);
320 const PBQPRAProblem::AllowedSet &vr2Allowed = p->getAllowedSet(vr2);
322 assert(!l2.empty() && "Empty interval in vreg set?");
323 if (l1.overlaps(l2)) {
324 PBQP::Graph::EdgeItr edge =
325 g.addEdge(p->getNodeForVReg(vr1), p->getNodeForVReg(vr2),
326 PBQP::Matrix(vr1Allowed.size()+1, vr2Allowed.size()+1, 0));
328 addInterferenceCosts(g.getEdgeCosts(edge), vr1Allowed, vr2Allowed, tri);
336 void PBQPBuilder::addSpillCosts(PBQP::Vector &costVec,
337 PBQP::PBQPNum spillCost) {
338 costVec[0] = spillCost;
341 void PBQPBuilder::addInterferenceCosts(
342 PBQP::Matrix &costMat,
343 const PBQPRAProblem::AllowedSet &vr1Allowed,
344 const PBQPRAProblem::AllowedSet &vr2Allowed,
345 const TargetRegisterInfo *tri) {
346 assert(costMat.getRows() == vr1Allowed.size() + 1 && "Matrix height mismatch.");
347 assert(costMat.getCols() == vr2Allowed.size() + 1 && "Matrix width mismatch.");
349 for (unsigned i = 0; i != vr1Allowed.size(); ++i) {
350 unsigned preg1 = vr1Allowed[i];
352 for (unsigned j = 0; j != vr2Allowed.size(); ++j) {
353 unsigned preg2 = vr2Allowed[j];
355 if (tri->regsOverlap(preg1, preg2)) {
356 costMat[i + 1][j + 1] = std::numeric_limits<PBQP::PBQPNum>::infinity();
362 std::auto_ptr<PBQPRAProblem> PBQPBuilderWithCoalescing::build(
364 const LiveIntervals *lis,
365 const MachineLoopInfo *loopInfo,
366 const RegSet &vregs) {
368 std::auto_ptr<PBQPRAProblem> p = PBQPBuilder::build(mf, lis, loopInfo, vregs);
369 PBQP::Graph &g = p->getGraph();
371 const TargetMachine &tm = mf->getTarget();
372 CoalescerPair cp(*tm.getRegisterInfo());
374 // Scan the machine function and add a coalescing cost whenever CoalescerPair
376 for (MachineFunction::const_iterator mbbItr = mf->begin(),
378 mbbItr != mbbEnd; ++mbbItr) {
379 const MachineBasicBlock *mbb = &*mbbItr;
381 for (MachineBasicBlock::const_iterator miItr = mbb->begin(),
383 miItr != miEnd; ++miItr) {
384 const MachineInstr *mi = &*miItr;
386 if (!cp.setRegisters(mi)) {
387 continue; // Not coalescable.
390 if (cp.getSrcReg() == cp.getDstReg()) {
391 continue; // Already coalesced.
394 unsigned dst = cp.getDstReg(),
395 src = cp.getSrcReg();
397 const float copyFactor = 0.5; // Cost of copy relative to load. Current
398 // value plucked randomly out of the air.
400 PBQP::PBQPNum cBenefit =
401 copyFactor * LiveIntervals::getSpillWeight(false, true,
402 loopInfo->getLoopDepth(mbb));
405 if (!lis->isAllocatable(dst)) {
409 const PBQPRAProblem::AllowedSet &allowed = p->getAllowedSet(src);
410 unsigned pregOpt = 0;
411 while (pregOpt < allowed.size() && allowed[pregOpt] != dst) {
414 if (pregOpt < allowed.size()) {
415 ++pregOpt; // +1 to account for spill option.
416 PBQP::Graph::NodeItr node = p->getNodeForVReg(src);
417 addPhysRegCoalesce(g.getNodeCosts(node), pregOpt, cBenefit);
420 const PBQPRAProblem::AllowedSet *allowed1 = &p->getAllowedSet(dst);
421 const PBQPRAProblem::AllowedSet *allowed2 = &p->getAllowedSet(src);
422 PBQP::Graph::NodeItr node1 = p->getNodeForVReg(dst);
423 PBQP::Graph::NodeItr node2 = p->getNodeForVReg(src);
424 PBQP::Graph::EdgeItr edge = g.findEdge(node1, node2);
425 if (edge == g.edgesEnd()) {
426 edge = g.addEdge(node1, node2, PBQP::Matrix(allowed1->size() + 1,
427 allowed2->size() + 1,
430 if (g.getEdgeNode1(edge) == node2) {
431 std::swap(node1, node2);
432 std::swap(allowed1, allowed2);
436 addVirtRegCoalesce(g.getEdgeCosts(edge), *allowed1, *allowed2,
445 void PBQPBuilderWithCoalescing::addPhysRegCoalesce(PBQP::Vector &costVec,
447 PBQP::PBQPNum benefit) {
448 costVec[pregOption] += -benefit;
451 void PBQPBuilderWithCoalescing::addVirtRegCoalesce(
452 PBQP::Matrix &costMat,
453 const PBQPRAProblem::AllowedSet &vr1Allowed,
454 const PBQPRAProblem::AllowedSet &vr2Allowed,
455 PBQP::PBQPNum benefit) {
457 assert(costMat.getRows() == vr1Allowed.size() + 1 && "Size mismatch.");
458 assert(costMat.getCols() == vr2Allowed.size() + 1 && "Size mismatch.");
460 for (unsigned i = 0; i != vr1Allowed.size(); ++i) {
461 unsigned preg1 = vr1Allowed[i];
462 for (unsigned j = 0; j != vr2Allowed.size(); ++j) {
463 unsigned preg2 = vr2Allowed[j];
465 if (preg1 == preg2) {
466 costMat[i + 1][j + 1] += -benefit;
473 void RegAllocPBQP::getAnalysisUsage(AnalysisUsage &au) const {
474 au.setPreservesCFG();
475 au.addRequired<AliasAnalysis>();
476 au.addPreserved<AliasAnalysis>();
477 au.addRequired<SlotIndexes>();
478 au.addPreserved<SlotIndexes>();
479 au.addRequired<LiveIntervals>();
480 //au.addRequiredID(SplitCriticalEdgesID);
482 au.addRequiredID(*customPassID);
483 au.addRequired<CalculateSpillWeights>();
484 au.addRequired<LiveStacks>();
485 au.addPreserved<LiveStacks>();
486 au.addRequired<MachineDominatorTree>();
487 au.addPreserved<MachineDominatorTree>();
488 au.addRequired<MachineLoopInfo>();
489 au.addPreserved<MachineLoopInfo>();
490 au.addRequired<VirtRegMap>();
491 MachineFunctionPass::getAnalysisUsage(au);
494 void RegAllocPBQP::findVRegIntervalsToAlloc() {
496 // Iterate over all live ranges.
497 for (unsigned i = 0, e = mri->getNumVirtRegs(); i != e; ++i) {
498 unsigned Reg = TargetRegisterInfo::index2VirtReg(i);
499 if (mri->reg_nodbg_empty(Reg))
501 LiveInterval *li = &lis->getInterval(Reg);
503 // If this live interval is non-empty we will use pbqp to allocate it.
504 // Empty intervals we allocate in a simple post-processing stage in
507 vregsToAlloc.insert(li->reg);
509 emptyIntervalVRegs.insert(li->reg);
514 bool RegAllocPBQP::mapPBQPToRegAlloc(const PBQPRAProblem &problem,
515 const PBQP::Solution &solution) {
516 // Set to true if we have any spills
517 bool anotherRoundNeeded = false;
519 // Clear the existing allocation.
522 const PBQP::Graph &g = problem.getGraph();
523 // Iterate over the nodes mapping the PBQP solution to a register
525 for (PBQP::Graph::ConstNodeItr node = g.nodesBegin(),
526 nodeEnd = g.nodesEnd();
527 node != nodeEnd; ++node) {
528 unsigned vreg = problem.getVRegForNode(node);
529 unsigned alloc = solution.getSelection(node);
531 if (problem.isPRegOption(vreg, alloc)) {
532 unsigned preg = problem.getPRegForOption(vreg, alloc);
533 DEBUG(dbgs() << "VREG " << PrintReg(vreg, tri) << " -> "
534 << tri->getName(preg) << "\n");
535 assert(preg != 0 && "Invalid preg selected.");
536 vrm->assignVirt2Phys(vreg, preg);
537 } else if (problem.isSpillOption(vreg, alloc)) {
538 vregsToAlloc.erase(vreg);
539 SmallVector<LiveInterval*, 8> newSpills;
540 LiveRangeEdit LRE(&lis->getInterval(vreg), newSpills, *mf, *lis, vrm);
543 DEBUG(dbgs() << "VREG " << PrintReg(vreg, tri) << " -> SPILLED (Cost: "
544 << LRE.getParent().weight << ", New vregs: ");
546 // Copy any newly inserted live intervals into the list of regs to
548 for (LiveRangeEdit::iterator itr = LRE.begin(), end = LRE.end();
550 assert(!(*itr)->empty() && "Empty spill range.");
551 DEBUG(dbgs() << PrintReg((*itr)->reg, tri) << " ");
552 vregsToAlloc.insert((*itr)->reg);
555 DEBUG(dbgs() << ")\n");
557 // We need another round if spill intervals were added.
558 anotherRoundNeeded |= !LRE.empty();
560 llvm_unreachable("Unknown allocation option.");
564 return !anotherRoundNeeded;
568 void RegAllocPBQP::finalizeAlloc() const {
569 // First allocate registers for the empty intervals.
570 for (RegSet::const_iterator
571 itr = emptyIntervalVRegs.begin(), end = emptyIntervalVRegs.end();
573 LiveInterval *li = &lis->getInterval(*itr);
575 unsigned physReg = vrm->getRegAllocPref(li->reg);
578 const TargetRegisterClass *liRC = mri->getRegClass(li->reg);
579 physReg = liRC->getRawAllocationOrder(*mf).front();
582 vrm->assignVirt2Phys(li->reg, physReg);
586 bool RegAllocPBQP::runOnMachineFunction(MachineFunction &MF) {
589 tm = &mf->getTarget();
590 tri = tm->getRegisterInfo();
591 tii = tm->getInstrInfo();
592 mri = &mf->getRegInfo();
594 lis = &getAnalysis<LiveIntervals>();
595 lss = &getAnalysis<LiveStacks>();
596 loopInfo = &getAnalysis<MachineLoopInfo>();
598 vrm = &getAnalysis<VirtRegMap>();
599 spiller.reset(createInlineSpiller(*this, MF, *vrm));
601 mri->freezeReservedRegs(MF);
603 DEBUG(dbgs() << "PBQP Register Allocating for " << mf->getFunction()->getName() << "\n");
605 // Allocator main loop:
607 // * Map current regalloc problem to a PBQP problem
608 // * Solve the PBQP problem
609 // * Map the solution back to a register allocation
610 // * Spill if necessary
612 // This process is continued till no more spills are generated.
614 // Find the vreg intervals in need of allocation.
615 findVRegIntervalsToAlloc();
617 const Function* func = mf->getFunction();
619 func->getParent()->getModuleIdentifier() + "." +
620 func->getName().str();
623 // If there are non-empty intervals allocate them using pbqp.
624 if (!vregsToAlloc.empty()) {
626 bool pbqpAllocComplete = false;
629 while (!pbqpAllocComplete) {
630 DEBUG(dbgs() << " PBQP Regalloc round " << round << ":\n");
632 std::auto_ptr<PBQPRAProblem> problem =
633 builder->build(mf, lis, loopInfo, vregsToAlloc);
636 if (pbqpDumpGraphs) {
637 std::ostringstream rs;
639 std::string graphFileName(fqn + "." + rs.str() + ".pbqpgraph");
641 raw_fd_ostream os(graphFileName.c_str(), tmp);
642 DEBUG(dbgs() << "Dumping graph for round " << round << " to \""
643 << graphFileName << "\"\n");
644 problem->getGraph().dump(os);
648 PBQP::Solution solution =
649 PBQP::HeuristicSolver<PBQP::Heuristics::Briggs>::solve(
650 problem->getGraph());
652 pbqpAllocComplete = mapPBQPToRegAlloc(*problem, solution);
658 // Finalise allocation, allocate empty ranges.
660 vregsToAlloc.clear();
661 emptyIntervalVRegs.clear();
663 DEBUG(dbgs() << "Post alloc VirtRegMap:\n" << *vrm << "\n");
668 FunctionPass* llvm::createPBQPRegisterAllocator(
669 std::auto_ptr<PBQPBuilder> builder,
670 char *customPassID) {
671 return new RegAllocPBQP(builder, customPassID);
674 FunctionPass* llvm::createDefaultPBQPRegisterAllocator() {
675 if (pbqpCoalescing) {
676 return createPBQPRegisterAllocator(
677 std::auto_ptr<PBQPBuilder>(new PBQPBuilderWithCoalescing()));
679 return createPBQPRegisterAllocator(
680 std::auto_ptr<PBQPBuilder>(new PBQPBuilder()));