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
23 * Large (and important) sections of this file were adapted from
24 * ROX-Filer source code, Copyright (C) 2003, the ROX-Filer team,
25 * originally licensed under the GPL v2 or greater (as above).
40 #include <glib/gstdio.h>
42 #include "thumbnails.h"
43 #include "thumbnails_pixbuf.h"
46 #ifdef __CYGWIN_USE_BIG_TYPES__
47 #define ST_SIZE_FMT "%lld"
49 #define ST_SIZE_FMT "%ld"
52 /* FIXME -- on some systems this may need to me "lld", see ROX-Filer code */
53 #define ST_SIZE_FMT "%ld"
56 #undef MIN /* quit yer whining, gcc */
58 #include <sys/param.h> /* for realpath() */
60 /* We need MAX macro and some system does not offer it */
61 #define MAX(a,b) (((a)>(b))?(a):(b))
65 #define HOME_DIR "C:\\VIKING"
66 #define THUMB_DIR "\\THUMBNAILS\\" /* viking maps default viking\maps */
67 #define THUMB_SUB_DIR "normal\\"
68 #define realpath(X,Y) _fullpath(Y,X,MAX_PATH)
71 #define HOME_DIR g_get_home_dir()
72 #define THUMB_DIR "/.thumbnails/"
73 #define THUMB_SUB_DIR "normal/"
76 #define PIXMAP_THUMB_SIZE 128
79 #define MAXPATHLEN 1024
82 static char *md5_hash(const char *message);
83 static char *pathdup(const char *path);
84 static GdkPixbuf *save_thumbnail(const char *pathname, GdkPixbuf *full);
85 static GdkPixbuf *child_create_thumbnail(const gchar *path);
87 gboolean a_thumbnails_exists ( const gchar *filename )
89 GdkPixbuf *pixbuf = a_thumbnails_get(filename);
92 g_object_unref ( G_OBJECT ( pixbuf ) );
98 GdkPixbuf *a_thumbnails_get_default ()
100 return gdk_pixbuf_from_pixdata ( &tnnyl_pixbuf, FALSE, NULL );
103 /* filename must be absolute. you could have a function to make sure it exists and absolutize it */
105 void a_thumbnails_create(const gchar *filename)
107 GdkPixbuf *pixbuf = a_thumbnails_get(filename);
110 pixbuf = child_create_thumbnail(filename);
113 g_object_unref ( G_OBJECT ( pixbuf ) );
116 GdkPixbuf *a_thumbnails_scale_pixbuf(GdkPixbuf *src, int max_w, int max_h)
120 w = gdk_pixbuf_get_width(src);
121 h = gdk_pixbuf_get_height(src);
123 if (w <= max_w && h <= max_h)
130 float scale_x = ((float) w) / max_w;
131 float scale_y = ((float) h) / max_h;
132 float scale = MAX(scale_x, scale_y);
133 int dest_w = w / scale;
134 int dest_h = h / scale;
136 return gdk_pixbuf_scale_simple(src,
139 GDK_INTERP_BILINEAR);
143 static GdkPixbuf *child_create_thumbnail(const gchar *path)
147 image = gdk_pixbuf_new_from_file(path, NULL);
151 GdkPixbuf *thumb = save_thumbnail(path, image);
152 gdk_pixbuf_unref ( image );
159 static GdkPixbuf *save_thumbnail(const char *pathname, GdkPixbuf *full)
163 int original_width, original_height;
165 char *md5, *swidth, *sheight, *ssize, *smtime, *uri;
170 if (stat(pathname, &info) != 0)
173 thumb = a_thumbnails_scale_pixbuf(full, PIXMAP_THUMB_SIZE, PIXMAP_THUMB_SIZE);
175 original_width = gdk_pixbuf_get_width(full);
176 original_height = gdk_pixbuf_get_height(full);
179 swidth = g_strdup_printf("%d", original_width);
180 sheight = g_strdup_printf("%d", original_height);
181 ssize = g_strdup_printf(ST_SIZE_FMT, info.st_size);
182 smtime = g_strdup_printf("%ld", (long) info.st_mtime);
184 path = pathdup(pathname);
185 uri = g_strconcat("file://", path, NULL);
189 to = g_string_new(HOME_DIR);
191 g_mkdir(to->str, 0700);
193 g_string_append(to, THUMB_DIR);
194 g_mkdir(to->str, 0700);
195 g_string_append(to, THUMB_SUB_DIR);
196 g_mkdir(to->str, 0700);
197 g_string_append(to, md5);
198 name_len = to->len + 4; /* Truncate to this length when renaming */
200 g_string_append_printf(to, ".png.Viking");
202 g_string_append_printf(to, ".png.Viking-%ld", (long) getpid());
207 old_mask = umask(0077);
208 gdk_pixbuf_save(thumb, to->str, "png", NULL,
209 "tEXt::Thumb::Image::Width", swidth,
210 "tEXt::Thumb::Image::Height", sheight,
211 "tEXt::Thumb::Size", ssize,
212 "tEXt::Thumb::MTime", smtime,
213 "tEXt::Thumb::URI", uri,
214 "tEXt::Software", PROJECT,
218 /* We create the file ###.png.ROX-Filer-PID and rename it to avoid
219 * a race condition if two programs create the same thumb at
225 final = g_strndup(to->str, name_len);
226 if (rename(to->str, final))
228 g_warning("Failed to rename '%s' to '%s': %s",
229 to->str, final, g_strerror(errno));
230 g_object_unref ( G_OBJECT(thumb) );
231 thumb = NULL; /* return NULL */
237 g_string_free(to, TRUE);
248 GdkPixbuf *a_thumbnails_get(const gchar *pathname)
250 GdkPixbuf *thumb = NULL;
251 char *thumb_path, *md5, *uri, *path;
252 const char *ssize, *smtime;
255 path = pathdup(pathname);
256 uri = g_strconcat("file://", path, NULL);
260 thumb_path = g_strdup_printf("%s%s%s%s.png", HOME_DIR, THUMB_DIR, THUMB_SUB_DIR, md5);
264 thumb = gdk_pixbuf_new_from_file(thumb_path, NULL);
268 /* Note that these don't need freeing... */
269 ssize = gdk_pixbuf_get_option(thumb, "tEXt::Thumb::Size");
273 smtime = gdk_pixbuf_get_option(thumb, "tEXt::Thumb::MTime");
277 if (stat(path, &info) != 0)
280 if (info.st_mtime != atol(smtime) || info.st_size != atol(ssize))
286 gdk_pixbuf_unref(thumb);
294 /* pathdup() stuff */
296 static char *pathdup(const char *path)
298 char real[MAXPATHLEN];
300 g_return_val_if_fail(path != NULL, NULL);
302 if (realpath(path, real))
303 return g_strdup(real);
305 return g_strdup(path);
309 * This code implements the MD5 message-digest algorithm.
310 * The algorithm is due to Ron Rivest. The original code was
311 * written by Colin Plumb in 1993, and put in the public domain.
313 * Modified to use glib datatypes. Put under GPL to simplify
314 * licensing for ROX-Filer. Taken from Debian's dpkg package.
318 #define md5byte unsigned char
320 typedef struct _MD5Context MD5Context;
328 static void MD5Init(MD5Context *ctx);
329 static void MD5Update(MD5Context *ctx, md5byte const *buf, unsigned len);
330 static char *MD5Final(MD5Context *ctx);
331 static void MD5Transform(guint32 buf[4], guint32 const in[16]);
333 #if G_BYTE_ORDER == G_BIG_ENDIAN
334 static void byteSwap(guint32 *buf, unsigned words)
336 md5byte *p = (md5byte *)buf;
339 *buf++ = (guint32)((unsigned)p[3] << 8 | p[2]) << 16 |
340 ((unsigned)p[1] << 8 | p[0]);
345 #define byteSwap(buf,words)
349 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
350 * initialization constants.
352 static void MD5Init(MD5Context *ctx)
354 ctx->buf[0] = 0x67452301;
355 ctx->buf[1] = 0xefcdab89;
356 ctx->buf[2] = 0x98badcfe;
357 ctx->buf[3] = 0x10325476;
364 * Update context to reflect the concatenation of another buffer full
367 static void MD5Update(MD5Context *ctx, md5byte const *buf, unsigned len)
371 /* Update byte count */
374 if ((ctx->bytes[0] = t + len) < t)
375 ctx->bytes[1]++; /* Carry from low to high */
377 t = 64 - (t & 0x3f); /* Space available in ctx->in (at least 1) */
379 memcpy((md5byte *)ctx->in + 64 - t, buf, len);
382 /* First chunk is an odd size */
383 memcpy((md5byte *)ctx->in + 64 - t, buf, t);
384 byteSwap(ctx->in, 16);
385 MD5Transform(ctx->buf, ctx->in);
389 /* Process data in 64-byte chunks */
391 memcpy(ctx->in, buf, 64);
392 byteSwap(ctx->in, 16);
393 MD5Transform(ctx->buf, ctx->in);
398 /* Handle any remaining bytes of data. */
399 memcpy(ctx->in, buf, len);
403 * Final wrapup - pad to 64-byte boundary with the bit pattern
404 * 1 0* (64-bit count of bits processed, MSB-first)
405 * Returns the newly allocated string of the hash.
407 static char *MD5Final(MD5Context *ctx)
411 int count = ctx->bytes[0] & 0x3f; /* Number of bytes in ctx->in */
412 md5byte *p = (md5byte *)ctx->in + count;
415 /* Set the first char of padding to 0x80. There is always room. */
418 /* Bytes of padding needed to make 56 bytes (-8..55) */
419 count = 56 - 1 - count;
421 if (count < 0) { /* Padding forces an extra block */
422 memset(p, 0, count + 8);
423 byteSwap(ctx->in, 16);
424 MD5Transform(ctx->buf, ctx->in);
425 p = (md5byte *)ctx->in;
429 byteSwap(ctx->in, 14);
431 /* Append length in bits and transform */
432 ctx->in[14] = ctx->bytes[0] << 3;
433 ctx->in[15] = ctx->bytes[1] << 3 | ctx->bytes[0] >> 29;
434 MD5Transform(ctx->buf, ctx->in);
436 byteSwap(ctx->buf, 4);
438 retval = g_malloc(33);
439 bytes = (guint8 *) ctx->buf;
440 for (i = 0; i < 16; i++)
441 sprintf(retval + (i * 2), "%02x", bytes[i]);
449 /* The four core functions - F1 is optimized somewhat */
451 /* #define F1(x, y, z) (x & y | ~x & z) */
452 #define F1(x, y, z) (z ^ (x & (y ^ z)))
453 #define F2(x, y, z) F1(z, x, y)
454 #define F3(x, y, z) (x ^ y ^ z)
455 #define F4(x, y, z) (y ^ (x | ~z))
457 /* This is the central step in the MD5 algorithm. */
458 #define MD5STEP(f,w,x,y,z,in,s) \
459 (w += f(x,y,z) + in, w = (w<<s | w>>(32-s)) + x)
462 * The core of the MD5 algorithm, this alters an existing MD5 hash to
463 * reflect the addition of 16 longwords of new data. MD5Update blocks
464 * the data and converts bytes into longwords for this routine.
466 static void MD5Transform(guint32 buf[4], guint32 const in[16])
468 register guint32 a, b, c, d;
475 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
476 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
477 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
478 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
479 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
480 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
481 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
482 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
483 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
484 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
485 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
486 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
487 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
488 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
489 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
490 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
492 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
493 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
494 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
495 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
496 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
497 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
498 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
499 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
500 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
501 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
502 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
503 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
504 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
505 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
506 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
507 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
509 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
510 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
511 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
512 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
513 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
514 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
515 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
516 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
517 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
518 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
519 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
520 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
521 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
522 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
523 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
524 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
526 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
527 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
528 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
529 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
530 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
531 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
532 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
533 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
534 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
535 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
536 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
537 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
538 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
539 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
540 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
541 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
549 # endif /* ASM_MD5 */
551 static char *md5_hash(const char *message)
556 MD5Update(&ctx, message, strlen(message));
557 return MD5Final(&ctx);