Searched refs:c1 (Results 251 - 275 of 972) sorted by relevance

<<11121314151617181920>>

/external/clang/test/Sema/
H A Dattr-deprecated-message.c21 Color c1; // expected-warning {{'Color' is deprecated: Please avoid Color}} variable
/external/clang/test/SemaCXX/
H A Ddefault-constructor-initializers.cpp47 // expected-error {{must explicitly initialize the const member 'c1'}}
49 const int c1; // expected-note {{declared here}} member in struct:Z1
/external/libcxx/test/containers/sequences/vector/vector.modifiers/
H A Dinsert_iter_size_value.pass.cpp53 std::vector<int> c1(100);
55 std::vector<int>::iterator i = c1.insert(c2.cbegin() + 10, 5, 1);
88 std::vector<int, min_allocator<int>> c1(100);
90 std::vector<int, min_allocator<int>>::iterator i = c1.insert(c2.cbegin() + 10, 5, 1);
/external/libcxxabi/test/
H A Dcatch_ptr.cpp116 catch (const C1* c1)
155 catch (const C1* c1) // can catch C1
157 assert(c1->id_ == 4);
158 assert(static_cast<const B*>(c1)->id_ == 8);
/external/libvpx/libvpx/vp8/common/x86/
H A Diwalsh_sse2.asm34 psubw xmm3, xmm2 ;ip[4]-ip[8] ip[0]-ip[12] aka c1 d1
38 punpckhqdq xmm4, xmm3 ;c1 b1
40 movdqa xmm1, xmm4 ;c1 b1
42 psubw xmm0, xmm1 ;d1-c1 a1-b1 aka op[12] op[8]
63 psubw xmm3, xmm2 ;ip[4]-ip[8] ip[0]-ip[12] aka c1 d1
67 punpckhqdq xmm5, xmm3 ;c1 b1
69 movdqa xmm1, xmm5 ;c1 b1
71 psubw xmm4, xmm1 ;d1-c1 a1-b1 aka op[12] op[8]
/external/lldb/test/functionalities/data-formatter/data-formatter-categories/
H A Dmain.cpp37 Circle c1(5);
/external/mesa3d/src/glsl/
H A Dir_constant_expression.cpp475 for (unsigned c = 0, c0 = 0, c1 = 0;
477 c0 += c0_inc, c1 += c1_inc, c++) {
481 data.u[c] = MIN2(op[0]->value.u[c0], op[1]->value.u[c1]);
484 data.i[c] = MIN2(op[0]->value.i[c0], op[1]->value.i[c1]);
487 data.f[c] = MIN2(op[0]->value.f[c0], op[1]->value.f[c1]);
497 for (unsigned c = 0, c0 = 0, c1 = 0;
499 c0 += c0_inc, c1 += c1_inc, c++) {
503 data.u[c] = MAX2(op[0]->value.u[c0], op[1]->value.u[c1]);
506 data.i[c] = MAX2(op[0]->value.i[c0], op[1]->value.i[c1]);
509 data.f[c] = MAX2(op[0]->value.f[c0], op[1]->value.f[c1]);
[all...]
/external/chromium_org/chrome/common/extensions/docs/examples/api/cookies/
H A Dmanager.js24 function cookieMatch(c1, c2) {
25 return (c1.name == c2.name) && (c1.domain == c2.domain) &&
26 (c1.hostOnly == c2.hostOnly) && (c1.path == c2.path) &&
27 (c1.secure == c2.secure) && (c1.httpOnly == c2.httpOnly) &&
28 (c1.session == c2.session) && (c1.storeId == c2.storeId);
/external/doclava/res/assets/templates/assets/
H A Dsearch_autocomplete.js11 var c1 = row.cells[0];
14 c1.className = "jd-autocomplete jd-selected";
17 c1.className = "jd-autocomplete";
48 var c1 = r.insertCell(-1);
50 c1.className = "jd-autocomplete";
53 c1.onmousedown = function() {
56 c1.onmouseover = function() {
59 c1.onmouseout = function() {
62 c1.appendChild(link);
65 var c1
[all...]
/external/icu/icu4c/source/common/
H A Dustrcase.cpp493 UChar32 c1, c2, cp1, cp2; local
522 c1=c2=-1;
531 if(c1<0) {
534 if(s1==limit1 || ((c1=*s1)==0 && (limit1==NULL || (options&_STRNCMP_STYLE)))) {
536 c1=-1;
578 * compare c1 and c2
579 * either variable c1, c2 is -1 only if the corresponding string is finished
581 if(c1==c2) {
582 if(c1<0) {
583 return 0; /* c1
[all...]
H A Duinvchar.c453 UChar32 c1, c2; local
472 c1=c;
474 c1=-1;
482 if((c1-=c2)!=0) {
483 return c1;
498 UChar32 c1, c2; local
517 c1=0;
518 } else if((c1=asciiFromEbcdic[c])!=0 && UCHAR_IS_INVARIANT(c1)) {
519 /* c1 i
542 int32_t c1, c2; local
[all...]
H A Dustring.cpp671 UChar c1, c2; local
674 c1=*s1++;
676 if (c1 != c2 || c1 == 0) {
680 return (int32_t)c1 - (int32_t)c2;
688 UChar c1, c2; local
702 c1=*s1;
704 if(c1!=c2) {
707 if(c1==0) {
730 c1
827 UChar32 c1, c2; local
[all...]
/external/chromium_org/third_party/skia/src/pathops/
H A DSkDCubicIntersection.cpp79 SkDCubic c1 = cubic1.subDivide(t1s, t1e); local
82 // OPTIMIZE: if c1 == c2, call once (happens when detecting self-intersection)
83 c1.toQuadraticTs(c1.calcPrecision() * precisionScale, &ts1);
257 bool SkIntersections::cubicCheckCoincidence(const SkDCubic& c1, const SkDCubic& c2) {
267 SkDPoint testPt1 = c1.ptAtT(testT1);
432 static bool only_end_pts_in_common(const SkDCubic& c1, const SkDCubic& c2) {
441 endPt[opp - 1] = &c1[end];
455 double sign = (c1[oddMan].fY - origY) * adj - (c1[oddMa
[all...]
/external/skia/src/pathops/
H A DSkDCubicIntersection.cpp79 SkDCubic c1 = cubic1.subDivide(t1s, t1e); local
82 // OPTIMIZE: if c1 == c2, call once (happens when detecting self-intersection)
83 c1.toQuadraticTs(c1.calcPrecision() * precisionScale, &ts1);
257 bool SkIntersections::cubicCheckCoincidence(const SkDCubic& c1, const SkDCubic& c2) {
267 SkDPoint testPt1 = c1.ptAtT(testT1);
432 static bool only_end_pts_in_common(const SkDCubic& c1, const SkDCubic& c2) {
441 endPt[opp - 1] = &c1[end];
455 double sign = (c1[oddMan].fY - origY) * adj - (c1[oddMa
[all...]
/external/chromium_org/third_party/icu/source/common/
H A Duinvchar.c430 UChar32 c1, c2; local
449 c1=c;
451 c1=-1;
459 if((c1-=c2)!=0) {
460 return c1;
475 UChar32 c1, c2; local
494 c1=0;
495 } else if((c1=asciiFromEbcdic[c])!=0 && UCHAR_IS_INVARIANT(c1)) {
496 /* c1 i
519 int32_t c1, c2; local
[all...]
H A Dustring.c670 UChar c1, c2; local
673 c1=*s1++;
675 if (c1 != c2 || c1 == 0) {
679 return (int32_t)c1 - (int32_t)c2;
687 UChar c1, c2; local
701 c1=*s1;
703 if(c1!=c2) {
706 if(c1==0) {
729 c1
826 UChar32 c1, c2; local
[all...]
H A Dcstring.c234 unsigned char c1, c2; local
237 c1=(unsigned char)*str1;
239 if(c1==0) {
249 rc=(int)(unsigned char)uprv_tolower(c1)-(int)(unsigned char)uprv_tolower(c2);
273 unsigned char c1, c2; local
276 c1=(unsigned char)*str1;
278 if(c1==0) {
288 rc=(int)(unsigned char)uprv_tolower(c1)-(int)(unsigned char)uprv_tolower(c2);
/external/chromium_org/third_party/openssl/openssl/crypto/bn/
H A Dbn_mul.c396 int n=n2/2,c1,c2; local
431 c1=bn_cmp_part_words(a,&(a[n]),tna,n-tna);
434 switch (c1*3+c2)
503 /* t[32] holds (a[0]-a[1])*(b[1]-b[0]), c1 is the sign
508 c1=(int)(bn_add_words(t,r,&(r[n2]),n2));
512 c1-=(int)(bn_sub_words(&(t[n2]),t,&(t[n2]),n2));
517 c1+=(int)(bn_add_words(&(t[n2]),&(t[n2]),t,n2));
523 * c1 holds the carry bits
525 c1+=(int)(bn_add_words(&(r[n]),&(r[n]),&(t[n2]),n2));
526 if (c1)
554 int c1,c2,neg; local
761 int c1,c2; local
[all...]
/external/openssl/crypto/bn/
H A Dbn_mul.c396 int n=n2/2,c1,c2; local
431 c1=bn_cmp_part_words(a,&(a[n]),tna,n-tna);
434 switch (c1*3+c2)
503 /* t[32] holds (a[0]-a[1])*(b[1]-b[0]), c1 is the sign
508 c1=(int)(bn_add_words(t,r,&(r[n2]),n2));
512 c1-=(int)(bn_sub_words(&(t[n2]),t,&(t[n2]),n2));
517 c1+=(int)(bn_add_words(&(t[n2]),&(t[n2]),t,n2));
523 * c1 holds the carry bits
525 c1+=(int)(bn_add_words(&(r[n]),&(r[n]),&(t[n2]),n2));
526 if (c1)
554 int c1,c2,neg; local
761 int c1,c2; local
[all...]
/external/eigen/test/
H A Dredux.cpp50 Index c1 = internal::random<Index>(c0+1,cols)-c0; local
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());
55 VERIFY_IS_APPROX(m1.block(r0,c0,r1,c1)
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/
H A Dssim.c81 int64_t c1, c2; local
84 c1 = (cc1*count*count)>>12;
87 ssim_n = (2*sum_s*sum_r+ c1)*((int64_t) 2*count*sum_sxr-
90 ssim_d = (sum_s*sum_s +sum_r*sum_r+c1)*
119 int64_t c1, c2; local
122 c1 = cc1*16;
126 ssim_n1 = (2*sum_s*sum_r+ c1);
130 ssim_d1 =((int64_t)sum_s*sum_s +(int64_t)sum_r*sum_r+c1);
/external/chromium_org/third_party/opus/src/src/
H A Danalysis.h82 const CELTMode *celt_mode, const void *x, int len, int offset, int c1, int c2, int C, int lsb_depth, downmix_func downmix);
87 int analysis_frame_size, int frame_size, int c1, int c2, int C, opus_int32 Fs,
/external/chromium_org/third_party/skia/tests/
H A DColorTest.cpp25 SkColor c1 = SkUnPreMultiply::PMColorToColor(p0); local
26 SkPMColor p1 = SkPreMultiplyColor(c1);
28 // we can't promise that c0 == c1, since c0 -> p0 is a many to one
29 // function, however, we can promise that p0 -> c1 -> p1 : p0 == p1
/external/chromium_org/ui/views/layout/
H A Dgrid_layout_unittest.cc85 ColumnSet* c1 = layout.AddColumnSet(0); local
86 c1->AddColumn(alignment, alignment, 1, GridLayout::USE_PREF, 0, 0);
129 ColumnSet* c1 = layout.AddColumnSet(0); local
130 c1->AddColumn(GridLayout::LEADING, GridLayout::LEADING,
132 c1->AddColumn(GridLayout::LEADING, GridLayout::LEADING,
152 ColumnSet* c1 = layout.AddColumnSet(0); local
153 c1->AddColumn(GridLayout::LEADING, GridLayout::LEADING,
155 c1->AddColumn(GridLayout::LEADING, GridLayout::LEADING,
176 ColumnSet* c1 = layout.AddColumnSet(0); local
177 c1
202 ColumnSet* c1 = layout.AddColumnSet(0); local
288 ColumnSet* c1 = layout.AddColumnSet(0); local
312 ColumnSet* c1 = layout.AddColumnSet(0); local
332 ColumnSet* c1 = layout.AddColumnSet(0); local
355 ColumnSet* c1 = layout.AddColumnSet(0); local
379 ColumnSet* c1 = layout.AddColumnSet(0); local
400 ColumnSet* c1 = layout.AddColumnSet(0); local
[all...]
/external/chromium_org/v8/test/mjsunit/
H A Dregexp-global.js55 function(match, c1, c2, c3) {
56 assertTrue((c1 === undefined && c2 === undefined) ||
58 (c1 === undefined && c3 === undefined));
59 if (c1) return "-";
107 function(match, c1, c2, c3) {
108 assertTrue((c1 === undefined && c2 === undefined) ||
110 (c1 === undefined && c3 === undefined));
111 if (c1) return "-";

Completed in 828 milliseconds

<<11121314151617181920>>