Home
last modified time | relevance | path

Searched refs:array_size (Results 1 – 25 of 34) sorted by relevance

12

/llvm-project/libcxx/test/std/localization/
H A Dcodecvt_unicode.pass.cpp42 #define array_size(x) (sizeof(x) / sizeof(x)[0]) macro
55 static_assert(array_size(input) == 11, ""); in utf8_to_utf32_in_ok()
56 static_assert(array_size(expected) == 5, ""); in utf8_to_utf32_in_ok()
58 ExternT in[array_size(input)]; in utf8_to_utf32_in_ok()
59 InternT exp[array_size(expected)]; in utf8_to_utf32_in_ok()
67 InternT out[array_size(exp) - 1] = {}; in utf8_to_utf32_in_ok()
68 assert(t.in_size <= array_size(in)); in utf8_to_utf32_in_ok()
69 assert(t.out_size <= array_size(out)); in utf8_to_utf32_in_ok()
80 if (t.out_size < array_size(out)) in utf8_to_utf32_in_ok()
91 InternT out[array_size(exp)] = {}; in utf8_to_utf32_in_ok()
[all …]
/llvm-project/libcxx/test/std/experimental/simd/simd.class/
H A Dsimd_copy.pass.cpp25 template <class T, class SimdAbi, std::size_t array_size>
29 U buffer[array_size]; in operator ()()
30 for (size_t i = 0; i < array_size; ++i) in operator ()()
38 template <class T, class SimdAbi, std::size_t array_size>
42 alignas(ex::memory_alignment_v<ex::simd<T, SimdAbi>, U>) U buffer[array_size]; in operator ()()
43 for (size_t i = 0; i < array_size; ++i) in operator ()()
51 template <class T, class SimdAbi, std::size_t array_size>
55 alignas(bit_ceil(sizeof(U) + 1)) U buffer[array_size]; in operator ()()
56 for (size_t i = 0; i < array_size; ++i) in operator ()()
68 constexpr std::size_t array_size in operator ()() local
113 constexpr std::size_t array_size = ex::simd_size_v<T, SimdAbi>; operator ()() local
[all...]
H A Dsimd_ctor_default.pass.cpp40 constexpr std::size_t array_size = ex::simd_size_v<T, SimdAbi>; in operator ()() local
41 std::array<T, array_size> expected_value; in operator ()()
42 for (size_t i = 0; i < array_size; ++i) in operator ()()
47 assert_simd_values_equal<array_size>(from_copy_ctor, expected_value); in operator ()()
56 constexpr std::size_t array_size = ex::simd_size_v<T, SimdAbi>; in operator ()() local
57 std::array<T, array_size> expected_value; in operator ()()
58 for (size_t i = 0; i < array_size; ++i) in operator ()()
63 assert_simd_values_equal<array_size>(from_move_ctor, expected_value); in operator ()()
72 constexpr std::size_t array_size = ex::simd_size_v<T, SimdAbi>; in operator ()() local
73 std::array<T, array_size> expected_value; in operator ()()
[all …]
H A Dsimd_ctor_conversion.pass.cpp22 template <class T, class SimdAbi, std::size_t array_size>
24 const std::array<T, array_size>& expected_value;
26 ConversionHelper(const std::array<T, array_size>& value) : expected_value(value) {} in ConversionHelper()
30 …onstexpr (!std::is_same_v<U, T> && std::is_same_v<SimdAbi, ex::simd_abi::fixed_size<array_size>> && in operator ()()
35 assert_simd_values_equal<array_size>(simd_from_implicit_conversion, expected_value); in operator ()()
44 constexpr std::size_t array_size = ex::simd_size_v<T, SimdAbi>; in operator ()() local
45 std::array<T, array_size> expected_value; in operator ()()
46 for (size_t i = 0; i < array_size; ++i) in operator ()()
49 types::for_each(simd_test_types(), ConversionHelper<T, SimdAbi, array_size>(expected_value)); in operator ()()
53 template <class T, class SimdAbi, std::size_t array_size>
[all …]
H A Dsimd_ctor_load.pass.cpp20 template <class T, class SimdAbi, std::size_t array_size>
24 U buffer[array_size]; in operator ()()
25 for (size_t i = 0; i < array_size; ++i) in operator ()()
32 template <class T, class SimdAbi, std::size_t array_size>
36 alignas(ex::memory_alignment_v<ex::simd<T, SimdAbi>, U>) U buffer[array_size]; in operator ()()
37 for (size_t i = 0; i < array_size; ++i) in operator ()()
44 template <class T, class SimdAbi, std::size_t array_size>
48 alignas(bit_ceil(sizeof(U) + 1)) U buffer[array_size]; in operator ()()
49 for (size_t i = 0; i < array_size; ++i) in operator ()()
60 constexpr std::size_t array_size = ex::simd_size_v<T, SimdAbi>; in operator ()() local
[all …]
H A Dsimd_ctor_broadcast.pass.cpp24 template <class T, class SimdAbi, std::size_t array_size>
26 const std::array<T, array_size>& expected_value;
28 BroadCastHelper(const std::array<T, array_size>& value) : expected_value(value) {} in operator ()()
34 assert_simd_values_equal<array_size>(simd_broadcast_from_vectorizable_type, expected_value);
43 constexpr std::size_t array_size = ex::simd_size_v<T, SimdAbi>; in operator ()()
44 std::array<T, array_size> expected_value; in operator ()()
47 types::for_each(simd_test_types(), BroadCastHelper<T, SimdAbi, array_size>(expected_value));
64 constexpr std::size_t array_size = ex::simd_size_v<T, SimdAbi>; in operator ()()
65 std::array<T, array_size> expected_value; in operator ()()
70 assert_simd_values_equal<array_size>(simd_broadcast_from_implicit_typ in operator ()()
40 constexpr std::size_t array_size = ex::simd_size_v<T, SimdAbi>; operator ()() local
61 constexpr std::size_t array_size = ex::simd_size_v<T, SimdAbi>; operator ()() local
[all...]
H A Dsimd_ctor_generator.pass.cpp27 constexpr size_t array_size = origin_simd.size(); in operator ()() local
28 std::array<T, array_size> expected_value; in operator ()()
29 for (size_t i = 0; i < array_size; ++i) in operator ()()
31 assert_simd_values_equal<array_size>(origin_simd, expected_value); in operator ()()
/llvm-project/libcxx/test/std/experimental/simd/simd.mask.class/
H A Dsimd_mask_ctor_default.pass.cpp39 constexpr std::size_t array_size = ex::simd_size_v<T, SimdAbi>; in operator ()() local
40 std::array<bool, array_size> expected_value; in operator ()()
41 for (size_t i = 0; i < array_size; ++i) { in operator ()()
50 assert_simd_mask_values_equal<array_size>(from_copy_ctor, expected_value); in operator ()()
59 constexpr std::size_t array_size = ex::simd_size_v<T, SimdAbi>; in operator ()() local
60 std::array<bool, array_size> expected_value; in operator ()()
61 for (size_t i = 0; i < array_size; ++i) { in operator ()()
70 assert_simd_mask_values_equal<array_size>(from_move_ctor, expected_value); in operator ()()
79 constexpr std::size_t array_size = ex::simd_size_v<T, SimdAbi>; in operator ()() local
80 std::array<bool, array_size> expected_value; in operator ()()
[all …]
H A Dsimd_mask_ctor_conversion.pass.cpp21 template <class T, class SimdAbi, std::size_t array_size>
23 const std::array<bool, array_size>& expected_value;
25 ConversionHelper(const std::array<bool, array_size>& value) : expected_value(value) {} in ConversionHelper()
29 …onstexpr (!std::is_same_v<U, T> && std::is_same_v<SimdAbi, ex::simd_abi::fixed_size<array_size>>) { in operator ()()
33 assert_simd_mask_values_equal<array_size>(mask_from_implicit_conversion, expected_value); in operator ()()
42 constexpr std::size_t array_size = ex::simd_size_v<T, SimdAbi>; in operator ()() local
43 std::array<bool, array_size> expected_value{}; in operator ()()
45 types::for_each(simd_test_types(), ConversionHelper<T, SimdAbi, array_size>(expected_value)); in operator ()()
49 template <class T, class SimdAbi, std::size_t array_size>
54 if constexpr (std::is_same_v<SimdAbi, ex::simd_abi::fixed_size<array_size>>) in operator ()()
[all …]
H A Dsimd_mask_copy.pass.cpp25 constexpr std::size_t array_size = ex::simd_size_v<T, SimdAbi>; in operator ()() local
29 alignas(element_alignas_size) bool element_buffer[array_size]; in operator ()()
30 for (size_t i = 0; i < array_size; ++i) in operator ()()
38 alignas(vector_alignas_size) bool vector_buffer[array_size]; in operator ()()
39 for (size_t i = 0; i < array_size; ++i) in operator ()()
47 alignas(over_alignas_size) bool overaligned_buffer[array_size]; in operator ()()
48 for (size_t i = 0; i < array_size; ++i) in operator ()()
60 constexpr std::size_t array_size = ex::simd_size_v<T, SimdAbi>; in operator ()() local
64 alignas(element_alignas_size) bool element_buffer[array_size]; in operator ()()
71 alignas(vector_alignas_size) bool vector_buffer[array_size]; in operator ()()
[all …]
H A Dsimd_mask_ctor_load.pass.cpp24 constexpr std::size_t array_size = ex::simd_size_v<T, SimdAbi>; in operator ()() local
27 bool element_buffer[array_size]; in operator ()()
28 for (size_t i = 0; i < array_size; ++i) in operator ()()
34 alignas(ex::memory_alignment_v<ex::simd_mask<T, SimdAbi>>) bool vector_buffer[array_size]; in operator ()()
35 for (size_t i = 0; i < array_size; ++i) in operator ()()
41 alignas(bit_ceil(sizeof(bool) + 1)) bool overaligned_buffer[array_size]; in operator ()()
42 for (size_t i = 0; i < array_size; ++i) in operator ()()
H A Dsimd_mask_ctor_broadcast.pass.cpp25 constexpr size_t array_size = ex::simd_size_v<T, SimdAbi>; in operator ()() local
27 const std::array<bool, array_size> expected_value{}; in operator ()()
/llvm-project/compiler-rt/test/sanitizer_common/TestCases/Posix/
H A Dbsearch.cpp13 #define array_size(x) (sizeof(x) / sizeof(x[0])) macro
21 (const int *)bsearch(a, arr1, array_size(arr1), sizeof(int), &cmp_ints); in cmp_pos()
23 ap = arr1 + array_size(arr1); in cmp_pos()
25 (const int *)bsearch(b, arr1, array_size(arr1), sizeof(int), &cmp_ints); in cmp_pos()
27 bp = arr1 + array_size(arr1); in cmp_pos()
35 bsearch(&i, arr1, array_size(arr1), sizeof(arr1[0]), &cmp_ints); in main()
47 bsearch(&i, arr2, array_size(arr2), sizeof(arr2[0]), &cmp_pos); in main()
H A Drecursion-in-qsort.cpp13 #define array_size(x) (sizeof(x) / sizeof(x[0])) macro
21 qsort(global_array, array_size(global_array), sizeof(int), &ascending_compare_ints); in descending_compare_ints()
31 qsort(&f1->array, array_size(f1->array), sizeof(int), &descending_compare_ints); in sort_and_compare()
32 qsort(&f2->array, array_size(f2->array), sizeof(int), &descending_compare_ints); in sort_and_compare()
59 qsort(qsortArg, array_size(qsortArg), sizeof(qsortArg[0]), &sort_and_compare); in main()
/llvm-project/libc/src/stdlib/
H A Dbsearch.cpp18 (const void *key, const void *array, size_t array_size,
21 if (key == nullptr || array == nullptr || array_size == 0 || elem_size == 0)
24 while (array_size > 0) {
25 size_t mid = array_size / 2;
36 array_size = mid;
38 // |mid| is strictly less than |array_size|. So, the below
39 // decrement in |array_size| will not lead to a wrap around.
40 array_size -= (mid + 1);
H A Dqsort_util.h61 size_t array_size; global() variable
98 const size_t array_size = array.size(); partition() local
138 const size_t array_size = array.size(); quicksort() local
H A Dqsort.cpp19 (void *array, size_t array_size, size_t elem_size,
26 internal::unstable_sort(array, array_size, elem_size, is_less);
H A Dqsort_r.cpp19 (void *array, size_t array_size, size_t elem_size,
27 internal::unstable_sort(array, array_size, elem_size, is_less);
H A Dqsort.h17 void qsort(void *array, size_t array_size, size_t elem_size,
H A Dbsearch.h17 void *bsearch(const void *key, const void *array, size_t array_size,
/llvm-project/libc/fuzzing/stdlib/
H A Dqsort_fuzz.cpp
/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/
H A Dsort.pass.cpp183 static const int array_size = 10; in test_pointer_sort()
184 const int v[array_size] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; in test_pointer_sort()
185 const int *pv[array_size]; in test_pointer_sort()
186 for (int i = 0; i < array_size; i++) { in test_pointer_sort()
187 pv[i] = &v[array_size - 1 - i]; in test_pointer_sort()
189 std::sort(pv, pv + array_size); in test_pointer_sort()
192 assert(*pv[array_size - 1] == v[array_size - 1]); in test_pointer_sort()
182 static const int array_size = 10; test_pointer_sort() local
/llvm-project/clang/test/Index/
H A Dindex-refs.cpp58 const int array_size = 3; variable
59 typedef int some_arr[array_size];
/llvm-project/lldb/test/API/functionalities/data-formatter/data-formatter-synth/
H A Dmain.cpp46 int array_size; member
52 array_size(N), in Plenty()
/llvm-project/lldb/test/API/commands/watchpoints/watchpoint_size/
H A DTestWatchpointSizes.py47 def run_watchpoint_size_test(self, arrayName, array_size, watchsize): argument
65 for i in range(array_size):

12