1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-21 03:53:04 +02: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.

llvm-svn: 187868
This commit is contained in:
Dmitri Gribenko 2013-08-07 07:12:08 +00:00
parent 9746d0ee1c
commit 0617132514

View File

@ -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 {