avfiltergraph.h 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269
  1. /*
  2. * Filter graphs
  3. * copyright (c) 2007 Bobby Bingham
  4. *
  5. * This file is part of FFmpeg.
  6. *
  7. * FFmpeg 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.
  11. *
  12. * FFmpeg 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.
  16. *
  17. * You should have received a copy of the GNU Lesser General Public
  18. * License along with FFmpeg; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. */
  21. #ifndef AVFILTER_AVFILTERGRAPH_H
  22. #define AVFILTER_AVFILTERGRAPH_H
  23. #include "avfilter.h"
  24. #include "libavutil/log.h"
  25. typedef struct AVFilterGraph {
  26. const AVClass *av_class;
  27. unsigned filter_count;
  28. AVFilterContext **filters;
  29. char *scale_sws_opts; ///< sws options to use for the auto-inserted scale filters
  30. /**
  31. * Private fields
  32. *
  33. * The following fields are for internal use only.
  34. * Their type, offset, number and semantic can change without notice.
  35. */
  36. AVFilterLink **sink_links;
  37. int sink_links_count;
  38. unsigned disable_auto_convert;
  39. } AVFilterGraph;
  40. /**
  41. * Allocate a filter graph.
  42. */
  43. AVFilterGraph *avfilter_graph_alloc(void);
  44. /**
  45. * Get a filter instance with name name from graph.
  46. *
  47. * @return the pointer to the found filter instance or NULL if it
  48. * cannot be found.
  49. */
  50. AVFilterContext *avfilter_graph_get_filter(AVFilterGraph *graph, char *name);
  51. /**
  52. * Add an existing filter instance to a filter graph.
  53. *
  54. * @param graphctx the filter graph
  55. * @param filter the filter to be added
  56. */
  57. int avfilter_graph_add_filter(AVFilterGraph *graphctx, AVFilterContext *filter);
  58. /**
  59. * Create and add a filter instance into an existing graph.
  60. * The filter instance is created from the filter filt and inited
  61. * with the parameters args and opaque.
  62. *
  63. * In case of success put in *filt_ctx the pointer to the created
  64. * filter instance, otherwise set *filt_ctx to NULL.
  65. *
  66. * @param name the instance name to give to the created filter instance
  67. * @param graph_ctx the filter graph
  68. * @return a negative AVERROR error code in case of failure, a non
  69. * negative value otherwise
  70. */
  71. int avfilter_graph_create_filter(AVFilterContext **filt_ctx, AVFilter *filt,
  72. const char *name, const char *args, void *opaque,
  73. AVFilterGraph *graph_ctx);
  74. /**
  75. * Enable or disable automatic format conversion inside the graph.
  76. *
  77. * Note that format conversion can still happen inside explicitly inserted
  78. * scale and aconvert filters.
  79. *
  80. * @param flags any of the AVFILTER_AUTO_CONVERT_* constants
  81. */
  82. void avfilter_graph_set_auto_convert(AVFilterGraph *graph, unsigned flags);
  83. enum {
  84. AVFILTER_AUTO_CONVERT_ALL = 0, /**< all automatic conversions enabled */
  85. AVFILTER_AUTO_CONVERT_NONE = -1, /**< all automatic conversions disabled */
  86. };
  87. /**
  88. * Check validity and configure all the links and formats in the graph.
  89. *
  90. * @param graphctx the filter graph
  91. * @param log_ctx context used for logging
  92. * @return 0 in case of success, a negative AVERROR code otherwise
  93. */
  94. int avfilter_graph_config(AVFilterGraph *graphctx, void *log_ctx);
  95. /**
  96. * Free a graph, destroy its links, and set *graph to NULL.
  97. * If *graph is NULL, do nothing.
  98. */
  99. void avfilter_graph_free(AVFilterGraph **graph);
  100. /**
  101. * A linked-list of the inputs/outputs of the filter chain.
  102. *
  103. * This is mainly useful for avfilter_graph_parse() / avfilter_graph_parse2(),
  104. * where it is used to communicate open (unlinked) inputs and outputs from and
  105. * to the caller.
  106. * This struct specifies, per each not connected pad contained in the graph, the
  107. * filter context and the pad index required for establishing a link.
  108. */
  109. typedef struct AVFilterInOut {
  110. /** unique name for this input/output in the list */
  111. char *name;
  112. /** filter context associated to this input/output */
  113. AVFilterContext *filter_ctx;
  114. /** index of the filt_ctx pad to use for linking */
  115. int pad_idx;
  116. /** next input/input in the list, NULL if this is the last */
  117. struct AVFilterInOut *next;
  118. } AVFilterInOut;
  119. /**
  120. * Allocate a single AVFilterInOut entry.
  121. * Must be freed with avfilter_inout_free().
  122. * @return allocated AVFilterInOut on success, NULL on failure.
  123. */
  124. AVFilterInOut *avfilter_inout_alloc(void);
  125. /**
  126. * Free the supplied list of AVFilterInOut and set *inout to NULL.
  127. * If *inout is NULL, do nothing.
  128. */
  129. void avfilter_inout_free(AVFilterInOut **inout);
  130. /**
  131. * Add a graph described by a string to a graph.
  132. *
  133. * @param graph the filter graph where to link the parsed graph context
  134. * @param filters string to be parsed
  135. * @param inputs pointer to a linked list to the inputs of the graph, may be NULL.
  136. * If non-NULL, *inputs is updated to contain the list of open inputs
  137. * after the parsing, should be freed with avfilter_inout_free().
  138. * @param outputs pointer to a linked list to the outputs of the graph, may be NULL.
  139. * If non-NULL, *outputs is updated to contain the list of open outputs
  140. * after the parsing, should be freed with avfilter_inout_free().
  141. * @return non negative on success, a negative AVERROR code on error
  142. */
  143. int avfilter_graph_parse(AVFilterGraph *graph, const char *filters,
  144. AVFilterInOut **inputs, AVFilterInOut **outputs,
  145. void *log_ctx);
  146. /**
  147. * Add a graph described by a string to a graph.
  148. *
  149. * @param[in] graph the filter graph where to link the parsed graph context
  150. * @param[in] filters string to be parsed
  151. * @param[out] inputs a linked list of all free (unlinked) inputs of the
  152. * parsed graph will be returned here. It is to be freed
  153. * by the caller using avfilter_inout_free().
  154. * @param[out] outputs a linked list of all free (unlinked) outputs of the
  155. * parsed graph will be returned here. It is to be freed by the
  156. * caller using avfilter_inout_free().
  157. * @return zero on success, a negative AVERROR code on error
  158. *
  159. * @note the difference between avfilter_graph_parse2() and
  160. * avfilter_graph_parse() is that in avfilter_graph_parse(), the caller provides
  161. * the lists of inputs and outputs, which therefore must be known before calling
  162. * the function. On the other hand, avfilter_graph_parse2() \em returns the
  163. * inputs and outputs that are left unlinked after parsing the graph and the
  164. * caller then deals with them. Another difference is that in
  165. * avfilter_graph_parse(), the inputs parameter describes inputs of the
  166. * <em>already existing</em> part of the graph; i.e. from the point of view of
  167. * the newly created part, they are outputs. Similarly the outputs parameter
  168. * describes outputs of the already existing filters, which are provided as
  169. * inputs to the parsed filters.
  170. * avfilter_graph_parse2() takes the opposite approach -- it makes no reference
  171. * whatsoever to already existing parts of the graph and the inputs parameter
  172. * will on return contain inputs of the newly parsed part of the graph.
  173. * Analogously the outputs parameter will contain outputs of the newly created
  174. * filters.
  175. */
  176. int avfilter_graph_parse2(AVFilterGraph *graph, const char *filters,
  177. AVFilterInOut **inputs,
  178. AVFilterInOut **outputs);
  179. /**
  180. * Send a command to one or more filter instances.
  181. *
  182. * @param graph the filter graph
  183. * @param target the filter(s) to which the command should be sent
  184. * "all" sends to all filters
  185. * otherwise it can be a filter or filter instance name
  186. * which will send the command to all matching filters.
  187. * @param cmd the command to sent, for handling simplicity all commands must be alphanumeric only
  188. * @param arg the argument for the command
  189. * @param res a buffer with size res_size where the filter(s) can return a response.
  190. *
  191. * @returns >=0 on success otherwise an error code.
  192. * AVERROR(ENOSYS) on unsupported commands
  193. */
  194. int avfilter_graph_send_command(AVFilterGraph *graph, const char *target, const char *cmd, const char *arg, char *res, int res_len, int flags);
  195. /**
  196. * Queue a command for one or more filter instances.
  197. *
  198. * @param graph the filter graph
  199. * @param target the filter(s) to which the command should be sent
  200. * "all" sends to all filters
  201. * otherwise it can be a filter or filter instance name
  202. * which will send the command to all matching filters.
  203. * @param cmd the command to sent, for handling simplicity all commands must be alphanummeric only
  204. * @param arg the argument for the command
  205. * @param ts time at which the command should be sent to the filter
  206. *
  207. * @note As this executes commands after this function returns, no return code
  208. * from the filter is provided, also AVFILTER_CMD_FLAG_ONE is not supported.
  209. */
  210. int avfilter_graph_queue_command(AVFilterGraph *graph, const char *target, const char *cmd, const char *arg, int flags, double ts);
  211. /**
  212. * Dump a graph into a human-readable string representation.
  213. *
  214. * @param graph the graph to dump
  215. * @param options formatting options; currently ignored
  216. * @return a string, or NULL in case of memory allocation failure;
  217. * the string must be freed using av_free
  218. */
  219. char *avfilter_graph_dump(AVFilterGraph *graph, const char *options);
  220. /**
  221. * Request a frame on the oldest sink link.
  222. *
  223. * If the request returns AVERROR_EOF, try the next.
  224. *
  225. * Note that this function is not meant to be the sole scheduling mechanism
  226. * of a filtergraph, only a convenience function to help drain a filtergraph
  227. * in a balanced way under normal circumstances.
  228. *
  229. * Also note that AVERROR_EOF does not mean that frames did not arrive on
  230. * some of the sinks during the process.
  231. * When there are multiple sink links, in case the requested link
  232. * returns an EOF, this may cause a filter to flush pending frames
  233. * which are sent to another sink link, although unrequested.
  234. *
  235. * @return the return value of ff_request_frame(),
  236. * or AVERROR_EOF if all links returned AVERROR_EOF
  237. */
  238. int avfilter_graph_request_oldest(AVFilterGraph *graph);
  239. #endif /* AVFILTER_AVFILTERGRAPH_H */