| /src/sys/external/bsd/drm2/dist/drm/nouveau/include/nvkm/subdev/bios/ |
| M0209.h | 12 u8 modulo; member in struct:nvbios_M0209E
|
| /src/external/gpl3/gdb.old/dist/sim/common/ |
| sim-memopt.h | 31 unsigned modulo; member in struct:_sim_memopt
|
| sim-memopt.c | 72 '\0', "ADDRESS,SIZE[,MODULO]", "Add a memory region",
117 unsigned modulo,
131 addr, nr_bytes, modulo, NULL, buffer);
136 fill_length = (modulo == 0) ? nr_bytes : modulo;
163 bytes = (modulo == 0 ? nr_bytes : modulo) + padding;
204 addr, nr_bytes, modulo, NULL, aligned_buffer);
207 fill_length = (modulo == 0) ? nr_bytes : modulo;
382 unsigned modulo = 0; local
412 unsigned modulo = 0; local
445 unsigned modulo = 0; local
549 unsigned modulo; local
[all...] |
| /src/external/gpl3/gdb/dist/sim/common/ |
| sim-memopt.h | 31 unsigned modulo; member in struct:_sim_memopt
|
| sim-memopt.c | 72 '\0', "ADDRESS,SIZE[,MODULO]", "Add a memory region",
117 unsigned modulo,
131 addr, nr_bytes, modulo, NULL, buffer);
136 fill_length = (modulo == 0) ? nr_bytes : modulo;
163 bytes = (modulo == 0 ? nr_bytes : modulo) + padding;
204 addr, nr_bytes, modulo, NULL, aligned_buffer);
207 fill_length = (modulo == 0) ? nr_bytes : modulo;
382 unsigned modulo = 0; local
412 unsigned modulo = 0; local
445 unsigned modulo = 0; local
549 unsigned modulo; local
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/amd/display/dc/dcn20/ |
| amdgpu_dcn20_dccg.c | 58 int modulo, phase; local
60 // phase / modulo = dpp pipe clk / dpp global clk
61 modulo = 0xff; // use FF at the end
62 phase = ((modulo * req_dppclk) + ref_dppclk - 1) / ref_dppclk;
71 DPPCLK0_DTO_MODULO, modulo);
|
| /src/sys/arch/dreamcast/dev/ |
| pvr.c | 467 int modulo = 1, voffset, hoffset; local
526 modulo += 640 * 2 / 4; /* interlace -> skip every other line */
544 PVR_REG_WRITE(dc, PVRREG_DIWSIZE, DIWSIZE_MODULO(modulo) |
|
| /src/crypto/external/bsd/openssl/dist/test/ |
| bntest.c | 1132 * congruent to $a^{(b-1)/2}$, modulo $b$ (Legendre symbol). So we
2827 BIGNUM *base = NULL, *exponent = NULL, *modulo = NULL; local
2833 || !TEST_true(BN_dec2bn(&modulo, test->mod)))
2836 if (!TEST_int_eq(BN_mod_exp(result, base, exponent, modulo, ctx), 1))
2852 BN_free(modulo);
2861 BIGNUM *base = NULL, *exponent = NULL, *modulo = NULL; local
2867 || !TEST_true(BN_dec2bn(&modulo, test->mod)))
2872 BN_set_flags(modulo, BN_FLG_CONSTTIME);
2874 if (!TEST_int_eq(BN_mod_exp(result, base, exponent, modulo, ctx), 1))
2890 BN_free(modulo);
[all...] |
| /src/crypto/external/bsd/openssl.old/dist/test/ |
| bntest.c | 1128 * congruent to $a^{(b-1)/2}$, modulo $b$ (Legendre symbol). So we
2743 BIGNUM *base = NULL, *exponent = NULL, *modulo = NULL; local
2749 || !TEST_true(BN_dec2bn(&modulo, test->mod)))
2752 if (!TEST_int_eq(BN_mod_exp(result, base, exponent, modulo, ctx), 1))
2768 BN_free(modulo);
2777 BIGNUM *base = NULL, *exponent = NULL, *modulo = NULL; local
2783 || !TEST_true(BN_dec2bn(&modulo, test->mod)))
2788 BN_set_flags(modulo, BN_FLG_CONSTTIME);
2790 if (!TEST_int_eq(BN_mod_exp(result, base, exponent, modulo, ctx), 1))
2806 BN_free(modulo);
[all...] |
| /src/crypto/external/apache2/openssl/dist/test/ |
| bntest.c | 1154 * congruent to $a^{(b-1)/2}$, modulo $b$ (Legendre symbol). So we
3096 BIGNUM *base = NULL, *exponent = NULL, *modulo = NULL; local
3102 || !TEST_true(BN_dec2bn(&modulo, test->mod)))
3105 if (!TEST_int_eq(BN_mod_exp(result, base, exponent, modulo, ctx), 1))
3121 BN_free(modulo);
3130 BIGNUM *base = NULL, *exponent = NULL, *modulo = NULL; local
3136 || !TEST_true(BN_dec2bn(&modulo, test->mod)))
3141 BN_set_flags(modulo, BN_FLG_CONSTTIME);
3143 if (!TEST_int_eq(BN_mod_exp(result, base, exponent, modulo, ctx), 1))
3159 BN_free(modulo);
[all...] |
| /src/sbin/nvmectl/ |
| bignum.c | 1174 modulo(mp_int * a, mp_int * b, mp_int * c) function
1322 if ((res = modulo(a, b, &y)) != MP_OKAY) {
1442 if ((res = modulo(a, b, &x)) != MP_OKAY) {
2678 /* reduces a modulo n where n is of the form 2**p - d
3299 if ((err = modulo(G, P, &M[1])) != MP_OKAY) {
3317 /* reduce modulo P */
3533 res = modulo(&t, c, d);
3851 /* reduce "x" in place modulo "n" using the Diminished Radix algorithm.
3959 /* reduces a modulo n where n is of the form 2**p - d */
4138 if ((err = modulo(G, P, &M[1])) != MP_OKAY)
[all...] |
| /src/crypto/external/bsd/netpgp/dist/src/netpgpverify/ |
| bignum.c | 1178 modulo(mp_int * a, mp_int * b, mp_int * c) function
1326 if ((res = modulo(a, b, &y)) != MP_OKAY) {
1446 if ((res = modulo(a, b, &x)) != MP_OKAY) {
2682 /* reduces a modulo n where n is of the form 2**p - d
3303 if ((err = modulo(G, P, &M[1])) != MP_OKAY) {
3321 /* reduce modulo P */
3537 res = modulo(&t, c, d);
3556 res = modulo(&t, c, d);
3874 /* reduce "x" in place modulo "n" using the Diminished Radix algorithm.
3982 /* reduces a modulo n where n is of the form 2**p - d *
[all...] |
