diff options
author | Daniel Silverstone <dsilvers@digital-scurf.org> | 2020-02-23 20:58:53 +0000 |
---|---|---|
committer | Daniel Silverstone <dsilvers@digital-scurf.org> | 2020-02-23 20:59:40 +0000 |
commit | 859972df714b0c91bf7fd181796d34451f07e9f2 (patch) | |
tree | e50b5af519c1d5280063fc331d3a613b5afbdaf2 /content/llcache.h | |
parent | ac75a9161e23b7073edcf0ec07d584b87d2e0e08 (diff) | |
download | netsurf-859972df714b0c91bf7fd181796d34451f07e9f2.tar.gz netsurf-859972df714b0c91bf7fd181796d34451f07e9f2.tar.bz2 |
llcache: Rework fs_backing_store to use hashmap
As a result, we no longer waste a bunch of RAM on the entries
tables. This ought to be no slower, and more memory efficient.
Signed-off-by: Daniel Silverstone <dsilvers@digital-scurf.org>
Diffstat (limited to 'content/llcache.h')
-rw-r--r-- | content/llcache.h | 37 |
1 files changed, 0 insertions, 37 deletions
diff --git a/content/llcache.h b/content/llcache.h index 514272f29..f9a3016c6 100644 --- a/content/llcache.h +++ b/content/llcache.h @@ -121,43 +121,6 @@ struct llcache_store_parameters { size_t limit; /**< The backing store upper bound target size */ size_t hysteresis; /**< The hysteresis around the target size */ - - /** log2 of the default maximum number of entries the cache - * can track. - * - * If unset this defaults to 16 (65536 entries) The cache - * control file takes precedence so cache data remains - * portable between builds with differing defaults. - */ - unsigned int entry_size; - - /** log2 of the default number of entries in the mapping between - * the url and cache entries. - * - * @note This is exposing an internal implementation detail of - * the filesystem based default backing store implementation. - * However it is likely any backing store implementation will - * need some way to map url to cache entries so it is a - * generally useful configuration value. - * - * Too small a value will cause unecessary collisions and - * cache misses and larger values cause proportionaly larger - * amounts of memory to be used. - * - * The "birthday paradox" means that the hash will experience - * a collision in every 2^(address_size/2) urls the cache - * stores. - * - * A value of 20 means one object stored in every 1024 will - * cause a collion and a cache miss while using two megabytes - * of storage. - * - * If unset this defaults to 20 (1048576 entries using two - * megabytes) The cache control file takes precedence so cache - * data remains portable between builds with differing - * defaults. - */ - unsigned int address_size; }; /** |