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

diff --git a/include/llvm/ADT/DenseMap.h b/include/llvm/ADT/DenseMap.h
index 71069ff470d89f1b419a283a4de4db76f0f53a5f..d5aa8646b31c7628e5ace51b55dce723244e2a23 100644 (file)
--- a/include/llvm/ADT/DenseMap.h
+++ b/include/llvm/ADT/DenseMap.h
@@ -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 {