2 * mlt_animation.c -- provides the property animation API
3 * Copyright (C) 2004-2013 Ushodaya Enterprises Limited
4 * Author: Charles Yates <charles.yates@pandora.be>
5 * Author: Dan Dennedy <dan@dennedy.org>
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with this library; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
22 #include "mlt_animation.h"
23 #include "mlt_tokeniser.h"
24 #include "mlt_profile.h"
30 typedef struct animation_node_s *animation_node;
31 struct animation_node_s
33 struct mlt_animation_item_s item;
34 animation_node next, prev;
37 struct mlt_animation_s
46 // Create a new geometry structure
47 mlt_animation mlt_animation_new( )
49 mlt_animation self = calloc( 1, sizeof( *self ) );
53 void mlt_animation_interpolate( mlt_animation self )
55 // Parse all items to ensure non-keyframes are calculated correctly.
58 animation_node current = self->nodes;
61 if ( !current->item.is_key )
64 mlt_property points[4];
65 animation_node prev = current->prev;
66 animation_node next = current->next;
68 while ( prev && !prev->item.is_key ) prev = prev->prev;
69 while ( next && !next->item.is_key ) next = next->next;
72 current->item.is_key = 1;
73 points[0] = prev->prev? prev->prev->item.property : prev->item.property;
74 points[1] = prev->item.property;
75 points[2] = next->item.property;
76 points[3] = next->next? next->next->item.property : next->item.property;
77 progress = current->item.frame - prev->item.frame;
78 progress /= next->item.frame - prev->item.frame;
79 mlt_property_interpolate( current->item.property, points, progress,
80 self->fps, self->locale, current->item.keyframe_type );
83 // Move to the next item
84 current = current->next;
89 static int mlt_animation_drop( mlt_animation self, animation_node node )
91 if ( node == self->nodes )
93 self->nodes = node->next;
95 self->nodes->prev = NULL;
96 self->nodes->item.is_key = 1;
99 else if ( node->next && node->prev )
101 node->prev->next = node->next;
102 node->next->prev = node->prev;
104 else if ( node->next )
106 node->next->prev = node->prev;
108 else if ( node->prev )
110 node->prev->next = node->next;
112 mlt_property_close( node->item.property );
118 static void mlt_animation_clean( mlt_animation self )
123 while ( self->nodes )
124 mlt_animation_drop( self, self->nodes );
127 int mlt_animation_parse(mlt_animation self, const char *data, int length, double fps, locale_t locale )
131 struct mlt_animation_item_s item;
132 mlt_tokeniser tokens = mlt_tokeniser_init( );
134 // Clean the existing geometry
135 mlt_animation_clean( self );
137 // Update the info on the data
139 self->data = strdup( data );
140 self->length = length;
142 self->locale = locale;
143 item.property = mlt_property_init();
147 mlt_tokeniser_parse_new( tokens, (char*) data, ";" );
149 // Iterate through each token
150 for ( i = 0; i < mlt_tokeniser_count( tokens ); i++ )
152 char *value = mlt_tokeniser_get_string( tokens, i );
154 // If no data in keyframe, drop it (trailing semicolon)
155 if ( !value || !strcmp( value, "" ) )
159 item.frame = item.is_key = 0;
161 // Now parse the item
162 mlt_animation_parse_item( self, &item, value );
164 // Now insert into place
165 mlt_animation_insert( self, &item );
167 mlt_animation_interpolate( self );
170 mlt_tokeniser_close( tokens );
171 mlt_property_close( item.property );
176 // Conditionally refresh in case of a change
177 int mlt_animation_refresh(mlt_animation self, const char *data, int length)
179 if ( ( length != self->length )|| ( data && ( !self->data || strcmp( data, self->data ) ) ) )
180 return mlt_animation_parse( self, data, length, self->fps, self->locale );
184 int mlt_animation_get_length( mlt_animation self )
192 void mlt_animation_set_length( mlt_animation self, int length )
195 self->length = length;
198 int mlt_animation_parse_item( mlt_animation self, mlt_animation_item item, const char *value )
202 if ( value && strcmp( value, "" ) )
204 // Determine if a position has been specified
205 if ( strchr( value, '=' ) )
209 #if defined(__GLIBC__) || defined(__DARWIN__)
211 temp = strtod_l( value, &p, self->locale );
214 temp = strtod( value, &p );
215 // If p == value then it is likely a time clock or time code.
216 if ( temp > -1.0 && temp < 1.0 && p != value )
218 // Parse a relative time (-1, 1).
219 item->frame = temp * self->length;
223 // Parse an absolute time value.
224 // Null terminate the string at the equal sign to prevent interpreting
225 // a colon in the part to the right of the equal sign as indicative of a
226 // a time value string.
227 char *s = strdup( value );
228 p = strchr( s, '=' );
230 mlt_property_set_string( item->property, s );
231 item->frame = mlt_property_get_int( item->property, self->fps, self->locale );
235 // The character preceeding the equal sign indicates interpolation method.
236 p = strchr( value, '=' ) - 1;
237 if ( p[0] == '|' || p[0] == '!' )
238 item->keyframe_type = mlt_keyframe_discrete;
239 else if ( p[0] == '~' )
240 item->keyframe_type = mlt_keyframe_smooth;
242 item->keyframe_type = mlt_keyframe_linear;
246 // Special case - frame < 0
247 if ( item->frame < 0 )
248 item->frame += self->length;
250 // Set remainder of string as item value.
251 mlt_property_set_string( item->property, value );
262 // Fetch a geometry item for an absolute position
263 int mlt_animation_get_item( mlt_animation self, mlt_animation_item item, int position )
266 // Need to find the nearest keyframe to the position specifed
267 animation_node node = self->nodes;
269 // Iterate through the keyframes until we reach last or have
270 while ( node && node->next && position >= node->next->item.frame )
275 item->keyframe_type = node->item.keyframe_type;
277 // Position is before the first keyframe.
278 if ( position < node->item.frame )
281 mlt_property_pass( item->property, node->item.property );
284 else if ( position == node->item.frame )
286 item->is_key = node->item.is_key;
287 mlt_property_pass( item->property, node->item.property );
289 // Position is after the last keyframe.
290 else if ( !node->next )
293 mlt_property_pass( item->property, node->item.property );
295 // Interpolation needed.
299 mlt_property points[4];
300 points[0] = node->prev? node->prev->item.property : node->item.property;
301 points[1] = node->item.property;
302 points[2] = node->next->item.property;
303 points[3] = node->next->next? node->next->next->item.property : node->next->item.property;
304 progress = position - node->item.frame;
305 progress /= node->next->item.frame - node->item.frame;
306 mlt_property_interpolate( item->property, points, progress,
307 self->fps, self->locale, item->keyframe_type );
313 item->frame = item->is_key = 0;
316 item->frame = position;
321 // Specify an animation item at an absolute position
322 int mlt_animation_insert( mlt_animation self, mlt_animation_item item )
325 animation_node node = calloc( 1, sizeof( *node ) );
326 node->item.frame = item->frame;
327 node->item.is_key = 1;
328 node->item.keyframe_type = item->keyframe_type;
329 node->item.property = mlt_property_init();
330 mlt_property_pass( node->item.property, item->property );
332 // Determine if we need to insert or append to the list, or if it's a new list
335 // Get the first item
336 animation_node current = self->nodes;
338 // Locate an existing nearby item
339 while ( current->next && item->frame > current->item.frame )
340 current = current->next;
342 if ( item->frame < current->item.frame )
344 if ( current == self->nodes )
347 current->prev->next = node;
348 node->next = current;
349 node->prev = current->prev;
350 current->prev = node;
352 else if ( item->frame > current->item.frame )
355 current->next->prev = node;
356 node->next = current->next;
357 node->prev = current;
358 current->next = node;
362 // Update matching node.
363 current->item.frame = item->frame;
364 current->item.is_key = 1;
365 current->item.keyframe_type = item->keyframe_type;
366 mlt_property_close( current->item.property );
367 current->item.property = node->item.property;
373 // Set the first item
380 // Remove the keyframe at the specified position
381 int mlt_animation_remove( mlt_animation self, int position )
384 animation_node node = self->nodes;
386 while ( node && position != node->item.frame )
389 if ( node && position == node->item.frame )
390 error = mlt_animation_drop( self, node );
395 // Get the keyfame at the position or the next following
396 int mlt_animation_next_key( mlt_animation self, mlt_animation_item item, int position )
398 animation_node node = self->nodes;
400 while ( node && position > node->item.frame )
405 item->frame = node->item.frame;
406 item->is_key = node->item.is_key;
407 item->keyframe_type = node->item.keyframe_type;
408 mlt_property_pass( item->property, node->item.property );
411 return ( node == NULL );
414 // Get the keyframe at the position or the previous key
415 int mlt_animation_prev_key( mlt_animation self, mlt_animation_item item, int position )
417 animation_node node = self->nodes;
419 while ( node && node->next && position >= node->next->item.frame )
424 item->frame = node->item.frame;
425 item->is_key = node->item.is_key;
426 item->keyframe_type = node->item.keyframe_type;
427 mlt_property_pass( item->property, node->item.property );
430 return ( node == NULL );
433 char *mlt_animation_serialize_cut( mlt_animation self, int in, int out )
435 struct mlt_animation_item_s item;
436 char *ret = malloc( 1000 );
440 item.property = mlt_property_init();
444 out = mlt_animation_get_length( self );
456 // If it's the first frame, then it's not necessarily a key
457 if ( item.frame == in )
459 if ( mlt_animation_get_item( self, &item, item.frame ) )
462 // If the first keyframe is larger than the current position
463 // then do nothing here
464 if ( self->nodes->item.frame > item.frame )
470 // To ensure correct seeding
473 // Typically, we move from keyframe to keyframe
474 else if ( item.frame < out )
476 if ( mlt_animation_next_key( self, &item, item.frame ) )
479 // Special case - crop at the out point
480 if ( item.frame > out )
481 mlt_animation_get_item( self, &item, out );
483 // We've handled the last keyframe
489 // Determine length of string to be appended.
490 if ( item.frame - in != 0 )
493 item_len += strlen( mlt_property_get_string_l( item.property, self->locale ) );
495 // Reallocate return string to be long enough.
496 while ( used + item_len + 2 > size ) // +2 for ';' and NULL
499 ret = realloc( ret, size );
502 // Append item delimiter (;) if needed.
503 if ( ret && used > 0 )
510 // Append keyframe time and keyframe/value delimiter (=).
512 switch (item.keyframe_type) {
513 case mlt_keyframe_discrete:
516 case mlt_keyframe_smooth:
523 sprintf( ret + used, "%d%s=", item.frame - in, s );
525 // Append item value.
527 strcat( ret, mlt_property_get_string_l( item.property, self->locale ) );
528 used = strlen( ret );
533 mlt_property_close( item.property );
538 // Serialise the current geometry
539 char *mlt_animation_serialize( mlt_animation self )
541 char *ret = mlt_animation_serialize_cut( self, 0, self->length );
548 return strdup( ret );
551 // Close the geometry
552 void mlt_animation_close( mlt_animation self )
556 mlt_animation_clean( self );