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.

409 lines
12KB

  1. /*
  2. * filter graph parser
  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 "libavutil/avstring.h"
  25. #include "avfilter.h"
  26. #include "avfiltergraph.h"
  27. #define WHITESPACES " \n\t"
  28. /**
  29. * Link two filters together.
  30. *
  31. * @see avfilter_link()
  32. */
  33. static int link_filter(AVFilterContext *src, int srcpad,
  34. AVFilterContext *dst, int dstpad,
  35. void *log_ctx)
  36. {
  37. int ret;
  38. if ((ret = avfilter_link(src, srcpad, dst, dstpad))) {
  39. av_log(log_ctx, AV_LOG_ERROR,
  40. "Cannot create the link %s:%d -> %s:%d\n",
  41. src->filter->name, srcpad, dst->filter->name, dstpad);
  42. return ret;
  43. }
  44. return 0;
  45. }
  46. /**
  47. * Parse the name of a link, which has the format "[linkname]".
  48. *
  49. * @return a pointer (that need to be freed after use) to the name
  50. * between parenthesis
  51. */
  52. static char *parse_link_name(const char **buf, void *log_ctx)
  53. {
  54. const char *start = *buf;
  55. char *name;
  56. (*buf)++;
  57. name = av_get_token(buf, "]");
  58. if (!name[0]) {
  59. av_log(log_ctx, AV_LOG_ERROR,
  60. "Bad (empty?) label found in the following: \"%s\".\n", start);
  61. goto fail;
  62. }
  63. if (*(*buf)++ != ']') {
  64. av_log(log_ctx, AV_LOG_ERROR,
  65. "Mismatched '[' found in the following: \"%s\".\n", start);
  66. fail:
  67. av_freep(&name);
  68. }
  69. return name;
  70. }
  71. /**
  72. * Create an instance of a filter, initialize and insert it in the
  73. * filtergraph in *ctx.
  74. *
  75. * @param ctx the filtergraph context
  76. * @param put here a filter context in case of successful creation and configuration, NULL otherwise.
  77. * @param index an index which is supposed to be unique for each filter instance added to the filtergraph
  78. * @param filt_name the name of the filter to create
  79. * @param args the arguments provided to the filter during its initialization
  80. * @param log_ctx the log context to use
  81. * @return 0 in case of success, a negative AVERROR code otherwise
  82. */
  83. static int create_filter(AVFilterContext **filt_ctx, AVFilterGraph *ctx, int index,
  84. const char *filt_name, const char *args, void *log_ctx)
  85. {
  86. AVFilter *filt;
  87. char inst_name[30];
  88. char tmp_args[256];
  89. int ret;
  90. snprintf(inst_name, sizeof(inst_name), "Parsed filter %d %s", index, filt_name);
  91. filt = avfilter_get_by_name(filt_name);
  92. if (!filt) {
  93. av_log(log_ctx, AV_LOG_ERROR,
  94. "No such filter: '%s'\n", filt_name);
  95. return AVERROR(EINVAL);
  96. }
  97. ret = avfilter_open(filt_ctx, filt, inst_name);
  98. if (!*filt_ctx) {
  99. av_log(log_ctx, AV_LOG_ERROR,
  100. "Error creating filter '%s'\n", filt_name);
  101. return ret;
  102. }
  103. if ((ret = avfilter_graph_add_filter(ctx, *filt_ctx)) < 0) {
  104. avfilter_free(*filt_ctx);
  105. return ret;
  106. }
  107. if (!strcmp(filt_name, "scale") && args && !strstr(args, "flags")) {
  108. snprintf(tmp_args, sizeof(tmp_args), "%s:%s",
  109. args, ctx->scale_sws_opts);
  110. args = tmp_args;
  111. }
  112. if ((ret = avfilter_init_filter(*filt_ctx, args, NULL)) < 0) {
  113. av_log(log_ctx, AV_LOG_ERROR,
  114. "Error initializing filter '%s' with args '%s'\n", filt_name, args);
  115. return ret;
  116. }
  117. return 0;
  118. }
  119. /**
  120. * Parse a string of the form FILTER_NAME[=PARAMS], and create a
  121. * corresponding filter instance which is added to graph with
  122. * create_filter().
  123. *
  124. * @param filt_ctx put here a pointer to the created filter context on
  125. * success, NULL otherwise
  126. * @param buf pointer to the buffer to parse, *buf will be updated to
  127. * point to the char next after the parsed string
  128. * @param index an index which is assigned to the created filter
  129. * instance, and which is supposed to be unique for each filter
  130. * instance added to the filtergraph
  131. * @return 0 in case of success, a negative AVERROR code otherwise
  132. */
  133. static int parse_filter(AVFilterContext **filt_ctx, const char **buf, AVFilterGraph *graph,
  134. int index, void *log_ctx)
  135. {
  136. char *opts = NULL;
  137. char *name = av_get_token(buf, "=,;[\n");
  138. int ret;
  139. if (**buf == '=') {
  140. (*buf)++;
  141. opts = av_get_token(buf, "[],;\n");
  142. }
  143. ret = create_filter(filt_ctx, graph, index, name, opts, log_ctx);
  144. av_free(name);
  145. av_free(opts);
  146. return ret;
  147. }
  148. AVFilterInOut *avfilter_inout_alloc(void)
  149. {
  150. return av_mallocz(sizeof(AVFilterInOut));
  151. }
  152. void avfilter_inout_free(AVFilterInOut **inout)
  153. {
  154. while (*inout) {
  155. AVFilterInOut *next = (*inout)->next;
  156. av_freep(&(*inout)->name);
  157. av_freep(inout);
  158. *inout = next;
  159. }
  160. }
  161. static AVFilterInOut *extract_inout(const char *label, AVFilterInOut **links)
  162. {
  163. AVFilterInOut *ret;
  164. while (*links && strcmp((*links)->name, label))
  165. links = &((*links)->next);
  166. ret = *links;
  167. if (ret)
  168. *links = ret->next;
  169. return ret;
  170. }
  171. static void insert_inout(AVFilterInOut **inouts, AVFilterInOut *element)
  172. {
  173. element->next = *inouts;
  174. *inouts = element;
  175. }
  176. static int link_filter_inouts(AVFilterContext *filt_ctx,
  177. AVFilterInOut **curr_inputs,
  178. AVFilterInOut **open_inputs, void *log_ctx)
  179. {
  180. int pad = filt_ctx->input_count, ret;
  181. while (pad--) {
  182. AVFilterInOut *p = *curr_inputs;
  183. if (!p) {
  184. av_log(log_ctx, AV_LOG_ERROR,
  185. "Not enough inputs specified for the \"%s\" filter.\n",
  186. filt_ctx->filter->name);
  187. return AVERROR(EINVAL);
  188. }
  189. *curr_inputs = (*curr_inputs)->next;
  190. if (p->filter_ctx) {
  191. if ((ret = link_filter(p->filter_ctx, p->pad_idx, filt_ctx, pad, log_ctx)) < 0)
  192. return ret;
  193. av_free(p->name);
  194. av_free(p);
  195. } else {
  196. p->filter_ctx = filt_ctx;
  197. p->pad_idx = pad;
  198. insert_inout(open_inputs, p);
  199. }
  200. }
  201. if (*curr_inputs) {
  202. av_log(log_ctx, AV_LOG_ERROR,
  203. "Too many inputs specified for the \"%s\" filter.\n",
  204. filt_ctx->filter->name);
  205. return AVERROR(EINVAL);
  206. }
  207. pad = filt_ctx->output_count;
  208. while (pad--) {
  209. AVFilterInOut *currlinkn = av_mallocz(sizeof(AVFilterInOut));
  210. if (!currlinkn)
  211. return AVERROR(ENOMEM);
  212. currlinkn->filter_ctx = filt_ctx;
  213. currlinkn->pad_idx = pad;
  214. insert_inout(curr_inputs, currlinkn);
  215. }
  216. return 0;
  217. }
  218. static int parse_inputs(const char **buf, AVFilterInOut **curr_inputs,
  219. AVFilterInOut **open_outputs, void *log_ctx)
  220. {
  221. int pad = 0;
  222. while (**buf == '[') {
  223. char *name = parse_link_name(buf, log_ctx);
  224. AVFilterInOut *match;
  225. if (!name)
  226. return AVERROR(EINVAL);
  227. /* First check if the label is not in the open_outputs list */
  228. match = extract_inout(name, open_outputs);
  229. if (match) {
  230. av_free(name);
  231. } else {
  232. /* Not in the list, so add it as an input */
  233. if (!(match = av_mallocz(sizeof(AVFilterInOut))))
  234. return AVERROR(ENOMEM);
  235. match->name = name;
  236. match->pad_idx = pad;
  237. }
  238. insert_inout(curr_inputs, match);
  239. *buf += strspn(*buf, WHITESPACES);
  240. pad++;
  241. }
  242. return pad;
  243. }
  244. static int parse_outputs(const char **buf, AVFilterInOut **curr_inputs,
  245. AVFilterInOut **open_inputs,
  246. AVFilterInOut **open_outputs, void *log_ctx)
  247. {
  248. int ret, pad = 0;
  249. while (**buf == '[') {
  250. char *name = parse_link_name(buf, log_ctx);
  251. AVFilterInOut *match;
  252. AVFilterInOut *input = *curr_inputs;
  253. if (!input) {
  254. av_log(log_ctx, AV_LOG_ERROR,
  255. "No output pad can be associated to link label '%s'.\n",
  256. name);
  257. return AVERROR(EINVAL);
  258. }
  259. *curr_inputs = (*curr_inputs)->next;
  260. if (!name)
  261. return AVERROR(EINVAL);
  262. /* First check if the label is not in the open_inputs list */
  263. match = extract_inout(name, open_inputs);
  264. if (match) {
  265. if ((ret = link_filter(input->filter_ctx, input->pad_idx,
  266. match->filter_ctx, match->pad_idx, log_ctx)) < 0)
  267. return ret;
  268. av_free(match->name);
  269. av_free(name);
  270. av_free(match);
  271. av_free(input);
  272. } else {
  273. /* Not in the list, so add the first input as a open_output */
  274. input->name = name;
  275. insert_inout(open_outputs, input);
  276. }
  277. *buf += strspn(*buf, WHITESPACES);
  278. pad++;
  279. }
  280. return pad;
  281. }
  282. int avfilter_graph_parse(AVFilterGraph *graph, const char *filters,
  283. AVFilterInOut **open_inputs, AVFilterInOut **open_outputs,
  284. void *log_ctx)
  285. {
  286. int index = 0, ret;
  287. char chr = 0;
  288. AVFilterInOut *curr_inputs = NULL;
  289. do {
  290. AVFilterContext *filter;
  291. const char *filterchain = filters;
  292. filters += strspn(filters, WHITESPACES);
  293. if ((ret = parse_inputs(&filters, &curr_inputs, open_outputs, log_ctx)) < 0)
  294. goto fail;
  295. if ((ret = parse_filter(&filter, &filters, graph, index, log_ctx)) < 0)
  296. goto fail;
  297. if (filter->input_count == 1 && !curr_inputs && !index) {
  298. /* First input can be omitted if it is "[in]" */
  299. const char *tmp = "[in]";
  300. if ((ret = parse_inputs(&tmp, &curr_inputs, open_outputs, log_ctx)) < 0)
  301. goto fail;
  302. }
  303. if ((ret = link_filter_inouts(filter, &curr_inputs, open_inputs, log_ctx)) < 0)
  304. goto fail;
  305. if ((ret = parse_outputs(&filters, &curr_inputs, open_inputs, open_outputs,
  306. log_ctx)) < 0)
  307. goto fail;
  308. filters += strspn(filters, WHITESPACES);
  309. chr = *filters++;
  310. if (chr == ';' && curr_inputs) {
  311. av_log(log_ctx, AV_LOG_ERROR,
  312. "Invalid filterchain containing an unlabelled output pad: \"%s\"\n",
  313. filterchain);
  314. ret = AVERROR(EINVAL);
  315. goto fail;
  316. }
  317. index++;
  318. } while (chr == ',' || chr == ';');
  319. if (chr) {
  320. av_log(log_ctx, AV_LOG_ERROR,
  321. "Unable to parse graph description substring: \"%s\"\n",
  322. filters - 1);
  323. ret = AVERROR(EINVAL);
  324. goto fail;
  325. }
  326. if (open_inputs && *open_inputs && !strcmp((*open_inputs)->name, "out") && curr_inputs) {
  327. /* Last output can be omitted if it is "[out]" */
  328. const char *tmp = "[out]";
  329. if ((ret = parse_outputs(&tmp, &curr_inputs, open_inputs, open_outputs,
  330. log_ctx)) < 0)
  331. goto fail;
  332. }
  333. return 0;
  334. fail:
  335. for (; graph->filter_count > 0; graph->filter_count--)
  336. avfilter_free(graph->filters[graph->filter_count - 1]);
  337. av_freep(&graph->filters);
  338. avfilter_inout_free(open_inputs);
  339. avfilter_inout_free(open_outputs);
  340. avfilter_inout_free(&curr_inputs);
  341. return ret;
  342. }