|For how many entries is space allocated? |
|How many entries are used. |
|Which entry was the last accessed. |
|struct cache_entry_t *||entries [CACHE_DEFAULT+1]|
|Cache entries, |
The more active an entry is, the more at the start of the array.
struct cache_t* the function cch__new_cache() must be used.
Which entry was the last accessed.
If the array of entries looked like this, with
B accessed after
Ait looks like that: