2 * viking -- GPS Data and Topo Analyzer, Explorer, and Manager
4 * Copyright (C) 2003-2005, Evan Battaglia <gtoevan@gmx.net>
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
28 typedef struct _List {
33 /* a circular linked list, a pointer to the tail, and the tail points to the head */
34 /* this is so we can free the last */
35 static List *queue_tail = NULL;
36 static int queue_count = 0;
38 static guint32 queue_size = 0;
41 static GHashTable *cache = NULL;
43 #define HASHKEY_FORMAT_STRING "%d-%d-%d-%d-%d-%d-%.3f-%.3f"
44 #define HASHKEY_FORMAT_STRING_NOSHRINK_NOR_ALPHA "%d-%d-%d-%d-%d-"
46 void a_mapcache_init ()
48 cache = g_hash_table_new_full ( g_str_hash, g_str_equal, g_free, g_object_unref );
51 static void cache_add(gchar *key, GdkPixbuf *pixbuf)
53 /* TODO: Check if already exists */
54 g_hash_table_insert ( cache, key, pixbuf );
55 queue_size += gdk_pixbuf_get_rowstride(pixbuf) * gdk_pixbuf_get_height(pixbuf);
60 static void cache_remove(const gchar *key)
62 GdkPixbuf *buf = g_hash_table_lookup ( cache, key );
64 queue_size -= gdk_pixbuf_get_rowstride(buf) * gdk_pixbuf_get_height(buf);
67 g_hash_table_remove ( cache, key );
71 /* returns key from head, adds on newtailkey to tail. */
72 static gchar *list_shift_add_entry ( gchar *newtailkey )
74 gchar *oldheadkey = queue_tail->next->key;
75 queue_tail->next->key = newtailkey;
76 queue_tail = queue_tail->next;
80 static gchar *list_shift ()
82 gchar *oldheadkey = queue_tail->next->key;
83 List *oldhead = queue_tail->next;
84 queue_tail->next = queue_tail->next->next;
89 /* adds key to tail */
90 static void list_add_entry ( gchar *key )
92 List *newlist = g_malloc ( sizeof ( List ) );
95 newlist->next = queue_tail->next;
96 queue_tail->next = newlist;
99 newlist->next = newlist;
100 queue_tail = newlist;
104 void a_mapcache_add ( GdkPixbuf *pixbuf, gint x, gint y, gint z, guint8 type, guint zoom, guint8 alpha, gdouble xshrinkfactor, gdouble yshrinkfactor )
106 gchar *key = g_strdup_printf ( HASHKEY_FORMAT_STRING, x, y, z, type, zoom, alpha, xshrinkfactor, yshrinkfactor );
109 cache_add(key, pixbuf);
111 if ( queue_size > VIK_CONFIG_MAPCACHE_SIZE ) {
112 gchar *oldkey = list_shift_add_entry ( key );
113 cache_remove(oldkey);
115 while ( queue_size > VIK_CONFIG_MAPCACHE_SIZE &&
116 (queue_tail->next != queue_tail) ) { /* make sure there's more than one thing to delete */
117 oldkey = list_shift ();
118 cache_remove(oldkey);
121 /* chop off 'start' etc */
123 list_add_entry ( key );
124 /* business as usual */
127 if ( (++tmp == 100 )) { g_print("DEBUG: queue count=%d %u\n", queue_count, queue_size ); tmp=0; }
130 GdkPixbuf *a_mapcache_get ( gint x, gint y, gint z, guint8 type, guint zoom, guint8 alpha, gdouble xshrinkfactor, gdouble yshrinkfactor )
133 g_snprintf ( key, sizeof(key), HASHKEY_FORMAT_STRING, x, y, z, type, zoom, alpha, xshrinkfactor, yshrinkfactor );
134 return g_hash_table_lookup ( cache, key );
137 void a_mapcache_remove_all_shrinkfactors ( gint x, gint y, gint z, guint8 type, guint zoom )
140 List *loop = queue_tail;
144 if ( queue_tail == NULL )
147 g_snprintf ( key, sizeof(key), HASHKEY_FORMAT_STRING_NOSHRINK_NOR_ALPHA, x, y, z, type, zoom );
150 /* TODO: check logic here */
153 if ( strncmp(tmp->key, key, len) == 0 )
155 cache_remove(tmp->key);
156 if ( tmp == loop ) /* we deleted the last thing in the queue! */
157 loop = queue_tail = NULL;
159 loop->next = tmp->next;
160 if ( tmp == queue_tail )
161 queue_tail = tmp->next;
169 } while ( loop && (loop != queue_tail || tmp == NULL) );
171 /* loop thru list, looking for the one, compare first whatever chars */
175 void a_mapcache_uninit ()
177 g_hash_table_destroy ( cache );