Searched defs:c1 (Results 101 - 125 of 635) sorted by relevance

1234567891011>>

/external/blktrace/
H A Dstrverscmp.c93 unsigned char c1, c2; local
126 c1 = *p1++;
129 state = S_N | ((c1 == '0') + (isdigit (c1) != 0));
131 while ((diff = c1 - c2) == 0 && c1 != '\0')
134 c1 = *p1++;
136 state |= (c1 == '0') + (isdigit (c1) != 0);
/external/chromium_org/third_party/libjingle/source/talk/base/
H A Dstringutils.cc72 wchar_t c1, c2; local
75 c1 = transformation(*s1);
80 if (c1 != c2) return (c1 < c2) ? -1 : 1;
81 if (!c1) return 0;
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/
H A Ddct.c17 int a1, b1, c1, d1; local
25 c1 = ((ip[1] - ip[2]) * 8);
31 op[1] = (c1 * 2217 + d1 * 5352 + 14500)>>12;
32 op[3] = (d1 * 2217 - c1 * 5352 + 7500)>>12;
44 c1 = ip[4] - ip[8];
50 op[4] =((c1 * 2217 + d1 * 5352 + 12000)>>16) + (d1!=0);
51 op[12] = (d1 * 2217 - c1 * 5352 + 51000)>>16;
67 int a1, b1, c1, d1; local
77 c1 = ((ip[1] - ip[3]) * 4);
81 op[1] = b1 + c1;
[all...]
/external/chromium_org/third_party/openssl/openssl/crypto/bn/asm/
H A Ds390x.S329 #define c1 %r1 define
333 #define mul_add_c(ai,bi,c1,c2,c3) \
336 algr c1,%r7; \
347 lghi c1,0
352 mul_add_c(0,0,c1,c2,c3);
353 stg c1,0*8(%r2)
354 lghi c1,0
356 mul_add_c(0,1,c2,c3,c1);
357 mul_add_c(1,0,c2,c3,c1);
361 mul_add_c(2,0,c3,c1,c
[all...]
/external/chromium_org/third_party/skia/gm/
H A Dalphagradients.cpp26 SkColor c0, SkColor c1, bool doPreMul) {
27 SkColor colors[] = { c0, c1 };
25 draw_grad(SkCanvas* canvas, const SkRect& r, SkColor c0, SkColor c1, bool doPreMul) argument
/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/third_party/webrtc/base/
H A Dstringutils.cc55 wchar_t c1, c2; local
58 c1 = transformation(*s1);
63 if (c1 != c2) return (c1 < c2) ? -1 : 1;
64 if (!c1) return 0;
/external/chromium_org/v8/test/mjsunit/compiler/
H A Dinline-construct.js85 function c1(val, deopt, counter) { class
90 TestInAllContexts(c1);
/external/chromium_org/v8/test/mjsunit/
H A Dstring-slices.js229 var c1 = s1 + s2; variable
230 var c2 = s1 + c1 + s2;
231 assertEquals("234567890123456789", c1.substring(1, 19));
232 assertEquals("bcdefghijklmno", c1.substring(21, 35));
233 assertEquals("2345678901234567890abcdefghijklmno", c1.substring(1, 35));
/external/clang/test/CodeGen/
H A Datomics-inlining.c7 unsigned char c1, c2; variable
23 (void)__atomic_load(&c1, &c2, memory_order_seq_cst);
24 (void)__atomic_store(&c1, &c2, memory_order_seq_cst);
35 // ARM: = call arm_aapcscc zeroext i8 @__atomic_load_1(i8* @c1
36 // ARM: call arm_aapcscc void @__atomic_store_1(i8* @c1, i8 zeroext
47 // PPC32: = load atomic i8* @c1 seq_cst
48 // PPC32: store atomic i8 {{.*}}, i8* @c1 seq_cst
59 // PPC64: = load atomic i8* @c1 seq_cst
60 // PPC64: store atomic i8 {{.*}}, i8* @c1 seq_cst
71 // MIPS32: = load atomic i8* @c1 seq_cs
[all...]
/external/clang/test/CodeGenCXX/
H A Darray-operator-delete-call.cpp52 COST c1; variable
/external/clang/test/SemaCXX/
H A Dconstexpr-value-init.cpp26 constexpr C c1; // expected-error {{requires a user-provided default constructor}} variable
H A Ddeprecated.cpp67 Dtor c1, c2(c1); // expected-note {{implicit copy constructor for 'Dtor' first required here}} member in namespace:DeprecatedCopy
68 void g() { c1 = c2; } // expected-note {{implicit copy assignment operator for 'Dtor' first required here}}
/external/clang/test/SemaTemplate/
H A Dattributes.cpp17 check_alignment<1>::t c1; member in namespace:attribute_aligned
/external/guava/guava/src/com/google/common/hash/
H A DMurmur3_32HashFunction.java46 int c1 = 0xcc9e2d51; field in class:Murmur3_32HashFunction.Murmur3_32Hasher
59 k1 *= c1;
82 k1 *= c1;
/external/libcxx/test/containers/sequences/deque/deque.cons/
H A Dassign_iter_iter.pass.cpp45 test(C& c1, const C& c2) argument
47 std::size_t c1_osize = c1.size();
48 c1.assign(c2.begin(), c2.end());
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 assert(c1 == c2);
59 C c1 = make<C>(N, start); local
61 test(c1, c2);
66 testI(C& c1, cons argument
82 C c1 = make<C>(N, start); local
[all...]
/external/libcxx/test/containers/sequences/deque/deque.modifiers/
H A Derase_iter_iter.pass.cpp43 test(int P, C& c1, int size) argument
46 assert(P + size <= c1.size());
47 std::size_t c1_osize = c1.size();
48 I i = c1.erase(c1.cbegin() + P, c1.cbegin() + (P + size));
49 assert(i == c1.begin() + P);
50 assert(c1.size() == c1_osize - size);
51 assert(distance(c1.begin(), c1
70 C c1 = make<C>(N, start); local
[all...]
H A Dinsert_rvalue.pass.cpp46 test(int P, C& c1, int x) argument
50 std::size_t c1_osize = c1.size();
51 CI i = c1.insert(c1.begin() + P, MoveOnly(x));
52 assert(i == c1.begin() + P);
53 assert(c1.size() == c1_osize + 1);
54 assert(distance(c1.begin(), c1.end()) == c1.size());
55 i = c1
74 C c1 = make<C>(N, start); local
82 C c1 = make<C>(N, start); local
90 C c1 = make<C>(N, start); local
[all...]
/external/libcxx/test/containers/sequences/deque/deque.special/
H A Dswap.pass.cpp45 C c1 = make<C>(N, start); local
47 C c1_save = c1;
49 swap(c1, c2);
50 assert(c1 == c2_save);
68 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1));
70 swap(c1, c2);
71 assert((c1 == std::deque<int, A>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
72 assert(c1.get_allocator() == A(1));
80 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1));
82 swap(c1, c
[all...]
/external/libcxx/test/iterators/predef.iterators/insert.iterators/insert.iter.ops/insert.iter.op=/
H A Drv_value.pass.cpp27 test(C c1, typename C::difference_type j, argument
31 std::insert_iterator<C> q(c1, c1.begin() + j);
35 assert(c1 == c2);
62 C c1; local
65 c1.push_back(Ptr(x+i));
70 test(std::move(c1), 0, Ptr(x+3), Ptr(x+4), Ptr(x+5), c2);
71 c1.clear();
73 c1.push_back(Ptr(x+i));
78 test(std::move(c1),
[all...]
/external/libsepol/include/sepol/policydb/
H A Dcontext.h52 static inline int mls_context_cmp(context_struct_t * c1, context_struct_t * c2) argument
54 return (mls_level_eq(&c1->range.level[0], &c2->range.level[0]) &&
55 mls_level_eq(&c1->range.level[1], &c2->range.level[1]));
90 static inline int context_cmp(context_struct_t * c1, context_struct_t * c2) argument
92 return ((c1->user == c2->user) &&
93 (c1->role == c2->role) &&
94 (c1->type == c2->type) && mls_context_cmp(c1, c2));
/external/libvpx/libvpx/vp8/encoder/
H A Ddct.c17 int a1, b1, c1, d1; local
25 c1 = ((ip[1] - ip[2]) * 8);
31 op[1] = (c1 * 2217 + d1 * 5352 + 14500)>>12;
32 op[3] = (d1 * 2217 - c1 * 5352 + 7500)>>12;
44 c1 = ip[4] - ip[8];
50 op[4] =((c1 * 2217 + d1 * 5352 + 12000)>>16) + (d1!=0);
51 op[12] = (d1 * 2217 - c1 * 5352 + 51000)>>16;
67 int a1, b1, c1, d1; local
77 c1 = ((ip[1] - ip[3]) * 4);
81 op[1] = b1 + c1;
[all...]
/external/lzma/CPP/Common/
H A DMyString.cpp140 wchar_t c1 = *s1++;
142 wchar_t u1 = MyCharUpper(c1);
158 unsigned char c1 = (unsigned char)*s1++; local
160 if (c1 < c2) return -1;
161 if (c1 > c2) return 1;
162 if (c1 == 0) return 0;
170 wchar_t c1 = *s1++; local
172 if (c1 < c2) return -1;
173 if (c1 > c2) return 1;
174 if (c1
182 wchar_t c1 = *s1++; local
[all...]
/external/openssl/crypto/bn/asm/
H A Ds390x.S329 #define c1 %r1 define
333 #define mul_add_c(ai,bi,c1,c2,c3) \
336 algr c1,%r7; \
347 lghi c1,0
352 mul_add_c(0,0,c1,c2,c3);
353 stg c1,0*8(%r2)
354 lghi c1,0
356 mul_add_c(0,1,c2,c3,c1);
357 mul_add_c(1,0,c2,c3,c1);
361 mul_add_c(2,0,c3,c1,c
[all...]
/external/skia/gm/
H A Dalphagradients.cpp26 SkColor c0, SkColor c1, bool doPreMul) {
27 SkColor colors[] = { c0, c1 };
25 draw_grad(SkCanvas* canvas, const SkRect& r, SkColor c0, SkColor c1, bool doPreMul) argument

Completed in 2210 milliseconds

1234567891011>>