@@ -177,8 +177,9 @@ namespace clang {
177177
178178 // / Collect the first declaration from each module file that provides a
179179 // / declaration of D.
180- void CollectFirstDeclFromEachModule (const Decl *D, bool IncludeLocal,
181- llvm::MapVector<ModuleFile*, const Decl*> &Firsts) {
180+ void CollectFirstDeclFromEachModule (
181+ const Decl *D, bool IncludeLocal,
182+ llvm::MapVector<ModuleFile *, const Decl *> &Firsts) {
182183
183184 // FIXME: We can skip entries that we know are implied by others.
184185 for (const Decl *R = D->getMostRecentDecl (); R; R = R->getPreviousDecl ()) {
@@ -193,7 +194,7 @@ namespace clang {
193194 // / provides a declaration of D. The intent is to provide a sufficient
194195 // / set such that reloading this set will load all current redeclarations.
195196 void AddFirstDeclFromEachModule (const Decl *D, bool IncludeLocal) {
196- llvm::MapVector<ModuleFile*, const Decl*> Firsts;
197+ llvm::MapVector<ModuleFile *, const Decl *> Firsts;
197198 CollectFirstDeclFromEachModule (D, IncludeLocal, Firsts);
198199
199200 for (const auto &F : Firsts)
@@ -207,9 +208,9 @@ namespace clang {
207208 void AddFirstSpecializationDeclFromEachModule (const Decl *D,
208209 bool IncludeLocal) {
209210 assert (isa<ClassTemplateSpecializationDecl>(D) ||
210- isa<VarTemplateSpecializationDecl>(D) || isa<FunctionDecl>(D) &&
211- " Must not be called with other decls" );
212- llvm::MapVector<ModuleFile*, const Decl*> Firsts;
211+ isa<VarTemplateSpecializationDecl>(D) ||
212+ isa<FunctionDecl>(D) && " Must not be called with other decls" );
213+ llvm::MapVector<ModuleFile *, const Decl *> Firsts;
213214 CollectFirstDeclFromEachModule (D, IncludeLocal, Firsts);
214215
215216 for (const auto &F : Firsts) {
@@ -223,9 +224,9 @@ namespace clang {
223224 Args = FD->getTemplateSpecializationArgs ()->asArray ();
224225 assert (Args.size ());
225226 Record.push_back (TemplateArgumentList::ComputeODRHash (Args));
226- bool IsPartialSpecialization
227- = isa<ClassTemplatePartialSpecializationDecl>(D) ||
228- isa<VarTemplatePartialSpecializationDecl>(D);
227+ bool IsPartialSpecialization =
228+ isa<ClassTemplatePartialSpecializationDecl>(D) ||
229+ isa<VarTemplatePartialSpecializationDecl>(D);
229230 Record.push_back (IsPartialSpecialization);
230231 }
231232 }
@@ -260,8 +261,8 @@ namespace clang {
260261 assert (!Common->LazySpecializations );
261262 }
262263
263- using LazySpecializationInfo
264- = RedeclarableTemplateDecl::LazySpecializationInfo;
264+ using LazySpecializationInfo =
265+ RedeclarableTemplateDecl::LazySpecializationInfo;
265266 ArrayRef<LazySpecializationInfo> LazySpecializations;
266267 if (auto *LS = Common->LazySpecializations )
267268 LazySpecializations = llvm::ArrayRef (LS + 1 , LS[0 ].DeclID );
@@ -280,7 +281,7 @@ namespace clang {
280281
281282 for (auto *D : Specs) {
282283 assert (D->isCanonicalDecl () && " non-canonical decl in set" );
283- AddFirstSpecializationDeclFromEachModule (D, /* IncludeLocal*/ true );
284+ AddFirstSpecializationDeclFromEachModule (D, /* IncludeLocal*/ true );
284285 }
285286 for (auto &SpecInfo : LazySpecializations) {
286287 Record.push_back (SpecInfo.DeclID );
@@ -291,8 +292,8 @@ namespace clang {
291292 // Update the size entry we added earlier. We linerized the
292293 // LazySpecializationInfo members and we need to adjust the size as we
293294 // will read them always together.
294- assert ((Record.size () - I - 1 ) % 3 == 0
295- && " Must be divisible by LazySpecializationInfo count!" );
295+ assert ((Record.size () - I - 1 ) % 3 == 0 &&
296+ " Must be divisible by LazySpecializationInfo count!" );
296297 Record[I] = (Record.size () - I - 1 ) / 3 ;
297298 }
298299
0 commit comments