1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
|
/*
* viking -- GPS Data and Topo Analyzer, Explorer, and Manager
*
* Copyright (C) 2003-2005, Evan Battaglia <gtoevan@gmx.net>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#include <gtk/gtk.h>
#include <string.h>
#include "mapcache.h"
#include "config.h"
typedef struct _List {
struct _List *next;
gchar *key;
} List;
/* a circular linked list, a pointer to the tail, and the tail points to the head */
/* this is so we can free the last */
static List *queue_tail = NULL;
static int queue_count = 0;
static guint32 queue_size = 0;
static GHashTable *cache = NULL;
static GMutex *mc_mutex = NULL;
#define HASHKEY_FORMAT_STRING "%d-%d-%d-%d-%d-%d-%.3f-%.3f"
#define HASHKEY_FORMAT_STRING_NOSHRINK_NOR_ALPHA "%d-%d-%d-%d-%d-"
void a_mapcache_init ()
{
mc_mutex = g_mutex_new();
cache = g_hash_table_new_full ( g_str_hash, g_str_equal, g_free, g_object_unref );
}
static void cache_add(gchar *key, GdkPixbuf *pixbuf)
{
/* TODO: Check if already exists */
g_hash_table_insert ( cache, key, pixbuf );
queue_size += gdk_pixbuf_get_rowstride(pixbuf) * gdk_pixbuf_get_height(pixbuf);
queue_size += 100;
queue_count++;
}
static void cache_remove(const gchar *key)
{
GdkPixbuf *buf = g_hash_table_lookup ( cache, key );
if (buf) {
queue_size -= gdk_pixbuf_get_rowstride(buf) * gdk_pixbuf_get_height(buf);
queue_size -= 100;
queue_count --;
g_hash_table_remove ( cache, key );
}
}
/* returns key from head, adds on newtailkey to tail. */
static gchar *list_shift_add_entry ( gchar *newtailkey )
{
gchar *oldheadkey = queue_tail->next->key;
queue_tail->next->key = newtailkey;
queue_tail = queue_tail->next;
return oldheadkey;
}
static gchar *list_shift ()
{
gchar *oldheadkey = queue_tail->next->key;
List *oldhead = queue_tail->next;
queue_tail->next = queue_tail->next->next;
g_free ( oldhead );
return oldheadkey;
}
/* adds key to tail */
static void list_add_entry ( gchar *key )
{
List *newlist = g_malloc ( sizeof ( List ) );
newlist->key = key;
if ( queue_tail ) {
newlist->next = queue_tail->next;
queue_tail->next = newlist;
queue_tail = newlist;
} else {
newlist->next = newlist;
queue_tail = newlist;
}
}
void a_mapcache_add ( GdkPixbuf *pixbuf, gint x, gint y, gint z, guint8 type, guint zoom, guint8 alpha, gdouble xshrinkfactor, gdouble yshrinkfactor )
{
gchar *key = g_strdup_printf ( HASHKEY_FORMAT_STRING, x, y, z, type, zoom, alpha, xshrinkfactor, yshrinkfactor );
static int tmp = 0;
g_mutex_lock(mc_mutex);
cache_add(key, pixbuf);
if ( queue_size > VIK_CONFIG_MAPCACHE_SIZE ) {
gchar *oldkey = list_shift_add_entry ( key );
cache_remove(oldkey);
while ( queue_size > VIK_CONFIG_MAPCACHE_SIZE &&
(queue_tail->next != queue_tail) ) { /* make sure there's more than one thing to delete */
oldkey = list_shift ();
cache_remove(oldkey);
}
/* chop off 'start' etc */
} else {
list_add_entry ( key );
/* business as usual */
}
g_mutex_unlock(mc_mutex);
if ( (++tmp == 100 )) { g_print("DEBUG: queue count=%d %u\n", queue_count, queue_size ); tmp=0; }
}
GdkPixbuf *a_mapcache_get ( gint x, gint y, gint z, guint8 type, guint zoom, guint8 alpha, gdouble xshrinkfactor, gdouble yshrinkfactor )
{
static char key[48];
g_snprintf ( key, sizeof(key), HASHKEY_FORMAT_STRING, x, y, z, type, zoom, alpha, xshrinkfactor, yshrinkfactor );
return g_hash_table_lookup ( cache, key );
}
void a_mapcache_remove_all_shrinkfactors ( gint x, gint y, gint z, guint8 type, guint zoom )
{
char key[40];
List *loop = queue_tail;
List *tmp;
gint len;
if ( queue_tail == NULL )
return;
g_snprintf ( key, sizeof(key), HASHKEY_FORMAT_STRING_NOSHRINK_NOR_ALPHA, x, y, z, type, zoom );
len = strlen(key);
g_mutex_lock(mc_mutex);
/* TODO: check logic here */
do {
tmp = loop->next;
if ( strncmp(tmp->key, key, len) == 0 )
{
cache_remove(tmp->key);
if ( tmp == loop ) /* we deleted the last thing in the queue! */
loop = queue_tail = NULL;
else {
loop->next = tmp->next;
if ( tmp == queue_tail )
queue_tail = tmp->next;
}
g_free ( tmp );
tmp = NULL;
}
else
loop = tmp;
} while ( loop && (loop != queue_tail || tmp == NULL) );
/* loop thru list, looking for the one, compare first whatever chars */
cache_remove(key);
g_mutex_unlock(mc_mutex);
}
void a_mapcache_uninit ()
{
g_hash_table_destroy ( cache );
/* free list */
cache = NULL;
}
|
