| /external/libcxx/test/numerics/numeric.ops/inner.product/ |
| inner_product.pass.cpp | 40 unsigned sa = sizeof(a) / sizeof(a[0]); local
47 test(Iter1(a), Iter1(a+sa), Iter2(b), 0, 56);
48 test(Iter1(a), Iter1(a+sa), Iter2(b), 10, 66);
|
| inner_product_comp.pass.cpp | 43 unsigned sa = sizeof(a) / sizeof(a[0]); local
50 test(Iter1(a), Iter1(a+sa), Iter2(b), 1, 117649);
51 test(Iter1(a), Iter1(a+sa), Iter2(b), 10, 1176490);
|
| /external/clang/test/Index/ |
| complete-hiding.c | 16 struct StructA sa = { }; local
|
| /external/ipsec-tools/src/racoon/ |
| sockmisc.h | 39 struct sockaddr sa; member in union:netaddr::__anon2014
42 } sa; member in struct:netaddr
|
| /external/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/ |
| partition.pass.cpp | 37 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
38 Iter r = std::partition(Iter(ia), Iter(ia + sa), is_odd());
42 for (int* i = base(r); i < ia+sa; ++i)
48 for (unsigned i = 0; i < sa; ++i)
50 r = std::partition(Iter(ia), Iter(ia+sa), is_odd());
53 for (unsigned i = 0; i < sa; ++i)
55 r = std::partition(Iter(ia), Iter(ia+sa), is_odd());
56 assert(base(r) == ia+sa);
58 for (unsigned i = 0; i < sa; ++i)
60 ia[sa-1] = 10
[all...] |
| /external/libcxx/test/algorithms/alg.modifying.operations/alg.random.shuffle/ |
| random_shuffle_rand.pass.cpp | 33 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
35 std::random_shuffle(ia, ia+sa, r);
36 assert(std::equal(ia, ia+sa, ia1));
|
| random_shuffle_urng.pass.cpp | 25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
27 std::shuffle(ia, ia+sa, g);
28 assert(std::equal(ia, ia+sa, ia1));
29 std::shuffle(ia, ia+sa, g);
30 assert(std::equal(ia, ia+sa, ia2));
|
| /external/libcxx/test/algorithms/alg.modifying.operations/alg.remove/ |
| remove.pass.cpp | 31 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
32 Iter r = std::remove(Iter(ia), Iter(ia+sa), 2);
33 assert(base(r) == ia + sa-3);
48 const unsigned sa = 9; local
49 std::unique_ptr<int> ia[sa];
56 Iter r = std::remove(Iter(ia), Iter(ia+sa), std::unique_ptr<int>());
57 assert(base(r) == ia + sa-3);
|
| remove_copy.pass.cpp | 27 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
28 int ib[sa];
29 OutIter r = std::remove_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2);
30 assert(base(r) == ib + sa-3);
|
| remove_copy_if.pass.cpp | 29 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
30 int ib[sa];
31 OutIter r = std::remove_copy_if(InIter(ia), InIter(ia+sa), OutIter(ib),
33 assert(base(r) == ib + sa-3);
|
| /external/libcxx/test/algorithms/alg.modifying.operations/alg.replace/ |
| replace_copy.pass.cpp | 30 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
31 int ib[sa] = {0};
32 OutIter r = std::replace_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2, 5);
33 assert(base(r) == ib + sa);
|
| replace_copy_if.pass.cpp | 31 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
32 int ib[sa] = {0};
33 OutIter r = std::replace_copy_if(InIter(ia), InIter(ia+sa), OutIter(ib),
35 assert(base(r) == ib + sa);
|
| /external/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/ |
| rotate_copy.pass.cpp | 26 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
27 int ib[sa] = {0};
|
| /external/libcxx/test/algorithms/alg.modifying.operations/alg.transform/ |
| binary_transform.pass.cpp | 29 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
30 int ib[sa] = {1, 2, 3, 4, 5};
31 OutIter r = std::transform(InIter1(ib), InIter1(ib+sa), InIter2(ia),
33 assert(base(r) == ib + sa);
|
| unary_transform.pass.cpp | 29 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
30 int ib[sa] = {0};
31 OutIter r = std::transform(InIter(ia), InIter(ia+sa), OutIter(ib),
33 assert(base(r) == ib + sa);
|
| /external/libcxx/test/algorithms/alg.nonmodifying/alg.find.first.of/ |
| find_first_of.pass.cpp | 25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
29 input_iterator<const int*>(ia + sa),
35 input_iterator<const int*>(ia + sa),
38 input_iterator<const int*>(ia+sa));
40 input_iterator<const int*>(ia + sa),
43 input_iterator<const int*>(ia+sa));
|
| find_first_of_pred.pass.cpp | 27 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
31 input_iterator<const int*>(ia + sa),
38 input_iterator<const int*>(ia + sa),
42 input_iterator<const int*>(ia+sa));
44 input_iterator<const int*>(ia + sa),
48 input_iterator<const int*>(ia+sa));
|
| /external/libcxx/test/algorithms/alg.sorting/alg.lex.comparison/ |
| lexicographical_compare_comp.pass.cpp | 30 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
34 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+2, c));
35 assert(std::lexicographical_compare(ib, ib+2, ia, ia+sa, c));
36 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+3, c));
37 assert(std::lexicographical_compare(ib, ib+3, ia, ia+sa, c));
38 assert(!std::lexicographical_compare(ia, ia+sa, ib+1, ib+3, c));
39 assert(std::lexicographical_compare(ib+1, ib+3, ia, ia+sa, c));
|
| /external/libcxx/test/localization/locale.categories/category.collate/locale.collate/locale.collate.members/ |
| compare.pass.cpp | 25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
28 assert(f.compare(ia, ia+sa, ib, ib+2) == 1);
29 assert(f.compare(ib, ib+2, ia, ia+sa) == -1);
30 assert(f.compare(ia, ia+sa, ib, ib+3) == 1);
31 assert(f.compare(ib, ib+3, ia, ia+sa) == -1);
32 assert(f.compare(ia, ia+sa, ib+1, ib+3) == -1);
33 assert(f.compare(ib+1, ib+3, ia, ia+sa) == 1);
38 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local
41 assert(f.compare(ia, ia+sa, ib, ib+2) == 1);
42 assert(f.compare(ib, ib+2, ia, ia+sa) == -1)
[all...] |
| /bionic/tests/ |
| netdb_test.cpp | 33 sockaddr* sa = reinterpret_cast<sockaddr*>(&ss); local
41 ASSERT_EQ(0, getnameinfo(sa, too_much, tmp, sizeof(tmp), NULL, 0, NI_NUMERICHOST));
43 ASSERT_EQ(0, getnameinfo(sa, just_right, tmp, sizeof(tmp), NULL, 0, NI_NUMERICHOST));
45 ASSERT_EQ(EAI_FAMILY, getnameinfo(sa, too_little, tmp, sizeof(tmp), NULL, 0, NI_NUMERICHOST));
52 ASSERT_EQ(0, getnameinfo(sa, too_much, tmp, sizeof(tmp), NULL, 0, NI_NUMERICHOST));
54 ASSERT_EQ(0, getnameinfo(sa, just_right, tmp, sizeof(tmp), NULL, 0, NI_NUMERICHOST));
56 ASSERT_EQ(EAI_FAMILY, getnameinfo(sa, too_little, tmp, sizeof(tmp), NULL, 0, NI_NUMERICHOST));
|
| /external/compiler-rt/lib/builtins/ |
| mulodi4.c | 41 di_int sa = a >> (N - 1); local
42 di_int abs_a = (a ^ sa) - sa;
47 if (sa == sb)
|
| mulosi4.c | 41 si_int sa = a >> (N - 1); local
42 si_int abs_a = (a ^ sa) - sa;
47 if (sa == sb)
|
| muloti4.c | 43 ti_int sa = a >> (N - 1); local
44 ti_int abs_a = (a ^ sa) - sa;
49 if (sa == sb)
|
| mulvdi3.c | 39 di_int sa = a >> (N - 1); local
40 di_int abs_a = (a ^ sa) - sa;
45 if (sa == sb)
|
| mulvsi3.c | 39 si_int sa = a >> (N - 1); local
40 si_int abs_a = (a ^ sa) - sa;
45 if (sa == sb)
|
