blob: d1473948b0b5c65a2267d4796b95f39d1427f587 [file] [log] [blame]
Richard Trieue7f7ed22017-02-22 01:11:25 +00001//===-- ODRHash.cpp - Hashing to diagnose ODR failures ----------*- C++ -*-===//
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/// \file
11/// This file implements the ODRHash class, which calculates a hash based
12/// on AST nodes, which is stable across different runs.
13///
14//===----------------------------------------------------------------------===//
15
16#include "clang/AST/ODRHash.h"
17
18#include "clang/AST/DeclVisitor.h"
19#include "clang/AST/NestedNameSpecifier.h"
20#include "clang/AST/StmtVisitor.h"
21#include "clang/AST/TypeVisitor.h"
22
23using namespace clang;
24
Richard Trieu639d7b62017-02-22 22:22:42 +000025void ODRHash::AddStmt(const Stmt *S) {
26 assert(S && "Expecting non-null pointer.");
27 S->ProcessODRHash(ID, *this);
28}
Richard Trieud0786092017-02-23 00:23:01 +000029
30void ODRHash::AddIdentifierInfo(const IdentifierInfo *II) {
31 assert(II && "Expecting non-null pointer.");
32 ID.AddString(II->getName());
33}
34
Richard Trieu8459ddf2017-02-24 02:59:12 +000035void ODRHash::AddDeclarationName(DeclarationName Name) {
36 AddBoolean(Name.isEmpty());
37 if (Name.isEmpty())
38 return;
39
40 auto Kind = Name.getNameKind();
41 ID.AddInteger(Kind);
42 switch (Kind) {
43 case DeclarationName::Identifier:
44 AddIdentifierInfo(Name.getAsIdentifierInfo());
45 break;
46 case DeclarationName::ObjCZeroArgSelector:
47 case DeclarationName::ObjCOneArgSelector:
48 case DeclarationName::ObjCMultiArgSelector: {
49 Selector S = Name.getObjCSelector();
50 AddBoolean(S.isNull());
51 AddBoolean(S.isKeywordSelector());
52 AddBoolean(S.isUnarySelector());
53 unsigned NumArgs = S.getNumArgs();
54 for (unsigned i = 0; i < NumArgs; ++i) {
55 AddIdentifierInfo(S.getIdentifierInfoForSlot(i));
56 }
57 break;
58 }
59 case DeclarationName::CXXConstructorName:
60 case DeclarationName::CXXDestructorName:
61 AddQualType(Name.getCXXNameType());
62 break;
63 case DeclarationName::CXXOperatorName:
64 ID.AddInteger(Name.getCXXOverloadedOperator());
65 break;
66 case DeclarationName::CXXLiteralOperatorName:
67 AddIdentifierInfo(Name.getCXXLiteralIdentifier());
68 break;
69 case DeclarationName::CXXConversionFunctionName:
70 AddQualType(Name.getCXXNameType());
71 break;
72 case DeclarationName::CXXUsingDirective:
73 break;
74 case DeclarationName::CXXDeductionGuideName: {
75 auto *Template = Name.getCXXDeductionGuideTemplate();
76 AddBoolean(Template);
77 if (Template) {
78 AddDecl(Template);
79 }
80 }
81 }
82}
83
Richard Trieue7f7ed22017-02-22 01:11:25 +000084void ODRHash::AddNestedNameSpecifier(const NestedNameSpecifier *NNS) {}
85void ODRHash::AddTemplateName(TemplateName Name) {}
Richard Trieue7f7ed22017-02-22 01:11:25 +000086void ODRHash::AddTemplateArgument(TemplateArgument TA) {}
87void ODRHash::AddTemplateParameterList(const TemplateParameterList *TPL) {}
88
89void ODRHash::clear() {
90 DeclMap.clear();
91 TypeMap.clear();
92 Bools.clear();
93 ID.clear();
94}
95
96unsigned ODRHash::CalculateHash() {
97 // Append the bools to the end of the data segment backwards. This allows
98 // for the bools data to be compressed 32 times smaller compared to using
99 // ID.AddBoolean
100 const unsigned unsigned_bits = sizeof(unsigned) * CHAR_BIT;
101 const unsigned size = Bools.size();
102 const unsigned remainder = size % unsigned_bits;
103 const unsigned loops = size / unsigned_bits;
104 auto I = Bools.rbegin();
105 unsigned value = 0;
106 for (unsigned i = 0; i < remainder; ++i) {
107 value <<= 1;
108 value |= *I;
109 ++I;
110 }
111 ID.AddInteger(value);
112
113 for (unsigned i = 0; i < loops; ++i) {
114 value = 0;
115 for (unsigned j = 0; j < unsigned_bits; ++j) {
116 value <<= 1;
117 value |= *I;
118 ++I;
119 }
120 ID.AddInteger(value);
121 }
122
123 assert(I == Bools.rend());
124 Bools.clear();
125 return ID.ComputeHash();
126}
127
128// Process a Decl pointer. Add* methods call back into ODRHash while Visit*
129// methods process the relevant parts of the Decl.
130class ODRDeclVisitor : public ConstDeclVisitor<ODRDeclVisitor> {
131 typedef ConstDeclVisitor<ODRDeclVisitor> Inherited;
132 llvm::FoldingSetNodeID &ID;
Richard Trieu639d7b62017-02-22 22:22:42 +0000133 ODRHash &Hash;
Richard Trieue7f7ed22017-02-22 01:11:25 +0000134
135public:
Richard Trieu639d7b62017-02-22 22:22:42 +0000136 ODRDeclVisitor(llvm::FoldingSetNodeID &ID, ODRHash &Hash)
137 : ID(ID), Hash(Hash) {}
138
139 void AddStmt(const Stmt *S) {
140 Hash.AddBoolean(S);
141 if (S) {
142 Hash.AddStmt(S);
143 }
144 }
Richard Trieue7f7ed22017-02-22 01:11:25 +0000145
Richard Trieud0786092017-02-23 00:23:01 +0000146 void AddIdentifierInfo(const IdentifierInfo *II) {
147 Hash.AddBoolean(II);
148 if (II) {
149 Hash.AddIdentifierInfo(II);
150 }
151 }
152
Richard Trieubcaaf962017-02-23 03:25:57 +0000153 void AddQualType(QualType T) {
154 Hash.AddQualType(T);
155 }
156
Richard Trieue7f7ed22017-02-22 01:11:25 +0000157 void Visit(const Decl *D) {
158 ID.AddInteger(D->getKind());
159 Inherited::Visit(D);
160 }
161
Richard Trieud0786092017-02-23 00:23:01 +0000162 void VisitNamedDecl(const NamedDecl *D) {
163 AddIdentifierInfo(D->getIdentifier());
164 Inherited::VisitNamedDecl(D);
165 }
166
Richard Trieubcaaf962017-02-23 03:25:57 +0000167 void VisitValueDecl(const ValueDecl *D) {
168 AddQualType(D->getType());
169 Inherited::VisitValueDecl(D);
170 }
171
Richard Trieue7f7ed22017-02-22 01:11:25 +0000172 void VisitAccessSpecDecl(const AccessSpecDecl *D) {
173 ID.AddInteger(D->getAccess());
174 Inherited::VisitAccessSpecDecl(D);
175 }
Richard Trieu639d7b62017-02-22 22:22:42 +0000176
177 void VisitStaticAssertDecl(const StaticAssertDecl *D) {
178 AddStmt(D->getAssertExpr());
179 AddStmt(D->getMessage());
180
181 Inherited::VisitStaticAssertDecl(D);
182 }
Richard Trieud0786092017-02-23 00:23:01 +0000183
184 void VisitFieldDecl(const FieldDecl *D) {
185 Inherited::VisitFieldDecl(D);
186 }
Richard Trieue7f7ed22017-02-22 01:11:25 +0000187};
188
189// Only allow a small portion of Decl's to be processed. Remove this once
190// all Decl's can be handled.
191bool ODRHash::isWhitelistedDecl(const Decl *D, const CXXRecordDecl *Parent) {
192 if (D->isImplicit()) return false;
193 if (D->getDeclContext() != Parent) return false;
194
195 switch (D->getKind()) {
196 default:
197 return false;
198 case Decl::AccessSpec:
Richard Trieud0786092017-02-23 00:23:01 +0000199 case Decl::Field:
Richard Trieu639d7b62017-02-22 22:22:42 +0000200 case Decl::StaticAssert:
Richard Trieue7f7ed22017-02-22 01:11:25 +0000201 return true;
202 }
203}
204
205void ODRHash::AddSubDecl(const Decl *D) {
206 assert(D && "Expecting non-null pointer.");
207 AddDecl(D);
208
Richard Trieu639d7b62017-02-22 22:22:42 +0000209 ODRDeclVisitor(ID, *this).Visit(D);
Richard Trieue7f7ed22017-02-22 01:11:25 +0000210}
211
212void ODRHash::AddCXXRecordDecl(const CXXRecordDecl *Record) {
213 assert(Record && Record->hasDefinition() &&
214 "Expected non-null record to be a definition.");
215 AddDecl(Record);
216
217 // Filter out sub-Decls which will not be processed in order to get an
218 // accurate count of Decl's.
219 llvm::SmallVector<const Decl *, 16> Decls;
220 for (const Decl *SubDecl : Record->decls()) {
221 if (isWhitelistedDecl(SubDecl, Record)) {
222 Decls.push_back(SubDecl);
223 }
224 }
225
226 ID.AddInteger(Decls.size());
227 for (auto SubDecl : Decls) {
228 AddSubDecl(SubDecl);
229 }
230}
231
232void ODRHash::AddDecl(const Decl *D) {
233 assert(D && "Expecting non-null pointer.");
234 auto Result = DeclMap.insert(std::make_pair(D, DeclMap.size()));
235 ID.AddInteger(Result.first->second);
236 // On first encounter of a Decl pointer, process it. Every time afterwards,
237 // only the index value is needed.
238 if (!Result.second) {
239 return;
240 }
241
242 ID.AddInteger(D->getKind());
Richard Trieu8459ddf2017-02-24 02:59:12 +0000243
244 if (const NamedDecl *ND = dyn_cast<NamedDecl>(D)) {
245 AddDeclarationName(ND->getDeclName());
246 }
Richard Trieue7f7ed22017-02-22 01:11:25 +0000247}
248
Richard Trieubcaaf962017-02-23 03:25:57 +0000249// Process a Type pointer. Add* methods call back into ODRHash while Visit*
250// methods process the relevant parts of the Type.
251class ODRTypeVisitor : public TypeVisitor<ODRTypeVisitor> {
252 typedef TypeVisitor<ODRTypeVisitor> Inherited;
253 llvm::FoldingSetNodeID &ID;
254 ODRHash &Hash;
255
256public:
257 ODRTypeVisitor(llvm::FoldingSetNodeID &ID, ODRHash &Hash)
258 : ID(ID), Hash(Hash) {}
259
260 void AddStmt(Stmt *S) {
261 Hash.AddBoolean(S);
262 if (S) {
263 Hash.AddStmt(S);
264 }
265 }
266
Richard Trieu8459ddf2017-02-24 02:59:12 +0000267 void AddDecl(Decl *D) {
268 Hash.AddBoolean(D);
269 if (D) {
270 Hash.AddDecl(D);
271 }
272 }
273
Richard Trieubcaaf962017-02-23 03:25:57 +0000274 void Visit(const Type *T) {
275 ID.AddInteger(T->getTypeClass());
276 Inherited::Visit(T);
277 }
278
279 void VisitType(const Type *T) {}
280
281 void VisitBuiltinType(const BuiltinType *T) {
282 ID.AddInteger(T->getKind());
283 VisitType(T);
284 }
Richard Trieu8459ddf2017-02-24 02:59:12 +0000285
286 void VisitTypedefType(const TypedefType *T) {
287 AddDecl(T->getDecl());
288 VisitType(T);
289 }
Richard Trieubcaaf962017-02-23 03:25:57 +0000290};
291
292void ODRHash::AddType(const Type *T) {
293 assert(T && "Expecting non-null pointer.");
294 auto Result = TypeMap.insert(std::make_pair(T, TypeMap.size()));
295 ID.AddInteger(Result.first->second);
296 // On first encounter of a Type pointer, process it. Every time afterwards,
297 // only the index value is needed.
298 if (!Result.second) {
299 return;
300 }
301
302 ODRTypeVisitor(ID, *this).Visit(T);
303}
304
305void ODRHash::AddQualType(QualType T) {
306 AddBoolean(T.isNull());
307 if (T.isNull())
308 return;
309 SplitQualType split = T.split();
310 ID.AddInteger(split.Quals.getAsOpaqueValue());
311 AddType(split.Ty);
312}
313
Richard Trieue7f7ed22017-02-22 01:11:25 +0000314void ODRHash::AddBoolean(bool Value) {
315 Bools.push_back(Value);
316}