Searched refs:ThisEntry (Results 1 – 2 of 2) sorted by relevance
234 while (ScopedHashTableVal<K, V> *ThisEntry = LastValInScope) { in ~ScopedHashTableScope() local236 if (ThisEntry->getNextForKey() == 0) { in ~ScopedHashTableScope()237 assert(HT.TopLevelMap[ThisEntry->getKey()] == ThisEntry && in ~ScopedHashTableScope()239 HT.TopLevelMap.erase(ThisEntry->getKey()); in ~ScopedHashTableScope()241 ScopedHashTableVal<K, V> *&KeyEntry = HT.TopLevelMap[ThisEntry->getKey()]; in ~ScopedHashTableScope()242 assert(KeyEntry == ThisEntry && "Scope imbalance!"); in ~ScopedHashTableScope()243 KeyEntry = ThisEntry->getNextForKey(); in ~ScopedHashTableScope()247 LastValInScope = ThisEntry->getNextInScope(); in ~ScopedHashTableScope()250 ThisEntry->Destroy(HT.getAllocator()); in ~ScopedHashTableScope()
234 while (ScopedHashTableVal<K, V> *ThisEntry = LastValInScope) { in ~ScopedHashTableScope() local236 if (!ThisEntry->getNextForKey()) { in ~ScopedHashTableScope()237 assert(HT.TopLevelMap[ThisEntry->getKey()] == ThisEntry && in ~ScopedHashTableScope()239 HT.TopLevelMap.erase(ThisEntry->getKey()); in ~ScopedHashTableScope()241 ScopedHashTableVal<K, V> *&KeyEntry = HT.TopLevelMap[ThisEntry->getKey()]; in ~ScopedHashTableScope()242 assert(KeyEntry == ThisEntry && "Scope imbalance!"); in ~ScopedHashTableScope()243 KeyEntry = ThisEntry->getNextForKey(); in ~ScopedHashTableScope()247 LastValInScope = ThisEntry->getNextInScope(); in ~ScopedHashTableScope()250 ThisEntry->Destroy(HT.getAllocator()); in ~ScopedHashTableScope()