Home
last modified time | relevance | path

Searched refs:inverse (Results 1 – 25 of 267) sorted by relevance

1234567891011

/netbsd-src/external/lgpl3/gmp/dist/mpn/generic/
H A Dmode1o.c117 mp_limb_t s, h, l, inverse, dummy, dmul, ret; in mpn_modexact_1c_odd() local
146 binvert_limb (inverse, d); in mpn_modexact_1c_odd()
154 l = (l * inverse) & GMP_NUMB_MASK; in mpn_modexact_1c_odd()
179 l = (l * inverse) & GMP_NUMB_MASK; in mpn_modexact_1c_odd()
207 mp_limb_t s, x, y, inverse, dummy, dmul, c1, c2;
214 binvert_limb (inverse, d);
227 y = (y * inverse) & GMP_NUMB_MASK;
H A Ddive_1.c80 mp_limb_t c, h, l, ls, s, s_next, inverse, dummy; in mpn_divexact_1() local
97 binvert_limb (inverse, divisor); in mpn_divexact_1()
114 l = (l * inverse) & GMP_NUMB_MASK; in mpn_divexact_1()
123 l = (l * inverse) & GMP_NUMB_MASK; in mpn_divexact_1()
130 l = (s * inverse) & GMP_NUMB_MASK; in mpn_divexact_1()
142 l = (l * inverse) & GMP_NUMB_MASK; in mpn_divexact_1()
/netbsd-src/external/lgpl3/gmp/dist/mpn/sparc64/
H A Ddive_1.c67 mp_limb_t inverse, s, s_next, c, l, ls, q; in mpn_divexact_1() local
103 binvert_limb (inverse, divisor); in mpn_divexact_1()
119 q = l * inverse; in mpn_divexact_1()
131 q = l * inverse; in mpn_divexact_1()
146 q = l * inverse; in mpn_divexact_1()
158 q = l * inverse; in mpn_divexact_1()
H A Dmode1o.c83 mp_limb_t s, l, q, h, inverse; in mpn_modexact_1c_odd() local
110 binvert_limb (inverse, d); in mpn_modexact_1c_odd()
120 q = l * inverse; in mpn_modexact_1c_odd()
144 q = l * inverse; in mpn_modexact_1c_odd()
164 q = l * inverse; in mpn_modexact_1c_odd()
188 q = l * inverse; in mpn_modexact_1c_odd()
/netbsd-src/external/lgpl3/gmp/dist/mpn/ia64/
H A Dmode1o.asm86 C limbs it's the other way around, ie. we have the inverse and are waiting
97 C inverse, so this is begun first and optimized. Apart from that, ar.lc is
105 C The initial 8-bit inverse is calculated using a table lookup. If it hits
293 xmpy.l f10 = f10, f7 C q = sc * inverse
294 xmpy.l f8 = f7, f8 C -inverse = inverse * -1
310 C f7 inverse
311 C f8 -inverse
313 C f10 src[i] * inverse
322 xma.l f10 = f9, f8, f10 C q = c * -inverse + si
328 xmpy.l f10 = f11, f7 C si = src[i] * inverse
[all …]
/netbsd-src/external/lgpl3/gmp/dist/mpz/
H A Dinvert.c36 mpz_invert (mpz_ptr inverse, mpz_srcptr x, mpz_srcptr n) in mpz_invert() argument
63 mpz_sub (inverse, tmp, n); in mpz_invert()
65 mpz_add (inverse, tmp, n); in mpz_invert()
68 mpz_set (inverse, tmp); in mpz_invert()
/netbsd-src/external/gpl2/texinfo/dist/info/
H A Ddisplay.c62 display[i]->inverse = 0; in display_clear_display()
303 if ((entry && entry->inverse) in display_update_one_window()
309 entry->inverse = 0; in display_update_one_window()
335 || (entry->inverse)) in display_update_one_window()
353 entry->inverse = 0; in display_update_one_window()
427 if ((!display[line_index]->inverse) || in display_update_one_window()
435 display[line_index]->inverse = 1; in display_update_one_window()
493 the_display[i]->inverse = 0; in display_scroll_display()
513 the_display[i]->inverse = 0; in display_scroll_display()
626 display[i]->inverse = 0; in make_display()
/netbsd-src/external/lgpl3/gmp/dist/mpn/alpha/
H A Ddive_1.c61 mp_limb_t inverse, lshift_mask, s, sr, s_next, c, h, x, y, q, dummy; in mpn_divexact_1() local
81 binvert_limb (inverse, divisor); in mpn_divexact_1()
101 q = y * inverse; in mpn_divexact_1()
112 q = y * inverse; in mpn_divexact_1()
H A Dmode1o.asm64 C - The subq y=x-climb can be done without waiting for the inverse.
66 C - The mulq y*inverse is replicated after the final subq for the inverse,
78 C calculating an inverse, the latter taking about 130 cycles on ev4 or 70 on
97 ` ldbu r20, 0(r21) C table[idx], inverse 8 bits
112 subq r20, r7, r20 C 2*i-i*i*d, inverse 16 bits
119 subq r20, r7, r20 C 2*i-i*i*d, inverse 32 bits
127 subq r20, r7, r20 C inv = 2*i-i*i*d, inverse 64 bits
/netbsd-src/crypto/external/bsd/openssl/dist/crypto/idea/
H A Di_skey.c21 static IDEA_INT inverse(unsigned int xin);
70 *(tp++) = inverse(fp[0]); in IDEA_set_decrypt_key()
73 *(tp++) = inverse(fp[3]); in IDEA_set_decrypt_key()
92 static IDEA_INT inverse(unsigned int xin) in inverse() function
/netbsd-src/crypto/external/bsd/openssl.old/dist/crypto/idea/
H A Di_skey.c14 static IDEA_INT inverse(unsigned int xin);
63 *(tp++) = inverse(fp[0]); in IDEA_set_decrypt_key()
66 *(tp++) = inverse(fp[3]); in IDEA_set_decrypt_key()
85 static IDEA_INT inverse(unsigned int xin) in inverse() function
/netbsd-src/external/lgpl3/gmp/dist/mpn/powerpc32/
H A Dmode1o.asm57 C The loop allows an early-out on mullw for the inverse, and on mulhwu for
58 C the divisor. So the fastest is for instance divisor==1 (inverse==-1), and
60 C divisor==0xDEADBEEF (inverse==0x904B300F). These establish the stated
90 lbzx r4, r4,r7 C inverse, 8 bits
/netbsd-src/crypto/external/bsd/openssl.old/dist/doc/man3/
H A DBN_mod_inverse.pod5 BN_mod_inverse - compute inverse modulo n
16 BN_mod_inverse() computes the inverse of B<a> modulo B<n>
25 BN_mod_inverse() returns the B<BIGNUM> containing the inverse, and
H A DBN_BLINDING_new.pod54 If B<r> is not NULL a copy the inverse blinding factor B<Ai> will be
57 inverse blinding factor B<Ai>. If B<r> is not NULL it will be used as
58 the inverse blinding.
/netbsd-src/crypto/external/bsd/openssl/dist/doc/man3/
H A DBN_mod_inverse.pod5 BN_mod_inverse - compute inverse modulo n
16 BN_mod_inverse() computes the inverse of B<a> modulo B<n>
29 BN_mod_inverse() returns the B<BIGNUM> containing the inverse, and
H A DBN_BLINDING_new.pod54 If B<r> is not NULL a copy the inverse blinding factor B<Ai> will be
57 inverse blinding factor B<Ai>. If B<r> is not NULL it will be used as
58 the inverse blinding.
/netbsd-src/external/lgpl3/gmp/dist/mpn/x86/pentium4/sse2/
H A Dbdiv_q_1.asm54 C mp_limb_t inverse, int shift)
107 C mm5 inverse
124 pmuludq %mm5, %mm2 C s*inverse
143 pmuludq %mm5, %mm2 C s*inverse
H A Ddive_1.asm44 C Using divl for size==1 seems a touch quicker than mul-by-inverse. The mul
173 C mm5 inverse
190 pmuludq %mm5, %mm2 C s*inverse
209 pmuludq %mm5, %mm2 C s*inverse
/netbsd-src/bin/ed/
H A Dcbc.c108 if (des_cipher(buf, buf, 0L, (inverse ? -1 : 1))) \
390 int inverse = 0; /* 0 to encrypt, 1 to decrypt */ in cbc_encode() local
430 int inverse = 1; /* 0 to encrypt, 1 to decrypt */ in cbc_decode() local
/netbsd-src/external/lgpl3/gmp/dist/
H A Dgen-psqr.c125 mpz_t inverse; /* 1/divisor mod 2^mod_bits */ member
414 mpz_init (factor[i].inverse); in generate_mod()
415 mpz_invert_ui_2exp (factor[i].inverse, in generate_mod()
519 mpz_out_str (stdout, 16, factor[i].inverse); in print()
/netbsd-src/usr.bin/pkill/
H A Dpkill.c95 static int inverse;
251 inverse = 1; in main()
454 if (inverse) in usage()
456 } else if (!inverse) in usage()
91 static int inverse; global() variable
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dtree-ssa-tail-merge.cc226 bitmap inverse; member
403 bitmap_print (file, e->inverse, "inverse:", "\n"); in same_succ_print()
630 same->inverse = BITMAP_ALLOC (NULL); in same_succ_alloc()
644 BITMAP_FREE (e->inverse); in remove()
657 bitmap_clear (same->inverse); in same_succ_reset()
755 bitmap_set_bit ((*slot)->inverse, bb->index); in find_same_succ_bb()
1206 inv_cond = (bitmap_bit_p (same_succ->inverse, bb1->index) in gimple_equal_p()
1207 != bitmap_bit_p (same_succ->inverse, bb2->index)); in gimple_equal_p()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dtree-ssa-tail-merge.c226 bitmap inverse; member
403 bitmap_print (file, e->inverse, "inverse:", "\n"); in same_succ_print()
630 same->inverse = BITMAP_ALLOC (NULL); in same_succ_alloc()
644 BITMAP_FREE (e->inverse); in remove()
657 bitmap_clear (same->inverse); in same_succ_reset()
755 bitmap_set_bit ((*slot)->inverse, bb->index); in find_same_succ_bb()
1194 inv_cond = (bitmap_bit_p (same_succ->inverse, bb1->index) in gimple_equal_p()
1195 != bitmap_bit_p (same_succ->inverse, bb2->index)); in gimple_equal_p()
/netbsd-src/external/lgpl3/gmp/dist/mpn/x86/k6/
H A Dmode1o.asm45 C A special case for size==1 using a divl rather than the inverse measured
142 C edi inverse
/netbsd-src/external/mit/isl/dist/test_inputs/codegen/
H A Dsingle_valued.in1 # Check that isl recognizes that the inverse schedule is single-valued

1234567891011