libhb/detelecine.c

   1 /* detelecine.c
   2
   3    Copyright (c) 2003-2015 HandBrake Team
   4    This file is part of the HandBrake source code
   5    Homepage: <http://handbrake.fr/>.
   6    It may be used under the terms of the GNU General Public License v2.
   7    For full terms see the file COPYING file or visit http://www.gnu.org/licenses/gpl-2.0.html
   8  */
   9
  10 #include "hb.h"
  11 #include "hbffmpeg.h"
  12
  13 /*
  14  *
  15  * PULLUP DEFINITIONS
  16  *
  17  */
  18
  19 #define PULLUP_FMT_Y         1
  20 #define PULLUP_HAVE_BREAKS   1
  21 #define PULLUP_HAVE_AFFINITY 2
  22 #define PULLUP_BREAK_LEFT    1
  23 #define PULLUP_BREAK_RIGHT   2
  24
  25 #define PULLUP_ABS( a ) (((a)^((a)>>31))-((a)>>31))
  26
  27 #ifndef PIC_FLAG_REPEAT_FIRST_FIELD
  28 #define PIC_FLAG_REPEAT_FIRST_FIELD 256
  29 #endif
  30
  31 struct pullup_buffer
  32 {
  33     int lock[2];
  34     unsigned char **planes;
  35     int *size;
  36 };
  37
  38 struct pullup_field
  39 {
  40     int parity;
  41     struct pullup_buffer *buffer;
  42     unsigned int flags;
  43     int breaks;
  44     int affinity;
  45     int *diffs;
  46     int *comb;
  47     int *var;
  48     struct pullup_field *prev, *next;
  49 };
  50
  51 struct pullup_frame
  52 {
  53     int lock;
  54     int length;
  55     int parity;
  56     struct pullup_buffer **ifields, *ofields[2];
  57     struct pullup_buffer *buffer;
  58 };
  59
  60 struct pullup_context
  61 {
  62     /* Public interface */
  63     int format;
  64     int nplanes;
  65     int *bpp, *w, *h, *stride, *background;
  66     unsigned int cpu;
  67     int junk_left, junk_right, junk_top, junk_bottom;
  68     int verbose;
  69     int metric_plane;
  70     int strict_breaks;
  71     int strict_pairs;
  72     int parity;
  73     /* Internal data */
  74     struct pullup_field *first, *last, *head;
  75     struct pullup_buffer *buffers;
  76     int nbuffers;
  77     int (*diff)(unsigned char *, unsigned char *, int);
  78     int (*comb)(unsigned char *, unsigned char *, int);
  79     int (*var)(unsigned char *, unsigned char *, int);
  80     int metric_w, metric_h, metric_len, metric_offset;
  81     struct pullup_frame *frame;
  82 };
  83
  84 /*
  85  *
  86  * DETELECINE FILTER DEFINITIONS
  87  *
  88  */
  89
  90 struct hb_filter_private_s
  91 {
  92     struct pullup_context * pullup_ctx;
  93     int                     pullup_fakecount;
  94     int                     pullup_skipflag;
  95 };
  96
  97 static int hb_detelecine_init( hb_filter_object_t * filter,
  98                                hb_filter_init_t * init );
  99
 100 static int hb_detelecine_work( hb_filter_object_t * filter,
 101                                hb_buffer_t ** buf_in,
 102                                hb_buffer_t ** buf_out );
 103
 104 static void hb_detelecine_close( hb_filter_object_t * filter );
 105
 106 hb_filter_object_t hb_filter_detelecine =
 107 {
 108     .id            = HB_FILTER_DETELECINE,
 109     .enforce_order = 1,
 110     .name          = "Detelecine (pullup)",
 111     .settings      = NULL,
 112     .init          = hb_detelecine_init,
 113     .work          = hb_detelecine_work,
 114     .close         = hb_detelecine_close,
 115 };
 116
 117 /*
 118  *
 119  * PULLUP STATIC FUNCTIONS
 120  *
 121  */
 122
 123 static int pullup_diff_y( unsigned char  *a, unsigned char * b, int s )
 124 {
 125     int i, j, diff = 0;
 126     for( i = 4; i; i-- )
 127     {
 128         for( j = 0; j < 8; j++ )
 129         {
 130             diff += PULLUP_ABS( a[j]-b[j] );
 131         }
 132         a+=s; b+=s;
 133     }
 134     return diff;
 135 }
 136
 137 static int pullup_licomb_y( unsigned char * a, unsigned char * b, int s )
 138 {
 139     int i, j, diff = 0;
 140     for( i = 4; i; i-- )
 141     {
 142         for( j = 0; j < 8; j++ )
 143         {
 144             diff += PULLUP_ABS( (a[j]<<1) - b[j-s] - b[j] )
 145                   + PULLUP_ABS( (b[j]<<1) - a[j] - a[j+s] );
 146         }
 147         a+=s; b+=s;
 148     }
 149     return diff;
 150 }
 151
 152 static int pullup_var_y( unsigned char * a, unsigned char * b, int s )
 153 {
 154     int i, j, var = 0;
 155     for( i = 3; i; i-- )
 156     {
 157         for( j = 0; j < 8; j++ )
 158         {
 159             var += PULLUP_ABS( a[j]-a[j+s] );
 160         }
 161         a+=s; b+=s;
 162     }
 163     return 4*var;
 164 }
 165
 166 static void pullup_alloc_metrics( struct pullup_context * c,
 167                                   struct pullup_field * f )
 168 {
 169     f->diffs = calloc( c->metric_len, sizeof(int) );
 170     f->comb  = calloc( c->metric_len, sizeof(int) );
 171     f->var   = calloc( c->metric_len, sizeof(int) );
 172 }
 173
 174 static void pullup_compute_metric( struct pullup_context * c,
 175                                    struct pullup_field * fa, int pa,
 176                                    struct pullup_field * fb, int pb,
 177                                    int (* func)( unsigned char *,
 178                                                  unsigned char *, int),
 179                                    int * dest )
 180 {
 181     unsigned char *a, *b;
 182     int x, y;
 183     int mp    = c->metric_plane;
 184     int xstep = c->bpp[mp];
 185     int ystep = c->stride[mp]<<3;
 186     int s     = c->stride[mp]<<1; /* field stride */
 187     int w     = c->metric_w*xstep;
 188
 189     if( !fa->buffer || !fb->buffer ) return;
 190
 191     /* Shortcut for duplicate fields (e.g. from RFF flag) */
 192     if( fa->buffer == fb->buffer && pa == pb )
 193     {
 194         memset( dest, 0, c->metric_len * sizeof(int) );
 195         return;
 196     }
 197
 198     a = fa->buffer->planes[mp] + pa * c->stride[mp] + c->metric_offset;
 199     b = fb->buffer->planes[mp] + pb * c->stride[mp] + c->metric_offset;
 200
 201     for( y = c->metric_h; y; y-- )
 202     {
 203         for( x = 0; x < w; x += xstep )
 204         {
 205             *dest++ = func( a + x, b + x, s );
 206         }
 207         a += ystep; b += ystep;
 208     }
 209 }
 210
 211 static struct pullup_field * pullup_make_field_queue( struct pullup_context * c,
 212                                                       int len )
 213 {
 214     struct pullup_field * head, * f;
 215     f = head = calloc( 1, sizeof(struct pullup_field) );
 216     pullup_alloc_metrics( c, f );
 217     for ( ; len > 0; len-- )
 218     {
 219         f->next = calloc( 1, sizeof(struct pullup_field) );
 220         f->next->prev = f;
 221         f = f->next;
 222         pullup_alloc_metrics( c, f );
 223     }
 224     f->next = head;
 225     head->prev = f;
 226     return head;
 227 }
 228
 229 static void pullup_check_field_queue( struct pullup_context * c )
 230 {
 231     if( c->head->next == c->first )
 232     {
 233         struct pullup_field *f = calloc( 1, sizeof(struct pullup_field) );
 234         pullup_alloc_metrics( c, f );
 235         f->prev = c->head;
 236         f->next = c->first;
 237         c->head->next = f;
 238         c->first->prev = f;
 239     }
 240 }
 241
 242 static void pullup_copy_field( struct pullup_context * c,
 243                                struct pullup_buffer * dest,
 244                                struct pullup_buffer * src,
 245                                int parity )
 246 {
 247     int i, j;
 248     unsigned char *d, *s;
 249     for( i = 0; i < c->nplanes; i++ )
 250     {
 251         s = src->planes[i] + parity*c->stride[i];
 252         d = dest->planes[i] + parity*c->stride[i];
 253         for( j = c->h[i]>>1; j; j-- )
 254         {
 255             memcpy( d, s, c->stride[i] );
 256             s += c->stride[i]<<1;
 257             d += c->stride[i]<<1;
 258         }
 259     }
 260 }
 261
 262
 263 static int pullup_queue_length( struct pullup_field * begin,
 264                                 struct pullup_field * end )
 265 {
 266     int count = 1;
 267     struct pullup_field * f;
 268
 269     if( !begin || !end ) return 0;
 270     for( f = begin; f != end; f = f->next ) count++;
 271     return count;
 272 }
 273
 274 static int pullup_find_first_break( struct pullup_field * f, int max )
 275 {
 276     int i;
 277     for( i = 0; i < max; i++ )
 278     {
 279         if( f->breaks & PULLUP_BREAK_RIGHT ||
 280             f->next->breaks & PULLUP_BREAK_LEFT )
 281         {
 282             return i+1;
 283         }
 284         f = f->next;
 285     }
 286     return 0;
 287 }
 288
 289 static void pullup_compute_breaks( struct pullup_context * c,
 290                                    struct pullup_field * f0 )
 291 {
 292     int i;
 293     struct pullup_field *f1 = f0->next;
 294     struct pullup_field *f2 = f1->next;
 295     struct pullup_field *f3 = f2->next;
 296     int l, max_l=0, max_r=0;
 297
 298     if( f0->flags & PULLUP_HAVE_BREAKS ) return;
 299     f0->flags |= PULLUP_HAVE_BREAKS;
 300
 301     /* Special case when fields are 100% identical */
 302     if( f0->buffer == f2->buffer && f1->buffer != f3->buffer )
 303     {
 304         f2->breaks |= PULLUP_BREAK_RIGHT;
 305         return;
 306     }
 307     if( f0->buffer != f2->buffer && f1->buffer == f3->buffer )
 308     {
 309         f1->breaks |= PULLUP_BREAK_LEFT;
 310         return;
 311     }
 312
 313     for( i = 0; i < c->metric_len; i++ )
 314     {
 315         l = f2->diffs[i] - f3->diffs[i];
 316         if(  l > max_l) max_l = l;
 317         if( -l > max_r) max_r = -l;
 318     }
 319
 320     /* Don't get tripped up when differences are mostly quant error */
 321     if( max_l + max_r < 128 ) return;
 322     if( max_l > 4*max_r ) f1->breaks |= PULLUP_BREAK_LEFT;
 323     if( max_r > 4*max_l ) f2->breaks |= PULLUP_BREAK_RIGHT;
 324 }
 325
 326 static void pullup_compute_affinity( struct pullup_context * c,
 327                                      struct pullup_field * f )
 328 {
 329     int i;
 330     int max_l = 0, max_r = 0, l;
 331
 332     if( f->flags & PULLUP_HAVE_AFFINITY )
 333     {
 334         return;
 335     }
 336     f->flags |= PULLUP_HAVE_AFFINITY;
 337
 338     if( f->buffer == f->next->next->buffer )
 339     {
 340         f->affinity             =  1;
 341         f->next->affinity       =  0;
 342         f->next->next->affinity = -1;
 343
 344         f->next->flags       |= PULLUP_HAVE_AFFINITY;
 345         f->next->next->flags |= PULLUP_HAVE_AFFINITY;
 346
 347         return;
 348     }
 349
 350     for( i = 0; i < c->metric_len; i++ )
 351     {
 352         int lv = f->prev->var[i];
 353         int rv = f->next->var[i];
 354         int v  = f->var[i];
 355         int lc = f->comb[i] - (v+lv) + PULLUP_ABS( v-lv );
 356         int rc = f->next->comb[i] - (v+rv) + PULLUP_ABS( v-rv );
 357
 358         lc = (lc > 0) ? lc : 0;
 359         rc = (rc > 0) ? rc : 0;
 360         l = lc - rc;
 361         if(  l > max_l ) max_l = l;
 362         if( -l > max_r ) max_r = -l;
 363     }
 364
 365     if( max_l + max_r < 64 )
 366     {
 367         return;
 368     }
 369
 370     if( max_r > 6*max_l )
 371     {
 372         f->affinity = -1;
 373     }
 374     else if( max_l > 6*max_r )
 375     {
 376         f->affinity = 1;
 377     }
 378 }
 379
 380 static void pullup_foo( struct pullup_context * c )
 381 {
 382     struct pullup_field * f = c->first;
 383     int i, n = pullup_queue_length (f, c->last );
 384     for( i = 0; i < n-1; i++ )
 385     {
 386         if( i < n-3 ) pullup_compute_breaks( c, f );
 387         pullup_compute_affinity( c, f );
 388         f = f->next;
 389     }
 390 }
 391
 392 static int pullup_decide_frame_length( struct pullup_context * c )
 393 {
 394     struct pullup_field *f0 = c->first;
 395     struct pullup_field *f1 = f0->next;
 396     struct pullup_field *f2 = f1->next;
 397     int l;
 398
 399     if( pullup_queue_length( c->first, c->last ) < 4 )
 400     {
 401         return 0;
 402     }
 403     pullup_foo( c );
 404
 405     if( f0->affinity == -1 ) return 1;
 406
 407     l = pullup_find_first_break( f0, 3 );
 408     if( l == 1 && c->strict_breaks < 0 ) l = 0;
 409
 410     switch (l)
 411     {
 412         case 1:
 413             if ( c->strict_breaks < 1 &&
 414                  f0->affinity == 1 &&
 415                  f1->affinity == -1 )
 416             {
 417                 return 2;
 418             }
 419             else
 420             {
 421                 return 1;
 422             }
 423
 424         case 2:
 425             /* FIXME: strictly speaking, f0->prev is no longer valid... :) */
 426             if( c->strict_pairs &&
 427                 (f0->prev->breaks & PULLUP_BREAK_RIGHT) &&
 428                 (f2->breaks & PULLUP_BREAK_LEFT) &&
 429                 (f0->affinity != 1 || f1->affinity != -1) )
 430             {
 431                 return 1;
 432             }
 433             if( f1->affinity == 1 )
 434             {
 435                 return 1;
 436             }
 437             else
 438             {
 439                 return 2;
 440             }
 441
 442         case 3:
 443             if( f2->affinity == 1 )
 444             {
 445                 return 2;
 446             }
 447             else
 448             {
 449                 return 3;
 450             }
 451
 452         default:
 453             /* 9 possibilities covered before switch */
 454             if( f1->affinity == 1 )
 455             {
 456                 return 1; /* covers 6 */
 457             }
 458             else if( f1->affinity == -1 )
 459             {
 460                 return 2; /* covers 6 */
 461             }
 462             else if( f2->affinity == -1 )
 463             {
 464                 /* covers 2 */
 465                 if( f0->affinity == 1 )
 466                 {
 467                     return 3;
 468                 }
 469                 else
 470                 {
 471                     return 1;
 472                 }
 473             }
 474             else
 475             {
 476                 return 2; /* the remaining 6 */
 477             }
 478     }
 479 }
 480
 481 static void pullup_print_aff_and_breaks(struct pullup_context * c,
 482                                         struct pullup_field * f )
 483 {
 484     int i;
 485     struct pullup_field * f0 = f;
 486     const char aff_l[] = "+..", aff_r[] = "..+";
 487     hb_log( "affinity: " );
 488     for( i = 0; i < 4; i++ )
 489     {
 490         printf( "%c%d%c",
 491                 aff_l[1+f->affinity],
 492                 i,
 493                 aff_r[1+f->affinity] );
 494
 495         f = f->next;
 496     }
 497     f = f0;
 498     printf("\nbreaks:   ");
 499     for( i = 0; i < 4; i++ )
 500     {
 501         printf( "%c%d%c",
 502                 f->breaks & PULLUP_BREAK_LEFT  ? '|' : '.',
 503                 i,
 504                 f->breaks & PULLUP_BREAK_RIGHT ? '|' : '.' );
 505
 506         f = f->next;
 507     }
 508     printf("\n");
 509 }
 510
 511 /*
 512  *
 513  * PULLUP CONTEXT FUNCTIONS
 514  *
 515  */
 516
 517 struct pullup_context * pullup_alloc_context( void )
 518 {
 519     struct pullup_context * c;
 520
 521     c = calloc( 1, sizeof(struct pullup_context)) ;
 522
 523     return c;
 524 }
 525
 526 void pullup_preinit_context( struct pullup_context * c )
 527 {
 528     c->bpp        = calloc( c->nplanes, sizeof(int) );
 529     c->w          = calloc( c->nplanes, sizeof(int) );
 530     c->h          = calloc( c->nplanes, sizeof(int) );
 531     c->stride     = calloc( c->nplanes, sizeof(int) );
 532     c->background = calloc( c->nplanes, sizeof(int) );
 533 }
 534
 535 void pullup_init_context( struct pullup_context * c )
 536 {
 537     int mp = c->metric_plane;
 538     if ( c->nbuffers < 10 )
 539     {
 540         c->nbuffers = 10;
 541     }
 542     c->buffers = calloc( c->nbuffers, sizeof (struct pullup_buffer) );
 543
 544     c->metric_w      = (c->w[mp] - ((c->junk_left + c->junk_right) << 3)) >> 3;
 545     c->metric_h      = (c->h[mp] - ((c->junk_top + c->junk_bottom) << 1)) >> 3;
 546     c->metric_offset = c->junk_left*c->bpp[mp] + (c->junk_top<<1)*c->stride[mp];
 547     c->metric_len    = c->metric_w * c->metric_h;
 548
 549     c->head = pullup_make_field_queue( c, 8 );
 550
 551     c->frame = calloc( 1, sizeof (struct pullup_frame) );
 552     c->frame->ifields = calloc( 3, sizeof (struct pullup_buffer *) );
 553
 554     if( c->format == PULLUP_FMT_Y )
 555     {
 556         c->diff = pullup_diff_y;
 557         c->comb = pullup_licomb_y;
 558         c->var  = pullup_var_y;
 559     }
 560 }
 561
 562 void pullup_free_context( struct pullup_context * c )
 563 {
 564     struct pullup_field * f;
 565
 566     free( c->buffers );
 567
 568     f = c->head->next;
 569     while( f != c->head )
 570     {
 571         free( f->diffs );
 572         free( f->comb );
 573         f = f->next;
 574         free( f->prev );
 575     }
 576     free( f->diffs );
 577     free( f->comb );
 578     free(f);
 579
 580     free( c->frame );
 581     free( c );
 582 }
 583
 584 /*
 585  *
 586  * PULLUP BUFFER FUNCTIONS
 587  *
 588  */
 589
 590 static void pullup_alloc_buffer( struct pullup_context * c,
 591                                  struct pullup_buffer * b )
 592 {
 593     int i;
 594     if( b->planes ) return;
 595     b->planes = calloc( c->nplanes, sizeof(unsigned char *) );
 596     b->size = calloc( c->nplanes, sizeof(int) );
 597     for ( i = 0; i < c->nplanes; i++ )
 598     {
 599         b->size[i] = c->h[i] * c->stride[i];
 600         b->planes[i] = malloc(b->size[i]);
 601         /* Deal with idiotic 128=0 for chroma: */
 602         memset( b->planes[i], c->background[i], b->size[i] );
 603     }
 604 }
 605
 606 struct pullup_buffer * pullup_lock_buffer( struct pullup_buffer * b,
 607                                            int parity )
 608 {
 609     if( !b ) return 0;
 610     if( (parity+1) & 1 ) b->lock[0]++;
 611     if( (parity+1) & 2 ) b->lock[1]++;
 612
 613     return b;
 614 }
 615
 616 void pullup_release_buffer( struct pullup_buffer * b,
 617                             int parity )
 618 {
 619     if( !b ) return;
 620     if( (parity+1) & 1 ) b->lock[0]--;
 621     if( (parity+1) & 2 ) b->lock[1]--;
 622 }
 623
 624 struct pullup_buffer * pullup_get_buffer( struct pullup_context * c,
 625                                           int parity )
 626 {
 627     int i;
 628
 629     /* Try first to get the sister buffer for the previous field */
 630     if( parity < 2 &&
 631         c->last &&
 632         parity != c->last->parity &&
 633         !c->last->buffer->lock[parity])
 634     {
 635         pullup_alloc_buffer( c, c->last->buffer );
 636         return pullup_lock_buffer( c->last->buffer, parity );
 637     }
 638
 639     /* Prefer a buffer with both fields open */
 640     for( i = 0; i < c->nbuffers; i++ )
 641     {
 642         if( c->buffers[i].lock[0] ) continue;
 643         if( c->buffers[i].lock[1] ) continue;
 644         pullup_alloc_buffer( c, &c->buffers[i] );
 645         return pullup_lock_buffer( &c->buffers[i], parity );
 646     }
 647
 648     if( parity == 2 ) return 0;
 649
 650     /* Search for any half-free buffer */
 651     for( i = 0; i < c->nbuffers; i++ )
 652     {
 653         if( ((parity+1) & 1) && c->buffers[i].lock[0] ) continue;
 654         if( ((parity+1) & 2) && c->buffers[i].lock[1] ) continue;
 655         pullup_alloc_buffer( c, &c->buffers[i] );
 656         return pullup_lock_buffer( &c->buffers[i], parity );
 657     }
 658
 659     return 0;
 660 }
 661
 662 /*
 663  *
 664  * PULLUP FRAME FUNCTIONS
 665  *
 666  */
 667
 668 struct pullup_frame * pullup_get_frame( struct pullup_context * c )
 669 {
 670     int i;
 671     struct pullup_frame * fr = c->frame;
 672     int n = pullup_decide_frame_length( c );
 673     int aff = c->first->next->affinity;
 674
 675     if ( !n ) return 0;
 676     if ( fr->lock ) return 0;
 677
 678     if ( c->verbose )
 679     {
 680         pullup_print_aff_and_breaks(c, c->first);
 681         printf("duration: %d    \n", n);
 682     }
 683
 684     fr->lock++;
 685     fr->length = n;
 686     fr->parity = c->first->parity;
 687     fr->buffer = 0;
 688     for( i = 0; i < n; i++ )
 689     {
 690         /* We cheat and steal the buffer without release+relock */
 691         fr->ifields[i] = c->first->buffer;
 692         c->first->buffer = 0;
 693         c->first = c->first->next;
 694     }
 695
 696     if( n == 1 )
 697     {
 698         fr->ofields[fr->parity] = fr->ifields[0];
 699         fr->ofields[fr->parity^1] = 0;
 700     }
 701     else if( n == 2 )
 702     {
 703         fr->ofields[fr->parity] = fr->ifields[0];
 704         fr->ofields[fr->parity^1] = fr->ifields[1];
 705     }
 706     else if( n == 3 )
 707     {
 708         if( aff == 0 )
 709         {
 710             aff = (fr->ifields[0] == fr->ifields[1]) ? -1 : 1;
 711         }
 712         fr->ofields[fr->parity]   = fr->ifields[1+aff];
 713         fr->ofields[fr->parity^1] = fr->ifields[1];
 714     }
 715     pullup_lock_buffer( fr->ofields[0], 0 );
 716     pullup_lock_buffer( fr->ofields[1], 1 );
 717
 718     if( fr->ofields[0] == fr->ofields[1] )
 719     {
 720         fr->buffer = fr->ofields[0];
 721         pullup_lock_buffer(fr->buffer, 2);
 722         return fr;
 723     }
 724     return fr;
 725 }
 726
 727 void pullup_pack_frame( struct pullup_context * c, struct pullup_frame * fr)
 728 {
 729     int i;
 730     if (fr->buffer) return;
 731     if (fr->length < 2) return; /* FIXME: deal with this */
 732     for( i = 0; i < 2; i++ )
 733     {
 734         if( fr->ofields[i]->lock[i^1] ) continue;
 735         fr->buffer = fr->ofields[i];
 736         pullup_lock_buffer(fr->buffer, 2);
 737         pullup_copy_field( c, fr->buffer, fr->ofields[i^1], i^1 );
 738         return;
 739     }
 740     fr->buffer = pullup_get_buffer( c, 2 );
 741     pullup_copy_field( c, fr->buffer, fr->ofields[0], 0 );
 742     pullup_copy_field( c, fr->buffer, fr->ofields[1], 1 );
 743 }
 744
 745 void pullup_release_frame( struct pullup_frame * fr )
 746 {
 747     int i;
 748     for( i = 0; i < fr->length; i++ )
 749     {
 750         pullup_release_buffer( fr->ifields[i], fr->parity ^ (i&1) );
 751     }
 752     pullup_release_buffer( fr->ofields[0], 0 );
 753     pullup_release_buffer( fr->ofields[1], 1 );
 754     if (fr->buffer) pullup_release_buffer( fr->buffer, 2 );
 755     fr->lock--;
 756 }
 757
 758 /*
 759  *
 760  * PULLUP FIELD FUNCTIONS
 761  *
 762  */
 763
 764 void pullup_submit_field( struct pullup_context * c,
 765                           struct pullup_buffer * b,
 766                           int parity )
 767 {
 768     struct pullup_field * f;
 769
 770     /* Grow the circular list if needed */
 771     pullup_check_field_queue( c );
 772
 773     /* Cannot have two fields of same parity in a row; drop the new one */
 774     if( c->last && c->last->parity == parity ) return;
 775
 776     f = c->head;
 777     f->parity = parity;
 778     f->buffer = pullup_lock_buffer( b, parity );
 779     f->flags = 0;
 780     f->breaks = 0;
 781     f->affinity = 0;
 782
 783     pullup_compute_metric( c, f, parity, f->prev->prev,
 784                            parity, c->diff, f->diffs );
 785     pullup_compute_metric( c, parity?f->prev:f, 0,
 786                            parity?f:f->prev, 1, c->comb, f->comb );
 787     pullup_compute_metric( c, f, parity, f,
 788                            -1, c->var, f->var );
 789
 790     /* Advance the circular list */
 791     if( !c->first ) c->first = c->head;
 792     c->last = c->head;
 793     c->head = c->head->next;
 794 }
 795
 796 void pullup_flush_fields( struct pullup_context * c )
 797 {
 798     struct pullup_field * f;
 799
 800     for( f = c->first; f && f != c->head; f = f->next )
 801     {
 802         pullup_release_buffer( f->buffer, f->parity );
 803         f->buffer = 0;
 804     }
 805     c->first = c->last = 0;
 806 }
 807
 808 /*
 809  *
 810  * DETELECINE FILTER FUNCTIONS
 811  *
 812  */
 813
 814 static int hb_detelecine_init( hb_filter_object_t * filter,
 815                                hb_filter_init_t * init )
 816 {
 817     filter->private_data = calloc( sizeof(struct hb_filter_private_s), 1 );
 818     hb_filter_private_t * pv = filter->private_data;
 819
 820     struct pullup_context * ctx;
 821     pv->pullup_ctx = ctx = pullup_alloc_context();
 822
 823     ctx->junk_left = ctx->junk_right  = 1;
 824     ctx->junk_top  = ctx->junk_bottom = 4;
 825     ctx->strict_breaks = -1;
 826     ctx->metric_plane  = 0;
 827     ctx->parity = -1;
 828
 829     if( filter->settings )
 830     {
 831         sscanf( filter->settings, "%d:%d:%d:%d:%d:%d:%d",
 832                 &ctx->junk_left,
 833                 &ctx->junk_right,
 834                 &ctx->junk_top,
 835                 &ctx->junk_bottom,
 836                 &ctx->strict_breaks,
 837                 &ctx->metric_plane,
 838                 &ctx->parity );
 839     }
 840
 841     ctx->format = PULLUP_FMT_Y;
 842     ctx->nplanes = 4;
 843
 844     pullup_preinit_context( ctx );
 845
 846     ctx->bpp[0] = ctx->bpp[1] = ctx->bpp[2] = 8;
 847     ctx->background[1] = ctx->background[2] = 128;
 848
 849     ctx->w[0]      = init->geometry.width;
 850     ctx->h[0]      = hb_image_height( init->pix_fmt, init->geometry.height, 0 );
 851     ctx->stride[0] = hb_image_stride( init->pix_fmt, init->geometry.width, 0 );
 852
 853     ctx->w[1]      = init->geometry.width >> 1;
 854     ctx->h[1]      = hb_image_height( init->pix_fmt, init->geometry.height, 1 );
 855     ctx->stride[1] = hb_image_stride( init->pix_fmt, init->geometry.width, 1 );
 856
 857     ctx->w[1]      = init->geometry.width >> 1;
 858     ctx->h[2]      = hb_image_height( init->pix_fmt, init->geometry.height, 2 );
 859     ctx->stride[2] = hb_image_stride( init->pix_fmt, init->geometry.width, 2 );
 860
 861     ctx->w[3]      = ((init->geometry.width + 15) / 16) *
 862                      ((init->geometry.height + 15) / 16);
 863     ctx->h[3]      = 2;
 864     ctx->stride[3] = ctx->w[3];
 865
 866 #if 0
 867     ctx->verbose = 1;
 868 #endif
 869
 870     pullup_init_context( ctx );
 871
 872     pv->pullup_fakecount = 1;
 873     pv->pullup_skipflag = 0;
 874
 875     init->job->use_detelecine = 1;
 876
 877     return 0;
 878 }
 879
 880 static void hb_detelecine_close( hb_filter_object_t * filter )
 881 {
 882     hb_filter_private_t * pv = filter->private_data;
 883
 884     if( !pv )
 885     {
 886         return;
 887     }
 888
 889     if( pv->pullup_ctx )
 890     {
 891         pullup_free_context( pv->pullup_ctx );
 892     }
 893
 894     free( pv );
 895     filter->private_data = NULL;
 896 }
 897
 898
 899 static int hb_detelecine_work( hb_filter_object_t * filter,
 900                                hb_buffer_t ** buf_in,
 901                                hb_buffer_t ** buf_out )
 902 {
 903     hb_filter_private_t * pv = filter->private_data;
 904     hb_buffer_t * in = *buf_in, * out;
 905
 906     if (in->s.flags & HB_BUF_FLAG_EOF)
 907     {
 908         *buf_out = in;
 909         *buf_in = NULL;
 910         return HB_FILTER_DONE;
 911     }
 912
 913     struct pullup_context * ctx = pv->pullup_ctx;
 914     struct pullup_buffer  * buf;
 915     struct pullup_frame   * frame;
 916
 917     buf = pullup_get_buffer( ctx, 2 );
 918     if( !buf )
 919     {
 920         frame = pullup_get_frame( ctx );
 921         pullup_release_frame( frame );
 922         hb_log( "Could not get buffer from pullup!" );
 923         return HB_FILTER_FAILED;
 924     }
 925
 926     /* Copy input buffer into pullup buffer */
 927     memcpy( buf->planes[0], in->plane[0].data, buf->size[0] );
 928     memcpy( buf->planes[1], in->plane[1].data, buf->size[1] );
 929     memcpy( buf->planes[2], in->plane[2].data, buf->size[2] );
 930
 931     /* Submit buffer fields based on buffer flags.
 932        Detelecine assumes BFF when the TFF flag isn't present. */
 933     int parity = 1;
 934     if( in->s.flags & PIC_FLAG_TOP_FIELD_FIRST )
 935     {
 936         /* Source signals TFF */
 937         parity = 0;
 938     }
 939     else if( ctx->parity == 0 )
 940     {
 941         /* Many non-MPEG-2 sources lack parity flags even though
 942            they are TFF, so this allow users to override. */
 943         parity = 0;
 944     }
 945     if( ctx->parity == 1 )
 946     {
 947         /* Override autodetected parity with BFF */
 948         parity = 1;
 949     }
 950     pullup_submit_field( ctx, buf, parity );
 951     pullup_submit_field( ctx, buf, parity^1 );
 952     if( in->s.flags & PIC_FLAG_REPEAT_FIRST_FIELD )
 953     {
 954         pullup_submit_field( ctx, buf, parity );
 955     }
 956     pullup_release_buffer( buf, 2 );
 957
 958     /* Get frame and check if pullup is ready */
 959     frame = pullup_get_frame( ctx );
 960     if( !frame )
 961     {
 962         if( pv->pullup_fakecount )
 963         {
 964             pv->pullup_fakecount--;
 965
 966             *buf_in = NULL;
 967             *buf_out = in;
 968
 969             goto output_frame;
 970         }
 971         else
 972         {
 973             goto discard_frame;
 974         }
 975     }
 976
 977     /* Check to see if frame should be dropped */
 978     if( frame->length < 2 )
 979     {
 980         pullup_release_frame( frame );
 981         frame = pullup_get_frame( ctx );
 982
 983         if (!frame)
 984         {
 985             goto discard_frame;
 986         }
 987         if( frame->length < 2 )
 988         {
 989             pullup_release_frame( frame );
 990
 991             if( !(in->s.flags & PIC_FLAG_REPEAT_FIRST_FIELD) )
 992             {
 993                 goto discard_frame;
 994             }
 995
 996             frame = pullup_get_frame( ctx );
 997
 998             if( !frame )
 999             {
1000                 goto discard_frame;
1001             }
1002             if( frame->length < 2 )
1003             {
1004                 pullup_release_frame( frame );
1005                 goto discard_frame;
1006             }
1007         }
1008     }
1009
1010     /* Check to see if frame buffer is ready for export */
1011     if( !frame->buffer )
1012     {
1013         pullup_pack_frame( ctx, frame );
1014     }
1015
1016     out = hb_video_buffer_init( in->f.width, in->f.height );
1017
1018     /* Copy pullup frame buffer into output buffer */
1019     memcpy( out->plane[0].data, frame->buffer->planes[0], frame->buffer->size[0] );
1020     memcpy( out->plane[1].data, frame->buffer->planes[1], frame->buffer->size[1] );
1021     memcpy( out->plane[2].data, frame->buffer->planes[2], frame->buffer->size[2] );
1022
1023     pullup_release_frame( frame );
1024
1025     out->s = in->s;
1026     hb_buffer_move_subs( out, in );
1027
1028     *buf_out = out;
1029
1030 output_frame:
1031
1032     return HB_FILTER_OK;
1033
1034 /* This and all discard_frame calls shown above are
1035    the result of me restoring the functionality in
1036    pullup that huevos_rancheros disabled because
1037    HB couldn't handle it.                           */
1038 discard_frame:
1039     return HB_FILTER_OK;
1040
1041 }
1042
1043