Home
last modified time | relevance | path

Searched refs:arr (Results 1 – 25 of 805) sorted by relevance

12345678910>>...33

/llvm-project-15.0.7/clang/test/Analysis/
H A Dctor-array.cpp13 s arr[3]; in a1() local
19 s arr[3]; in a2() local
25 s arr[3]; in a3() local
36 s2 arr[3]; in b1() local
44 s2 arr[3]; in b2() local
52 s2 arr[3]; in b3() local
61 s2 arr[2]; in c1() local
69 s2 arr[2]; in c1() local
83 s3 arr[2]; member
88 s4 arr[2]; in e1() local
[all …]
H A Darray-init-loop.cpp28 auto l = [arr] { return arr[0]; }(); in lambda_init()
31 l = [arr] { return arr[1]; }(); in lambda_init()
34 l = [arr] { return arr[2]; }(); in lambda_init()
37 l = [arr] { return arr[3]; }(); in lambda_init()
40 l = [arr] { return arr[4]; }(); in lambda_init()
48 int l = [arr] { return arr[0]; }(); in lambda_uninit()
51 l = [arr] { return arr[1]; }(); in lambda_uninit()
54 l = [arr] { return arr[2]; }(); in lambda_uninit()
57 l = [arr] { return arr[3]; }(); in lambda_uninit()
60 l = [arr] { return arr[4]; }(); in lambda_uninit()
[all …]
H A Duninit-structured-binding-array.cpp6 int arr[2]; in array_value_a() local
8 arr[0] = 0; in array_value_a()
24 int arr[3]; in array_value_c() local
26 arr[1] = 1; in array_value_c()
37 int arr[3]; in array_value_d() local
39 arr[1] = 1; in array_value_d()
79 int arr[2]; in array_lref_a() local
95 int arr[2]; in array_lref_c() local
98 arr[0] = 1; in array_lref_c()
302 S arr[2]; in non_pod_val() local
[all …]
H A Dosobject-retain-release.cpp353 arr->retain(); in check_free_no_error()
354 arr->retain(); in check_free_no_error()
355 arr->retain(); in check_free_no_error()
356 arr->free(); in check_free_no_error()
410 OSArray *arr; member
411 ArrayOwner(OSArray *arr) : arr(arr) {} in ArrayOwner()
418 return arr; in getArray()
460 arr->release(); in check_confusing_getters()
474 (void)arr; in check_rc_getter()
507 if (arr) { in check_dynamic_cast_no_null_on_orig()
[all …]
H A Dreturn-ptr-range.cpp7 int arr[10]; // expected-note{{Original object declared here}} expected-note{{Original object decla… variable
13 ptr = arr + x; // expected-note{{Value assigned to 'ptr'}} in test_global_ptr()
16 return arr; // no-warning in test_global_ptr()
27 local_ptr = arr + x; // expected-note{{Value assigned to 'local_ptr'}} in test_local_ptr()
30 return arr; // no-warning in test_local_ptr()
40 T* end(T (&arr)[N]) { in end()
45 static int arr[10]; in get_end_of_array() local
46 end(arr); in get_end_of_array()
87 …static int arr[10]; // expected-note{{Original object declared here}} expected-note{{'arr' initial… in test_idx_sym() local
91 return arr; in test_idx_sym()
[all …]
/llvm-project-15.0.7/libcxx/test/libcxx/diagnostics/
H A Dnodiscard_extensions.pass.cpp57 std::equal(std::begin(arr), std::end(arr), std::begin(arr), in test_algorithms()
60 std::equal(std::begin(arr), std::end(arr), std::begin(arr), std::end(arr)); in test_algorithms()
61 std::equal(std::begin(arr), std::end(arr), std::begin(arr), std::end(arr), in test_algorithms()
64 std::find_end(std::begin(arr), std::end(arr), std::begin(arr), std::end(arr)); in test_algorithms()
65 std::find_end(std::begin(arr), std::end(arr), std::begin(arr), std::end(arr), in test_algorithms()
75 std::includes(std::begin(arr), std::end(arr), std::begin(arr), std::end(arr)); in test_algorithms()
76 std::includes(std::begin(arr), std::end(arr), std::begin(arr), std::end(arr), in test_algorithms()
130 std::mismatch(std::begin(arr), std::end(arr), std::begin(arr), std::end(arr)); in test_algorithms()
131 std::mismatch(std::begin(arr), std::end(arr), std::begin(arr), std::end(arr), in test_algorithms()
139 std::search(std::begin(arr), std::end(arr), std::begin(arr), std::end(arr)); in test_algorithms()
[all …]
H A Dnodiscard_extensions.verify.cpp80 std::equal(std::begin(arr), std::end(arr), std::begin(arr), in test_algorithms()
85 std::equal(std::begin(arr), std::end(arr), std::begin(arr), std::end(arr)); in test_algorithms()
88 std::equal(std::begin(arr), std::end(arr), std::begin(arr), std::end(arr), in test_algorithms()
93 std::find_end(std::begin(arr), std::end(arr), std::begin(arr), std::end(arr)); in test_algorithms()
96 std::find_end(std::begin(arr), std::end(arr), std::begin(arr), std::end(arr), in test_algorithms()
120 std::includes(std::begin(arr), std::end(arr), std::begin(arr), std::end(arr)); in test_algorithms()
123 std::includes(std::begin(arr), std::end(arr), std::begin(arr), std::end(arr), in test_algorithms()
247 std::mismatch(std::begin(arr), std::end(arr), std::begin(arr), std::end(arr)); in test_algorithms()
250 std::mismatch(std::begin(arr), std::end(arr), std::begin(arr), std::end(arr), in test_algorithms()
270 std::search(std::begin(arr), std::end(arr), std::begin(arr), std::end(arr)); in test_algorithms()
[all …]
/llvm-project-15.0.7/libcxx/test/std/containers/sequences/array/array.creation/
H A Dto_array.pass.cpp32 assert(arr[0] == 1); in tests()
33 assert(arr[1] == 2); in tests()
34 assert(arr[2] == 3); in tests()
42 assert(arr[0] == 1); in tests()
43 assert(arr[1] == 4); in tests()
44 assert(arr[2] == 9); in tests()
45 assert(arr[3] == l1); in tests()
90 assert(arr[0] == 3); in tests()
91 assert(arr[1] == 4); in tests()
99 assert(arr[0] == 1); in tests()
[all …]
/llvm-project-15.0.7/clang/test/SemaCXX/
H A Dtype-traits.cpp213 { int arr[T(__is_pod(int))]; } in is_pod() local
214 { int arr[T(__is_pod(Enum))]; } in is_pod() local
215 { int arr[T(__is_pod(POD))]; } in is_pod() local
216 { int arr[T(__is_pod(Int))]; } in is_pod() local
217 { int arr[T(__is_pod(IntAr))]; } in is_pod() local
219 { int arr[T(__is_pod(Empty))]; } in is_pod() local
255 { int arr[F(__is_pod(void))]; } in is_pod() local
351 { int arr[F(__is_enum(int))]; } in is_enum() local
353 { int arr[F(__is_enum(Int))]; } in is_enum() local
396 { int arr[F(__is_final(int))]; } in is_final() local
[all …]
H A Darray-bounds.cpp77 char arr[I]; // expected-note 3 {{declared here}} member
90 #define ARR_IN_MACRO(flag, arr, idx) flag ? arr[idx] : 1 argument
108 int arr[3 + (extendArray ? 1 : 0)]; in pr9284() local
111 arr[3] = 42; // no-warning in pr9284()
137 return sizeof(char) != sizeof(char) ? arr[2] : arr[1]; in test_sizeof_as_condition()
144 int arr[2]; in test_switch() local
145 arr[2] = 1; // no-warning in test_switch()
154 int arr[2]; in test_switch() local
155 arr[2] = 1; // no-warning in test_switch()
284 int arr[4]; member
[all …]
H A Dconstexpr-string.cpp499 return arr[0] * 1000 + arr[1] * 100 + arr[2] * 10 + arr[3];
504 __builtin_memcpy(arr + a, arr + b, n);
513 __builtin_memmove(arr + a, arr + b, n);
594 return arr[0].ok() && arr[1].ok() && arr[2].ok();
633 return arr[0].a * 1000 + arr[0].b * 100 + arr[1].a * 10 + arr[1].b;
646 __builtin_memmove(&arr, &arr, sizeof(arr));
647 return arr[0] * 1000 + arr[1] * 100 + arr[2] * 10 + arr[3];
654 __builtin_memmove(arr, arr, 4 * sizeof(arr[0]));
656 return arr[0] * 1000 + arr[1] * 100 + arr[2] * 10 + arr[3];
663 __builtin_memmove(&arr, &arr, 4 * sizeof(arr[0]));
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/AArch64/
H A Daarch64-minmaxv.ll25 %arr.load = load <16 x i8>, <16 x i8>* %arr
33 %arr.load = load <8 x i16>, <8 x i16>* %arr
41 %arr.load = load <4 x i32>, <4 x i32>* %arr
49 %arr.load = load <16 x i8>, <16 x i8>* %arr
57 %arr.load = load <8 x i16>, <8 x i16>* %arr
65 %arr.load = load <4 x i32>, <4 x i32>* %arr
73 %arr.load = load <16 x i8>, <16 x i8>* %arr
81 %arr.load = load <8 x i16>, <8 x i16>* %arr
89 %arr.load = load <4 x i32>, <4 x i32>* %arr
97 %arr.load = load <16 x i8>, <16 x i8>* %arr
[all …]
/llvm-project-15.0.7/clang/test/CodeGen/
H A Dalloc-size.c38 void *const arr = my_calloc(100, 5); in test1() local
40 gi = OBJECT_SIZE_BUILTIN(arr, 0); in test1()
42 gi = OBJECT_SIZE_BUILTIN(arr, 1); in test1()
44 gi = OBJECT_SIZE_BUILTIN(arr, 2); in test1()
46 gi = OBJECT_SIZE_BUILTIN(arr, 3); in test1()
142 gi = OBJECT_SIZE_BUILTIN(arr, 0); in test5()
144 gi = OBJECT_SIZE_BUILTIN(arr, 1); in test5()
146 gi = OBJECT_SIZE_BUILTIN(arr, 2); in test5()
148 gi = OBJECT_SIZE_BUILTIN(arr, 3); in test5()
174 struct Data *const arr = my_calloc(sizeof(*arr) + 5, 3); in test6() local
[all …]
H A Dubsan-pointer-overflow.c23 int arr[10][10]; in fixed_len_array() local
24 arr[k][k]; in fixed_len_array()
37 int arr[n][n]; in variable_len_array() local
38 arr[k][k]; in variable_len_array()
49 arr[k][k]; in pointer_array()
60 arr[k][k]; in pointer_array_unsigned_indices()
69 arr[i][j]; in pointer_array_mixed_indices()
78 struct S1 *arr; member
94 p->arr[10].u.link->u.leaf; in struct_index()
118 int arr[10][10]; in dont_emit_checks_for_no_op_GEPs() local
[all …]
/llvm-project-15.0.7/openmp/libomptarget/test/mapping/
H A Ddeclare_mapper_nested_default_mappers_complex_structure.cpp45 arr[i].foo(); in foo()
47 MyObjectA *arr; member in MyObjectB
67 MyObjectB *arr; member in MyObjectC
101 outer[i].arr[j].arr[k].data1); in main()
103 outer[i].arr[j].arr[k].data2); in main()
104 assert(outer[i].arr[j].arr[k].data1 == 11 && in main()
105 outer[i].arr[j].arr[k].data2 == 22); in main()
123 assert(outer[1].arr[1].arr[0].data1 == 11 && in main()
124 outer[1].arr[1].arr[0].data2 == 22 && in main()
125 outer[1].arr[1].arr[1].data1 == 11 && in main()
[all …]
H A Dtarget_data_array_extension_at_exit.c47 int arr[SIZE]; in check_not_present() local
50 arr[i] = 99; in check_not_present()
61 #pragma omp target map(alloc: arr[SMALL]) in check_not_present()
63 arr[i] = 88; in check_not_present()
69 if (arr[i] != 99) in check_not_present()
75 int arr[SIZE]; in check_is_present() local
78 arr[i] = 99; in check_is_present()
90 #pragma omp target map(alloc: arr[LARGE]) in check_is_present()
92 arr[i] = 88; in check_is_present()
99 if (arr[i] != 88) in check_is_present()
[all …]
/llvm-project-15.0.7/flang/test/Semantics/
H A Dselect-rank02.f9010 subroutine check(arr) argument
12 integer :: arr(..) local
14 select rank (arr)
19 subroutine check2(arr) argument
21 integer :: arr(..) local
25 select rank (arr)
30 subroutine checK3(arr) argument
32 integer :: arr(..) local
37 select rank (arr)
49 select rank (arr)
[all …]
/llvm-project-15.0.7/libcxx/test/std/containers/views/views.span/span.cons/
H A Ddeduct.pass.cpp38 int arr[] = {1, 2, 3}; in test_iterator_sentinel() local
40 std::span s{std::begin(arr), std::end(arr)}; in test_iterator_sentinel()
46 std::span s{std::begin(arr), 3}; in test_iterator_sentinel()
55 int arr[] = {1, 2, 3}; in test_c_array() local
56 std::span s{arr}; in test_c_array()
63 const int arr[] = {1,2,3}; in test_c_array() local
64 std::span s{arr}; in test_c_array()
74 std::span s{arr}; in test_std_array()
76 assert(s.size() == arr.size()); in test_std_array()
77 assert(s.data() == arr.data()); in test_std_array()
[all …]
/llvm-project-15.0.7/libcxx/test/std/containers/sequences/array/array.cons/
H A Ddeduct.pass.cpp27 std::array arr{1,2,3}; // array(T, U...) in tests() local
29 assert(arr[0] == 1); in tests()
30 assert(arr[1] == 2); in tests()
31 assert(arr[2] == 3); in tests()
38 static_assert(arr.size() == 4, ""); in tests()
39 assert(arr[0] == 1); in tests()
40 assert(arr[1] == 4); in tests()
41 assert(arr[2] == 9); in tests()
42 assert(arr[3] == l1); in tests()
51 assert(arr[0] == 4.0); in tests()
[all …]
/llvm-project-15.0.7/flang/test/Evaluate/
H A Dfolding24.f904 integer, parameter :: arr(2,3) = reshape([1, 2, 3, 4, 5, 6], shape(arr)) variable
5 logical, parameter :: odds(*,*) = modulo(arr, 2) /= 0
7 logical, parameter :: test_pack_1 = all(pack(arr, .true.) == [arr])
8 logical, parameter :: test_pack_2 = all(pack(arr, .false.) == [integer::])
9 logical, parameter :: test_pack_3 = all(pack(arr, odds) == [1, 3, 5])
10 logical, parameter :: test_pack_4 = all(pack(arr, .not. odds) == [2, 4, 6])
11 …logical, parameter :: test_pack_5 = all(pack(arr, .true., vect) == [1, 2, 3, 4, 5, 6, -4, -3, -2, …
12 logical, parameter :: test_pack_6 = all(pack(arr, .false., vect) == vect)
13 …logical, parameter :: test_pack_7 = all(pack(arr, odds, vect) == [1, 3, 5, -7, -6, -5, -4, -3, -2,…
14 …logical, parameter :: test_pack_8 = all(pack(arr, .not. odds, vect) == [2, 4, 6, -7, -6, -5, -4, -…
H A Dfolding29.f904 logical, parameter :: arr(3,4) = reshape([(modulo(j, 2) == 1, j = 1, size(arr))], shape(arr)) variable
6 logical, parameter :: test_2 = count(arr) == 6
7 logical, parameter :: test_3 = all(count(arr, dim=1) == [2, 1, 2, 1])
8 logical, parameter :: test_4 = all(count(arr, dim=2) == [2, 2, 2])
9 logical, parameter :: test_5 = count(logical(arr, kind=1)) == 6
10 logical, parameter :: test_6 = count(logical(arr, kind=2)) == 6
/llvm-project-15.0.7/llvm/test/Transforms/SLPVectorizer/X86/
H A Dhorizontal-smax.ll6 @arr = local_unnamed_addr global [32 x i32] zeroinitializer, align 16
17 %2 = load i32, i32* getelementptr inbounds ([32 x i32], [32 x i32]* @arr, i64 0, i64 0), align 16
18 %3 = load i32, i32* getelementptr inbounds ([32 x i32], [32 x i32]* @arr, i64 0, i64 1), align 4
39 %2 = load i32, i32* getelementptr inbounds ([32 x i32], [32 x i32]* @arr, i64 0, i64 0), align 16
40 %3 = load i32, i32* getelementptr inbounds ([32 x i32], [32 x i32]* @arr, i64 0, i64 1), align 4
41 %4 = load i32, i32* getelementptr inbounds ([32 x i32], [32 x i32]* @arr, i64 0, i64 2), align 8
42 %5 = load i32, i32* getelementptr inbounds ([32 x i32], [32 x i32]* @arr, i64 0, i64 3), align 4
74 %3 = load i32, i32* getelementptr inbounds ([32 x i32], [32 x i32]* @arr, i64 0, i64 1), align 4
75 %4 = load i32, i32* getelementptr inbounds ([32 x i32], [32 x i32]* @arr, i64 0, i64 2), align 8
76 %5 = load i32, i32* getelementptr inbounds ([32 x i32], [32 x i32]* @arr, i64 0, i64 3), align 4
[all …]
/llvm-project-15.0.7/clang/test/CodeGen/avr/
H A Dargument.c39 char arr[15]; member
42 return a.arr[b] + a.arr[c]; in foo3()
52 return a.arr[c]; in foo4()
70 char arr[32]; member
73 return a.arr[b]; in foo6()
82 return a.arr[b]; in foo7()
92 a.arr[0] = b; in foo8()
103 x.arr[0] = b; in foo9()
113 x.arr[0] = a; in fooa()
114 x.arr[1] = b; in fooa()
/llvm-project-15.0.7/clang/test/Sema/
H A Ddiv-sizeof-array.cpp12 int arr[12]; // expected-note 2 {{array 'arr' declared here}} in test() local
14 int *p = &arr[0]; in test()
15 int a1 = sizeof(arr) / sizeof(*arr); in test()
16 …int a2 = sizeof arr / sizeof p; // expected-warning {{expression does not compute the number of el… in test()
19 …int a5 = sizeof(arr) / sizeof(short); // expected-warning {{expression does not compute the number… in test()
21 int a6 = sizeof(arr) / sizeof(int32); in test()
22 int a7 = sizeof(arr) / sizeof(int); in test()
23 int a9 = sizeof(arr) / sizeof(unsigned int); in test()
27 int a12 = sizeof(arr) / (sizeof(short)); in test()
/llvm-project-15.0.7/clang-tools-extra/test/clang-tidy/checkers/bugprone/
H A Dinfinite-loop.mm50 NSArray *arr = [[NSArray alloc] init];
52 while ([arr count] < max_count) {
54 [arr addObject: [[I alloc] init]];
60 while ([arr count] < 10) {
62 [arr addObject: [[I alloc] init]];
69 while (arr.count < max_count) {
71 [arr addObject: [[I alloc] init]];
77 while (arr.count < 10) {
79 [arr addObject: [[I alloc] init]];
113 while (arr->_count < max_count) {
[all …]

12345678910>>...33