/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/ |
H A D | lambda-trans.c | 57 /* Compute the inverse of the transformation matrix MAT. */ 62 lambda_trans_matrix inverse; local 65 inverse = lambda_trans_matrix_new (LTM_ROWSIZE (mat), LTM_COLSIZE (mat)); 66 determinant = lambda_matrix_inverse (LTM_MATRIX (mat), LTM_MATRIX (inverse), 68 LTM_DENOMINATOR (inverse) = determinant; 69 return inverse;
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/ |
H A D | lambda-trans.c | 58 /* Compute the inverse of the transformation matrix MAT. */ 63 lambda_trans_matrix inverse; local 66 inverse = lambda_trans_matrix_new (LTM_ROWSIZE (mat), LTM_COLSIZE (mat)); 67 determinant = lambda_matrix_inverse (LTM_MATRIX (mat), LTM_MATRIX (inverse), 69 LTM_DENOMINATOR (inverse) = determinant; 70 return inverse;
|
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpz/ |
H A D | invert.c | 1 /* mpz_invert (inv, x, n). Find multiplicative inverse of X in Z(N). 2 If X has an inverse, return non-zero and store inverse in INVERSE, 27 mpz_invert (mpz_ptr inverse, mpz_srcptr x, mpz_srcptr n) argument 39 /* No inverse exists if the leftside operand is 0. Likewise, no 40 inverse exists if the mod operand is 1. */ 50 /* If no inverse existed, return with an indication of that. */ 57 /* Make sure we return a positive inverse. */ 61 mpz_sub (inverse, tmp, n); 63 mpz_add (inverse, tm [all...] |
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpn/generic/ |
H A D | dive_1.c | 70 mp_limb_t c, h, l, ls, s, s_next, inverse, dummy; local 95 binvert_limb (inverse, divisor); 112 l = (l * inverse) & GMP_NUMB_MASK; 124 l = (l * inverse) & GMP_NUMB_MASK; 129 l = (s * inverse) & GMP_NUMB_MASK; 142 l = (l * inverse) & GMP_NUMB_MASK;
|
H A D | mode1o.c | 66 In terms of efficiency, this function is similar to a mul-by-inverse 76 have r<d too, for the following reasons. Let q=l*inverse be the quotient 107 mp_limb_t s, h, l, inverse, dummy, dmul, ret; local 136 binvert_limb (inverse, d); 144 l = (l * inverse) & GMP_NUMB_MASK; 169 l = (l * inverse) & GMP_NUMB_MASK; 197 mp_limb_t s, x, y, inverse, dummy, dmul, c1, c2; 204 binvert_limb (inverse, d); 217 y = (y * inverse) & GMP_NUMB_MASK;
|
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpn/sparc64/ |
H A D | dive_1.c | 45 inverse. 49 mul-by-inverse. At size==2 the inverse is about 260 cycles total 57 mp_limb_t inverse, s, s_next, c, l, ls, q; local 84 binvert_limb (inverse, divisor); 105 q = l * inverse; 117 q = l * inverse; 132 q = l * inverse; 144 q = l * inverse;
|
H A D | mode1o.c | 62 possibility would be to take two limbs at a time, with a 128 bit inverse, 73 mp_limb_t s, l, q, h, inverse; local 81 /* udivx is faster than 10 or 12 mulx's for one limb via an inverse */ 100 binvert_limb (inverse, d); 110 q = l * inverse; 134 q = l * inverse; 154 q = l * inverse; 178 q = l * inverse;
|
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpn/alpha/ |
H A D | dive_1.c | 41 23 13 7 mulq q = y * inverse 51 mp_limb_t inverse, lshift_mask, s, sr, s_next, c, h, x, y, q, dummy; local 71 binvert_limb (inverse, divisor); 91 q = y * inverse; 102 q = y * inverse;
|
H A D | mode1o.asm | 37 C 23 13 7 mulq q = y * inverse 53 C - The subq y=x-climb can be done without waiting for the inverse. 55 C - The mulq y*inverse is replicated after the final subq for the inverse, 67 C calculating an inverse, the latter taking about 130 cycles on ev4 or 70 on 86 ` ldbu r20, 0(r21) C table[idx], inverse 8 bits 89 extbl r20, r21, r20 C table[idx], inverse 8 bits 101 subq r20, r7, r20 C 2*i-i*i*d, inverse 16 bits 108 subq r20, r7, r20 C 2*i-i*i*d, inverse 32 bits 116 subq r20, r7, r20 C inv = 2*i-i*i*d, inverse 6 [all...] |
/netbsd-6-1-5-RELEASE/gnu/dist/texinfo/info/ |
H A D | display.h | 36 int inverse; /* Non-zero means this line is inverse. */ member in struct:__anon4887
|
H A D | display.c | 62 display[i]->inverse = 0; 303 if ((entry && entry->inverse) 309 entry->inverse = 0; 335 || (entry->inverse)) 351 /* Lines showing node text are not in inverse. Only modelines 353 entry->inverse = 0; 425 /* This display line must both be in inverse, and have the same 427 if ((!display[line_index]->inverse) || 435 display[line_index]->inverse = 1; 493 the_display[i]->inverse [all...] |
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpn/ia64/ |
H A D | dive_1.asm | 37 C The critical path during initialization is for computing the inverse of the 41 C Possible improvement: Merge more of the feed-in code into the inverse 109 }{.mmi; ld1 r3 = [r3] C M0 inverse, 8 bits 116 }{.mmi; setf.sig f7 = r3 C M2 inverse, 8 bits 123 C f7 inverse, being calculated 124 C f8 -1, will be -inverse 154 .Ln1: xmpy.l f12 = f10, f7 C q = ulimb * inverse 158 xmpy.l f8 = f7, f8 C -inverse = inverse * -1 159 xmpy.l f12 = f11, f7 C q = ulimb * inverse [all...] |
H A D | mode1o.asm | 43 C q = low(l * inverse) 46 C but we can work the src[i]-c into an xma by calculating si=src[i]*inverse 49 C q = low(c * inverse + si) 69 C The first limb uses q = (src[0]-c) * inverse shown in the first style. 70 C This lets us get the first q as soon as the inverse is ready, without 71 C going through si=s*inverse. Basically at the start we have c and can use 72 C it while waiting for the inverse, whereas for the second and subsequent 73 C limbs it's the other way around, ie. we have the inverse and are waiting 84 C inverse, so this is begun first and optimized. Apart from that, ar.lc is 92 C The initial 8-bit inverse i [all...] |
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpn/powerpc32/ |
H A D | mode1o.asm | 38 C For PIC, the inverse is established arithmetically since it measures about 46 C The loop allows an early-out on mullw for the inverse, and on mulhwu for 47 C the divisor. So the fastest is for instance divisor==1 (inverse==-1), and 49 C divisor==0xDEADBEEF (inverse==0x904B300F). These establish the stated 70 xor r4, r4, r7 C inverse, 4 bits 75 sub r4, r4, r7 C inverse, 8 bits 79 lbzx r4, r4,r7 C inverse, 8 bits 85 sub r4, r4, r7 C inverse, 16 bits 90 sub r4, r4, r7 C inverse, 32 bits 93 mullw r7, r7, r4 C q = l * inverse [all...] |
/netbsd-6-1-5-RELEASE/crypto/external/bsd/openssl/dist/crypto/idea/ |
H A D | i_skey.c | 63 static IDEA_INT inverse(unsigned int xin); 114 *(tp++)=inverse(fp[0]); 117 *(tp++)=inverse(fp[3]); 135 static IDEA_INT inverse(unsigned int xin) function
|
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpn/x86/pentium4/sse2/ |
H A D | dive_1.asm | 33 C Using divl for size==1 seems a touch quicker than mul-by-inverse. The mul 144 C pmuludq q = s*inverse 8 162 C mm5 inverse 179 pmuludq %mm5, %mm2 C s*inverse 198 pmuludq %mm5, %mm2 C s*inverse
|
H A D | mode1o.asm | 118 C pmuludq q = s*inverse 8 135 C mm6 inverse 147 pmuludq %mm6, %mm2 C s*inverse
|
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpn/x86_64/ |
H A D | mode1o.asm | 61 C divq for size==1 was measured at about 79 cycles, compared to the inverse 149 C r9 inverse 155 imulq %r9, %rax C q = l * inverse 171 imulq %r9, %rax C q = l * inverse
|
/netbsd-6-1-5-RELEASE/bin/ed/ |
H A D | 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
|
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/ |
H A D | gen-psqr.c | 99 mpz_t pp_inverted; /* invert_limb style inverse */ 114 mpz_t inverse; /* 1/divisor mod 2^mod_bits */ member in struct:factor_t 405 mpz_init (factor[i].inverse); 406 mpz_invert_ui_2exp (factor[i].inverse, 510 mpz_out_str (stdout, 16, factor[i].inverse);
|
/netbsd-6-1-5-RELEASE/usr.bin/pkill/ |
H A D | pkill.c | 89 static int inverse; variable 234 inverse = 1; 422 if (inverse) 424 } else if (!inverse)
|
/netbsd-6-1-5-RELEASE/sys/arch/luna68k/dev/ |
H A D | omrasops.c | 83 uint32_t lmask, rmask, glyph, inverse; local 93 inverse = (attr != 0) ? ALL1BITS : ALL0BITS; 107 glyph = (glyph >> align) ^ inverse; 121 lhalf = (glyph >> align) ^ inverse; 124 rhalf = (glyph << (BLITWIDTH - align)) ^ inverse;
|
/netbsd-6-1-5-RELEASE/libexec/ld.elf_so/arch/powerpc/ |
H A D | rtld_start.S | 93 * inverse. a / n = ((a * inv(n)) >> 32) 97 lis %r11,0x15555556@h # load multiplicative inverse of 12
|
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpn/x86/k6/ |
H A D | mode1o.asm | 34 C A special case for size==1 using a divl rather than the inverse measured 131 C edi inverse
|
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpn/x86/k7/ |
H A D | mode1o.asm | 38 C calculate the modular inverse. 138 C edi inverse
|