mirror of
https://github.com/mpv-player/mpv
synced 2024-12-14 10:55:43 +00:00
790e5ae5b4
git-svn-id: svn://svn.mplayerhq.hu/mplayer/trunk@18658 b3059339-0415-0410-9bf9-f77b7e298cf2
234 lines
7.3 KiB
C
234 lines
7.3 KiB
C
/*
|
|
Copyright (C) 2006 Michael Niedermayer <michaelni@gmx.at>
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation; either version 2 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <inttypes.h>
|
|
#include <math.h>
|
|
|
|
#include "config.h"
|
|
|
|
#include "mp_msg.h"
|
|
|
|
#ifdef HAVE_MALLOC_H
|
|
#include <malloc.h>
|
|
#endif
|
|
|
|
#include "img_format.h"
|
|
#include "mp_image.h"
|
|
#include "vf.h"
|
|
#include "libvo/fastmemcpy.h"
|
|
|
|
#define MIN(a,b) ((a) > (b) ? (b) : (a))
|
|
#define MAX(a,b) ((a) < (b) ? (b) : (a))
|
|
#define ABS(a) ((a) > 0 ? (a) : (-(a)))
|
|
|
|
#define MIN3(a,b,c) MIN(MIN(a,b),c)
|
|
#define MAX3(a,b,c) MAX(MAX(a,b),c)
|
|
|
|
//===========================================================================//
|
|
|
|
struct vf_priv_s {
|
|
int mode;
|
|
int parity;
|
|
int stride[3];
|
|
uint8_t *ref[4][3];
|
|
};
|
|
|
|
static void store_ref(struct vf_priv_s *p, uint8_t *src[3], int src_stride[3], int width, int height){
|
|
int i;
|
|
|
|
memcpy (p->ref[3], p->ref[0], sizeof(uint8_t *)*3);
|
|
memmove(p->ref[0], p->ref[1], sizeof(uint8_t *)*3*3);
|
|
|
|
for(i=0; i<3; i++){
|
|
int is_chroma= !!i;
|
|
|
|
memcpy_pic(p->ref[2][i], src[i], width>>is_chroma, height>>is_chroma, p->stride[i], src_stride[i]);
|
|
}
|
|
}
|
|
|
|
static void filter(struct vf_priv_s *p, uint8_t *dst[3], int dst_stride[3], int width, int height, int parity, int tff){
|
|
int x, y, i;
|
|
|
|
for(i=0; i<3; i++){
|
|
int is_chroma= !!i;
|
|
int w= width >>is_chroma;
|
|
int h= height>>is_chroma;
|
|
int refs= p->stride[i];
|
|
|
|
for(y=0; y<h; y++){
|
|
if((y ^ parity) & 1){
|
|
for(x=0; x<w; x++){
|
|
uint8_t *prev= &p->ref[0][i][x + y*refs];
|
|
uint8_t *cur = &p->ref[1][i][x + y*refs];
|
|
uint8_t *next= &p->ref[2][i][x + y*refs];
|
|
uint8_t *prev2= (tff ^ parity) ? prev : cur ;
|
|
uint8_t *next2= (tff ^ parity) ? cur : next;
|
|
|
|
int c= cur[-refs];
|
|
int d= (prev2[0] + next2[0])>>1;
|
|
int e= cur[+refs];
|
|
int temporal_diff0= ABS(prev2[0] - next2[0]);
|
|
int temporal_diff1=( ABS(prev[-refs] - c) + ABS(prev[+refs] - e) )>>1;
|
|
int temporal_diff2=( ABS(next[-refs] - c) + ABS(next[+refs] - e) )>>1;
|
|
int diff= MAX3(temporal_diff0>>1, temporal_diff1, temporal_diff2);
|
|
int spatial_pred= (c+e)>>1;
|
|
int spatial_score= ABS(cur[-refs-1] - cur[+refs-1]) + ABS(c-e)
|
|
+ ABS(cur[-refs+1] - cur[+refs+1]) - 1;
|
|
|
|
#define CHECK(j)\
|
|
{ int score= ABS(cur[-refs-1+j] - cur[+refs-1-j])\
|
|
+ ABS(cur[-refs +j] - cur[+refs -j])\
|
|
+ ABS(cur[-refs+1+j] - cur[+refs+1-j]);\
|
|
if(score < spatial_score){\
|
|
spatial_score= score;\
|
|
spatial_pred= (cur[-refs +j] + cur[+refs -j])>>1;\
|
|
|
|
CHECK(-1) CHECK(-2) }} }}
|
|
CHECK( 1) CHECK( 2) }} }}
|
|
|
|
if(p->mode<2){
|
|
int b= (prev2[-2*refs] + next2[-2*refs])>>1;
|
|
int f= (prev2[+2*refs] + next2[+2*refs])>>1;
|
|
#if 0
|
|
int a= cur[-3*refs];
|
|
int g= cur[+3*refs];
|
|
int max= MAX3(d-e, d-c, MIN3(MAX(b-c,f-e),MAX(b-c,b-a),MAX(f-g,f-e)) );
|
|
int min= MIN3(d-e, d-c, MAX3(MIN(b-c,f-e),MIN(b-c,b-a),MIN(f-g,f-e)) );
|
|
#else
|
|
int max= MAX3(d-e, d-c, MIN(b-c, f-e));
|
|
int min= MIN3(d-e, d-c, MAX(b-c, f-e));
|
|
#endif
|
|
|
|
diff= MAX3(diff, min, -max);
|
|
}
|
|
|
|
if(d < spatial_pred) d= MIN(d + diff, spatial_pred);
|
|
else d= MAX(d - diff, spatial_pred);
|
|
|
|
dst[i][x + y*dst_stride[i]]= d;
|
|
}
|
|
}else{
|
|
memcpy(&dst[i][y*dst_stride[i]], &p->ref[1][i][y*refs], w);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
static int config(struct vf_instance_s* vf,
|
|
int width, int height, int d_width, int d_height,
|
|
unsigned int flags, unsigned int outfmt){
|
|
int i, j;
|
|
|
|
for(i=0; i<3; i++){
|
|
int is_chroma= !!i;
|
|
int w= ((width + 31) & (~31))>>is_chroma;
|
|
int h= ((height+6+ 31) & (~31))>>is_chroma;
|
|
|
|
vf->priv->stride[i]= w;
|
|
for(j=0; j<3; j++)
|
|
vf->priv->ref[j][i]= malloc(w*h*sizeof(uint8_t))+3*w;
|
|
}
|
|
|
|
return vf_next_config(vf,width,height,d_width,d_height,flags,outfmt);
|
|
}
|
|
|
|
static int put_image(struct vf_instance_s* vf, mp_image_t *mpi, double pts){
|
|
mp_image_t *dmpi;
|
|
int ret=0;
|
|
int tff, i;
|
|
|
|
if(vf->priv->parity < 0) {
|
|
if (mpi->fields & MP_IMGFIELD_ORDERED)
|
|
tff = !!(mpi->fields & MP_IMGFIELD_TOP_FIRST);
|
|
else
|
|
tff = 1;
|
|
}
|
|
else tff = (vf->priv->parity&1)^1;
|
|
|
|
store_ref(vf->priv, mpi->planes, mpi->stride, mpi->w, mpi->h);
|
|
|
|
for(i=0; i<=(vf->priv->mode&1); i++){
|
|
dmpi=vf_get_image(vf->next,mpi->imgfmt,
|
|
MP_IMGTYPE_TEMP,
|
|
MP_IMGFLAG_ACCEPT_STRIDE|MP_IMGFLAG_PREFER_ALIGNED_STRIDE,
|
|
mpi->width,mpi->height);
|
|
vf_clone_mpi_attributes(dmpi, mpi);
|
|
filter(vf->priv, dmpi->planes, dmpi->stride, mpi->w, mpi->h, i ^ tff ^ 1, tff);
|
|
ret |= vf_next_put_image(vf, dmpi, pts /*FIXME*/);
|
|
if(i<(vf->priv->mode&1))
|
|
vf_next_control(vf, VFCTRL_FLIP_PAGE, NULL);
|
|
}
|
|
|
|
return ret;
|
|
}
|
|
|
|
static void uninit(struct vf_instance_s* vf){
|
|
int i;
|
|
if(!vf->priv) return;
|
|
|
|
for(i=0; i<3*3; i++){
|
|
uint8_t **p= &vf->priv->ref[i%3][i/3];
|
|
if(*p) free(*p - 3*vf->priv->stride[i/3]);
|
|
*p= NULL;
|
|
}
|
|
free(vf->priv);
|
|
vf->priv=NULL;
|
|
}
|
|
|
|
//===========================================================================//
|
|
static int query_format(struct vf_instance_s* vf, unsigned int fmt){
|
|
switch(fmt){
|
|
case IMGFMT_YV12:
|
|
case IMGFMT_I420:
|
|
case IMGFMT_IYUV:
|
|
case IMGFMT_Y800:
|
|
case IMGFMT_Y8:
|
|
return vf_next_query_format(vf,fmt);
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
static int open(vf_instance_t *vf, char* args){
|
|
|
|
vf->config=config;
|
|
vf->put_image=put_image;
|
|
vf->query_format=query_format;
|
|
vf->uninit=uninit;
|
|
vf->priv=malloc(sizeof(struct vf_priv_s));
|
|
memset(vf->priv, 0, sizeof(struct vf_priv_s));
|
|
|
|
vf->priv->mode=0;
|
|
vf->priv->parity= -1;
|
|
|
|
if (args) sscanf(args, "%d:%d", &vf->priv->mode, &vf->priv->parity);
|
|
|
|
return 1;
|
|
}
|
|
|
|
vf_info_t vf_info_yadif = {
|
|
"Yet Another DeInterlacing Filter",
|
|
"yadif",
|
|
"Michael Niedermayer",
|
|
"",
|
|
open,
|
|
NULL
|
|
};
|