Searched refs:odd (Results 1 - 10 of 10) sorted by relevance
/barrelfish-2018-10-04/lib/zlib/ |
H A D | crc32.c | 378 unsigned long odd[GF2_DIM]; /* odd-power-of-two zeros operator */ local 384 /* put operator for one zero bit in odd */ 385 odd[0] = 0xedb88320L; /* CRC-32 polynomial */ 388 odd[n] = row; 393 gf2_matrix_square(even, odd); 395 /* put operator for four zero bits in odd */ 396 gf2_matrix_square(odd, even); 402 gf2_matrix_square(even, odd); 411 /* another iteration of the loop with odd an [all...] |
/barrelfish-2018-10-04/lib/lwip/src/core/ipv4/ |
H A D | inet_chksum.c | 98 /* dataptr may be at odd or even addresses */ 149 int odd = ((u32_t) pb & 1); local 152 if (odd && len > 0) { 177 /* Swap if alignment was odd */ 178 if (odd) { 192 * @arg start of buffer to be checksummed. May be an odd byte address. 206 /* starts at odd byte address? */ 207 int odd = ((u32_t) pb & 1); local 209 if (odd && len > 0) { 249 if (len > 0) { /* include odd byt [all...] |
/barrelfish-2018-10-04/lib/arranet/ |
H A D | inet_chksum.c | 88 /* dataptr may be at odd or even addresses */ 140 int odd = ((mem_ptr_t)pb & 1); local 143 if (odd && len > 0) { 168 /* Swap if alignment was odd */ 169 if (odd) { 183 * @arg start of buffer to be checksummed. May be an odd byte address. 197 /* starts at odd byte address? */ 198 int odd = ((mem_ptr_t)pb & 1); local 200 if (odd && len > 0) { 240 if (len > 0) { /* include odd byt [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ech/ |
H A D | puzzle_bool.pl | 108 odd(L,C,S) . 117 % odd/2 generates the constraint that an odd number of elements of its first 120 odd(L,C*S,S):- exors(L,C). 130 odd([A], A * S,S) :- ! . 132 odd([A,B,C], ((A * ~~(B) * ~~(C)) + 138 odd([A,B,C,D], ((A * ~~(B) * ~~(C) * ~~(D)) + 148 odd([A,B,C,D,E],((A * ~~(B) * ~~(C) * ~~(D) * ~~(E)) +
|
/barrelfish-2018-10-04/lib/lwip2/src/core/ |
H A D | inet_chksum.c | 87 /* dataptr may be at odd or even addresses */ 139 int odd = ((mem_ptr_t)pb & 1); local 142 if (odd && len > 0) { 167 /* Swap if alignment was odd */ 168 if (odd) { 182 * @arg start of buffer to be checksummed. May be an odd byte address. 196 /* starts at odd byte address? */ 197 int odd = ((mem_ptr_t)pb & 1); local 199 if (odd && len > 0) { 239 if (len > 0) { /* include odd byt [all...] |
/barrelfish-2018-10-04/lib/tommath/ |
H A D | bn.tex | 196 RSA cryptography you only require exponentiation with odd moduli so even moduli support can be safely removed. 205 \hline Exponentiation with odd moduli only & BN\_S\_MP\_EXPTMOD\_C \\ 210 \hline Exponentiation with random odd moduli & (The above plus the following) \\ 217 \hline Modular inverse odd moduli only & BN\_MP\_INVMOD\_SLOW\_C \\ 280 It may seem odd to compare LibTomMath to GnuPG since the math in GnuPG is only a small portion of the entire application. 1377 Montgomery is a specialized reduction algorithm for any odd moduli. Like Barrett reduction a pre--computation 1385 For the given odd moduli $a$ the precomputation value is placed in $mp$. The reduction is computed with the 1408 Which calculates $a = R$ for the odd moduli $b$ without using multiplication or division. 1579 a root with the sign of the input for odd roots. For example, performing $4^{1/2}$ will return $2$ whereas $(-8)^{1/3}$
|
H A D | tommath.tex | 91 Which seems odd and perhaps too terse for adult conversation. I often qualify it with ``I am able, I am willing.'' which 3245 appear twice hence the name ``double product''. Every odd column is made up entirely of double products. In fact every column is made up of double 3478 The radix point for squaring is simply placed exactly in the middle of the digits when the input has an odd number of digits, otherwise it is 3592 & increase the throughput of mp\_exptmod() for random odd moduli in the range \\ 3873 $n$ must be odd. The variable $x$ will represent the quantity of which the residue is sought. Similar to the Barrett algorithm the input 3894 \hspace{3mm}1.1 If $x$ is odd then \\ 3905 The algorithm reduces the input one bit at a time using the two congruencies stated previously. Inside the loop $n$, which is odd, is 3906 added to $x$ if $x$ is odd. This forces $x$ to be even which allows the division by two in $\Z$ to be congruent to a modular division by two. Since 4101 for the Barrett algorithm. Additionally if $n > 1$ and $n$ is odd there will exist a modular inverse $\rho$. $\rho$ must be calculated in 4672 \hline Montgomery & $m^2 + m$ & $n$ must be odd [all...] |
/barrelfish-2018-10-04/lib/openssl-1.0.0d/util/ |
H A D | pod2man.pl | 251 numbering and even/odd paging, at least on some versions of man(7).
|
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/ |
H A D | lists.pl | 510 the original. If the original length is odd, Front is one longer"),
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/ |
H A D | umslanguage.tex | 584 Similar, but only do odd values for the second variable:
|
Completed in 276 milliseconds