2008-04-04 20:02:10 +00:00
|
|
|
/*
|
|
|
|
* Filter graphs
|
|
|
|
* copyright (c) 2007 Bobby Bingham
|
|
|
|
*
|
2011-03-18 17:35:10 +00:00
|
|
|
* This file is part of Libav.
|
2008-04-04 20:02:10 +00:00
|
|
|
*
|
2011-03-18 17:35:10 +00:00
|
|
|
* Libav is free software; you can redistribute it and/or
|
2008-04-04 20:02:10 +00:00
|
|
|
* 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.
|
|
|
|
*
|
2011-03-18 17:35:10 +00:00
|
|
|
* Libav is distributed in the hope that it will be useful,
|
2008-04-04 20:02:10 +00:00
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* 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 Lesser General Public
|
2011-03-18 17:35:10 +00:00
|
|
|
* License along with Libav; if not, write to the Free Software
|
2008-04-04 20:02:10 +00:00
|
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
*/
|
|
|
|
|
2008-08-31 07:39:47 +00:00
|
|
|
#ifndef AVFILTER_AVFILTERGRAPH_H
|
|
|
|
#define AVFILTER_AVFILTERGRAPH_H
|
2008-04-04 20:02:10 +00:00
|
|
|
|
|
|
|
#include "avfilter.h"
|
|
|
|
|
2008-04-04 20:08:49 +00:00
|
|
|
typedef struct AVFilterGraph {
|
|
|
|
unsigned filter_count;
|
|
|
|
AVFilterContext **filters;
|
2009-02-23 23:45:21 +00:00
|
|
|
|
|
|
|
char *scale_sws_opts; ///< sws options to use for the auto-inserted scale filters
|
2008-04-04 20:08:56 +00:00
|
|
|
} AVFilterGraph;
|
2008-04-04 20:08:31 +00:00
|
|
|
|
2010-11-04 20:34:19 +00:00
|
|
|
/**
|
|
|
|
* Allocate a filter graph.
|
|
|
|
*/
|
|
|
|
AVFilterGraph *avfilter_graph_alloc(void);
|
|
|
|
|
2008-04-04 20:07:54 +00:00
|
|
|
/**
|
2010-06-30 15:38:06 +00:00
|
|
|
* Get a filter instance with name name from graph.
|
2008-12-26 22:25:47 +00:00
|
|
|
*
|
|
|
|
* @return the pointer to the found filter instance or NULL if it
|
|
|
|
* cannot be found.
|
2008-04-04 20:07:54 +00:00
|
|
|
*/
|
2008-04-04 20:09:27 +00:00
|
|
|
AVFilterContext *avfilter_graph_get_filter(AVFilterGraph *graph, char *name);
|
2008-04-04 20:07:54 +00:00
|
|
|
|
2008-04-04 20:02:10 +00:00
|
|
|
/**
|
2010-06-30 15:38:06 +00:00
|
|
|
* Add an existing filter instance to a filter graph.
|
2010-04-11 21:26:00 +00:00
|
|
|
*
|
2010-07-02 10:49:29 +00:00
|
|
|
* @param graphctx the filter graph
|
2010-04-11 21:26:00 +00:00
|
|
|
* @param filter the filter to be added
|
2008-04-04 20:02:10 +00:00
|
|
|
*/
|
2008-04-04 20:09:47 +00:00
|
|
|
int avfilter_graph_add_filter(AVFilterGraph *graphctx, AVFilterContext *filter);
|
2008-04-04 20:02:10 +00:00
|
|
|
|
2010-12-02 20:12:27 +00:00
|
|
|
/**
|
|
|
|
* Create and add a filter instance into an existing graph.
|
|
|
|
* The filter instance is created from the filter filt and inited
|
|
|
|
* with the parameters args and opaque.
|
|
|
|
*
|
|
|
|
* In case of success put in *filt_ctx the pointer to the created
|
|
|
|
* filter instance, otherwise set *filt_ctx to NULL.
|
|
|
|
*
|
|
|
|
* @param name the instance name to give to the created filter instance
|
|
|
|
* @param graph_ctx the filter graph
|
|
|
|
* @return a negative AVERROR error code in case of failure, a non
|
|
|
|
* negative value otherwise
|
|
|
|
*/
|
|
|
|
int avfilter_graph_create_filter(AVFilterContext **filt_ctx, AVFilter *filt,
|
|
|
|
const char *name, const char *args, void *opaque,
|
|
|
|
AVFilterGraph *graph_ctx);
|
|
|
|
|
2010-10-16 10:20:53 +00:00
|
|
|
/**
|
|
|
|
* Check validity and configure all the links and formats in the graph.
|
|
|
|
*
|
2010-11-13 00:21:28 +00:00
|
|
|
* @param graphctx the filter graph
|
|
|
|
* @param log_ctx context used for logging
|
|
|
|
* @return 0 in case of success, a negative AVERROR code otherwise
|
2010-10-16 10:20:53 +00:00
|
|
|
*/
|
2011-06-11 09:41:49 +00:00
|
|
|
int avfilter_graph_config(AVFilterGraph *graphctx, void *log_ctx);
|
2010-10-16 10:20:53 +00:00
|
|
|
|
2008-04-04 20:09:14 +00:00
|
|
|
/**
|
2011-02-01 19:02:17 +00:00
|
|
|
* Free a graph, destroy its links, and set *graph to NULL.
|
|
|
|
* If *graph is NULL, do nothing.
|
2008-04-04 20:09:14 +00:00
|
|
|
*/
|
2011-02-01 19:02:17 +00:00
|
|
|
void avfilter_graph_free(AVFilterGraph **graph);
|
2008-04-04 20:09:14 +00:00
|
|
|
|
2010-11-07 22:56:29 +00:00
|
|
|
/**
|
|
|
|
* A linked-list of the inputs/outputs of the filter chain.
|
|
|
|
*
|
|
|
|
* This is mainly useful for avfilter_graph_parse(), since this
|
|
|
|
* function may accept a description of a graph with not connected
|
|
|
|
* input/output pads. This struct specifies, per each not connected
|
|
|
|
* pad contained in the graph, the filter context and the pad index
|
|
|
|
* required for establishing a link.
|
|
|
|
*/
|
|
|
|
typedef struct AVFilterInOut {
|
|
|
|
/** unique name for this input/output in the list */
|
|
|
|
char *name;
|
|
|
|
|
|
|
|
/** filter context associated to this input/output */
|
|
|
|
AVFilterContext *filter_ctx;
|
|
|
|
|
|
|
|
/** index of the filt_ctx pad to use for linking */
|
|
|
|
int pad_idx;
|
|
|
|
|
|
|
|
/** next input/input in the list, NULL if this is the last */
|
|
|
|
struct AVFilterInOut *next;
|
|
|
|
} AVFilterInOut;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Add a graph described by a string to a graph.
|
|
|
|
*
|
|
|
|
* @param graph the filter graph where to link the parsed graph context
|
|
|
|
* @param filters string to be parsed
|
|
|
|
* @param inputs linked list to the inputs of the graph
|
|
|
|
* @param outputs linked list to the outputs of the graph
|
|
|
|
* @return zero on success, a negative AVERROR code on error
|
|
|
|
*/
|
|
|
|
int avfilter_graph_parse(AVFilterGraph *graph, const char *filters,
|
|
|
|
AVFilterInOut *inputs, AVFilterInOut *outputs,
|
2011-06-11 09:41:49 +00:00
|
|
|
void *log_ctx);
|
2010-11-07 22:56:29 +00:00
|
|
|
|
2011-05-17 14:58:04 +00:00
|
|
|
#endif /* AVFILTER_AVFILTERGRAPH_H */
|