Searched refs:modulo (Results 1 – 25 of 73) sorted by relevance
123
| /freebsd-12-stable/crypto/openssl/doc/man3/ |
| D | BN_mod_inverse.pod | 5 BN_mod_inverse - compute inverse modulo n 16 BN_mod_inverse() computes the inverse of B<a> modulo B<n>
|
| D | BN_add.pod | 73 BN_nnmod() reduces I<a> modulo I<m> and places the nonnegative 76 BN_mod_add() adds I<a> to I<b> modulo I<m> and places the nonnegative 79 BN_mod_sub() subtracts I<b> from I<a> modulo I<m> and places the 89 BN_mod_sqr() takes the square of I<a> modulo B<m> and places the 102 BN_mod_exp() computes I<a> to the I<p>-th power modulo I<m> (C<r=a^p %
|
| D | BN_mod_mul_montgomery.pod | 69 The inputs must be reduced modulo B<m>, otherwise the result will be
|
| /freebsd-12-stable/contrib/file/magic/Magdir/ |
| D | compress | 63 # size of the original (uncompressed) input data modulo 2^32 65 >>>-4 ulelong x \b, original size modulo 2^32 %u 88 # size of the original (uncompressed) input data modulo 2^32 90 >>>-4 ulelong x \b, original size modulo 2^32 %u 121 # size of the original (uncompressed) input data modulo 2^32 122 #>-4 ulelong x \b, original size modulo 2^32 %u
|
| D | pgp-binary-keys | 151 # will be identical to v4 data structures modulo the version number.
|
| D | map | 79 # Checksum, sum of all bytes modulo 256 should be 0
|
| /freebsd-12-stable/contrib/llvm-project/lld/docs/ELF/ |
| D | linker_script.rst | 91 > The value of sh_addr must be congruent to 0, modulo the value of sh_addralign. 95 sh_addr=0 (modulo sh_addralign).
|
| /freebsd-12-stable/lib/libc/softfloat/bits32/ |
| D | softfloat-macros | 267 value formed by concatenating `b0' and `b1'. Addition is modulo 2^64, so 288 modulo 2^96, so any carry out is lost. The result is broken into three 326 64-bit value formed by concatenating `a0' and `a1'. Subtraction is modulo 346 is modulo 2^96, so any borrow out (carry out) is lost. The result is broken
|
| /freebsd-12-stable/sys/contrib/zlib/doc/ |
| D | rfc1950.txt | 327 are done modulo 65521. s1 is initialized to 1, s2 to zero. The 484 The modulo on unsigned long accumulators can be delayed for 5552 485 bytes, so the modulo operation time is negligible. If the bytes 525 % modulo operator: a % b is the remainder of a divided by b.
|
| D | rfc1952.txt | 429 data modulo 2^32.
|
| /freebsd-12-stable/lib/libc/softfloat/bits64/ |
| D | softfloat-macros | 342 value formed by concatenating `b0' and `b1'. Addition is modulo 2^128, so 363 modulo 2^192, so any carry out is lost. The result is broken into three 401 128-bit value formed by concatenating `a0' and `a1'. Subtraction is modulo 421 Subtraction is modulo 2^192, so any borrow out (carry out) is lost. The
|
| /freebsd-12-stable/contrib/libstdc++/ |
| D | README | 22 modulo specific runtime-related files that are in the libsupc++
|
| D | ChangeLog | 86 result_type, true_type)): Avoid the modulo (which uses the low-order
|
| /freebsd-12-stable/contrib/gcc/ |
| D | params.def | 304 "Maximum number of loops to perform swing modulo scheduling on (mainly for debugging)", 310 "A factor for tuning the upper bound that swing modulo scheduler uses for scheduling a loop", 314 "The number of cycles the swing modulo scheduler considers when checking conflicts using DFA", 318 "A threshold on the average loop count considered by the swing modulo scheduler",
|
| D | timevar.def | 151 DEFTIMEVAR (TV_SMS , "sms modulo scheduling")
|
| D | common.opt | 621 Perform SMS based modulo scheduling before the first scheduling pass 639 freschedule-modulo-scheduled-loops 641 Enable/Disable the traditional scheduling in loops that already passed modulo scheduling
|
| /freebsd-12-stable/contrib/gcc/config/arm/ |
| D | lib1funcs.asm | 547 .macro THUMB_DIV_MOD_BODY modulo argument 578 .if \modulo 657 .if \modulo
|
| /freebsd-12-stable/secure/lib/libcrypto/arm/ |
| D | chacha-armv4.S | 81 ldr r12,[sp,#4*(12)] @ modulo-scheduled load 203 str r8, [sp,#4*(16+8)] @ modulo-scheduled store 847 ldr r12,[sp,#4*(12)] @ modulo-scheduled load 1085 str r8, [sp,#4*(16+8)] @ modulo-scheduled store 1294 ldr r12,[sp,#4*(12)] @ modulo-scheduled load
|
| D | ghashv8-armx.S | 114 @ as loop is modulo-scheduled
|
| /freebsd-12-stable/gnu/usr.bin/cc/cc_int/ |
| D | Makefile | 51 mode-switching.o modulo-sched.o optabs.o options.o opts.o opts-common.o \
|
| /freebsd-12-stable/contrib/llvm-project/lldb/bindings/python/ |
| D | python-extensions.swig | 442 def __ipow__(self, other, modulo): 443 result = self.__pow__(self, other, modulo)
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Support/ |
| D | APInt.cpp | 1183 APInt APInt::multiplicativeInverse(const APInt& modulo) const { in multiplicativeInverse() 1184 assert(ult(modulo) && "This APInt must be smaller than the modulo"); in multiplicativeInverse() 1194 APInt r[2] = { modulo, *this }; in multiplicativeInverse() 1220 t[i] += modulo; in multiplicativeInverse()
|
| /freebsd-12-stable/contrib/binutils/opcodes/ |
| D | cgen-asm.in | 83 are not equal modulo case conversion. */
|
| /freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
| D | APInt.h | 1870 APInt multiplicativeInverse(const APInt &modulo) const;
|
| /freebsd-12-stable/contrib/gdb/gdb/doc/ |
| D | agentexpr.texi | 287 @item @code{rem_signed} (0x07): @var{a} @var{b} @result{} @var{a modulo b} 292 @item @code{rem_unsigned} (0x08): @var{a} @var{b} @result{} @var{a modulo b}
|
123