mirror of
https://github.com/RPCSX/llvm.git
synced 2025-01-10 06:00:30 +00:00
Remove the assertion for now. This breaks lld.
lld has a hashtable with StringRef keys; it needs to iterate over the keys in *insertion* order. This is currently implemented as std::vector<StringRef> + DenseMap<StringRef, T>. This will probably need a proper DenseMapInfo<StringRef> if we don't want to lose memory/performance by migrating to a different data structure. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@187868 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
aefdc04b2b
commit
6e52c6164d
@ -606,9 +606,6 @@ public:
|
||||
}
|
||||
|
||||
void init(unsigned InitBuckets) {
|
||||
assert(!KeyInfoT::isEqual(this->getEmptyKey(), this->getTombstoneKey()) &&
|
||||
"Bad implementation of KeyInfoT: empty key and tombstone key "
|
||||
"should be different");
|
||||
if (allocateBuckets(InitBuckets)) {
|
||||
this->BaseT::initEmpty();
|
||||
} else {
|
||||
|
Loading…
Reference in New Issue
Block a user