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.

183 lines
6.6KB

  1. /*
  2. * Filter graphs
  3. * copyright (c) 2007 Bobby Bingham
  4. *
  5. * This file is part of Libav.
  6. *
  7. * Libav 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. * Libav 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 Libav; 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;
  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. } AVFilterGraph;
  41. /**
  42. * Allocate a filter graph.
  43. */
  44. AVFilterGraph *avfilter_graph_alloc(void);
  45. /**
  46. * Get a filter instance with name name from graph.
  47. *
  48. * @return the pointer to the found filter instance or NULL if it
  49. * cannot be found.
  50. */
  51. AVFilterContext *avfilter_graph_get_filter(AVFilterGraph *graph, char *name);
  52. /**
  53. * Add an existing filter instance to a filter graph.
  54. *
  55. * @param graphctx the filter graph
  56. * @param filter the filter to be added
  57. */
  58. int avfilter_graph_add_filter(AVFilterGraph *graphctx, AVFilterContext *filter);
  59. /**
  60. * Create and add a filter instance into an existing graph.
  61. * The filter instance is created from the filter filt and inited
  62. * with the parameters args and opaque.
  63. *
  64. * In case of success put in *filt_ctx the pointer to the created
  65. * filter instance, otherwise set *filt_ctx to NULL.
  66. *
  67. * @param name the instance name to give to the created filter instance
  68. * @param graph_ctx the filter graph
  69. * @return a negative AVERROR error code in case of failure, a non
  70. * negative value otherwise
  71. */
  72. int avfilter_graph_create_filter(AVFilterContext **filt_ctx, AVFilter *filt,
  73. const char *name, const char *args, void *opaque,
  74. AVFilterGraph *graph_ctx);
  75. /**
  76. * Check validity and configure all the links and formats in the graph.
  77. *
  78. * @param graphctx the filter graph
  79. * @param log_ctx context used for logging
  80. * @return 0 in case of success, a negative AVERROR code otherwise
  81. */
  82. int avfilter_graph_config(AVFilterGraph *graphctx, void *log_ctx);
  83. /**
  84. * Free a graph, destroy its links, and set *graph to NULL.
  85. * If *graph is NULL, do nothing.
  86. */
  87. void avfilter_graph_free(AVFilterGraph **graph);
  88. /**
  89. * A linked-list of the inputs/outputs of the filter chain.
  90. *
  91. * This is mainly useful for avfilter_graph_parse() / avfilter_graph_parse2(),
  92. * where it is used to communicate open (unlinked) inputs and outputs from and
  93. * to the caller.
  94. * This struct specifies, per each not connected pad contained in the graph, the
  95. * filter context and the pad index required for establishing a link.
  96. */
  97. typedef struct AVFilterInOut {
  98. /** unique name for this input/output in the list */
  99. char *name;
  100. /** filter context associated to this input/output */
  101. AVFilterContext *filter_ctx;
  102. /** index of the filt_ctx pad to use for linking */
  103. int pad_idx;
  104. /** next input/input in the list, NULL if this is the last */
  105. struct AVFilterInOut *next;
  106. } AVFilterInOut;
  107. /**
  108. * Allocate a single AVFilterInOut entry.
  109. * Must be freed with avfilter_inout_free().
  110. * @return allocated AVFilterInOut on success, NULL on failure.
  111. */
  112. AVFilterInOut *avfilter_inout_alloc(void);
  113. /**
  114. * Free the supplied list of AVFilterInOut and set *inout to NULL.
  115. * If *inout is NULL, do nothing.
  116. */
  117. void avfilter_inout_free(AVFilterInOut **inout);
  118. /**
  119. * Add a graph described by a string to a graph.
  120. *
  121. * @param graph the filter graph where to link the parsed graph context
  122. * @param filters string to be parsed
  123. * @param inputs linked list to the inputs of the graph
  124. * @param outputs linked list to the outputs of the graph
  125. * @return zero on success, a negative AVERROR code on error
  126. */
  127. int avfilter_graph_parse(AVFilterGraph *graph, const char *filters,
  128. AVFilterInOut *inputs, AVFilterInOut *outputs,
  129. void *log_ctx);
  130. /**
  131. * Add a graph described by a string to a graph.
  132. *
  133. * @param[in] graph the filter graph where to link the parsed graph context
  134. * @param[in] filters string to be parsed
  135. * @param[out] inputs a linked list of all free (unlinked) inputs of the
  136. * parsed graph will be returned here. It is to be freed
  137. * by the caller using avfilter_inout_free().
  138. * @param[out] outputs a linked list of all free (unlinked) outputs of the
  139. * parsed graph will be returned here. It is to be freed by the
  140. * caller using avfilter_inout_free().
  141. * @return zero on success, a negative AVERROR code on error
  142. *
  143. * @note the difference between avfilter_graph_parse2() and
  144. * avfilter_graph_parse() is that in avfilter_graph_parse(), the caller provides
  145. * the lists of inputs and outputs, which therefore must be known before calling
  146. * the function. On the other hand, avfilter_graph_parse2() \em returns the
  147. * inputs and outputs that are left unlinked after parsing the graph and the
  148. * caller then deals with them. Another difference is that in
  149. * avfilter_graph_parse(), the inputs parameter describes inputs of the
  150. * <em>already existing</em> part of the graph; i.e. from the point of view of
  151. * the newly created part, they are outputs. Similarly the outputs parameter
  152. * describes outputs of the already existing filters, which are provided as
  153. * inputs to the parsed filters.
  154. * avfilter_graph_parse2() takes the opposite approach -- it makes no reference
  155. * whatsoever to already existing parts of the graph and the inputs parameter
  156. * will on return contain inputs of the newly parsed part of the graph.
  157. * Analogously the outputs parameter will contain outputs of the newly created
  158. * filters.
  159. */
  160. int avfilter_graph_parse2(AVFilterGraph *graph, const char *filters,
  161. AVFilterInOut **inputs,
  162. AVFilterInOut **outputs);
  163. #endif /* AVFILTER_AVFILTERGRAPH_H */