| /external/clang/test/CodeGenCXX/ |
| global-init.cpp | 174 const C c1 = C(); member in namespace:test7
|
| vtable-available-externally.cpp | 152 struct c1 {}; struct in namespace:Test7
153 struct c10 : c1{
156 struct c11 : c10, c1{
|
| /external/clang/test/SemaCXX/ |
| aggregate-initialization.cpp | 70 C c1 = { 1 }; local
|
| /external/clang/test/SemaTemplate/ |
| instantiate-member-class.cpp | 37 X<int>::C *c1; variable
44 c1 = c2; // expected-error{{assigning to 'X<int>::C *' from incompatible type 'X<float>::C *'}}
|
| /external/eigen/bench/ |
| eig33.cpp | 55 // The characteristic equation is x^3 - c2*x^2 + c1*x - c0 = 0. The
59 Scalar c1 = m(0,0)*m(1,1) - m(0,1)*m(0,1) + m(0,0)*m(2,2) - m(0,2)*m(0,2) + m(1,1)*m(2,2) - m(1,2)*m(1,2); local
65 Scalar a_over_3 = (c1 - c2*c2_over_3)*s_inv3;
69 Scalar half_b = Scalar(0.5)*(c0 + c2_over_3*(Scalar(2)*c2_over_3*c2_over_3 - c1));
|
| /external/eigen/test/ |
| block.cpp | 37 Index c1 = internal::random<Index>(0,cols-1); local
38 Index c2 = internal::random<Index>(c1,cols-1);
41 VERIFY_IS_EQUAL(m1.col(c1).transpose(), m1.transpose().row(c1));
50 m1.col(c1) += s1 * m1_copy.col(c2);
51 VERIFY_IS_APPROX(m1.col(c1), m1_copy.col(c1) + s1 * m1_copy.col(c2));
52 m1.col(c1).col(0) += s1 * m1_copy.col(c2);
53 VERIFY_IS_APPROX(m1.col(c1), m1_copy.col(c1) + Scalar(2) * s1 * m1_copy.col(c2))
193 Index c1 = internal::random<Index>(0,cols-1); local
[all...] |
| sparse_product.cpp | 17 int c1 = internal::random(0,m2.cols()-1); local
18 VERIFY_IS_APPROX(m4=m2.col(c)*refMat2.col(c1).transpose(), refMat4=refMat2.col(c)*refMat2.col(c1).transpose());
19 VERIFY_IS_APPROX(m4=refMat2.col(c1)*m2.col(c).transpose(), refMat4=refMat2.col(c1)*refMat2.col(c).transpose());
26 int c1 = internal::random(0,m2.cols()-1); local
27 VERIFY_IS_APPROX(m4=m2.row(r).transpose()*refMat2.col(c1).transpose(), refMat4=refMat2.row(r).transpose()*refMat2.col(c1).transpose());
28 VERIFY_IS_APPROX(m4=refMat2.col(c1)*m2.row(r), refMat4=refMat2.col(c1)*refMat2.row(r))
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_submatrices.cpp | 19 CheckMinor(MatrixType& m1, int r1, int c1)
26 mi = m1.minor(r1,c1);
27 VERIFY_IS_APPROX(mi.transpose(), m1.transpose().minor(c1,r1));
29 m1.minor(r1,c1)(0,0) = m1.minor(0,0)(0,0);
69 int c1 = ei_random<int>(0,cols-1); local
70 int c2 = ei_random<int>(c1,cols-1);
73 VERIFY_IS_APPROX(m1.col(c1).transpose(), m1.transpose().row(c1));
74 VERIFY_IS_APPROX(square.row(r1).eigen2_dot(m1.col(c1)), (square.lazy() * m1.conjugate())(r1,c1));
[all...] |
| /external/icu4c/common/ |
| ucmndata.c | 105 int32_t c1=(uint8_t)*s1++; local
107 cmp=c1-c2;
108 if(cmp!=0 || c1==0) { /* different or done */
|
| uinvchar.c | 453 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 is set *
542 int32_t c1, c2; local
[all...] |
| unormcmp.cpp | 63 * get one code unit c1 from s1 (-1 if end of source)
69 * if(c1==c2) {
73 * // c1!=c2
74 * try to decompose/case-fold c1/c2, and continue if one does;
76 * // still c1!=c2 and neither decomposes/case-folds, return result
77 * return c1-c2;
170 UChar32 c1, c2, cp1, cp2; local
211 c1=c2=-1;
220 if(c1<0) {
223 if(s1==limit1 || ((c1=*s1)==0 && (limit1==NULL || (options&_STRNCMP_STYLE))))
[all...] |
| /external/icu4c/test/intltest/ |
| aliastst.cpp | 66 Calendar* c1 = Calendar::createInstance(oldLoc, status); local
70 const char* l1 = c1->getLocaleID(ULOC_VALID_LOCALE, status);
78 if(!(c1==c2)){
79 errln("CalendarTest: c1!=c2. newLoc= "+UnicodeString(newLoc.getName()) +" oldLoc= "+UnicodeString(oldLoc.getName()));
82 delete c1;
112 errln("TestDateFormat: c1!=c2. newLoc= "+UnicodeString(newLoc.getName()) +" oldLoc= "+UnicodeString(oldLoc.getName()));
133 Collator* c1 = Collator::createInstance(oldLoc, status); local
136 Locale l1 = c1->getLocale(ULOC_VALID_LOCALE, status);
145 if(!(c1==c2)){
146 errln("CollationTest: c1!=c2. newLoc= "+UnicodeString(newLoc.getName()) +" oldLoc= "+UnicodeString(oldLoc.getName()))
[all...] |
| /external/jmonkeyengine/engine/src/blender/com/jme3/scene/plugins/blender/file/ |
| DnaBlockData.java | 193 char c1 = (char) ((code & 0xFF000000) >> 24);
local
197 return String.valueOf(c1) + c2 + c3 + c4;
|
| /external/libvpx/libvpx/vp8/common/mips/dspr2/ |
| idctllm_dspr2.c | 47 int a1, b1, c1, d1; local
67 c1 = temp1 - temp2;
83 op[4] = b1 + c1;
84 op[8] = b1 - c1;
99 c1 = temp1 - temp2;
115 op[6] = b1 + c1;
116 op[10] = b1 - c1;
137 c1 = temp1 - temp2;
153 op[1] = (b1 + c1 + 4) >> 3;
154 op[2] = (b1 - c1 + 4) >> 3
285 int a1, b1, c1, d1; local
[all...] |
| /external/libvpx/libvpx/vp8/encoder/ |
| encodemv.c | 269 const int c1 = events [mv_max + j]; /* positive */ local
271 const int c = c1 + c2;
274 sign_ct [0] += c1;
|
| ssim.c | 81 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/llvm/unittests/IR/ |
| MetadataTest.cpp | 91 Value *const c1 = n1; local
92 MDNode *n2 = MDNode::get(Context, c1);
96 MDNode *n5 = MDNode::getIfExists(Context, c1);
|
| /external/opencv/otherlibs/highgui/ |
| grfmt_base.cpp | 176 int c1 = tolower(format[i+1]); local
179 if( c1 != c2 )
|
| /external/openssl/crypto/bn/ |
| bn_mul.c | 396 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/regex-re2/util/ |
| rune.cc | 51 int c, c1, c2, c3; local
68 c1 = *(unsigned char*)(str+1) ^ Tx;
69 if(c1 & Testx)
74 l = ((c << Bitx) | c1) & Rune2;
89 l = ((((c << Bitx) | c1) << Bitx) | c2) & Rune3;
104 l = ((((((c << Bitx) | c1) << Bitx) | c2) << Bitx) | c3) & Rune4;
233 long c1; local
241 c1 = *(unsigned char*)s;
242 if(c1 < Runeself) { /* one byte rune */
243 if(c1 == 0
[all...] |
| /external/skia/tests/ |
| ColorTest.cpp | 127 SkColor c1 = SkUnPreMultiply::PMColorToColor(p0); local
128 SkPMColor p1 = SkPreMultiplyColor(c1);
130 // we can't promise that c0 == c1, since c0 -> p0 is a many to one
131 // function, however, we can promise that p0 -> c1 -> p1 : p0 == p1
|
| /external/skia/tools/ |
| skdiff.cpp | 143 static inline bool colors_match_thresholded(SkPMColor c0, SkPMColor c1, const int threshold) {
144 int da = SkGetPackedA32(c0) - SkGetPackedA32(c1);
145 int dr = SkGetPackedR32(c0) - SkGetPackedR32(c1);
146 int dg = SkGetPackedG32(c0) - SkGetPackedG32(c1);
147 int db = SkGetPackedB32(c0) - SkGetPackedB32(c1);
180 SkPMColor c1 = *dr->fComparison.fBitmap.getAddr32(x, y); local
181 SkPMColor outputDifference = diffFunction(c0, c1);
182 uint32_t thisA = SkAbs32(SkGetPackedA32(c0) - SkGetPackedA32(c1));
183 uint32_t thisR = SkAbs32(SkGetPackedR32(c0) - SkGetPackedR32(c1));
184 uint32_t thisG = SkAbs32(SkGetPackedG32(c0) - SkGetPackedG32(c1));
[all...] |
| /external/valgrind/main/memcheck/tests/ |
| varinfo5so.c | 126 typedef struct { short c1; char* c2[3]; } XX; member in struct:__anon17264
137 croak(1 + (char*)(&a[3].xyzzy[x*y].c1));
141 return a[3].xyzzy[x*y].c1;
|
| /hardware/qcom/display/libqdutils/ |
| qdMetaData.h | 51 uint16_t c1[MAX_IGC_LUT_ENTRIES]; member in struct:IGCData_t
|
| /ndk/sources/host-tools/make-3.81/glob/ |
| fnmatch.c | 336 size_t c1 = 0; local
344 if (c1 == CHAR_CLASS_MAX_LENGTH)
363 str[c1++] = c;
365 str[c1] = '\0';
|
