| /src/external/gpl2/texinfo/dist/info/ |
| display.h | 36 int inverse; /* Non-zero means this line is inverse. */ member in struct:__anon9519
|
| /src/external/lgpl3/gmp/dist/mpn/generic/ |
| mode1o.c | 76 In terms of efficiency, this function is similar to a mul-by-inverse
86 have r<d too, for the following reasons. Let q=l*inverse be the quotient
117 mp_limb_t s, h, l, inverse, dummy, dmul, ret; local
146 binvert_limb (inverse, d);
154 l = (l * inverse) & GMP_NUMB_MASK;
179 l = (l * inverse) & GMP_NUMB_MASK;
207 mp_limb_t s, x, y, inverse, dummy, dmul, c1, c2;
214 binvert_limb (inverse, d);
227 y = (y * inverse) & GMP_NUMB_MASK;
|
| dive_1.c | 80 mp_limb_t c, h, l, ls, s, s_next, inverse, dummy; local
97 binvert_limb (inverse, divisor);
114 l = (l * inverse) & GMP_NUMB_MASK;
123 l = (l * inverse) & GMP_NUMB_MASK;
130 l = (s * inverse) & GMP_NUMB_MASK;
142 l = (l * inverse) & GMP_NUMB_MASK;
|
| /src/external/lgpl3/gmp/dist/mpn/alpha/ |
| dive_1.c | 51 23 13 7 mulq q = y * inverse
61 mp_limb_t inverse, lshift_mask, s, sr, s_next, c, h, x, y, q, dummy; local
81 binvert_limb (inverse, divisor);
101 q = y * inverse;
112 q = y * inverse;
|
| /src/external/lgpl3/gmp/dist/mpn/sparc64/ |
| dive_1.c | 55 inverse.
59 mul-by-inverse. At size==2 the inverse is about 260 cycles total
67 mp_limb_t inverse, s, s_next, c, l, ls, q; local
103 binvert_limb (inverse, divisor);
119 q = l * inverse;
131 q = l * inverse;
146 q = l * inverse;
158 q = l * inverse;
|
| mode1o.c | 72 possibility would be to take two limbs at a time, with a 128 bit inverse,
83 mp_limb_t s, l, q, h, inverse; local
91 /* udivx is faster than 10 or 12 mulx's for one limb via an inverse */
110 binvert_limb (inverse, d);
120 q = l * inverse;
144 q = l * inverse;
164 q = l * inverse;
188 q = l * inverse;
|
| /src/crypto/external/apache2/openssl/dist/crypto/idea/ |
| i_skey.c | 20 static IDEA_INT inverse(unsigned int xin);
69 *(tp++) = inverse(fp[0]);
72 *(tp++) = inverse(fp[3]);
91 static IDEA_INT inverse(unsigned int xin) function
|
| /src/crypto/external/bsd/openssl/dist/crypto/idea/ |
| i_skey.c | 21 static IDEA_INT inverse(unsigned int xin);
70 *(tp++) = inverse(fp[0]);
73 *(tp++) = inverse(fp[3]);
92 static IDEA_INT inverse(unsigned int xin) function
|
| /src/crypto/external/bsd/openssl.old/dist/crypto/idea/ |
| i_skey.c | 14 static IDEA_INT inverse(unsigned int xin);
63 *(tp++) = inverse(fp[0]);
66 *(tp++) = inverse(fp[3]);
85 static IDEA_INT inverse(unsigned int xin) function
|
| /src/bin/ed/ |
| cbc.c | 108 if (des_cipher(buf, buf, 0L, (inverse ? -1 : 1))) \
390 int inverse = 0; /* 0 to encrypt, 1 to decrypt */ local
430 int inverse = 1; /* 0 to encrypt, 1 to decrypt */ local
|
| /src/external/gpl3/gdb/dist/gdb/ |
| mingw-hdep.c | 290 int fgcolor, bgcolor, bright, inverse; local
318 /* Inverse video. */
320 inverse = 1;
322 inverse = 0;
325 if (inverse)
|
| /src/external/gpl3/gdb.old/dist/gdb/ |
| mingw-hdep.c | 290 int fgcolor, bgcolor, bright, inverse; local
318 /* Inverse video. */
320 inverse = 1;
322 inverse = 0;
325 if (inverse)
|
| /src/external/lgpl3/gmp/dist/ |
| gen-psqr.c | 110 mpz_t pp_inverted; /* invert_limb style inverse */
125 mpz_t inverse; /* 1/divisor mod 2^mod_bits */ member in struct:factor_t
414 mpz_init (factor[i].inverse);
415 mpz_invert_ui_2exp (factor[i].inverse,
519 mpz_out_str (stdout, 16, factor[i].inverse);
|
| /src/usr.bin/bdes/ |
| bdes.c | 104 if (des_cipher(buf, buf, 0L, (inverse ? -1 : 1))) \
116 if (encrypt(bits1, inverse)) \
157 static int inverse; /* 0 to encrypt, 1 to decrypt */ variable
287 inverse = (alg == ALG_CBC || alg == ALG_ECB) && mode == MODE_DECRYPT;
|
| /src/usr.bin/pkill/ |
| pkill.c | 95 static int inverse; variable
255 inverse = 1;
458 if (inverse)
460 } else if (!inverse)
|
| /src/sys/arch/vax/vsa/ |
| smg.c | 652 uint32_t lmask, rmask, glyph, inverse; local
662 inverse = ((attr & WSATTR_REVERSE) != 0) ? ALL1BITS : ALL0BITS;
684 glyph = (glyph << align) ^ inverse;
699 lhalf = (glyph << align) ^ inverse;
703 rhalf = (glyph >> (BLITWIDTH - align)) ^ inverse;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| ScaledNumber.h | 655 // TODO: implement directly, rather than relying on inverse. Inverse is
657 return inverse().scale(N);
677 ScaledNumber inverse() const { return ScaledNumber(*this).invert(); } function in class:llvm::ScaledNumber
|
| /src/external/bsd/nvi/dist/gtk/ |
| gtkviscreen.c | 655 #define Inverse(screen,y,x) \
677 gchar inverse; local
678 inverse = Inverse(vi,y,x);
682 Inverse(vi,y,x+len) == inverse; ++len);
683 if (inverse) {
|
| /src/games/canfield/canfield/ |
| canfield.c | 565 printrank(int a, int b, const struct cardtype *cp, bool inverse)
570 if (inverse)
589 if (inverse)
605 bool inverse = (cp->suit == 'd' || cp->suit == 'h'); local
607 printrank(a, b, cp, inverse);
608 if (inverse)
611 if (inverse)
|
| /src/external/gpl3/gcc/dist/gcc/ |
| ipa-param-manipulation.cc | 2063 int inverse = -1; local
2067 inverse = i;
2070 gcc_assert (inverse >= 0);
2073 ptm_item.base_index = inverse;
|
| loop-iv.cc | 1314 /* Computes inverse to X modulo (1 << MOD). */
1317 inverse (uint64_t x, int mod) function
2639 (inverse(s/d) * (c/d)) mod (size of mode/d). */
2655 inv = inverse (s, size);
|
| tree-ssa-tail-merge.cc | 214 it's marked in inverse.
226 bitmap inverse; member in struct:same_succ
411 bitmap_print (file, e->inverse, "inverse:", "\n");
547 are inverse for the EDGE_TRUE_VALUE and EDGE_FALSE_VALUE flags, and equal for
641 same->inverse = BITMAP_ALLOC (NULL);
655 BITMAP_FREE (e->inverse);
668 bitmap_clear (same->inverse);
766 bitmap_set_bit ((*slot)->inverse, bb->index);
1217 inv_cond = (bitmap_bit_p (same_succ->inverse, bb1->index
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| ipa-param-manipulation.cc | 1894 int inverse = -1; local
1898 inverse = i;
1901 gcc_assert (inverse >= 0);
1904 ptm_item.base_index = inverse;
|
| loop-iv.cc | 1287 /* Computes inverse to X modulo (1 << MOD). */
1290 inverse (uint64_t x, int mod) function
2655 (inverse(s/d) * (c/d)) mod (size of mode/d). */
2671 inv = inverse (s, size);
|
| tree-ssa-tail-merge.cc | 214 it's marked in inverse.
226 bitmap inverse; member in struct:same_succ
403 bitmap_print (file, e->inverse, "inverse:", "\n");
536 are inverse for the EDGE_TRUE_VALUE and EDGE_FALSE_VALUE flags, and equal for
630 same->inverse = BITMAP_ALLOC (NULL);
644 BITMAP_FREE (e->inverse);
657 bitmap_clear (same->inverse);
755 bitmap_set_bit ((*slot)->inverse, bb->index);
1206 inv_cond = (bitmap_bit_p (same_succ->inverse, bb1->index
[all...] |
