Use the full hash as a filter to reduce # strcmps
llvm-svn: 39057
diff --git a/clang/Lex/IdentifierTable.cpp b/clang/Lex/IdentifierTable.cpp
index 734e82f..fa48bcc 100644
--- a/clang/Lex/IdentifierTable.cpp
+++ b/clang/Lex/IdentifierTable.cpp
@@ -187,6 +187,7 @@
for (IdentifierBucket *Identifier = IdentHead, *LastID = 0; Identifier;
LastID = Identifier, Identifier = Identifier->Next) {
if (Identifier->TokInfo.getNameLength() == Length &&
+ Identifier->TokInfo.HashValue == FullHash &&
memcmp(Identifier->TokInfo.getName(), NameStart, Length) == 0) {
// If found identifier wasn't at start of bucket, move it there so
// that frequently searched for identifiers are found earlier, even if