mmx version of non-nearest, 2x2 rescaling
[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_yuv_mmx ( guint32 weights[ 16 ][ 8 ], guchar *p, guchar *q1, guchar *q2, int x_step, guchar *p_stop, int x_init, int destx );
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_yuv_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_yuv_mmx ( mmx_weights, dest, src[ 0 ], src[ 1 ], x_step, dest_end, x_init, dest_x );
182 }
183 #endif /* USE_MMX */
184
185 static inline guchar *
186 scale_line_22_yuv ( 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 uv_index = ( ( dest_x & 1 ) << 1 ) + 1;
222
223 q0 = src0 + x_aligned;
224 q1 = src1 + x_aligned;
225 p = w1 * q0[ uv_index ];
226 p += w3 * q1[ uv_index ];
227 p += w2 * q0[ uv_index ];
228 p += w4 * q1[ uv_index ];
229
230 x += x_step;
231 dest_x ++;
232
233 *dest++ = ( p + 0x8000 ) >> SCALE_SHIFT;
234 }
235
236 return dest;
237 }
238
239
240 static inline void
241 process_pixel ( int *weights, int n_x, int n_y,
242 guchar *dest, int dest_x, int dest_channels,
243 guchar **src, int src_channels,
244 int x_start, int src_width )
245 {
246 register unsigned int y = 0, uv = 0;
247 register int i, j;
248 int uv_index = ( ( dest_x & 1 ) << 1 ) + 1;
249
250 for ( i = 0; i < n_y; i++ )
251 {
252 int *line_weights = weights + n_x * i;
253
254 for ( j = 0; j < n_x; j++ )
255 {
256 unsigned int ta = 0xff * line_weights[ j ];
257
258 if ( x_start + j < 0 )
259 {
260 y += ta * src[ i ][ 0 ];
261 uv += ta * src[ i ][ uv_index ];
262 }
263 else if ( x_start + j < src_width )
264 {
265 y += ta * src[ i ][ ( x_start + j ) << 1 ];
266 uv += ta * src[ i ][ ( ( ( x_start + j ) >> 1 ) << 2) + uv_index ];
267 }
268 else
269 {
270 y += ta * src[ i ][ ( src_width - 1 ) << 1 ];
271 uv += ta * src[ i ][ ( ( ( src_width - 1 ) >> 1 ) << 2) + uv_index ];
272 }
273 }
274 }
275
276 *dest++ = ( y + 0xffffff ) >> 24;
277 *dest++ = ( uv + 0xffffff ) >> 24;
278 }
279
280
281 static inline void
282 correct_total ( int *weights,
283 int n_x,
284 int n_y,
285 int total,
286 double overall_alpha )
287 {
288 int correction = ( int ) ( 0.5 + 65536 * overall_alpha ) - total;
289 int remaining, c, d, i;
290
291 if ( correction != 0 )
292 {
293 remaining = correction;
294 for ( d = 1, c = correction; c != 0 && remaining != 0; d++, c = correction / d )
295 for ( i = n_x * n_y - 1; i >= 0 && c != 0 && remaining != 0; i-- )
296 if ( *( weights + i ) + c >= 0 )
297 {
298 *( weights + i ) += c;
299 remaining -= c;
300 if ( ( 0 < remaining && remaining < c ) ||
301 ( 0 > remaining && remaining > c ) )
302 c = remaining;
303 }
304 }
305 }
306
307
308 static inline int *
309 make_filter_table ( PixopsFilter *filter )
310 {
311 int i_offset, j_offset;
312 int n_x = filter->x.n;
313 int n_y = filter->y.n;
314 int *weights = g_new ( int, SUBSAMPLE * SUBSAMPLE * n_x * n_y );
315
316 for ( i_offset = 0; i_offset < SUBSAMPLE; i_offset++ )
317 for ( j_offset = 0; j_offset < SUBSAMPLE; j_offset++ )
318 {
319 double weight;
320 int *pixel_weights = weights + ( ( i_offset * SUBSAMPLE ) + j_offset ) * n_x * n_y;
321 int total = 0;
322 int i, j;
323
324 for ( i = 0; i < n_y; i++ )
325 for ( j = 0; j < n_x; j++ )
326 {
327 weight = filter->x.weights[ ( j_offset * n_x ) + j ] *
328 filter->y.weights[ ( i_offset * n_y ) + i ] *
329 filter->overall_alpha * 65536 + 0.5;
330
331 total += ( int ) weight;
332
333 *( pixel_weights + n_x * i + j ) = weight;
334 }
335
336 correct_total ( pixel_weights, n_x, n_y, total, filter->overall_alpha );
337 }
338
339 return weights;
340 }
341
342
343 static inline void
344 pixops_process ( guchar *dest_buf,
345 int render_x0,
346 int render_y0,
347 int render_x1,
348 int render_y1,
349 int dest_rowstride,
350 int dest_channels,
351 gboolean dest_has_alpha,
352 const guchar *src_buf,
353 int src_width,
354 int src_height,
355 int src_rowstride,
356 int src_channels,
357 gboolean src_has_alpha,
358 double scale_x,
359 double scale_y,
360 int check_x,
361 int check_y,
362 int check_size,
363 guint32 color1,
364 guint32 color2,
365 PixopsFilter *filter,
366 PixopsLineFunc line_func )
367 {
368 int i, j;
369 int x, y; /* X and Y position in source (fixed_point) */
370
371 guchar **line_bufs = g_new ( guchar *, filter->y.n );
372 int *filter_weights = make_filter_table ( filter );
373
374 int x_step = ( 1 << SCALE_SHIFT ) / scale_x; /* X step in source (fixed point) */
375 int y_step = ( 1 << SCALE_SHIFT ) / scale_y; /* Y step in source (fixed point) */
376
377 int check_shift = check_size ? get_check_shift ( check_size ) : 0;
378
379 int scaled_x_offset = floor ( filter->x.offset * ( 1 << SCALE_SHIFT ) );
380
381 /* Compute the index where we run off the end of the source buffer. The furthest
382 * source pixel we access at index i is:
383 *
384 * ((render_x0 + i) * x_step + scaled_x_offset) >> SCALE_SHIFT + filter->x.n - 1
385 *
386 * So, run_end_index is the smallest i for which this pixel is src_width, i.e, for which:
387 *
388 * (i + render_x0) * x_step >= ((src_width - filter->x.n + 1) << SCALE_SHIFT) - scaled_x_offset
389 *
390 */
391 #define MYDIV(a,b) ((a) > 0 ? (a) / (b) : ((a) - (b) + 1) / (b)) /* Division so that -1/5 = -1 */
392
393 int run_end_x = ( ( ( src_width - filter->x.n + 1 ) << SCALE_SHIFT ) - scaled_x_offset );
394 int run_end_index = MYDIV ( run_end_x + x_step - 1, x_step ) - render_x0;
395 run_end_index = MIN ( run_end_index, render_x1 - render_x0 );
396
397 y = render_y0 * y_step + floor ( filter->y.offset * ( 1 << SCALE_SHIFT ) );
398 for ( i = 0; i < ( render_y1 - render_y0 ); i++ )
399 {
400 int dest_x;
401 int y_start = y >> SCALE_SHIFT;
402 int x_start;
403 int *run_weights = filter_weights +
404 ( ( y >> ( SCALE_SHIFT - SUBSAMPLE_BITS ) ) & SUBSAMPLE_MASK ) *
405 filter->x.n * filter->y.n * SUBSAMPLE;
406 guchar *new_outbuf;
407 guint32 tcolor1, tcolor2;
408
409 guchar *outbuf = dest_buf + dest_rowstride * i;
410 guchar *outbuf_end = outbuf + dest_channels * ( render_x1 - render_x0 );
411
412 if ( ( ( i + check_y ) >> check_shift ) & 1 )
413 {
414 tcolor1 = color2;
415 tcolor2 = color1;
416 }
417 else
418 {
419 tcolor1 = color1;
420 tcolor2 = color2;
421 }
422
423 for ( j = 0; j < filter->y.n; j++ )
424 {
425 if ( y_start < 0 )
426 line_bufs[ j ] = ( guchar * ) src_buf;
427 else if ( y_start < src_height )
428 line_bufs[ j ] = ( guchar * ) src_buf + src_rowstride * y_start;
429 else
430 line_bufs[ j ] = ( guchar * ) src_buf + src_rowstride * ( src_height - 1 );
431
432 y_start++;
433 }
434
435 dest_x = check_x;
436 x = render_x0 * x_step + scaled_x_offset;
437 x_start = x >> SCALE_SHIFT;
438
439 while ( x_start < 0 && outbuf < outbuf_end )
440 {
441 process_pixel ( run_weights + ( ( x >> ( SCALE_SHIFT - SUBSAMPLE_BITS ) ) & SUBSAMPLE_MASK ) * ( filter->x.n * filter->y.n ),
442 filter->x.n, filter->y.n,
443 outbuf, dest_x, dest_channels,
444 line_bufs, src_channels,
445 x >> SCALE_SHIFT, src_width );
446
447 x += x_step;
448 x_start = x >> SCALE_SHIFT;
449 dest_x++;
450 outbuf += dest_channels;
451 }
452
453 new_outbuf = ( *line_func ) ( run_weights, filter->x.n, filter->y.n,
454 outbuf, dest_x,
455 dest_buf + dest_rowstride * i + run_end_index * dest_channels,
456 line_bufs,
457 x, x_step, src_width );
458
459 dest_x += ( new_outbuf - outbuf ) / dest_channels;
460
461 x = ( dest_x - check_x + render_x0 ) * x_step + scaled_x_offset;
462 outbuf = new_outbuf;
463
464 while ( outbuf < outbuf_end )
465 {
466 process_pixel ( run_weights + ( ( x >> ( SCALE_SHIFT - SUBSAMPLE_BITS ) ) & SUBSAMPLE_MASK ) * ( filter->x.n * filter->y.n ),
467 filter->x.n, filter->y.n,
468 outbuf, dest_x, dest_channels,
469 line_bufs, src_channels,
470 x >> SCALE_SHIFT, src_width );
471
472 x += x_step;
473 dest_x++;
474 outbuf += dest_channels;
475 }
476
477 y += y_step;
478 }
479
480 g_free ( line_bufs );
481 g_free ( filter_weights );
482 }
483
484
485 /* Compute weights for reconstruction by replication followed by
486 * sampling with a box filter
487 */
488 static inline void
489 tile_make_weights ( PixopsFilterDimension *dim,
490 double scale )
491 {
492 int n = ceil ( 1 / scale + 1 );
493 double *pixel_weights = g_new ( double, SUBSAMPLE * n );
494 int offset;
495 int i;
496
497 dim->n = n;
498 dim->offset = 0;
499 dim->weights = pixel_weights;
500
501 for ( offset = 0; offset < SUBSAMPLE; offset++ )
502 {
503 double x = ( double ) offset / SUBSAMPLE;
504 double a = x + 1 / scale;
505
506 for ( i = 0; i < n; i++ )
507 {
508 if ( i < x )
509 {
510 if ( i + 1 > x )
511 * ( pixel_weights++ ) = ( MIN ( i + 1, a ) - x ) * scale;
512 else
513 *( pixel_weights++ ) = 0;
514 }
515 else
516 {
517 if ( a > i )
518 * ( pixel_weights++ ) = ( MIN ( i + 1, a ) - i ) * scale;
519 else
520 *( pixel_weights++ ) = 0;
521 }
522 }
523 }
524 }
525
526 /* Compute weights for a filter that, for minification
527 * is the same as 'tiles', and for magnification, is bilinear
528 * reconstruction followed by a sampling with a delta function.
529 */
530 static inline void
531 bilinear_magnify_make_weights ( PixopsFilterDimension *dim,
532 double scale )
533 {
534 double * pixel_weights;
535 int n;
536 int offset;
537 int i;
538
539 if ( scale > 1.0 ) /* Linear */
540 {
541 n = 2;
542 dim->offset = 0.5 * ( 1 / scale - 1 );
543 }
544 else /* Tile */
545 {
546 n = ceil ( 1.0 + 1.0 / scale );
547 dim->offset = 0.0;
548 }
549
550 dim->n = n;
551 dim->weights = g_new ( double, SUBSAMPLE * n );
552
553 pixel_weights = dim->weights;
554
555 for ( offset = 0; offset < SUBSAMPLE; offset++ )
556 {
557 double x = ( double ) offset / SUBSAMPLE;
558
559 if ( scale > 1.0 ) /* Linear */
560 {
561 for ( i = 0; i < n; i++ )
562 *( pixel_weights++ ) = ( ( ( i == 0 ) ? ( 1 - x ) : x ) / scale ) * scale;
563 }
564 else /* Tile */
565 {
566 double a = x + 1 / scale;
567
568 /* x
569 * ---------|--.-|----|--.-|------- SRC
570 * ------------|---------|--------- DEST
571 */
572 for ( i = 0; i < n; i++ )
573 {
574 if ( i < x )
575 {
576 if ( i + 1 > x )
577 * ( pixel_weights++ ) = ( MIN ( i + 1, a ) - x ) * scale;
578 else
579 *( pixel_weights++ ) = 0;
580 }
581 else
582 {
583 if ( a > i )
584 * ( pixel_weights++ ) = ( MIN ( i + 1, a ) - i ) * scale;
585 else
586 *( pixel_weights++ ) = 0;
587 }
588 }
589 }
590 }
591 }
592
593 /* Computes the integral from b0 to b1 of
594 *
595 * f(x) = x; 0 <= x < 1
596 * f(x) = 0; otherwise
597 *
598 * We combine two of these to compute the convolution of
599 * a box filter with a triangular spike.
600 */
601 static inline double
602 linear_box_half ( double b0, double b1 )
603 {
604 double a0, a1;
605 double x0, x1;
606
607 a0 = 0.;
608 a1 = 1.;
609
610 if ( a0 < b0 )
611 {
612 if ( a1 > b0 )
613 {
614 x0 = b0;
615 x1 = MIN ( a1, b1 );
616 }
617 else
618 return 0;
619 }
620 else
621 {
622 if ( b1 > a0 )
623 {
624 x0 = a0;
625 x1 = MIN ( a1, b1 );
626 }
627 else
628 return 0;
629 }
630
631 return 0.5 * ( x1 * x1 - x0 * x0 );
632 }
633
634 /* Compute weights for reconstructing with bilinear
635 * interpolation, then sampling with a box filter
636 */
637 static inline void
638 bilinear_box_make_weights ( PixopsFilterDimension *dim,
639 double scale )
640 {
641 int n = ceil ( 1 / scale + 2.0 );
642 double *pixel_weights = g_new ( double, SUBSAMPLE * n );
643 double w;
644 int offset, i;
645
646 dim->offset = -1.0;
647 dim->n = n;
648 dim->weights = pixel_weights;
649
650 for ( offset = 0 ; offset < SUBSAMPLE; offset++ )
651 {
652 double x = ( double ) offset / SUBSAMPLE;
653 double a = x + 1 / scale;
654
655 for ( i = 0; i < n; i++ )
656 {
657 w = linear_box_half ( 0.5 + i - a, 0.5 + i - x );
658 w += linear_box_half ( 1.5 + x - i, 1.5 + a - i );
659
660 *( pixel_weights++ ) = w * scale;
661 }
662 }
663 }
664
665
666 static inline void
667 make_weights ( PixopsFilter *filter,
668 PixopsInterpType interp_type,
669 double scale_x,
670 double scale_y )
671 {
672 switch ( interp_type )
673 {
674 case PIXOPS_INTERP_NEAREST:
675 g_assert_not_reached ();
676 break;
677
678 case PIXOPS_INTERP_TILES:
679 tile_make_weights ( &filter->x, scale_x );
680 tile_make_weights ( &filter->y, scale_y );
681 break;
682
683 case PIXOPS_INTERP_BILINEAR:
684 bilinear_magnify_make_weights ( &filter->x, scale_x );
685 bilinear_magnify_make_weights ( &filter->y, scale_y );
686 break;
687
688 case PIXOPS_INTERP_HYPER:
689 bilinear_box_make_weights ( &filter->x, scale_x );
690 bilinear_box_make_weights ( &filter->y, scale_y );
691 break;
692 }
693 }
694
695
696 void
697 yuv422_scale ( guchar *dest_buf,
698 int render_x0,
699 int render_y0,
700 int render_x1,
701 int render_y1,
702 int dest_rowstride,
703 int dest_channels,
704 gboolean dest_has_alpha,
705 const guchar *src_buf,
706 int src_width,
707 int src_height,
708 int src_rowstride,
709 int src_channels,
710 gboolean src_has_alpha,
711 double scale_x,
712 double scale_y,
713 PixopsInterpType interp_type )
714 {
715 PixopsFilter filter;
716 PixopsLineFunc line_func;
717
718 #ifdef USE_MMX
719 gboolean found_mmx = pixops_have_mmx();
720 #endif
721
722 //g_return_if_fail ( !( dest_channels == 3 && dest_has_alpha ) );
723 //g_return_if_fail ( !( src_channels == 3 && src_has_alpha ) );
724 //g_return_if_fail ( !( src_has_alpha && !dest_has_alpha ) );
725
726 if ( scale_x == 0 || scale_y == 0 )
727 return ;
728
729 if ( interp_type == PIXOPS_INTERP_NEAREST )
730 {
731 pixops_scale_nearest ( dest_buf, render_x0, render_y0, render_x1, render_y1,
732 dest_rowstride,
733 src_buf, src_width, src_height, src_rowstride,
734 scale_x, scale_y );
735 return;
736 }
737
738 filter.overall_alpha = 1.0;
739 make_weights ( &filter, interp_type, scale_x, scale_y );
740
741 if ( filter.x.n == 2 && filter.y.n == 2 )
742 {
743 #ifdef USE_MMX
744 if ( found_mmx )
745 {
746 //fprintf( stderr, "rescale: using mmx\n" );
747 line_func = scale_line_22_yuv_mmx_stub;
748 }
749 else
750 #endif
751
752 line_func = scale_line_22_yuv;
753 }
754 else
755 line_func = scale_line;
756
757 pixops_process ( dest_buf, render_x0, render_y0, render_x1, render_y1,
758 dest_rowstride, dest_channels, dest_has_alpha,
759 src_buf, src_width, src_height, src_rowstride, src_channels,
760 src_has_alpha, scale_x, scale_y, 0, 0, 0, 0, 0,
761 &filter, line_func );
762
763 g_free ( filter.x.weights );
764 g_free ( filter.y.weights );
765 }
766