summaryrefslogtreecommitdiff
path: root/libshouldbeinlibc/cacheq.h
diff options
context:
space:
mode:
authorMiles Bader <miles@gnu.org>1996-04-29 20:04:23 +0000
committerMiles Bader <miles@gnu.org>1996-04-29 20:04:23 +0000
commitb377db8a958278ad0d4a47058f1a5d55b7d8b4ba (patch)
treee2b3ee13e1a216a8fe332973250954bb171c87cb /libshouldbeinlibc/cacheq.h
parentfb9a206288517a12cf2db84d86aab303dfa35c3e (diff)
(struct cacheq); Make type of LRU & MRU fields `void *'.
Diffstat (limited to 'libshouldbeinlibc/cacheq.h')
-rw-r--r--libshouldbeinlibc/cacheq.h6
1 files changed, 4 insertions, 2 deletions
diff --git a/libshouldbeinlibc/cacheq.h b/libshouldbeinlibc/cacheq.h
index d3c688e8..a221a7a7 100644
--- a/libshouldbeinlibc/cacheq.h
+++ b/libshouldbeinlibc/cacheq.h
@@ -69,8 +69,10 @@ struct cacheq
either end of a linked list composed of all the elements of the cache.
This list will always be the same length -- if an element is `removed',
its entry is simply marked inactive, and moved to the LRU end of the list
- so it will be reused first. */
- struct cacheq_hdr *lru, *mru;
+ so it will be reused first. These pointers are of type `void *' so they
+ can be conveniently used by client code (see comment in struct
+ cacheq_hdr). */
+ void *lru, *mru;
};
/* Move ENTRY to the most-recently-used end of CACHEQ. */