1 //===-- llvm/ADT/APInt.h - For Arbitrary Precision Integer -----*- 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 //===----------------------------------------------------------------------===//
11 /// \brief This file implements a class to represent arbitrary precision
12 /// integral constant values and operations on them.
14 //===----------------------------------------------------------------------===//
16 #ifndef LLVM_ADT_APINT_H
17 #define LLVM_ADT_APINT_H
19 #include "llvm/ADT/ArrayRef.h"
20 #include "llvm/Support/Compiler.h"
21 #include "llvm/Support/MathExtras.h"
29 class FoldingSetNodeID;
35 template <typename T> class SmallVectorImpl;
37 // An unsigned host type used as a single part of a multi-part
39 typedef uint64_t integerPart;
41 const unsigned int host_char_bit = 8;
42 const unsigned int integerPartWidth =
43 host_char_bit * static_cast<unsigned int>(sizeof(integerPart));
45 //===----------------------------------------------------------------------===//
47 //===----------------------------------------------------------------------===//
49 /// \brief Class for arbitrary precision integers.
51 /// APInt is a functional replacement for common case unsigned integer type like
52 /// "unsigned", "unsigned long" or "uint64_t", but also allows non-byte-width
53 /// integer sizes and large integer value types such as 3-bits, 15-bits, or more
54 /// than 64-bits of precision. APInt provides a variety of arithmetic operators
55 /// and methods to manipulate integer values of any bit-width. It supports both
56 /// the typical integer arithmetic and comparison operations as well as bitwise
59 /// The class has several invariants worth noting:
60 /// * All bit, byte, and word positions are zero-based.
61 /// * Once the bit width is set, it doesn't change except by the Truncate,
62 /// SignExtend, or ZeroExtend operations.
63 /// * All binary operators must be on APInt instances of the same bit width.
64 /// Attempting to use these operators on instances with different bit
65 /// widths will yield an assertion.
66 /// * The value is stored canonically as an unsigned value. For operations
67 /// where it makes a difference, there are both signed and unsigned variants
68 /// of the operation. For example, sdiv and udiv. However, because the bit
69 /// widths must be the same, operations such as Mul and Add produce the same
70 /// results regardless of whether the values are interpreted as signed or
72 /// * In general, the class tries to follow the style of computation that LLVM
73 /// uses in its IR. This simplifies its use for LLVM.
76 unsigned BitWidth; ///< The number of bits in this APInt.
78 /// This union is used to store the integer value. When the
79 /// integer bit-width <= 64, it uses VAL, otherwise it uses pVal.
81 uint64_t VAL; ///< Used to store the <= 64 bits integer value.
82 uint64_t *pVal; ///< Used to store the >64 bits integer value.
85 /// This enum is used to hold the constants we needed for APInt.
89 static_cast<unsigned int>(sizeof(uint64_t)) * CHAR_BIT,
90 /// Byte size of a word
91 APINT_WORD_SIZE = static_cast<unsigned int>(sizeof(uint64_t))
94 /// \brief Fast internal constructor
96 /// This constructor is used only internally for speed of construction of
97 /// temporaries. It is unsafe for general use so it is not public.
98 APInt(uint64_t *val, unsigned bits) : BitWidth(bits), pVal(val) {}
100 /// \brief Determine if this APInt just has one word to store value.
102 /// \returns true if the number of bits <= 64, false otherwise.
103 bool isSingleWord() const { return BitWidth <= APINT_BITS_PER_WORD; }
105 /// \brief Determine which word a bit is in.
107 /// \returns the word position for the specified bit position.
108 static unsigned whichWord(unsigned bitPosition) {
109 return bitPosition / APINT_BITS_PER_WORD;
112 /// \brief Determine which bit in a word a bit is in.
114 /// \returns the bit position in a word for the specified bit position
116 static unsigned whichBit(unsigned bitPosition) {
117 return bitPosition % APINT_BITS_PER_WORD;
120 /// \brief Get a single bit mask.
122 /// \returns a uint64_t with only bit at "whichBit(bitPosition)" set
123 /// This method generates and returns a uint64_t (word) mask for a single
124 /// bit at a specific bit position. This is used to mask the bit in the
125 /// corresponding word.
126 static uint64_t maskBit(unsigned bitPosition) {
127 return 1ULL << whichBit(bitPosition);
130 /// \brief Clear unused high order bits
132 /// This method is used internally to clear the to "N" bits in the high order
133 /// word that are not used by the APInt. This is needed after the most
134 /// significant word is assigned a value to ensure that those bits are
136 APInt &clearUnusedBits() {
137 // Compute how many bits are used in the final word
138 unsigned wordBits = BitWidth % APINT_BITS_PER_WORD;
140 // If all bits are used, we want to leave the value alone. This also
141 // avoids the undefined behavior of >> when the shift is the same size as
142 // the word size (64).
145 // Mask out the high bits.
146 uint64_t mask = ~uint64_t(0ULL) >> (APINT_BITS_PER_WORD - wordBits);
150 pVal[getNumWords() - 1] &= mask;
154 /// \brief Get the word corresponding to a bit position
155 /// \returns the corresponding word for the specified bit position.
156 uint64_t getWord(unsigned bitPosition) const {
157 return isSingleWord() ? VAL : pVal[whichWord(bitPosition)];
160 /// \brief Convert a char array into an APInt
162 /// \param radix 2, 8, 10, 16, or 36
163 /// Converts a string into a number. The string must be non-empty
164 /// and well-formed as a number of the given base. The bit-width
165 /// must be sufficient to hold the result.
167 /// This is used by the constructors that take string arguments.
169 /// StringRef::getAsInteger is superficially similar but (1) does
170 /// not assume that the string is well-formed and (2) grows the
171 /// result to hold the input.
172 void fromString(unsigned numBits, StringRef str, uint8_t radix);
174 /// \brief An internal division function for dividing APInts.
176 /// This is used by the toString method to divide by the radix. It simply
177 /// provides a more convenient form of divide for internal use since KnuthDiv
178 /// has specific constraints on its inputs. If those constraints are not met
179 /// then it provides a simpler form of divide.
180 static void divide(const APInt LHS, unsigned lhsWords, const APInt &RHS,
181 unsigned rhsWords, APInt *Quotient, APInt *Remainder);
183 /// out-of-line slow case for inline constructor
184 void initSlowCase(unsigned numBits, uint64_t val, bool isSigned);
186 /// shared code between two array constructors
187 void initFromArray(ArrayRef<uint64_t> array);
189 /// out-of-line slow case for inline copy constructor
190 void initSlowCase(const APInt &that);
192 /// out-of-line slow case for shl
193 APInt shlSlowCase(unsigned shiftAmt) const;
195 /// out-of-line slow case for operator&
196 APInt AndSlowCase(const APInt &RHS) const;
198 /// out-of-line slow case for operator|
199 APInt OrSlowCase(const APInt &RHS) const;
201 /// out-of-line slow case for operator^
202 APInt XorSlowCase(const APInt &RHS) const;
204 /// out-of-line slow case for operator=
205 APInt &AssignSlowCase(const APInt &RHS);
207 /// out-of-line slow case for operator==
208 bool EqualSlowCase(const APInt &RHS) const;
210 /// out-of-line slow case for operator==
211 bool EqualSlowCase(uint64_t Val) const;
213 /// out-of-line slow case for countLeadingZeros
214 unsigned countLeadingZerosSlowCase() const;
216 /// out-of-line slow case for countTrailingOnes
217 unsigned countTrailingOnesSlowCase() const;
219 /// out-of-line slow case for countPopulation
220 unsigned countPopulationSlowCase() const;
223 /// \name Constructors
226 /// \brief Create a new APInt of numBits width, initialized as val.
228 /// If isSigned is true then val is treated as if it were a signed value
229 /// (i.e. as an int64_t) and the appropriate sign extension to the bit width
230 /// will be done. Otherwise, no sign extension occurs (high order bits beyond
231 /// the range of val are zero filled).
233 /// \param numBits the bit width of the constructed APInt
234 /// \param val the initial value of the APInt
235 /// \param isSigned how to treat signedness of val
236 APInt(unsigned numBits, uint64_t val, bool isSigned = false)
237 : BitWidth(numBits), VAL(0) {
238 assert(BitWidth && "bitwidth too small");
242 initSlowCase(numBits, val, isSigned);
246 /// \brief Construct an APInt of numBits width, initialized as bigVal[].
248 /// Note that bigVal.size() can be smaller or larger than the corresponding
249 /// bit width but any extraneous bits will be dropped.
251 /// \param numBits the bit width of the constructed APInt
252 /// \param bigVal a sequence of words to form the initial value of the APInt
253 APInt(unsigned numBits, ArrayRef<uint64_t> bigVal);
255 /// Equivalent to APInt(numBits, ArrayRef<uint64_t>(bigVal, numWords)), but
256 /// deprecated because this constructor is prone to ambiguity with the
257 /// APInt(unsigned, uint64_t, bool) constructor.
259 /// If this overload is ever deleted, care should be taken to prevent calls
260 /// from being incorrectly captured by the APInt(unsigned, uint64_t, bool)
262 APInt(unsigned numBits, unsigned numWords, const uint64_t bigVal[]);
264 /// \brief Construct an APInt from a string representation.
266 /// This constructor interprets the string \p str in the given radix. The
267 /// interpretation stops when the first character that is not suitable for the
268 /// radix is encountered, or the end of the string. Acceptable radix values
269 /// are 2, 8, 10, 16, and 36. It is an error for the value implied by the
270 /// string to require more bits than numBits.
272 /// \param numBits the bit width of the constructed APInt
273 /// \param str the string to be interpreted
274 /// \param radix the radix to use for the conversion
275 APInt(unsigned numBits, StringRef str, uint8_t radix);
277 /// Simply makes *this a copy of that.
278 /// @brief Copy Constructor.
279 APInt(const APInt &that) : BitWidth(that.BitWidth), VAL(0) {
280 assert(BitWidth && "bitwidth too small");
287 #if LLVM_HAS_RVALUE_REFERENCES
288 /// \brief Move Constructor.
289 APInt(APInt &&that) : BitWidth(that.BitWidth), VAL(that.VAL) {
294 /// \brief Destructor.
300 /// \brief Default constructor that creates an uninitialized APInt.
302 /// This is useful for object deserialization (pair this with the static
304 explicit APInt() : BitWidth(1) {}
306 /// \brief Returns whether this instance allocated memory.
307 bool needsCleanup() const { return !isSingleWord(); }
309 /// Used to insert APInt objects, or objects that contain APInt objects, into
311 void Profile(FoldingSetNodeID &id) const;
314 /// \name Value Tests
317 /// \brief Determine sign of this APInt.
319 /// This tests the high bit of this APInt to determine if it is set.
321 /// \returns true if this APInt is negative, false otherwise
322 bool isNegative() const { return (*this)[BitWidth - 1]; }
324 /// \brief Determine if this APInt Value is non-negative (>= 0)
326 /// This tests the high bit of the APInt to determine if it is unset.
327 bool isNonNegative() const { return !isNegative(); }
329 /// \brief Determine if this APInt Value is positive.
331 /// This tests if the value of this APInt is positive (> 0). Note
332 /// that 0 is not a positive value.
334 /// \returns true if this APInt is positive.
335 bool isStrictlyPositive() const { return isNonNegative() && !!*this; }
337 /// \brief Determine if all bits are set
339 /// This checks to see if the value has all bits of the APInt are set or not.
340 bool isAllOnesValue() const {
342 return VAL == ~integerPart(0) >> (APINT_BITS_PER_WORD - BitWidth);
343 return countPopulationSlowCase() == BitWidth;
346 /// \brief Determine if this is the largest unsigned value.
348 /// This checks to see if the value of this APInt is the maximum unsigned
349 /// value for the APInt's bit width.
350 bool isMaxValue() const { return isAllOnesValue(); }
352 /// \brief Determine if this is the largest signed value.
354 /// This checks to see if the value of this APInt is the maximum signed
355 /// value for the APInt's bit width.
356 bool isMaxSignedValue() const {
357 return BitWidth == 1 ? VAL == 0
358 : !isNegative() && countPopulation() == BitWidth - 1;
361 /// \brief Determine if this is the smallest unsigned value.
363 /// This checks to see if the value of this APInt is the minimum unsigned
364 /// value for the APInt's bit width.
365 bool isMinValue() const { return !*this; }
367 /// \brief Determine if this is the smallest signed value.
369 /// This checks to see if the value of this APInt is the minimum signed
370 /// value for the APInt's bit width.
371 bool isMinSignedValue() const {
372 return BitWidth == 1 ? VAL == 1 : isNegative() && isPowerOf2();
375 /// \brief Check if this APInt has an N-bits unsigned integer value.
376 bool isIntN(unsigned N) const {
377 assert(N && "N == 0 ???");
378 return getActiveBits() <= N;
381 /// \brief Check if this APInt has an N-bits signed integer value.
382 bool isSignedIntN(unsigned N) const {
383 assert(N && "N == 0 ???");
384 return getMinSignedBits() <= N;
387 /// \brief Check if this APInt's value is a power of two greater than zero.
389 /// \returns true if the argument APInt value is a power of two > 0.
390 bool isPowerOf2() const {
392 return isPowerOf2_64(VAL);
393 return countPopulationSlowCase() == 1;
396 /// \brief Check if the APInt's value is returned by getSignBit.
398 /// \returns true if this is the value returned by getSignBit.
399 bool isSignBit() const { return isMinSignedValue(); }
401 /// \brief Convert APInt to a boolean value.
403 /// This converts the APInt to a boolean value as a test against zero.
404 bool getBoolValue() const { return !!*this; }
406 /// If this value is smaller than the specified limit, return it, otherwise
407 /// return the limit value. This causes the value to saturate to the limit.
408 uint64_t getLimitedValue(uint64_t Limit = ~0ULL) const {
409 return (getActiveBits() > 64 || getZExtValue() > Limit) ? Limit
414 /// \name Value Generators
417 /// \brief Gets maximum unsigned value of APInt for specific bit width.
418 static APInt getMaxValue(unsigned numBits) {
419 return getAllOnesValue(numBits);
422 /// \brief Gets maximum signed value of APInt for a specific bit width.
423 static APInt getSignedMaxValue(unsigned numBits) {
424 APInt API = getAllOnesValue(numBits);
425 API.clearBit(numBits - 1);
429 /// \brief Gets minimum unsigned value of APInt for a specific bit width.
430 static APInt getMinValue(unsigned numBits) { return APInt(numBits, 0); }
432 /// \brief Gets minimum signed value of APInt for a specific bit width.
433 static APInt getSignedMinValue(unsigned numBits) {
434 APInt API(numBits, 0);
435 API.setBit(numBits - 1);
439 /// \brief Get the SignBit for a specific bit width.
441 /// This is just a wrapper function of getSignedMinValue(), and it helps code
442 /// readability when we want to get a SignBit.
443 static APInt getSignBit(unsigned BitWidth) {
444 return getSignedMinValue(BitWidth);
447 /// \brief Get the all-ones value.
449 /// \returns the all-ones value for an APInt of the specified bit-width.
450 static APInt getAllOnesValue(unsigned numBits) {
451 return APInt(numBits, UINT64_MAX, true);
454 /// \brief Get the '0' value.
456 /// \returns the '0' value for an APInt of the specified bit-width.
457 static APInt getNullValue(unsigned numBits) { return APInt(numBits, 0); }
459 /// \brief Compute an APInt containing numBits highbits from this APInt.
461 /// Get an APInt with the same BitWidth as this APInt, just zero mask
462 /// the low bits and right shift to the least significant bit.
464 /// \returns the high "numBits" bits of this APInt.
465 APInt getHiBits(unsigned numBits) const;
467 /// \brief Compute an APInt containing numBits lowbits from this APInt.
469 /// Get an APInt with the same BitWidth as this APInt, just zero mask
472 /// \returns the low "numBits" bits of this APInt.
473 APInt getLoBits(unsigned numBits) const;
475 /// \brief Return an APInt with exactly one bit set in the result.
476 static APInt getOneBitSet(unsigned numBits, unsigned BitNo) {
477 APInt Res(numBits, 0);
482 /// \brief Get a value with a block of bits set.
484 /// Constructs an APInt value that has a contiguous range of bits set. The
485 /// bits from loBit (inclusive) to hiBit (exclusive) will be set. All other
486 /// bits will be zero. For example, with parameters(32, 0, 16) you would get
487 /// 0x0000FFFF. If hiBit is less than loBit then the set bits "wrap". For
488 /// example, with parameters (32, 28, 4), you would get 0xF000000F.
490 /// \param numBits the intended bit width of the result
491 /// \param loBit the index of the lowest bit set.
492 /// \param hiBit the index of the highest bit set.
494 /// \returns An APInt value with the requested bits set.
495 static APInt getBitsSet(unsigned numBits, unsigned loBit, unsigned hiBit) {
496 assert(hiBit <= numBits && "hiBit out of range");
497 assert(loBit < numBits && "loBit out of range");
499 return getLowBitsSet(numBits, hiBit) |
500 getHighBitsSet(numBits, numBits - loBit);
501 return getLowBitsSet(numBits, hiBit - loBit).shl(loBit);
504 /// \brief Get a value with high bits set
506 /// Constructs an APInt value that has the top hiBitsSet bits set.
508 /// \param numBits the bitwidth of the result
509 /// \param hiBitsSet the number of high-order bits set in the result.
510 static APInt getHighBitsSet(unsigned numBits, unsigned hiBitsSet) {
511 assert(hiBitsSet <= numBits && "Too many bits to set!");
512 // Handle a degenerate case, to avoid shifting by word size
514 return APInt(numBits, 0);
515 unsigned shiftAmt = numBits - hiBitsSet;
516 // For small values, return quickly
517 if (numBits <= APINT_BITS_PER_WORD)
518 return APInt(numBits, ~0ULL << shiftAmt);
519 return getAllOnesValue(numBits).shl(shiftAmt);
522 /// \brief Get a value with low bits set
524 /// Constructs an APInt value that has the bottom loBitsSet bits set.
526 /// \param numBits the bitwidth of the result
527 /// \param loBitsSet the number of low-order bits set in the result.
528 static APInt getLowBitsSet(unsigned numBits, unsigned loBitsSet) {
529 assert(loBitsSet <= numBits && "Too many bits to set!");
530 // Handle a degenerate case, to avoid shifting by word size
532 return APInt(numBits, 0);
533 if (loBitsSet == APINT_BITS_PER_WORD)
534 return APInt(numBits, UINT64_MAX);
535 // For small values, return quickly.
536 if (loBitsSet <= APINT_BITS_PER_WORD)
537 return APInt(numBits, UINT64_MAX >> (APINT_BITS_PER_WORD - loBitsSet));
538 return getAllOnesValue(numBits).lshr(numBits - loBitsSet);
541 /// \brief Return a value containing V broadcasted over NewLen bits.
542 static APInt getSplat(unsigned NewLen, const APInt &V) {
543 assert(NewLen >= V.getBitWidth() && "Can't splat to smaller bit width!");
545 APInt Val = V.zextOrSelf(NewLen);
546 for (unsigned I = V.getBitWidth(); I < NewLen; I <<= 1)
552 /// \brief Determine if two APInts have the same value, after zero-extending
553 /// one of them (if needed!) to ensure that the bit-widths match.
554 static bool isSameValue(const APInt &I1, const APInt &I2) {
555 if (I1.getBitWidth() == I2.getBitWidth())
558 if (I1.getBitWidth() > I2.getBitWidth())
559 return I1 == I2.zext(I1.getBitWidth());
561 return I1.zext(I2.getBitWidth()) == I2;
564 /// \brief Overload to compute a hash_code for an APInt value.
565 friend hash_code hash_value(const APInt &Arg);
567 /// This function returns a pointer to the internal storage of the APInt.
568 /// This is useful for writing out the APInt in binary form without any
570 const uint64_t *getRawData() const {
577 /// \name Unary Operators
580 /// \brief Postfix increment operator.
582 /// \returns a new APInt value representing *this incremented by one
583 const APInt operator++(int) {
589 /// \brief Prefix increment operator.
591 /// \returns *this incremented by one
594 /// \brief Postfix decrement operator.
596 /// \returns a new APInt representing *this decremented by one.
597 const APInt operator--(int) {
603 /// \brief Prefix decrement operator.
605 /// \returns *this decremented by one.
608 /// \brief Unary bitwise complement operator.
610 /// Performs a bitwise complement operation on this APInt.
612 /// \returns an APInt that is the bitwise complement of *this
613 APInt operator~() const {
615 Result.flipAllBits();
619 /// \brief Unary negation operator
621 /// Negates *this using two's complement logic.
623 /// \returns An APInt value representing the negation of *this.
624 APInt operator-() const { return APInt(BitWidth, 0) - (*this); }
626 /// \brief Logical negation operator.
628 /// Performs logical negation operation on this APInt.
630 /// \returns true if *this is zero, false otherwise.
631 bool operator!() const {
635 for (unsigned i = 0; i != getNumWords(); ++i)
642 /// \name Assignment Operators
645 /// \brief Copy assignment operator.
647 /// \returns *this after assignment of RHS.
648 APInt &operator=(const APInt &RHS) {
649 // If the bitwidths are the same, we can avoid mucking with memory
650 if (isSingleWord() && RHS.isSingleWord()) {
652 BitWidth = RHS.BitWidth;
653 return clearUnusedBits();
656 return AssignSlowCase(RHS);
659 #if LLVM_HAS_RVALUE_REFERENCES
660 /// @brief Move assignment operator.
661 APInt &operator=(APInt &&that) {
665 BitWidth = that.BitWidth;
674 /// \brief Assignment operator.
676 /// The RHS value is assigned to *this. If the significant bits in RHS exceed
677 /// the bit width, the excess bits are truncated. If the bit width is larger
678 /// than 64, the value is zero filled in the unspecified high order bits.
680 /// \returns *this after assignment of RHS value.
681 APInt &operator=(uint64_t RHS);
683 /// \brief Bitwise AND assignment operator.
685 /// Performs a bitwise AND operation on this APInt and RHS. The result is
686 /// assigned to *this.
688 /// \returns *this after ANDing with RHS.
689 APInt &operator&=(const APInt &RHS);
691 /// \brief Bitwise OR assignment operator.
693 /// Performs a bitwise OR operation on this APInt and RHS. The result is
696 /// \returns *this after ORing with RHS.
697 APInt &operator|=(const APInt &RHS);
699 /// \brief Bitwise OR assignment operator.
701 /// Performs a bitwise OR operation on this APInt and RHS. RHS is
702 /// logically zero-extended or truncated to match the bit-width of
704 APInt &operator|=(uint64_t RHS) {
705 if (isSingleWord()) {
714 /// \brief Bitwise XOR assignment operator.
716 /// Performs a bitwise XOR operation on this APInt and RHS. The result is
717 /// assigned to *this.
719 /// \returns *this after XORing with RHS.
720 APInt &operator^=(const APInt &RHS);
722 /// \brief Multiplication assignment operator.
724 /// Multiplies this APInt by RHS and assigns the result to *this.
727 APInt &operator*=(const APInt &RHS);
729 /// \brief Addition assignment operator.
731 /// Adds RHS to *this and assigns the result to *this.
734 APInt &operator+=(const APInt &RHS);
736 /// \brief Subtraction assignment operator.
738 /// Subtracts RHS from *this and assigns the result to *this.
741 APInt &operator-=(const APInt &RHS);
743 /// \brief Left-shift assignment function.
745 /// Shifts *this left by shiftAmt and assigns the result to *this.
747 /// \returns *this after shifting left by shiftAmt
748 APInt &operator<<=(unsigned shiftAmt) {
749 *this = shl(shiftAmt);
754 /// \name Binary Operators
757 /// \brief Bitwise AND operator.
759 /// Performs a bitwise AND operation on *this and RHS.
761 /// \returns An APInt value representing the bitwise AND of *this and RHS.
762 APInt operator&(const APInt &RHS) const {
763 assert(BitWidth == RHS.BitWidth && "Bit widths must be the same");
765 return APInt(getBitWidth(), VAL & RHS.VAL);
766 return AndSlowCase(RHS);
768 APInt And(const APInt &RHS) const { return this->operator&(RHS); }
770 /// \brief Bitwise OR operator.
772 /// Performs a bitwise OR operation on *this and RHS.
774 /// \returns An APInt value representing the bitwise OR of *this and RHS.
775 APInt operator|(const APInt &RHS) const {
776 assert(BitWidth == RHS.BitWidth && "Bit widths must be the same");
778 return APInt(getBitWidth(), VAL | RHS.VAL);
779 return OrSlowCase(RHS);
782 /// \brief Bitwise OR function.
784 /// Performs a bitwise or on *this and RHS. This is implemented bny simply
785 /// calling operator|.
787 /// \returns An APInt value representing the bitwise OR of *this and RHS.
788 APInt Or(const APInt &RHS) const { return this->operator|(RHS); }
790 /// \brief Bitwise XOR operator.
792 /// Performs a bitwise XOR operation on *this and RHS.
794 /// \returns An APInt value representing the bitwise XOR of *this and RHS.
795 APInt operator^(const APInt &RHS) const {
796 assert(BitWidth == RHS.BitWidth && "Bit widths must be the same");
798 return APInt(BitWidth, VAL ^ RHS.VAL);
799 return XorSlowCase(RHS);
802 /// \brief Bitwise XOR function.
804 /// Performs a bitwise XOR operation on *this and RHS. This is implemented
805 /// through the usage of operator^.
807 /// \returns An APInt value representing the bitwise XOR of *this and RHS.
808 APInt Xor(const APInt &RHS) const { return this->operator^(RHS); }
810 /// \brief Multiplication operator.
812 /// Multiplies this APInt by RHS and returns the result.
813 APInt operator*(const APInt &RHS) const;
815 /// \brief Addition operator.
817 /// Adds RHS to this APInt and returns the result.
818 APInt operator+(const APInt &RHS) const;
819 APInt operator+(uint64_t RHS) const { return (*this) + APInt(BitWidth, RHS); }
821 /// \brief Subtraction operator.
823 /// Subtracts RHS from this APInt and returns the result.
824 APInt operator-(const APInt &RHS) const;
825 APInt operator-(uint64_t RHS) const { return (*this) - APInt(BitWidth, RHS); }
827 /// \brief Left logical shift operator.
829 /// Shifts this APInt left by \p Bits and returns the result.
830 APInt operator<<(unsigned Bits) const { return shl(Bits); }
832 /// \brief Left logical shift operator.
834 /// Shifts this APInt left by \p Bits and returns the result.
835 APInt operator<<(const APInt &Bits) const { return shl(Bits); }
837 /// \brief Arithmetic right-shift function.
839 /// Arithmetic right-shift this APInt by shiftAmt.
840 APInt ashr(unsigned shiftAmt) const;
842 /// \brief Logical right-shift function.
844 /// Logical right-shift this APInt by shiftAmt.
845 APInt lshr(unsigned shiftAmt) const;
847 /// \brief Left-shift function.
849 /// Left-shift this APInt by shiftAmt.
850 APInt shl(unsigned shiftAmt) const {
851 assert(shiftAmt <= BitWidth && "Invalid shift amount");
852 if (isSingleWord()) {
853 if (shiftAmt >= BitWidth)
854 return APInt(BitWidth, 0); // avoid undefined shift results
855 return APInt(BitWidth, VAL << shiftAmt);
857 return shlSlowCase(shiftAmt);
860 /// \brief Rotate left by rotateAmt.
861 APInt rotl(unsigned rotateAmt) const;
863 /// \brief Rotate right by rotateAmt.
864 APInt rotr(unsigned rotateAmt) const;
866 /// \brief Arithmetic right-shift function.
868 /// Arithmetic right-shift this APInt by shiftAmt.
869 APInt ashr(const APInt &shiftAmt) const;
871 /// \brief Logical right-shift function.
873 /// Logical right-shift this APInt by shiftAmt.
874 APInt lshr(const APInt &shiftAmt) const;
876 /// \brief Left-shift function.
878 /// Left-shift this APInt by shiftAmt.
879 APInt shl(const APInt &shiftAmt) const;
881 /// \brief Rotate left by rotateAmt.
882 APInt rotl(const APInt &rotateAmt) const;
884 /// \brief Rotate right by rotateAmt.
885 APInt rotr(const APInt &rotateAmt) const;
887 /// \brief Unsigned division operation.
889 /// Perform an unsigned divide operation on this APInt by RHS. Both this and
890 /// RHS are treated as unsigned quantities for purposes of this division.
892 /// \returns a new APInt value containing the division result
893 APInt udiv(const APInt &RHS) const;
895 /// \brief Signed division function for APInt.
897 /// Signed divide this APInt by APInt RHS.
898 APInt sdiv(const APInt &RHS) const;
900 /// \brief Unsigned remainder operation.
902 /// Perform an unsigned remainder operation on this APInt with RHS being the
903 /// divisor. Both this and RHS are treated as unsigned quantities for purposes
904 /// of this operation. Note that this is a true remainder operation and not a
905 /// modulo operation because the sign follows the sign of the dividend which
908 /// \returns a new APInt value containing the remainder result
909 APInt urem(const APInt &RHS) const;
911 /// \brief Function for signed remainder operation.
913 /// Signed remainder operation on APInt.
914 APInt srem(const APInt &RHS) const;
916 /// \brief Dual division/remainder interface.
918 /// Sometimes it is convenient to divide two APInt values and obtain both the
919 /// quotient and remainder. This function does both operations in the same
920 /// computation making it a little more efficient. The pair of input arguments
921 /// may overlap with the pair of output arguments. It is safe to call
922 /// udivrem(X, Y, X, Y), for example.
923 static void udivrem(const APInt &LHS, const APInt &RHS, APInt &Quotient,
926 static void sdivrem(const APInt &LHS, const APInt &RHS, APInt &Quotient,
929 // Operations that return overflow indicators.
930 APInt sadd_ov(const APInt &RHS, bool &Overflow) const;
931 APInt uadd_ov(const APInt &RHS, bool &Overflow) const;
932 APInt ssub_ov(const APInt &RHS, bool &Overflow) const;
933 APInt usub_ov(const APInt &RHS, bool &Overflow) const;
934 APInt sdiv_ov(const APInt &RHS, bool &Overflow) const;
935 APInt smul_ov(const APInt &RHS, bool &Overflow) const;
936 APInt umul_ov(const APInt &RHS, bool &Overflow) const;
937 APInt sshl_ov(unsigned Amt, bool &Overflow) const;
939 /// \brief Array-indexing support.
941 /// \returns the bit value at bitPosition
942 bool operator[](unsigned bitPosition) const {
943 assert(bitPosition < getBitWidth() && "Bit position out of bounds!");
944 return (maskBit(bitPosition) &
945 (isSingleWord() ? VAL : pVal[whichWord(bitPosition)])) !=
950 /// \name Comparison Operators
953 /// \brief Equality operator.
955 /// Compares this APInt with RHS for the validity of the equality
957 bool operator==(const APInt &RHS) const {
958 assert(BitWidth == RHS.BitWidth && "Comparison requires equal bit widths");
960 return VAL == RHS.VAL;
961 return EqualSlowCase(RHS);
964 /// \brief Equality operator.
966 /// Compares this APInt with a uint64_t for the validity of the equality
969 /// \returns true if *this == Val
970 bool operator==(uint64_t Val) const {
973 return EqualSlowCase(Val);
976 /// \brief Equality comparison.
978 /// Compares this APInt with RHS for the validity of the equality
981 /// \returns true if *this == Val
982 bool eq(const APInt &RHS) const { return (*this) == RHS; }
984 /// \brief Inequality operator.
986 /// Compares this APInt with RHS for the validity of the inequality
989 /// \returns true if *this != Val
990 bool operator!=(const APInt &RHS) const { return !((*this) == RHS); }
992 /// \brief Inequality operator.
994 /// Compares this APInt with a uint64_t for the validity of the inequality
997 /// \returns true if *this != Val
998 bool operator!=(uint64_t Val) const { return !((*this) == Val); }
1000 /// \brief Inequality comparison
1002 /// Compares this APInt with RHS for the validity of the inequality
1005 /// \returns true if *this != Val
1006 bool ne(const APInt &RHS) const { return !((*this) == RHS); }
1008 /// \brief Unsigned less than comparison
1010 /// Regards both *this and RHS as unsigned quantities and compares them for
1011 /// the validity of the less-than relationship.
1013 /// \returns true if *this < RHS when both are considered unsigned.
1014 bool ult(const APInt &RHS) const;
1016 /// \brief Unsigned less than comparison
1018 /// Regards both *this as an unsigned quantity and compares it with RHS for
1019 /// the validity of the less-than relationship.
1021 /// \returns true if *this < RHS when considered unsigned.
1022 bool ult(uint64_t RHS) const { return ult(APInt(getBitWidth(), RHS)); }
1024 /// \brief Signed less than comparison
1026 /// Regards both *this and RHS as signed quantities and compares them for
1027 /// validity of the less-than relationship.
1029 /// \returns true if *this < RHS when both are considered signed.
1030 bool slt(const APInt &RHS) const;
1032 /// \brief Signed less than comparison
1034 /// Regards both *this as a signed quantity and compares it with RHS for
1035 /// the validity of the less-than relationship.
1037 /// \returns true if *this < RHS when considered signed.
1038 bool slt(uint64_t RHS) const { return slt(APInt(getBitWidth(), RHS)); }
1040 /// \brief Unsigned less or equal comparison
1042 /// Regards both *this and RHS as unsigned quantities and compares them for
1043 /// validity of the less-or-equal relationship.
1045 /// \returns true if *this <= RHS when both are considered unsigned.
1046 bool ule(const APInt &RHS) const { return ult(RHS) || eq(RHS); }
1048 /// \brief Unsigned less or equal comparison
1050 /// Regards both *this as an unsigned quantity and compares it with RHS for
1051 /// the validity of the less-or-equal relationship.
1053 /// \returns true if *this <= RHS when considered unsigned.
1054 bool ule(uint64_t RHS) const { return ule(APInt(getBitWidth(), RHS)); }
1056 /// \brief Signed less or equal comparison
1058 /// Regards both *this and RHS as signed quantities and compares them for
1059 /// validity of the less-or-equal relationship.
1061 /// \returns true if *this <= RHS when both are considered signed.
1062 bool sle(const APInt &RHS) const { return slt(RHS) || eq(RHS); }
1064 /// \brief Signed less or equal comparison
1066 /// Regards both *this as a signed quantity and compares it with RHS for the
1067 /// validity of the less-or-equal relationship.
1069 /// \returns true if *this <= RHS when considered signed.
1070 bool sle(uint64_t RHS) const { return sle(APInt(getBitWidth(), RHS)); }
1072 /// \brief Unsigned greather than comparison
1074 /// Regards both *this and RHS as unsigned quantities and compares them for
1075 /// the validity of the greater-than relationship.
1077 /// \returns true if *this > RHS when both are considered unsigned.
1078 bool ugt(const APInt &RHS) const { return !ult(RHS) && !eq(RHS); }
1080 /// \brief Unsigned greater than comparison
1082 /// Regards both *this as an unsigned quantity and compares it with RHS for
1083 /// the validity of the greater-than relationship.
1085 /// \returns true if *this > RHS when considered unsigned.
1086 bool ugt(uint64_t RHS) const { return ugt(APInt(getBitWidth(), RHS)); }
1088 /// \brief Signed greather than comparison
1090 /// Regards both *this and RHS as signed quantities and compares them for the
1091 /// validity of the greater-than relationship.
1093 /// \returns true if *this > RHS when both are considered signed.
1094 bool sgt(const APInt &RHS) const { return !slt(RHS) && !eq(RHS); }
1096 /// \brief Signed greater than comparison
1098 /// Regards both *this as a signed quantity and compares it with RHS for
1099 /// the validity of the greater-than relationship.
1101 /// \returns true if *this > RHS when considered signed.
1102 bool sgt(uint64_t RHS) const { return sgt(APInt(getBitWidth(), RHS)); }
1104 /// \brief Unsigned greater or equal comparison
1106 /// Regards both *this and RHS as unsigned quantities and compares them for
1107 /// validity of the greater-or-equal relationship.
1109 /// \returns true if *this >= RHS when both are considered unsigned.
1110 bool uge(const APInt &RHS) const { return !ult(RHS); }
1112 /// \brief Unsigned greater or equal comparison
1114 /// Regards both *this as an unsigned quantity and compares it with RHS for
1115 /// the validity of the greater-or-equal relationship.
1117 /// \returns true if *this >= RHS when considered unsigned.
1118 bool uge(uint64_t RHS) const { return uge(APInt(getBitWidth(), RHS)); }
1120 /// \brief Signed greather or equal comparison
1122 /// Regards both *this and RHS as signed quantities and compares them for
1123 /// validity of the greater-or-equal relationship.
1125 /// \returns true if *this >= RHS when both are considered signed.
1126 bool sge(const APInt &RHS) const { return !slt(RHS); }
1128 /// \brief Signed greater or equal comparison
1130 /// Regards both *this as a signed quantity and compares it with RHS for
1131 /// the validity of the greater-or-equal relationship.
1133 /// \returns true if *this >= RHS when considered signed.
1134 bool sge(uint64_t RHS) const { return sge(APInt(getBitWidth(), RHS)); }
1136 /// This operation tests if there are any pairs of corresponding bits
1137 /// between this APInt and RHS that are both set.
1138 bool intersects(const APInt &RHS) const { return (*this & RHS) != 0; }
1141 /// \name Resizing Operators
1144 /// \brief Truncate to new width.
1146 /// Truncate the APInt to a specified width. It is an error to specify a width
1147 /// that is greater than or equal to the current width.
1148 APInt trunc(unsigned width) const;
1150 /// \brief Sign extend to a new width.
1152 /// This operation sign extends the APInt to a new width. If the high order
1153 /// bit is set, the fill on the left will be done with 1 bits, otherwise zero.
1154 /// It is an error to specify a width that is less than or equal to the
1156 APInt sext(unsigned width) const;
1158 /// \brief Zero extend to a new width.
1160 /// This operation zero extends the APInt to a new width. The high order bits
1161 /// are filled with 0 bits. It is an error to specify a width that is less
1162 /// than or equal to the current width.
1163 APInt zext(unsigned width) const;
1165 /// \brief Sign extend or truncate to width
1167 /// Make this APInt have the bit width given by \p width. The value is sign
1168 /// extended, truncated, or left alone to make it that width.
1169 APInt sextOrTrunc(unsigned width) const;
1171 /// \brief Zero extend or truncate to width
1173 /// Make this APInt have the bit width given by \p width. The value is zero
1174 /// extended, truncated, or left alone to make it that width.
1175 APInt zextOrTrunc(unsigned width) const;
1177 /// \brief Sign extend or truncate to width
1179 /// Make this APInt have the bit width given by \p width. The value is sign
1180 /// extended, or left alone to make it that width.
1181 APInt sextOrSelf(unsigned width) const;
1183 /// \brief Zero extend or truncate to width
1185 /// Make this APInt have the bit width given by \p width. The value is zero
1186 /// extended, or left alone to make it that width.
1187 APInt zextOrSelf(unsigned width) const;
1190 /// \name Bit Manipulation Operators
1193 /// \brief Set every bit to 1.
1198 // Set all the bits in all the words.
1199 for (unsigned i = 0; i < getNumWords(); ++i)
1200 pVal[i] = UINT64_MAX;
1202 // Clear the unused ones
1206 /// \brief Set a given bit to 1.
1208 /// Set the given bit to 1 whose position is given as "bitPosition".
1209 void setBit(unsigned bitPosition);
1211 /// \brief Set every bit to 0.
1212 void clearAllBits() {
1216 memset(pVal, 0, getNumWords() * APINT_WORD_SIZE);
1219 /// \brief Set a given bit to 0.
1221 /// Set the given bit to 0 whose position is given as "bitPosition".
1222 void clearBit(unsigned bitPosition);
1224 /// \brief Toggle every bit to its opposite value.
1225 void flipAllBits() {
1229 for (unsigned i = 0; i < getNumWords(); ++i)
1230 pVal[i] ^= UINT64_MAX;
1235 /// \brief Toggles a given bit to its opposite value.
1237 /// Toggle a given bit to its opposite value whose position is given
1238 /// as "bitPosition".
1239 void flipBit(unsigned bitPosition);
1242 /// \name Value Characterization Functions
1245 /// \brief Return the number of bits in the APInt.
1246 unsigned getBitWidth() const { return BitWidth; }
1248 /// \brief Get the number of words.
1250 /// Here one word's bitwidth equals to that of uint64_t.
1252 /// \returns the number of words to hold the integer value of this APInt.
1253 unsigned getNumWords() const { return getNumWords(BitWidth); }
1255 /// \brief Get the number of words.
1257 /// *NOTE* Here one word's bitwidth equals to that of uint64_t.
1259 /// \returns the number of words to hold the integer value with a given bit
1261 static unsigned getNumWords(unsigned BitWidth) {
1262 return (BitWidth + APINT_BITS_PER_WORD - 1) / APINT_BITS_PER_WORD;
1265 /// \brief Compute the number of active bits in the value
1267 /// This function returns the number of active bits which is defined as the
1268 /// bit width minus the number of leading zeros. This is used in several
1269 /// computations to see how "wide" the value is.
1270 unsigned getActiveBits() const { return BitWidth - countLeadingZeros(); }
1272 /// \brief Compute the number of active words in the value of this APInt.
1274 /// This is used in conjunction with getActiveData to extract the raw value of
1276 unsigned getActiveWords() const {
1277 unsigned numActiveBits = getActiveBits();
1278 return numActiveBits ? whichWord(numActiveBits - 1) + 1 : 1;
1281 /// \brief Get the minimum bit size for this signed APInt
1283 /// Computes the minimum bit width for this APInt while considering it to be a
1284 /// signed (and probably negative) value. If the value is not negative, this
1285 /// function returns the same value as getActiveBits()+1. Otherwise, it
1286 /// returns the smallest bit width that will retain the negative value. For
1287 /// example, -1 can be written as 0b1 or 0xFFFFFFFFFF. 0b1 is shorter and so
1288 /// for -1, this function will always return 1.
1289 unsigned getMinSignedBits() const {
1291 return BitWidth - countLeadingOnes() + 1;
1292 return getActiveBits() + 1;
1295 /// \brief Get zero extended value
1297 /// This method attempts to return the value of this APInt as a zero extended
1298 /// uint64_t. The bitwidth must be <= 64 or the value must fit within a
1299 /// uint64_t. Otherwise an assertion will result.
1300 uint64_t getZExtValue() const {
1303 assert(getActiveBits() <= 64 && "Too many bits for uint64_t");
1307 /// \brief Get sign extended value
1309 /// This method attempts to return the value of this APInt as a sign extended
1310 /// int64_t. The bit width must be <= 64 or the value must fit within an
1311 /// int64_t. Otherwise an assertion will result.
1312 int64_t getSExtValue() const {
1314 return int64_t(VAL << (APINT_BITS_PER_WORD - BitWidth)) >>
1315 (APINT_BITS_PER_WORD - BitWidth);
1316 assert(getMinSignedBits() <= 64 && "Too many bits for int64_t");
1317 return int64_t(pVal[0]);
1320 /// \brief Get bits required for string value.
1322 /// This method determines how many bits are required to hold the APInt
1323 /// equivalent of the string given by \p str.
1324 static unsigned getBitsNeeded(StringRef str, uint8_t radix);
1326 /// \brief The APInt version of the countLeadingZeros functions in
1329 /// It counts the number of zeros from the most significant bit to the first
1332 /// \returns BitWidth if the value is zero, otherwise returns the number of
1333 /// zeros from the most significant bit to the first one bits.
1334 unsigned countLeadingZeros() const {
1335 if (isSingleWord()) {
1336 unsigned unusedBits = APINT_BITS_PER_WORD - BitWidth;
1337 return llvm::countLeadingZeros(VAL) - unusedBits;
1339 return countLeadingZerosSlowCase();
1342 /// \brief Count the number of leading one bits.
1344 /// This function is an APInt version of the countLeadingOnes_{32,64}
1345 /// functions in MathExtras.h. It counts the number of ones from the most
1346 /// significant bit to the first zero bit.
1348 /// \returns 0 if the high order bit is not set, otherwise returns the number
1349 /// of 1 bits from the most significant to the least
1350 unsigned countLeadingOnes() const;
1352 /// Computes the number of leading bits of this APInt that are equal to its
1354 unsigned getNumSignBits() const {
1355 return isNegative() ? countLeadingOnes() : countLeadingZeros();
1358 /// \brief Count the number of trailing zero bits.
1360 /// This function is an APInt version of the countTrailingZeros_{32,64}
1361 /// functions in MathExtras.h. It counts the number of zeros from the least
1362 /// significant bit to the first set bit.
1364 /// \returns BitWidth if the value is zero, otherwise returns the number of
1365 /// zeros from the least significant bit to the first one bit.
1366 unsigned countTrailingZeros() const;
1368 /// \brief Count the number of trailing one bits.
1370 /// This function is an APInt version of the countTrailingOnes_{32,64}
1371 /// functions in MathExtras.h. It counts the number of ones from the least
1372 /// significant bit to the first zero bit.
1374 /// \returns BitWidth if the value is all ones, otherwise returns the number
1375 /// of ones from the least significant bit to the first zero bit.
1376 unsigned countTrailingOnes() const {
1378 return CountTrailingOnes_64(VAL);
1379 return countTrailingOnesSlowCase();
1382 /// \brief Count the number of bits set.
1384 /// This function is an APInt version of the countPopulation_{32,64} functions
1385 /// in MathExtras.h. It counts the number of 1 bits in the APInt value.
1387 /// \returns 0 if the value is zero, otherwise returns the number of set bits.
1388 unsigned countPopulation() const {
1390 return CountPopulation_64(VAL);
1391 return countPopulationSlowCase();
1395 /// \name Conversion Functions
1397 void print(raw_ostream &OS, bool isSigned) const;
1399 /// Converts an APInt to a string and append it to Str. Str is commonly a
1401 void toString(SmallVectorImpl<char> &Str, unsigned Radix, bool Signed,
1402 bool formatAsCLiteral = false) const;
1404 /// Considers the APInt to be unsigned and converts it into a string in the
1405 /// radix given. The radix can be 2, 8, 10 16, or 36.
1406 void toStringUnsigned(SmallVectorImpl<char> &Str, unsigned Radix = 10) const {
1407 toString(Str, Radix, false, false);
1410 /// Considers the APInt to be signed and converts it into a string in the
1411 /// radix given. The radix can be 2, 8, 10, 16, or 36.
1412 void toStringSigned(SmallVectorImpl<char> &Str, unsigned Radix = 10) const {
1413 toString(Str, Radix, true, false);
1416 /// \brief Return the APInt as a std::string.
1418 /// Note that this is an inefficient method. It is better to pass in a
1419 /// SmallVector/SmallString to the methods above to avoid thrashing the heap
1421 std::string toString(unsigned Radix, bool Signed) const;
1423 /// \returns a byte-swapped representation of this APInt Value.
1424 APInt byteSwap() const;
1426 /// \brief Converts this APInt to a double value.
1427 double roundToDouble(bool isSigned) const;
1429 /// \brief Converts this unsigned APInt to a double value.
1430 double roundToDouble() const { return roundToDouble(false); }
1432 /// \brief Converts this signed APInt to a double value.
1433 double signedRoundToDouble() const { return roundToDouble(true); }
1435 /// \brief Converts APInt bits to a double
1437 /// The conversion does not do a translation from integer to double, it just
1438 /// re-interprets the bits as a double. Note that it is valid to do this on
1439 /// any bit width. Exactly 64 bits will be translated.
1440 double bitsToDouble() const {
1445 T.I = (isSingleWord() ? VAL : pVal[0]);
1449 /// \brief Converts APInt bits to a double
1451 /// The conversion does not do a translation from integer to float, it just
1452 /// re-interprets the bits as a float. Note that it is valid to do this on
1453 /// any bit width. Exactly 32 bits will be translated.
1454 float bitsToFloat() const {
1459 T.I = unsigned((isSingleWord() ? VAL : pVal[0]));
1463 /// \brief Converts a double to APInt bits.
1465 /// The conversion does not do a translation from double to integer, it just
1466 /// re-interprets the bits of the double.
1467 static APInt doubleToBits(double V) {
1473 return APInt(sizeof T * CHAR_BIT, T.I);
1476 /// \brief Converts a float to APInt bits.
1478 /// The conversion does not do a translation from float to integer, it just
1479 /// re-interprets the bits of the float.
1480 static APInt floatToBits(float V) {
1486 return APInt(sizeof T * CHAR_BIT, T.I);
1490 /// \name Mathematics Operations
1493 /// \returns the floor log base 2 of this APInt.
1494 unsigned logBase2() const { return BitWidth - 1 - countLeadingZeros(); }
1496 /// \returns the ceil log base 2 of this APInt.
1497 unsigned ceilLogBase2() const {
1498 return BitWidth - (*this - 1).countLeadingZeros();
1501 /// \returns the log base 2 of this APInt if its an exact power of two, -1
1503 int32_t exactLogBase2() const {
1509 /// \brief Compute the square root
1512 /// \brief Get the absolute value;
1514 /// If *this is < 0 then return -(*this), otherwise *this;
1521 /// \returns the multiplicative inverse for a given modulo.
1522 APInt multiplicativeInverse(const APInt &modulo) const;
1525 /// \name Support for division by constant
1528 /// Calculate the magic number for signed division by a constant.
1532 /// Calculate the magic number for unsigned division by a constant.
1534 mu magicu(unsigned LeadingZeros = 0) const;
1537 /// \name Building-block Operations for APInt and APFloat
1540 // These building block operations operate on a representation of arbitrary
1541 // precision, two's-complement, bignum integer values. They should be
1542 // sufficient to implement APInt and APFloat bignum requirements. Inputs are
1543 // generally a pointer to the base of an array of integer parts, representing
1544 // an unsigned bignum, and a count of how many parts there are.
1546 /// Sets the least significant part of a bignum to the input value, and zeroes
1547 /// out higher parts.
1548 static void tcSet(integerPart *, integerPart, unsigned int);
1550 /// Assign one bignum to another.
1551 static void tcAssign(integerPart *, const integerPart *, unsigned int);
1553 /// Returns true if a bignum is zero, false otherwise.
1554 static bool tcIsZero(const integerPart *, unsigned int);
1556 /// Extract the given bit of a bignum; returns 0 or 1. Zero-based.
1557 static int tcExtractBit(const integerPart *, unsigned int bit);
1559 /// Copy the bit vector of width srcBITS from SRC, starting at bit srcLSB, to
1560 /// DST, of dstCOUNT parts, such that the bit srcLSB becomes the least
1561 /// significant bit of DST. All high bits above srcBITS in DST are
1563 static void tcExtract(integerPart *, unsigned int dstCount,
1564 const integerPart *, unsigned int srcBits,
1565 unsigned int srcLSB);
1567 /// Set the given bit of a bignum. Zero-based.
1568 static void tcSetBit(integerPart *, unsigned int bit);
1570 /// Clear the given bit of a bignum. Zero-based.
1571 static void tcClearBit(integerPart *, unsigned int bit);
1573 /// Returns the bit number of the least or most significant set bit of a
1574 /// number. If the input number has no bits set -1U is returned.
1575 static unsigned int tcLSB(const integerPart *, unsigned int);
1576 static unsigned int tcMSB(const integerPart *parts, unsigned int n);
1578 /// Negate a bignum in-place.
1579 static void tcNegate(integerPart *, unsigned int);
1581 /// DST += RHS + CARRY where CARRY is zero or one. Returns the carry flag.
1582 static integerPart tcAdd(integerPart *, const integerPart *,
1583 integerPart carry, unsigned);
1585 /// DST -= RHS + CARRY where CARRY is zero or one. Returns the carry flag.
1586 static integerPart tcSubtract(integerPart *, const integerPart *,
1587 integerPart carry, unsigned);
1589 /// DST += SRC * MULTIPLIER + PART if add is true
1590 /// DST = SRC * MULTIPLIER + PART if add is false
1592 /// Requires 0 <= DSTPARTS <= SRCPARTS + 1. If DST overlaps SRC they must
1593 /// start at the same point, i.e. DST == SRC.
1595 /// If DSTPARTS == SRC_PARTS + 1 no overflow occurs and zero is returned.
1596 /// Otherwise DST is filled with the least significant DSTPARTS parts of the
1597 /// result, and if all of the omitted higher parts were zero return zero,
1598 /// otherwise overflow occurred and return one.
1599 static int tcMultiplyPart(integerPart *dst, const integerPart *src,
1600 integerPart multiplier, integerPart carry,
1601 unsigned int srcParts, unsigned int dstParts,
1604 /// DST = LHS * RHS, where DST has the same width as the operands and is
1605 /// filled with the least significant parts of the result. Returns one if
1606 /// overflow occurred, otherwise zero. DST must be disjoint from both
1608 static int tcMultiply(integerPart *, const integerPart *, const integerPart *,
1611 /// DST = LHS * RHS, where DST has width the sum of the widths of the
1612 /// operands. No overflow occurs. DST must be disjoint from both
1613 /// operands. Returns the number of parts required to hold the result.
1614 static unsigned int tcFullMultiply(integerPart *, const integerPart *,
1615 const integerPart *, unsigned, unsigned);
1617 /// If RHS is zero LHS and REMAINDER are left unchanged, return one.
1618 /// Otherwise set LHS to LHS / RHS with the fractional part discarded, set
1619 /// REMAINDER to the remainder, return zero. i.e.
1621 /// OLD_LHS = RHS * LHS + REMAINDER
1623 /// SCRATCH is a bignum of the same size as the operands and result for use by
1624 /// the routine; its contents need not be initialized and are destroyed. LHS,
1625 /// REMAINDER and SCRATCH must be distinct.
1626 static int tcDivide(integerPart *lhs, const integerPart *rhs,
1627 integerPart *remainder, integerPart *scratch,
1628 unsigned int parts);
1630 /// Shift a bignum left COUNT bits. Shifted in bits are zero. There are no
1631 /// restrictions on COUNT.
1632 static void tcShiftLeft(integerPart *, unsigned int parts,
1633 unsigned int count);
1635 /// Shift a bignum right COUNT bits. Shifted in bits are zero. There are no
1636 /// restrictions on COUNT.
1637 static void tcShiftRight(integerPart *, unsigned int parts,
1638 unsigned int count);
1640 /// The obvious AND, OR and XOR and complement operations.
1641 static void tcAnd(integerPart *, const integerPart *, unsigned int);
1642 static void tcOr(integerPart *, const integerPart *, unsigned int);
1643 static void tcXor(integerPart *, const integerPart *, unsigned int);
1644 static void tcComplement(integerPart *, unsigned int);
1646 /// Comparison (unsigned) of two bignums.
1647 static int tcCompare(const integerPart *, const integerPart *, unsigned int);
1649 /// Increment a bignum in-place. Return the carry flag.
1650 static integerPart tcIncrement(integerPart *, unsigned int);
1652 /// Decrement a bignum in-place. Return the borrow flag.
1653 static integerPart tcDecrement(integerPart *, unsigned int);
1655 /// Set the least significant BITS and clear the rest.
1656 static void tcSetLeastSignificantBits(integerPart *, unsigned int,
1659 /// \brief debug method
1665 /// Magic data for optimising signed division by a constant.
1667 APInt m; ///< magic number
1668 unsigned s; ///< shift amount
1671 /// Magic data for optimising unsigned division by a constant.
1673 APInt m; ///< magic number
1674 bool a; ///< add indicator
1675 unsigned s; ///< shift amount
1678 inline bool operator==(uint64_t V1, const APInt &V2) { return V2 == V1; }
1680 inline bool operator!=(uint64_t V1, const APInt &V2) { return V2 != V1; }
1682 inline raw_ostream &operator<<(raw_ostream &OS, const APInt &I) {
1687 namespace APIntOps {
1689 /// \brief Determine the smaller of two APInts considered to be signed.
1690 inline APInt smin(const APInt &A, const APInt &B) { return A.slt(B) ? A : B; }
1692 /// \brief Determine the larger of two APInts considered to be signed.
1693 inline APInt smax(const APInt &A, const APInt &B) { return A.sgt(B) ? A : B; }
1695 /// \brief Determine the smaller of two APInts considered to be signed.
1696 inline APInt umin(const APInt &A, const APInt &B) { return A.ult(B) ? A : B; }
1698 /// \brief Determine the larger of two APInts considered to be unsigned.
1699 inline APInt umax(const APInt &A, const APInt &B) { return A.ugt(B) ? A : B; }
1701 /// \brief Check if the specified APInt has a N-bits unsigned integer value.
1702 inline bool isIntN(unsigned N, const APInt &APIVal) { return APIVal.isIntN(N); }
1704 /// \brief Check if the specified APInt has a N-bits signed integer value.
1705 inline bool isSignedIntN(unsigned N, const APInt &APIVal) {
1706 return APIVal.isSignedIntN(N);
1709 /// \returns true if the argument APInt value is a sequence of ones starting at
1710 /// the least significant bit with the remainder zero.
1711 inline bool isMask(unsigned numBits, const APInt &APIVal) {
1712 return numBits <= APIVal.getBitWidth() &&
1713 APIVal == APInt::getLowBitsSet(APIVal.getBitWidth(), numBits);
1716 /// \brief Return true if the argument APInt value contains a sequence of ones
1717 /// with the remainder zero.
1718 inline bool isShiftedMask(unsigned numBits, const APInt &APIVal) {
1719 return isMask(numBits, (APIVal - APInt(numBits, 1)) | APIVal);
1722 /// \brief Returns a byte-swapped representation of the specified APInt Value.
1723 inline APInt byteSwap(const APInt &APIVal) { return APIVal.byteSwap(); }
1725 /// \brief Returns the floor log base 2 of the specified APInt value.
1726 inline unsigned logBase2(const APInt &APIVal) { return APIVal.logBase2(); }
1728 /// \brief Compute GCD of two APInt values.
1730 /// This function returns the greatest common divisor of the two APInt values
1731 /// using Euclid's algorithm.
1733 /// \returns the greatest common divisor of Val1 and Val2
1734 APInt GreatestCommonDivisor(const APInt &Val1, const APInt &Val2);
1736 /// \brief Converts the given APInt to a double value.
1738 /// Treats the APInt as an unsigned value for conversion purposes.
1739 inline double RoundAPIntToDouble(const APInt &APIVal) {
1740 return APIVal.roundToDouble();
1743 /// \brief Converts the given APInt to a double value.
1745 /// Treats the APInt as a signed value for conversion purposes.
1746 inline double RoundSignedAPIntToDouble(const APInt &APIVal) {
1747 return APIVal.signedRoundToDouble();
1750 /// \brief Converts the given APInt to a float vlalue.
1751 inline float RoundAPIntToFloat(const APInt &APIVal) {
1752 return float(RoundAPIntToDouble(APIVal));
1755 /// \brief Converts the given APInt to a float value.
1757 /// Treast the APInt as a signed value for conversion purposes.
1758 inline float RoundSignedAPIntToFloat(const APInt &APIVal) {
1759 return float(APIVal.signedRoundToDouble());
1762 /// \brief Converts the given double value into a APInt.
1764 /// This function convert a double value to an APInt value.
1765 APInt RoundDoubleToAPInt(double Double, unsigned width);
1767 /// \brief Converts a float value into a APInt.
1769 /// Converts a float value into an APInt value.
1770 inline APInt RoundFloatToAPInt(float Float, unsigned width) {
1771 return RoundDoubleToAPInt(double(Float), width);
1774 /// \brief Arithmetic right-shift function.
1776 /// Arithmetic right-shift the APInt by shiftAmt.
1777 inline APInt ashr(const APInt &LHS, unsigned shiftAmt) {
1778 return LHS.ashr(shiftAmt);
1781 /// \brief Logical right-shift function.
1783 /// Logical right-shift the APInt by shiftAmt.
1784 inline APInt lshr(const APInt &LHS, unsigned shiftAmt) {
1785 return LHS.lshr(shiftAmt);
1788 /// \brief Left-shift function.
1790 /// Left-shift the APInt by shiftAmt.
1791 inline APInt shl(const APInt &LHS, unsigned shiftAmt) {
1792 return LHS.shl(shiftAmt);
1795 /// \brief Signed division function for APInt.
1797 /// Signed divide APInt LHS by APInt RHS.
1798 inline APInt sdiv(const APInt &LHS, const APInt &RHS) { return LHS.sdiv(RHS); }
1800 /// \brief Unsigned division function for APInt.
1802 /// Unsigned divide APInt LHS by APInt RHS.
1803 inline APInt udiv(const APInt &LHS, const APInt &RHS) { return LHS.udiv(RHS); }
1805 /// \brief Function for signed remainder operation.
1807 /// Signed remainder operation on APInt.
1808 inline APInt srem(const APInt &LHS, const APInt &RHS) { return LHS.srem(RHS); }
1810 /// \brief Function for unsigned remainder operation.
1812 /// Unsigned remainder operation on APInt.
1813 inline APInt urem(const APInt &LHS, const APInt &RHS) { return LHS.urem(RHS); }
1815 /// \brief Function for multiplication operation.
1817 /// Performs multiplication on APInt values.
1818 inline APInt mul(const APInt &LHS, const APInt &RHS) { return LHS * RHS; }
1820 /// \brief Function for addition operation.
1822 /// Performs addition on APInt values.
1823 inline APInt add(const APInt &LHS, const APInt &RHS) { return LHS + RHS; }
1825 /// \brief Function for subtraction operation.
1827 /// Performs subtraction on APInt values.
1828 inline APInt sub(const APInt &LHS, const APInt &RHS) { return LHS - RHS; }
1830 /// \brief Bitwise AND function for APInt.
1832 /// Performs bitwise AND operation on APInt LHS and
1834 inline APInt And(const APInt &LHS, const APInt &RHS) { return LHS & RHS; }
1836 /// \brief Bitwise OR function for APInt.
1838 /// Performs bitwise OR operation on APInt LHS and APInt RHS.
1839 inline APInt Or(const APInt &LHS, const APInt &RHS) { return LHS | RHS; }
1841 /// \brief Bitwise XOR function for APInt.
1843 /// Performs bitwise XOR operation on APInt.
1844 inline APInt Xor(const APInt &LHS, const APInt &RHS) { return LHS ^ RHS; }
1846 /// \brief Bitwise complement function.
1848 /// Performs a bitwise complement operation on APInt.
1849 inline APInt Not(const APInt &APIVal) { return ~APIVal; }
1851 } // End of APIntOps namespace
1853 // See friend declaration above. This additional declaration is required in
1854 // order to compile LLVM with IBM xlC compiler.
1855 hash_code hash_value(const APInt &Arg);
1856 } // End of llvm namespace