Lines Matching refs:part
293 // Split y into high 32-bit part (hy) and low 32-bit part (ly)
2290 static_assert(integerPartWidth % 2 == 0, "Part width must be divisible by 2!");
2295 /* Returns the integer part with the least significant BITS set.
2305 /* Returns the value of the lower half of PART. */
2307 lowHalf(integerPart part)
2309 return part & lowBitMask(integerPartWidth / 2);
2312 /* Returns the value of the upper half of PART. */
2314 highHalf(integerPart part)
2316 return part >> (integerPartWidth / 2);
2319 /* Returns the bit number of the most significant set bit of a part.
2328 part. If the input number has no bits set -1U is returned. */
2336 /* Sets the least significant part of a bignum to the input value, and
2339 APInt::tcSet(integerPart *dst, integerPart part, unsigned int parts)
2345 dst[0] = part;
2596 /* And now DST[i], and store the new low part there. */
2681 Otherwise set LHS to LHS / RHS with the fractional part discarded,
2743 /* Jump is the inter-part jump; shift is is intra-part shift. */
2748 integerPart part;
2753 an intra-part shift, src[i - jump - 1]. */
2754 part = dst[parts - jump];
2756 part <<= shift;
2758 part |= dst[parts - jump - 1] >> (integerPartWidth - shift);
2761 dst[parts] = part;
2777 /* Jump is the inter-part jump; shift is is intra-part shift. */
2784 integerPart part;
2787 part = 0;
2789 part = dst[i + jump];
2791 part >>= shift;
2793 part |= dst[i + jump + 1] << (integerPartWidth - shift);
2797 dst[i] = part;
