1 /**
2 * MltFilteredConsumer.cpp - MLT Wrapper
3 * Copyright (C) 2004-2015 Meltytech, LLC
4 * Author: Charles Yates <charles.yates@gmail.com>
5 *
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
10 *
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
15 *
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
19 */
20
21 #include "MltFilteredConsumer.h"
22 using namespace Mlt;
23
FilteredConsumer(Profile & profile,const char * id,const char * arg)24 FilteredConsumer::FilteredConsumer( Profile& profile, const char *id, const char *arg ) :
25 Consumer( profile, id, arg )
26 {
27 // Create a reference to the first service
28 first = new Service( *this );
29 }
30
FilteredConsumer(Consumer & consumer)31 FilteredConsumer::FilteredConsumer( Consumer &consumer ) :
32 Consumer( consumer )
33 {
34 // Create a reference to the first service
35 first = new Service( *this );
36 }
37
~FilteredConsumer()38 FilteredConsumer::~FilteredConsumer( )
39 {
40 // Delete the reference to the first service
41 delete first;
42 }
43
connect(Service & service)44 int FilteredConsumer::connect( Service &service )
45 {
46 // All producers must connect to the first service, hence the use of the virtual here
47 return first->connect_producer( service );
48 }
49
attach(Filter & filter)50 int FilteredConsumer::attach( Filter &filter )
51 {
52 int error = 0;
53 if ( filter.is_valid( ) )
54 {
55 Service *producer = first->producer( );
56 error = filter.connect( *producer );
57 if ( error == 0 )
58 {
59 first->connect_producer( filter );
60 delete first;
61 first = new Service( filter );
62 }
63 delete producer;
64 }
65 else
66 {
67 error = 1;
68 }
69 return error;
70 }
71
last(Filter & filter)72 int FilteredConsumer::last( Filter &filter )
73 {
74 int error = 0;
75 if ( filter.is_valid( ) )
76 {
77 Service *producer = this->producer( );
78 error = filter.connect( *producer );
79 if ( error == 0 )
80 connect_producer( filter );
81 delete producer;
82 }
83 else
84 {
85 error = 1;
86 }
87 return error;
88 }
89
detach(Filter & filter)90 int FilteredConsumer::detach( Filter &filter )
91 {
92 if ( filter.is_valid( ) )
93 {
94 Service *it = new Service( *first );
95 while ( it->is_valid( ) && it->get_service( ) != filter.get_service( ) )
96 {
97 Service *consumer = it->consumer( );
98 delete it;
99 it = consumer;
100 }
101 if ( it->get_service( ) == filter.get_service( ) )
102 {
103 Service *producer = it->producer( );
104 Service *consumer = it->consumer( );
105 consumer->connect_producer( *producer );
106 Service dummy( NULL );
107 it->connect_producer( dummy );
108 if ( first->get_service( ) == it->get_service( ) )
109 {
110 delete first;
111 first = new Service( *consumer );
112 }
113 }
114 delete it;
115 }
116 return 0;
117 }
118
119