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.

174 lines
6.5KB

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