/dragonfly/lib/libutil/ |
H A D | humanize_number.c | 48 humanize_number(char *buf, size_t len, int64_t quotient, in humanize_number() argument 116 if (quotient < 0) { in humanize_number() 118 quotient = -quotient; in humanize_number() 147 (quotient >= max || (quotient == max - 1 && in humanize_number() 149 remainder = quotient % divisor; in humanize_number() 150 quotient /= divisor; in humanize_number() 157 remainder = quotient % divisor; in humanize_number() 158 quotient /= divisor; in humanize_number() 193 (((quotient == 9 && remainder < divisordeccut) || in humanize_number() 194 quotient < 9) && i > 0)) { in humanize_number() [all …]
|
/dragonfly/contrib/gcc-4.7/gcc/ |
H A D | expmed.c | 4169 quotient); in expand_divmod() 4194 quotient = op0; in expand_divmod() 4255 quotient); in expand_divmod() 4258 quotient, quotient, 0); in expand_divmod() 4289 quotient in expand_divmod() 4294 quotient in expand_divmod() 4327 quotient in expand_divmod() 4332 quotient in expand_divmod() 4345 quotient); in expand_divmod() 4462 quotient in expand_divmod() [all …]
|
H A D | tree.def | 630 /* Division for integer result that rounds the quotient toward zero. */ 633 /* Division for integer result that rounds the quotient toward infinity. */
|
/dragonfly/contrib/gcc-8.0/gcc/ |
H A D | expmed.c | 4475 quotient); in expand_divmod() 4505 quotient = op0; in expand_divmod() 4567 quotient); in expand_divmod() 4570 quotient, quotient, 0); in expand_divmod() 4600 quotient in expand_divmod() 4604 quotient in expand_divmod() 4635 quotient in expand_divmod() 4639 quotient in expand_divmod() 4651 quotient); in expand_divmod() 4770 quotient in expand_divmod() [all …]
|
H A D | wide-int.h | 2595 return quotient; 2635 return quotient - 1; 2636 return quotient; 2677 return quotient + 1; 2678 return quotient; 2718 return quotient - 1; 2720 return quotient + 1; 2726 return quotient + 1; 2729 return quotient; 2753 return quotient; [all …]
|
H A D | wide-int.cc | 1755 if (quotient) in divmod_internal() 1757 quotient[i] = dividend_val[i]; in divmod_internal() 1775 if (quotient) in divmod_internal() 1777 quotient[0] = HOST_WIDE_INT_MIN; in divmod_internal() 1778 quotient[1] = 0; in divmod_internal() 1789 if (quotient) in divmod_internal() 1790 quotient[0] = o0 / o1; in divmod_internal() 1808 if (quotient) in divmod_internal() 1810 quotient[0] = o0 / o1; in divmod_internal() 1858 if (quotient) in divmod_internal() [all …]
|
H A D | poly-int.h | 2190 *quotient = q; 2198 Cq *quotient) 2296 *quotient = q; 2306 Cq *quotient, Cr *remainder) 2308 if (!can_div_trunc_p (a, b, quotient)) 2310 *remainder = a - *quotient * b; 2325 poly_int_pod<N, Cq> *quotient) 2343 if (!can_div_trunc_p (a, b, quotient)) 2361 Cq *quotient) 2365 if (maybe_ne (*quotient * b, a)) [all …]
|
H A D | double-int.c | 1044 double_int quotient = this->divmod (factor, unsigned_p, in multiple_of() local 1048 *multiple = quotient; in multiple_of()
|
H A D | internal-fn.c | 2827 rtx quotient, remainder, libfunc; in expand_DIVMOD() local 2832 quotient = gen_reg_rtx (mode); in expand_DIVMOD() 2834 expand_twoval_binop (tab, op0, op1, quotient, remainder, unsignedp); in expand_DIVMOD() 2840 "ient, &remainder); in expand_DIVMOD() 2847 make_tree (TREE_TYPE (arg0), quotient), in expand_DIVMOD()
|
H A D | tree.def | 710 /* Division for integer result that rounds the quotient toward zero. */
|
/dragonfly/crypto/libressl/crypto/dh/ |
H A D | dh_check.c | 174 BIGNUM *quotient, *residue; in DH_check() local 176 if ((quotient = BN_CTX_get(ctx)) == NULL) in DH_check() 194 if (!BN_div_ct(quotient, residue, dh->p, dh->q, ctx)) in DH_check() 198 if (dh->j != NULL && BN_cmp(dh->j, quotient) != 0) in DH_check()
|
/dragonfly/contrib/gcc-4.7/libgcc/ |
H A D | fp-bit.c | 967 fractype quotient; 1017 quotient = 0; 1023 quotient |= bit; 1030 if (!ROUND_TOWARDS_ZERO && (quotient & GARDMASK) == GARDMSB) 1032 if (quotient & (1 << NGARDS)) 1045 quotient += GARDROUND + 1; 1048 quotient &= ~(fractype) GARDMASK; 1052 a->fraction.ll = quotient;
|
/dragonfly/sys/dev/raid/mrsas/ |
H A D | mrsas_fp.c | 164 int quotient; \ 165 quotient = ((u_int64_t) (dividend)) / (u_int32_t) (divisor); \ 166 quotient;})
|
/dragonfly/contrib/cvs-1.12/contrib/ |
H A D | rcs-5.7-commitid.patch | 330 + quotient. BUF[0] is the most significant part of BUF.
|
/dragonfly/contrib/gcc-4.7/gcc/doc/ |
H A D | libgcc.texi | 73 These functions return the quotient of the signed division of @var{a} and 105 These functions return the quotient of the unsigned division of @var{a} 111 These functions calculate both the quotient and remainder of the unsigned 112 division of @var{a} and @var{b}. The return value is the quotient, and 269 These functions return the quotient of @var{a} and @var{b}; that is, 491 These functions return the quotient of @math{@var{a} + i@var{b}} and 546 These functions return the quotient of @var{a} and @var{b}; that is, 971 These functions return the quotient of the signed division of @var{a} 983 These functions return the quotient of the unsigned division of @var{a} 995 These functions return the quotient of the signed division of @var{a} [all …]
|
H A D | rtl.texi | 2229 @cindex quotient 2232 Represents the quotient in signed division of @var{x} by @var{y}, 2234 mode, it represents the exact quotient; otherwise, the integerized 2235 quotient. 2240 quotient widths are not all the same; you should represent 2264 the quotient.
|
H A D | md.texi | 330 that computes both a quotient and a remainder, where the opcode takes 332 twice; once for the quotient pattern and once for the remainder pattern. 4689 Signed division that produces both a quotient and a remainder. 4690 Operand 1 is divided by operand 2 to produce a quotient stored 4693 For machines with an instruction that produces both a quotient and a 4696 allows optimization in the relatively common case when both the quotient 4699 If an instruction that just produces a quotient or just a remainder 4703 quotient or remainder and generate the appropriate instruction.
|
/dragonfly/contrib/mpfr/doc/ |
H A D | mpfr.info | 2121 RND, where N is the integer quotient of X divided by Y, defined as 2133 the quotient N in *Q (more precisely the number of bits in a 2137 exact representation of the quotient is not practical. The
|
/dragonfly/sys/contrib/dev/acpica/tests/misc/ |
H A D | grammar.asl | 1593 Store ("++++++++ Checking (quotient) result from DIVIDE", Debug) 6297 // the quotient.
|
/dragonfly/share/dict/ |
H A D | web2a | 168 achievement quotient 16690 difference quotient 22952 form quotient 30327 intelligence quotient 45577 quotient verdict 47156 respiratory quotient
|
H A D | web2 | 162300 quotient
|
/dragonfly/sys/contrib/dev/acpica/ |
H A D | changes.txt | 2831 within the Divide operator for ASL+. For the case where both the quotient 18504 the quotient. This was a longstanding bug and it fixes several
|