libmpcodecs/pullup.c

   1 /*
   2  * This file is part of MPlayer.
   3  *
   4  * MPlayer is free software; you can redistribute it and/or modify
   5  * it under the terms of the GNU General Public License as published by
   6  * the Free Software Foundation; either version 2 of the License, or
   7  * (at your option) any later version.
   8  *
   9  * MPlayer is distributed in the hope that it will be useful,
  10  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  12  * GNU General Public License for more details.
  13  *
  14  * You should have received a copy of the GNU General Public License along
  15  * with MPlayer; if not, write to the Free Software Foundation, Inc.,
  16  * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  17  */
  18
  19 #include <stdio.h>
  20 #include <stdlib.h>
  21 #include <string.h>
  22 #include "config.h"
  23 #include "pullup.h"
  24 #include "cpudetect.h"
  25 #include "mpcommon.h"
  26
  27
  28
  29 #if ARCH_X86
  30 #if HAVE_MMX
  31 static int diff_y_mmx(unsigned char *a, unsigned char *b, int s)
  32 {
  33         int ret;
  34         __asm__ volatile (
  35                 "movl $4, %%ecx \n\t"
  36                 "pxor %%mm4, %%mm4 \n\t"
  37                 "pxor %%mm7, %%mm7 \n\t"
  38
  39                 "1: \n\t"
  40
  41                 "movq (%%"REG_S"), %%mm0 \n\t"
  42                 "movq (%%"REG_S"), %%mm2 \n\t"
  43                 "add  %%"REG_a", %%"REG_S" \n\t"
  44                 "movq (%%"REG_D"), %%mm1 \n\t"
  45                 "add  %%"REG_a", %%"REG_D" \n\t"
  46                 "psubusb %%mm1, %%mm2 \n\t"
  47                 "psubusb %%mm0, %%mm1 \n\t"
  48                 "movq %%mm2, %%mm0 \n\t"
  49                 "movq %%mm1, %%mm3 \n\t"
  50                 "punpcklbw %%mm7, %%mm0 \n\t"
  51                 "punpcklbw %%mm7, %%mm1 \n\t"
  52                 "punpckhbw %%mm7, %%mm2 \n\t"
  53                 "punpckhbw %%mm7, %%mm3 \n\t"
  54                 "paddw %%mm0, %%mm4 \n\t"
  55                 "paddw %%mm1, %%mm4 \n\t"
  56                 "paddw %%mm2, %%mm4 \n\t"
  57                 "paddw %%mm3, %%mm4 \n\t"
  58
  59                 "decl %%ecx \n\t"
  60                 "jnz 1b \n\t"
  61
  62                 "movq %%mm4, %%mm3 \n\t"
  63                 "punpcklwd %%mm7, %%mm4 \n\t"
  64                 "punpckhwd %%mm7, %%mm3 \n\t"
  65                 "paddd %%mm4, %%mm3 \n\t"
  66                 "movd %%mm3, %%eax \n\t"
  67                 "psrlq $32, %%mm3 \n\t"
  68                 "movd %%mm3, %%edx \n\t"
  69                 "addl %%edx, %%eax \n\t"
  70                 "emms \n\t"
  71                 : "=a" (ret)
  72                 : "S" (a), "D" (b), "a" (s)
  73                 : "%ecx", "%edx"
  74                 );
  75         return ret;
  76 }
  77
  78 static int licomb_y_mmx(unsigned char *a, unsigned char *b, int s)
  79 {
  80         int ret;
  81         __asm__ volatile (
  82                 "movl $4, %%ecx \n\t"
  83                 "pxor %%mm6, %%mm6 \n\t"
  84                 "pxor %%mm7, %%mm7 \n\t"
  85                 "sub  %%"REG_a", %%"REG_D" \n\t"
  86
  87                 "2: \n\t"
  88
  89                 "movq (%%"REG_D"), %%mm0 \n\t"
  90                 "movq (%%"REG_D"), %%mm1 \n\t"
  91                 "punpcklbw %%mm7, %%mm0 \n\t"
  92                 "movq (%%"REG_D",%%"REG_a"), %%mm2 \n\t"
  93                 "punpcklbw %%mm7, %%mm1 \n\t"
  94                 "punpcklbw %%mm7, %%mm2 \n\t"
  95                 "paddw %%mm0, %%mm0 \n\t"
  96                 "paddw %%mm2, %%mm1 \n\t"
  97                 "movq %%mm0, %%mm2 \n\t"
  98                 "psubusw %%mm1, %%mm0 \n\t"
  99                 "psubusw %%mm2, %%mm1 \n\t"
 100                 "paddw %%mm0, %%mm6 \n\t"
 101                 "paddw %%mm1, %%mm6 \n\t"
 102
 103                 "movq (%%"REG_S"), %%mm0 \n\t"
 104                 "movq (%%"REG_D"), %%mm1 \n\t"
 105                 "punpckhbw %%mm7, %%mm0 \n\t"
 106                 "movq (%%"REG_D",%%"REG_a"), %%mm2 \n\t"
 107                 "punpckhbw %%mm7, %%mm1 \n\t"
 108                 "punpckhbw %%mm7, %%mm2 \n\t"
 109                 "paddw %%mm0, %%mm0 \n\t"
 110                 "paddw %%mm2, %%mm1 \n\t"
 111                 "movq %%mm0, %%mm2 \n\t"
 112                 "psubusw %%mm1, %%mm0 \n\t"
 113                 "psubusw %%mm2, %%mm1 \n\t"
 114                 "paddw %%mm0, %%mm6 \n\t"
 115                 "paddw %%mm1, %%mm6 \n\t"
 116
 117                 "movq (%%"REG_D",%%"REG_a"), %%mm0 \n\t"
 118                 "movq (%%"REG_S"), %%mm1 \n\t"
 119                 "punpcklbw %%mm7, %%mm0 \n\t"
 120                 "movq (%%"REG_S",%%"REG_a"), %%mm2 \n\t"
 121                 "punpcklbw %%mm7, %%mm1 \n\t"
 122                 "punpcklbw %%mm7, %%mm2 \n\t"
 123                 "paddw %%mm0, %%mm0 \n\t"
 124                 "paddw %%mm2, %%mm1 \n\t"
 125                 "movq %%mm0, %%mm2 \n\t"
 126                 "psubusw %%mm1, %%mm0 \n\t"
 127                 "psubusw %%mm2, %%mm1 \n\t"
 128                 "paddw %%mm0, %%mm6 \n\t"
 129                 "paddw %%mm1, %%mm6 \n\t"
 130
 131                 "movq (%%"REG_D",%%"REG_a"), %%mm0 \n\t"
 132                 "movq (%%"REG_S"), %%mm1 \n\t"
 133                 "punpckhbw %%mm7, %%mm0 \n\t"
 134                 "movq (%%"REG_S",%%"REG_a"), %%mm2 \n\t"
 135                 "punpckhbw %%mm7, %%mm1 \n\t"
 136                 "punpckhbw %%mm7, %%mm2 \n\t"
 137                 "paddw %%mm0, %%mm0 \n\t"
 138                 "paddw %%mm2, %%mm1 \n\t"
 139                 "movq %%mm0, %%mm2 \n\t"
 140                 "psubusw %%mm1, %%mm0 \n\t"
 141                 "psubusw %%mm2, %%mm1 \n\t"
 142                 "paddw %%mm0, %%mm6 \n\t"
 143                 "paddw %%mm1, %%mm6 \n\t"
 144
 145                 "add  %%"REG_a", %%"REG_S" \n\t"
 146                 "add  %%"REG_a", %%"REG_D" \n\t"
 147                 "decl %%ecx \n\t"
 148                 "jnz 2b \n\t"
 149
 150                 "movq %%mm6, %%mm5 \n\t"
 151                 "punpcklwd %%mm7, %%mm6 \n\t"
 152                 "punpckhwd %%mm7, %%mm5 \n\t"
 153                 "paddd %%mm6, %%mm5 \n\t"
 154                 "movd %%mm5, %%eax \n\t"
 155                 "psrlq $32, %%mm5 \n\t"
 156                 "movd %%mm5, %%edx \n\t"
 157                 "addl %%edx, %%eax \n\t"
 158
 159                 "emms \n\t"
 160                 : "=a" (ret)
 161                 : "S" (a), "D" (b), "a" (s)
 162                 : "%ecx", "%edx"
 163                 );
 164         return ret;
 165 }
 166
 167 static int var_y_mmx(unsigned char *a, unsigned char *b, int s)
 168 {
 169         int ret;
 170         __asm__ volatile (
 171                 "movl $3, %%ecx \n\t"
 172                 "pxor %%mm4, %%mm4 \n\t"
 173                 "pxor %%mm7, %%mm7 \n\t"
 174
 175                 "1: \n\t"
 176
 177                 "movq (%%"REG_S"), %%mm0 \n\t"
 178                 "movq (%%"REG_S"), %%mm2 \n\t"
 179                 "movq (%%"REG_S",%%"REG_a"), %%mm1 \n\t"
 180                 "add  %%"REG_a", %%"REG_S" \n\t"
 181                 "psubusb %%mm1, %%mm2 \n\t"
 182                 "psubusb %%mm0, %%mm1 \n\t"
 183                 "movq %%mm2, %%mm0 \n\t"
 184                 "movq %%mm1, %%mm3 \n\t"
 185                 "punpcklbw %%mm7, %%mm0 \n\t"
 186                 "punpcklbw %%mm7, %%mm1 \n\t"
 187                 "punpckhbw %%mm7, %%mm2 \n\t"
 188                 "punpckhbw %%mm7, %%mm3 \n\t"
 189                 "paddw %%mm0, %%mm4 \n\t"
 190                 "paddw %%mm1, %%mm4 \n\t"
 191                 "paddw %%mm2, %%mm4 \n\t"
 192                 "paddw %%mm3, %%mm4 \n\t"
 193
 194                 "decl %%ecx \n\t"
 195                 "jnz 1b \n\t"
 196
 197                 "movq %%mm4, %%mm3 \n\t"
 198                 "punpcklwd %%mm7, %%mm4 \n\t"
 199                 "punpckhwd %%mm7, %%mm3 \n\t"
 200                 "paddd %%mm4, %%mm3 \n\t"
 201                 "movd %%mm3, %%eax \n\t"
 202                 "psrlq $32, %%mm3 \n\t"
 203                 "movd %%mm3, %%edx \n\t"
 204                 "addl %%edx, %%eax \n\t"
 205                 "emms \n\t"
 206                 : "=a" (ret)
 207                 : "S" (a), "a" (s)
 208                 : "%ecx", "%edx"
 209                 );
 210         return 4*ret;
 211 }
 212 #endif
 213 #endif
 214
 215 #define ABS(a) (((a)^((a)>>31))-((a)>>31))
 216
 217 static int diff_y(unsigned char *a, unsigned char *b, int s)
 218 {
 219         int i, j, diff=0;
 220         for (i=4; i; i--) {
 221                 for (j=0; j<8; j++) diff += ABS(a[j]-b[j]);
 222                 a+=s; b+=s;
 223         }
 224         return diff;
 225 }
 226
 227 static int licomb_y(unsigned char *a, unsigned char *b, int s)
 228 {
 229         int i, j, diff=0;
 230         for (i=4; i; i--) {
 231                 for (j=0; j<8; j++)
 232                         diff += ABS((a[j]<<1) - b[j-s] - b[j])
 233                                 + ABS((b[j]<<1) - a[j] - a[j+s]);
 234                 a+=s; b+=s;
 235         }
 236         return diff;
 237 }
 238
 239 #if 0
 240 static int qpcomb_y(unsigned char *a, unsigned char *b, int s)
 241 {
 242         int i, j, diff=0;
 243         for (i=4; i; i--) {
 244                 for (j=0; j<8; j++)
 245                         diff += ABS(a[j] - 3*b[j-s] + 3*a[j+s] - b[j]);
 246                 a+=s; b+=s;
 247         }
 248         return diff;
 249 }
 250
 251 static int licomb_y_test(unsigned char *a, unsigned char *b, int s)
 252 {
 253         int c = licomb_y(a,b,s);
 254         int m = licomb_y_mmx(a,b,s);
 255         if (c != m) printf("%d != %d\n", c, m);
 256         return m;
 257 }
 258 #endif
 259
 260 static int var_y(unsigned char *a, unsigned char *b, int s)
 261 {
 262         int i, j, var=0;
 263         for (i=3; i; i--) {
 264                 for (j=0; j<8; j++) {
 265                         var += ABS(a[j]-a[j+s]);
 266                 }
 267                 a+=s; b+=s;
 268         }
 269         return 4*var; /* match comb scaling */
 270 }
 271
 272
 273
 274
 275
 276
 277
 278
 279
 280 static void alloc_buffer(struct pullup_context *c, struct pullup_buffer *b)
 281 {
 282         int i;
 283         if (b->planes) return;
 284         b->planes = calloc(c->nplanes, sizeof(unsigned char *));
 285         for (i = 0; i < c->nplanes; i++) {
 286                 b->planes[i] = malloc(c->h[i]*c->stride[i]);
 287                 /* Deal with idiotic 128=0 for chroma: */
 288                 memset(b->planes[i], c->background[i], c->h[i]*c->stride[i]);
 289         }
 290 }
 291
 292 struct pullup_buffer *pullup_lock_buffer(struct pullup_buffer *b, int parity)
 293 {
 294         if (!b) return 0;
 295         if ((parity+1) & 1) b->lock[0]++;
 296         if ((parity+1) & 2) b->lock[1]++;
 297         return b;
 298 }
 299
 300 void pullup_release_buffer(struct pullup_buffer *b, int parity)
 301 {
 302         if (!b) return;
 303         if ((parity+1) & 1) b->lock[0]--;
 304         if ((parity+1) & 2) b->lock[1]--;
 305 }
 306
 307 struct pullup_buffer *pullup_get_buffer(struct pullup_context *c, int parity)
 308 {
 309         int i;
 310
 311         /* Try first to get the sister buffer for the previous field */
 312         if (parity < 2 && c->last && parity != c->last->parity
 313             && !c->last->buffer->lock[parity]) {
 314                 alloc_buffer(c, c->last->buffer);
 315                 return pullup_lock_buffer(c->last->buffer, parity);
 316         }
 317
 318         /* Prefer a buffer with both fields open */
 319         for (i = 0; i < c->nbuffers; i++) {
 320                 if (c->buffers[i].lock[0]) continue;
 321                 if (c->buffers[i].lock[1]) continue;
 322                 alloc_buffer(c, &c->buffers[i]);
 323                 return pullup_lock_buffer(&c->buffers[i], parity);
 324         }
 325
 326         if (parity == 2) return 0;
 327
 328         /* Search for any half-free buffer */
 329         for (i = 0; i < c->nbuffers; i++) {
 330                 if (((parity+1) & 1) && c->buffers[i].lock[0]) continue;
 331                 if (((parity+1) & 2) && c->buffers[i].lock[1]) continue;
 332                 alloc_buffer(c, &c->buffers[i]);
 333                 return pullup_lock_buffer(&c->buffers[i], parity);
 334         }
 335
 336         return 0;
 337 }
 338
 339
 340
 341
 342
 343
 344 static void compute_metric(struct pullup_context *c,
 345         struct pullup_field *fa, int pa,
 346         struct pullup_field *fb, int pb,
 347         int (*func)(unsigned char *, unsigned char *, int), int *dest)
 348 {
 349         unsigned char *a, *b;
 350         int x, y;
 351         int mp = c->metric_plane;
 352         int xstep = c->bpp[mp];
 353         int ystep = c->stride[mp]<<3;
 354         int s = c->stride[mp]<<1; /* field stride */
 355         int w = c->metric_w*xstep;
 356
 357         if (!fa->buffer || !fb->buffer) return;
 358
 359         /* Shortcut for duplicate fields (e.g. from RFF flag) */
 360         if (fa->buffer == fb->buffer && pa == pb) {
 361                 memset(dest, 0, c->metric_len * sizeof(int));
 362                 return;
 363         }
 364
 365         a = fa->buffer->planes[mp] + pa * c->stride[mp] + c->metric_offset;
 366         b = fb->buffer->planes[mp] + pb * c->stride[mp] + c->metric_offset;
 367
 368         for (y = c->metric_h; y; y--) {
 369                 for (x = 0; x < w; x += xstep) {
 370                         *dest++ = func(a + x, b + x, s);
 371                 }
 372                 a += ystep; b += ystep;
 373         }
 374 }
 375
 376
 377
 378
 379
 380 static void alloc_metrics(struct pullup_context *c, struct pullup_field *f)
 381 {
 382         f->diffs = calloc(c->metric_len, sizeof(int));
 383         f->comb = calloc(c->metric_len, sizeof(int));
 384         f->var = calloc(c->metric_len, sizeof(int));
 385         /* add more metrics here as needed */
 386 }
 387
 388 static struct pullup_field *make_field_queue(struct pullup_context *c, int len)
 389 {
 390         struct pullup_field *head, *f;
 391         f = head = calloc(1, sizeof(struct pullup_field));
 392         alloc_metrics(c, f);
 393         for (; len > 0; len--) {
 394                 f->next = calloc(1, sizeof(struct pullup_field));
 395                 f->next->prev = f;
 396                 f = f->next;
 397                 alloc_metrics(c, f);
 398         }
 399         f->next = head;
 400         head->prev = f;
 401         return head;
 402 }
 403
 404 static void check_field_queue(struct pullup_context *c)
 405 {
 406         if (c->head->next == c->first) {
 407                 struct pullup_field *f = calloc(1, sizeof(struct pullup_field));
 408                 alloc_metrics(c, f);
 409                 f->prev = c->head;
 410                 f->next = c->first;
 411                 c->head->next = f;
 412                 c->first->prev = f;
 413         }
 414 }
 415
 416 void pullup_submit_field(struct pullup_context *c, struct pullup_buffer *b,
 417                          int parity, double pts)
 418 {
 419         struct pullup_field *f;
 420
 421         /* Grow the circular list if needed */
 422         check_field_queue(c);
 423
 424         /* Cannot have two fields of same parity in a row; drop the new one */
 425         if (c->last && c->last->parity == parity) return;
 426
 427         f = c->head;
 428         f->parity = parity;
 429         f->buffer = pullup_lock_buffer(b, parity);
 430         f->flags = 0;
 431         f->breaks = 0;
 432         f->affinity = 0;
 433         f->pts = pts;
 434
 435         compute_metric(c, f, parity, f->prev->prev, parity, c->diff, f->diffs);
 436         compute_metric(c, parity?f->prev:f, 0, parity?f:f->prev, 1, c->comb, f->comb);
 437         compute_metric(c, f, parity, f, -1, c->var, f->var);
 438
 439         /* Advance the circular list */
 440         if (!c->first) c->first = c->head;
 441         c->last = c->head;
 442         c->head = c->head->next;
 443 }
 444
 445 void pullup_flush_fields(struct pullup_context *c)
 446 {
 447         struct pullup_field *f;
 448
 449         for (f = c->first; f && f != c->head; f = f->next) {
 450                 pullup_release_buffer(f->buffer, f->parity);
 451                 f->buffer = 0;
 452         }
 453         c->first = c->last = 0;
 454 }
 455
 456
 457
 458
 459
 460
 461
 462
 463 #define F_HAVE_BREAKS 1
 464 #define F_HAVE_AFFINITY 2
 465
 466
 467 #define BREAK_LEFT 1
 468 #define BREAK_RIGHT 2
 469
 470
 471
 472
 473 static int queue_length(struct pullup_field *begin, struct pullup_field *end)
 474 {
 475         int count = 1;
 476         struct pullup_field *f;
 477
 478         if (!begin || !end) return 0;
 479         for (f = begin; f != end; f = f->next) count++;
 480         return count;
 481 }
 482
 483 static int find_first_break(struct pullup_field *f, int max)
 484 {
 485         int i;
 486         for (i = 0; i < max; i++) {
 487                 if (f->breaks & BREAK_RIGHT || f->next->breaks & BREAK_LEFT)
 488                         return i+1;
 489                 f = f->next;
 490         }
 491         return 0;
 492 }
 493
 494 static void compute_breaks(struct pullup_context *c, struct pullup_field *f0)
 495 {
 496         int i;
 497         struct pullup_field *f1 = f0->next;
 498         struct pullup_field *f2 = f1->next;
 499         struct pullup_field *f3 = f2->next;
 500         int l, max_l=0, max_r=0;
 501         //struct pullup_field *ff;
 502         //for (i=0, ff=c->first; ff != f0; i++, ff=ff->next);
 503
 504         if (f0->flags & F_HAVE_BREAKS) return;
 505         //printf("\n%d: ", i);
 506         f0->flags |= F_HAVE_BREAKS;
 507
 508         /* Special case when fields are 100% identical */
 509         if (f0->buffer == f2->buffer && f1->buffer != f3->buffer) {
 510                 f2->breaks |= BREAK_RIGHT;
 511                 return;
 512         }
 513         if (f0->buffer != f2->buffer && f1->buffer == f3->buffer) {
 514                 f1->breaks |= BREAK_LEFT;
 515                 return;
 516         }
 517
 518         for (i = 0; i < c->metric_len; i++) {
 519                 l = f2->diffs[i] - f3->diffs[i];
 520                 if (l > max_l) max_l = l;
 521                 if (-l > max_r) max_r = -l;
 522         }
 523         /* Don't get tripped up when differences are mostly quant error */
 524         //printf("%d %d\n", max_l, max_r);
 525         if (max_l + max_r < 128) return;
 526         if (max_l > 4*max_r) f1->breaks |= BREAK_LEFT;
 527         if (max_r > 4*max_l) f2->breaks |= BREAK_RIGHT;
 528 }
 529
 530 static void compute_affinity(struct pullup_context *c, struct pullup_field *f)
 531 {
 532         int i;
 533         int max_l=0, max_r=0, l;
 534         if (f->flags & F_HAVE_AFFINITY) return;
 535         f->flags |= F_HAVE_AFFINITY;
 536         if (f->buffer == f->next->next->buffer) {
 537                 f->affinity = 1;
 538                 f->next->affinity = 0;
 539                 f->next->next->affinity = -1;
 540                 f->next->flags |= F_HAVE_AFFINITY;
 541                 f->next->next->flags |= F_HAVE_AFFINITY;
 542                 return;
 543         }
 544         if (1) {
 545                 for (i = 0; i < c->metric_len; i++) {
 546                         int lv = f->prev->var[i];
 547                         int rv = f->next->var[i];
 548                         int v = f->var[i];
 549                         int lc = f->comb[i] - (v+lv) + ABS(v-lv);
 550                         int rc = f->next->comb[i] - (v+rv) + ABS(v-rv);
 551                         lc = lc>0 ? lc : 0;
 552                         rc = rc>0 ? rc : 0;
 553                         l = lc - rc;
 554                         if (l > max_l) max_l = l;
 555                         if (-l > max_r) max_r = -l;
 556                 }
 557                 if (max_l + max_r < 64) return;
 558                 if (max_r > 6*max_l) f->affinity = -1;
 559                 else if (max_l > 6*max_r) f->affinity = 1;
 560         } else {
 561                 for (i = 0; i < c->metric_len; i++) {
 562                         l = f->comb[i] - f->next->comb[i];
 563                         if (l > max_l) max_l = l;
 564                         if (-l > max_r) max_r = -l;
 565                 }
 566                 if (max_l + max_r < 64) return;
 567                 if (max_r > 2*max_l) f->affinity = -1;
 568                 else if (max_l > 2*max_r) f->affinity = 1;
 569         }
 570 }
 571
 572 static void foo(struct pullup_context *c)
 573 {
 574         struct pullup_field *f = c->first;
 575         int i, n = queue_length(f, c->last);
 576         for (i = 0; i < n-1; i++) {
 577                 if (i < n-3) compute_breaks(c, f);
 578                 compute_affinity(c, f);
 579                 f = f->next;
 580         }
 581 }
 582
 583 static int decide_frame_length(struct pullup_context *c)
 584 {
 585         struct pullup_field *f0 = c->first;
 586         struct pullup_field *f1 = f0->next;
 587         struct pullup_field *f2 = f1->next;
 588         int l;
 589
 590         if (queue_length(c->first, c->last) < 4) return 0;
 591         foo(c);
 592
 593         if (f0->affinity == -1) return 1;
 594
 595         l = find_first_break(f0, 3);
 596         if (l == 1 && c->strict_breaks < 0) l = 0;
 597
 598         switch (l) {
 599         case 1:
 600                 if (c->strict_breaks < 1 && f0->affinity == 1 && f1->affinity == -1)
 601                         return 2;
 602                 else return 1;
 603         case 2:
 604                 /* FIXME: strictly speaking, f0->prev is no longer valid... :) */
 605                 if (c->strict_pairs
 606                         && (f0->prev->breaks & BREAK_RIGHT) && (f2->breaks & BREAK_LEFT)
 607                         && (f0->affinity != 1 || f1->affinity != -1) )
 608                         return 1;
 609                 if (f1->affinity == 1) return 1;
 610                 else return 2;
 611         case 3:
 612                 if (f2->affinity == 1) return 2;
 613                 else return 3;
 614         default:
 615                 /* 9 possibilities covered before switch */
 616                 if (f1->affinity == 1) return 1; /* covers 6 */
 617                 else if (f1->affinity == -1) return 2; /* covers 6 */
 618                 else if (f2->affinity == -1) { /* covers 2 */
 619                         if (f0->affinity == 1) return 3;
 620                         else return 1;
 621                 }
 622                 else return 2; /* the remaining 6 */
 623         }
 624 }
 625
 626
 627 static void print_aff_and_breaks(struct pullup_context *c, struct pullup_field *f)
 628 {
 629         int i;
 630         struct pullup_field *f0 = f;
 631         const char aff_l[] = "+..", aff_r[] = "..+";
 632         printf("\naffinity: ");
 633         for (i = 0; i < 4; i++) {
 634                 printf("%c%d%c", aff_l[1+f->affinity], i, aff_r[1+f->affinity]);
 635                 f = f->next;
 636         }
 637         f = f0;
 638         printf("\nbreaks:   ");
 639         for (i=0; i<4; i++) {
 640                 printf("%c%d%c", f->breaks & BREAK_LEFT ? '|' : '.', i, f->breaks & BREAK_RIGHT ? '|' : '.');
 641                 f = f->next;
 642         }
 643         printf("\n");
 644 }
 645
 646
 647
 648
 649
 650 struct pullup_frame *pullup_get_frame(struct pullup_context *c)
 651 {
 652         int i;
 653         struct pullup_frame *fr = c->frame;
 654         int n = decide_frame_length(c);
 655         int aff = c->first->next->affinity;
 656
 657         if (!n) return 0;
 658         if (fr->lock) return 0;
 659
 660         if (c->verbose) {
 661                 print_aff_and_breaks(c, c->first);
 662                 printf("duration: %d    \n", n);
 663         }
 664
 665         fr->lock++;
 666         fr->length = n;
 667         fr->parity = c->first->parity;
 668         fr->buffer = 0;
 669         fr->pts = 0;
 670         for (i = 0; i < n; i++) {
 671                 /* We cheat and steal the buffer without release+relock */
 672                 fr->ifields[i] = c->first->buffer;
 673                 c->first->buffer = 0;
 674                 if (c->first->pts == MP_NOPTS_VALUE || fr->pts == MP_NOPTS_VALUE)
 675                         fr->pts = MP_NOPTS_VALUE;
 676                 else
 677                         fr->pts += c->first->pts;
 678                 c->first = c->first->next;
 679         }
 680         if (fr->pts != MP_NOPTS_VALUE)
 681                 fr->pts /= n;
 682
 683         if (n == 1) {
 684                 fr->ofields[fr->parity] = fr->ifields[0];
 685                 fr->ofields[fr->parity^1] = 0;
 686         } else if (n == 2) {
 687                 fr->ofields[fr->parity] = fr->ifields[0];
 688                 fr->ofields[fr->parity^1] = fr->ifields[1];
 689         } else if (n == 3) {
 690                 if (aff == 0)
 691                         aff = (fr->ifields[0] == fr->ifields[1]) ? -1 : 1;
 692                 /* else if (c->verbose) printf("forced aff: %d    \n", aff); */
 693                 fr->ofields[fr->parity] = fr->ifields[1+aff];
 694                 fr->ofields[fr->parity^1] = fr->ifields[1];
 695         }
 696         pullup_lock_buffer(fr->ofields[0], 0);
 697         pullup_lock_buffer(fr->ofields[1], 1);
 698
 699         if (fr->ofields[0] == fr->ofields[1]) {
 700                 fr->buffer = fr->ofields[0];
 701                 pullup_lock_buffer(fr->buffer, 2);
 702                 return fr;
 703         }
 704         return fr;
 705 }
 706
 707 static void copy_field(struct pullup_context *c, struct pullup_buffer *dest,
 708         struct pullup_buffer *src, int parity)
 709 {
 710         int i, j;
 711         unsigned char *d, *s;
 712         for (i = 0; i < c->nplanes; i++) {
 713                 s = src->planes[i] + parity*c->stride[i];
 714                 d = dest->planes[i] + parity*c->stride[i];
 715                 for (j = c->h[i]>>1; j; j--) {
 716                         memcpy(d, s, c->stride[i]);
 717                         s += c->stride[i]<<1;
 718                         d += c->stride[i]<<1;
 719                 }
 720         }
 721 }
 722
 723 void pullup_pack_frame(struct pullup_context *c, struct pullup_frame *fr)
 724 {
 725         int i;
 726         if (fr->buffer) return;
 727         if (fr->length < 2) return; /* FIXME: deal with this */
 728         for (i = 0; i < 2; i++)
 729         {
 730                 if (fr->ofields[i]->lock[i^1]) continue;
 731                 fr->buffer = fr->ofields[i];
 732                 pullup_lock_buffer(fr->buffer, 2);
 733                 copy_field(c, fr->buffer, fr->ofields[i^1], i^1);
 734                 return;
 735         }
 736         fr->buffer = pullup_get_buffer(c, 2);
 737         copy_field(c, fr->buffer, fr->ofields[0], 0);
 738         copy_field(c, fr->buffer, fr->ofields[1], 1);
 739 }
 740
 741 void pullup_release_frame(struct pullup_frame *fr)
 742 {
 743         int i;
 744         for (i = 0; i < fr->length; i++)
 745                 pullup_release_buffer(fr->ifields[i], fr->parity ^ (i&1));
 746         pullup_release_buffer(fr->ofields[0], 0);
 747         pullup_release_buffer(fr->ofields[1], 1);
 748         if (fr->buffer) pullup_release_buffer(fr->buffer, 2);
 749         fr->lock--;
 750 }
 751
 752
 753
 754
 755
 756
 757 struct pullup_context *pullup_alloc_context(void)
 758 {
 759         struct pullup_context *c;
 760
 761         c = calloc(1, sizeof(struct pullup_context));
 762
 763         return c;
 764 }
 765
 766 void pullup_preinit_context(struct pullup_context *c)
 767 {
 768         c->bpp = calloc(c->nplanes, sizeof(int));
 769         c->w = calloc(c->nplanes, sizeof(int));
 770         c->h = calloc(c->nplanes, sizeof(int));
 771         c->stride = calloc(c->nplanes, sizeof(int));
 772         c->background = calloc(c->nplanes, sizeof(int));
 773 }
 774
 775 void pullup_init_context(struct pullup_context *c)
 776 {
 777         int mp = c->metric_plane;
 778         if (c->nbuffers < 10) c->nbuffers = 10;
 779         c->buffers = calloc(c->nbuffers, sizeof (struct pullup_buffer));
 780
 781         c->metric_w = (c->w[mp] - ((c->junk_left + c->junk_right) << 3)) >> 3;
 782         c->metric_h = (c->h[mp] - ((c->junk_top + c->junk_bottom) << 1)) >> 3;
 783         c->metric_offset = c->junk_left*c->bpp[mp] + (c->junk_top<<1)*c->stride[mp];
 784         c->metric_len = c->metric_w * c->metric_h;
 785
 786         c->head = make_field_queue(c, 8);
 787
 788         c->frame = calloc(1, sizeof (struct pullup_frame));
 789         c->frame->ifields = calloc(3, sizeof (struct pullup_buffer *));
 790
 791         switch(c->format) {
 792         case PULLUP_FMT_Y:
 793                 c->diff = diff_y;
 794                 c->comb = licomb_y;
 795                 c->var = var_y;
 796 #if ARCH_X86
 797 #if HAVE_MMX
 798                 if (c->cpu & PULLUP_CPU_MMX) {
 799                         c->diff = diff_y_mmx;
 800                         c->comb = licomb_y_mmx;
 801                         c->var = var_y_mmx;
 802                 }
 803 #endif
 804 #endif
 805                 /* c->comb = qpcomb_y; */
 806                 break;
 807 #if 0
 808         case PULLUP_FMT_YUY2:
 809                 c->diff = diff_yuy2;
 810                 break;
 811         case PULLUP_FMT_RGB32:
 812                 c->diff = diff_rgb32;
 813                 break;
 814 #endif
 815         }
 816 }
 817
 818 void pullup_free_context(struct pullup_context *c)
 819 {
 820         struct pullup_field *f;
 821         free(c->buffers);
 822         f = c->head;
 823         do {
 824                 if (!f) break;
 825                 free(f->diffs);
 826                 free(f->comb);
 827                 f = f->next;
 828                 free(f->prev);
 829         } while (f != c->head);
 830         free(c->frame);
 831         free(c);
 832 }