ParseCXXInlineMethods.cpp revision 201361
1//===--- ParseCXXInlineMethods.cpp - C++ class inline methods parsing------===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// License. See LICENSE.TXT for details. 7// 8//===----------------------------------------------------------------------===// 9// 10// This file implements parsing for C++ class inline methods. 11// 12//===----------------------------------------------------------------------===// 13 14#include "clang/Parse/ParseDiagnostic.h" 15#include "clang/Parse/Parser.h" 16#include "clang/Parse/DeclSpec.h" 17#include "clang/Parse/Scope.h" 18using namespace clang; 19 20/// ParseCXXInlineMethodDef - We parsed and verified that the specified 21/// Declarator is a well formed C++ inline method definition. Now lex its body 22/// and store its tokens for parsing after the C++ class is complete. 23Parser::DeclPtrTy 24Parser::ParseCXXInlineMethodDef(AccessSpecifier AS, Declarator &D, 25 const ParsedTemplateInfo &TemplateInfo) { 26 assert(D.getTypeObject(0).Kind == DeclaratorChunk::Function && 27 "This isn't a function declarator!"); 28 assert((Tok.is(tok::l_brace) || Tok.is(tok::colon) || Tok.is(tok::kw_try)) && 29 "Current token not a '{', ':' or 'try'!"); 30 31 Action::MultiTemplateParamsArg TemplateParams(Actions, 32 TemplateInfo.TemplateParams? TemplateInfo.TemplateParams->data() : 0, 33 TemplateInfo.TemplateParams? TemplateInfo.TemplateParams->size() : 0); 34 DeclPtrTy FnD; 35 if (D.getDeclSpec().isFriendSpecified()) 36 // FIXME: Friend templates 37 FnD = Actions.ActOnFriendFunctionDecl(CurScope, D, true, move(TemplateParams)); 38 else // FIXME: pass template information through 39 FnD = Actions.ActOnCXXMemberDeclarator(CurScope, AS, D, 40 move(TemplateParams), 0, 0, 41 /*IsDefinition*/true); 42 43 HandleMemberFunctionDefaultArgs(D, FnD); 44 45 // Consume the tokens and store them for later parsing. 46 47 getCurrentClass().MethodDefs.push_back(LexedMethod(FnD)); 48 getCurrentClass().MethodDefs.back().TemplateScope 49 = CurScope->isTemplateParamScope(); 50 CachedTokens &Toks = getCurrentClass().MethodDefs.back().Toks; 51 52 tok::TokenKind kind = Tok.getKind(); 53 // We may have a constructor initializer or function-try-block here. 54 if (kind == tok::colon || kind == tok::kw_try) { 55 // Consume everything up to (and including) the left brace. 56 if (!ConsumeAndStoreUntil(tok::l_brace, tok::unknown, Toks, tok::semi)) { 57 // We didn't find the left-brace we expected after the 58 // constructor initializer. 59 if (Tok.is(tok::semi)) { 60 // We found a semicolon; complain, consume the semicolon, and 61 // don't try to parse this method later. 62 Diag(Tok.getLocation(), diag::err_expected_lbrace); 63 ConsumeAnyToken(); 64 getCurrentClass().MethodDefs.pop_back(); 65 return FnD; 66 } 67 } 68 69 } else { 70 // Begin by storing the '{' token. 71 Toks.push_back(Tok); 72 ConsumeBrace(); 73 } 74 // Consume everything up to (and including) the matching right brace. 75 ConsumeAndStoreUntil(tok::r_brace, tok::unknown, Toks); 76 77 // If we're in a function-try-block, we need to store all the catch blocks. 78 if (kind == tok::kw_try) { 79 while (Tok.is(tok::kw_catch)) { 80 ConsumeAndStoreUntil(tok::l_brace, tok::unknown, Toks); 81 ConsumeAndStoreUntil(tok::r_brace, tok::unknown, Toks); 82 } 83 } 84 85 return FnD; 86} 87 88/// ParseLexedMethodDeclarations - We finished parsing the member 89/// specification of a top (non-nested) C++ class. Now go over the 90/// stack of method declarations with some parts for which parsing was 91/// delayed (such as default arguments) and parse them. 92void Parser::ParseLexedMethodDeclarations(ParsingClass &Class) { 93 bool HasTemplateScope = !Class.TopLevelClass && Class.TemplateScope; 94 ParseScope TemplateScope(this, Scope::TemplateParamScope, HasTemplateScope); 95 if (HasTemplateScope) 96 Actions.ActOnReenterTemplateScope(CurScope, Class.TagOrTemplate); 97 98 // The current scope is still active if we're the top-level class. 99 // Otherwise we'll need to push and enter a new scope. 100 bool HasClassScope = !Class.TopLevelClass; 101 ParseScope ClassScope(this, Scope::ClassScope|Scope::DeclScope, HasClassScope); 102 if (HasClassScope) 103 Actions.ActOnStartDelayedMemberDeclarations(CurScope, Class.TagOrTemplate); 104 105 for (; !Class.MethodDecls.empty(); Class.MethodDecls.pop_front()) { 106 LateParsedMethodDeclaration &LM = Class.MethodDecls.front(); 107 108 // If this is a member template, introduce the template parameter scope. 109 ParseScope TemplateScope(this, Scope::TemplateParamScope, LM.TemplateScope); 110 if (LM.TemplateScope) 111 Actions.ActOnReenterTemplateScope(CurScope, LM.Method); 112 113 // Start the delayed C++ method declaration 114 Actions.ActOnStartDelayedCXXMethodDeclaration(CurScope, LM.Method); 115 116 // Introduce the parameters into scope and parse their default 117 // arguments. 118 ParseScope PrototypeScope(this, 119 Scope::FunctionPrototypeScope|Scope::DeclScope); 120 for (unsigned I = 0, N = LM.DefaultArgs.size(); I != N; ++I) { 121 // Introduce the parameter into scope. 122 Actions.ActOnDelayedCXXMethodParameter(CurScope, LM.DefaultArgs[I].Param); 123 124 if (CachedTokens *Toks = LM.DefaultArgs[I].Toks) { 125 // Parse the default argument from its saved token stream. 126 Toks->push_back(Tok); // So that the current token doesn't get lost 127 PP.EnterTokenStream(&Toks->front(), Toks->size(), true, false); 128 129 // Consume the previously-pushed token. 130 ConsumeAnyToken(); 131 132 // Consume the '='. 133 assert(Tok.is(tok::equal) && "Default argument not starting with '='"); 134 SourceLocation EqualLoc = ConsumeToken(); 135 136 OwningExprResult DefArgResult(ParseAssignmentExpression()); 137 if (DefArgResult.isInvalid()) 138 Actions.ActOnParamDefaultArgumentError(LM.DefaultArgs[I].Param); 139 else 140 Actions.ActOnParamDefaultArgument(LM.DefaultArgs[I].Param, EqualLoc, 141 move(DefArgResult)); 142 delete Toks; 143 LM.DefaultArgs[I].Toks = 0; 144 } 145 } 146 PrototypeScope.Exit(); 147 148 // Finish the delayed C++ method declaration. 149 Actions.ActOnFinishDelayedCXXMethodDeclaration(CurScope, LM.Method); 150 } 151 152 for (unsigned I = 0, N = Class.NestedClasses.size(); I != N; ++I) 153 ParseLexedMethodDeclarations(*Class.NestedClasses[I]); 154 155 if (HasClassScope) 156 Actions.ActOnFinishDelayedMemberDeclarations(CurScope, Class.TagOrTemplate); 157} 158 159/// ParseLexedMethodDefs - We finished parsing the member specification of a top 160/// (non-nested) C++ class. Now go over the stack of lexed methods that were 161/// collected during its parsing and parse them all. 162void Parser::ParseLexedMethodDefs(ParsingClass &Class) { 163 bool HasTemplateScope = !Class.TopLevelClass && Class.TemplateScope; 164 ParseScope TemplateScope(this, Scope::TemplateParamScope, HasTemplateScope); 165 if (HasTemplateScope) 166 Actions.ActOnReenterTemplateScope(CurScope, Class.TagOrTemplate); 167 168 bool HasClassScope = !Class.TopLevelClass; 169 ParseScope ClassScope(this, Scope::ClassScope|Scope::DeclScope, 170 HasClassScope); 171 172 for (; !Class.MethodDefs.empty(); Class.MethodDefs.pop_front()) { 173 LexedMethod &LM = Class.MethodDefs.front(); 174 175 // If this is a member template, introduce the template parameter scope. 176 ParseScope TemplateScope(this, Scope::TemplateParamScope, LM.TemplateScope); 177 if (LM.TemplateScope) 178 Actions.ActOnReenterTemplateScope(CurScope, LM.D); 179 180 assert(!LM.Toks.empty() && "Empty body!"); 181 // Append the current token at the end of the new token stream so that it 182 // doesn't get lost. 183 LM.Toks.push_back(Tok); 184 PP.EnterTokenStream(LM.Toks.data(), LM.Toks.size(), true, false); 185 186 // Consume the previously pushed token. 187 ConsumeAnyToken(); 188 assert((Tok.is(tok::l_brace) || Tok.is(tok::colon) || Tok.is(tok::kw_try)) 189 && "Inline method not starting with '{', ':' or 'try'"); 190 191 // Parse the method body. Function body parsing code is similar enough 192 // to be re-used for method bodies as well. 193 ParseScope FnScope(this, Scope::FnScope|Scope::DeclScope); 194 Actions.ActOnStartOfFunctionDef(CurScope, LM.D); 195 196 if (Tok.is(tok::kw_try)) { 197 ParseFunctionTryBlock(LM.D); 198 continue; 199 } 200 if (Tok.is(tok::colon)) 201 ParseConstructorInitializer(LM.D); 202 else 203 Actions.ActOnDefaultCtorInitializers(LM.D); 204 205 // FIXME: What if ParseConstructorInitializer doesn't leave us with a '{'?? 206 ParseFunctionStatementBody(LM.D); 207 } 208 209 for (unsigned I = 0, N = Class.NestedClasses.size(); I != N; ++I) 210 ParseLexedMethodDefs(*Class.NestedClasses[I]); 211} 212 213/// ConsumeAndStoreUntil - Consume and store the token at the passed token 214/// container until the token 'T' is reached (which gets 215/// consumed/stored too, if ConsumeFinalToken). 216/// If EarlyAbortIf is specified, then we will stop early if we find that 217/// token at the top level. 218/// Returns true if token 'T1' or 'T2' was found. 219/// NOTE: This is a specialized version of Parser::SkipUntil. 220bool Parser::ConsumeAndStoreUntil(tok::TokenKind T1, tok::TokenKind T2, 221 CachedTokens &Toks, 222 tok::TokenKind EarlyAbortIf, 223 bool ConsumeFinalToken) { 224 // We always want this function to consume at least one token if the first 225 // token isn't T and if not at EOF. 226 bool isFirstTokenConsumed = true; 227 while (1) { 228 // If we found one of the tokens, stop and return true. 229 if (Tok.is(T1) || Tok.is(T2)) { 230 if (ConsumeFinalToken) { 231 Toks.push_back(Tok); 232 ConsumeAnyToken(); 233 } 234 return true; 235 } 236 237 // If we found the early-abort token, return. 238 if (Tok.is(EarlyAbortIf)) 239 return false; 240 241 switch (Tok.getKind()) { 242 case tok::eof: 243 // Ran out of tokens. 244 return false; 245 246 case tok::l_paren: 247 // Recursively consume properly-nested parens. 248 Toks.push_back(Tok); 249 ConsumeParen(); 250 ConsumeAndStoreUntil(tok::r_paren, tok::unknown, Toks); 251 break; 252 case tok::l_square: 253 // Recursively consume properly-nested square brackets. 254 Toks.push_back(Tok); 255 ConsumeBracket(); 256 ConsumeAndStoreUntil(tok::r_square, tok::unknown, Toks); 257 break; 258 case tok::l_brace: 259 // Recursively consume properly-nested braces. 260 Toks.push_back(Tok); 261 ConsumeBrace(); 262 ConsumeAndStoreUntil(tok::r_brace, tok::unknown, Toks); 263 break; 264 265 // Okay, we found a ']' or '}' or ')', which we think should be balanced. 266 // Since the user wasn't looking for this token (if they were, it would 267 // already be handled), this isn't balanced. If there is a LHS token at a 268 // higher level, we will assume that this matches the unbalanced token 269 // and return it. Otherwise, this is a spurious RHS token, which we skip. 270 case tok::r_paren: 271 if (ParenCount && !isFirstTokenConsumed) 272 return false; // Matches something. 273 Toks.push_back(Tok); 274 ConsumeParen(); 275 break; 276 case tok::r_square: 277 if (BracketCount && !isFirstTokenConsumed) 278 return false; // Matches something. 279 Toks.push_back(Tok); 280 ConsumeBracket(); 281 break; 282 case tok::r_brace: 283 if (BraceCount && !isFirstTokenConsumed) 284 return false; // Matches something. 285 Toks.push_back(Tok); 286 ConsumeBrace(); 287 break; 288 289 case tok::string_literal: 290 case tok::wide_string_literal: 291 Toks.push_back(Tok); 292 ConsumeStringToken(); 293 break; 294 default: 295 // consume this token. 296 Toks.push_back(Tok); 297 ConsumeToken(); 298 break; 299 } 300 isFirstTokenConsumed = false; 301 } 302} 303