| /llvm-project-15.0.7/libcxx/test/std/containers/sequences/deque/deque.cons/ |
| H A D | move_alloc.pass.cpp | 27 const int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() 30 for (int* p = ab; p < an; ++p) in main() 33 for (int* p = ab; p < an; ++p) in main() 42 const int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() 45 for (int* p = ab; p < an; ++p) in main() 48 for (int* p = ab; p < an; ++p) in main() 57 const int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() 60 for (int* p = ab; p < an; ++p) in main() 63 for (int* p = ab; p < an; ++p) in main() 72 const int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() [all …]
|
| H A D | move_assign.pass.cpp | 27 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() 30 for (int* p = ab; p < an; ++p) in main() 33 for (int* p = ab; p < an; ++p) in main() 43 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() 46 for (int* p = ab; p < an; ++p) in main() 49 for (int* p = ab; p < an; ++p) in main() 59 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() 62 for (int* p = ab; p < an; ++p) in main() 65 for (int* p = ab; p < an; ++p) in main() 75 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() [all …]
|
| H A D | copy_alloc.pass.cpp | 32 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local 33 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() 34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)), in main() 38 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local 39 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() 40 test(std::deque<int, other_allocator<int> >(ab, an, other_allocator<int>(3)), in main() 45 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local 46 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() 47 test(std::deque<int, min_allocator<int> >(ab, an, min_allocator<int>()), in main()
|
| H A D | move.pass.cpp | 26 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local 27 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() 30 for (int* p = ab; p < an; ++p) in main() 33 for (int* p = ab; p < an; ++p) in main() 43 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local 44 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() 47 for (int* p = ab; p < an; ++p) in main() 50 for (int* p = ab; p < an; ++p) in main() 59 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() 62 for (int* p = ab; p < an; ++p) in main() [all …]
|
| H A D | copy.pass.cpp | 31 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local 32 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() 33 test(std::deque<int>(ab, an)); in main() 49 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local 50 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() 51 test(std::deque<int, min_allocator<int>>(ab, an)); in main()
|
| H A D | op_equal.pass.cpp | 31 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local 32 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() 33 test(std::deque<int>(ab, an)); in main() 51 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local 52 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() 53 test(std::deque<int, min_allocator<int>>(ab, an)); in main()
|
| H A D | iter_iter_alloc.pass.cpp | 43 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in basic_test() local 44 int* an = ab + sizeof(ab)/sizeof(ab[0]); in basic_test() 45 …test(cpp17_input_iterator<const int*>(ab), cpp17_input_iterator<const int*>(an), test_allocator<in… in basic_test() 46 … test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), test_allocator<int>(4)); in basic_test() 47 …test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), test_allocato… in basic_test() 48 …test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), test_allocato… in basic_test() 50 …test(cpp17_input_iterator<const int*>(ab), cpp17_input_iterator<const int*>(an), min_allocator<int… in basic_test() 51 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), min_allocator<int>()); in basic_test() 52 …test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), min_allocator… in basic_test() 53 …test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), min_allocator… in basic_test()
|
| H A D | iter_iter.pass.cpp | 56 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in basic_test() local 57 int* an = ab + sizeof(ab)/sizeof(ab[0]); in basic_test() 58 test(cpp17_input_iterator<const int*>(ab), cpp17_input_iterator<const int*>(an)); in basic_test() 59 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an)); in basic_test() 60 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an)); in basic_test() 61 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an)); in basic_test() 62 test<limited_allocator<int, 4096> >(ab, an); in basic_test() 64 test<min_allocator<int> >(ab, an); in basic_test()
|
| /llvm-project-15.0.7/llvm/test/CodeGen/BPF/ |
| H A D | objdump_imm_hex.ll | 28 ; CHECK-DEC: 18 03 00 00 cd ab cd ab 00 00 00 00 cd ab cd ab r3 = -6067004223159161907 ll 30 ; CHECK-HEX: 18 03 00 00 cd ab cd ab 00 00 00 00 cd ab cd ab r3 = -0x5432543254325433 ll 43 ; CHECK-DEC: 18 01 00 00 cd ab cd ab 00 00 00 00 cd ab 00 00 r1 = 188899839028173 ll 44 ; CHECK-HEX: 18 01 00 00 cd ab cd ab 00 00 00 00 cd ab 00 00 r1 = 0xabcdabcdabcd ll
|
| /llvm-project-15.0.7/compiler-rt/lib/builtins/ppc/ |
| H A D | gcc_qmul.c | 18 double ab, tmp, tau; in __gcc_qmul() local 20 ab = A * B; in __gcc_qmul() 23 if (ab == 0.0) { in __gcc_qmul() 24 dst.s.hi = ab; in __gcc_qmul() 29 const doublebits abBits = {.d = ab}; in __gcc_qmul() 31 dst.s.hi = ab; in __gcc_qmul() 42 tmp = LOWORDER(ab, aHi, aLo, bHi, bLo); in __gcc_qmul() 44 tau = ab + tmp; in __gcc_qmul() 46 dst.s.lo = (ab - tau) + tmp; in __gcc_qmul()
|
| /llvm-project-15.0.7/llvm/test/CodeGen/PowerPC/ |
| H A D | fma-precision.ll | 111 %ab = fmul contract reassoc double %a, %b 113 store double %ab, double* %p1 ; extra use of %ab 114 store double %ab, double* %p2 ; another extra use of %ab 116 %r = fsub contract reassoc nsz double %ab, %cd 131 %ab = fmul contract reassoc double %a, %b 133 store double %ab, double* %p1 ; extra use of %ab 136 %r = fsub contract reassoc double %ab, %cd 153 %ab = fmul contract reassoc double %a, %b 156 store double %ab, double* %p1 ; extra use of %ab 157 store double %ab, double* %p2 ; another extra use of %ab [all …]
|
| H A D | aix-xcoff-error-explicit-data-section.ll | 5 @a = global i32 3, section "ab", align 4 6 @ab = global i32 5, align 4
|
| /llvm-project-15.0.7/clang/test/Sema/ |
| H A D | string-plus-char.c | 5 const char *foo(const struct AB *ab) { in foo() argument 6 …return ab->a + 'b'; // expected-warning {{adding 'char' to a string pointer does not append to the… in foo() 23 struct AB ab; in f() local 24 …constStr = foo(&ab) + 'c'; // expected-warning {{adding 'char' to a string pointer does not append… in f()
|
| H A D | decl-in-prototype.c | 29 …struct ab { // expected-note {{previous definition is here}} expected-note {{previous definition i… struct 34 int f5(struct aA { struct ab { int j; } b; struct ab { char glorx; } glorx; } *); // expected-warni…
|
| /llvm-project-15.0.7/clang/test/CodeGenCXX/ |
| H A D | atomicinit.cpp | 40 void atomic_init_bool(_Atomic(bool) *ab, bool b) { in atomic_init_bool() argument 44 __c11_atomic_init(ab, b); in atomic_init_bool() 49 _Atomic(bool) ab; 57 AtomicBoolMember::AtomicBoolMember(bool b) : ab(b) { } in AtomicBoolMember()
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-ml/ |
| H A D | strings.asm | 19 ; Intended result: ab""cd 30 ; Intended result: ab''''cd 56 ; Intended result: ab''cd 67 ; Intended result: ab""""cd 125 mov eax, 'ab'
|
| /llvm-project-15.0.7/llvm/test/MC/Disassembler/ARC/ |
| H A D | ldst.txt | 48 # CHECK: ldb.ab %r1, [%r0,1] 51 # CHECK: stb.ab %r2, [%r0,1] 54 # CHECK: ldh.ab %r3, [%r0,12] 57 # CHECK: sth.ab %r4, [%r0,18] 60 # CHECK: ld.ab %r5, [%r2,128] 63 # CHECK: st.ab %r6, [%r2,64] 93 # CHECK: stb.di.ab %r0, [%r9,64]
|
| /llvm-project-15.0.7/lld/test/ELF/lto/ |
| H A D | comdat-nodeduplicate.ll | 13 ; RUN: ld.lld --save-temps -u foo %t/a.bc --start-lib %t/b.bc --end-lib -o %t/ab 14 ; RUN: FileCheck %s --check-prefix=RESOL_AB < %t/ab.resolution.txt 15 ; RUN: llvm-readelf -x .data %t/ab | FileCheck %s --check-prefix=DATA 37 ; RUN: ld.lld --thinlto-index-only --save-temps -u foo %t/a.bc %t/b.bc -o %t/ab 38 ; RUN: FileCheck %s --check-prefix=RESOL_AB < %t/ab.resolution.txt 40 ; RUN: ld.lld -u foo %t/a.bc %t/b.bc -o %t/ab 41 ; RUN: llvm-readelf -x .data %t/ab | FileCheck %s --check-prefix=DATA 43 …RUN: ld.lld --thinlto-index-only --save-temps -u foo %t/a.bc --start-lib %t/b.bc --end-lib -o %t/ab 44 ; RUN: FileCheck %s --check-prefix=RESOL_AB < %t/ab.resolution.txt 46 ; RUN: ld.lld -u foo %t/a.bc --start-lib %t/b.bc --end-lib -o %t/ab [all …]
|
| /llvm-project-15.0.7/llvm/test/Transforms/InstCombine/ |
| H A D | xor2.ll | 332 %ab = or i32 %a, %b 347 %ab = or i32 %a, %b 362 %ab = or i32 %b, %a 377 %ab = or i32 %b, %a 392 %ab = or i32 %a, %b 407 %ab = or i32 %a, %b 422 %ab = or i32 %b, %a 437 %ab = or i32 %b, %a 452 %ab = or i32 %a, %b 466 %ab = or i32 %a, %b [all …]
|
| /llvm-project-15.0.7/clang/test/OpenMP/ |
| H A D | declare_mapper_messages.c | 49 #pragma omp target map(mapper(ab) :vv) // expected-error {{missing… in fun() 51 #pragma omp target map(mapper(ab) :arr[0:2]) // expected-error {{missing… in fun() 65 #pragma omp target update to(mapper(ab):vv) // expected-error {{cannot … in fun() 66 #pragma omp target update to(mapper(ab):arr[0:2]) // expected-error {{cannot … in fun() 76 #pragma omp target update from(mapper(ab):vv) // expected-error {{cannot … in fun() 77 #pragma omp target update from(mapper(ab):arr[0:2]) // expected-error {{cannot … in fun()
|
| H A D | declare_mapper_messages.cpp | 76 #pragma omp target map(mapper(ab) :vv) // expected-error {{missing… in fun() 101 #pragma omp target update to(mapper(ab):vv) // expected-error {{cannot … in fun() 102 #pragma omp target update to(mapper(ab):arr[0:2]) // expected-error {{cannot … in fun() 115 #pragma omp target update from(mapper(ab):vv) // expected-error {{cannot … in fun() 116 #pragma omp target update from(mapper(ab):arr[0:2]) // expected-error {{cannot … in fun()
|
| /llvm-project-15.0.7/flang/test/Semantics/ |
| H A D | allocate06.f90 | 34 type(B(* , 5)), allocatable :: ab(:) local 47 allocate(B(*, 5):: aa, ab(2)) !OK but segfault GCC 69 allocate(B(5, 5):: ab(5)) 72 allocate(B(l, 5):: aa, ab(5))
|
| /llvm-project-15.0.7/clang/test/SemaTemplate/ |
| H A D | temp_arg_template.cpp | 131 A<B> ab; 134 ab.f(); // expected-note {{instantiation of}} 135 ab.g(); 136 ab.h();
|
| /llvm-project-15.0.7/llvm/test/DebugInfo/COFF/ |
| H A D | inlining-padding.ll | 16 ; CHECK: Name: ab 18 ; CHECK: 0000: {{.*}} 616200F1 |........ab..| 40 ; static void ab() { x++; } 45 ; ab(); 94 !21 = distinct !DISubprogram(name: "ab", scope: !7, file: !7, line: 3, type: !13, isLocal: true, is…
|
| /llvm-project-15.0.7/llvm/test/Transforms/SimpleLoopUnswitch/ |
| H A D | nontrivial-unswitch-markloopasdeleted.ll | 65 %ab.phi = phi i32 [ %a.lcssa, %loop_a_inner_exit ], [ %b.lcssa, %loop_b_inner_exit ] 69 %ab.lcssa = phi i32 [ %ab.phi, %latch ] 70 ret i32 %ab.lcssa
|