/haiku-buildtools/gcc/gcc/config/tilegx/ |
H A D | tilegx-multiply.h | 54 long long multiplier; member in struct:tilegx_multiply_insn_seq 71 This is sorted by its 'multiplier' field so a binary search
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/tr1/5_numerical_facilities/random/linear_congruential/requirements/ |
H A D | constants.cc | 28 const void* p = &lc.multiplier;
|
/haiku-buildtools/gcc/gcc/config/tilepro/ |
H A D | tilepro-multiply.h | 58 int multiplier; member in struct:tilepro_multiply_insn_seq 75 'multiplier' field so a binary search can look for matches. */
|
H A D | gen-mul-tables.cc | 31 shift) and computing the multiplier computed by those instructions. 49 each multiplier, it emits them in a table sorted by the multiplier 182 /* The multiplier produced by this expression tree. For example, for 1082 find_mult_constants_used (int multiplier) argument 1084 return (int *) bsearch (&multiplier, multiply_constants_used, 1106 tilepro_emit (int multiplier, int num_ops) argument 1108 int abs_multiplier = (multiplier >= 0) ? multiplier : -multiplier; 1157 tilegx_emit(long long multiplier, int num_ops) argument [all...] |
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/opt/ |
H A D | pr34036.C | 23 double multiplier; member in class:mrGrid 31 cellDimension = multiplier * (xMeasure * yMeasure * zMeasure);
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/26_numerics/random/linear_congruential_engine/requirements/ |
H A D | constants.cc | 30 const void* p = &lc.multiplier;
|
H A D | constexpr_data.cc | 37 = _Ttesttype::multiplier;
|
/haiku-buildtools/gcc/gmp/tests/mpz/ |
H A D | t-mul.c | 38 one (int i, mpz_t multiplicand, mpz_t multiplier) argument 46 mpz_mul (product, multiplier, multiplicand); 47 refmpz_mul (ref_product, multiplier, multiplicand); 50 multiplier, multiplicand, product, ref_product); 53 mpz_mul (product, multiplier, multiplier); 54 mpz_set (multiplicand, multiplier); 55 mpz_mul (ref_product, multiplier, multiplicand); 58 multiplier, multiplier, produc [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/ |
H A D | pr60655-1.c | 26 int upton_modmult (unitptr prod, unitptr multiplicand, unitptr multiplier) argument
|
H A D | pr60655-2.c | 25 int upton_modmult (unitptr prod, unitptr multiplicand, unitptr multiplier) argument
|
/haiku-buildtools/gcc/libgcc/config/msp430/ |
H A D | lib2hw_mul.S | 59 MOV.W r12, &\OP1 ; Load operand 1 into multiplier 80 MOV.W r12, &\OP1 ; Load operand 1 into multiplier 101 MOV.W r12, &\OP1 ; Load operand 1 Low into multiplier 128 MOV.W r12, &\OP1_LO ; Load operand 1 Low into multiplier 129 MOV.W r13, &\OP1_HI ; Load operand 1 High into multiplier 130 MOV.W r14, &\OP2_LO ; Load operand 2 Low into multiplier 152 MOV.W r12, &\OP1_LO ; Load operand 1 Low into multiplier 153 MOV.W r13, &\OP1_HI ; Load operand 1 High into multiplier 154 MOV.W r14, &\OP2_LO ; Load operand 2 Low into multiplier
|
/haiku-buildtools/gcc/gmp/mpn/x86/pentium/mmx/ |
H A D | mul_1.asm | 24 C P5: 12.0 for 32-bit multiplier 25 C 7.0 for 16-bit multiplier 29 C mp_limb_t multiplier); 31 C When the multiplier is 16 bits some special case MMX code is used. Small 42 C for the high and low halves of the multiplier, and would probably 56 C bits, possibly as carry<multiplier, this being true of a big calculation 181 C Special case for 16-bit multiplier. 183 C eax multiplier 189 C ebp multiplier 242 C In the comments x represents the src data and m the multiplier (1 [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/aarch64/advsimd-intrinsics/ |
H A D | vmlXl_n.inc | 45 /* Choose multiplier arbitrarily. */
|
H A D | vmlX_n.inc | 59 /* Choose multiplier arbitrarily. */
|
/haiku-buildtools/gcc/gmp/mpn/power/ |
H A D | addmul_1.asm | 31 dnl the high limb of the result. We add the multiplicand if the multiplier 32 dnl has its most significant bit set, and we add the multiplier if the
|
H A D | mul_1.asm | 31 dnl the high limb of the result. We add the multiplicand if the multiplier 32 dnl has its most significant bit set, and we add the multiplier if the
|
H A D | submul_1.asm | 31 dnl the high limb of the result. We add the multiplicand if the multiplier 32 dnl has its most significant bit set, and we add the multiplier if the
|
/haiku-buildtools/gcc/gmp/mpn/x86/k6/ |
H A D | mul_basecase.asm | 244 C ebp multiplier 298 movl 4(%eax), %ebp C multiplier 324 movl (%eax,%edx,4), %ebp C yp limb multiplier 336 C ebp multiplier 389 C added to give the location of the next limb of yp, which is the multiplier 469 movl 4(%ebx), %ebp C multiplier (yp second limb) 508 movl (%eax,%edx,4), %ebp C next multiplier 547 C ebp multiplier
|
H A D | mul_1.asm | 39 C mp_limb_t multiplier); 41 C mp_limb_t multiplier, mp_limb_t carry); 101 C ebp multiplier 163 C ebp multiplier
|
/haiku-buildtools/gcc/gmp/mpn/x86/k7/ |
H A D | mul_basecase.asm | 243 C ebp multiplier 307 movl (%ebp,%edx,4), %ebp C yp second lowest limb - multiplier 322 movl (%edx,%ebp,4), %ebp C yp limb - multiplier 335 C ebp multiplier 398 C added to give the location of the next limb of yp, which is the multiplier 421 movl 4(%eax), %ebp C multiplier (yp second limb) 488 movl (%edx,%ebp,4), %ebp C yp next multiplier 515 C ebp yp multiplier limb
|
/haiku-buildtools/gcc/gmp/mpn/x86/p6/ |
H A D | mul_basecase.asm | 251 C ebp multiplier 302 movl (%ebp,%edx,4), %ebp C yp second lowest limb - multiplier 317 movl (%edx,%ebp,4), %ebp C yp limb - multiplier 331 C ebp multiplier 404 C added to give the location of the next limb of yp, which is the multiplier 422 movl 4(%eax), %ebp C multiplier (yp second limb) 499 movl (%edx,%ebp,4), %ebp C yp next multiplier 528 C ebp yp multiplier limb
|
/haiku-buildtools/gcc/gmp/mpn/x86/pentium/ |
H A D | mul_1.asm | 28 C mp_limb_t multiplier); 30 C mp_limb_t multiplier, mp_limb_t carry);
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/rx/ |
H A D | builtins.c | 141 rmpa (int * multiplicand, int * multiplier, int num) argument
|
/haiku-buildtools/gcc/gmp/mpn/x86/ |
H A D | sqr_basecase.asm | 161 movl (%eax), %ebp C src[0], multiplier 176 C ebp multiplier 231 movl -8(%esi,%ecx,4), %ebp C next multiplier 243 C ebp multiplier
|
/haiku-buildtools/gcc/gmp/tests/ |
H A D | tests.h | 191 mp_limb_t multiplier)); 193 mp_limb_t multiplier, mp_limb_t carry)); 296 mp_limb_t multiplier)); 298 mp_limb_t multiplier, mp_limb_t carry)); 377 mp_limb_t multiplier)); 379 mp_limb_t multiplier, mp_limb_t carry));
|