1 /* -*- indent-tabs-mode: nil; tab-width: 4; c-basic-offset: 4; -*-
3 image.c for the Openbox window manager
4 Copyright (c) 2006 Mikael Magnusson
5 Copyright (c) 2003-2007 Dana Jansens
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 See the COPYING file for a copy of the GNU General Public License.
23 #include "imagecache.h"
28 #include <librsvg/rsvg.h>
29 #include <librsvg/rsvg-cairo.h>
35 #define FLOOR(i) ((i) & (~0UL << FRACTION))
36 #define AVERAGE(a, b) (((((a) ^ (b)) & 0xfefefefeL) >> 1) + ((a) & (b)))
38 /************************************************************************
41 RrImagePics are pictures that are grouped together into RrImageSets. Each
42 RrImagePic in the set has the same logical image inside it, but they are
43 of different sizes. An RrImagePic can be an original (which comes from some
44 outside source, such as an image file), or resized from some other RrImagePic
45 to meet the needs of the user.
46 **************************************************************************/
49 /*! Set up an RrImagePic.
50 This does _not_ make a copy of the data. So the value of data must be
51 owned by the caller of this function, and not freed afterward.
52 This function does not allocate an RrImagePic, and can be used for setting
53 up a temporary RrImagePic on the stack. Such an object would then also
54 not be freed with RrImagePicFree.
56 static void RrImagePicInit(RrImagePic
*pic
, gint w
, gint h
, RrPixel32
*data
)
64 for (i
= w
*h
; i
> 0; --i
)
65 pic
->sum
+= *(data
++);
68 /*! Create a new RrImagePic from some picture data.
69 This makes a duplicate of the data.
71 static RrImagePic
* RrImagePicNew(gint w
, gint h
, RrPixel32
*data
)
75 pic
= g_slice_new(RrImagePic
);
76 RrImagePicInit(pic
, w
, h
, g_memdup(data
, w
*h
*sizeof(RrPixel32
)));
81 /*! Destroy an RrImagePic.
82 This frees the RrImagePic object and everything inside it.
84 static void RrImagePicFree(RrImagePic
*pic
)
88 g_slice_free(RrImagePic
, pic
);
92 /************************************************************************
95 RrImageSets hold a group of pictures, each of which represent the same logical
96 image, but are physically different sizes.
97 At any time, it may be discovered that two different RrImageSets are actually
98 holding the same logical image. At that time, they would be merged.
99 An RrImageSet holds both original images which come from an outside source,
100 and resized images, which are generated when requests for a specific size are
101 made, and kept around in case they are request again. There is a maximum
102 number of resized images that an RrImageSet will keep around, however.
104 Each RrImage points to a single RrImageSet, which keeps track of which
105 RrImages point to it. If two RrImageSets are merged, then the RrImages which
106 pointed to the two RrImageSets will all point at the resulting merged set.
107 **************************************************************************/
110 /*! Free an RrImageSet and the stuff inside it.
111 This should only occur when there are no more RrImages pointing to the set.
113 static void RrImageSetFree(RrImageSet
*self
)
119 g_assert(self
->images
== NULL
);
121 /* remove all names associated with this RrImageSet */
122 for (it
= self
->names
; it
; it
= g_slist_next(it
)) {
123 g_hash_table_remove(self
->cache
->name_table
, it
->data
);
126 g_slist_free(self
->names
);
128 /* destroy the RrImagePic objects stored in the RrImageSet. they will
129 be keys in the cache to RrImageSet objects, so remove them from
130 the cache's pic_table as well. */
131 for (i
= 0; i
< self
->n_original
; ++i
) {
132 g_hash_table_remove(self
->cache
->pic_table
, self
->original
[i
]);
133 RrImagePicFree(self
->original
[i
]);
135 g_free(self
->original
);
136 for (i
= 0; i
< self
->n_resized
; ++i
) {
137 g_hash_table_remove(self
->cache
->pic_table
, self
->resized
[i
]);
138 RrImagePicFree(self
->resized
[i
]);
140 g_free(self
->resized
);
142 g_slice_free(RrImageSet
, self
);
146 /*! Remove a picture from an RrImageSet as a given position.
147 @param set The RrImageSet to remove the picture from.
148 @param i The index of the picture in the RrImageSet in the list of
149 originals (if @original is TRUE), or in the list of resized pictures (if
151 @param original TRUE if the picture is an original, FALSE if it is a resized
152 version of another picture in the RrImageSet.
154 static void RrImageSetRemovePictureAt(RrImageSet
*self
, gint i
,
161 list
= &self
->original
;
162 len
= &self
->n_original
;
165 list
= &self
->resized
;
166 len
= &self
->n_resized
;
169 g_assert(i
>= 0 && i
< *len
);
171 /* remove the picture data as a key in the cache */
172 g_hash_table_remove(self
->cache
->pic_table
, (*list
)[i
]);
174 /* free the picture being removed */
175 RrImagePicFree((*list
)[i
]);
177 /* copy the elements after the removed one in the array forward one space
178 and shrink the array down one size */
179 for (i
= i
+1; i
< *len
; ++i
)
180 (*list
)[i
-1] = (*list
)[i
];
182 *list
= g_renew(RrImagePic
*, *list
, *len
);
185 /*! Add an RrImagePic to an RrImageSet.
186 The RrImagePic should _not_ exist in the image cache already.
187 Pictures are added to the front of the list, to maintain the ordering of
190 static void RrImageSetAddPicture(RrImageSet
*self
, RrImagePic
*pic
,
197 g_assert(pic
->width
> 0 && pic
->height
> 0);
198 g_assert(g_hash_table_lookup(self
->cache
->pic_table
, pic
) == NULL
);
200 /* choose which list in the RrImageSet to add the new picture to. */
202 /* remove the resized picture of the same size if one exists */
203 for (i
= 0; i
< self
->n_resized
; ++i
)
204 if (self
->resized
[i
]->width
== pic
->width
||
205 self
->resized
[i
]->height
== pic
->height
)
207 RrImageSetRemovePictureAt(self
, i
, FALSE
);
211 list
= &self
->original
;
212 len
= &self
->n_original
;
215 list
= &self
->resized
;
216 len
= &self
->n_resized
;
219 /* grow the list by one spot, shift everything down one, and insert the new
220 picture at the front of the list */
221 *list
= g_renew(RrImagePic
*, *list
, ++*len
);
222 for (i
= *len
-1; i
> 0; --i
)
223 (*list
)[i
] = (*list
)[i
-1];
226 /* add the picture as a key to point to this image in the cache */
227 g_hash_table_insert(self
->cache
->pic_table
, (*list
)[0], self
);
231 g_debug("Adding %s picture to the cache:\n "
232 "Image 0x%lx, w %d h %d Hash %u",
233 (*list == self->original ? "ORIGINAL" : "RESIZED"),
234 (gulong)self, pic->width, pic->height, RrImagePicHash(pic));
239 /*! Merges two image sets, destroying one, and returning the other. */
240 RrImageSet
* RrImageSetMergeSets(RrImageSet
*b
, RrImageSet
*a
)
242 gint a_i
, b_i
, merged_i
;
243 RrImagePic
**original
, **resized
;
244 gint n_original
, n_resized
, tmp
;
247 const gint max_resized
= a
->cache
->max_resized_saved
;
256 /* the original and resized picture lists in an RrImageSet are kept ordered
257 as newest to oldest. we don't have timestamps for them, so we cannot
258 preserve this in the merged RrImageSet exactly. a decent approximation,
259 i think, is to add them in alternating order (one from a, one from b,
260 repeat). this way, the newest from each will be near the front at
261 least, and in the resized list, when we drop an old picture, we will
262 not always only drop from a or b only, but from each of them equally (or
263 from whichever has more resized pictures.
266 g_assert(b
->cache
== a
->cache
);
268 a_i
= b_i
= merged_i
= 0;
269 n_original
= a
->n_original
+ b
->n_original
;
270 original
= g_new(RrImagePic
*, n_original
);
271 while (merged_i
< n_original
) {
272 if (a_i
< a
->n_original
)
273 original
[merged_i
++] = a
->original
[a_i
++];
274 if (b_i
< b
->n_original
)
275 original
[merged_i
++] = b
->original
[b_i
++];
278 a_i
= b_i
= merged_i
= 0;
279 n_resized
= MIN(max_resized
, a
->n_resized
+ b
->n_resized
);
280 resized
= g_new(RrImagePic
*, n_resized
);
281 while (merged_i
< n_resized
) {
282 if (a_i
< a
->n_resized
)
283 resized
[merged_i
++] = a
->resized
[a_i
++];
284 if (b_i
< b
->n_resized
&& merged_i
< n_resized
)
285 resized
[merged_i
++] = b
->resized
[b_i
++];
288 /* if there are any RrImagePic objects left over in a->resized or
289 b->resized, they need to be disposed of, and removed from the cache.
291 updates the size of the list, as we want to remember which pointers
292 were merged from which list (and don't want to remember the ones we
293 did not merge and have freed).
296 for (; a_i
< a
->n_resized
; ++a_i
) {
297 g_hash_table_remove(a
->cache
->pic_table
, a
->resized
[a_i
]);
298 RrImagePicFree(a
->resized
[a_i
]);
303 for (; b_i
< b
->n_resized
; ++b_i
) {
304 g_hash_table_remove(a
->cache
->pic_table
, b
->resized
[b_i
]);
305 RrImagePicFree(b
->resized
[b_i
]);
309 /* we will use the a object as the merge destination, so things in b will
312 the cache's name_table will point to b for all the names in b->names,
313 so these need to be updated to point at a instead.
314 also, the cache's pic_table will point to b for all the pictures in b,
315 so these need to be updated to point at a as well.
317 any RrImage objects that were using b should now use a instead.
319 the names and images will be all moved into a, and the merged picture
320 lists will be placed in a. the pictures in a and b are moved to new
321 arrays, so the arrays in a and b need to be freed explicitly (the
322 RrImageSetFree function would free the picture data too which we do not
323 want here). then b can be freed.
326 for (it
= b
->names
; it
; it
= g_slist_next(it
))
327 g_hash_table_insert(a
->cache
->name_table
, it
->data
, a
);
328 for (b_i
= 0; b_i
< b
->n_original
; ++b_i
)
329 g_hash_table_insert(a
->cache
->pic_table
, b
->original
[b_i
], a
);
330 for (b_i
= 0; b_i
< b
->n_resized
; ++b_i
)
331 g_hash_table_insert(a
->cache
->pic_table
, b
->resized
[b_i
], a
);
333 for (it
= b
->images
; it
; it
= g_slist_next(it
))
334 ((RrImage
*)it
->data
)->set
= a
;
336 a
->images
= g_slist_concat(a
->images
, b
->images
);
338 a
->names
= g_slist_concat(a
->names
, b
->names
);
341 a
->n_original
= a
->n_resized
= 0;
344 a
->original
= a
->resized
= NULL
;
345 b
->n_original
= b
->n_resized
= 0;
348 b
->original
= b
->resized
= NULL
;
350 a
->n_original
= n_original
;
351 a
->original
= original
;
352 a
->n_resized
= n_resized
;
353 a
->resized
= resized
;
360 static void RrImageSetAddName(RrImageSet
*set
, const gchar
*name
)
365 set
->names
= g_slist_prepend(set
->names
, n
);
367 /* add the new name to the hash table */
368 g_assert(g_hash_table_lookup(set
->cache
->name_table
, n
) == NULL
);
369 g_hash_table_insert(set
->cache
->name_table
, n
, set
);
373 /************************************************************************
375 **************************************************************************/
378 void RrImageRef(RrImage
*self
)
383 void RrImageUnref(RrImage
*self
)
385 if (self
&& --self
->ref
== 0) {
389 g_debug("Refcount to 0, removing ALL pictures from the cache:\n "
390 "Image 0x%lx", (gulong)self);
393 if (self
->destroy_func
)
394 self
->destroy_func(self
, self
->destroy_data
);
397 set
->images
= g_slist_remove(set
->images
, self
);
399 /* free the set as well if there are no images pointing to it */
402 g_slice_free(RrImage
, self
);
406 /*! Set function that will be called just before RrImage is destroyed. */
407 void RrImageSetDestroyFunc(RrImage
*self
, RrImageDestroyFunc func
,
410 self
->destroy_func
= func
;
411 self
->destroy_data
= data
;
414 void RrImageAddFromData(RrImage
*self
, RrPixel32
*data
, gint w
, gint h
)
416 RrImagePic pic
, *ppic
;
419 g_return_if_fail(self
!= NULL
);
420 g_return_if_fail(data
!= NULL
);
421 g_return_if_fail(w
> 0 && h
> 0);
423 RrImagePicInit(&pic
, w
, h
, data
);
424 set
= g_hash_table_lookup(self
->set
->cache
->pic_table
, &pic
);
426 self
->set
= RrImageSetMergeSets(self
->set
, set
);
428 ppic
= RrImagePicNew(w
, h
, data
);
429 RrImageSetAddPicture(self
->set
, ppic
, TRUE
);
433 RrImage
* RrImageNewFromData(RrImageCache
*cache
, RrPixel32
*data
,
436 RrImagePic pic
, *ppic
;
440 g_return_val_if_fail(cache
!= NULL
, NULL
);
441 g_return_val_if_fail(data
!= NULL
, NULL
);
442 g_return_val_if_fail(w
> 0 && h
> 0, NULL
);
444 /* finds a picture in the cache, if it is already in there, and use the
445 RrImageSet the picture lives in. */
446 RrImagePicInit(&pic
, w
, h
, data
);
447 set
= g_hash_table_lookup(cache
->pic_table
, &pic
);
449 self
= set
->images
->data
; /* just grab any RrImage from the list */
454 /* the image does not exist in any RrImageSet in the cache, so make
455 a new RrImageSet, and a new RrImage that points to it, and place the
456 new image inside the new RrImageSet */
458 self
= g_slice_new0(RrImage
);
460 self
->set
= g_slice_new0(RrImageSet
);
461 self
->set
->cache
= cache
;
462 self
->set
->images
= g_slist_append(self
->set
->images
, self
);
464 ppic
= RrImagePicNew(w
, h
, data
);
465 RrImageSetAddPicture(self
->set
, ppic
, TRUE
);
470 #if defined(USE_IMLIB2)
471 typedef struct _ImlibLoader ImlibLoader
;
478 void DestroyImlibLoader(ImlibLoader
*loader
)
484 g_slice_free(ImlibLoader
, loader
);
487 ImlibLoader
* LoadWithImlib(gchar
*path
,
488 RrPixel32
**pixel_data
,
492 ImlibLoader
*loader
= g_slice_new0(ImlibLoader
);
493 if (!(loader
->img
= imlib_load_image(path
))) {
494 DestroyImlibLoader(loader
);
498 /* Get data and dimensions of the image.
500 WARNING: This stuff is NOT threadsafe !!
502 imlib_context_set_image(loader
->img
);
503 *pixel_data
= imlib_image_get_data_for_reading_only();
504 *width
= imlib_image_get_width();
505 *height
= imlib_image_get_height();
509 #endif /* USE_IMLIB2 */
511 #if defined(USE_LIBRSVG)
512 typedef struct _RsvgLoader RsvgLoader
;
517 cairo_surface_t
*surface
;
518 RrPixel32
*pixel_data
;
521 void DestroyRsvgLoader(RsvgLoader
*loader
)
526 if (loader
->pixel_data
)
527 g_free(loader
->pixel_data
);
529 cairo_surface_destroy(loader
->surface
);
531 g_object_unref(loader
->handle
);
532 g_slice_free(RsvgLoader
, loader
);
535 RsvgLoader
* LoadWithRsvg(gchar
*path
,
536 RrPixel32
**pixel_data
,
540 RsvgLoader
*loader
= g_slice_new0(RsvgLoader
);
542 if (!(loader
->handle
= rsvg_handle_new_from_file(path
, NULL
))) {
543 DestroyRsvgLoader(loader
);
547 if (!rsvg_handle_close(loader
->handle
, NULL
)) {
548 DestroyRsvgLoader(loader
);
552 RsvgDimensionData dimension_data
;
553 rsvg_handle_get_dimensions(loader
->handle
, &dimension_data
);
554 *width
= dimension_data
.width
;
555 *height
= dimension_data
.height
;
557 loader
->surface
= cairo_image_surface_create(
558 CAIRO_FORMAT_ARGB32
, *width
, *height
);
560 cairo_t
* context
= cairo_create(loader
->surface
);
561 gboolean success
= rsvg_handle_render_cairo(loader
->handle
, context
);
562 cairo_destroy(context
);
565 DestroyRsvgLoader(loader
);
569 loader
->pixel_data
= g_new(guint32
, *width
* *height
);
572 Cairo has its data in ARGB with premultiplied alpha, but RrPixel32
573 non-premultipled, so convert that. Also, RrPixel32 doesn't allow
574 strides not equal to the width of the image.
577 /* Verify that RrPixel32 has the same ordering as cairo. */
578 g_assert(RrDefaultAlphaOffset
== 24);
579 g_assert(RrDefaultRedOffset
== 16);
580 g_assert(RrDefaultGreenOffset
== 8);
581 g_assert(RrDefaultBlueOffset
== 0);
583 guint32
*out_row
= loader
->pixel_data
;
586 (guint32
*)cairo_image_surface_get_data(loader
->surface
);
587 gint in_stride
= cairo_image_surface_get_stride(loader
->surface
);
590 for (y
= 0; y
< *height
; ++y
) {
592 for (x
= 0; x
< *width
; ++x
) {
593 guchar a
= in_row
[x
] >> 24;
594 guchar r
= (in_row
[x
] >> 16) & 0xff;
595 guchar g
= (in_row
[x
] >> 8) & 0xff;
596 guchar b
= in_row
[x
] & 0xff;
598 ((r
* 256 / (a
+ 1)) << RrDefaultRedOffset
) +
599 ((g
* 256 / (a
+ 1)) << RrDefaultGreenOffset
) +
600 ((b
* 256 / (a
+ 1)) << RrDefaultBlueOffset
) +
601 (a
<< RrDefaultAlphaOffset
);
603 in_row
+= in_stride
/ 4;
607 *pixel_data
= loader
->pixel_data
;
611 #endif /* USE_LIBRSVG */
613 RrImage
* RrImageNewFromName(RrImageCache
*cache
, const gchar
*name
)
622 #if defined(USE_IMLIB2)
623 ImlibLoader
*imlib_loader
= NULL
;
625 #if defined(USE_LIBRSVG)
626 RsvgLoader
*rsvg_loader
= NULL
;
629 g_return_val_if_fail(cache
!= NULL
, NULL
);
630 g_return_val_if_fail(name
!= NULL
, NULL
);
632 set
= g_hash_table_lookup(cache
->name_table
, name
);
634 self
= set
->images
->data
;
639 /* XXX find the path via freedesktop icon spec (use obt) ! */
640 path
= g_strdup(name
);
643 #if defined(USE_LIBRSVG)
645 rsvg_loader
= LoadWithRsvg(path
, &data
, &w
, &h
);
646 loaded
= !!rsvg_loader
;
649 #if defined(USE_IMLIB2)
651 imlib_loader
= LoadWithImlib(path
, &data
, &w
, &h
);
652 loaded
= !!imlib_loader
;
657 g_message("Cannot load image \"%s\" from file \"%s\"", name
, path
);
659 #if defined(USE_LIBRSVG)
660 DestroyRsvgLoader(rsvg_loader
);
662 #if defined(USE_IMLIB2)
663 DestroyImlibLoader(imlib_loader
);
670 /* get an RrImage that contains an RrImageSet with this picture in it.
671 the RrImage might be new, or reused if the picture was already in the
674 either way, we get back an RrImageSet (via the RrImage), and we must add
675 the name to that RrImageSet. because of the check above, we know that
676 there is no RrImageSet in the cache which already has the given name
680 self
= RrImageNewFromData(cache
, data
, w
, h
);
681 RrImageSetAddName(self
->set
, name
);
683 #if defined(USE_LIBRSVG)
684 DestroyRsvgLoader(rsvg_loader
);
686 #if defined(USE_IMLIB2)
687 DestroyImlibLoader(imlib_loader
);
693 /************************************************************************
694 Image drawing and resizing operations.
695 **************************************************************************/
697 /*! Given a picture in RGBA format, of a specified size, resize it to the new
698 requested size (but keep its aspect ratio). If the image does not need to
699 be resized (it is already the right size) then this returns NULL. Otherwise
700 it returns a newly allocated RrImagePic with the resized picture inside it
701 @return Returns a newly allocated RrImagePic object with a new version of the
702 image in the requested size (keeping aspect ratio).
704 static RrImagePic
* ResizeImage(RrPixel32
*src
,
705 gulong srcW
, gulong srcH
,
706 gulong dstW
, gulong dstH
)
708 RrPixel32
*dst
, *dststart
;
710 gulong dstX
, dstY
, srcX
, srcY
;
711 gulong srcX1
, srcX2
, srcY1
, srcY2
;
712 gulong ratioX
, ratioY
;
713 gulong aspectW
, aspectH
;
720 /* keep the aspect ratio */
722 aspectH
= (gint
)(dstW
* ((gdouble
)srcH
/ srcW
));
723 if (aspectH
> dstH
) {
725 aspectW
= (gint
)(dstH
* ((gdouble
)srcW
/ srcH
));
727 dstW
= aspectW
? aspectW
: 1;
728 dstH
= aspectH
? aspectH
: 1;
730 if (srcW
== dstW
&& srcH
== dstH
)
731 return NULL
; /* no scaling needed! */
733 dststart
= dst
= g_new(RrPixel32
, dstW
* dstH
);
735 ratioX
= (srcW
<< FRACTION
) / dstW
;
736 ratioY
= (srcH
<< FRACTION
) / dstH
;
739 for (dstY
= 0; dstY
< dstH
; dstY
++) {
744 for (dstX
= 0; dstX
< dstW
; dstX
++) {
745 gulong red
= 0, green
= 0, blue
= 0, alpha
= 0;
746 gulong portionX
, portionY
, portionXY
, sumXY
= 0;
752 for (srcY
= srcY1
; srcY
< srcY2
; srcY
+= (1UL << FRACTION
)) {
755 portionY
= (1UL << FRACTION
) - (srcY1
- srcY
);
756 if (portionY
> srcY2
- srcY1
)
757 portionY
= srcY2
- srcY1
;
759 else if (srcY
== FLOOR(srcY2
))
760 portionY
= srcY2
- srcY
;
762 portionY
= (1UL << FRACTION
);
764 for (srcX
= srcX1
; srcX
< srcX2
; srcX
+= (1UL << FRACTION
)) {
767 portionX
= (1UL << FRACTION
) - (srcX1
- srcX
);
768 if (portionX
> srcX2
- srcX1
)
769 portionX
= srcX2
- srcX1
;
771 else if (srcX
== FLOOR(srcX2
))
772 portionX
= srcX2
- srcX
;
774 portionX
= (1UL << FRACTION
);
776 portionXY
= (portionX
* portionY
) >> FRACTION
;
779 pixel
= *(src
+ (srcY
>> FRACTION
) * srcW
780 + (srcX
>> FRACTION
));
781 red
+= ((pixel
>> RrDefaultRedOffset
) & 0xFF)
783 green
+= ((pixel
>> RrDefaultGreenOffset
) & 0xFF)
785 blue
+= ((pixel
>> RrDefaultBlueOffset
) & 0xFF)
787 alpha
+= ((pixel
>> RrDefaultAlphaOffset
) & 0xFF)
792 g_assert(sumXY
!= 0);
798 *dst
++ = (red
<< RrDefaultRedOffset
) |
799 (green
<< RrDefaultGreenOffset
) |
800 (blue
<< RrDefaultBlueOffset
) |
801 (alpha
<< RrDefaultAlphaOffset
);
805 pic
= g_slice_new(RrImagePic
);
806 RrImagePicInit(pic
, dstW
, dstH
, dststart
);
811 /*! This draws an RGBA picture into the target, within the rectangle specified
812 by the area parameter. If the area's size differs from the source's then it
813 will be centered within the rectangle */
814 void DrawRGBA(RrPixel32
*target
, gint target_w
, gint target_h
,
815 RrPixel32
*source
, gint source_w
, gint source_h
,
816 gint alpha
, RrRect
*area
)
819 gint col
, num_pixels
;
822 g_assert(source_w
<= area
->width
&& source_h
<= area
->height
);
823 g_assert(area
->x
+ area
->width
<= target_w
);
824 g_assert(area
->y
+ area
->height
<= target_h
);
826 /* keep the aspect ratio */
828 dh
= (gint
)(dw
* ((gdouble
)source_h
/ source_w
));
829 if (dh
> area
->height
) {
831 dw
= (gint
)(dh
* ((gdouble
)source_w
/ source_h
));
834 /* copy source -> dest, and apply the alpha channel.
835 center the image if it is smaller than the area */
837 num_pixels
= dw
* dh
;
838 dest
= target
+ area
->x
+ (area
->width
- dw
) / 2 +
839 (target_w
* (area
->y
+ (area
->height
- dh
) / 2));
840 while (num_pixels
-- > 0) {
841 guchar a
, r
, g
, b
, bgr
, bgg
, bgb
;
843 /* apply the rgba's opacity as well */
844 a
= ((*source
>> RrDefaultAlphaOffset
) * alpha
) >> 8;
845 r
= *source
>> RrDefaultRedOffset
;
846 g
= *source
>> RrDefaultGreenOffset
;
847 b
= *source
>> RrDefaultBlueOffset
;
849 /* background color */
850 bgr
= *dest
>> RrDefaultRedOffset
;
851 bgg
= *dest
>> RrDefaultGreenOffset
;
852 bgb
= *dest
>> RrDefaultBlueOffset
;
854 r
= bgr
+ (((r
- bgr
) * a
) >> 8);
855 g
= bgg
+ (((g
- bgg
) * a
) >> 8);
856 b
= bgb
+ (((b
- bgb
) * a
) >> 8);
858 *dest
= ((r
<< RrDefaultRedOffset
) |
859 (g
<< RrDefaultGreenOffset
) |
860 (b
<< RrDefaultBlueOffset
));
867 dest
+= target_w
- dw
;
872 /*! Draw an RGBA texture into a target pixel buffer. */
873 void RrImageDrawRGBA(RrPixel32
*target
, RrTextureRGBA
*rgba
,
874 gint target_w
, gint target_h
,
879 scaled
= ResizeImage(rgba
->data
, rgba
->width
, rgba
->height
,
880 area
->width
, area
->height
);
884 g_warning("Scaling an RGBA! You should avoid this and just make "
885 "it the right size yourself!");
887 DrawRGBA(target
, target_w
, target_h
,
888 scaled
->data
, scaled
->width
, scaled
->height
,
890 RrImagePicFree(scaled
);
893 DrawRGBA(target
, target_w
, target_h
,
894 rgba
->data
, rgba
->width
, rgba
->height
,
898 /*! Draw an RrImage texture into a target pixel buffer. If the RrImage does
899 not contain a picture of the appropriate size, then one of its "original"
900 pictures will be resized and used (and stored in the RrImage as a "resized"
903 void RrImageDrawImage(RrPixel32
*target
, RrTextureImage
*img
,
904 gint target_w
, gint target_h
,
907 gint i
, min_diff
, min_i
, min_aspect_diff
, min_aspect_i
;
918 /* is there an original of this size? (only the larger of
919 w or h has to be right cuz we maintain aspect ratios) */
920 for (i
= 0; i
< set
->n_original
; ++i
)
921 if ((set
->original
[i
]->width
>= set
->original
[i
]->height
&&
922 set
->original
[i
]->width
== area
->width
) ||
923 (set
->original
[i
]->width
<= set
->original
[i
]->height
&&
924 set
->original
[i
]->height
== area
->height
))
926 pic
= set
->original
[i
];
930 /* is there a resize of this size? */
931 for (i
= 0; i
< set
->n_resized
; ++i
)
932 if ((set
->resized
[i
]->width
>= set
->resized
[i
]->height
&&
933 set
->resized
[i
]->width
== area
->width
) ||
934 (set
->resized
[i
]->width
<= set
->resized
[i
]->height
&&
935 set
->resized
[i
]->height
== area
->height
))
940 /* save the selected one */
941 saved
= set
->resized
[i
];
943 /* shift all the others down */
944 for (j
= i
; j
> 0; --j
)
945 set
->resized
[j
] = set
->resized
[j
-1];
947 /* and move the selected one to the top of the list */
948 set
->resized
[0] = saved
;
950 pic
= set
->resized
[0];
956 RrImageSet
*cache_set
;
958 /* find an original with a close size */
959 min_diff
= min_aspect_diff
= -1;
960 min_i
= min_aspect_i
= 0;
961 aspect
= ((gdouble
)area
->width
) / area
->height
;
962 for (i
= 0; i
< set
->n_original
; ++i
) {
967 /* our size difference metric.. */
968 wdiff
= set
->original
[i
]->width
- area
->width
;
969 if (wdiff
< 0) wdiff
*= 2; /* prefer scaling down than up */
970 hdiff
= set
->original
[i
]->height
- area
->height
;
971 if (hdiff
< 0) hdiff
*= 2; /* prefer scaling down than up */
972 diff
= (wdiff
* wdiff
) + (hdiff
* hdiff
);
974 /* find the smallest difference */
975 if (min_diff
< 0 || diff
< min_diff
) {
979 /* and also find the smallest difference with the same aspect
980 ratio (and prefer this one) */
981 myasp
= ((gdouble
)set
->original
[i
]->width
) /
982 set
->original
[i
]->height
;
983 if (ABS(aspect
- myasp
) < 0.0000001 &&
984 (min_aspect_diff
< 0 || diff
< min_aspect_diff
))
986 min_aspect_diff
= diff
;
991 /* use the aspect ratio correct source if there is one */
992 if (min_aspect_i
>= 0)
993 min_i
= min_aspect_i
;
995 /* resize the original to the given area */
996 pic
= ResizeImage(set
->original
[min_i
]->data
,
997 set
->original
[min_i
]->width
,
998 set
->original
[min_i
]->height
,
999 area
->width
, area
->height
);
1001 /* is it already in the cache ? */
1002 cache_set
= g_hash_table_lookup(set
->cache
->pic_table
, pic
);
1004 /* merge this set with the one found in the cache - they are
1005 apparently the same image ! then next time we won't have to do
1006 this resizing, we will use the cache_set's pic instead. */
1007 set
= RrImageSetMergeSets(set
, cache_set
);
1011 /* add the resized image to the image, as the first in the resized
1013 while (set
->n_resized
>= set
->cache
->max_resized_saved
)
1014 /* remove the last one (last used one) to make space for
1015 adding our resized picture */
1016 RrImageSetRemovePictureAt(set
, set
->n_resized
-1, FALSE
);
1017 if (set
->cache
->max_resized_saved
)
1018 /* add it to the resized list */
1019 RrImageSetAddPicture(set
, pic
, FALSE
);
1021 free_pic
= TRUE
; /* don't leak mem! */
1025 /* The RrImageSet may have changed if we merged it with another, so the
1026 RrImage object needs to be updated to use the new merged RrImageSet. */
1029 g_assert(pic
!= NULL
);
1031 DrawRGBA(target
, target_w
, target_h
,
1032 pic
->data
, pic
->width
, pic
->height
,
1035 RrImagePicFree(pic
);