maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

Avoid repeatedly reallocating the FoldingSetNodeID when searching 

through multiple nodes in a bucket.

llvm-svn: 54687
This commit is contained in:
Dan Gohman 2008-08-12 17:40:22 +00:00
parent 0d29ae085b
commit be5e69ed37
1 changed files with 4 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
llvm/lib/Support/FoldingSet.cpp
View File

@ -232,6 +232,7 @@ void FoldingSetImpl::GrowHashTable() {
Buckets[NumBuckets] = reinterpret_cast<void*>(-1);
// Walk the old buckets, rehashing nodes into their new place.
FoldingSetNodeID ID;
for (unsigned i = 0; i != OldNumBuckets; ++i) {
void *Probe = OldBuckets[i];
if (!Probe) continue;
@ -241,9 +242,9 @@ void FoldingSetImpl::GrowHashTable() {
NodeInBucket->SetNextInBucket(0);
// Insert the node into the new bucket, after recomputing the hash.
FoldingSetNodeID ID;
GetNodeProfile(ID, NodeInBucket);
InsertNode(NodeInBucket, GetBucketFor(ID, Buckets, NumBuckets));
ID.clear();
}
}
@ -262,13 +263,14 @@ FoldingSetImpl::Node
InsertPos = 0;
FoldingSetNodeID OtherID;
while (Node *NodeInBucket = GetNextPtr(Probe)) {
FoldingSetNodeID OtherID;
GetNodeProfile(OtherID, NodeInBucket);
if (OtherID == ID)
return NodeInBucket;
Probe = NodeInBucket->getNextInBucket();
OtherID.clear();
}
// Didn't find the node, return null with the bucket as the InsertPos.