HomeSort by: relevance | last modified time | path
    Searched defs:mult (Results 1 - 25 of 92) sorted by relevancy

1 2 3 4

  /src/sys/external/isc/libsodium/dist/src/libsodium/crypto_scalarmult/curve25519/
scalarmult_curve25519.h 6 int (*mult)(unsigned char *q, const unsigned char *n, member in struct:crypto_scalarmult_curve25519_implementation
  /src/tests/usr.bin/indent/
opt_T.c 13 int mult = (unknown_type_name) * arg; variable
22 int mult = (unknown_type_name) * arg; variable
31 int mult = (unknown_type_name) * arg; variable
opt_ta.c 13 int mult = (unknown_type_name) * arg; local
23 int mult = (unknown_type_name) * arg; local
  /src/crypto/external/bsd/heimdal/dist/lib/roken/
parse_units.h 56 unsigned mult; member in struct:units
  /src/sys/arch/x86/x86/
intel_busclock.c 79 int mult; local
82 mult = (msr >> 8) & 0xff;
83 if (mult == 0)
87 mult / 10000;
  /src/external/bsd/jemalloc/dist/test/src/
timer.c 27 uint64_t mult; local
37 mult = 1;
39 mult *= 10;
48 uint64_t round = (i+1 == buflen-1 && ((t0 * mult * 10 / t1) % 10
51 "%"FMTu64, (t0 * mult / t1) % 10 + round);
53 mult *= 10;
  /src/external/bsd/jemalloc.old/dist/test/src/
timer.c 28 uint64_t mult; local
38 mult = 1;
40 mult *= 10;
49 uint64_t round = (i+1 == buflen-1 && ((t0 * mult * 10 / t1) % 10
52 "%"FMTu64, (t0 * mult / t1) % 10 + round);
54 mult *= 10;
  /src/sys/dev/fdt/
fixedfactorclock.c 65 u_int mult; member in struct:fixedfactorclock_clk
107 of_getprop_uint32(phandle, "clock-mult", &sc->sc_clk.mult);
109 if (sc->sc_clk.div == 0 || sc->sc_clk.mult == 0) {
124 sc->sc_clk.mult, sc->sc_clk.div);
170 return (clk_get_rate(clkp_parent) * fclk->mult) / fclk->div;
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.base/
nodebug.c 70 mult (double v1, double v2) function
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.base/
nodebug.c 70 mult (double v1, double v2) function
  /src/external/bsd/bc/dist/
execute.c 619 bc_num build, temp, result, mult, divisor; local
626 bc_init_num (&mult);
631 bc_int2num (&mult, conv_base);
662 bc_multiply (build, mult, &result, 0);
678 bc_multiply (result, mult, &result, 0);
681 bc_multiply (divisor, mult, &divisor, 0);
697 bc_free_num (&mult);
  /src/external/gpl2/gettext/dist/gettext-runtime/intl/
plural-exp.h 45 mult, /* Multiplication. */ enumerator in enum:expression::operator
  /src/external/gpl2/grep/dist/intl/
plural-exp.h 51 mult, /* Multiplication. */ enumerator in enum:expression::operator
  /src/external/gpl2/texinfo/dist/intl/
plural-exp.h 47 mult, /* Multiplication. */ enumerator in enum:expression::operator
  /src/external/gpl3/gcc.old/dist/intl/
plural-exp.h 55 mult, /* Multiplication. */ enumerator in enum:expression::operator
  /src/external/lgpl3/gmp/dist/mpz/
n_pow_ui.c 110 #define MPN_MUL_2(ptr, size, alloc, mult) \
114 cy = mpn_mul_2 (ptr, ptr, size, mult); \
442 mp_limb_t mult[2]; local
456 mult[0] = blimb_low;
457 mult[1] = blimb;
468 MPN_MUL_2 (rp, rsize, ralloc, mult);
474 mult[0] = rl;
475 mult[1] = rl_high;
476 MPN_MUL_2 (rp, rsize, ralloc, mult);
  /src/external/lgpl3/mpfr/dist/src/
exp3.c 43 mpz_t *Q, mpfr_prec_t *mult)
56 log2_nb_terms = mult + (m+1);
72 mult[0] = 0; /* the multiplier P[k]/Q[k] for the remaining terms
73 satisfies P[k]/Q[k] <= 2^(-mult[k]) */
105 mult[k-1] += prec_i_have + (r << l) - prec_ptoj - 1;
106 prec_i_have = mult[k] = mult[k-1];
107 /* since mult[k] >= mult[k-1] + nbits(Q[k]),
108 we have Q[0]*...*Q[k] <= 2^mult[k] = 2^prec_i_have *
164 mpfr_prec_t *mult; local
    [all...]
  /src/lib/libm/arch/vax/
n_argred.S 566 jbr mult
580 jbr mult
606 jbr mult
628 mult: label
  /src/sys/arch/arm/nxp/
imxpcie.c 337 int mult; local
340 mult = 25;
343 mult = 40;
346 mult = 25;
355 val |= __SHIFTIN(mult, MPLL_MULTIPLIER);
  /src/sys/arch/arm/ti/
ti_dpll_clock.c 259 const u_int mult = __SHIFTOUT(val, DPLL_MULT); local
264 return (u_int)((mult * parent_rate) / div);
292 const u_int mult = rate / (parent_rate / (div + 1)); local
293 if (mult < 2 || mult > 2047)
304 mult_div1 = __SHIFTIN(mult, DPLL_MULT);
332 const u_int mult = rate / (parent_rate / (div + 1)); local
333 if (mult < 2 || mult > 2047)
343 mult_div1 = __SHIFTIN(mult, DPLL_MULT)
369 const u_int mult = __SHIFTOUT(val, OMAP3_CORE_DPLL_MULT); local
390 const u_int mult = __SHIFTOUT(val, DPLL_MULT); local
    [all...]
ti_prcm.h 51 u_int mult; member in struct:ti_prcm_fixed_factor
113 const u_int mult = tc->u.fixed_factor.mult; local
116 return (clk_get_rate(&tc_parent->base) * mult) / div;
129 .u.fixed_factor.mult = (_mult), \
  /src/sys/dev/pci/
viaenv.c 182 static const long mult[] = local
187 return (25LL * val + 133) * mult[index] / 2628;
  /src/usr.bin/dc/
inout.c 334 BIGNUM *mult, *stop; local
339 mult = BN_new();
341 if (mult == NULL || stop == NULL)
343 bn_check(BN_one(mult));
348 while (BN_cmp(mult, stop) < 0) {
366 bn_check(BN_mul_word(mult, base));
369 BN_free(mult);
  /src/crypto/external/bsd/openssh/dist/
smult_curve25519_ref.c 65 static void mult(unsigned int out[32],const unsigned int a[32],const unsigned int b[32]) function
165 mult(b1,a1,a0 + 32);
166 mult(b1 + 32,a1 + 32,a0);
173 mult(xznb,b0,b0 + 32);
174 mult(xznb + 32,s,u);
176 mult(xzn1b + 32,r,work);
200 /* 9 */ mult(z9,t0,z);
201 /* 11 */ mult(z11,z9,z2);
203 /* 2^5 - 2^0 = 31 */ mult(z2_5_0,t0,z9);
210 /* 2^10 - 2^0 */ mult(z2_10_0,t0,z2_5_0)
    [all...]
  /src/external/bsd/ntp/dist/sntp/libopts/
parse-duration.c 498 unsigned int mult; local
513 mult = SEC_PER_YEAR;
520 mult = SEC_PER_MONTH;
527 mult = SEC_PER_WEEK;
534 mult = SEC_PER_DAY;
541 mult = SEC_PER_HR;
548 mult = SEC_PER_MIN;
553 mult = 1;
558 res = scale_n_add (res, val, mult);

Completed in 25 milliseconds

1 2 3 4