diff options
author | Simon Pilgrim <llvm-dev@redking.me.uk> | 2017-02-24 17:46:18 +0000 |
---|---|---|
committer | Simon Pilgrim <llvm-dev@redking.me.uk> | 2017-02-24 17:46:18 +0000 |
commit | bd9fb2ae959dc2bc0a2a6a309b56ea239d41797e (patch) | |
tree | f6b76d75fb74cca216bc2f37094c6d97c0ba4d13 /llvm/lib/Support/APInt.cpp | |
parent | 24a1bedf765fd2dab8384073c9ac930563fa0110 (diff) | |
download | bcm5719-llvm-bd9fb2ae959dc2bc0a2a6a309b56ea239d41797e.tar.gz bcm5719-llvm-bd9fb2ae959dc2bc0a2a6a309b56ea239d41797e.zip |
[APInt] Add APInt::extractBits() method to extract APInt subrange
The current pattern for extract bits in range is typically:
Mask.lshr(BitOffset).trunc(SubSizeInBits);
Which can be particularly slow for large APInts (MaskSizeInBits > 64) as they require the allocation of memory for the temporary variable.
This is another of the compile time issues identified in PR32037 (see also D30265).
This patch adds the APInt::extractBits() helper method which avoids the temporary memory allocation.
Differential Revision: https://reviews.llvm.org/D30336
llvm-svn: 296141
Diffstat (limited to 'llvm/lib/Support/APInt.cpp')
-rw-r--r-- | llvm/lib/Support/APInt.cpp | 32 |
1 files changed, 32 insertions, 0 deletions
diff --git a/llvm/lib/Support/APInt.cpp b/llvm/lib/Support/APInt.cpp index 8ddbbe3a70d..f0c8f6be433 100644 --- a/llvm/lib/Support/APInt.cpp +++ b/llvm/lib/Support/APInt.cpp @@ -618,6 +618,38 @@ void APInt::flipBit(unsigned bitPosition) { else setBit(bitPosition); } +APInt APInt::extractBits(unsigned numBits, unsigned bitPosition) const { + assert(0 < numBits && "Can't extract zero bits"); + assert(bitPosition < BitWidth && (numBits + bitPosition) <= BitWidth && + "Illegal bit extraction"); + + unsigned loBit = whichBit(bitPosition); + if (isSingleWord()) + return APInt(numBits, VAL >> loBit); + + unsigned loWord = whichWord(bitPosition); + unsigned hiWord = whichWord(bitPosition + numBits - 1); + + // Single word result extracting bits from a single word source. + if (loWord == hiWord) + return APInt(numBits, pVal[loWord] >> loBit); + + // Extracting bits that start on a source word boundary can be done + // as a fast memory copy. + if (loBit == 0) + return APInt(numBits, makeArrayRef(pVal + loWord, 1 + hiWord - loWord)); + + // General case - shift + copy source words into place. + APInt Result(numBits, 0); + uint64_t *pDst = Result.pVal; + for (unsigned word = loWord; word < hiWord; ++word, ++pDst) { + uint64_t w0 = pVal[word + 0]; + uint64_t w1 = pVal[word + 1]; + *pDst = (w0 >> loBit) | (w1 << (APINT_BITS_PER_WORD - loBit)); + } + return Result.clearUnusedBits(); +} + unsigned APInt::getBitsNeeded(StringRef str, uint8_t radix) { assert(!str.empty() && "Invalid string length"); assert((radix == 10 || radix == 8 || radix == 16 || radix == 2 || |