/external/guava/guava/src/com/google/common/hash/ |
H A D | Murmur3_128HashFunction.java | 49 long c1 = 0x87c37b91114253d5L; field in class:Murmur3_128HashFunction.Murmur3_128Hasher 67 k1 *= c1; 78 k2 *= c1; 107 k2 *= c1; 126 k1 *= c1;
|
/external/icu/icu4c/source/samples/uciter8/ |
H A D | uciter8.c | 48 UChar32 c1, c2; local 74 c1=iter1->current(iter1); 76 if(c1!=c2) { 77 log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle); 83 c1=iter1->next(iter1); 85 if(c1!=c2) { 86 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); 93 c1=iter1->previous(iter1); 95 if(c1!=c2) { 96 log_err("%s->previous()=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c 308 UChar32 c1, c2; local [all...] |
/external/libcxx/test/containers/sequences/deque/deque.modifiers/ |
H A D | insert_iter_iter.pass.cpp | 47 test(int P, C& c1, const C& c2) argument 52 std::size_t c1_osize = c1.size(); 53 CI i = c1.insert(c1.begin() + P, BCI(c2.begin()), BCI(c2.end())); 54 assert(i == c1.begin() + P); 55 assert(c1.size() == c1_osize + c2.size()); 56 assert(distance(c1.begin(), c1.end()) == c1.size()); 57 i = c1 76 C c1 = make<C>(N, start); local 85 C c1 = make<C>(N, start); local 94 C c1 = make<C>(N, start); local 103 C c1 = make<C>(N, start); local 112 C c1 = make<C>(N, start); local 121 C c1 = make<C>(N, start); local 130 testI(int P, C& c1, const C& c2) argument 159 C c1 = make<C>(N, start); local 168 C c1 = make<C>(N, start); local 177 C c1 = make<C>(N, start); local 186 C c1 = make<C>(N, start); local 195 C c1 = make<C>(N, start); local [all...] |
H A D | insert_size_value.pass.cpp | 43 test(int P, C& c1, int size, int x) argument 47 std::size_t c1_osize = c1.size(); 48 CI i = c1.insert(c1.begin() + P, size, x); 49 assert(i == c1.begin() + P); 50 assert(c1.size() == c1_osize + size); 51 assert(distance(c1.begin(), c1.end()) == c1.size()); 52 i = c1 71 C c1 = make<C>(N, start); local 79 C c1 = make<C>(N, start); local 87 C c1 = make<C>(N, start); local 95 C c1 = make<C>(N, start); local 103 C c1 = make<C>(N, start); local [all...] |
H A D | insert_value.pass.cpp | 43 test(int P, C& c1, int x) argument 47 std::size_t c1_osize = c1.size(); 48 CI i = c1.insert(c1.begin() + P, x); 49 assert(i == c1.begin() + P); 50 assert(c1.size() == c1_osize + 1); 51 assert(distance(c1.begin(), c1.end()) == c1.size()); 52 i = c1 71 C c1 = make<C>(N, start); local 79 C c1 = make<C>(N, start); local 87 C c1 = make<C>(N, start); local [all...] |
/external/libcxx/test/input.output/iostreams.base/ios/basic.ios.members/ |
H A D | copyfmt.pass.cpp | 124 char c1, c2, c3; local 125 ios1.pword(0) = &c1;
|
H A D | swap.pass.cpp | 86 char c1, c2, c3; local 87 ios1.pword(0) = &c1; 157 assert(ios2.pword(0) == &c1);
|
/external/libvpx/libvpx/test/ |
H A D | vp8_fdct4x4_test.cc | 38 const int c1 = temp1 - temp2; local 44 op[4] = b1 + c1; 45 op[8] = b1 - c1; 56 const int c1 = temp1 - temp2; local 62 op[1] = (b1 + c1 + 4) >> 3; 63 op[2] = (b1 - c1 + 4) >> 3;
|
/external/lldb/test/pexpect-2.4/examples/ |
H A D | chess3.py | 84 c1 = white.term.get_abs(17,58) variable 89 fout.write ('Computer:%s%s%s%s\n' %(c1,c2,c3,c4)) 93 c1 = white.term.get_abs(17,58) variable 98 fout.write ('Computer:%s%s%s%s\n' %(c1,c2,c3,c4))
|
/external/openssl/crypto/bn/ |
H A D | bn_sqr.c | 210 int zero,c1; local 240 c1=bn_cmp_words(a,&(a[n]),n); 242 if (c1 > 0) 244 else if (c1 < 0) 264 c1=(int)(bn_add_words(t,r,&(r[n2]),n2)); 267 c1-=(int)(bn_sub_words(&(t[n2]),t,&(t[n2]),n2)); 272 * c1 holds the carry bits 274 c1+=(int)(bn_add_words(&(r[n]),&(r[n]),&(t[n2]),n2)); 275 if (c1) 279 ln=(lo+c1) [all...] |
/external/oprofile/libpp/ |
H A D | diff_container.cpp | 107 diff_container::diff_container(profile_container const & c1, argument 109 : pc1(c1), pc2(c2),
|
/external/skia/experimental/Intersection/ |
H A D | SimplifyAddIntersectingTs_Test.cpp | 93 SimplifyAddIntersectingTsTest::Contour& c1 = contour[0]; local 95 addIntersectTs(&c1, &c2); 97 bool c1Intersected = c1.segments()[0].intersected(); 108 c1.dump();
|
/external/skia/gm/ |
H A D | twopointradial.cpp | 27 SkPoint c1 = { d1[0], d1[1] }; local 37 SkScalarToFloat(c1.fX), SkScalarToFloat(c1.fY), SkScalarToFloat(r1)); 41 paint.setShader(SkGradientShader::CreateTwoPointConical(c0, r0, c1, r1, 50 canvas->drawCircle(c1.fX, c1.fY, r1, paint);
|
/external/skia/samplecode/ |
H A D | SampleAAClip.cpp | 16 SkAAClip c0, c1, c2; local 18 c1.setRect(r1); 19 c2.op(c0, c1, op);
|
H A D | SampleDegenerateTwoPtRadials.cpp | 26 SkPoint c1 = { l + 3 * w / 5, t + h / 2 }; local 29 SkShader* s = SkGradientShader::CreateTwoPointConical(c0, r0, c1, r1, colors,
|
/external/skia/src/core/ |
H A D | SkQuadClipper.cpp | 22 static bool chopMonoQuadAt(SkScalar c0, SkScalar c1, SkScalar c2, argument 28 SkScalar A = c0 - c1 - c1 + c2; 29 SkScalar B = 2*(c1 - c0);
|
/external/skia/tests/ |
H A D | ClipCubicTest.cpp | 42 const SkPoint c1[4], 45 if (SkScalarAbs(c0[i].fX - c1[i].fX) > tol || 46 SkScalarAbs(c0[i].fY - c1[i].fY) > tol 49 PrintCurve("c1", c1); 41 CurvesAreEqual(const SkPoint c0[4], const SkPoint c1[4], float tol) argument
|
/external/tcpdump/ |
H A D | checksum.c | 151 u_int32_t c1; local 156 c1 = 0; 164 c1 += c0; 168 c1 += c0; 173 c1 = c1 % 255; 177 x = mul - c0 - c1; 178 y = c1 - mul - 1;
|
/external/chromium_org/base/ |
H A D | callback_unittest.cc | 78 Callback<void(int)> c1; local 86 EXPECT_TRUE(c1.is_null());
|
/external/chromium_org/third_party/angle/src/third_party/murmurhash/ |
H A D | MurmurHash3.cpp | 102 const uint32_t c1 = 0xcc9e2d51; local 114 k1 *= c1; 135 k1 *= c1; k1 = ROTL32(k1,15); k1 *= c2; h1 ^= k1; 161 const uint32_t c1 = 0x239b961b; local 178 k1 *= c1; k1 = ROTL32(k1,15); k1 *= c2; h1 ^= k1; 190 k4 *= c4; k4 = ROTL32(k4,18); k4 *= c1; h4 ^= k4; 210 k4 *= c4; k4 = ROTL32(k4,18); k4 *= c1; h4 ^= k4; 228 k1 *= c1; k1 = ROTL32(k1,15); k1 *= c2; h1 ^= k1; 264 const uint64_t c1 = BIG_CONSTANT(0x87c37b91114253d5); local 277 k1 *= c1; k [all...] |
/external/chromium_org/third_party/boringssl/src/crypto/bn/asm/ |
H A D | x86_64-gcc.c | 99 BN_ULONG c1 = 0; local 102 return (c1); 105 mul_add(rp[0], ap[0], w, c1); 106 mul_add(rp[1], ap[1], w, c1); 107 mul_add(rp[2], ap[2], w, c1); 108 mul_add(rp[3], ap[3], w, c1); 114 mul_add(rp[0], ap[0], w, c1); 116 return c1; 117 mul_add(rp[1], ap[1], w, c1); 119 return c1; 128 BN_ULONG c1 = 0; local 367 BN_ULONG c1, c2, c3; local 470 BN_ULONG c1, c2, c3; local 509 BN_ULONG c1, c2, c3; local 584 BN_ULONG c1, c2, c3; local [all...] |
/external/chromium_org/third_party/icu/source/common/ |
H A D | cstring.c | 245 unsigned char c1, c2; local 248 c1=(unsigned char)*str1; 250 if(c1==0) { 260 rc=(int)(unsigned char)uprv_tolower(c1)-(int)(unsigned char)uprv_tolower(c2); 284 unsigned char c1, c2; local 287 c1=(unsigned char)*str1; 289 if(c1==0) { 299 rc=(int)(unsigned char)uprv_tolower(c1)-(int)(unsigned char)uprv_tolower(c2);
|
/external/chromium_org/third_party/icu/source/test/intltest/ |
H A D | 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! [all...] |
/external/chromium_org/third_party/libphonenumber/src/phonenumbers/utf/ |
H A D | rune.c | 68 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/chromium_org/third_party/libvpx/source/libvpx/vp8/common/ |
H A D | idctllm.c | 34 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...] |