summaryrefslogtreecommitdiff
path: root/source/fitz/store.c
diff options
context:
space:
mode:
authorRobin Watts <robin.watts@artifex.com>2016-09-15 16:37:42 +0100
committerRobin Watts <robin.watts@artifex.com>2016-09-16 14:00:32 +0100
commit3de83b0d7a679c2c91587718c1c273775b99e8dd (patch)
tree72a42a88b82c5c3d4a30c52d4df370bb0700fb38 /source/fitz/store.c
parent3a1ae9b3db655efc98965bcc82ad545f6572158d (diff)
downloadmupdf-3de83b0d7a679c2c91587718c1c273775b99e8dd.tar.xz
Extend store to cope with references used in keys.
The store is effectively a list of items, where each item is a (key, value) pair. The design is such that we can easily get into the state where the only reference to a value is that held by the store. Subsequent references can then be generated by things being 'found' from within the store. While the only reference to an object is that held by it being a value in the store, the store is free to evict it to save memory. Images present a complication to this design; images are stored both as values within the store (by the pdf agent, so that we do not regenerate images each time we meet them in the file), and as parts of the keys within the store. For example, once an image is decoded to give a pixmap, the pixmap is cached in the store. The key to look that pixmap up again includes a reference to the image from which the pixmap was generated. This means, that for document handlers such as gproof that do not place images in the store, we can end up with images that are kept around purely by dint of being used as references in store keys. There is no chance of the value (the decoded pixmap) ever being 'found' from the store as no one other than the key is holding a reference to the image required. Thus the images/pixmaps are never freed until the store is emptied. This commit offers a fix for this situation. Standard store items are based on an fz_storable type. Here we introduce a new fz_key_storable type derived from that. As well as keeping track of the number of references a given item has to it, it keeps a separate count of the number of references a given item has to it from keys in the store. On dropping a reference, we check to see if the number of references has become the same as the number of references from keys in the store. If it has, then we know that these keys can never be 'found' again. So we filter them out of the store, which drops the items.
Diffstat (limited to 'source/fitz/store.c')
-rw-r--r--source/fitz/store.c122
1 files changed, 122 insertions, 0 deletions
diff --git a/source/fitz/store.c b/source/fitz/store.c
index cad027bc..8d0a7bc4 100644
--- a/source/fitz/store.c
+++ b/source/fitz/store.c
@@ -81,6 +81,95 @@ fz_drop_storable(fz_context *ctx, const fz_storable *sc)
s->drop(ctx, s);
}
+void *fz_keep_key_storable(fz_context *ctx, const fz_key_storable *sc)
+{
+ return fz_keep_storable(ctx, &sc->storable);
+}
+
+int fz_drop_key_storable(fz_context *ctx, const fz_key_storable *sc)
+{
+ /* Explicitly drop const to allow us to use const
+ * sanely throughout the code. */
+ fz_key_storable *s = (fz_key_storable *)sc;
+ int drop;
+ int only_refs_are_store_key_refs = 0;
+
+ if (s == NULL)
+ return 0;
+
+ if (s->storable.refs > 0)
+ (void)Memento_dropRef(s);
+ fz_lock(ctx, FZ_LOCK_ALLOC);
+ if (s->storable.refs > 0)
+ {
+ drop = --s->storable.refs == 0;
+ if (!drop && s->storable.refs == s->store_key_refs)
+ only_refs_are_store_key_refs = 1;
+ }
+ else
+ drop = 0;
+ fz_unlock(ctx, FZ_LOCK_ALLOC);
+ /*
+ If we are dropping the last reference to an object, then
+ it cannot possibly be in the store (as the store always
+ keeps a ref to everything in it, and doesn't drop via
+ this method. So we can simply drop the storable object
+ itself without any operations on the fz_store.
+ */
+ if (drop)
+ s->storable.drop(ctx, &s->storable);
+ return only_refs_are_store_key_refs;
+}
+
+void *fz_keep_key_storable_key(fz_context *ctx, const fz_key_storable *sc)
+{
+ /* Explicitly drop const to allow us to use const
+ * sanely throughout the code. */
+ fz_key_storable *s = (fz_key_storable *)sc;
+
+ if (s == NULL)
+ return NULL;
+
+ if (s->storable.refs > 0)
+ (void)Memento_takeRef(s);
+ fz_lock(ctx, FZ_LOCK_ALLOC);
+ if (s->storable.refs > 0)
+ {
+ ++s->storable.refs;
+ ++s->store_key_refs;
+ }
+ fz_unlock(ctx, FZ_LOCK_ALLOC);
+ return s;
+}
+
+void fz_drop_key_storable_key(fz_context *ctx, const fz_key_storable *sc)
+{
+ /* Explicitly drop const to allow us to use const
+ * sanely throughout the code. */
+ fz_key_storable *s = (fz_key_storable *)sc;
+ int drop;
+
+ if (s == NULL)
+ return;
+
+ if (s->storable.refs > 0)
+ (void)Memento_dropRef(s);
+ fz_lock(ctx, FZ_LOCK_ALLOC);
+ assert(s->store_key_refs > 0 && s->storable.refs >= s->store_key_refs);
+ drop = --s->storable.refs == 0;
+ --s->store_key_refs;
+ fz_unlock(ctx, FZ_LOCK_ALLOC);
+ /*
+ If we are dropping the last reference to an object, then
+ it cannot possibly be in the store (as the store always
+ keeps a ref to everything in it, and doesn't drop via
+ this method. So we can simply drop the storable object
+ itself without any operations on the fz_store.
+ */
+ if (drop)
+ s->storable.drop(ctx, &s->storable);
+}
+
static void
evict(fz_context *ctx, fz_item *item)
{
@@ -636,3 +725,36 @@ fz_shrink_store(fz_context *ctx, unsigned int percent)
return success;
}
+
+void fz_filter_store(fz_context *ctx, fz_store_filter_fn *fn, void *arg, fz_store_type *type)
+{
+ fz_store *store;
+ fz_item *item, *prev;
+
+ if (ctx == NULL)
+ return;
+ store = ctx->store;
+ if (store == NULL)
+ return;
+
+ fz_lock(ctx, FZ_LOCK_ALLOC);
+
+ /* Free the items */
+ for (item = store->tail; item; item = prev)
+ {
+ prev = item->prev;
+ if (item->type != type)
+ continue;
+
+ if (fn(ctx, arg, item->key))
+ {
+ /* Free this item */
+ evict(ctx, item); /* Drops then retakes lock */
+
+ /* Have to restart search again, as prev may no longer
+ * be valid due to release of lock in evict. */
+ prev = store->tail;
+ }
+ }
+ fz_unlock(ctx, FZ_LOCK_ALLOC);
+}