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.

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