avfiltergraph.c 5.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184
  1. /*
  2. * filter graphs
  3. * copyright (c) 2008 Vitor Sessak
  4. * copyright (c) 2007 Bobby Bingham
  5. *
  6. * This file is part of FFmpeg.
  7. *
  8. * FFmpeg is free software; you can redistribute it and/or
  9. * modify it under the terms of the GNU Lesser General Public
  10. * License as published by the Free Software Foundation; either
  11. * version 2.1 of the License, or (at your option) any later version.
  12. *
  13. * FFmpeg is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  16. * Lesser General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU Lesser General Public
  19. * License along with FFmpeg; if not, write to the Free Software
  20. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  21. */
  22. #include <ctype.h>
  23. #include <string.h>
  24. #include "avfilter.h"
  25. #include "avfiltergraph.h"
  26. void avfilter_graph_destroy(AVFilterGraph *graph)
  27. {
  28. for(; graph->filter_count > 0; graph->filter_count --)
  29. avfilter_destroy(graph->filters[graph->filter_count - 1]);
  30. av_freep(&graph->scale_sws_opts);
  31. av_freep(&graph->filters);
  32. }
  33. int avfilter_graph_add_filter(AVFilterGraph *graph, AVFilterContext *filter)
  34. {
  35. graph->filters = av_realloc(graph->filters,
  36. sizeof(AVFilterContext*) * ++graph->filter_count);
  37. if (!graph->filters)
  38. return -1;
  39. graph->filters[graph->filter_count - 1] = filter;
  40. return 0;
  41. }
  42. int avfilter_graph_check_validity(AVFilterGraph *graph, AVClass *log_ctx)
  43. {
  44. AVFilterContext *filt;
  45. int i, j;
  46. for (i=0; i < graph->filter_count; i++) {
  47. filt = graph->filters[i];
  48. for (j = 0; j < filt->input_count; j++) {
  49. if (!filt->inputs[j] || !filt->inputs[j]->src) {
  50. av_log(log_ctx, AV_LOG_ERROR,
  51. "Input pad \"%s\" for the filter \"%s\" of type \"%s\" not connected to any source\n",
  52. filt->input_pads[j].name, filt->name, filt->filter->name);
  53. return -1;
  54. }
  55. }
  56. for (j = 0; j < filt->output_count; j++) {
  57. if (!filt->outputs[j] || !filt->outputs[j]->dst) {
  58. av_log(log_ctx, AV_LOG_ERROR,
  59. "Output pad \"%s\" for the filter \"%s\" of type \"%s\" not connected to any destination\n",
  60. filt->output_pads[j].name, filt->name, filt->filter->name);
  61. return -1;
  62. }
  63. }
  64. }
  65. return 0;
  66. }
  67. AVFilterContext *avfilter_graph_get_filter(AVFilterGraph *graph, char *name)
  68. {
  69. int i;
  70. for(i = 0; i < graph->filter_count; i ++)
  71. if(graph->filters[i]->name && !strcmp(name, graph->filters[i]->name))
  72. return graph->filters[i];
  73. return NULL;
  74. }
  75. static int query_formats(AVFilterGraph *graph)
  76. {
  77. int i, j;
  78. int scaler_count = 0;
  79. char inst_name[30];
  80. /* ask all the sub-filters for their supported colorspaces */
  81. for(i = 0; i < graph->filter_count; i ++) {
  82. if(graph->filters[i]->filter->query_formats)
  83. graph->filters[i]->filter->query_formats(graph->filters[i]);
  84. else
  85. avfilter_default_query_formats(graph->filters[i]);
  86. }
  87. /* go through and merge as many format lists as possible */
  88. for(i = 0; i < graph->filter_count; i ++) {
  89. AVFilterContext *filter = graph->filters[i];
  90. for(j = 0; j < filter->input_count; j ++) {
  91. AVFilterLink *link = filter->inputs[j];
  92. if(link && link->in_formats != link->out_formats) {
  93. if(!avfilter_merge_formats(link->in_formats,
  94. link->out_formats)) {
  95. AVFilterContext *scale;
  96. char scale_args[256];
  97. /* couldn't merge format lists. auto-insert scale filter */
  98. snprintf(inst_name, sizeof(inst_name), "auto-inserted scaler %d",
  99. scaler_count);
  100. scale =
  101. avfilter_open(avfilter_get_by_name("scale"),inst_name);
  102. snprintf(scale_args, sizeof(scale_args), "0:0:%s", graph->scale_sws_opts);
  103. if(!scale || scale->filter->init(scale, scale_args, NULL) ||
  104. avfilter_insert_filter(link, scale, 0, 0)) {
  105. avfilter_destroy(scale);
  106. return -1;
  107. }
  108. if (avfilter_graph_add_filter(graph, scale) < 0)
  109. return -1;
  110. scale->filter->query_formats(scale);
  111. if(!avfilter_merge_formats(scale-> inputs[0]->in_formats,
  112. scale-> inputs[0]->out_formats)||
  113. !avfilter_merge_formats(scale->outputs[0]->in_formats,
  114. scale->outputs[0]->out_formats))
  115. return -1;
  116. }
  117. }
  118. }
  119. }
  120. return 0;
  121. }
  122. static void pick_format(AVFilterLink *link)
  123. {
  124. if(!link || !link->in_formats)
  125. return;
  126. link->in_formats->format_count = 1;
  127. link->format = link->in_formats->formats[0];
  128. avfilter_formats_unref(&link->in_formats);
  129. avfilter_formats_unref(&link->out_formats);
  130. }
  131. static void pick_formats(AVFilterGraph *graph)
  132. {
  133. int i, j;
  134. for(i = 0; i < graph->filter_count; i ++) {
  135. AVFilterContext *filter = graph->filters[i];
  136. for(j = 0; j < filter->input_count; j ++)
  137. pick_format(filter->inputs[j]);
  138. for(j = 0; j < filter->output_count; j ++)
  139. pick_format(filter->outputs[j]);
  140. }
  141. }
  142. int avfilter_graph_config_formats(AVFilterGraph *graph)
  143. {
  144. /* find supported formats from sub-filters, and merge along links */
  145. if(query_formats(graph))
  146. return -1;
  147. /* Once everything is merged, it's possible that we'll still have
  148. * multiple valid colorspace choices. We pick the first one. */
  149. pick_formats(graph);
  150. return 0;
  151. }