| /freebsd-11.0-release/contrib/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;
|
| H A D | lambda-code.c | 167 *inverse* of the transformation matrix. */
749 /* Compute the inverse of U. */
772 lambda_matrix inverse, H1; local
787 inverse = lambda_matrix_new (depth, depth);
788 determinant = lambda_matrix_inverse (LTM_MATRIX (H), inverse, depth);
799 lambda_matrix_mult (H1, inverse, target, depth, depth, depth);
845 depth, inverse, depth, local
902 depth, inverse, depth, local
|
| H A D | tree-ssa-loop-niter.c | 85 /* Returns inverse of X modulo 2^s, where MASK = 2^s-1. */
88 inverse (tree x, tree mask) function
174 (inverse(s/d) * (c/d)) mod (size of mode/d). */
197 tmp = fold_build2 (MULT_EXPR, niter_type, c, inverse (s, bound));
|
| H A D | loop-iv.c | 1245 /* Computes inverse to X modulo (1 << MOD). */
1248 inverse (unsigned HOST_WIDEST_INT x, int mod) function
2332 (inverse(s/d) * (c/d)) mod (size of mode/d). */
2348 inv = inverse (s, size);
|
| /freebsd-11.0-release/crypto/openssl/crypto/idea/ |
| H A D | i_skey.c | 63 static IDEA_INT inverse(unsigned int xin);
121 *(tp++) = inverse(fp[0]);
124 *(tp++) = inverse(fp[3]);
143 static IDEA_INT inverse(unsigned int xin) function
|
| /freebsd-11.0-release/bin/ed/ |
| H A D | cbc.c | 59 inverse ? DES_DECRYPT : DES_ENCRYPT);
322 int inverse = 0; /* 0 to encrypt, 1 to decrypt */ local
363 int inverse = 1; /* 0 to encrypt, 1 to decrypt */ local
|
| /freebsd-11.0-release/contrib/llvm/include/llvm/IR/ |
| H A D | ConstantRange.h | 271 ConstantRange inverse() const;
|
| /freebsd-11.0-release/bin/pkill/ |
| H A D | pkill.c | 104 static int inverse; variable
281 inverse = 1;
564 if (inverse)
566 } else if (!inverse)
|
| /freebsd-11.0-release/contrib/llvm/lib/IR/ |
| H A D | ConstantRange.cpp | 127 .inverse();
141 return CR0.inverse().unionWith(CR1.inverse()).inverse();
317 return intersectWith(CR.inverse());
801 ConstantRange ConstantRange::inverse() const { function in class:ConstantRange
|
| /freebsd-11.0-release/crypto/openssl/crypto/rc4/asm/ |
| H A D | rc4-parisc.pl | 264 sub %r0,$len,%r23 ; inverse index
273 sub %r0,$len,%r23 ; inverse index
|
| /freebsd-11.0-release/contrib/libxo/xolint/ |
| H A D | xolint.pl | 464 } elsif ($val =~ /^(no-)?(bold|underline|inverse)$/) {
479 #@ inverse, no-inverse, normal, and reset. Values must
|
| /freebsd-11.0-release/secure/usr.bin/bdes/ |
| H A D | bdes.c | 138 int inverse; /* 0 to encrypt, 1 to decrypt */ variable
249 inverse = (alg == ALG_CBC || alg == ALG_ECB) && mode == MODE_DECRYPT;
|
| /freebsd-11.0-release/contrib/llvm/include/llvm/Support/ |
| H A D | ScaledNumber.h | 656 // TODO: implement directly, rather than relying on inverse. Inverse is
658 return inverse().scale(N);
678 ScaledNumber inverse() const { return ScaledNumber(*this).invert(); } function in class:llvm::ScaledNumber
|
| /freebsd-11.0-release/contrib/llvm/lib/Analysis/ |
| H A D | BlockFrequencyInfoImpl.cpp | 357 // Block scale stores the inverse of the scale. If this is an infinite loop,
361 ExitMass.isEmpty() ? InifiniteLoopScale : ExitMass.toScaled().inverse();
443 ScalingFactor = Min.inverse();
|
| H A D | LazyValueInfo.cpp | 927 if (!isTrueDest) TrueValues = TrueValues.inverse();
1280 if (TrueValues.inverse().contains(CR))
|
| H A D | InstructionSimplify.cpp | 2389 if (RHS_CR.inverse().contains(LHS_CR))
|
| /freebsd-11.0-release/contrib/llvm/lib/Transforms/Utils/ |
| H A D | SimplifyCFG.cpp | 479 Span = Span.inverse();
|