* Copyright (C) 2003-2004 Ushodaya Enterprises Limited
* Author: Charles Yates <charles.yates@pandora.be>
*
- * 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 library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2.1 of the License, or (at your option) any later version.
*
- * This program is distributed in the hope that it will be useful,
+ * This library 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.
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * Lesser 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
-#include "filter_obscure.h"
-
+#include <framework/mlt_filter.h>
#include <framework/mlt_frame.h>
#include <stdio.h>
/** The averaging function...
*/
-void obscure_average( uint8_t *start, int width, int height, int stride )
+static inline void obscure_average( uint8_t *start, int width, int height, int stride )
{
- int y;
- int x;
+ register int y;
+ register int x;
register int Y = ( *start + *( start + 2 ) ) / 2;
register int U = *( start + 1 );
register int V = *( start + 3 );
register uint8_t *p;
+ register int components = width >> 1;
- for ( y = 0; y < height; y ++ )
+ y = height;
+ while( y -- )
{
- p = start + y * stride;
- for ( x = 0; x < width / 2; x ++ )
+ p = start;
+ x = components;
+ while( x -- )
{
- Y = ( Y + *p ++ ) / 2;
- U = ( U + *p ++ ) / 2;
- Y = ( Y + *p ++ ) / 2;
- V = ( V + *p ++ ) / 2;
+ Y = ( Y + *p ++ ) >> 1;
+ U = ( U + *p ++ ) >> 1;
+ Y = ( Y + *p ++ ) >> 1;
+ V = ( V + *p ++ ) >> 1;
}
+ start += stride;
}
- for ( y = 0; y < height; y ++ )
+ start -= height * stride;
+ y = height;
+ while( y -- )
{
- p = start + y * stride;
-
- for ( x = 0; x < width / 2; x ++ )
+ p = start;
+ x = components;
+ while( x -- )
{
*p ++ = Y;
*p ++ = U;
*p ++ = Y;
*p ++ = V;
}
+ start += stride;
}
}
aw = w + mw > area_w ? mw - ( w + mw - area_w ) : mw;
ah = h + mh > area_h ? mh - ( h + mh - area_h ) : mh;
if ( aw > 1 && ah > 1 )
- obscure_average( p + h * width * 2 + w * 2, aw, ah, width * 2 );
+ obscure_average( p + h * ( width << 1 ) + ( w << 1 ), aw, ah, width << 1 );
}
}
}
struct geometry_s start;
struct geometry_s end;
- // Calculate the position
- float position = position_calculate( this, frame );
+ // Retrieve the position
+ float position = mlt_properties_get_double(frame_properties, "filter_position");
// Now parse the geometries
geometry_parse( &start, NULL, mlt_properties_get( properties, "start" ), normalised_width, normalised_height );
// Push this on to the service stack
mlt_frame_push_service( frame, this );
+ // Calculate the position for the filter effect
+ float position = position_calculate( this, frame );
+ mlt_properties_set_double( MLT_FRAME_PROPERTIES( frame ), "filter_position", position );
+
// Push the get image call
mlt_frame_push_get_image( frame, filter_get_image );
/** Constructor for the filter.
*/
-mlt_filter filter_obscure_init( void *arg )
+mlt_filter filter_obscure_init( mlt_profile profile, mlt_service_type type, const char *id, char *arg )
{
mlt_filter this = mlt_filter_new( );
if ( this != NULL )