RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-23 19:23:23 +01:00
Code Issues Projects Releases Wiki Activity

Switch this code to use hash_combine_range rather than incremental calls

Browse Source 
to hash_combine. One of the interfaces could already do this, and the
other can just use a small buffer. This is a much more efficient way to
use the hash_combine interface, although I don't have any particular
benchmark where this code was hot, so I can't measure much of an impact.
It at least doesn't slow anything down.

llvm-svn: 152200
This commit is contained in:
Chandler Carruth 2012-03-07 03:22:32 +00:00
parent 42ee38de30
commit 53d60ebfa2
1 changed files with 6 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
lib/VMCore/ConstantsContext.h
View File

@ -657,20 +657,18 @@ private:
return ConstantClassInfo::getTombstoneKey();
}
static unsigned getHashValue(const ConstantClass *CP) {
hash_code code = hash_value(CP->getType());
SmallVector<Constant*, 8> CPOperands;
CPOperands.reserve(CP->getNumOperands());
for (unsigned I = 0, E = CP->getNumOperands(); I < E; ++I)
code = hash_combine(code, hash_value(CP->getOperand(I)));
return code;
CPOperands.push_back(CP->getOperand(I));
return getHashValue(LookupKey(CP->getType(), CPOperands));
}
static bool isEqual(const ConstantClass *LHS, const ConstantClass *RHS) {
return LHS == RHS;
}
static unsigned getHashValue(const LookupKey &Val) {
hash_code code = hash_value(Val.first);
for (Operands::const_iterator
I = Val.second.begin(), E = Val.second.end(); I != E; ++I)
code = hash_combine(code, hash_value(*I));
return code;
return hash_combine(Val.first, hash_combine_range(Val.second.begin(),
Val.second.end()));
}
static bool isEqual(const LookupKey &LHS, const ConstantClass *RHS) {
if (RHS == getEmptyKey() || RHS == getTombstoneKey())