Searched refs:addmod (Results 1 - 4 of 4) sorted by relevance
| /third_party/python/Modules/_decimal/libmpdec/ |
| H A D | fourstep.c | 56 s = addmod(s, *x2, umod); in std_size3_ntt()
57 s = addmod(s, *x3, umod); in std_size3_ntt()
66 s = addmod(s, tmp, umod); in std_size3_ntt()
70 s = addmod(s, tmp, umod); in std_size3_ntt()
79 s = addmod(s, tmp, umod); in std_size3_ntt()
83 s = addmod(s, tmp, umod); in std_size3_ntt()
101 s = addmod(s, *x2, umod); in ppro_size3_ntt()
102 s = addmod(s, *x3, umod); in ppro_size3_ntt()
111 s = addmod(s, tmp, umod); in ppro_size3_ntt()
115 s = addmod( in ppro_size3_ntt()
[all...] |
| H A D | difradix2.c | 107 a[j] = addmod(u0, v0, umod); in fnt_dif2()
110 a[j+1] = addmod(u1, v1, umod); in fnt_dif2()
134 a[r] = addmod(u0, v0, umod); in fnt_dif2()
137 a[m+r] = addmod(u1, v1, umod); in fnt_dif2()
156 a[r+j] = addmod(u0, v0, umod); in fnt_dif2()
159 a[m+r+j] = addmod(u1, v1, umod); in fnt_dif2()
|
| H A D | umodarith.h | 50 * ACL2 proof: umodarith.lisp: addmod-correct
53 addmod(mpd_uint_t a, mpd_uint_t b, mpd_uint_t m) in addmod() function
|
| /third_party/python/Modules/_decimal/libmpdec/literature/ |
| H A D | umodarith.lisp | 141 ;; addmod, submod
144 (defun addmod (a b m base) function
150 (defthmd addmod-correct
155 (equal (addmod a b m base)
|
Completed in 4 milliseconds