/llvm-project/clang/test/Index/ |
H A D | recursive-member-access.c | 2 struct rdar8650865 *first; member 7 return ((((((s->first)->first) in test_rdar8650865() 8 ->first) in test_rdar8650865() 9 ->first) in test_rdar8650865() 10 ->first) in test_rdar8650865() 11 ->first) in test_rdar8650865() 12 ->first in test_rdar8650865() 13 ->first in test_rdar8650865() 14 ->first in test_rdar8650865() 15 ->first in test_rdar8650865() [all …]
|
/llvm-project/clang/lib/Lex/ |
H A D | DependencyDirectivesScanner.cpp | 87 /// Lexes next token and advances \p First and the \p Lexer. 89 lexToken(const char *&First, const char *const End); 92 lexIncludeFilename(const char *&First, const char *const End); 94 void skipLine(const char *&First, const char *const End); 95 void skipDirective(StringRef Name, const char *&First, const char *const End); 104 /// In any case (whatever the token kind) \p First and the \p Lexer will 107 tryLexIdentifierOrSkipLine(const char *&First, const char *const End); 110 [[nodiscard]] StringRef lexIdentifier(const char *&First, 116 /// In any case (whatever the token kind) \p First and the \p Lexer will 119 const char *&First, 204 skipOverSpaces(const char * & First,const char * const End) skipOverSpaces() argument 209 isRawStringLiteral(const char * First,const char * Current) isRawStringLiteral() argument 234 skipRawString(const char * & First,const char * const End) skipRawString() argument 277 isEOL(const char * First,const char * const End) isEOL() argument 286 skipString(const char * & First,const char * const End) skipString() argument 316 skipNewline(const char * & First,const char * End) skipNewline() argument 326 wasLineContinuation(const char * First,unsigned EOLLen) wasLineContinuation() argument 330 skipToNewlineRaw(const char * & First,const char * const End) skipToNewlineRaw() argument 353 skipLineComment(const char * & First,const char * const End) skipLineComment() argument 359 skipBlockComment(const char * & First,const char * const End) skipBlockComment() argument 396 skipLine(const char * & First,const char * const End) skipLine() argument 451 skipDirective(StringRef Name,const char * & First,const char * const End) skipDirective() argument 463 skipWhitespace(const char * & First,const char * const End) skipWhitespace() argument 495 lexModuleDirectiveBody(DirectiveKind Kind,const char * & First,const char * const End) lexModuleDirectiveBody() argument 518 lexToken(const char * & First,const char * const End) lexToken() argument 532 lexIncludeFilename(const char * & First,const char * const End) lexIncludeFilename() argument 544 lexPPDirectiveBody(const char * & First,const char * const End) lexPPDirectiveBody() argument 578 tryLexIdentifierOrSkipLine(const char * & First,const char * const End) tryLexIdentifierOrSkipLine() argument 589 lexIdentifier(const char * & First,const char * const End) lexIdentifier() argument 595 isNextIdentifierOrSkipLine(StringRef Id,const char * & First,const char * const End) isNextIdentifierOrSkipLine() argument 606 isNextTokenOrSkipLine(tok::TokenKind K,const char * & First,const char * const End) isNextTokenOrSkipLine() argument 616 tryLexStringLiteralOrSkipLine(const char * & First,const char * const End) tryLexStringLiteralOrSkipLine() argument 628 lexAt(const char * & First,const char * const End) lexAt() argument 641 lexModule(const char * & First,const char * const End) lexModule() argument 685 lex_Pragma(const char * & First,const char * const End) lex_Pragma() argument 720 lexPragma(const char * & First,const char * const End) lexPragma() argument 770 lexEndif(const char * & First,const char * const End) lexEndif() argument 790 lexDefault(DirectiveKind Kind,const char * & First,const char * const End) lexDefault() argument 797 isStartOfRelevantLine(char First) isStartOfRelevantLine() argument 810 lexPPLine(const char * & First,const char * const End) lexPPLine() argument 914 skipUTF8ByteOrderMark(const char * & First,const char * const End) skipUTF8ByteOrderMark() argument 920 scanImpl(const char * First,const char * const End) scanImpl() argument [all...] |
/llvm-project/libcxx/test/std/algorithms/ |
H A D | robust_against_adl.compile.pass.cpp | 41 Holder<Incomplete> **first = t.data; in all_the_algorithms() local 50 (void)std::adjacent_find(first, last); in all_the_algorithms() 51 (void)std::adjacent_find(first, last, std::equal_to<void*>()); in all_the_algorithms() 53 (void)std::all_of(first, last, UnaryTrue()); in all_the_algorithms() 54 (void)std::any_of(first, last, UnaryTrue()); in all_the_algorithms() 56 (void)std::binary_search(first, last, value); in all_the_algorithms() 57 (void)std::binary_search(first, last, value, std::less<void*>()); in all_the_algorithms() 62 (void)std::copy(first, last, first2); in all_the_algorithms() 63 (void)std::copy_backward(first, last, last2); in all_the_algorithms() 64 (void)std::copy_n(first, count, first2); in all_the_algorithms() [all …]
|
H A D | robust_re_difference_type.compile.pass.cpp | 79 auto first = PickyIterator<void**, long>(a); in all_the_algorithms() 88 (void)std::adjacent_find(first, last); in all_the_algorithms() 89 (void)std::adjacent_find(first, last, std::equal_to<void*>()); in all_the_algorithms() 91 (void)std::all_of(first, last, UnaryTrue()); in all_the_algorithms() 92 (void)std::any_of(first, last, UnaryTrue()); in all_the_algorithms() 94 (void)std::binary_search(first, last, value); in all_the_algorithms() 95 (void)std::binary_search(first, last, value, std::less<void*>()); in all_the_algorithms() 100 (void)std::copy(first, last, first2); in all_the_algorithms() 101 (void)std::copy_backward(first, last, last2); in all_the_algorithms() 102 (void)std::copy_n(first, coun in all_the_algorithms() 78 auto first = PickyIterator<void**, long>(a); all_the_algorithms() local [all...] |
/llvm-project/clang/test/Modules/ |
H A D | odr_hash.cpp | 7 // Build first header file 8 // RUN: echo "#define FIRST" >> %t/Inputs/first.h 9 // RUN: cat %s >> %t/Inputs/first.h 16 // RUN: %clang_cc1 -fsyntax-only -x c++ -std=c++20 %t/Inputs/first.h 21 // RUN: echo " header \"first.h\"" >> %t/Inputs/module.modulemap 32 #if !defined(FIRST) && !defined(SECOND) 33 #include "first.h" 38 #if defined(FIRST) 45 #if defined(FIRST) [all...] |
H A D | compare-objc-interface.m | 4 // Build first header file 5 // RUN: echo "#define FIRST" >> %t/include/first.h 6 // RUN: cat %t/test.m >> %t/include/first.h 7 // RUN: echo "#undef FIRST" >> %t/include/first.h 15 // RUN: %clang_cc1 -fsyntax-only -x objective-c %t/include/first.h -fblocks -fobjc-arc 39 //--- include/first-empty.h 41 module First { 43 header "first-empty.h" 46 header "first.h" 58 #if defined(FIRST) || defined(SECOND) [all …]
|
H A D | compare-objc-protocol.m | 4 // Build first header file 5 // RUN: echo "#define FIRST" >> %t/include/first.h 6 // RUN: cat %t/test.m >> %t/include/first.h 7 // RUN: echo "#undef FIRST" >> %t/include/first.h 15 // RUN: %clang_cc1 -fsyntax-only -x objective-c %t/include/first.h -fblocks -fobjc-arc 40 //--- include/first-empty.h 46 module First { 48 header "first-empty.h" 51 header "first.h" 62 #if defined(FIRST) || defined(SECOND) [all …]
|
H A D | compare-record.c | 4 // Build first header file 5 // RUN: echo "#define FIRST" >> %t/include/first.h 6 // RUN: cat %t/test.c >> %t/include/first.h 7 // RUN: echo "#undef FIRST" >> %t/include/first.h 15 // RUN: %clang_cc1 -fsyntax-only -x objective-c %t/include/first.h -fblocks -fobjc-arc 47 //--- include/first-empty.h 49 module First { 51 header "first [all...] |
/llvm-project/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/ |
H A D | insert_rvalue.pass.cpp | 38 assert(r.first->first == 3.5); in main() 39 assert(r.first->second == 3); in main() 44 assert(r.first->first == 3.5); in main() 45 assert(r.first->second == 3); in main() 50 assert(r.first->first == 4.5); in main() 51 assert(r.first->second == 4); in main() 56 assert(r.first->first == 5.5); in main() 57 assert(r.first->second == 4); in main() 67 assert(r.first->first == 3); in main() 68 assert(r.first->second == 3); in main() [all …]
|
/llvm-project/llvm/test/Transforms/LoopFusion/ |
H A D | peel.ll | 5 ; The first three iterations of the first loop should be peeled, and then the 21 ; CHECK-NEXT: for.first.preheader: 22 ; CHECK-NEXT: br label %for.first.peel.begin 23 ; CHECK: for.first.peel.begin: 24 ; CHECK-NEXT: br label %for.first.peel 25 ; CHECK: for.first.peel: 26 ; CHECK: br label %for.first.latch.peel 27 ; CHECK: for.first.latch.peel: 28 ; CHECK: br label %for.first.peel.next 29 ; CHECK: for.first.peel.next: [all …]
|
H A D | guarded_peel.ll | 4 ; different trip counts. The first two iterations of the first loop should be 11 ; CHECK: br i1 %cmp4, label %for.first.entry, label %for.end 12 ; CHECK: for.first.entry 13 ; CHECK-NEXT: br label %for.first.peel.begin 14 ; CHECK: for.first.peel.begin: 15 ; CHECK-NEXT: br label %for.first.peel 16 ; CHECK: for.first.peel: 17 ; CHECK: br label %for.first.peel.next 18 ; CHECK: for.first.peel.next: 19 ; CHECK-NEXT: br label %for.first.peel2 [all …]
|
H A D | guarded_unsafeblock_peel.ll | 4 ; These loops do not have the same trip count, and the first loop meets the 5 ; requirements for peeling. However, the exit block of the first loop makes the 10 ; CHECK: for.first.guard 11 ; CHECK: br i1 %cmp3, label %for.first.preheader, label %for.second.guard 12 ; CHECK: for.first.preheader: 13 ; CHECK-NEXT: br label %for.first 14 ; CHECK: for.first: 15 ; CHECK: br i1 %cmp, label %for.first, label %for.first.exit 16 ; CHECK: for.first.exit: 31 for.first.guard: [all …]
|
H A D | nonadjacent_peel.ll | 4 ; the same tripcount, and the first loop is valid candiate for peeling; however 10 ; CHECK-NEXT: for.first.preheader: 11 ; CHECK-NEXT: br label %for.first 12 ; CHECK: for.first: 13 ; CHECK: br label %for.first.latch 14 ; CHECK: for.first.latch: 15 ; CHECK: br i1 %exitcond4, label %for.first, label %for.first.exit 16 ; CHECK: for.first.exit: 32 for.first.preheader: 33 br label %for.first [all …]
|
/llvm-project/llvm/unittests/ADT/ |
H A D | MapVectorTest.cpp | 49 ASSERT_EQ(R.first, MV1.begin()); in TEST() 50 EXPECT_EQ(R.first->first, 1); in TEST() 51 EXPECT_EQ(R.first->second, 2); in TEST() 65 EXPECT_EQ(I->first, 1); in TEST() 74 ASSERT_EQ(R.first, MV.begin()); in TEST() 75 EXPECT_EQ(R.first->first, 1); in TEST() 76 EXPECT_EQ(R.first->second, 2); in TEST() 80 ASSERT_EQ(R.first, MV.begin()); in TEST() 81 EXPECT_EQ(R.first->first, 1); in TEST() 82 EXPECT_EQ(R.first->second, 2); in TEST() [all …]
|
/llvm-project/clang/unittests/Format/ |
H A D | ObjCPropertyAttributeOrderFixerTest.cpp | 206 Style.ObjCPropertyAttributeOrder = {"FIRST", in TEST_F() 247 verifyFormat("@property(FIRST, class) int p;", Style); in TEST_F() 248 verifyFormat("@property(FIRST, direct) int p;", Style); in TEST_F() 249 verifyFormat("@property(FIRST, atomic) int p;", Style); in TEST_F() 250 verifyFormat("@property(FIRST, nonatomic) int p;", Style); in TEST_F() 251 verifyFormat("@property(FIRST, assign) int p;", Style); in TEST_F() 252 verifyFormat("@property(FIRST, retain) int p;", Style); in TEST_F() 253 verifyFormat("@property(FIRST, strong) int p;", Style); in TEST_F() 254 verifyFormat("@property(FIRST, copy) int p;", Style); in TEST_F() 255 verifyFormat("@property(FIRST, weak) int p;", Style); in TEST_F() [all …]
|
/llvm-project/libcxx/test/libcxx/algorithms/ |
H A D | robust_against_copying_comparators.pass.cpp | 98 T *first = a; in all_the_algorithms() 108 (void)std::adjacent_find(first, last, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms() 110 (void)std::all_of(first, last, UnaryTrue<T>(&copies)); assert(copies == 0); in all_the_algorithms() 111 (void)std::any_of(first, last, UnaryTrue<T>(&copies)); assert(copies == 0); in all_the_algorithms() 113 (void)std::binary_search(first, last, value, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms() 117 (void)std::count_if(first, last, UnaryTrue<T>(&copies)); assert(copies == 0); in all_the_algorithms() 118 (void)std::copy_if(first, last, first2, UnaryTrue<T>(&copies)); assert(copies == 0); in all_the_algorithms() 119 (void)std::equal(first, last, first2, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms() 121 (void)std::equal(first, last, first2, last2, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms() 123 (void)std::equal_range(first, las in all_the_algorithms() 97 T *first = a; all_the_algorithms() local [all...] |
/llvm-project/libcxx/test/std/containers/associative/map/map.modifiers/ |
H A D | insert_rv.pass.cpp | 35 assert(r.first == m.begin()); in do_insert_rv_test() 37 assert(r.first->first == 2); in do_insert_rv_test() 38 assert(r.first->second == 2); in do_insert_rv_test() 42 assert(r.first == m.begin()); in do_insert_rv_test() 44 assert(r.first->first == 1); in do_insert_rv_test() 45 assert(r.first->second == 1); in do_insert_rv_test() 49 assert(r.first == std::prev(m.end())); in do_insert_rv_test() 51 assert(r.first->first == 3); in do_insert_rv_test() 52 assert(r.first->second == 3); in do_insert_rv_test() 56 assert(r.first == std::prev(m.end())); in do_insert_rv_test() [all …]
|
H A D | erase_key.pass.cpp | 43 assert(m.begin()->first == 1); in main() 45 assert(std::next(m.begin())->first == 2); in main() 47 assert(std::next(m.begin(), 2)->first == 3); in main() 49 assert(std::next(m.begin(), 3)->first == 4); in main() 51 assert(std::next(m.begin(), 4)->first == 5); in main() 53 assert(std::next(m.begin(), 5)->first == 6); in main() 55 assert(std::next(m.begin(), 6)->first == 7); in main() 57 assert(std::next(m.begin(), 7)->first == 8); in main() 63 assert(m.begin()->first == 1); in main() 65 assert(std::next(m.begin())->first == 2); in main() [all …]
|
/llvm-project/libcxx/test/std/containers/associative/map/map.ops/ |
H A D | equal_range.pass.cpp | 44 assert(r.first == std::next(m.begin(), 0)); in main() 47 assert(r.first == std::next(m.begin(), 1)); in main() 50 assert(r.first == std::next(m.begin(), 2)); in main() 53 assert(r.first == std::next(m.begin(), 3)); in main() 56 assert(r.first == std::next(m.begin(), 4)); in main() 59 assert(r.first == std::next(m.begin(), 5)); in main() 62 assert(r.first == std::next(m.begin(), 6)); in main() 65 assert(r.first == std::next(m.begin(), 7)); in main() 68 assert(r.first == std::next(m.begin(), 0)); in main() 71 assert(r.first == std::next(m.begin(), 1)); in main() [all …]
|
/llvm-project/libcxx/test/std/containers/associative/set/ |
H A D | equal_range.pass.cpp | 43 assert(r.first == std::next(m.begin(), 0)); in main() 46 assert(r.first == std::next(m.begin(), 1)); in main() 49 assert(r.first == std::next(m.begin(), 2)); in main() 52 assert(r.first == std::next(m.begin(), 3)); in main() 55 assert(r.first == std::next(m.begin(), 4)); in main() 58 assert(r.first == std::next(m.begin(), 5)); in main() 61 assert(r.first == std::next(m.begin(), 6)); in main() 64 assert(r.first == std::next(m.begin(), 7)); in main() 67 assert(r.first == std::next(m.begin(), 0)); in main() 70 assert(r.first == std::next(m.begin(), 1)); in main() [all …]
|
/llvm-project/lldb/test/API/functionalities/data-formatter/data-formatter-stl/libstdcpp/map/ |
H A D | TestDataFormatterStdMap.py | 64 "first = 0", 67 "first = 1", 79 "first = 2", 82 "first = 3", 94 "first = 5", 97 "first = 7", 107 "first = 5", 110 "first = 7", 116 self.expect("frame variable ii[0]", substrs=["first = 0", "second = 0"]) 117 self.expect("frame variable ii[3]", substrs=["first =", "second ="]) [all …]
|
/llvm-project/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
H A D | erase_key.pass.cpp | 62 assert(std::distance(eq.first, eq.second) == 2); in main() 68 assert(std::distance(eq.first, eq.second) == 2); in main() 73 assert(std::distance(eq.first, eq.second) == 1); in main() 74 C::const_iterator k = eq.first; in main() 75 assert(k->first == 3); in main() 78 assert(std::distance(eq.first, eq.second) == 1); in main() 79 k = eq.first; in main() 80 assert(k->first == 4); in main() 88 assert(std::distance(eq.first, eq.second) == 2); in main() 93 assert(std::distance(eq.first, eq.second) == 1); in main() [all …]
|
/llvm-project/lldb/test/API/functionalities/data-formatter/data-formatter-stl/libcxx/iterator/ |
H A D | TestDataFormatterLibccIterator.py | 54 self.expect("frame variable iimI", substrs=["first = 43981", "second = 61681"]) 55 self.expect("expr iimI", substrs=["first = 43981", "second = 61681"]) 57 self.expect("frame variable iimI.first", substrs=["first = 43981"]) 58 self.expect("frame variable iimI.first", substrs=["second"], matching=False) 60 self.expect("frame variable iimI.second", substrs=["first"], matching=False) 62 self.expect("frame variable simI", substrs=['first = "world"', "second = 42"]) 63 self.expect("expr simI", substrs=['first = "world"', "second = 42"]) 65 self.expect("frame variable simI.first", substrs=['first = "world"']) 66 self.expect("frame variable simI.first", substrs=["second"], matching=False) 68 self.expect("frame variable simI.second", substrs=["first"], matching=False) [all …]
|
/llvm-project/libcxx/test/std/re/re.alg/re.alg.search/ |
H A D | ecma.pass.cpp | 14 // regex_search(BidirectionalIterator first, BidirectionalIterator last, 33 assert(m.prefix().first == s); in main() 34 assert(m.prefix().second == m[0].first); in main() 36 assert(m.suffix().first == m[0].second); in main() 48 assert(m.prefix().first == s); in main() 49 assert(m.prefix().second == m[0].first); in main() 51 assert(m.suffix().first == m[0].second); in main() 70 assert(m.prefix().first == s); in main() 71 assert(m.prefix().second == m[0].first); in main() 73 assert(m.suffix().first == m[0].second); in main() [all …]
|
/llvm-project/lldb/test/API/functionalities/data-formatter/data-formatter-stl/libcxx/map/ |
H A D | TestDataFormatterLibccMap.py | 20 ValueCheck(name="first", value=first_value), 77 "first = 0", 80 "first = 1", 93 "first = 2", 96 "first = 3", 109 "first = 5", 112 "first = 7", 123 "first = 5", 126 "first = 7", 132 self.expect("frame variable ii[0]", substrs=["first = 0", "second = 0"]) [all …]
|