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.

91 lines
2.6KB

  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. typedef struct AVFilterGraph {
  25. unsigned filter_count;
  26. AVFilterContext **filters;
  27. char *scale_sws_opts; ///< sws options to use for the auto-inserted scale filters
  28. } AVFilterGraph;
  29. /**
  30. * Allocate a filter graph.
  31. */
  32. AVFilterGraph *avfilter_graph_alloc(void);
  33. /**
  34. * Get a filter instance with name name from graph.
  35. *
  36. * @return the pointer to the found filter instance or NULL if it
  37. * cannot be found.
  38. */
  39. AVFilterContext *avfilter_graph_get_filter(AVFilterGraph *graph, char *name);
  40. /**
  41. * Add an existing filter instance to a filter graph.
  42. *
  43. * @param graphctx the filter graph
  44. * @param filter the filter to be added
  45. */
  46. int avfilter_graph_add_filter(AVFilterGraph *graphctx, AVFilterContext *filter);
  47. /**
  48. * Check for the validity of graph.
  49. *
  50. * A graph is considered valid if all its input and output pads are
  51. * connected.
  52. *
  53. * @return 0 in case of success, a negative value otherwise
  54. */
  55. int avfilter_graph_check_validity(AVFilterGraph *graphctx, AVClass *log_ctx);
  56. /**
  57. * Configure all the links of graphctx.
  58. *
  59. * @return 0 in case of success, a negative value otherwise
  60. */
  61. int avfilter_graph_config_links(AVFilterGraph *graphctx, AVClass *log_ctx);
  62. /**
  63. * Configure the formats of all the links in the graph.
  64. */
  65. int avfilter_graph_config_formats(AVFilterGraph *graphctx, AVClass *log_ctx);
  66. /**
  67. * Check validity and configure all the links and formats in the graph.
  68. *
  69. * @see avfilter_graph_check_validity(), avfilter_graph_config_links(),
  70. * avfilter_graph_config_formats()
  71. */
  72. int avfilter_graph_config(AVFilterGraph *graphctx, AVClass *log_ctx);
  73. /**
  74. * Free a graph and destroy its links.
  75. */
  76. void avfilter_graph_free(AVFilterGraph *graph);
  77. #endif /* AVFILTER_AVFILTERGRAPH_H */