summaryrefslogtreecommitdiff
path: root/lib/Support
diff options
context:
space:
mode:
authorRafael Espindola <rafael.espindola@gmail.com>2014-06-20 00:23:03 +0000
committerRafael Espindola <rafael.espindola@gmail.com>2014-06-20 00:23:03 +0000
commit6fda71e05edc6447f780dee7fff8bd4bf543f39e (patch)
tree10e8b454f796398f08f1d426b0171f68847a167e /lib/Support
parentd1e64617ee1b76c28fa512d622f0b977144b300f (diff)
downloadllvm-6fda71e05edc6447f780dee7fff8bd4bf543f39e.tar.gz
llvm-6fda71e05edc6447f780dee7fff8bd4bf543f39e.tar.bz2
llvm-6fda71e05edc6447f780dee7fff8bd4bf543f39e.tar.xz
Revert "Add StringMap::insert(pair) consistent with the standard associative container concept."
This reverts commit r211309. It looks like it broke some bots: http://lab.llvm.org:8011/builders/clang-x86_64-ubuntu-gdb-75/builds/15563/steps/compile/logs/stdio git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@211328 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Support')
-rw-r--r--lib/Support/StringMap.cpp10
1 files changed, 2 insertions, 8 deletions
diff --git a/lib/Support/StringMap.cpp b/lib/Support/StringMap.cpp
index ddb73494ff..72a6d822d2 100644
--- a/lib/Support/StringMap.cpp
+++ b/lib/Support/StringMap.cpp
@@ -181,7 +181,7 @@ StringMapEntryBase *StringMapImpl::RemoveKey(StringRef Key) {
/// RehashTable - Grow the table, redistributing values into the buckets with
/// the appropriate mod-of-hashtable-size.
-unsigned StringMapImpl::RehashTable(unsigned BucketNo) {
+void StringMapImpl::RehashTable() {
unsigned NewSize;
unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1);
@@ -193,10 +193,9 @@ unsigned StringMapImpl::RehashTable(unsigned BucketNo) {
} else if (NumBuckets-(NumItems+NumTombstones) <= NumBuckets/8) {
NewSize = NumBuckets;
} else {
- return BucketNo;
+ return;
}
- unsigned NewBucketNo = BucketNo;
// Allocate one extra bucket which will always be non-empty. This allows the
// iterators to stop at end.
StringMapEntryBase **NewTableArray =
@@ -216,8 +215,6 @@ unsigned StringMapImpl::RehashTable(unsigned BucketNo) {
if (!NewTableArray[NewBucket]) {
NewTableArray[FullHash & (NewSize-1)] = Bucket;
NewHashArray[FullHash & (NewSize-1)] = FullHash;
- if (I == BucketNo)
- NewBucketNo = NewBucket;
continue;
}
@@ -230,8 +227,6 @@ unsigned StringMapImpl::RehashTable(unsigned BucketNo) {
// Finally found a slot. Fill it in.
NewTableArray[NewBucket] = Bucket;
NewHashArray[NewBucket] = FullHash;
- if (I == BucketNo)
- NewBucketNo = NewBucket;
}
}
@@ -240,5 +235,4 @@ unsigned StringMapImpl::RehashTable(unsigned BucketNo) {
TheTable = NewTableArray;
NumBuckets = NewSize;
NumTombstones = 0;
- return NewBucketNo;
}