Richard Trieu | e7f7ed2 | 2017-02-22 01:11:25 +0000 | [diff] [blame] | 1 | //===-- 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 | |
| 23 | using namespace clang; |
| 24 | |
Richard Trieu | 639d7b6 | 2017-02-22 22:22:42 +0000 | [diff] [blame] | 25 | void ODRHash::AddStmt(const Stmt *S) { |
| 26 | assert(S && "Expecting non-null pointer."); |
| 27 | S->ProcessODRHash(ID, *this); |
| 28 | } |
Richard Trieu | d078609 | 2017-02-23 00:23:01 +0000 | [diff] [blame] | 29 | |
| 30 | void ODRHash::AddIdentifierInfo(const IdentifierInfo *II) { |
| 31 | assert(II && "Expecting non-null pointer."); |
| 32 | ID.AddString(II->getName()); |
| 33 | } |
| 34 | |
Richard Trieu | 8459ddf | 2017-02-24 02:59:12 +0000 | [diff] [blame] | 35 | void 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 Trieu | e7f7ed2 | 2017-02-22 01:11:25 +0000 | [diff] [blame] | 84 | void ODRHash::AddNestedNameSpecifier(const NestedNameSpecifier *NNS) {} |
| 85 | void ODRHash::AddTemplateName(TemplateName Name) {} |
Richard Trieu | e7f7ed2 | 2017-02-22 01:11:25 +0000 | [diff] [blame] | 86 | void ODRHash::AddTemplateArgument(TemplateArgument TA) {} |
| 87 | void ODRHash::AddTemplateParameterList(const TemplateParameterList *TPL) {} |
| 88 | |
| 89 | void ODRHash::clear() { |
| 90 | DeclMap.clear(); |
| 91 | TypeMap.clear(); |
| 92 | Bools.clear(); |
| 93 | ID.clear(); |
| 94 | } |
| 95 | |
| 96 | unsigned 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. |
| 130 | class ODRDeclVisitor : public ConstDeclVisitor<ODRDeclVisitor> { |
| 131 | typedef ConstDeclVisitor<ODRDeclVisitor> Inherited; |
| 132 | llvm::FoldingSetNodeID &ID; |
Richard Trieu | 639d7b6 | 2017-02-22 22:22:42 +0000 | [diff] [blame] | 133 | ODRHash &Hash; |
Richard Trieu | e7f7ed2 | 2017-02-22 01:11:25 +0000 | [diff] [blame] | 134 | |
| 135 | public: |
Richard Trieu | 639d7b6 | 2017-02-22 22:22:42 +0000 | [diff] [blame] | 136 | 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 Trieu | e7f7ed2 | 2017-02-22 01:11:25 +0000 | [diff] [blame] | 145 | |
Richard Trieu | d078609 | 2017-02-23 00:23:01 +0000 | [diff] [blame] | 146 | void AddIdentifierInfo(const IdentifierInfo *II) { |
| 147 | Hash.AddBoolean(II); |
| 148 | if (II) { |
| 149 | Hash.AddIdentifierInfo(II); |
| 150 | } |
| 151 | } |
| 152 | |
Richard Trieu | bcaaf96 | 2017-02-23 03:25:57 +0000 | [diff] [blame] | 153 | void AddQualType(QualType T) { |
| 154 | Hash.AddQualType(T); |
| 155 | } |
| 156 | |
Richard Trieu | e7f7ed2 | 2017-02-22 01:11:25 +0000 | [diff] [blame] | 157 | void Visit(const Decl *D) { |
| 158 | ID.AddInteger(D->getKind()); |
| 159 | Inherited::Visit(D); |
| 160 | } |
| 161 | |
Richard Trieu | d078609 | 2017-02-23 00:23:01 +0000 | [diff] [blame] | 162 | void VisitNamedDecl(const NamedDecl *D) { |
| 163 | AddIdentifierInfo(D->getIdentifier()); |
| 164 | Inherited::VisitNamedDecl(D); |
| 165 | } |
| 166 | |
Richard Trieu | bcaaf96 | 2017-02-23 03:25:57 +0000 | [diff] [blame] | 167 | void VisitValueDecl(const ValueDecl *D) { |
| 168 | AddQualType(D->getType()); |
| 169 | Inherited::VisitValueDecl(D); |
| 170 | } |
| 171 | |
Richard Trieu | e7f7ed2 | 2017-02-22 01:11:25 +0000 | [diff] [blame] | 172 | void VisitAccessSpecDecl(const AccessSpecDecl *D) { |
| 173 | ID.AddInteger(D->getAccess()); |
| 174 | Inherited::VisitAccessSpecDecl(D); |
| 175 | } |
Richard Trieu | 639d7b6 | 2017-02-22 22:22:42 +0000 | [diff] [blame] | 176 | |
| 177 | void VisitStaticAssertDecl(const StaticAssertDecl *D) { |
| 178 | AddStmt(D->getAssertExpr()); |
| 179 | AddStmt(D->getMessage()); |
| 180 | |
| 181 | Inherited::VisitStaticAssertDecl(D); |
| 182 | } |
Richard Trieu | d078609 | 2017-02-23 00:23:01 +0000 | [diff] [blame] | 183 | |
| 184 | void VisitFieldDecl(const FieldDecl *D) { |
| 185 | Inherited::VisitFieldDecl(D); |
Richard Trieu | 93772fc | 2017-02-24 20:59:28 +0000 | [diff] [blame^] | 186 | |
| 187 | const bool IsBitfield = D->isBitField(); |
| 188 | Hash.AddBoolean(IsBitfield); |
| 189 | |
| 190 | if (IsBitfield) { |
| 191 | AddStmt(D->getBitWidth()); |
| 192 | } |
Richard Trieu | d078609 | 2017-02-23 00:23:01 +0000 | [diff] [blame] | 193 | } |
Richard Trieu | e7f7ed2 | 2017-02-22 01:11:25 +0000 | [diff] [blame] | 194 | }; |
| 195 | |
| 196 | // Only allow a small portion of Decl's to be processed. Remove this once |
| 197 | // all Decl's can be handled. |
| 198 | bool ODRHash::isWhitelistedDecl(const Decl *D, const CXXRecordDecl *Parent) { |
| 199 | if (D->isImplicit()) return false; |
| 200 | if (D->getDeclContext() != Parent) return false; |
| 201 | |
| 202 | switch (D->getKind()) { |
| 203 | default: |
| 204 | return false; |
| 205 | case Decl::AccessSpec: |
Richard Trieu | d078609 | 2017-02-23 00:23:01 +0000 | [diff] [blame] | 206 | case Decl::Field: |
Richard Trieu | 639d7b6 | 2017-02-22 22:22:42 +0000 | [diff] [blame] | 207 | case Decl::StaticAssert: |
Richard Trieu | e7f7ed2 | 2017-02-22 01:11:25 +0000 | [diff] [blame] | 208 | return true; |
| 209 | } |
| 210 | } |
| 211 | |
| 212 | void ODRHash::AddSubDecl(const Decl *D) { |
| 213 | assert(D && "Expecting non-null pointer."); |
| 214 | AddDecl(D); |
| 215 | |
Richard Trieu | 639d7b6 | 2017-02-22 22:22:42 +0000 | [diff] [blame] | 216 | ODRDeclVisitor(ID, *this).Visit(D); |
Richard Trieu | e7f7ed2 | 2017-02-22 01:11:25 +0000 | [diff] [blame] | 217 | } |
| 218 | |
| 219 | void ODRHash::AddCXXRecordDecl(const CXXRecordDecl *Record) { |
| 220 | assert(Record && Record->hasDefinition() && |
| 221 | "Expected non-null record to be a definition."); |
| 222 | AddDecl(Record); |
| 223 | |
| 224 | // Filter out sub-Decls which will not be processed in order to get an |
| 225 | // accurate count of Decl's. |
| 226 | llvm::SmallVector<const Decl *, 16> Decls; |
| 227 | for (const Decl *SubDecl : Record->decls()) { |
| 228 | if (isWhitelistedDecl(SubDecl, Record)) { |
| 229 | Decls.push_back(SubDecl); |
| 230 | } |
| 231 | } |
| 232 | |
| 233 | ID.AddInteger(Decls.size()); |
| 234 | for (auto SubDecl : Decls) { |
| 235 | AddSubDecl(SubDecl); |
| 236 | } |
| 237 | } |
| 238 | |
| 239 | void ODRHash::AddDecl(const Decl *D) { |
| 240 | assert(D && "Expecting non-null pointer."); |
| 241 | auto Result = DeclMap.insert(std::make_pair(D, DeclMap.size())); |
| 242 | ID.AddInteger(Result.first->second); |
| 243 | // On first encounter of a Decl pointer, process it. Every time afterwards, |
| 244 | // only the index value is needed. |
| 245 | if (!Result.second) { |
| 246 | return; |
| 247 | } |
| 248 | |
| 249 | ID.AddInteger(D->getKind()); |
Richard Trieu | 8459ddf | 2017-02-24 02:59:12 +0000 | [diff] [blame] | 250 | |
| 251 | if (const NamedDecl *ND = dyn_cast<NamedDecl>(D)) { |
| 252 | AddDeclarationName(ND->getDeclName()); |
| 253 | } |
Richard Trieu | e7f7ed2 | 2017-02-22 01:11:25 +0000 | [diff] [blame] | 254 | } |
| 255 | |
Richard Trieu | bcaaf96 | 2017-02-23 03:25:57 +0000 | [diff] [blame] | 256 | // Process a Type pointer. Add* methods call back into ODRHash while Visit* |
| 257 | // methods process the relevant parts of the Type. |
| 258 | class ODRTypeVisitor : public TypeVisitor<ODRTypeVisitor> { |
| 259 | typedef TypeVisitor<ODRTypeVisitor> Inherited; |
| 260 | llvm::FoldingSetNodeID &ID; |
| 261 | ODRHash &Hash; |
| 262 | |
| 263 | public: |
| 264 | ODRTypeVisitor(llvm::FoldingSetNodeID &ID, ODRHash &Hash) |
| 265 | : ID(ID), Hash(Hash) {} |
| 266 | |
| 267 | void AddStmt(Stmt *S) { |
| 268 | Hash.AddBoolean(S); |
| 269 | if (S) { |
| 270 | Hash.AddStmt(S); |
| 271 | } |
| 272 | } |
| 273 | |
Richard Trieu | 8459ddf | 2017-02-24 02:59:12 +0000 | [diff] [blame] | 274 | void AddDecl(Decl *D) { |
| 275 | Hash.AddBoolean(D); |
| 276 | if (D) { |
| 277 | Hash.AddDecl(D); |
| 278 | } |
| 279 | } |
| 280 | |
Richard Trieu | bcaaf96 | 2017-02-23 03:25:57 +0000 | [diff] [blame] | 281 | void Visit(const Type *T) { |
| 282 | ID.AddInteger(T->getTypeClass()); |
| 283 | Inherited::Visit(T); |
| 284 | } |
| 285 | |
| 286 | void VisitType(const Type *T) {} |
| 287 | |
| 288 | void VisitBuiltinType(const BuiltinType *T) { |
| 289 | ID.AddInteger(T->getKind()); |
| 290 | VisitType(T); |
| 291 | } |
Richard Trieu | 8459ddf | 2017-02-24 02:59:12 +0000 | [diff] [blame] | 292 | |
| 293 | void VisitTypedefType(const TypedefType *T) { |
| 294 | AddDecl(T->getDecl()); |
| 295 | VisitType(T); |
| 296 | } |
Richard Trieu | bcaaf96 | 2017-02-23 03:25:57 +0000 | [diff] [blame] | 297 | }; |
| 298 | |
| 299 | void ODRHash::AddType(const Type *T) { |
| 300 | assert(T && "Expecting non-null pointer."); |
| 301 | auto Result = TypeMap.insert(std::make_pair(T, TypeMap.size())); |
| 302 | ID.AddInteger(Result.first->second); |
| 303 | // On first encounter of a Type pointer, process it. Every time afterwards, |
| 304 | // only the index value is needed. |
| 305 | if (!Result.second) { |
| 306 | return; |
| 307 | } |
| 308 | |
| 309 | ODRTypeVisitor(ID, *this).Visit(T); |
| 310 | } |
| 311 | |
| 312 | void ODRHash::AddQualType(QualType T) { |
| 313 | AddBoolean(T.isNull()); |
| 314 | if (T.isNull()) |
| 315 | return; |
| 316 | SplitQualType split = T.split(); |
| 317 | ID.AddInteger(split.Quals.getAsOpaqueValue()); |
| 318 | AddType(split.Ty); |
| 319 | } |
| 320 | |
Richard Trieu | e7f7ed2 | 2017-02-22 01:11:25 +0000 | [diff] [blame] | 321 | void ODRHash::AddBoolean(bool Value) { |
| 322 | Bools.push_back(Value); |
| 323 | } |