Searched defs:c1 (Results 201 - 225 of 635) sorted by relevance

1234567891011>>

/external/icu/icu4c/source/test/intltest/
H A Daliastst.cpp66 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!
[all...]
/external/jemalloc/include/jemalloc/internal/
H A Dhash.h95 const uint32_t c1 = 0xcc9e2d51; local
106 k1 *= c1;
125 case 1: k1 ^= tail[0]; k1 *= c1; k1 = hash_rotl_32(k1, 15);
150 const uint32_t c1 = 0x239b961b; local
166 k1 *= c1; k1 = hash_rotl_32(k1, 15); k1 *= c2; h1 ^= k1;
181 k4 *= c4; k4 = hash_rotl_32(k4, 18); k4 *= c1; h4 ^= k4;
200 k4 *= c4; k4 = hash_rotl_32(k4, 18); k4 *= c1; h4 ^= k4;
218 k1 *= c1; k1 = hash_rotl_32(k1, 15); k1 *= c2; h1 ^= k1;
250 const uint64_t c1 = KQU(0x87c37b91114253d5); local
262 k1 *= c1; k
[all...]
/external/libnfc-nxp/src/
H A DphFriNfc_NdefReg.c51 int8_t c1, c2; local
55 c1 = *s1;
57 if (c1 >=97)
58 c1 = (c1 - 32);
65 while ( (c1 == c2) && (c1 != '\0') && (c2 != '\0') && (count > 0) );
67 if ( (count == 0) || (c1 == c2) )
70 else if ( (c1 > c2) )
/external/libutf/
H A Drune.c68 int c, c1, c2, c3; local
95 c1 = *(uchar*)(str+1) ^ Tx;
96 if(c1 & Testx)
101 l = ((c << Bitx) | c1) & Rune2;
121 l = ((((c << Bitx) | c1) << Bitx) | c2) & Rune3;
139 l = ((((((c << Bitx) | c1) << Bitx) | c2) << Bitx) | c3) & Rune4;
169 int c, c1, c2, c3; local
186 c1 = *(uchar*)(str+1) ^ Tx;
187 if(c1 & Testx)
192 l = ((c << Bitx) | c1)
[all...]
/external/libvpx/libvpx/vp8/common/
H A Didctllm.c34 int a1, b1, c1, d1; local
48 c1 = temp1 - temp2;
57 op[shortpitch*1] = b1 + c1;
58 op[shortpitch*2] = b1 - c1;
74 c1 = temp1 - temp2;
84 op[1] = (b1 + c1 + 4) >> 3;
85 op[2] = (b1 - c1 + 4) >> 3;
144 int a1, b1, c1, d1; local
153 c1 = ip[4] - ip[8];
157 op[4] = c1
[all...]
/external/llvm/unittests/IR/
H A DMetadataTest.cpp91 Value *const c1 = n1; local
92 MDNode *n2 = MDNode::get(Context, c1);
96 MDNode *n5 = MDNode::getIfExists(Context, c1);
/external/mockito/cglib-and-asm/src/org/mockito/cglib/proxy/
H A DMethodProxy.java48 public static MethodProxy create(Class c1, Class c2, String desc, String name1, String name2) { argument
52 proxy.createInfo = new CreateInfo(c1, c2);
75 fci.f1 = helper(ci, ci.c1);
95 Class c1; field in class:MethodProxy.CreateInfo
101 public CreateInfo(Class c1, Class c2) argument
103 this.c1 = c1;
/external/opencv/otherlibs/highgui/
H A Dgrfmt_base.cpp176 int c1 = tolower(format[i+1]); local
179 if( c1 != c2 )
/external/openssl/crypto/bn/asm/
H A Dx86_64-gcc.c111 BN_ULONG c1=0; local
113 if (num <= 0) return(c1);
117 mul_add(rp[0],ap[0],w,c1);
118 mul_add(rp[1],ap[1],w,c1);
119 mul_add(rp[2],ap[2],w,c1);
120 mul_add(rp[3],ap[3],w,c1);
125 mul_add(rp[0],ap[0],w,c1); if (--num==0) return c1;
126 mul_add(rp[1],ap[1],w,c1); if (--num==0) return c1;
135 BN_ULONG c1=0; local
356 BN_ULONG c1,c2,c3; local
460 BN_ULONG c1,c2,c3; local
500 BN_ULONG c1,c2,c3; local
576 BN_ULONG c1,c2,c3; local
[all...]
/external/pdfium/core/src/fxcodec/lcms2/lcms2-2.6/src/
H A Dcmsmtrx.c131 cmsFloat64Number det, c0, c1, c2; local
134 c1 = -a -> v[1].n[0]*a -> v[2].n[2] + a -> v[1].n[2]*a -> v[2].n[0];
137 det = a -> v[0].n[0]*c0 + a -> v[0].n[1]*c1 + a -> v[0].n[2]*c2;
144 b -> v[1].n[0] = c1/det;
/external/regex-re2/util/
H A Drune.cc51 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
[all...]
/external/skia/experimental/Intersection/
H A DCubicConvexHull.cpp19 CubicIntersections(const Cubic& c1, const Cubic& c2, Intersections& i) argument
20 : cubic1(c1)
162 bool intersect(const Cubic& c1, const Cubic& c2, Intersections& i) { argument
163 CubicIntersections c(c1, c2, i);
H A DCubicIntersection.cpp82 Cubic c1, c2; local
83 sub_divide(cubic1, t1s, t1e, c1);
86 // OPTIMIZE: if c1 == c2, call once (happens when detecting self-intersection)
87 cubic_to_quadratics(c1, calcPrecision(c1) * precisionScale, ts1);
408 bool intersect3(const Cubic& c1, const Cubic& c2, Intersections& i) {
409 bool result = intersect3(c1, 0, 1, c2, 0, 1, 1, i);
412 c1Bounds.setBounds(c1); // OPTIMIZE use setRawBounds ?
414 result |= intersectEnd(c1, false, c2, c2Bounds, i);
415 result |= intersectEnd(c1, tru
[all...]
/external/skia/samplecode/
H A DSampleGradients.cpp13 static SkShader* setgrad(const SkRect& r, SkColor c0, SkColor c1) { argument
14 SkColor colors[] = { c0, c1 };
/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/skia/tests/
H A DGpuColorFilterTest.cpp61 const SkColor c1 = SkColorSetARGB(200, 200, 200, 200); local
63 const GrColor gr_c1 = SkColor2GrColor(c1);
74 { kR, gr_white, c1, SkXfermode::kClear_Mode, kRGBA, gr_black },
77 { kRGBA, gr_c2, c1, SkXfermode::kSrc_Mode, kRGBA, gr_c1 },
78 { kA, gr_c1, c1, SkXfermode::kSrc_Mode, kRGBA, gr_c1 },
/external/chromium_org/base/
H A Dcallback_list_unittest.cc105 CallbackList<void(int)> c1; local
107 c1.Add(Bind(&Summer::AddOneParam, Unretained(&s)));
109 c1.Notify(1);
/external/chromium_org/base/i18n/
H A Dstreaming_utf8_validator_unittest.cc280 base::StringPiece c1 = *it1; local
283 validator.AddBytes(c1.data(), c1.size());
285 << "Failed for \"" << c1 << c2 << "\"";
/external/chromium_org/third_party/WebKit/Source/platform/graphics/
H A DPathTraversalState.cpp81 CubicBezier(const FloatPoint& s, const FloatPoint& c1, const FloatPoint& c2, const FloatPoint& e) argument
83 , control1(c1)
/external/chromium_org/third_party/WebKit/Source/wtf/text/
H A DTextEncodingRegistry.cpp55 char c1; local
61 c1 = toASCIILower(*s1++);
63 if (c1 != c2)
66 c1 = *s1++;
68 if (toASCIILower(c1) != toASCIILower(c2))
71 } while (c1 && c2);
72 return !c1 && !c2;
/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 Dunormcmp.cpp63 * 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
[all...]
/external/chromium_org/third_party/icu/source/test/intltest/
H A Ditercoll.cpp95 RuleBasedCollator *c1 = NULL; local
96 c1 = new RuleBasedCollator(
99 if (c1 == NULL || U_FAILURE(status))
102 delete c1;
107 iter = c1->createCollationElementIterator(source);
110 delete c1;
601 int32_t c1, c2, count = 0; local
606 c1 = i1.next(status);
609 if (c1 != c2)
611 errln(" %d: strength(0x%X) != strength(0x%X)", count, c1, c
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/mips/dspr2/
H A Didctllm_dspr2.c47 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
285 int a1, b1, c1, d1; local
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/
H A Dencodemv.c269 const int c1 = events [mv_max + j]; /* positive */ local
271 const int c = c1 + c2;
274 sign_ct [0] += c1;

Completed in 627 milliseconds

1234567891011>>