| /external/clang/test/Index/ |
| complete-template-friends-defined.cpp | 24 M::C<int> c1; local
|
| /external/clang/test/Sema/ |
| attr-deprecated-message.c | 21 Color c1; // expected-warning {{'Color' is deprecated: Please avoid Color}} variable
|
| /external/clang/test/SemaCXX/ |
| attr-cleanup.cpp | 4 void c1(int *a) {} function in namespace:N
12 int v1 __attribute__((cleanup(N::c1)));
|
| gnu-flags.cpp | 75 // expected-warning@+6 {{flexible array member 'c1' in a union is a GNU extension}}
81 int c1[]; member in union:faum::__anon15843
|
| /external/compiler-rt/test/tsan/ |
| tsan-vs-gvn.cc | 12 char c1, c2, c3, c4; member in struct:__anon16269
18 G = S.c1 + S.c3;
|
| /external/eigen/Eigen/src/Geometry/ |
| EulerAngles.h | 77 // c2 s1.s2 c1.s2 1 0 0
78 // 0 c1 -s1 * M = 0 c3 s3
79 // -s2 s1.c2 c1.c2 0 -s3 c3
81 // Thus: m11.c1 - m21.s1 = c3 & m12.c1 - m22.s1 = s3
84 Scalar c1 = cos(res[0]); local
85 res[2] = atan2(c1*coeff(j,k)-s1*coeff(k,k), c1*coeff(j,j) - s1 * coeff(k,j));
103 Scalar c1 = cos(res[0]); local
104 res[2] = atan2(s1*coeff(k,i)-c1*coeff(j,i), c1*coeff(j,j) - s1 * coeff(k,j))
[all...] |
| /external/fio/crc/ |
| murmur3.c | 23 uint32_t len, const uint32_t c1,
36 k1 *= c1;
50 const uint32_t c1 = 0xcc9e2d51; local
58 k1 *= c1;
67 return murmur3_tail(data, nblocks, len, c1, c2, h1);
|
| /external/fio/lib/ |
| bswap.h | 9 uint32_t c1, c2, c3, c4; local
11 c1 = (val >> 24) & 0xff;
16 return c1 | c2 << 8 | c3 << 16 | c4 << 24;
21 uint64_t c1, c2, c3, c4, c5, c6, c7, c8; local
23 c1 = (val >> 56) & 0xff;
32 return c1 | c2 << 8 | c3 << 16 | c4 << 24 | c5 << 32 | c6 << 40 | c7 << 48 | c8 << 56;
|
| /external/kmod/testsuite/ |
| test-array.c | 32 const char *c1 = "test1"; local
35 array_append(&array, c1);
37 assert_return(array.array[0] == c1, EXIT_FAILURE);
49 const char *c1 = "test1"; local
54 array_append(&array, c1);
58 assert_return(array.array[0] == c1, EXIT_FAILURE);
71 const char *c1 = "test1"; local
76 array_append_unique(&array, c1);
81 array_append_unique(&array, c1);
83 assert_return(array.array[0] == c1, EXIT_FAILURE)
103 const char *c1 = "test1"; local
132 const char *c1 = "test1"; local
172 const char *c1 = "test1"; local
[all...] |
| /external/libcxx/test/libcxx/containers/sequences/list/list.modifiers/ |
| emplace_db1.pass.cpp | 40 std::list<A> c1; local
42 std::list<A>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
|
| /external/libcxx/test/std/containers/sequences/array/array.special/ |
| swap.pass.cpp | 44 C c1 = {1, 2, 3.5}; local
46 swap(c1, c2);
47 assert(c1.size() == 3);
48 assert(c1[0] == 4);
49 assert(c1[1] == 5);
50 assert(c1[2] == 6.5);
59 C c1 = {}; local
61 swap(c1, c2);
62 assert(c1.size() == 0);
81 typedef std::array<T, 42> C1;
[all...] |
| /external/libcxx/test/std/containers/sequences/deque/deque.capacity/ |
| resize_size.pass.cpp | 47 test(C& c1, int size)
50 typename C::size_type c1_osize = c1.size();
51 c1.resize(size);
52 assert(c1.size() == static_cast<std::size_t>(size));
53 assert(static_cast<std::size_t>(distance(c1.begin(), c1.end())) == c1.size());
54 CI i = c1.begin();
55 for (int j = 0; static_cast<std::size_t>(j) < std::min(c1_osize, c1.size()); ++j, ++i)
57 for (std::size_t j = c1_osize; j < c1.size(); ++j, ++i
65 C c1 = make<C>(N, start); local
[all...] |
| resize_size_value.pass.cpp | 47 test(C& c1, int size, int x)
50 typename C::size_type c1_osize = c1.size();
51 c1.resize(size, x);
52 assert(c1.size() == static_cast<std::size_t>(size));
53 assert(static_cast<std::size_t>(distance(c1.begin(), c1.end())) == c1.size());
54 CI i = c1.begin();
55 for (int j = 0; static_cast<std::size_t>(j) < std::min(c1_osize, c1.size()); ++j, ++i)
57 for (std::size_t j = c1_osize; j < c1.size(); ++j, ++i
65 C c1 = make<C>(N, start); local
[all...] |
| /external/libcxx/test/std/containers/sequences/deque/deque.cons/ |
| assign_iter_iter.pass.cpp | 47 test(C& c1, const C& c2)
49 c1.assign(c2.begin(), c2.end());
50 assert(static_cast<std::size_t>(distance(c1.begin(), c1.end())) == c1.size());
51 assert(c1 == c2);
58 C c1 = make<C>(N, start); local
60 test(c1, c2);
65 testI(C& c1, const C& c2)
69 c1.assign(ICI(c2.begin()), ICI(c2.end()))
78 C c1 = make<C>(N, start); local
[all...] |
| /external/libcxx/test/std/containers/sequences/deque/deque.modifiers/ |
| emplace.pass.cpp | 48 test(int P, C& c1)
51 std::size_t c1_osize = c1.size();
52 CI i = c1.emplace(c1.begin() + P, Emplaceable(1, 2.5));
53 assert(i == c1.begin() + P);
54 assert(c1.size() == c1_osize + 1);
55 assert(static_cast<std::size_t>(distance(c1.begin(), c1.end())) == c1.size());
67 C c1 = make<C>(N, start) local
75 C c1 = make<C>(N, start); local
83 C c1 = make<C>(N, start); local
[all...] |
| emplace_back.pass.cpp | 50 test(C& c1)
53 std::size_t c1_osize = c1.size();
56 Ref ref = c1.emplace_back(Emplaceable(1, 2.5));
58 c1.emplace_back(Emplaceable(1, 2.5));
60 assert(c1.size() == c1_osize + 1);
61 assert(distance(c1.begin(), c1.end())
62 == static_cast<std::ptrdiff_t>(c1.size()));
63 I i = c1.end();
74 C c1 = make<C>(N, start) local
[all...] |
| emplace_front.pass.cpp | 50 test(C& c1)
53 std::size_t c1_osize = c1.size();
56 Ref res_ref = c1.emplace_front(Emplaceable(1, 2.5));
58 c1.emplace_front(Emplaceable(1, 2.5));
60 assert(c1.size() == c1_osize + 1);
61 assert(distance(c1.begin(), c1.end())
62 == static_cast<std::ptrdiff_t>(c1.size()));
63 I i = c1.begin();
74 C c1 = make<C>(N, start) local
[all...] |
| erase_iter.pass.cpp | 46 test(int P, C& c1)
49 assert(static_cast<std::size_t>(P) < c1.size());
50 std::size_t c1_osize = c1.size();
51 I i = c1.erase(c1.cbegin() + P);
52 assert(i == c1.begin() + P);
53 assert(c1.size() == c1_osize - 1);
54 assert(static_cast<std::size_t>(distance(c1.begin(), c1.end())) == c1.size())
70 C c1 = make<C>(N, start); local
[all...] |
| erase_iter_iter.pass.cpp | 48 test(int P, C& c1, int size)
51 assert(static_cast<std::size_t>(P + size) <= c1.size());
52 std::size_t c1_osize = c1.size();
53 I i = c1.erase(c1.cbegin() + P, c1.cbegin() + (P + size));
54 assert(i == c1.begin() + P);
55 assert(c1.size() == c1_osize - size);
56 assert(static_cast<std::size_t>(distance(c1.begin(), c1.end())) == c1.size())
75 C c1 = make<C>(N, start); local
[all...] |
| insert_rvalue.pass.cpp | 48 test(int P, C& c1, int x)
51 std::size_t c1_osize = c1.size();
52 CI i = c1.insert(c1.begin() + P, MoveOnly(x));
53 assert(i == c1.begin() + P);
54 assert(c1.size() == c1_osize + 1);
55 assert(static_cast<std::size_t>(distance(c1.begin(), c1.end())) == c1.size());
56 i = c1.begin()
73 C c1 = make<C>(N, start); local
81 C c1 = make<C>(N, start); local
89 C c1 = make<C>(N, start); local
[all...] |
| insert_size_value.pass.cpp | 47 test(int P, C& c1, int size, int x)
50 std::size_t c1_osize = c1.size();
51 CI i = c1.insert(c1.begin() + P, size, x);
52 assert(i == c1.begin() + P);
53 assert(c1.size() == c1_osize + size);
54 assert(static_cast<std::size_t>(distance(c1.begin(), c1.end())) == c1.size());
55 i = c1.begin()
72 C c1 = make<C>(N, start); local
80 C c1 = make<C>(N, start); local
88 C c1 = make<C>(N, start); local
96 C c1 = make<C>(N, start); local
104 C c1 = make<C>(N, start); local
[all...] |
| insert_value.pass.cpp | 45 test(int P, C& c1, int x)
48 std::size_t c1_osize = c1.size();
49 CI i = c1.insert(c1.begin() + P, x);
50 assert(i == c1.begin() + P);
51 assert(c1.size() == c1_osize + 1);
52 assert(static_cast<std::size_t>(distance(c1.begin(), c1.end())) == c1.size());
53 i = c1.begin()
70 C c1 = make<C>(N, start); local
78 C c1 = make<C>(N, start); local
86 C c1 = make<C>(N, start); local
[all...] |
| pop_back.pass.cpp | 44 test(C& c1)
47 std::size_t c1_osize = c1.size();
48 c1.pop_back();
49 assert(c1.size() == c1_osize - 1);
50 assert(static_cast<std::size_t>(distance(c1.begin(), c1.end())) == c1.size());
51 I i = c1.begin();
52 for (int j = 0; static_cast<std::size_t>(j) < c1.size(); ++j, ++i)
62 C c1 = make<C>(N, start) local
[all...] |
| pop_front.pass.cpp | 44 test(C& c1)
47 std::size_t c1_osize = c1.size();
48 c1.pop_front();
49 assert(c1.size() == c1_osize - 1);
50 assert(static_cast<std::size_t>(distance(c1.begin(), c1.end())) == c1.size());
51 I i = c1.begin();
52 for (int j = 1; static_cast<std::size_t>(j) < c1.size(); ++j, ++i)
62 C c1 = make<C>(N, start) local
[all...] |
| push_front.pass.cpp | 44 test(C& c1, int x)
47 std::size_t c1_osize = c1.size();
48 c1.push_front(x);
49 assert(c1.size() == c1_osize + 1);
50 assert(static_cast<std::size_t>(distance(c1.begin(), c1.end())) == c1.size());
51 I i = c1.begin();
62 C c1 = make<C>(N, start); local
63 test(c1, -10)
[all...] |
