Home
last modified time | relevance | path

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

/llvm-project-15.0.7/libc/src/stdlib/
H A Dqsort.cpp24 size_t array_size; member in __llvm_libc::internal::Array
30 : array(a), array_size(s), elem_size(e), compare(c) {} in Array()
52 size_t size() const { return array_size; } in size()
61 const size_t array_size = array.size(); in partition() local
62 size_t pivot_index = array_size / 2; in partition()
65 size_t j = array_size - 1; in partition()
101 const size_t array_size = array.size(); in quicksort() local
102 if (array_size <= 1) in quicksort()
105 if (array_size <= 2) { in quicksort()
116 (void *array, size_t array_size, size_t elem_size,
[all …]
H A Dbsearch.cpp17 (const void *key, const void *array, size_t array_size,
20 if (key == nullptr || array == nullptr || array_size == 0 || elem_size == 0)
23 while (array_size > 0) {
24 size_t mid = array_size / 2;
35 array_size = mid;
39 array_size -= (mid + 1);
H A Dbsearch.h13 void *bsearch(const void *key, const void *array, size_t array_size,
H A Dqsort.h16 void qsort(void *array, size_t array_size, size_t elem_size,
/llvm-project-15.0.7/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-15.0.7/libc/fuzzing/stdlib/
H A Dqsort_fuzz.cpp28 const size_t array_size = size / sizeof(int); in LLVMFuzzerTestOneInput() local
29 if (array_size == 0) in LLVMFuzzerTestOneInput()
32 int *array = new int[array_size]; in LLVMFuzzerTestOneInput()
34 for (size_t i = 0; i < array_size; ++i) in LLVMFuzzerTestOneInput()
37 __llvm_libc::qsort(array, array_size, sizeof(int), int_compare); in LLVMFuzzerTestOneInput()
39 for (size_t i = 0; i < array_size - 1; ++i) { in LLVMFuzzerTestOneInput()
/llvm-project-15.0.7/libc/src/__support/CPP/
H A Dvector.h27 size_t array_size; variable
34 constexpr vector<T>() : array_size{DEFAULT_SIZE} {
47 if (new_size >= array_size) in reserve()
52 if (num_elements >= array_size) in push_back()
67 constexpr size_t capacity() const { return array_size; } in capacity()
76 size_t temp_size = array_size; in increase_size()
85 array_size = temp_size; in increase_size()
86 data_array = static_cast<T *>(realloc(data_array, array_size * sizeof(T))); in increase_size()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/
H A Dsort.pass.cpp178 static const int array_size = 10; in test_pointer_sort() local
179 const int v[array_size] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; in test_pointer_sort()
180 const int *pv[array_size]; in test_pointer_sort()
181 for (int i = 0; i < array_size; i++) { in test_pointer_sort()
182 pv[i] = &v[array_size - 1 - i]; in test_pointer_sort()
184 std::sort(pv, pv + array_size); in test_pointer_sort()
187 assert(*pv[array_size - 1] == v[array_size - 1]); in test_pointer_sort()
/llvm-project-15.0.7/clang/test/Index/
H A Dindex-refs.cpp58 const int array_size = 3; variable
59 typedef int some_arr[array_size];
/llvm-project-15.0.7/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-15.0.7/lldb/test/API/commands/watchpoints/watchpoint_size/
H A DTestWatchpointSizes.py47 def run_watchpoint_size_test(self, arrayName, array_size, watchsize): argument
64 for i in range(array_size):
/llvm-project-15.0.7/lldb/source/DataFormatters/
H A DFormatManager.cpp237 uint64_t array_size; in GetPossibleMatches() local
238 if (compiler_type.IsArrayType(nullptr, &array_size, nullptr)) { in GetPossibleMatches()
246 element_type.GetTypedefedType().GetArrayType(array_size); in GetPossibleMatches()
/llvm-project-15.0.7/llvm/lib/Target/AMDGPU/
H A DR600InstrFormats.td487 bits<12> array_size;
496 let Word1{11-0} = array_size;
H A DR600Instructions.td228 let array_size = 0;
/llvm-project-15.0.7/lldb/source/Plugins/LanguageRuntime/RenderScript/RenderScriptRuntime/
H A DRenderScriptRuntime.cpp577 array_size; // Number of items in array, only needed for structs member
632 uint32_t array_size; // Number of elements in array member
2071 child.array_size = static_cast<uint32_t>(results); in JITSubelements()
2321 const uint32_t array_size = in SetElementSize() local
2322 child.array_size.isValid() ? *child.array_size.get() : 1; in SetElementSize()
2323 data_size += *child.datum_size.get() * array_size; in SetElementSize()
2569 elem_header.array_size = in PopulateElementHeaders()
2570 elem.array_size.isValid() ? *elem.array_size.get() : 0; in PopulateElementHeaders()
/llvm-project-15.0.7/lldb/source/Core/
H A DValueObject.cpp894 uint64_t array_size = 0; in ReadPointedString() local
895 if (compiler_type.IsArrayType(nullptr, &array_size)) { in ReadPointedString()
896 cstr_len = array_size; in ReadPointedString()
/llvm-project-15.0.7/clang/test/SemaCXX/
H A Dconstant-expression-cxx11.cpp2349 namespace array_size { namespace
/llvm-project-15.0.7/llvm/lib/Target/NVPTX/
H A DNVPTXIntrinsics.td4293 "txq.array_size.b32 \t$d, [$a];",
4297 "txq.array_size.b32 \t$d, [$a];",
4382 "suq.array_size.b32 \t$d, [$a];",
4386 "suq.array_size.b32 \t$d, [$a];",