X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=lib%2FSupport%2FFoldingSet.cpp;h=463511408759ccc8cb5829ecf19ce8103ce1028c;hb=78832c6e7d33094c6ef9e99b07dac6f60c0a1207;hp=d857559898ed046986a17613902f055f53393ff7;hpb=725011e72f7b6fa358d953cffbb63f218e20af8b;p=oota-llvm.git diff --git a/lib/Support/FoldingSet.cpp b/lib/Support/FoldingSet.cpp index d857559898e..46351140875 100644 --- a/lib/Support/FoldingSet.cpp +++ b/lib/Support/FoldingSet.cpp @@ -305,7 +305,7 @@ FoldingSetImpl::Node /// is not already in the map. InsertPos must be obtained from /// FindNodeOrInsertPos. void FoldingSetImpl::InsertNode(Node *N, void *InsertPos) { - assert(N->getNextInBucket() == 0); + assert(!N->getNextInBucket()); // Do we need to grow the hashtable? if (NumNodes+1 > NumBuckets*2) { GrowHashTable();