Lines Matching refs:two
493 // Get some facts about the number of bits used in the two operands.
565 // Sign bit is set so perform two's complement to make it positive
570 // Sign bit is set so perform two's complement to make it positive
632 // For radixes of power-of-two values, the bits required is accurately and
1334 APInt two(BitWidth, 2);
1345 x_new = (this->udiv(x_old) + x_old).udiv(two);
1362 APInt midpoint((nextSquare - square).udiv(two));
1567 // value qp is one too large, and it eliminates all cases where qp is two
2136 // If its negative, put it in two's complement form
2286 // arbitrary precision, two's-complement, bignum integer values.
2752 /* dst[i] comes from the two parts src[i - jump] and, if we have
2802 /* Bitwise and of two bignums. */
2812 /* Bitwise inclusive or of two bignums. */
2822 /* Bitwise exclusive or of two bignums. */
2842 /* Comparison (unsigned) of two bignums. */
