llvm.org GIT mirror llvm / d5be48a
Matrix simplification in PBQP may push infinite costs onto register options. The colorability heuristic should count these as denied registers. No test case - this exposed a bug on an out-of-tree target. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@153958 91177308-0d34-0410-b5e6-96231b3b80d8 Lang Hames 8 years ago
1 changed file(s) with 6 addition(s) and 0 deletion(s). Raw diff Collapse all Expand all
417417 unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1;
418418
419419 nd.numDenied = 0;
420 const Vector& nCosts = getGraph().getNodeCosts(nItr);
421 for (unsigned i = 1; i < nCosts.getLength(); ++i) {
422 if (nCosts[i] == std::numeric_limits::infinity())
423 ++nd.numDenied;
424 }
425
420426 nd.numSafe = numRegs;
421427 nd.unsafeDegrees.resize(numRegs, 0);
422428