/*
* Geeqie
- * Copyright (C) 2008 The Geeqie Team
+ * Copyright (C) 2008 - 2012 The Geeqie Team
*
* Author: Vladimir Nadvornik
*
#include "main.h"
#include "filecache.h"
+/* Set to TRUE to add file cache dumps to the debug output */
+const gboolean debug_file_cache = FALSE;
+
/* this implements a simple LRU algorithm */
struct _FileCacheData {
GList *list;
gulong max_size;
gulong size;
- };
+};
+
+typedef struct _FileCacheEntry FileCacheEntry;
+struct _FileCacheEntry {
+ FileData *fd;
+ gulong size;
+};
+static void file_cache_notify_cb(FileData *fd, NotifyType type, gpointer data);
+static void file_cache_remove_fd(FileCacheData *fc, FileData *fd);
FileCacheData *file_cache_new(FileCacheReleaseFunc release, gulong max_size)
{
FileCacheData *fc = g_new(FileCacheData, 1);
+
fc->release = release;
fc->list = NULL;
fc->max_size = max_size;
fc->size = 0;
+
+ file_data_register_notify_func(file_cache_notify_cb, fc, NOTIFY_PRIORITY_HIGH);
+
return fc;
}
-gint file_cache_get(FileCacheData *fc, FileData *fd)
+gboolean file_cache_get(FileCacheData *fc, FileData *fd)
{
GList *work;
- if ((work = g_list_find(fc->list, fd)))
+
+ g_assert(fc && fd);
+
+ work = fc->list;
+ while (work)
{
- fc->list = g_list_remove_link(fc->list, work);
- fc->list = g_list_concat(work, fc->list);
- DEBUG_1("cache hit: %s", fd->path);
- return TRUE;
+ FileCacheEntry *fce = work->data;
+ if (fce->fd == fd)
+ {
+ /* entry exists */
+ DEBUG_2("cache hit: fc=%p %s", fc, fd->path);
+ if (work == fc->list) return TRUE; /* already at the beginning */
+ /* move it to the beginning */
+ DEBUG_2("cache move to front: fc=%p %s", fc, fd->path);
+ fc->list = g_list_remove_link(fc->list, work);
+ fc->list = g_list_concat(work, fc->list);
+
+ if (file_data_check_changed_files(fd)) {
+ /* file has been changed, cance entry is no longer valid */
+ file_cache_remove_fd(fc, fd);
+ return FALSE;
+ }
+ if (debug_file_cache) file_cache_dump(fc);
+ return TRUE;
+ }
+ work = work->next;
}
- DEBUG_1("cache miss: %s", fd->path);
+ DEBUG_2("cache miss: fc=%p %s", fc, fd->path);
return FALSE;
}
-void file_cache_put(FileCacheData *fc, FileData *fd, gulong size)
+void file_cache_set_size(FileCacheData *fc, gulong size)
{
GList *work;
- FileData *last_fd;
- if ((work = g_list_find(fc->list, fd)))
- {
- /* entry already exists, move it to the beginning */
- fc->list = g_list_remove_link(fc->list, work);
- fc->list = g_list_concat(work, fc->list);
- return;
+ FileCacheEntry *last_fe;
+
+ if (debug_file_cache) file_cache_dump(fc);
+
+ work = g_list_last(fc->list);
+ while (fc->size > size && work)
+ {
+ GList *prev;
+ last_fe = work->data;
+ prev = work->prev;
+ fc->list = g_list_delete_link(fc->list, work);
+ work = prev;
+
+ DEBUG_2("file changed - cache remove: fc=%p %s", fc, last_fe->fd->path);
+ fc->size -= last_fe->size;
+ fc->release(last_fe->fd);
+ file_data_unref(last_fe->fd);
+ g_free(last_fe);
}
+}
+
+void file_cache_put(FileCacheData *fc, FileData *fd, gulong size)
+{
+ FileCacheEntry *fe;
+
+ if (file_cache_get(fc, fd)) return;
- DEBUG_1("cache add: %s", fd->path);
- file_data_ref(fd);
- fc->list = g_list_prepend(fc->list, fd);
- fc->size++; /* FIXME: use size */
-
- if (fc->size < fc->max_size) return;
+ DEBUG_2("cache add: fc=%p %s", fc, fd->path);
+ fe = g_new(FileCacheEntry, 1);
+ fe->fd = file_data_ref(fd);
+ fe->size = size;
+ fc->list = g_list_prepend(fc->list, fe);
+ fc->size += size;
- fc->size--;
- work = g_list_last(fc->list);
- last_fd = work->data;
- fc->list = g_list_delete_link(fc->list, work);
- DEBUG_1("cache remove: %s", last_fd->path);
- fc->release(last_fd);
- file_data_unref(last_fd);
+ file_cache_set_size(fc, fc->max_size);
}
-void file_cache_dump(FileCacheData *fc)
+gulong file_cache_get_max_size(FileCacheData *fc)
+{
+ return fc->max_size;
+}
+
+gulong file_cache_get_size(FileCacheData *fc)
+{
+ return fc->size;
+}
+
+void file_cache_set_max_size(FileCacheData *fc, gulong size)
+{
+ fc->max_size = size;
+ file_cache_set_size(fc, fc->max_size);
+}
+
+static void file_cache_remove_fd(FileCacheData *fc, FileData *fd)
{
GList *work;
+ FileCacheEntry *fe;
+
+ if (debug_file_cache) file_cache_dump(fc);
+
work = fc->list;
-
- while(work)
+ while (work)
{
- FileData *fd = work->data;
+ GList *current = work;
+ fe = work->data;
work = work->next;
- DEBUG_1("cache entry: %s", fd->path);
+
+ if (fe->fd == fd)
+ {
+ fc->list = g_list_delete_link(fc->list, current);
+
+ DEBUG_1("cache remove: fc=%p %s", fc, fe->fd->path);
+ fc->size -= fe->size;
+ fc->release(fe->fd);
+ file_data_unref(fe->fd);
+ g_free(fe);
+ }
+ }
+}
+
+void file_cache_dump(FileCacheData *fc)
+{
+ GList *work = fc->list;
+ gulong n = 0;
+
+ DEBUG_1("cache dump: fc=%p max size:%ld size:%ld", fc, fc->max_size, fc->size);
+
+ while (work)
+ {
+ FileCacheEntry *fe = work->data;
+ work = work->next;
+ DEBUG_1("cache entry: fc=%p [%lu] %s %ld", fc, ++n, fe->fd->path, fe->size);
+ }
+}
+
+static void file_cache_notify_cb(FileData *fd, NotifyType type, gpointer data)
+{
+ FileCacheData *fc = data;
+
+ if (type & (NOTIFY_REREAD | NOTIFY_CHANGE)) /* invalidate the entry on each file change */
+ {
+ DEBUG_1("Notify cache: %s %04x", fd->path, type);
+ file_cache_remove_fd(fc, fd);
}
}
+/* vim: set shiftwidth=8 softtabstop=0 cindent cinoptions={1s: */
projects / geeqie.git / blobdiff