| /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/compiler-rt/lib/scudo/standalone/ |
| H A D | list.h | 135 T *front() { return First; }
136 const T *front() const { return First; } in append_back()
141 First = Last = nullptr; in append_back()
149 return Iterator(LinkOp<T>(this->getBase(), this->getSize()), First);
157 First); in push_front()
168 T *First = nullptr; in push_front()
174 CHECK_EQ(First, nullptr); in insert()
178 for (T *I = First;; I = this->getNext(I)) { in insert()
189 using IntrusiveList<T>::First; in push_back()
200 First in pop_front()
61 T *First = nullptr; global() member
[all...] |
| /llvm-project/clang/lib/Format/ |
| H A D | UnwrappedLineFormatter.cpp | 24 const FormatToken *Next = Line.First->getNextNonComment(); in startsExternCBlock()
101 if (Line.First->is(tok::comment) && IndentForLevel[Line.Level] != -1) in adjustToUnmodifiedLine()
103 unsigned LevelIndent = Line.First->OriginalColumn; in adjustToUnmodifiedLine()
141 if (IsAccessModifier(*Line.First)) { in getIndentOffset()
195 return AnnotatedLines[StartLineIndex]->First->getNamespaceToken(); in getMatchingNamespaceToken()
199 const FormatToken *NamespaceToken = Line->First->getNamespaceToken(); in getNamespaceTokenText()
230 if (Next[i + 1]->First->NewlinesBefore > 0) in getNextMergedLine()
256 if (NextLine.Type == LT_Invalid || NextLine.First->MustBreakBefore) in tryFitMultipleLinesInOne()
259 (!NextLine.InPPDirective || NextLine.First->HasUnescapedNewline)) { in tryFitMultipleLinesInOne()
275 TheLine->First in tryFitMultipleLinesInOne()
574 const FormatToken *First = TheLine->First; tryFitMultipleLinesInOne() local
[all...] |
| H A D | DefinitionBlockSeparator.cpp | 52 for (const FormatToken *CurrentToken = Line->First; CurrentToken; in separateBlocks()
97 IsAccessSpecifierToken(Lines[OpeningLineIndex - 1]->First))) { in separateBlocks()
108 return Line->First->is(tok::hash) && Line->First->Next && in separateBlocks()
109 Line->First->Next->isOneOf(tok::pp_if, tok::pp_ifdef, tok::pp_else, in separateBlocks()
122 for (const FormatToken *CurrentToken = CurrentLine->First; CurrentToken; in separateBlocks()
133 Lines[I + 1]->First->is(tok::l_brace); in separateBlocks()
146 if (const auto *Tok = OperateLine->First; in separateBlocks()
152 if (OperateLine->First->is(tok::identifier) && in separateBlocks()
153 OperateLine->First == OperateLine->Last && in separateBlocks()
163 NextLine->First->NewlinesBefore == 1 && in separateBlocks()
[all …]
|
| H A D | AffectedRangeManager.cpp | 30 assert(Line->First); in computeAffectedLines()
31 Line->LeadingEmptyLinesAffected = affectsLeadingEmptyLines(*Line->First); in computeAffectedLines()
38 while (PPEnd != E && !(*PPEnd)->First->HasUnescapedNewline) { in computeAffectedLines()
43 if (affectsTokenRange(*Line->First, *Last, in computeAffectedLines()
72 bool AffectedRangeManager::affectsTokenRange(const FormatToken &First, in affectsTokenRange() argument
75 SourceLocation Start = First.WhitespaceRange.getBegin(); in affectsTokenRange()
77 Start = Start.getLocWithOffset(First.LastNewlineOffset); in affectsTokenRange()
119 assert(Line->First); in nonPPLineAffected()
120 for (FormatToken *Tok = Line->First; Tok; Tok = Tok->Next) { in nonPPLineAffected()
135 Line->First in nonPPLineAffected()
[all...] |
| H A D | TokenAnnotator.h | 52 : First(Line.Tokens.front().Tok), Type(LT_Other), Level(Line.Level), in AnnotatedLine()
69 First->Previous = nullptr; in AnnotatedLine()
70 FormatToken *Current = First; in AnnotatedLine()
107 FormatToken *Current = First; in ~AnnotatedLine()
116 return First && First->is(tok::comment) && !First->getNextNonComment();
122 return First && First->startsSequence(Tokens...);
163 assert(First); in getLastNonComment()
165 FormatToken *First; global() variable
[all...] |
| H A D | QualifierAlignmentFixer.cpp | 71 const FormatToken *First) { in removeToken() argument
72 auto Range = CharSourceRange::getCharRange(First->getStartOfNonWhitespace(), in removeToken()
73 First->Tok.getEndLoc()); in removeToken()
79 const FormatToken *First, in insertQualifierAfter() argument
81 auto Range = CharSourceRange::getCharRange(First->Tok.getLocation(), in insertQualifierAfter()
82 First->Tok.getEndLoc()); in insertQualifierAfter()
85 NewText += First->TokenText; in insertQualifierAfter()
92 const FormatToken *First, in insertQualifierBefore() argument
94 auto Range = CharSourceRange::getCharRange(First->getStartOfNonWhitespace(), in insertQualifierBefore()
95 First in insertQualifierBefore()
116 rotateTokens(const SourceManager & SourceMgr,tooling::Replacements & Fixes,const FormatToken * First,const FormatToken * Last,bool Left) rotateTokens() argument
557 FormatToken *First = Line->First; fixQualifierAlignment() local
[all...] |
| /llvm-project/clang/include/clang/Lex/ |
| H A D | PPCallbacks.h | 471 std::unique_ptr<PPCallbacks> First, Second; variable
476 : First(std::move(_First)), Second(std::move(_Second)) {} in PPChainedCallbacks()
483 First->FileChanged(Loc, Reason, FileType, PrevFID); in FileChanged()
490 First->LexedFileChanged(FID, Reason, FileType, PrevFID, Loc); in LexedFileChanged()
496 First->FileSkipped(SkippedFile, FilenameTok, FileType); in FileSkipped()
501 bool Skip = First->FileNotFound(FileName); in EmbedFileNotFound()
511 First->EmbedDirective(HashLoc, FileName, IsAngled, File, Params); in EmbedDirective()
516 bool Skip = First->FileNotFound(FileName); in FileNotFound()
530 First->InclusionDirective(HashLoc, IncludeTok, FileName, IsAngled, in InclusionDirective()
540 First->EnteredSubmodule(M, ImportLoc, ForPragma); in EnteredSubmodule()
[all …]
|
| /llvm-project/clang/test/SemaCXX/ |
| H A D | warn-unsafe-buffer-usage-in-container-span-construct.cpp | 121 std::span<int> warnVarInit(It &First, It &Last) {
122 std::span<int> S{First, Last}; // expected-warning{{the two-parameter std::span construction is unsafe as it can introduce mismatch between buffer size and the bound information}}
123 std::span<int> S1(First, Last); // expected-warning{{the two-parameter std::span construction is unsafe as it can introduce mismatch between buffer size and the bound information}}
124 std::span<int> S2 = std::span<int>{First, Last}; // expected-warning{{the two-parameter std::span construction is unsafe as it can introduce mismatch between buffer size and the bound information}} in warnTemp() argument
125 std::span<int> S3 = std::span<int>(First, Last); // expected-warning{{the two-parameter std::span construction is unsafe as it can introduce mismatch between buffer size and the bound information}} in warnTemp()
126 std::span<int> S4 = std::span<int>{First, Last}; // expected-warning{{the two-parameter std::span construction is unsafe as it can introduce mismatch between buffer size and the bound information}} in warnTemp()
127 std::span<int> S5 = std::span<int>(First, Last); // expected-warning{{the two-parameter std::span construction is unsafe as it can introduce mismatch between buffer size and the bound information}} in warnTemp()
128 std::span<int> S6 = {First, Last}; // expected-warning{{the two-parameter std::span construction is unsafe as it can introduce mismatch between buffer size and the bound information}} in warnTemp()
129 auto S7 = std::span<int>{First, Last}; // expected-warning{{the two-parameter std::span construction is unsafe as it can introduce mismatch between buffer size and the bound information}} in warnTemp()
130 auto S8 = std::span<int>(First, Las in warnTemp()
101 warnVarInit(It & First,It & Last) warnVarInit() argument
[all...] |
| /llvm-project/llvm/include/llvm/ADT/ |
| H A D | ilist_base.h | 41 static void removeRangeImpl(node_base_type &First, node_base_type &Last) { in removeRangeImpl() argument
42 node_base_type *Prev = First.getPrev(); in removeRangeImpl()
48 First.setPrev(nullptr); in removeRangeImpl()
52 static void transferBeforeImpl(node_base_type &Next, node_base_type &First, in transferBeforeImpl() argument
54 if (&Next == &Last || &First == &Last) in transferBeforeImpl()
58 assert(&Next != &First && in transferBeforeImpl()
65 First.getPrev()->setNext(&Last); in transferBeforeImpl()
66 Last.setPrev(First.getPrev()); in transferBeforeImpl()
71 First.setPrev(&Prev); in transferBeforeImpl()
72 Prev.setNext(&First); in transferBeforeImpl()
[all …]
|
| H A D | simple_ilist.h | 172 void insert(iterator I, Iterator First, Iterator Last) { in insert() argument
173 for (; First != Last; ++First) in insert()
174 insert(I, *First); in insert()
211 iterator erase(iterator First, iterator Last) { in erase() argument
212 list_base_type::removeRange(*First.getNodePtr(), *Last.getNodePtr()); in erase()
227 iterator eraseAndDispose(iterator First, iterator Last, Disposer dispose) { in eraseAndDispose() argument
228 while (First != Last) in eraseAndDispose()
229 First = eraseAndDispose(First, dispose); in eraseAndDispose()
254 void splice(iterator I, simple_ilist &, iterator First, iterator Last) { in splice() argument
255 list_base_type::transferBefore(*I.getNodePtr(), *First.getNodePtr(), in splice()
|
| /llvm-project/bolt/include/bolt/Passes/ |
| H A D | ReorderUtils.h | 75 bool contains(const Cluster *First, const Cluster *Second) const { in contains() argument
76 return Valid[index(First, Second)]; in contains()
79 ValueType get(const Cluster *First, const Cluster *Second) const { in get() argument
80 assert(contains(First, Second)); in get()
81 return Cache[index(First, Second)]; in get()
84 void set(const Cluster *First, const Cluster *Second, ValueType Value) { in set() argument
85 const size_t Index = index(First, Second); in set()
97 size_t index(const Cluster *First, const Cluster *Second) const { in index() argument
98 return (First->id() * Size) + Second->id(); in index()
116 bool contains(const Cluster *First, const Cluster *Second) const { in contains() argument
[all …]
|
| /llvm-project/llvm/lib/CodeGen/ |
| H A D | SwitchLoweringUtils.cpp | 24 unsigned First, unsigned Last) { in getJumpTableRange() argument
25 assert(Last >= First); in getJumpTableRange()
26 const APInt &LowCase = Clusters[First].Low->getValue(); in getJumpTableRange()
38 unsigned First, unsigned Last) { in getJumpTableNumCases() argument
39 assert(Last >= First); in getJumpTableNumCases()
40 assert(TotalCases[Last] >= TotalCases[First]); in getJumpTableNumCases()
42 TotalCases[Last] - (First == 0 ? 0 : TotalCases[First - 1]); in getJumpTableNumCases()
174 for (unsigned First = 0, Last; First < in findJumpTables()
173 for (unsigned First = 0, Last; First < N; First = Last + 1) { findJumpTables() local
192 buildJumpTable(const CaseClusterVector & Clusters,unsigned First,unsigned Last,const SwitchInst * SI,const std::optional<SDLoc> & SL,MachineBasicBlock * DefaultMBB,CaseCluster & JTCluster) buildJumpTable() argument
348 for (unsigned First = 0, Last; First < N; First = Last + 1) { findBitTestClusters() local
367 buildBitTests(CaseClusterVector & Clusters,unsigned First,unsigned Last,const SwitchInst * SI,CaseCluster & BTCluster) buildBitTests() argument
499 caseClusterRank(const CaseCluster & CC,CaseClusterIt First,CaseClusterIt Last) caseClusterRank() argument
[all...] |
| H A D | InterferenceCache.cpp | 159 BI->First = BI->Last = SlotIndex(); in update()
169 if (!BI->First.isValid() || StartI < BI->First) in update()
170 BI->First = StartI; in update()
182 if (!BI->First.isValid() || StartI < BI->First) in update()
183 BI->First = StartI; in update()
189 SlotIndex Limit = BI->First.isValid() ? BI->First : Stop; in update()
194 BI->First in update()
[all...] |
| /llvm-project/clang/include/clang/Tooling/Refactoring/ |
| H A D | RefactoringActionRulesInternal.h | 29 void ignoreError(Expected<FirstT> &First, Expected<RestT> &... Rest) { in ignoreError() argument
30 if (!First) in ignoreError()
31 llvm::consumeError(First.takeError()); in ignoreError()
38 llvm::Error findError(Expected<FirstT> &First, Expected<RestT> &... Rest) { in findError() argument
39 if (!First) { in findError()
41 return First.takeError(); in findError()
72 const FirstT &First, const RestT &... Rest) { in visitRefactoringOptionsImpl() argument
82 (OptionGatherer{Visitor})(First); in visitRefactoringOptionsImpl()
96 template <typename Base, typename First, typename... Rest>
97 struct HasBaseOf : std::conditional_t<HasBaseOf<Base, First>::value ||
[all …]
|
| /llvm-project/clang/lib/ExtractAPI/ |
| H A D | API.cpp | 55 // Check that First and Last are both null or both non-null.
56 return (First == nullptr) == (Last == nullptr); in IsWellFormed()
62 if (Other.First == nullptr && Other.Last == nullptr) in stealRecordChain()
66 if (First) in stealRecordChain()
67 Last->NextInContext = Other.First; in stealRecordChain()
69 First = Other.First; in stealRecordChain()
73 for (auto *StolenRecord = Other.First; StolenRecord != nullptr; in stealRecordChain()
78 Other.First = nullptr; in addToRecordChain()
84 if (!First) { in addToRecordChain()
[all...] |
| /llvm-project/llvm/lib/IR/ |
| H A D | BasicBlock.cpp | 772 BasicBlock::iterator First, in spliceDebugInfoEmptyBlock()
793 assert(First == Last); in spliceDebugInfoEmptyBlock()
795 bool ReadFromHead = First.getHeadBit(); in spliceDebugInfoEmptyBlock()
812 // There are instructions in this block; if the First iterator was in spliceDebugInfo()
815 if (Src->empty() || First != Src->begin() || !ReadFromHead) in spliceDebugInfo()
819 if (!First->hasDbgRecords()) in spliceDebugInfo()
822 createMarker(Dest)->absorbDebugValues(*First->DebugMarker, InsertAtHead); in spliceDebugInfo()
826 BasicBlock::iterator First, in spliceDebugInfo()
839 First Last in spliceDebugInfo()
850 front of the First instructio in spliceDebugInfo()
750 spliceDebugInfoEmptyBlock(BasicBlock::iterator Dest,BasicBlock * Src,BasicBlock::iterator First,BasicBlock::iterator Last) spliceDebugInfoEmptyBlock() argument
806 spliceDebugInfo(BasicBlock::iterator Dest,BasicBlock * Src,BasicBlock::iterator First,BasicBlock::iterator Last) spliceDebugInfo() argument
888 spliceDebugInfoImpl(BasicBlock::iterator Dest,BasicBlock * Src,BasicBlock::iterator First,BasicBlock::iterator Last) spliceDebugInfoImpl() argument
1027 splice(iterator Dest,BasicBlock * Src,iterator First,iterator Last) splice() argument
[all...] |
| /llvm-project/llvm/include/llvm/Demangle/ |
| H A D | ItaniumDemangle.h | 43 T *First = nullptr; variable
48 bool isInline() const { return First == Inline; } in isInline()
51 First = Inline; in clearInline()
62 std::copy(First, Last, Tmp); in reserve()
63 First = Tmp; in reserve()
65 First = static_cast<T *>(std::realloc(First, NewCap * sizeof(T))); in reserve()
66 if (First == nullptr) in reserve()
69 Last = First + S; in reserve()
70 Cap = First in reserve()
2262 const Node *First; global() variable
2608 const char *First; global() member
[all...] |
| /llvm-project/libcxxabi/src/demangle/ |
| H A D | ItaniumDemangle.h | 43 T *First = nullptr;
48 bool isInline() const { return First == Inline; }
51 First = Inline; in clearInline()
62 std::copy(First, Last, Tmp); in reserve()
63 First = Tmp; in reserve()
65 First = static_cast<T *>(std::realloc(First, NewCap * sizeof(T))); in reserve()
66 if (First == nullptr) in reserve()
69 Last = First + S; in reserve()
70 Cap = First in reserve()
44 T *First = nullptr; global() variable
2263 const Node *First; global() variable
2609 const char *First; global() member
[all...] |
| /llvm-project/llvm/lib/Target/Lanai/ |
| H A D | LanaiMemAluCombiner.cpp | 334 MbbIterator First = MemInstr; in findClosestSuitableAluInstr() local
337 while (First != Last) { in findClosestSuitableAluInstr()
338 Decrement ? --First : ++First; in findClosestSuitableAluInstr()
340 if (First == Last) in findClosestSuitableAluInstr()
344 if (First->isDebugInstr()) in findClosestSuitableAluInstr()
347 if (isSuitableAluInstr(IsSpls, First, *Base, *Offset)) { in findClosestSuitableAluInstr()
348 return First; in findClosestSuitableAluInstr()
352 if (First != Last) { in findClosestSuitableAluInstr()
353 if (InstrUsesReg(First, Base)) in findClosestSuitableAluInstr()
355 if (Offset->isReg() && InstrUsesReg(First, Offset)) in findClosestSuitableAluInstr()
|
| /llvm-project/clang/test/Modules/ |
| H A D | compare-objc-interface.m | 41 module First {
96 …finitions in different modules; first difference is definition in module 'First.Hidden' found supe…
99 …finitions in different modules; first difference is definition in module 'First.Hidden' found no s…
102 …finitions in different modules; first difference is definition in module 'First.Hidden' found supe…
131 …finitions in different modules; first difference is definition in module 'First.Hidden' found 1 re…
134 …finitions in different modules; first difference is definition in module 'First.Hidden' found 0 re…
138 …finitions in different modules; first difference is definition in module 'First.Hidden' found 1st …
141 …finitions in different modules; first difference is definition in module 'First.Hidden' found 1st …
197 …m module 'Second' is not present in definition of 'CompareIVarPresence1' in module 'First.Hidden'}}
200 …finitions in different modules; first difference is definition in module 'First.Hidden' found end …
[all …]
|
| H A D | compare-objc-protocol.m | 46 module First {
107 …finitions in different modules; first difference is definition in module 'First.Hidden' found 1 re…
114 …finitions in different modules; first difference is definition in module 'First.Hidden' found 0 re…
118 …finitions in different modules; first difference is definition in module 'First.Hidden' found 1st …
121 …finitions in different modules; first difference is definition in module 'First.Hidden' found 1st …
220 …finitions in different modules; first difference is definition in module 'First.Hidden' found meth…
223 …finitions in different modules; first difference is definition in module 'First.Hidden' found end …
226 …finitions in different modules; first difference is definition in module 'First.Hidden' found meth…
230 …finitions in different modules; first difference is definition in module 'First.Hidden' found meth…
233 …finitions in different modules; first difference is definition in module 'First.Hidden' found meth…
[all …]
|
| /llvm-project/llvm/include/llvm/Support/ |
| H A D | HashBuilder.h | 328 HashBuilder &addRange(ForwardIteratorT First, ForwardIteratorT Last) { in addRange() argument
329 add(std::distance(First, Last)); in addRange()
330 return addRangeElements(First, Last); in addRange()
338 HashBuilder &addRangeElements(ForwardIteratorT First, ForwardIteratorT Last) { in addRangeElements() argument
340 First, Last, in addRangeElements()
366 HashBuilder &addRangeElementsImpl(ForwardIteratorT First, in addRangeElementsImpl() argument
369 for (auto It = First; It != Last; ++It) in addRangeElementsImpl()
378 addRangeElementsImpl(T *First, T *Last, std::forward_iterator_tag) { in addRangeElementsImpl() argument
379 this->update(ArrayRef(reinterpret_cast<const uint8_t *>(First), in addRangeElementsImpl()
380 (Last - First) * sizeof(T))); in addRangeElementsImpl()
|
| /llvm-project/clang-tools-extra/clang-tidy/modernize/ |
| H A D | MinMaxUseInitializerListCheck.cpp | 21 const Expr *First; member
35 Result.First = nullptr; in findArgs()
53 Result.First = *ArgIterator; in findArgs()
69 Result.First = Result.Args.front(); in findArgs()
146 if (!InnerResult.First || !InnerResult.Last) in generateReplacements()
172 if (InnerResult.First == InnerResult.Last) { in generateReplacements()
175 CharSourceRange::getTokenRange(InnerResult.First->getBeginLoc()))); in generateReplacements()
177 CharSourceRange::getTokenRange(InnerResult.First->getEndLoc()))); in generateReplacements()
266 if (Result.First != Result.Last) { in check()
268 Diagnostic << FixItHint::CreateInsertion(Result.First in check()
[all...] |
| /llvm-project/clang/test/AST/HLSL/ |
| H A D | this-reference.hlsl | 4 int First;
8 return this.First;
20 return this.First + Second;
27 Vals.First = Vals.getFirst();
31 ValsInfo.First = Vals.First;
41 // CHECK-NEXT:`-MemberExpr 0x{{[0-9A-Fa-f]+}} <col:11, col:16> 'int' lvalue .First 0x{{[0-9A-Fa-f]+…
56 // CHECK-NEXT:`-MemberExpr 0x{{[0-9A-Fa-f]+}} <col:12, col:17> 'int' lvalue .First 0x{{[0-9A-Fa-f]+…
|