Searched refs:modulo (Results 1 – 25 of 63) sorted by relevance
123
| /freebsd-10-stable/crypto/openssl/doc/crypto/ |
| 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 | 70 BN_nnmod() reduces I<a> modulo I<m> and places the non-negative 73 BN_mod_add() adds I<a> to I<b> modulo I<m> and places the non-negative 76 BN_mod_sub() subtracts I<b> from I<a> modulo I<m> and places the 86 BN_mod_sqr() takes the square of I<a> modulo B<m> and places the 93 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 | 85 The inputs must be reduced modulo B<m>, otherwise the result will be
|
| /freebsd-10-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-10-stable/crypto/openssl/crypto/modes/asm/ |
| D | ghash-x86_64.pl | 355 my ($Xhi,$Xi,$Hkey,$modulo)=@_; 357 $code.=<<___ if (!defined($modulo));
|
| /freebsd-10-stable/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-10-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-10-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-10-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-10-stable/contrib/gcc/config/arm/ |
| D | lib1funcs.asm | 547 .macro THUMB_DIV_MOD_BODY modulo argument 578 .if \modulo 657 .if \modulo
|
| /freebsd-10-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-10-stable/contrib/llvm/lib/Support/ |
| D | APInt.cpp | 1352 APInt APInt::multiplicativeInverse(const APInt& modulo) const { in multiplicativeInverse() 1353 assert(ult(modulo) && "This APInt must be smaller than the modulo"); in multiplicativeInverse() 1363 APInt r[2] = { modulo, *this }; in multiplicativeInverse() 1388 return t[i].isNegative() ? t[i] + modulo : t[i]; in multiplicativeInverse()
|
| /freebsd-10-stable/crypto/openssl/crypto/rc2/ |
| D | rrc2.doc | 76 up the sum (modulo 256) in the S-box, and appending the result to the key. The
|
| /freebsd-10-stable/contrib/sendmail/libmilter/ |
| D | README | 210 not just -pthread). libmilter is currently known to work on (modulo problems
|
| /freebsd-10-stable/contrib/binutils/opcodes/ |
| D | cgen-asm.in | 83 are not equal modulo case conversion. */
|
| /freebsd-10-stable/contrib/llvm/include/llvm/ADT/ |
| D | APInt.h | 1528 APInt multiplicativeInverse(const APInt &modulo) const;
|
| /freebsd-10-stable/contrib/ofed/management/opensm/doc/ |
| D | opensm_release_notes_openib-2.0.5.txt | 266 ib_types.h: Pad ib_inform_info_record_t to be modulo 8 in size so
|
| /freebsd-10-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}
|
| /freebsd-10-stable/contrib/gcc/doc/ |
| D | passes.texi | 779 @cindex modulo scheduling 786 The pass is located in (@file{modulo-sched.c}).
|
| D | implement-c.texi | 232 modulo @math{2^N} to be within range of the type; no signal is raised.
|
| /freebsd-10-stable/tools/tools/tinybsd/conf/wireless/etc/ |
| D | pf.os | 106 # it with '*'. You can also use a modulo operator to match any values
|
123