1
/* -*- indent-tabs-mode: nil; tab-width: 4; c-basic-offset: 4; -*-
3
imagecache.c for the Openbox window manager
4
Copyright (c) 2008 Dana Jansens
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
See the COPYING file for a copy of the GNU General Public License.
20
#include "imagecache.h"
23
static gboolean RrImagePicEqual(const RrImagePic *p1,
24
const RrImagePic *p2);
26
RrImageCache* RrImageCacheNew(gint max_resized_saved)
30
g_assert(max_resized_saved >= 0);
32
self = g_new(RrImageCache, 1);
34
self->max_resized_saved = max_resized_saved;
35
self->table = g_hash_table_new((GHashFunc)RrImagePicHash,
36
(GEqualFunc)RrImagePicEqual);
40
void RrImageCacheRef(RrImageCache *self)
45
void RrImageCacheUnref(RrImageCache *self)
47
if (self && --self->ref == 0) {
48
g_assert(g_hash_table_size(self->table) == 0);
49
g_hash_table_unref(self->table);
55
/*! Finds an image in the cache, if it is already in there */
56
RrImage* RrImageCacheFind(RrImageCache *self,
57
RrPixel32 *data, gint w, gint h)
61
RrImagePicInit(&pic, w, h, data);
62
return g_hash_table_lookup(self->table, &pic);
65
#define hashsize(n) ((RrPixel32)1<<(n))
66
#define hashmask(n) (hashsize(n)-1)
67
#define rot(x,k) (((x)<<(k)) | ((x)>>(32-(k))))
68
/* mix -- mix 3 32-bit values reversibly. */
71
a -= c; a ^= rot(c, 4); c += b; \
72
b -= a; b ^= rot(a, 6); a += c; \
73
c -= b; c ^= rot(b, 8); b += a; \
74
a -= c; a ^= rot(c,16); c += b; \
75
b -= a; b ^= rot(a,19); a += c; \
76
c -= b; c ^= rot(b, 4); b += a; \
78
/* final -- final mixing of 3 32-bit values (a,b,c) into c */
79
#define final(a,b,c) \
81
c ^= b; c -= rot(b,14); \
82
a ^= c; a -= rot(c,11); \
83
b ^= a; b -= rot(a,25); \
84
c ^= b; c -= rot(b,16); \
85
a ^= c; a -= rot(c,4); \
86
b ^= a; b -= rot(a,14); \
87
c ^= b; c -= rot(b,24); \
90
/* This is a fast, reversable hash function called "lookup3", found here:
91
http://burtleburtle.net/bob/c/lookup3.c, by Bob Jenkins
93
This hashing algorithm is "reversible", that is, not cryptographically
94
secure at all. But we don't care about that, we just want something to
95
tell when images are the same or different relatively quickly.
97
guint32 hashword(const guint32 *key, gint length, guint32 initval)
101
/* Set up the internal state */
102
a = b = c = 0xdeadbeef + (((guint32)length)<<2) + initval;
104
/* handle most of the key */
115
/* handle the last 3 guint32's */
116
switch(length) /* all the case statements fall through */
122
case 0: /* case 0: nothing left to add */
125
/* report the result */
129
/*! This is some arbitrary initial value for the hashing function. It's
130
constant so that you get the same result from the same data each time.
132
#define HASH_INITVAL 0xf00d
134
guint RrImagePicHash(const RrImagePic *p)
136
return hashword(p->data, p->width * p->height, HASH_INITVAL);
139
static gboolean RrImagePicEqual(const RrImagePic *p1,
140
const RrImagePic *p2)
142
return p1->width == p2->width && p1->height == p2->height &&