| /llvm-project/llvm/test/Object/ |
| H A D | nm-darwin-m.test | 5 RUN: llvm-nm -m %p/Inputs/darwin-m-test3.macho-x86-64 \ 6 RUN: | FileCheck %s -check-prefix test3 20 # This is testing is using darwin-m-test3.macho-x86-64 that is linked with 40 test3: 0000000100000000 (__TEXT,__text) [referenced dynamically] external __mh_execute_header 41 test3: (undefined) external _atsPathVersSuffix (from libPathATS) 42 test3: (undefined) external _atsVersSuffix (from libATS) 43 test3: (undefined) external _foo (from Foo) 44 test3: (undefined) external _fooPath (from FooPath) 45 test3: (undefined) external _fooPathSuffix (from FooPathSuffix) 46 test3: (undefined) external _fooPathVers (from FooPathVers) [all …]
|
| /llvm-project/libcxx/test/std/strings/basic.string/string.nonmembers/string_op+/ |
| H A D | string_string.pass.cpp | 57 TEST_CONSTEXPR_CXX20 void test3(S&& lhs, S&& rhs, const S& x) { in test3() function 115 test3(S(""), S(""), S("")); in test_string() 116 test3(S(""), S("12345"), S("12345")); in test_string() 117 test3(S(""), S("1234567890"), S("1234567890")); in test_string() 118 test3(S(""), S("12345678901234567890"), S("12345678901234567890")); in test_string() 119 test3(S("abcde"), S(""), S("abcde")); in test_string() 120 test3(S("abcde"), S("12345"), S("abcde12345")); in test_string() 121 test3(S("abcde"), S("1234567890"), S("abcde1234567890")); in test_string() 122 test3(S("abcde"), S("12345678901234567890"), S("abcde12345678901234567890")); in test_string() 123 test3(S("abcdefghij"), S(""), S("abcdefghij")); in test_string() [all …]
|
| /llvm-project/llvm/test/CodeGen/X86/ |
| H A D | asm-modifier-P.ll | 45 define void @test3() nounwind { 47 ; CHECK-STATIC-64-LABEL: test3: 49 ; CHECK-STATIC-64: call test3 51 ; CHECK-STATIC-64: call $test3 53 ; CHECK-STATIC-32-LABEL: test3: 55 ; CHECK-STATIC-32: call test3 57 ; CHECK-STATIC-32: call $test3 59 ; CHECK-PIC-64-LABEL: test3: 61 ; CHECK-PIC-64: call test3@PLT 63 ; CHECK-PIC-64: call $test3 [all …]
|
| /llvm-project/llvm/test/Transforms/Inline/ |
| H A D | mut-rec-scc.ll | 35 ; CHECK-NEXT: call void @test3() 36 ; CHECK-NEXT: call void @test3() 39 call void @test3() noinline 40 call void @test3() noinline 55 define void @test3() { 56 ; CHECK-LABEL: define void @test3( 80 ; CHECK-NEXT: call void @test3() #[[COSTMULT:[0-9]+]] 81 ; CHECK-NEXT: call void @test3() #[[COSTMULT]] 82 ; CHECK-NEXT: call void @test3() #[[COSTMULT]] 83 ; CHECK-NEXT: call void @test3() #[[COSTMULT]] [all …]
|
| /llvm-project/clang/test/CXX/dcl.dcl/basic.namespace/namespace.udecl/ |
| H A D | p13.cpp | 21 Opaque0 test3(int*) const; 34 using Base::test3; 35 Opaque1 test3(int*); 53 void test3() { in test3() function 54 Opaque1 a = ((Derived*) 0)->test3((int*) 0); in test3() 55 Opaque0 b = ((const Derived*) 0)->test3((int*) 0); in test3()
|
| /llvm-project/llvm/test/CodeGen/MIR/X86/ |
| H A D | block-address-operands.mir | 31 store volatile ptr blockaddress(@test3, %0), ptr %addr 35 define void @test3() { 37 store volatile ptr blockaddress(@test3, %0), ptr @addr 89 ; CHECK: $rax = LEA64r $rip, 1, $noreg, blockaddress(@test3, %ir-block.0), $noreg 90 $rax = LEA64r $rip, 1, _, blockaddress(@test3, %ir-block.0), _ 95 name: test3 100 ; CHECK-LABEL: name: test3 101 ; CHECK: $rax = LEA64r $rip, 1, $noreg, blockaddress(@test3, %ir-block.0), $noreg 102 $rax = LEA64r $rip, 1, _, blockaddress(@test3, %ir-block.0), _
|
| /llvm-project/llvm/test/Transforms/JumpThreading/ |
| H A D | indirectbr.ll | 70 ; CHECK-LABEL: @test3( 72 ; CHECK: blockaddress(@test3, %__here) 74 ; CHECK: blockaddress(@test3, %__here1) 76 ; CHECK: blockaddress(@test3, %__here3) 77 define void @test3() nounwind ssp noredzone { 82 …%call = call i32 (...) @printf(ptr @.str, i64 ptrtoint (ptr blockaddress(@test3, %__here) to i64))… 86 …%call2 = call i32 (...) @printf(ptr @.str, i64 ptrtoint (ptr blockaddress(@test3, %__here1) to i64… 90 …%call4 = call i32 (...) @printf(ptr @.str, i64 ptrtoint (ptr blockaddress(@test3, %__here3) to i64…
|
| /llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
| H A D | merge.pass.cpp | 53 TEST_CONSTEXPR_CXX20 void test3() in test3() function 65 test3<T, Iter1, cpp17_input_iterator<const T*> >(); in test2() 66 test3<T, Iter1, forward_iterator<const T*> >(); in test2() 67 test3<T, Iter1, bidirectional_iterator<const T*> >(); in test2() 68 test3<T, Iter1, random_access_iterator<const T*> >(); in test2() 69 test3<T, Iter1, const T*>(); in test2()
|
| H A D | merge_comp.pass.cpp | 54 TEST_CONSTEXPR_CXX20 void test3() in test3() function 66 test3<T, Iter1, cpp17_input_iterator<const T*> >(); in test2() 67 test3<T, Iter1, forward_iterator<const T*> >(); in test2() 68 test3<T, Iter1, bidirectional_iterator<const T*> >(); in test2() 69 test3<T, Iter1, random_access_iterator<const T*> >(); in test2() 70 test3<T, Iter1, const T*>(); in test2()
|
| /llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
| H A D | set_symmetric_difference.pass.cpp | 53 TEST_CONSTEXPR_CXX20 void test3() in test3() function 65 test3<T, Iter1, cpp17_input_iterator<const T*> >(); in test2() 66 test3<T, Iter1, forward_iterator<const T*> >(); in test2() 67 test3<T, Iter1, bidirectional_iterator<const T*> >(); in test2() 68 test3<T, Iter1, random_access_iterator<const T*> >(); in test2() 69 test3<T, Iter1, const T*>(); in test2()
|
| H A D | set_symmetric_difference_comp.pass.cpp | 54 TEST_CONSTEXPR_CXX20 void test3() in test3() function 66 test3<T, Iter1, cpp17_input_iterator<const T*> >(); in test2() 67 test3<T, Iter1, forward_iterator<const T*> >(); in test2() 68 test3<T, Iter1, bidirectional_iterator<const T*> >(); in test2() 69 test3<T, Iter1, random_access_iterator<const T*> >(); in test2() 70 test3<T, Iter1, const T*>(); in test2()
|
| /llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| H A D | set_intersection.pass.cpp | 53 TEST_CONSTEXPR_CXX20 void test3() in test3() function 65 test3<T, Iter1, cpp17_input_iterator<const T*> >(); in test2() 66 test3<T, Iter1, forward_iterator<const T*> >(); in test2() 67 test3<T, Iter1, bidirectional_iterator<const T*> >(); in test2() 68 test3<T, Iter1, random_access_iterator<const T*> >(); in test2() 69 test3<T, Iter1, const T*>(); in test2()
|
| H A D | set_intersection_comp.pass.cpp | 54 TEST_CONSTEXPR_CXX20 void test3() in test3() function 66 test3<T, Iter1, cpp17_input_iterator<const T*> >(); in test2() 67 test3<T, Iter1, forward_iterator<const T*> >(); in test2() 68 test3<T, Iter1, bidirectional_iterator<const T*> >(); in test2() 69 test3<T, Iter1, random_access_iterator<const T*> >(); in test2() 70 test3<T, Iter1, const T*>(); in test2()
|
| /llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.difference/ |
| H A D | set_difference.pass.cpp | 53 TEST_CONSTEXPR_CXX20 void test3() in test3() function 65 test3<T, Iter1, cpp17_input_iterator<const T*> >(); in test2() 66 test3<T, Iter1, forward_iterator<const T*> >(); in test2() 67 test3<T, Iter1, bidirectional_iterator<const T*> >(); in test2() 68 test3<T, Iter1, random_access_iterator<const T*> >(); in test2() 69 test3<T, Iter1, const T*>(); in test2()
|
| H A D | set_difference_comp.pass.cpp | 54 TEST_CONSTEXPR_CXX20 void test3() in test3() function 66 test3<T, Iter1, cpp17_input_iterator<const T*> >(); in test2() 67 test3<T, Iter1, forward_iterator<const T*> >(); in test2() 68 test3<T, Iter1, bidirectional_iterator<const T*> >(); in test2() 69 test3<T, Iter1, random_access_iterator<const T*> >(); in test2() 70 test3<T, Iter1, const T*>(); in test2()
|
| /llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.union/ |
| H A D | set_union.pass.cpp | 53 TEST_CONSTEXPR_CXX20 void test3() in test3() function 65 test3<T, Iter1, cpp17_input_iterator<const T*> >(); in test2() 66 test3<T, Iter1, forward_iterator<const T*> >(); in test2() 67 test3<T, Iter1, bidirectional_iterator<const T*> >(); in test2() 68 test3<T, Iter1, random_access_iterator<const T*> >(); in test2() 69 test3<T, Iter1, const T*>(); in test2()
|
| H A D | set_union_comp.pass.cpp | 54 TEST_CONSTEXPR_CXX20 void test3() in test3() function 66 test3<T, Iter1, cpp17_input_iterator<const T*> >(); in test2() 67 test3<T, Iter1, forward_iterator<const T*> >(); in test2() 68 test3<T, Iter1, bidirectional_iterator<const T*> >(); in test2() 69 test3<T, Iter1, random_access_iterator<const T*> >(); in test2() 70 test3<T, Iter1, const T*>(); in test2()
|
| /llvm-project/llvm/test/Transforms/InstSimplify/ConstProp/ |
| H A D | extractvalue.ll | 19 define i32 @test3() { 22 ; CHECK-LABEL: @test3( 40 define i32 @zeroinitializer-test3() { 43 ; CHECK: @zeroinitializer-test3 61 define i32 @undef-test3() { 64 ; CHECK: @undef-test3
|
| /llvm-project/clang/test/CodeGen/PowerPC/ |
| H A D | ppc64-align-struct.c | 7 struct test3 { int x; int y; } __attribute__((aligned (32))); argument 26 void test3 (int x, struct test3 y) in test3() function 102 struct test3 test3va (int x, ...) in test3va() 104 struct test3 y; in test3va() 107 y = va_arg (ap, struct test3); in test3va()
|
| /llvm-project/llvm/test/Transforms/MergeFunc/ |
| H A D | unnamed-addr-reprocessing.ll | 3 ; After the merge of test5 and test6, we can merge test3 and test4, 9 ; CHECK-NEXT: tail call void @test3() 16 call void @test3() 17 call void @test3() 27 define void @test3() unnamed_addr {
|
| /llvm-project/clang/test/SemaCXX/ |
| H A D | warn-pessmizing-move.cpp | 75 A test3() { in test3() function 87 return test3(); in test4() 94 return std::move(test3()); in test4() 119 A a2 = test3(); in test6() 133 A a4 = std::move(test3()); in test6() 139 a4 = std::move(test3()); in test6()
|
| /llvm-project/libcxx/test/std/numerics/rand/rand.eng/rand.eng.lcong/ |
| H A D | ctor_result_type.pass.cpp | 84 test3() in test3() function 148 test3<unsigned short>(); in main() 149 test3<unsigned int>(); in main() 150 test3<unsigned long>(); in main() 151 test3<unsigned long long>(); in main()
|
| /llvm-project/llvm/test/MC/AsmParser/ |
| H A D | macros-darwin.s | 28 .macro test3 macro 33 test3 1, 2 3 label 36 test3 1, (2 3) label 39 test3 1 2 label
|
| /llvm-project/llvm/test/Transforms/ConstantMerge/ |
| H A D | unnamed-addr.ll | 15 @test3.x = internal unnamed_addr constant %struct.foobar { i32 3 } 16 @test3.y = constant %struct.foobar { i32 3 } 27 ; CHECK-NEXT: @test3.y = constant %struct.foobar { i32 3 } 36 call void @zed(ptr @test3.x, ptr @test3.y)
|
| /llvm-project/llvm/test/tools/llvm-objcopy/ELF/ |
| H A D | keep-many.test | 2 # RUN: llvm-objcopy --strip-non-alloc --keep-section=.test --keep-section=.test3 %t %t2 20 - Name: .test3 28 # CHECK: Name: .test3 33 # REGEX: Name: .test3
|