Lines Matching defs:divisor
597 unsigned HOST_WIDE_INT lden_orig, /* den == denominator == divisor */
645 { /* trivial case: dividend < divisor */
661 /* Special code for when the divisor < BASE. */
679 /* Find the highest nonzero divisor digit. */
687 /* Insure that the first digit of the divisor is at least BASE/2.
692 { /* scale divisor and dividend */
737 divisor by QUO_EST and subtracting from the remaining dividend.
755 carry = 0; /* add divisor back in */
5738 way unless the multiplier or divisor overflows. Signed
6402 /* A negative divisor reverses the relational operators. */
13481 round_up (tree value, int divisor)
13485 gcc_assert (divisor > 0);
13486 if (divisor == 1)
13495 div = build_int_cst (TREE_TYPE (value), divisor);
13501 /* If divisor is a power of two, simplify this to bit manipulation. */
13502 if (divisor == (divisor & -divisor))
13506 t = build_int_cst (TREE_TYPE (value), divisor - 1);
13508 t = build_int_cst (TREE_TYPE (value), -divisor);
13514 div = build_int_cst (TREE_TYPE (value), divisor);
13525 round_down (tree value, int divisor)
13529 gcc_assert (divisor > 0);
13530 if (divisor == 1)
13539 div = build_int_cst (TREE_TYPE (value), divisor);
13545 /* If divisor is a power of two, simplify this to bit manipulation. */
13546 if (divisor == (divisor & -divisor))
13550 t = build_int_cst (TREE_TYPE (value), -divisor);
13556 div = build_int_cst (TREE_TYPE (value), divisor);