37     CacheEntry *Next;  member
59       Entries[i].Next = &Entries[i + 1];  in resetCache()
61     Entries[kCacheEntryCount - 1].Next = nullptr;  in resetCache()
107           Previous->Next = Current->Next;  in find()
108           Current->Next = MostRecentlyUsed;  in find()
115       Current = Current->Next;  in find()
127       Unused = Unused->Next;  in add()
131       while (Current->Next != nullptr) {  in add()
133         Current = Current->Next;  in add()
135       Previous->Next = nullptr;  in add()
141     Current->Next = MostRecentlyUsed;  in add()