@@ -181,8 +181,9 @@ namespace clang {
181181
182182 // / Collect the first declaration from each module file that provides a
183183 // / declaration of D.
184- void CollectFirstDeclFromEachModule (const Decl *D, bool IncludeLocal,
185- llvm::MapVector<ModuleFile*, const Decl*> &Firsts) {
184+ void CollectFirstDeclFromEachModule (
185+ const Decl *D, bool IncludeLocal,
186+ llvm::MapVector<ModuleFile *, const Decl *> &Firsts) {
186187
187188 // FIXME: We can skip entries that we know are implied by others.
188189 for (const Decl *R = D->getMostRecentDecl (); R; R = R->getPreviousDecl ()) {
@@ -197,7 +198,7 @@ namespace clang {
197198 // / provides a declaration of D. The intent is to provide a sufficient
198199 // / set such that reloading this set will load all current redeclarations.
199200 void AddFirstDeclFromEachModule (const Decl *D, bool IncludeLocal) {
200- llvm::MapVector<ModuleFile*, const Decl*> Firsts;
201+ llvm::MapVector<ModuleFile *, const Decl *> Firsts;
201202 CollectFirstDeclFromEachModule (D, IncludeLocal, Firsts);
202203
203204 for (const auto &F : Firsts)
@@ -211,9 +212,9 @@ namespace clang {
211212 void AddFirstSpecializationDeclFromEachModule (const Decl *D,
212213 bool IncludeLocal) {
213214 assert (isa<ClassTemplateSpecializationDecl>(D) ||
214- isa<VarTemplateSpecializationDecl>(D) || isa<FunctionDecl>(D) &&
215- " Must not be called with other decls" );
216- llvm::MapVector<ModuleFile*, const Decl*> Firsts;
215+ isa<VarTemplateSpecializationDecl>(D) ||
216+ isa<FunctionDecl>(D) && " Must not be called with other decls" );
217+ llvm::MapVector<ModuleFile *, const Decl *> Firsts;
217218 CollectFirstDeclFromEachModule (D, IncludeLocal, Firsts);
218219
219220 for (const auto &F : Firsts) {
@@ -227,9 +228,9 @@ namespace clang {
227228 Args = FD->getTemplateSpecializationArgs ()->asArray ();
228229 assert (Args.size ());
229230 Record.push_back (TemplateArgumentList::ComputeODRHash (Args));
230- bool IsPartialSpecialization
231- = isa<ClassTemplatePartialSpecializationDecl>(D) ||
232- isa<VarTemplatePartialSpecializationDecl>(D);
231+ bool IsPartialSpecialization =
232+ isa<ClassTemplatePartialSpecializationDecl>(D) ||
233+ isa<VarTemplatePartialSpecializationDecl>(D);
233234 Record.push_back (IsPartialSpecialization);
234235 }
235236 }
@@ -264,8 +265,8 @@ namespace clang {
264265 assert (!Common->LazySpecializations );
265266 }
266267
267- using LazySpecializationInfo
268- = RedeclarableTemplateDecl::LazySpecializationInfo;
268+ using LazySpecializationInfo =
269+ RedeclarableTemplateDecl::LazySpecializationInfo;
269270 ArrayRef<LazySpecializationInfo> LazySpecializations;
270271 if (auto *LS = Common->LazySpecializations )
271272 LazySpecializations = llvm::ArrayRef (LS + 1 , LS[0 ].DeclID );
@@ -284,7 +285,7 @@ namespace clang {
284285
285286 for (auto *D : Specs) {
286287 assert (D->isCanonicalDecl () && " non-canonical decl in set" );
287- AddFirstSpecializationDeclFromEachModule (D, /* IncludeLocal*/ true );
288+ AddFirstSpecializationDeclFromEachModule (D, /* IncludeLocal*/ true );
288289 }
289290 for (auto &SpecInfo : LazySpecializations) {
290291 Record.push_back (SpecInfo.DeclID );
@@ -295,8 +296,8 @@ namespace clang {
295296 // Update the size entry we added earlier. We linerized the
296297 // LazySpecializationInfo members and we need to adjust the size as we
297298 // will read them always together.
298- assert ((Record.size () - I - 1 ) % 3 == 0
299- && " Must be divisible by LazySpecializationInfo count!" );
299+ assert ((Record.size () - I - 1 ) % 3 == 0 &&
300+ " Must be divisible by LazySpecializationInfo count!" );
300301 Record[I] = (Record.size () - I - 1 ) / 3 ;
301302 }
302303
0 commit comments