summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorDmitri Gribenko <gribozavr@gmail.com>2013-08-07 07:12:08 +0000
committerDmitri Gribenko <gribozavr@gmail.com>2013-08-07 07:12:08 +0000
commit98277bc93fcd2d6bd55d60a8b4099842bb6ffbca (patch)
tree5e80342ac69fcbdb9de36c3824f950dfd7ec58ff
parentcfd982af805405dd56ab4838ecc060041108ef5f (diff)
downloadbcm5719-llvm-98277bc93fcd2d6bd55d60a8b4099842bb6ffbca.tar.gz
bcm5719-llvm-98277bc93fcd2d6bd55d60a8b4099842bb6ffbca.zip
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
-rw-r--r--llvm/include/llvm/ADT/DenseMap.h3
1 files changed, 0 insertions, 3 deletions
diff --git a/llvm/include/llvm/ADT/DenseMap.h b/llvm/include/llvm/ADT/DenseMap.h
index 71069ff470d..d5aa8646b31 100644
--- a/llvm/include/llvm/ADT/DenseMap.h
+++ b/llvm/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 {
OpenPOWER on IntegriCloud