EntryCacheEntry
EntryCacheEntry* entry = (EntryCacheEntry*)malloc(sizeof(EntryCacheEntry) + nameLen);
EntryCacheEntry* existingEntry = fEntries.InsertAtomic(entry);
EntryCacheEntry* entry = fEntries.Lookup(key);
EntryCacheEntry* entry = fEntries.Lookup(key);
EntryCacheEntry* entry = it.Next();) {
EntryCache::_AddEntryToCurrentGeneration(EntryCacheEntry* entry, bool move)
EntryCacheEntry* entriesToFree = NULL;
EntryCacheEntry* otherEntry = fGenerations[newGeneration].entries[i];
EntryCacheEntry* next = entriesToFree->hash_link;
entries = new(std::nothrow) EntryCacheEntry*[entries_size];
memset(entries, 0, sizeof(EntryCacheEntry*) * entries_size);
EntryCacheEntry* entry = fEntries.Clear(true);
EntryCacheEntry* next = entry->hash_link;
typedef DoublyLinkedList<EntryCacheEntry> EntryList;
EntryCacheEntry* entry, bool move);
EntryCacheEntry* hash_link;
EntryCacheEntry** entries;
typedef EntryCacheEntry ValueType;
uint32 Hash(const EntryCacheEntry* value) const
EntryCacheKey Key(const EntryCacheEntry* value) const
bool Compare(const EntryCacheKey& key, const EntryCacheEntry* value) const
EntryCacheEntry*& GetLink(EntryCacheEntry* value) const