| /external/libcxx/test/std/containers/sequences/deque/deque.modifiers/ |
| push_front_rvalue.pass.cpp | 47 test(C& c1, int x)
50 std::size_t c1_osize = c1.size();
51 c1.push_front(MoveOnly(x));
52 assert(c1.size() == c1_osize + 1);
53 assert(static_cast<std::size_t>(distance(c1.begin(), c1.end())) == c1.size());
54 I i = c1.begin();
65 C c1 = make<C>(N, start); local
66 test(c1, -10)
[all...] |
| /external/libcxx/test/std/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...] |
| move_backward.pass.cpp | 53 C c1 = make<C>(N, start); local
55 assert(std::move_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin());
56 assert(c1 == c2);
57 assert(std::move_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin());
58 assert(c1 == c2);
59 assert(std::move_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin()));
60 assert(c1 == c2)
[all...] |
| swap.pass.cpp | 45 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, 1));
70 swap(c1, c2);
71 assert((c1 == std::deque<int, A>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
72 assert(c1.get_allocator().get_id() == 1);
80 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1));
82 swap(c1, c2)
[all...] |
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/ |
| remove.pass.cpp | 38 C c1(std::begin(t1), std::end(t1));
40 c1.remove(0);
41 assert(c1 == c2);
47 C c1(std::begin(t1), std::end(t1));
49 c1.remove(0);
50 assert(c1 == c2);
57 C c1(std::begin(t1), std::end(t1));
59 c1.remove(0);
60 assert(c1 == c2);
65 C c1; local
139 C c1; local
[all...] |
| /external/libvpx/libvpx/vp8/encoder/ |
| dct.c | 17 int a1, b1, c1, d1; local
24 c1 = ((ip[1] - ip[2]) * 8);
30 op[1] = (c1 * 2217 + d1 * 5352 + 14500) >> 12;
31 op[3] = (d1 * 2217 - c1 * 5352 + 7500) >> 12;
41 c1 = ip[4] - ip[8];
47 op[4] = ((c1 * 2217 + d1 * 5352 + 12000) >> 16) + (d1 != 0);
48 op[12] = (d1 * 2217 - c1 * 5352 + 51000) >> 16;
62 int a1, b1, c1, d1; local
70 c1 = ((ip[1] - ip[3]) * 4);
74 op[1] = b1 + c1;
[all...] |
| /external/ltp/testcases/kernel/mem/shmt/ |
| shmt09.c | 73 char *c1 = NULL, *c2 = NULL, *c3 = NULL; local
102 c1 = shmat(shmid, NULL, 0);
103 if (c1 == (char *)-1) {
|
| shmt10.c | 71 char *c1 = NULL; local
111 if ((c1 = shmat(shmid, NULL, 0)) == (char *)-1) {
117 if (shmdt(c1) < 0) {
145 char *c1; local
148 if ((c1 = shmat(shmid, NULL, 0)) == (char *)-1) {
154 if (shmdt(c1) < 0) {
|
| /external/python/cpython2/Modules/_ctypes/libffi/testsuite/libffi.call/ |
| struct5.c | 11 char c1; member in struct:__anon30201
17 ts1.c1 += ts2.c1;
53 ts5_arg1.c1 = 2;
55 ts5_arg2.c1 = 5;
60 CHECK(ts5_result->c1 == 7);
|
| /external/skia/gm/ |
| displacement.cpp | 30 SkColor c1 = sk_tool_utils::color_to_565(0xFF244484); variable
34 sk_tool_utils::create_checkerboard_bitmap(80, 80, c1, c2, 8));
36 sk_tool_utils::create_checkerboard_bitmap(64, 64, c1, c2, 8));
38 sk_tool_utils::create_checkerboard_bitmap(96, 96, c1, c2, 8));
40 SkImage::MakeFromBitmap(sk_tool_utils::create_checkerboard_bitmap(96, 64, c1, c2, 8));
42 sk_tool_utils::create_checkerboard_bitmap(64, 96, c1, c2, 8));
|
| /external/skia/samplecode/ |
| Sample2PtRadial.cpp | 33 SkPoint c1 = { 100, 100 }; local
36 paint.setShader(SkGradientShader::MakeTwoPointConical(c0, r0, c1, r1, colors,
|
| /external/syslinux/gnu-efi/gnu-efi-3.0/apps/ |
| modelist.c | 8 const unsigned char *c1 = s1, *c2 = s2; local
19 d = (int)*c1++ - (int)*c2++;
|
| /external/testng/src/test/java/test/testng249/ |
| VerifyTest.java | 25 XmlClass c1 = new XmlClass(B.class); local
26 c1.setIncludedMethods(Arrays.asList(new XmlInclude[] { new XmlInclude("b")}));
29 test.setXmlClasses(Arrays.asList(new XmlClass[] { c1, c2 }));
|
| /external/valgrind/massif/tests/ |
| overloaded-new.cpp | 51 char* c1 = new char[2000]; local
55 delete [] c1;
|
| /external/valgrind/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:__anon37936
47 croak(1 + (char*)(&a[3].xyzzy[x*y].c1));
51 return a[3].xyzzy[x*y].c1;
|
| /external/valgrind/memcheck/tests/linux/ |
| stack_changes.c | 57 int c1 = init_context(&ctx1); local
65 VALGRIND_STACK_DEREGISTER(c1);
|
| /external/vulkan-validation-layers/loader/ |
| murmurhash.c | 36 uint32_t c1 = 0xcc9e2d51; local
61 k *= c1;
82 k *= 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...] |
| /frameworks/minikin/libs/minikin/ |
| GraphemeBreak.cpp | 74 uint32_t c1 = 0; local
78 U16_PREV(buf, start, offset_back, c1);
80 int32_t p1 = tailoredGraphemeClusterBreak(c1);
133 uint32_t c0 = c1;
196 if (u_getIntPropertyValue(c1, UCHAR_CANONICAL_COMBINING_CLASS) == 9 // virama
197 && !isPureKiller(c1)
|
| /prebuilts/go/darwin-x86/test/ |
| const6.go | 16 c1 bool = x < y
22 c7 = c1 == c2 // ERROR "mismatched types|incompatible types"
24 c9 = c1 == c6 // ERROR "mismatched types|incompatible types"
27 _ = c1 && c2 // ERROR "mismatched types|incompatible types"
29 _ = c1 && c6 // ERROR "mismatched types|incompatible types"
15 c1 bool = x < y var
|
| nowritebarrier.go | 42 func c1() { func
|
| /prebuilts/go/linux-x86/test/ |
| const6.go | 16 c1 bool = x < y
22 c7 = c1 == c2 // ERROR "mismatched types|incompatible types"
24 c9 = c1 == c6 // ERROR "mismatched types|incompatible types"
27 _ = c1 && c2 // ERROR "mismatched types|incompatible types"
29 _ = c1 && c6 // ERROR "mismatched types|incompatible types"
15 c1 bool = x < y var
|
