final rescale improvement and some optimisation
[melted] / src / modules / gtk2 / pixops.c
1 /* GdkPixbuf library - Scaling and compositing functions
2 *
3 * Copyright (C) 1999 The Free Software Foundation
4 *
5 * Author: Owen Taylor <otaylor@redhat.com>
6 * Modified for YUV422 by Dan Dennedy <dan@dennedy.org>
7 *
8 * This library is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Lesser General Public
10 * License as published by the Free Software Foundation; either
11 * version 2 of the License, or (at your option) any later version.
12 *
13 * This library is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * Lesser General Public License for more details.
17 *
18 * You should have received a copy of the GNU Lesser General Public
19 * License along with this library; if not, write to the
20 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
21 * Boston, MA 02111-1307, USA.
22 */
23
24 #include <math.h>
25 #include <glib.h>
26 #include <stdio.h>
27
28 #include "pixops.h"
29
30 #define SUBSAMPLE_BITS 4
31 #define SUBSAMPLE (1 << SUBSAMPLE_BITS)
32 #define SUBSAMPLE_MASK ((1 << SUBSAMPLE_BITS)-1)
33 #define SCALE_SHIFT 16
34
35 typedef struct _PixopsFilter PixopsFilter;
36 typedef struct _PixopsFilterDimension PixopsFilterDimension;
37
38 struct _PixopsFilterDimension
39 {
40 int n;
41 double offset;
42 double *weights;
43 };
44
45 struct _PixopsFilter
46 {
47 PixopsFilterDimension x;
48 PixopsFilterDimension y;
49 double overall_alpha;
50 };
51
52 typedef guchar *( *PixopsLineFunc ) ( int *weights, int n_x, int n_y,
53 guchar *dest, int dest_x, guchar *dest_end,
54 guchar **src,
55 int x_init, int x_step, int src_width );
56
57 typedef void ( *PixopsPixelFunc ) ( guchar *dest, guint y1, guint cr, guint y2, guint cb );
58
59
60 /* mmx function declarations */
61 #ifdef USE_MMX
62 guchar *pixops_scale_line_22_33_mmx ( guint32 weights[ 16 ][ 8 ], guchar *p, guchar *q1, guchar *q2, int x_step, guchar *p_stop, int x_init );
63 int pixops_have_mmx ( void );
64 #endif
65
66 static inline int
67 get_check_shift ( int check_size )
68 {
69 int check_shift = 0;
70 g_return_val_if_fail ( check_size >= 0, 4 );
71
72 while ( !( check_size & 1 ) )
73 {
74 check_shift++;
75 check_size >>= 1;
76 }
77
78 return check_shift;
79 }
80
81 static inline void
82 pixops_scale_nearest ( guchar *dest_buf,
83 int render_x0,
84 int render_y0,
85 int render_x1,
86 int render_y1,
87 int dest_rowstride,
88 const guchar *src_buf,
89 int src_width,
90 int src_height,
91 int src_rowstride,
92 double scale_x,
93 double scale_y )
94 {
95 register int i, j;
96 register int x_step = ( 1 << SCALE_SHIFT ) / scale_x;
97 register int y_step = ( 1 << SCALE_SHIFT ) / scale_y;
98 register int x, x_scaled;
99
100 for ( i = 0; i < ( render_y1 - render_y0 ); i++ )
101 {
102 const guchar *src = src_buf + ( ( ( i + render_y0 ) * y_step + ( y_step >> 1 ) ) >> SCALE_SHIFT ) * src_rowstride;
103 guchar *dest = dest_buf + i * dest_rowstride;
104 x = render_x0 * x_step + ( x_step >> 1 );
105
106 for ( j = 0; j < ( render_x1 - render_x0 ); j++ )
107 {
108 x_scaled = x >> SCALE_SHIFT;
109 *dest++ = src[ x_scaled << 1 ];
110 *dest++ = src[ ( ( x_scaled >> 1 ) << 2 ) + ( ( j & 1 ) << 1 ) + 1 ];
111 x += x_step;
112 }
113 }
114 }
115
116
117 static inline guchar *
118 scale_line ( int *weights, int n_x, int n_y,
119 guchar *dest, int dest_x, guchar *dest_end,
120 guchar **src,
121 int x_init, int x_step, int src_width )
122 {
123 register int x = x_init;
124 register int i, j, x_scaled, y_index, uv_index;
125
126 while ( dest < dest_end )
127 {
128 unsigned int y = 0, uv = 0;
129 int *pixel_weights = weights + ( ( x >> ( SCALE_SHIFT - SUBSAMPLE_BITS ) ) & SUBSAMPLE_MASK ) * n_x * n_y;
130
131 x_scaled = x >> SCALE_SHIFT;
132 y_index = x_scaled << 1;
133 uv_index = ( ( x_scaled >> 1 ) << 2 ) + ( ( dest_x & 1 ) << 1 ) + 1;
134
135 for ( i = 0; i < n_y; i++ )
136 {
137 int *line_weights = pixel_weights + n_x * i;
138 guchar *q = src[ i ];
139
140 for ( j = 0; j < n_x; j ++ )
141 {
142 unsigned int ta = line_weights[ j ];
143
144 y += ta * q[ y_index ];
145 uv += ta * q[ uv_index ];
146 }
147 }
148
149 *dest++ = ( y + 0xffff ) >> SCALE_SHIFT;
150 *dest++ = ( uv + 0xffff ) >> SCALE_SHIFT;
151
152 x += x_step;
153 dest_x++;
154 }
155
156 return dest;
157 }
158
159 #ifdef USE_MMX
160 static inline guchar *
161 scale_line_22_33_mmx_stub ( int *weights, int n_x, int n_y,
162 guchar *dest, int dest_x, guchar *dest_end,
163 guchar **src,
164 int x_init, int x_step, int src_width )
165 {
166 guint32 mmx_weights[ 16 ][ 8 ];
167 int j;
168
169 for ( j = 0; j < 16; j++ )
170 {
171 mmx_weights[ j ][ 0 ] = 0x00010001 * ( weights[ 4 * j ] >> 8 );
172 mmx_weights[ j ][ 1 ] = 0x00010001 * ( weights[ 4 * j ] >> 8 );
173 mmx_weights[ j ][ 2 ] = 0x00010001 * ( weights[ 4 * j + 1 ] >> 8 );
174 mmx_weights[ j ][ 3 ] = 0x00010001 * ( weights[ 4 * j + 1 ] >> 8 );
175 mmx_weights[ j ][ 4 ] = 0x00010001 * ( weights[ 4 * j + 2 ] >> 8 );
176 mmx_weights[ j ][ 5 ] = 0x00010001 * ( weights[ 4 * j + 2 ] >> 8 );
177 mmx_weights[ j ][ 6 ] = 0x00010001 * ( weights[ 4 * j + 3 ] >> 8 );
178 mmx_weights[ j ][ 7 ] = 0x00010001 * ( weights[ 4 * j + 3 ] >> 8 );
179 }
180
181 return pixops_scale_line_22_33_mmx ( mmx_weights, dest, src[ 0 ], src[ 1 ], x_step, dest_end, x_init );
182 }
183 #endif /* USE_MMX */
184
185 static inline guchar *
186 scale_line_22_33 ( int *weights, int n_x, int n_y,
187 guchar *dest, int dest_x, guchar *dest_end,
188 guchar **src,
189 int x_init, int x_step, int src_width )
190 {
191 register int x = x_init;
192 register guchar *src0 = src[ 0 ];
193 register guchar *src1 = src[ 1 ];
194 register unsigned int p;
195 register guchar *q0, *q1;
196 register int w1, w2, w3, w4;
197 register int x_scaled, x_aligned, uv_index;
198
199 while ( dest < dest_end )
200 {
201 int *pixel_weights = weights + ( ( x >> ( SCALE_SHIFT - SUBSAMPLE_BITS ) ) & SUBSAMPLE_MASK ) * 4;
202
203 x_scaled = x >> SCALE_SHIFT;
204
205 w1 = pixel_weights[ 0 ];
206 w2 = pixel_weights[ 1 ];
207 w3 = pixel_weights[ 2 ];
208 w4 = pixel_weights[ 3 ];
209
210 /* process Y */
211 q0 = src0 + ( x_scaled << 1 );
212 q1 = src1 + ( x_scaled << 1 );
213 p = w1 * q0[ 0 ];
214 p += w2 * q0[ 2 ];
215 p += w3 * q1[ 0 ];
216 p += w4 * q1[ 2 ];
217 *dest++ = ( p + 0x8000 ) >> SCALE_SHIFT;
218
219 /* process U/V */
220 x_aligned = ( ( x_scaled >> 1 ) << 2 );
221 q0 = src0 + x_aligned;
222 q1 = src1 + x_aligned;
223 uv_index = ( ( dest_x & 1 ) << 1 ) + 1;
224 p = w1 * q0[ uv_index ];
225 p += w2 * q0[ uv_index ];
226 p += w3 * q1[ uv_index ];
227 p += w4 * q1[ uv_index ];
228 *dest++ = ( p + 0x8000 ) >> SCALE_SHIFT;
229
230 x += x_step;
231 dest_x++;
232 }
233
234 return dest;
235 }
236
237
238 static inline void
239 process_pixel ( int *weights, int n_x, int n_y,
240 guchar *dest, int dest_x, int dest_channels,
241 guchar **src, int src_channels,
242 int x_start, int src_width )
243 {
244 register unsigned int y = 0, uv = 0;
245 register int i, j;
246 int uv_index = ( ( dest_x & 1 ) << 1 ) + 1;
247
248 for ( i = 0; i < n_y; i++ )
249 {
250 int *line_weights = weights + n_x * i;
251
252 for ( j = 0; j < n_x; j++ )
253 {
254 unsigned int ta = 0xff * line_weights[ j ];
255
256 if ( x_start + j < 0 )
257 {
258 y += ta * src[ i ][ 0 ];
259 uv += ta * src[ i ][ uv_index ];
260 }
261 else if ( x_start + j < src_width )
262 {
263 y += ta * src[ i ][ ( x_start + j ) << 1 ];
264 uv += ta * src[ i ][ ( ( ( x_start + j ) >> 1 ) << 2) + uv_index ];
265 }
266 else
267 {
268 y += ta * src[ i ][ ( src_width - 1 ) << 1 ];
269 uv += ta * src[ i ][ ( ( ( src_width - 1 ) >> 1 ) << 2) + uv_index ];
270 }
271 }
272 }
273
274 *dest++ = ( y + 0xffffff ) >> 24;
275 *dest++ = ( uv + 0xffffff ) >> 24;
276 }
277
278
279 static inline void
280 correct_total ( int *weights,
281 int n_x,
282 int n_y,
283 int total,
284 double overall_alpha )
285 {
286 int correction = ( int ) ( 0.5 + 65536 * overall_alpha ) - total;
287 int remaining, c, d, i;
288
289 if ( correction != 0 )
290 {
291 remaining = correction;
292 for ( d = 1, c = correction; c != 0 && remaining != 0; d++, c = correction / d )
293 for ( i = n_x * n_y - 1; i >= 0 && c != 0 && remaining != 0; i-- )
294 if ( *( weights + i ) + c >= 0 )
295 {
296 *( weights + i ) += c;
297 remaining -= c;
298 if ( ( 0 < remaining && remaining < c ) ||
299 ( 0 > remaining && remaining > c ) )
300 c = remaining;
301 }
302 }
303 }
304
305
306 static inline int *
307 make_filter_table ( PixopsFilter *filter )
308 {
309 int i_offset, j_offset;
310 int n_x = filter->x.n;
311 int n_y = filter->y.n;
312 int *weights = g_new ( int, SUBSAMPLE * SUBSAMPLE * n_x * n_y );
313
314 for ( i_offset = 0; i_offset < SUBSAMPLE; i_offset++ )
315 for ( j_offset = 0; j_offset < SUBSAMPLE; j_offset++ )
316 {
317 double weight;
318 int *pixel_weights = weights + ( ( i_offset * SUBSAMPLE ) + j_offset ) * n_x * n_y;
319 int total = 0;
320 int i, j;
321
322 for ( i = 0; i < n_y; i++ )
323 for ( j = 0; j < n_x; j++ )
324 {
325 weight = filter->x.weights[ ( j_offset * n_x ) + j ] *
326 filter->y.weights[ ( i_offset * n_y ) + i ] *
327 filter->overall_alpha * 65536 + 0.5;
328
329 total += ( int ) weight;
330
331 *( pixel_weights + n_x * i + j ) = weight;
332 }
333
334 correct_total ( pixel_weights, n_x, n_y, total, filter->overall_alpha );
335 }
336
337 return weights;
338 }
339
340
341 static inline void
342 pixops_process ( guchar *dest_buf,
343 int render_x0,
344 int render_y0,
345 int render_x1,
346 int render_y1,
347 int dest_rowstride,
348 int dest_channels,
349 gboolean dest_has_alpha,
350 const guchar *src_buf,
351 int src_width,
352 int src_height,
353 int src_rowstride,
354 int src_channels,
355 gboolean src_has_alpha,
356 double scale_x,
357 double scale_y,
358 int check_x,
359 int check_y,
360 int check_size,
361 guint32 color1,
362 guint32 color2,
363 PixopsFilter *filter,
364 PixopsLineFunc line_func )
365 {
366 int i, j;
367 int x, y; /* X and Y position in source (fixed_point) */
368
369 guchar **line_bufs = g_new ( guchar *, filter->y.n );
370 int *filter_weights = make_filter_table ( filter );
371
372 int x_step = ( 1 << SCALE_SHIFT ) / scale_x; /* X step in source (fixed point) */
373 int y_step = ( 1 << SCALE_SHIFT ) / scale_y; /* Y step in source (fixed point) */
374
375 int check_shift = check_size ? get_check_shift ( check_size ) : 0;
376
377 int scaled_x_offset = floor ( filter->x.offset * ( 1 << SCALE_SHIFT ) );
378
379 /* Compute the index where we run off the end of the source buffer. The furthest
380 * source pixel we access at index i is:
381 *
382 * ((render_x0 + i) * x_step + scaled_x_offset) >> SCALE_SHIFT + filter->x.n - 1
383 *
384 * So, run_end_index is the smallest i for which this pixel is src_width, i.e, for which:
385 *
386 * (i + render_x0) * x_step >= ((src_width - filter->x.n + 1) << SCALE_SHIFT) - scaled_x_offset
387 *
388 */
389 #define MYDIV(a,b) ((a) > 0 ? (a) / (b) : ((a) - (b) + 1) / (b)) /* Division so that -1/5 = -1 */
390
391 int run_end_x = ( ( ( src_width - filter->x.n + 1 ) << SCALE_SHIFT ) - scaled_x_offset );
392 int run_end_index = MYDIV ( run_end_x + x_step - 1, x_step ) - render_x0;
393 run_end_index = MIN ( run_end_index, render_x1 - render_x0 );
394
395 y = render_y0 * y_step + floor ( filter->y.offset * ( 1 << SCALE_SHIFT ) );
396 for ( i = 0; i < ( render_y1 - render_y0 ); i++ )
397 {
398 int dest_x;
399 int y_start = y >> SCALE_SHIFT;
400 int x_start;
401 int *run_weights = filter_weights +
402 ( ( y >> ( SCALE_SHIFT - SUBSAMPLE_BITS ) ) & SUBSAMPLE_MASK ) *
403 filter->x.n * filter->y.n * SUBSAMPLE;
404 guchar *new_outbuf;
405 guint32 tcolor1, tcolor2;
406
407 guchar *outbuf = dest_buf + dest_rowstride * i;
408 guchar *outbuf_end = outbuf + dest_channels * ( render_x1 - render_x0 );
409
410 if ( ( ( i + check_y ) >> check_shift ) & 1 )
411 {
412 tcolor1 = color2;
413 tcolor2 = color1;
414 }
415 else
416 {
417 tcolor1 = color1;
418 tcolor2 = color2;
419 }
420
421 for ( j = 0; j < filter->y.n; j++ )
422 {
423 if ( y_start < 0 )
424 line_bufs[ j ] = ( guchar * ) src_buf;
425 else if ( y_start < src_height )
426 line_bufs[ j ] = ( guchar * ) src_buf + src_rowstride * y_start;
427 else
428 line_bufs[ j ] = ( guchar * ) src_buf + src_rowstride * ( src_height - 1 );
429
430 y_start++;
431 }
432
433 dest_x = check_x;
434 x = render_x0 * x_step + scaled_x_offset;
435 x_start = x >> SCALE_SHIFT;
436
437 while ( x_start < 0 && outbuf < outbuf_end )
438 {
439 process_pixel ( run_weights + ( ( x >> ( SCALE_SHIFT - SUBSAMPLE_BITS ) ) & SUBSAMPLE_MASK ) * ( filter->x.n * filter->y.n ),
440 filter->x.n, filter->y.n,
441 outbuf, dest_x, dest_channels,
442 line_bufs, src_channels,
443 x >> SCALE_SHIFT, src_width );
444
445 x += x_step;
446 x_start = x >> SCALE_SHIFT;
447 dest_x++;
448 outbuf += dest_channels;
449 }
450
451 new_outbuf = ( *line_func ) ( run_weights, filter->x.n, filter->y.n,
452 outbuf, dest_x,
453 dest_buf + dest_rowstride * i + run_end_index * dest_channels,
454 line_bufs,
455 x, x_step, src_width );
456
457 dest_x += ( new_outbuf - outbuf ) / dest_channels;
458
459 x = ( dest_x - check_x + render_x0 ) * x_step + scaled_x_offset;
460 outbuf = new_outbuf;
461
462 while ( outbuf < outbuf_end )
463 {
464 process_pixel ( run_weights + ( ( x >> ( SCALE_SHIFT - SUBSAMPLE_BITS ) ) & SUBSAMPLE_MASK ) * ( filter->x.n * filter->y.n ),
465 filter->x.n, filter->y.n,
466 outbuf, dest_x, dest_channels,
467 line_bufs, src_channels,
468 x >> SCALE_SHIFT, src_width );
469
470 x += x_step;
471 dest_x++;
472 outbuf += dest_channels;
473 }
474
475 y += y_step;
476 }
477
478 g_free ( line_bufs );
479 g_free ( filter_weights );
480 }
481
482
483 /* Compute weights for reconstruction by replication followed by
484 * sampling with a box filter
485 */
486 static inline void
487 tile_make_weights ( PixopsFilterDimension *dim,
488 double scale )
489 {
490 int n = ceil ( 1 / scale + 1 );
491 double *pixel_weights = g_new ( double, SUBSAMPLE * n );
492 int offset;
493 int i;
494
495 dim->n = n;
496 dim->offset = 0;
497 dim->weights = pixel_weights;
498
499 for ( offset = 0; offset < SUBSAMPLE; offset++ )
500 {
501 double x = ( double ) offset / SUBSAMPLE;
502 double a = x + 1 / scale;
503
504 for ( i = 0; i < n; i++ )
505 {
506 if ( i < x )
507 {
508 if ( i + 1 > x )
509 * ( pixel_weights++ ) = ( MIN ( i + 1, a ) - x ) * scale;
510 else
511 *( pixel_weights++ ) = 0;
512 }
513 else
514 {
515 if ( a > i )
516 * ( pixel_weights++ ) = ( MIN ( i + 1, a ) - i ) * scale;
517 else
518 *( pixel_weights++ ) = 0;
519 }
520 }
521 }
522 }
523
524 /* Compute weights for a filter that, for minification
525 * is the same as 'tiles', and for magnification, is bilinear
526 * reconstruction followed by a sampling with a delta function.
527 */
528 static inline void
529 bilinear_magnify_make_weights ( PixopsFilterDimension *dim,
530 double scale )
531 {
532 double * pixel_weights;
533 int n;
534 int offset;
535 int i;
536
537 if ( scale > 1.0 ) /* Linear */
538 {
539 n = 2;
540 dim->offset = 0.5 * ( 1 / scale - 1 );
541 }
542 else /* Tile */
543 {
544 n = ceil ( 1.0 + 1.0 / scale );
545 dim->offset = 0.0;
546 }
547
548 dim->n = n;
549 dim->weights = g_new ( double, SUBSAMPLE * n );
550
551 pixel_weights = dim->weights;
552
553 for ( offset = 0; offset < SUBSAMPLE; offset++ )
554 {
555 double x = ( double ) offset / SUBSAMPLE;
556
557 if ( scale > 1.0 ) /* Linear */
558 {
559 for ( i = 0; i < n; i++ )
560 *( pixel_weights++ ) = ( ( ( i == 0 ) ? ( 1 - x ) : x ) / scale ) * scale;
561 }
562 else /* Tile */
563 {
564 double a = x + 1 / scale;
565
566 /* x
567 * ---------|--.-|----|--.-|------- SRC
568 * ------------|---------|--------- DEST
569 */
570 for ( i = 0; i < n; i++ )
571 {
572 if ( i < x )
573 {
574 if ( i + 1 > x )
575 * ( pixel_weights++ ) = ( MIN ( i + 1, a ) - x ) * scale;
576 else
577 *( pixel_weights++ ) = 0;
578 }
579 else
580 {
581 if ( a > i )
582 * ( pixel_weights++ ) = ( MIN ( i + 1, a ) - i ) * scale;
583 else
584 *( pixel_weights++ ) = 0;
585 }
586 }
587 }
588 }
589 }
590
591 /* Computes the integral from b0 to b1 of
592 *
593 * f(x) = x; 0 <= x < 1
594 * f(x) = 0; otherwise
595 *
596 * We combine two of these to compute the convolution of
597 * a box filter with a triangular spike.
598 */
599 static inline double
600 linear_box_half ( double b0, double b1 )
601 {
602 double a0, a1;
603 double x0, x1;
604
605 a0 = 0.;
606 a1 = 1.;
607
608 if ( a0 < b0 )
609 {
610 if ( a1 > b0 )
611 {
612 x0 = b0;
613 x1 = MIN ( a1, b1 );
614 }
615 else
616 return 0;
617 }
618 else
619 {
620 if ( b1 > a0 )
621 {
622 x0 = a0;
623 x1 = MIN ( a1, b1 );
624 }
625 else
626 return 0;
627 }
628
629 return 0.5 * ( x1 * x1 - x0 * x0 );
630 }
631
632 /* Compute weights for reconstructing with bilinear
633 * interpolation, then sampling with a box filter
634 */
635 static inline void
636 bilinear_box_make_weights ( PixopsFilterDimension *dim,
637 double scale )
638 {
639 int n = ceil ( 1 / scale + 2.0 );
640 double *pixel_weights = g_new ( double, SUBSAMPLE * n );
641 double w;
642 int offset, i;
643
644 dim->offset = -1.0;
645 dim->n = n;
646 dim->weights = pixel_weights;
647
648 for ( offset = 0 ; offset < SUBSAMPLE; offset++ )
649 {
650 double x = ( double ) offset / SUBSAMPLE;
651 double a = x + 1 / scale;
652
653 for ( i = 0; i < n; i++ )
654 {
655 w = linear_box_half ( 0.5 + i - a, 0.5 + i - x );
656 w += linear_box_half ( 1.5 + x - i, 1.5 + a - i );
657
658 *( pixel_weights++ ) = w * scale;
659 }
660 }
661 }
662
663
664 static inline void
665 make_weights ( PixopsFilter *filter,
666 PixopsInterpType interp_type,
667 double scale_x,
668 double scale_y )
669 {
670 switch ( interp_type )
671 {
672 case PIXOPS_INTERP_NEAREST:
673 g_assert_not_reached ();
674 break;
675
676 case PIXOPS_INTERP_TILES:
677 tile_make_weights ( &filter->x, scale_x );
678 tile_make_weights ( &filter->y, scale_y );
679 break;
680
681 case PIXOPS_INTERP_BILINEAR:
682 bilinear_magnify_make_weights ( &filter->x, scale_x );
683 bilinear_magnify_make_weights ( &filter->y, scale_y );
684 break;
685
686 case PIXOPS_INTERP_HYPER:
687 bilinear_box_make_weights ( &filter->x, scale_x );
688 bilinear_box_make_weights ( &filter->y, scale_y );
689 break;
690 }
691 }
692
693
694 void
695 yuv422_scale ( guchar *dest_buf,
696 int render_x0,
697 int render_y0,
698 int render_x1,
699 int render_y1,
700 int dest_rowstride,
701 int dest_channels,
702 gboolean dest_has_alpha,
703 const guchar *src_buf,
704 int src_width,
705 int src_height,
706 int src_rowstride,
707 int src_channels,
708 gboolean src_has_alpha,
709 double scale_x,
710 double scale_y,
711 PixopsInterpType interp_type )
712 {
713 PixopsFilter filter;
714 PixopsLineFunc line_func;
715
716 #ifdef USE_MMX
717 gboolean found_mmx = pixops_have_mmx();
718 #endif
719
720 //g_return_if_fail ( !( dest_channels == 3 && dest_has_alpha ) );
721 //g_return_if_fail ( !( src_channels == 3 && src_has_alpha ) );
722 //g_return_if_fail ( !( src_has_alpha && !dest_has_alpha ) );
723
724 if ( scale_x == 0 || scale_y == 0 )
725 return ;
726
727 if ( interp_type == PIXOPS_INTERP_NEAREST )
728 {
729 pixops_scale_nearest ( dest_buf, render_x0, render_y0, render_x1, render_y1,
730 dest_rowstride,
731 src_buf, src_width, src_height, src_rowstride,
732 scale_x, scale_y );
733 return;
734 }
735
736 filter.overall_alpha = 1.0;
737 make_weights ( &filter, interp_type, scale_x, scale_y );
738
739 if ( filter.x.n == 2 && filter.y.n == 2 )
740 {
741 #ifdef USE_MMX
742 if ( 0 && found_mmx )
743 line_func = scale_line_22_33_mmx_stub;
744 else
745 #endif
746
747 line_func = scale_line_22_33;
748 }
749 else
750 line_func = scale_line;
751
752 pixops_process ( dest_buf, render_x0, render_y0, render_x1, render_y1,
753 dest_rowstride, dest_channels, dest_has_alpha,
754 src_buf, src_width, src_height, src_rowstride, src_channels,
755 src_has_alpha, scale_x, scale_y, 0, 0, 0, 0, 0,
756 &filter, line_func );
757
758 g_free ( filter.x.weights );
759 g_free ( filter.y.weights );
760 }
761