You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

281 lines
11KB

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