| /external/libutf/ |
| runestrchr.c | 23 Rune c0 = c; local
33 if(c1 == c0)
|
| runestrstr.c | 28 int c0, c; local
30 c0 = *s2;
31 if(c0 == 0)
34 for(p=runestrchr(s1, c0); p; p=runestrchr(p+1, c0)) {
|
| /external/v8/test/mjsunit/ |
| debug-stepframe.js | 58 var v21 = new c0();
65 function c0() { class
|
| /art/runtime/ |
| dex_instruction_visitor_test.cc | 44 const uint16_t c0[] = {}; local
45 v0.Visit(c0, sizeof(c0));
|
| /external/eigen/Eigen/src/Householder/ |
| Householder.h | 77 Scalar c0 = coeff(0); local
79 if(tailSqNorm == RealScalar(0) && numext::imag(c0)==RealScalar(0))
82 beta = numext::real(c0);
87 beta = sqrt(numext::abs2(c0) + tailSqNorm);
88 if (numext::real(c0)>=RealScalar(0))
90 essential = tail / (c0 - beta);
91 tau = conj((beta - c0) / beta);
|
| /external/skia/samplecode/ |
| Sample2PtRadial.cpp | 32 SkPoint c0 = { 0, 0 }; local
36 SkShader* s = SkGradientShader::CreateTwoPointConical(c0, r0, c1, r1, colors,
|
| SampleAAClip.cpp | 17 SkAAClip c0, c1, c2; local
18 c0.setRect(r0);
20 c2.op(c0, c1, op);
|
| SampleDegenerateTwoPtRadials.cpp | 26 SkPoint c0 = { l + 2 * w / 5 + delta, t + h / 2 }; local
30 SkShader* s = SkGradientShader::CreateTwoPointConical(c0, r0, c1, r1, colors,
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/ |
| omxVCM4P10_TransformDequantLumaDCFromPair.c | 87 int c0 = pData[i+0]; local
91 pData[i+0] = (OMX_S16)(c0+c1+c2+c3);
92 pData[i+1] = (OMX_S16)(c0+c1-c2-c3);
93 pData[i+2] = (OMX_S16)(c0-c1-c2+c3);
94 pData[i+3] = (OMX_S16)(c0-c1+c2-c3);
100 int c0 = pData[i+0]; local
104 pData[i+0] = (OMX_S16)(c0+c1+c2+c3);
105 pData[i+4] = (OMX_S16)(c0+c1-c2-c3);
106 pData[i+8] = (OMX_S16)(c0-c1-c2+c3);
107 pData[i+12] = (OMX_S16)(c0-c1+c2-c3)
[all...] |
| /frameworks/minikin/libs/minikin/ |
| GraphemeBreak.cpp | 155 uint32_t c0 = 0; local
156 U16_PREV(buf, start, offset_back, c0);
157 if (c0 == 0xFE0F && offset_back > start) {
159 U16_PREV(buf, start, offset_back, c0);
161 if (isEmoji(c0)) {
|
| /external/apache-harmony/security/src/test/api/java/tests/api/java/security/ |
| DomainCombinerTest.java | 74 AccessControlContext c0 = new AccessControlContext(parent, local
|
| /external/clang/test/CXX/expr/ |
| p9.cpp | 17 signed char c0; variable
18 __typeof__(c0 + c0) c1;
|
| /external/clang/test/CodeGenCXX/ |
| armv7k.cpp | 60 const std::type_info &c0 = typeid(C); member in namespace:test2
|
| arm64.cpp | 61 const std::type_info &c0 = typeid(C); member in namespace:test2
|
| /external/eigen/test/ |
| redux.cpp | 48 Index c0 = internal::random<Index>(0,cols-1); local
50 Index c1 = internal::random<Index>(c0+1,cols)-c0;
51 VERIFY_IS_APPROX(m1.block(r0,c0,r1,c1).sum(), m1.block(r0,c0,r1,c1).eval().sum());
52 VERIFY_IS_APPROX(m1.block(r0,c0,r1,c1).mean(), m1.block(r0,c0,r1,c1).eval().mean());
53 VERIFY_IS_APPROX(m1_for_prod.block(r0,c0,r1,c1).prod(), m1_for_prod.block(r0,c0,r1,c1).eval().prod());
54 VERIFY_IS_APPROX(m1.block(r0,c0,r1,c1).real().minCoeff(), m1.block(r0,c0,r1,c1).real().eval().minCoeff())
[all...] |
| product_notemporary.cpp | 55 Index c0 = internal::random<Index>(4,cols-8), local
56 c1 = internal::random<Index>(8,cols-c0),
71 VERIFY_EVALUATION_COUNT(( m3.block(r0,r0,r1,r1).noalias() += -m1.block(r0,c0,r1,c1) * (s2*m2.block(r0,c0,r1,c1)).adjoint() ), 0);
72 VERIFY_EVALUATION_COUNT(( m3.block(r0,r0,r1,r1).noalias() -= s1 * m1.block(r0,c0,r1,c1) * m2.block(c0,r0,c1,r1) ), 0);
75 VERIFY_EVALUATION_COUNT(( m3.block(r0,r0,r1,r1).noalias() = s1 * m1.block(r0,c0,r1,c1) * (s1*m2).block(c0,r0,c1,r1) ), 1);
85 VERIFY_EVALUATION_COUNT( rm3.col(c0).noalias() = (s1 * m1.adjoint()).template triangularView<UnitUpper>() * (s2*m2.row(c0)).adjoint(), 1)
[all...] |
| /external/javassist/src/main/javassist/convert/ |
| TransformWriteField.java | 41 char c0 = typedesc.charAt(0); local
42 if (c0 == 'J' || c0 == 'D') { // long or double
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/common/ |
| Sweep.java | 39 public final Vec2 c0, c; field in class:Sweep
43 /** Fraction of the current time step in the range [0,1] c0 and a0 are the positions at alpha0. */
48 s += "c0: " + c0 + ", c: " + c + "\n";
56 c0 = new Vec2();
68 c0.set(other.c0);
84 // xf->p = (1.0f - beta) * c0 + beta * c;
87 xf.p.x = (1.0f - beta) * c0.x + beta * c.x;
88 xf.p.y = (1.0f - beta) * c0.y + beta * c.y
[all...] |
| /external/skia/tests/ |
| ColorTest.cpp | 22 SkColor c0 = SkColorSetARGB(a, x, x, x); local
23 SkPMColor p0 = SkPreMultiplyColor(c0);
28 // we can't promise that c0 == c1, since c0 -> p0 is a many to one
|
| /external/tcpdump/ |
| checksum.c | 146 uint32_t c0; local
151 c0 = 0;
160 c1 += c0;
163 c0 = c0 + *(pptr++);
164 c1 += c0;
168 c0 = c0 % 255;
171 mul = (length - checksum_offset)*(c0);
173 x = mul - c0 - c1
[all...] |
| /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/utils/ |
| damerau_levenshtein_edit_distance_policy.h | 34 const int c0 = CharUtils::toBaseLowerCase(mString0[index0]); local
36 return (c0 == c1) ? 0.0f : 1.0f;
48 const int c0 = CharUtils::toBaseLowerCase(mString0[index0]); local
50 if (index0 > 0 && index1 > 0 && c0 == CharUtils::toBaseLowerCase(mString1[index1 - 1])
|
| /external/clang/test/Layout/ |
| ms-x86-empty-nonvirtual-bases.cpp | 14 struct C0 { int a; C0() : a(0xf00000C0) {printf("C0 : %p\n", this);} };
69 C0 c0; member in struct:D
83 // CHECK: 8 | struct C0 c0
94 struct E : B0, C0, C1, C2, B1 {
102 // CHECK-NEXT: 0 | struct C0 (base)
113 struct F : C0, B0, B1, C1
[all...] |
| /external/libvpx/libvpx/test/ |
| active_map_refresh_test.cc | 24 int c0 = 16 * mb_c; local
26 int c_top = std::min(c0 + 16, static_cast<int>(current.d_w));
28 c0 = std::max(c0, 0);
31 c0 >>= 1;
38 for (int c = c0; c < c_top; ++c) {
|
| /external/opencv3/modules/features2d/src/ |
| fast_score.cpp | 91 int c0 = 0, c1 = 0; local
98 if( ++c0 > K )
106 c0 = 0;
110 c0 = c1 = 0;
113 CV_Assert( (delta == 0 && std::max(c0, c1) > K) ||
114 (delta == 1 && std::max(c0, c1) <= K) );
|
| /external/pdfium/third_party/lcms2-2.6/src/ |
| cmsmtrx.c | 131 cmsFloat64Number det, c0, c1, c2; local
133 c0 = a -> v[1].n[1]*a -> v[2].n[2] - a -> v[1].n[2]*a -> v[2].n[1];
137 det = a -> v[0].n[0]*c0 + a -> v[0].n[1]*c1 + a -> v[0].n[2]*c2;
141 b -> v[0].n[0] = c0/det;
|
