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.

175 lines
6.4KB

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