Lines Matching defs:that

66 ///   * In general, the class tries to follow the style of computation that LLVM
144 /// word that are not used by the APInt. This is needed after the most
145 /// significant word is assigned a value to ensure that those bits are
178 /// This is used by the constructors that take string arguments.
181 /// not assume that the string is well-formed and (2) grows the
202 void initSlowCase(const APInt &that);
290 /// Note that bigVal.size() can be smaller or larger than the corresponding
309 /// interpretation stops when the first character that is not suitable for the
319 /// Simply makes *this a copy of that.
321 APInt(const APInt &that) : BitWidth(that.BitWidth) {
323 U.VAL = that.U.VAL;
325 initSlowCase(that);
329 APInt(APInt &&that) : BitWidth(that.BitWidth) {
330 memcpy(&U, &that.U, sizeof(U));
331 that.BitWidth = 0;
340 /// Default constructor that creates an uninteresting APInt
350 /// Used to insert APInt objects, or objects that contain APInt objects, into
387 /// that 0 is not a positive value.
600 /// Constructs an APInt value that has a contiguous range of bits set. The
631 /// Constructs an APInt value that has a contiguous range of bits set. The
648 /// Constructs an APInt value that has the top hiBitsSet bits set.
660 /// Constructs an APInt value that has the bottom loBitsSet bits set.
674 /// one of them (if needed!) to ensure that the bit-widths match.
764 APInt &operator=(APInt &&that) {
767 if (this == &that)
770 assert(this != &that && "Self-move not supported");
774 // Use memcpy so that type based alias analysis sees both VAL and pVal
776 memcpy(&U, &that.U, sizeof(U));
778 BitWidth = that.BitWidth;
779 that.BitWidth = 0;
1082 /// of this operation. Note that this is a true remainder operation and not a
1113 // Operations that return overflow indicators.
1124 // Operations that saturate
1340 /// between this APInt and RHS that are both set.
1348 /// This operation checks that all bits set in this APInt are also set in RHS.
1363 /// that is greater than or equal to the current width.
1383 /// It is an error to specify a width that is less than or equal to the
1390 /// are filled with 0 bits. It is an error to specify a width that is less
1397 /// extended, truncated, or left alone to make it that width.
1403 /// extended, truncated, or left alone to make it that width.
1409 /// extended, or left alone to make it that width.
1415 /// extended, or left alone to make it that width.
1570 /// Here one word's bitwidth equals to that of uint64_t.
1577 /// *NOTE* Here one word's bitwidth equals to that of uint64_t.
1606 /// returns the smallest bit width that will retain the negative value. For
1675 /// Computes the number of leading bits of this APInt that are equal to its
1745 /// Note that this is an inefficient method. It is better to pass in a
1769 /// re-interprets the bits as a double. Note that it is valid to do this on
1778 /// re-interprets the bits as a float. Note that it is valid to do this on
1902 /// DST, of dstCOUNT parts, such that the bit srcLSB becomes the least
2030 /// \returns an APInt that is the bitwise complement of \p v.
2235 /// This function finds the smallest number n, such that
2249 /// value to go from [-2^BW, 0) to [0, 2^BW). In that sense, zero is
2252 /// This function returns None if after finding k that minimizes the
2270 /// most significant bit that is different in the values.