/external/openssl/crypto/bn/asm/x86/ |
D | comba.pl | 6 local($a,$ai,$b,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_; 18 &add($c0,"eax"); 28 &mov(&DWP($i*4,"eax","",0),$c0) if $pos > 0; # save r[]; 34 local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_; 49 &add($c0,"eax"); 57 &mov(&DWP($i*4,$r,"",0),$c0) if $pos > 0; # save r[]; 63 local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_; 83 &add($c0,"eax"); 88 &mov(&DWP($i*4,$r,"",0),$c0) if $pos > 0; # save r[]; 96 local($a,$b,$c0,$c1,$c2); [all …]
|
/external/openssl/crypto/bn/asm/ |
D | co-586.pl | 18 local($a,$ai,$b,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_; 30 &add($c0,"eax"); 40 &mov(&DWP($i*4,"eax","",0),$c0) if $pos > 0; # save r[]; 46 local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_; 61 &add($c0,"eax"); 69 &mov(&DWP($i*4,$r,"",0),$c0) if $pos > 0; # save r[]; 75 local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_; 95 &add($c0,"eax"); 100 &mov(&DWP($i*4,$r,"",0),$c0) if $pos > 0; # save r[]; 108 local($a,$b,$c0,$c1,$c2); [all …]
|
/external/openssl/crypto/bn/ |
D | bn_asm.c | 442 #define mul_add_c(a,b,c0,c1,c2) \ argument 446 c0=(c0+t1)&BN_MASK2; if ((c0) < t1) t2++; \ 449 #define mul_add_c2(a,b,c0,c1,c2) \ argument 455 c0=(c0+t1)&BN_MASK2; \ 456 if ((c0 < t1) && (((++t2)&BN_MASK2) == 0)) c2++; \ 459 #define sqr_add_c(a,i,c0,c1,c2) \ argument 463 c0=(c0+t1)&BN_MASK2; if ((c0) < t1) t2++; \ 466 #define sqr_add_c2(a,i,j,c0,c1,c2) \ argument 467 mul_add_c2((a)[i],(a)[j],c0,c1,c2) 471 #define mul_add_c(a,b,c0,c1,c2) { \ argument [all …]
|
/external/eigen/test/ |
D | product_notemporary.cpp | 55 Index c0 = internal::random<Index>(4,cols-8), in product_notemporary() local 56 c1 = internal::random<Index>(8,cols-c0), in product_notemporary() 71 …TION_COUNT(( m3.block(r0,r0,r1,r1).noalias() += -m1.block(r0,c0,r1,c1) * (s2*m2.block(r0,c0,r1,c1)… in product_notemporary() 72 …TION_COUNT(( m3.block(r0,r0,r1,r1).noalias() -= s1 * m1.block(r0,c0,r1,c1) * m2.block(c0,r0,c1,r1)… in product_notemporary() 75 …ON_COUNT(( m3.block(r0,r0,r1,r1).noalias() = s1 * m1.block(r0,c0,r1,c1) * (s1*m2).block(c0,r0,c1,r… in product_notemporary() 82 …ERIFY_EVALUATION_COUNT( rm3.col(c0).noalias() = (s1 * m1.adjoint()).template triangularView<UnitUp… in product_notemporary() 92 …VERIFY_EVALUATION_COUNT( m3.col(c0).noalias() = (s1 * m1).adjoint().template selfadjointView<Lower… in product_notemporary() 93 …VERIFY_EVALUATION_COUNT( m3.col(c0).noalias() -= (s1 * m1).adjoint().template selfadjointView<Uppe… in product_notemporary() 95 …LUATION_COUNT( m3.block(r0,c0,r1,c1).noalias() += m1.block(r0,r0,r1,r1).template selfadjointView<U… in product_notemporary() 96 …VALUATION_COUNT( m3.block(r0,c0,r1,c1).noalias() = m1.block(r0,r0,r1,r1).template selfadjointView<… in product_notemporary() [all …]
|
D | redux.cpp | 48 Index c0 = internal::random<Index>(0,cols-1); in matrixRedux() local 50 Index c1 = internal::random<Index>(c0+1,cols)-c0; in matrixRedux() 51 VERIFY_IS_APPROX(m1.block(r0,c0,r1,c1).sum(), m1.block(r0,c0,r1,c1).eval().sum()); in matrixRedux() 52 VERIFY_IS_APPROX(m1.block(r0,c0,r1,c1).mean(), m1.block(r0,c0,r1,c1).eval().mean()); in matrixRedux() 53 …VERIFY_IS_APPROX(m1_for_prod.block(r0,c0,r1,c1).prod(), m1_for_prod.block(r0,c0,r1,c1).eval().prod… in matrixRedux() 54 …VERIFY_IS_APPROX(m1.block(r0,c0,r1,c1).real().minCoeff(), m1.block(r0,c0,r1,c1).real().eval().minC… in matrixRedux() 55 …VERIFY_IS_APPROX(m1.block(r0,c0,r1,c1).real().maxCoeff(), m1.block(r0,c0,r1,c1).real().eval().maxC… in matrixRedux() 58 VERIFY_IS_APPROX(m1.block(r0,c0,0,0).sum(), Scalar(0)); in matrixRedux() 59 VERIFY_IS_APPROX(m1.block(r0,c0,0,0).prod(), Scalar(1)); in matrixRedux()
|
/external/jpeg/ |
D | jquant2.c | 320 int c0,c1,c2; in update_box() local 330 for (c0 = c0min; c0 <= c0max; c0++) in update_box() 332 histp = & histogram[c0][c1][c2min]; in update_box() 335 boxp->c0min = c0min = c0; in update_box() 341 for (c0 = c0max; c0 >= c0min; c0--) in update_box() 343 histp = & histogram[c0][c1][c2min]; in update_box() 346 boxp->c0max = c0max = c0; in update_box() 353 for (c0 = c0min; c0 <= c0max; c0++) { in update_box() 354 histp = & histogram[c0][c1][c2min]; in update_box() 364 for (c0 = c0min; c0 <= c0max; c0++) { in update_box() [all …]
|
/external/qemu/distrib/jpeg-6b/ |
D | jquant2.c | 320 int c0,c1,c2; in update_box() local 330 for (c0 = c0min; c0 <= c0max; c0++) in update_box() 332 histp = & histogram[c0][c1][c2min]; in update_box() 335 boxp->c0min = c0min = c0; in update_box() 341 for (c0 = c0max; c0 >= c0min; c0--) in update_box() 343 histp = & histogram[c0][c1][c2min]; in update_box() 346 boxp->c0max = c0max = c0; in update_box() 353 for (c0 = c0min; c0 <= c0max; c0++) { in update_box() 354 histp = & histogram[c0][c1][c2min]; in update_box() 364 for (c0 = c0min; c0 <= c0max; c0++) { in update_box() [all …]
|
/external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
D | InsnFormat.java | 591 protected static void write(AnnotatedOutput out, short c0) { in write() argument 592 out.writeShort(c0); in write() 602 protected static void write(AnnotatedOutput out, short c0, short c1) { in write() argument 603 out.writeShort(c0); in write() 615 protected static void write(AnnotatedOutput out, short c0, short c1, in write() argument 617 out.writeShort(c0); in write() 631 protected static void write(AnnotatedOutput out, short c0, short c1, in write() argument 633 out.writeShort(c0); in write() 649 protected static void write(AnnotatedOutput out, short c0, short c1, in write() argument 651 out.writeShort(c0); in write() [all …]
|
/external/skia/tools/ |
D | skdiff.cpp | 143 static inline bool colors_match_thresholded(SkPMColor c0, SkPMColor c1, const int threshold) { in colors_match_thresholded() argument 144 int da = SkGetPackedA32(c0) - SkGetPackedA32(c1); in colors_match_thresholded() 145 int dr = SkGetPackedR32(c0) - SkGetPackedR32(c1); in colors_match_thresholded() 146 int dg = SkGetPackedG32(c0) - SkGetPackedG32(c1); in colors_match_thresholded() 147 int db = SkGetPackedB32(c0) - SkGetPackedB32(c1); in colors_match_thresholded() 179 SkPMColor c0 = *dr->fBase.fBitmap.getAddr32(x, y); in compute_diff() local 181 SkPMColor outputDifference = diffFunction(c0, c1); in compute_diff() 182 uint32_t thisA = SkAbs32(SkGetPackedA32(c0) - SkGetPackedA32(c1)); in compute_diff() 183 uint32_t thisR = SkAbs32(SkGetPackedR32(c0) - SkGetPackedR32(c1)); in compute_diff() 184 uint32_t thisG = SkAbs32(SkGetPackedG32(c0) - SkGetPackedG32(c1)); in compute_diff() [all …]
|
/external/valgrind/main/none/tests/amd64/ |
D | crc32.c | 119 UInt c0 = 0xFFFFFFFF; in try_simple() local 122 UInt cs = do_s_crc32b(c0, c); in try_simple() 123 UInt ch = do_h_crc32b(c0, c); in try_simple() 127 cs = do_s_crc32w(c0, w); in try_simple() 128 ch = do_h_crc32w(c0, w); in try_simple() 132 cs = do_s_crc32l(c0, i); in try_simple() 133 ch = do_h_crc32l(c0, i); in try_simple() 137 cs = do_s_crc32q(c0, q); in try_simple() 138 ch = do_h_crc32q(c0, q); in try_simple()
|
/external/eigen/Eigen/src/Householder/ |
D | Householder.h | 74 Scalar c0 = coeff(0); in makeHouseholder() local 76 if(tailSqNorm == RealScalar(0) && internal::imag(c0)==RealScalar(0)) in makeHouseholder() 79 beta = internal::real(c0); in makeHouseholder() 84 beta = internal::sqrt(internal::abs2(c0) + tailSqNorm); in makeHouseholder() 85 if (internal::real(c0)>=RealScalar(0)) in makeHouseholder() 87 essential = tail / (c0 - beta); in makeHouseholder() 88 tau = internal::conj((beta - c0) / beta); in makeHouseholder()
|
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
D | TestTrees.java | 82 CommonTree c0, c1, c2; in testList() local 83 r0.addChild(c0=new CommonTree(new CommonToken(101))); in testList() 89 assertEquals(r0, c0.parent); in testList() 90 assertEquals(0, c0.childIndex); in testList() 104 CommonTree c0, c1, c2; in testList2() local 105 r0.addChild(c0=new CommonTree(new CommonToken(101))); in testList2() 114 assertEquals(root, c0.parent); in testList2() 115 assertEquals(0, c0.childIndex); in testList2() 116 assertEquals(root, c0.parent); in testList2() 118 assertEquals(root, c0.parent); in testList2() [all …]
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime.Tests/ |
D | ITreeFixture.cs | 80 CommonTree c0, c1, c2; in testList() 81 r0.AddChild(c0 = new CommonTree(new CommonToken(101))); in testList() 87 Assert.AreEqual(r0, c0.Parent); in testList() 88 Assert.AreEqual(0, c0.ChildIndex); in testList() 104 CommonTree c0, c1, c2; in testList2() 105 r0.AddChild(c0 = new CommonTree(new CommonToken(101))); in testList2() 114 Assert.AreEqual(root, c0.Parent); in testList2() 115 Assert.AreEqual(0, c0.ChildIndex); in testList2() 116 Assert.AreEqual(root, c0.Parent); in testList2() 118 Assert.AreEqual(root, c0.Parent); in testList2() [all …]
|
/external/skia/gm/ |
D | twopointradial.cpp | 25 SkPoint c0 = { d0[0], d0[1] }; in drawGrad() local 36 SkScalarToFloat(c0.fX), SkScalarToFloat(c0.fY), SkScalarToFloat(r0), in drawGrad() 41 paint.setShader(SkGradientShader::CreateTwoPointConical(c0, r0, c1, r1, in drawGrad() 49 canvas->drawCircle(c0.fX, c0.fY, r0, paint); in drawGrad()
|
/external/clang/test/SemaCXX/ |
D | scope-check.cpp | 68 C c0; in f() local 85 C c0; in f() local 105 C c0; in f() local 215 C c0 = 42; // expected-note {{jump exits scope of variable with non-trivial destructor}} in f() 227 const C c0 = 17; in f() local 230 const C &c2 = c0; in f()
|
/external/sepolicy/ |
D | mls_macros | 5 # declares categores c0 to c(N-1) 40 # levels from s0 to (N-1) with categories c0 to (M-1) 43 level s$1:c0.c$3; 54 define(`mls_systemhigh',`s`'decr(mls_num_sens):c0.c`'decr(mls_num_cats)')
|
/external/valgrind/main/none/tests/s390x/ |
D | cu14.stdout.exp | 53 UTF8: c0 96 UTF8: c0 80 c0 bf c1 80 c0 bf 113 UTF8: c2 c0 431 UTF8: e0 c0 80 e0 bf 80 e0 a0 bf e0 bf bf e0 aa bb 451 UTF8: e1 c0 80 461 UTF8: e2 c0 80 471 UTF8: e3 c0 80 481 UTF8: e4 c0 80 491 UTF8: e5 c0 80 501 UTF8: e6 c0 80 [all …]
|
D | cu12_1.stdout.exp | 53 UTF8: c0 96 UTF8: c0 80 c0 bf c1 80 c0 bf 113 UTF8: c2 c0 431 UTF8: e0 c0 80 e0 bf 80 e0 a0 bf e0 bf bf e0 aa bb 451 UTF8: e1 c0 80 461 UTF8: e2 c0 80 471 UTF8: e3 c0 80 481 UTF8: e4 c0 80 491 UTF8: e5 c0 80 501 UTF8: e6 c0 80 [all …]
|
D | cu12.stdout.exp | 53 UTF8: c0 96 UTF8: c0 80 c0 bf c1 80 c0 bf 113 UTF8: c2 c0 431 UTF8: e0 c0 80 e0 bf 80 e0 a0 bf e0 bf bf e0 aa bb 451 UTF8: e1 c0 80 461 UTF8: e2 c0 80 471 UTF8: e3 c0 80 481 UTF8: e4 c0 80 491 UTF8: e5 c0 80 501 UTF8: e6 c0 80 [all …]
|
D | cu14_1.stdout.exp | 53 UTF8: c0 96 UTF8: c0 80 c0 bf c1 80 c0 bf 113 UTF8: c2 c0 431 UTF8: e0 c0 80 e0 bf 80 e0 a0 bf e0 bf bf e0 aa bb 451 UTF8: e1 c0 80 461 UTF8: e2 c0 80 471 UTF8: e3 c0 80 481 UTF8: e4 c0 80 491 UTF8: e5 c0 80 501 UTF8: e6 c0 80 [all …]
|
/external/llvm/test/Transforms/SimplifyLibCalls/ |
D | 2009-05-30-memcmp-byte.ll | 6 %c0 = alloca i8, align 1 ; <i8*> [#uses=2] 8 store i8 64, i8* %c0 10 %call = call i32 @memcmp(i8* %c0, i8* %c2, i32 1) ; <i32> [#uses=1]
|
/external/v8/test/mjsunit/ |
D | array-literal-transitions.js | 58 var c0 = [1, 2, get(3.5)]; 59 assertTrue(%HasFastDoubleElements(c0)); 60 assertEquals(3.5, c0[2]); 61 assertEquals(2, c0[1]); 62 assertEquals(1, c0[0]);
|
/external/clang/test/CXX/expr/ |
D | p9.cpp | 17 signed char c0; variable 18 __typeof__(c0 + c0) c1;
|
/external/skia/src/core/ |
D | SkQuadClipper.cpp | 36 static bool chopMonoQuadAt(SkScalar c0, SkScalar c1, SkScalar c2, in chopMonoQuadAt() argument 42 SkScalar A = c0 - c1 - c1 + c2; in chopMonoQuadAt() 43 SkScalar B = 2*(c1 - c0); in chopMonoQuadAt() 44 SkScalar C = c0 - target; in chopMonoQuadAt()
|
/external/skia/legacy/src/core/ |
D | SkQuadClipper.cpp | 34 static bool chopMonoQuadAt(SkScalar c0, SkScalar c1, SkScalar c2, in chopMonoQuadAt() argument 40 SkScalar A = c0 - c1 - c1 + c2; in chopMonoQuadAt() 41 SkScalar B = 2*(c1 - c0); in chopMonoQuadAt() 42 SkScalar C = c0 - target; in chopMonoQuadAt()
|