commit | 6e52c6164d499fac983f720540e9a8345f36f691 | [log] [tgz] |
---|---|---|
author | Dmitri Gribenko <gribozavr@gmail.com> | Wed Aug 07 07:12:08 2013 +0000 |
committer | Dmitri Gribenko <gribozavr@gmail.com> | Wed Aug 07 07:12:08 2013 +0000 |
tree | a85a4687ce3934e1d77506c2d2ecd7d4ed101ef1 | |
parent | aefdc04b2b379fcd343f43a259e6a4272364f437 [diff] |
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