| /external/pcre/dist/ |
| pcre_string_utils.c | 70 pcre_uchar c1; local
75 c1 = *str1++;
77 if (c1 != c2)
78 return ((c1 > c2) << 1) - 1;
89 pcre_uchar c1; local
94 c1 = UCHAR21INC(str1);
96 if (c1 != c2)
97 return ((c1 > c2) << 1) - 1;
109 pcre_uchar c1; local
114 c1 = *str1++
129 pcre_uchar c1; local
159 pcre_uchar c1; local
177 pcre_uchar c1; local
[all...] |
| /external/skia/samplecode/ |
| Sample2PtRadial.cpp | 34 SkPoint c1 = { 100, 100 }; local
36 SkShader* s = SkGradientShader::CreateTwoPointRadial(c0, r0, c1, r1, colors,
|
| /external/valgrind/main/massif/tests/ |
| overloaded-new.cpp | 51 char* c1 = new char[2000]; local
55 delete [] c1;
|
| /external/valgrind/main/memcheck/tests/ |
| leak-cycle.c | 39 struct n *volatile c1, *volatile c2; local
44 c1 = mkcycle();
47 c1 = c2 = 0;
50 c1 = mkcycle();
55 if (c1 < c2)
56 c2->r = c1;
58 c1->r = c2;
60 c1 = c2 = 0;
63 c1 = mkcycle();
66 c1->r = c2
[all...] |
| varinfo4.c | 36 typedef struct { short c1; char* c2[3]; } XX; member in struct:__anon37675
47 croak(1 + (char*)(&a[3].xyzzy[x*y].c1));
51 return a[3].xyzzy[x*y].c1;
|
| /external/valgrind/main/memcheck/tests/linux/ |
| stack_changes.c | 57 int c1 = init_context(&ctx1); local
65 VALGRIND_STACK_DEREGISTER(c1);
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/ |
| omxVCM4P10_TransformDequantLumaDCFromPair.c | 88 int c1 = pData[i+1]; local
91 pData[i+0] = (OMX_S16)(c0+c1+c2+c3);
92 pData[i+1] = (OMX_S16)(c0+c1-c2-c3);
93 pData[i+2] = (OMX_S16)(c0-c1-c2+c3);
94 pData[i+3] = (OMX_S16)(c0-c1+c2-c3);
101 int c1 = pData[i+4]; local
104 pData[i+0] = (OMX_S16)(c0+c1+c2+c3);
105 pData[i+4] = (OMX_S16)(c0+c1-c2-c3);
106 pData[i+8] = (OMX_S16)(c0-c1-c2+c3);
107 pData[i+12] = (OMX_S16)(c0-c1+c2-c3)
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/encoder/ |
| dct.c | 17 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...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.capacity/ |
| resize_size.pass.cpp | 43 test(C& c1, int size)
46 std::size_t c1_osize = c1.size();
47 c1.resize(size);
48 assert(c1.size() == size);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 CI i = c1.begin();
51 for (int j = 0; j < std::min(c1_osize, c1.size()); ++j, ++i)
53 for (int j = c1_osize; j < c1.size(); ++j, ++i
62 C c1 = make<C>(N, start); local
[all...] |
| resize_size_value.pass.cpp | 43 test(C& c1, int size, int x)
46 std::size_t c1_osize = c1.size();
47 c1.resize(size, x);
48 assert(c1.size() == size);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 CI i = c1.begin();
51 for (int j = 0; j < std::min(c1_osize, c1.size()); ++j, ++i)
53 for (int j = c1_osize; j < c1.size(); ++j, ++i
62 C c1 = make<C>(N, start); local
[all...] |
| shrink_to_fit.pass.cpp | 43 test(C& c1)
45 C s = c1;
46 c1.shrink_to_fit();
47 assert(c1 == s);
55 C c1 = make<C>(N, start); local
56 test(c1);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/ |
| assign_iter_iter.pass.cpp | 45 test(C& c1, const C& c2)
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, const C& c2
82 C c1 = make<C>(N, start); local
[all...] |
| assign_size_value.pass.cpp | 44 test(C& c1, int size, int v)
47 std::size_t c1_osize = c1.size();
48 c1.assign(size, v);
49 assert(c1.size() == size);
50 assert(distance(c1.begin(), c1.end()) == c1.size());
51 for (CI i = c1.begin(); i != c1.end(); ++i)
61 C c1 = make<C>(N, start) local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.modifiers/ |
| emplace.pass.cpp | 46 test(int P, C& c1)
50 std::size_t c1_osize = c1.size();
51 CI i = c1.emplace(c1.begin() + P, Emplaceable(1, 2.5));
52 assert(i == c1.begin() + P);
53 assert(c1.size() == c1_osize + 1);
54 assert(distance(c1.begin(), c1.end()) == c1.size());
68 C c1 = make<C>(N, start) local
76 C c1 = make<C>(N, start); local
84 C c1 = make<C>(N, start); local
[all...] |
| emplace_back.pass.cpp | 46 test(C& c1)
49 std::size_t c1_osize = c1.size();
50 c1.emplace_back(Emplaceable(1, 2.5));
51 assert(c1.size() == c1_osize + 1);
52 assert(distance(c1.begin(), c1.end()) == c1.size());
53 I i = c1.end();
61 C c1 = make<C>(N, start); local
62 test(c1);
[all...] |
| emplace_front.pass.cpp | 46 test(C& c1)
49 std::size_t c1_osize = c1.size();
50 c1.emplace_front(Emplaceable(1, 2.5));
51 assert(c1.size() == c1_osize + 1);
52 assert(distance(c1.begin(), c1.end()) == c1.size());
53 I i = c1.begin();
61 C c1 = make<C>(N, start); local
62 test(c1);
[all...] |
| erase_iter_iter.pass.cpp | 43 test(int P, C& c1, int size)
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.end()) == c1.size())
70 C c1 = make<C>(N, start); local
[all...] |
| insert_rvalue.pass.cpp | 46 test(int P, C& c1, int x)
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.begin()
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...] |
| pop_back.pass.cpp | 43 test(C& c1)
46 std::size_t c1_osize = c1.size();
47 c1.pop_back();
48 assert(c1.size() == c1_osize - 1);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 I i = c1.begin();
51 for (int j = 0; j < c1.size(); ++j, ++i)
61 C c1 = make<C>(N, start) local
[all...] |
| pop_front.pass.cpp | 43 test(C& c1)
46 std::size_t c1_osize = c1.size();
47 c1.pop_front();
48 assert(c1.size() == c1_osize - 1);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 I i = c1.begin();
51 for (int j = 1; j < c1.size(); ++j, ++i)
61 C c1 = make<C>(N, start) local
[all...] |
| push_front.pass.cpp | 43 test(C& c1, int x)
46 std::size_t c1_osize = c1.size();
47 c1.push_front(x);
48 assert(c1.size() == c1_osize + 1);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 I i = c1.begin();
61 C c1 = make<C>(N, start); local
62 test(c1, -10)
[all...] |
| push_front_rvalue.pass.cpp | 46 test(C& c1, int x)
49 std::size_t c1_osize = c1.size();
50 c1.push_front(MoveOnly(x));
51 assert(c1.size() == c1_osize + 1);
52 assert(distance(c1.begin(), c1.end()) == c1.size());
53 I i = c1.begin();
64 C c1 = make<C>(N, start); local
65 test(c1, -10)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.special/ |
| copy.pass.cpp | 54 C c1 = make<C>(N, start); local
56 assert(std::copy(c1.cbegin(), c1.cend(), c2.begin()) == c2.end());
57 assert(c1 == c2);
58 assert(std::copy(c2.cbegin(), c2.cend(), c1.begin()) == c1.end());
59 assert(c1 == c2);
60 assert(std::copy(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end()));
61 assert(c1 == c2)
[all...] |
| copy_backward.pass.cpp | 53 C c1 = make<C>(N, start); local
55 assert(std::copy_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin());
56 assert(c1 == c2);
57 assert(std::copy_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin());
58 assert(c1 == c2);
59 assert(std::copy_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin()));
60 assert(c1 == c2)
[all...] |
| move.pass.cpp | 53 C c1 = make<C>(N, start); local
55 assert(std::move(c1.cbegin(), c1.cend(), c2.begin()) == c2.end());
56 assert(c1 == c2);
57 assert(std::move(c2.cbegin(), c2.cend(), c1.begin()) == c1.end());
58 assert(c1 == c2);
59 assert(std::move(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end()));
60 assert(c1 == c2)
[all...] |
