diff options
| author | Dmitri Gribenko <gribozavr@gmail.com> | 2013-08-07 07:12:08 +0000 |
|---|---|---|
| committer | Dmitri Gribenko <gribozavr@gmail.com> | 2013-08-07 07:12:08 +0000 |
| commit | 6e52c6164d499fac983f720540e9a8345f36f691 (patch) | |
| tree | a85a4687ce3934e1d77506c2d2ecd7d4ed101ef1 /include/llvm/ADT | |
| parent | aefdc04b2b379fcd343f43a259e6a4272364f437 (diff) | |
| download | external_llvm-6e52c6164d499fac983f720540e9a8345f36f691.zip external_llvm-6e52c6164d499fac983f720540e9a8345f36f691.tar.gz external_llvm-6e52c6164d499fac983f720540e9a8345f36f691.tar.bz2 | |
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
Diffstat (limited to 'include/llvm/ADT')
| -rw-r--r-- | include/llvm/ADT/DenseMap.h | 3 |
1 files changed, 0 insertions, 3 deletions
diff --git a/include/llvm/ADT/DenseMap.h b/include/llvm/ADT/DenseMap.h index 71069ff..d5aa864 100644 --- 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 { |