/external/proguard/src/proguard/gui/ |
D | FilterBuilder.java | 53 StringBuffer positive = new StringBuffer(); in buildFilter() local 56 buildFilter("", positive, negative); in buildFilter() 58 return positive.length() <= negative.length() ? in buildFilter() 59 positive.toString() : in buildFilter() 73 StringBuffer positive, in buildFilter() argument 102 if (positive.length() > 0) in buildFilter() 104 positive.append(','); in buildFilter() 106 positive.append('!').append(prefix); in buildFilter() 110 positive.append('*'); in buildFilter() 167 if (positive.length() > 0 && in buildFilter() [all …]
|
/external/eigen/test/eigen2/ |
D | eigen2_svd.cpp | 58 MatrixType unitary, positive; in svd() local 59 svd.computeUnitaryPositive(&unitary, &positive); in svd() 61 VERIFY_IS_APPROX(positive, positive.adjoint()); in svd() 62 …for(int i = 0; i < rows; i++) VERIFY(positive.diagonal()[i] >= 0); // cheap necessary (not suffici… in svd() 63 VERIFY_IS_APPROX(unitary*positive, a); in svd() 65 svd.computePositiveUnitary(&positive, &unitary); in svd() 67 VERIFY_IS_APPROX(positive, positive.adjoint()); in svd() 68 …for(int i = 0; i < rows; i++) VERIFY(positive.diagonal()[i] >= 0); // cheap necessary (not suffici… in svd() 69 VERIFY_IS_APPROX(positive*unitary, a); in svd()
|
/external/pdfium/third_party/bigint/ |
D | BigInteger.cc | 26 case positive: in BigInteger() 45 case positive: in BigInteger() 62 BigInteger::BigInteger(unsigned long x) : mag(x) { sign = mag.isZero() ? zero : positive; } in BigInteger() 63 BigInteger::BigInteger(unsigned int x) : mag(x) { sign = mag.isZero() ? zero : positive; } in BigInteger() 64 BigInteger::BigInteger(unsigned short x) : mag(x) { sign = mag.isZero() ? zero : positive; } in BigInteger() 78 : (x > 0) ? BigInteger::positive in signOf() 115 if (sign == positive) { in convertToSignedPrimitive() 149 case positive: in compareTo() 257 sign = (a.sign == b.sign) ? positive : negative; in multiply() 313 q.sign = positive; in divideWithRemainder() [all …]
|
D | BigInteger.hh | 30 enum Sign { negative = -1, zero = 0, positive = 1 }; enumerator 51 sign = mag.isZero() ? zero : positive; in BigInteger() 59 sign = mag.isZero() ? zero : positive; in BigInteger()
|
/external/llvm/test/Transforms/CorrelatedValuePropagation/ |
D | basic.ll | 140 br i1 %cmp, label %positive, label %out 142 positive: 151 %p = phi i32 [ -1, %entry ], [ 1, %positive ], [ 1, %positive ] 155 %q = phi i32 [ 0, %positive ], [ 0, %positive ] 163 br i1 %cmp, label %positive, label %out 165 positive: 174 %p = phi i32 [ -1, %entry ], [ 1, %positive ], [ 1, %positive ] 178 %q = phi i32 [ 0, %positive ], [ 0, %positive ]
|
/external/libvpx/libvpx/vpx_dsp/arm/ |
D | variance_media.asm | 47 sel r7, r6, lr ; select bytes with positive difference 53 usad8 r4, r7, lr ; calculate sum of positive differences 57 adds r8, r8, r4 ; add positive differences to sum 71 sel r7, r6, lr ; select bytes with positive difference 76 usad8 r4, r7, lr ; calculate sum of positive differences 81 add r8, r8, r4 ; add positive differences to sum 95 sel r7, r6, lr ; select bytes with positive difference 100 usad8 r4, r7, lr ; calculate sum of positive differences 105 add r8, r8, r4 ; add positive differences to sum 120 sel r7, r6, lr ; select bytes with positive difference [all …]
|
D | variance_halfpixvar16x16_h_media.asm | 50 sel r7, r6, lr ; select bytes with positive difference 56 usad8 r4, r7, lr ; calculate sum of positive differences 60 adds r8, r8, r4 ; add positive differences to sum 81 sel r7, r6, lr ; select bytes with positive difference 86 usad8 r4, r7, lr ; calculate sum of positive differences 91 add r8, r8, r4 ; add positive differences to sum 112 sel r7, r6, lr ; select bytes with positive difference 117 usad8 r4, r7, lr ; calculate sum of positive differences 122 add r8, r8, r4 ; add positive differences to sum 144 sel r7, r6, lr ; select bytes with positive difference [all …]
|
D | variance_halfpixvar16x16_v_media.asm | 51 sel r7, r6, lr ; select bytes with positive difference 57 usad8 r4, r7, lr ; calculate sum of positive differences 61 adds r8, r8, r4 ; add positive differences to sum 82 sel r7, r6, lr ; select bytes with positive difference 87 usad8 r4, r7, lr ; calculate sum of positive differences 92 add r8, r8, r4 ; add positive differences to sum 113 sel r7, r6, lr ; select bytes with positive difference 118 usad8 r4, r7, lr ; calculate sum of positive differences 123 add r8, r8, r4 ; add positive differences to sum 145 sel r7, r6, lr ; select bytes with positive difference [all …]
|
D | variance_halfpixvar16x16_hv_media.asm | 61 sel r7, r6, lr ; select bytes with positive difference 67 usad8 r4, r7, lr ; calculate sum of positive differences 71 adds r8, r8, r4 ; add positive differences to sum 103 sel r7, r6, lr ; select bytes with positive difference 108 usad8 r4, r7, lr ; calculate sum of positive differences 113 add r8, r8, r4 ; add positive differences to sum 145 sel r7, r6, lr ; select bytes with positive difference 150 usad8 r4, r7, lr ; calculate sum of positive differences 155 add r8, r8, r4 ; add positive differences to sum 186 sel r7, r6, lr ; select bytes with positive difference [all …]
|
/external/guava/guava-tests/benchmark/com/google/common/math/ |
D | BigIntegerMathRoundingBenchmark.java | 40 private static final BigInteger[] positive = new BigInteger[ARRAY_SIZE]; field in BigIntegerMathRoundingBenchmark 48 positive[i] = randomPositiveBigInteger(1024); in setUp() 58 tmp += BigIntegerMath.log2(positive[j], mode); in log2() 67 tmp += BigIntegerMath.log10(positive[j], mode); in log10() 76 tmp += BigIntegerMath.sqrt(positive[j], mode).intValue(); in sqrt()
|
D | IntMathRoundingBenchmark.java | 38 private static final int[] positive = new int[ARRAY_SIZE]; field in IntMathRoundingBenchmark 45 positive[i] = randomPositiveBigInteger(Integer.SIZE - 2).intValue(); in setUp() 58 tmp += IntMath.log2(positive[j], mode); in log2() 67 tmp += IntMath.log10(positive[j], mode); in log10() 76 tmp += IntMath.sqrt(positive[j], mode); in sqrt()
|
D | LongMathRoundingBenchmark.java | 41 private static final long[] positive = new long[ARRAY_SIZE]; field in LongMathRoundingBenchmark 48 positive[i] = randomPositiveBigInteger(Long.SIZE - 2).longValue(); in setUp() 58 tmp += LongMath.log2(positive[j], mode); in log2() 67 tmp += LongMath.log10(positive[j], mode); in log10() 76 tmp += LongMath.sqrt(positive[j], mode); in sqrt()
|
D | IntMathBenchmark.java | 39 private static final int[] positive = new int[ARRAY_SIZE]; field in IntMathBenchmark 49 positive[i] = randomPositiveBigInteger(Integer.SIZE - 1).intValue(); in setUp() 59 tmp += IntMath.pow(positive[j], exponent[j]); in pow() 68 tmp += IntMath.mod(ints[j], positive[j]); in mod() 77 tmp += IntMath.gcd(nonnegative[j], positive[j]); in gCD()
|
D | LongMathBenchmark.java | 39 private static final long[] positive = new long[ARRAY_SIZE]; field in LongMathBenchmark 47 positive[i] = randomPositiveBigInteger(Long.SIZE - 1).longValue(); in setUp() 62 tmp += LongMath.pow(positive[j], exponents[j]); in pow() 71 tmp += LongMath.mod(longs[j], positive[j]); in mod() 80 tmp += LongMath.mod(nonnegative[j], positive[j]); in gCD()
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
D | AbstractECMultiplier.java | 15 ECPoint positive = multiplyPositive(p, k.abs()); in multiply() local 16 ECPoint result = sign > 0 ? positive : positive.negate(); in multiply()
|
/external/llvm/test/Verifier/ |
D | fpmath.ll | 17 ; CHECK: fpmath accuracy not a positive number! 19 ; CHECK: fpmath accuracy not a positive number! 21 ; CHECK: fpmath accuracy not a positive number!
|
/external/valgrind/ |
D | exp-sgcheck.supp | 8 # I'm pretty sure this is a false positive caused by the sg_ stuff 10 glibc realpath false positive
|
/external/llvm/test/CodeGen/SystemZ/ |
D | and-06.ll | 32 ; Zero extension to 32 bits, positive constant. 45 ; Zero extension to 64 bits, positive constant. 84 ; Sign extension to 32 bits, positive constant. 97 ; Sign extension to 64 bits, positive constant.
|
D | xor-06.ll | 32 ; Zero extension to 32 bits, positive constant. 45 ; Zero extension to 64 bits, positive constant. 84 ; Sign extension to 32 bits, positive constant. 97 ; Sign extension to 64 bits, positive constant.
|
D | or-06.ll | 32 ; Zero extension to 32 bits, positive constant. 45 ; Zero extension to 64 bits, positive constant. 84 ; Sign extension to 32 bits, positive constant. 97 ; Sign extension to 64 bits, positive constant.
|
/external/llvm/test/Transforms/InstSimplify/ |
D | 2011-11-23-MaskedBitsCrash.ll | 4 ; into a positive one) and thus results in undefined behaviour. At 8 ; as being both positive and negative, firing an assertion!
|
/external/eigen/Eigen/src/Eigen2Support/ |
D | SVD.h | 72 void computeUnitaryPositive(UnitaryType *unitary, PositiveType *positive) const; 74 void computePositiveUnitary(PositiveType *positive, UnitaryType *unitary) const; 76 void computeRotationScaling(RotationType *unitary, ScalingType *positive) const; 78 void computeScalingRotation(ScalingType *positive, RotationType *unitary) const; 547 PositiveType *positive) const in computeUnitaryPositive() argument 551 if(positive) *positive = m_matV * m_sigma.asDiagonal() * m_matV.adjoint(); in computeUnitaryPositive() 564 void SVD<MatrixType>::computePositiveUnitary(UnitaryType *positive, in computePositiveUnitary() argument 569 if(positive) *positive = m_matU * m_sigma.asDiagonal() * m_matU.adjoint(); in computePositiveUnitary()
|
/external/clang/test/Analysis/ |
D | unions-region.m | 11 // false positive of a 'pass-by-value argument is uninitialized' 34 // false positive of a 'pass-by-value argument is uninitialized'
|
/external/sonivox/arm-wt-22k/lib_src/ |
D | ARM-E_mastergain_gnu.s | 79 CMP r4, r6 @check for positive saturation 88 CMP r5, r6 @check for positive saturation
|
/external/valgrind/docs/internals/ |
D | 3_9_BUGSTATUS.txt | 61 337716 False positive for openat system call with absolute paths 83 330617 ppc false positive conditional jump depends on uninitialised value 99 327548 Helgrind: false positive while destroying mutex 107 332591 False positive: invalid read in vfprintf (KNOWN BUG)
|