HomeSort by: relevance | last modified time | path
    Searched refs:modulus (Results 1 - 25 of 27) sorted by relevancy

1 2

  /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/core/
int128.d 454 Cent modulus;
455 return udivmod(c1, c2, modulus);
459 * Unsigned divide c1 / c2. The remainder after division is stored to modulus.
463 * modulus = set to c1 % c2
468 Cent udivmod(Cent c1, Cent c2, out Cent modulus)
476 static U udivmod128_64(Cent c1, U c2, out U modulus)
486 modulus = 0UL;
527 modulus = (rem * base + num0 - q0 * c2) >> shift;
535 modulus = Zero;
536 return com(modulus);
    [all...]
  /src/sys/lib/libkern/arch/m68k/
umodsi3.S 62 | register, and that it returns the modulus in %d1:
65 movel %d1, %d0 | move the modulus into %d0
modsi3.S 62 | the modulus in %d1:
73 negl %d1 | negate modulus
74 .Lret: movl %d1, %d0 | move modulus into %d0
  /src/lib/libtelnet/
pk.c 138 BIGNUM *modulus = BN_new(); local
141 (void)BN_hex2bn(&modulus, HEXMODULUS);
146 BN_mod_exp(common, public, secret, modulus, ctx);
155 BN_free(modulus);
186 BIGNUM *modulus = BN_new(); local
196 (void)BN_hex2bn(&modulus, HEXMODULUS);
207 BN_div(tmp, sk, sk, modulus, ctx);
208 BN_mod_exp(pk, root, sk, modulus, ctx);
221 BN_free(modulus);
  /src/external/bsd/jemalloc/dist/include/jemalloc/internal/
lockedint.h 91 /* Increment and take modulus. Returns whether the modulo made any change. */
94 const uint64_t x, const uint64_t modulus) {
103 overflow = (after >= modulus);
105 after %= modulus;
112 overflow = (after >= modulus);
114 after %= modulus;
  /src/external/bsd/jemalloc/include/jemalloc/internal/
lockedint.h 91 /* Increment and take modulus. Returns whether the modulo made any change. */
94 const uint64_t x, const uint64_t modulus) {
103 overflow = (after >= modulus);
105 after %= modulus;
112 overflow = (after >= modulus);
114 after %= modulus;
  /src/common/lib/libc/arch/vax/gen/
urem.S 39 * Unsigned modulus, PCC flavor.
52 divl3 %r2,%r0,%r1 # small divisor and dividend: signed modulus
74 divl3 %r2,%r0,%r1 # small divisor and dividend: signed modulus
  /src/external/bsd/unbound/dist/sldns/
keyraw.c 376 /* Retrieve params as BIGNUM from raw buffer, n is modulus, e is exponent */
408 /* Modulus */
423 BIGNUM* modulus = NULL; local
426 if(!sldns_key_rsa_buf_bignum(key, len, &modulus, &exponent))
431 BN_free(modulus);
437 rsa->n = modulus;
442 if (!RSA_set0_key(rsa, modulus, exponent, NULL)) {
444 BN_free(modulus);
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/
int128.d 178 Cent modulus;
179 divmod(this.data, op2.data, modulus);
180 return Int128(modulus);
bigint.d 2328 Fast power modulus calculation for $(LREF BigInt) operands.
2332 modulus = the $(LREF BigInt) is modules to be modular of base ^ exponent.
2334 The power modulus value of (base ^ exponent) % modulus.
2336 BigInt powmod(BigInt base, BigInt exponent, BigInt modulus) pure nothrow @safe
2344 result = (result * base) % modulus;
2347 auto tmp = base % modulus;
2348 base = (tmp * tmp) % modulus;
2360 BigInt modulus = BigInt("1234567");
2362 BigInt result = powmod(base, exponent, modulus);
    [all...]
random.d 432 Linear Congruential generator. When m = 0, no modulus is used.
443 /// Highest generated value ($(D modulus - 1)).
447 = (x * multipler + increment) % modulus).
453 enum UIntType modulus = m;
545 _x = modulus ? (x0 % modulus) : x0;
761 auto rnd0 = MinstdRand0(MinstdRand0.modulus);
2158 The modulus operator maps an integer to a small, finite space. For instance, `x
2164 (Non-negative is important in this case because some definitions of modulus,
2166 (-3 .. 0]. `uniform` does not use negative number modulus, thus we can safel
    [all...]
complex.d 739 Returns: The absolute value (or modulus) of `z`.
781 Returns: The squared modulus of `z`.
919 modulus = The modulus
921 Returns: The complex number with the given modulus and argument.
923 Complex!(CommonType!(T, U)) fromPolar(T, U)(const T modulus, const U argument)
928 (modulus*cos(argument), modulus*sin(argument));
  /src/external/bsd/ntp/dist/util/
ntp-keygen.c 67 * These cryptographic routines are characterized by the prime modulus
125 #define PLEN 512 /* default prime modulus size (bits) */
126 #define ILEN 512 /* default identity modulus size (bits) */
182 u_int modulus = PLEN; /* prime modulus size (bits) */ variable
183 u_int modulus2 = ILEN; /* identity modulus size (bits) */
425 if (HAVE_OPT( MODULUS ))
426 modulus = OPT_VALUE_MODULUS;
1019 fprintf(stderr, "Generating RSA keys (%d bits)...\n", modulus);
1020 rsa = genRsaKeyPair(modulus, _UC("RSA"))
    [all...]
ntp-keygen-opts.def 23 descrip = "identity modulus bits";
25 The number of bits in the identity modulus. The default is 512.
143 name = modulus;
145 arg-name = modulus;
148 descrip = "prime modulus";
150 The number of bits in the prime modulus. The default is 512.
885 .It Fl b Fl -imbits Ns = Ar modulus
886 Set the number of bits in the identity modulus for generating identity keys to
887 .Ar modulus
889 The number of bits in the identity modulus defaults to 256, but can be set t
    [all...]
  /src/external/bsd/unbound/dist/validator/
val_secalgo.c 1185 SECItem modulus = {siBuffer, NULL, 0}; local
1208 modulus.data = key+offset;
1209 modulus.len = (len - offset);
1214 if(SECITEM_CopyItem(pk->arena, &pk->u.rsa.modulus, &modulus)) {
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/
bitmap_allocator.h 711 modulus = _BSize % _AlignSize, enumerator in enum:bitmap_allocator::aligned_size::__anon12167
712 value = _BSize + (modulus ? _AlignSize - (modulus) : 0)
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/
stl_function.h 172 struct modulus;
225 struct modulus : public binary_function<_Tp, _Tp, _Tp> struct in inherits:binary_function
309 struct modulus<void> struct
random.h 251 * @p __m is 0, the modulus @p __m used is
277 /** The modulus. */
278 static constexpr result_type modulus = __m;
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/tr1/
random.h 67 // Dispatch based on modulus value to prevent divide-by-zero compile-time
345 * @p __m is 0, the modulus @p __m used is
365 /** The modulus. */
366 static const _UIntType modulus = __m; member in class:linear_congruential
730 static const _IntType modulus = __m; member in class:subtract_with_carry
796 { return this->modulus - 1; }
  /src/external/apache2/mDNSResponder/dist/mDNSShared/dns_objects/utilities/
dns_obj_crypto.c 366 rsa_public_key_parse(key_copy, key_size, &params.modulus, &params.modulusLength, &params.exponent, &params.exponentLength);
  /src/external/gpl3/gcc.old/dist/libgcc/config/rl78/
divmodhi.S 257 ;; r8 = 4[sp] % 6[sp] (signed modulus)
353 ;; r8 = 4[sp] % 6[sp] (unsigned modulus)
  /src/sys/net/
bpfjit.c 1133 modulus(sljit_uw x, sljit_uw y) function
1201 SLJIT_FUNC_OFFSET(modulus));
  /src/sys/arch/vax/vax/
unimpl_emul.S 462 # Extended multiply/modulus
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/math/
exponential.d 809 * m = modulus
862 T base = x, result = 1, modulus = m;
868 result = mulmod(result, base, modulus);
870 base = mulmod(base, base, modulus);
  /src/external/bsd/ppp/dist/pppd/
eap.c 164 * A well-known 2048 bit modulus.
554 mytce.modulus.data = (u_char *)wkmodulus;
555 mytce.modulus.len = sizeof (wkmodulus);
561 * Client will have to verify this modulus/
2023 * If no modulus present, then use well-known

Completed in 130 milliseconds

1 2