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.

513 lines
14KB

  1. /*
  2. * filter graph parser
  3. * Copyright (c) 2008 Vitor Sessak
  4. * Copyright (c) 2007 Bobby Bingham
  5. *
  6. * This file is part of Libav.
  7. *
  8. * Libav 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. * Libav 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 Libav; if not, write to the Free Software
  20. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  21. */
  22. #include <string.h>
  23. #include <stdio.h>
  24. #include "libavutil/avstring.h"
  25. #include "libavutil/mem.h"
  26. #include "avfilter.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 filt_ctx put here a filter context in case of successful creation and configuration, NULL otherwise.
  76. * @param ctx the filtergraph context
  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. *filt_ctx = avfilter_graph_alloc_filter(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 AVERROR(ENOMEM);
  102. }
  103. if (!strcmp(filt_name, "scale") && args && !strstr(args, "flags") &&
  104. ctx->scale_sws_opts) {
  105. snprintf(tmp_args, sizeof(tmp_args), "%s:%s",
  106. args, ctx->scale_sws_opts);
  107. args = tmp_args;
  108. }
  109. ret = avfilter_init_str(*filt_ctx, args);
  110. if (ret < 0) {
  111. av_log(log_ctx, AV_LOG_ERROR,
  112. "Error initializing filter '%s'", filt_name);
  113. if (args)
  114. av_log(log_ctx, AV_LOG_ERROR, " with args '%s'", args);
  115. av_log(log_ctx, AV_LOG_ERROR, "\n");
  116. avfilter_free(*filt_ctx);
  117. return ret;
  118. }
  119. return 0;
  120. }
  121. /**
  122. * Parse a string of the form FILTER_NAME[=PARAMS], and create a
  123. * corresponding filter instance which is added to graph with
  124. * create_filter().
  125. *
  126. * @param filt_ctx Pointer that is set to the created and configured filter
  127. * context on success, set to NULL on failure.
  128. * @param filt_ctx put here a pointer to the created filter context on
  129. * success, NULL otherwise
  130. * @param buf pointer to the buffer to parse, *buf will be updated to
  131. * point to the char next after the parsed string
  132. * @param index an index which is assigned to the created filter
  133. * instance, and which is supposed to be unique for each filter
  134. * instance added to the filtergraph
  135. * @return 0 in case of success, a negative AVERROR code otherwise
  136. */
  137. static int parse_filter(AVFilterContext **filt_ctx, const char **buf, AVFilterGraph *graph,
  138. int index, void *log_ctx)
  139. {
  140. char *opts = NULL;
  141. char *name = av_get_token(buf, "=,;[\n");
  142. int ret;
  143. if (**buf == '=') {
  144. (*buf)++;
  145. opts = av_get_token(buf, "[],;\n");
  146. }
  147. ret = create_filter(filt_ctx, graph, index, name, opts, log_ctx);
  148. av_free(name);
  149. av_free(opts);
  150. return ret;
  151. }
  152. AVFilterInOut *avfilter_inout_alloc(void)
  153. {
  154. return av_mallocz(sizeof(AVFilterInOut));
  155. }
  156. void avfilter_inout_free(AVFilterInOut **inout)
  157. {
  158. while (*inout) {
  159. AVFilterInOut *next = (*inout)->next;
  160. av_freep(&(*inout)->name);
  161. av_freep(inout);
  162. *inout = next;
  163. }
  164. }
  165. static AVFilterInOut *extract_inout(const char *label, AVFilterInOut **links)
  166. {
  167. AVFilterInOut *ret;
  168. while (*links && (!(*links)->name || strcmp((*links)->name, label)))
  169. links = &((*links)->next);
  170. ret = *links;
  171. if (ret) {
  172. *links = ret->next;
  173. ret->next = NULL;
  174. }
  175. return ret;
  176. }
  177. static void insert_inout(AVFilterInOut **inouts, AVFilterInOut *element)
  178. {
  179. element->next = *inouts;
  180. *inouts = element;
  181. }
  182. static void append_inout(AVFilterInOut **inouts, AVFilterInOut **element)
  183. {
  184. while (*inouts && (*inouts)->next)
  185. inouts = &((*inouts)->next);
  186. if (!*inouts)
  187. *inouts = *element;
  188. else
  189. (*inouts)->next = *element;
  190. *element = NULL;
  191. }
  192. static int link_filter_inouts(AVFilterContext *filt_ctx,
  193. AVFilterInOut **curr_inputs,
  194. AVFilterInOut **open_inputs, void *log_ctx)
  195. {
  196. int pad, ret;
  197. for (pad = 0; pad < filt_ctx->nb_inputs; pad++) {
  198. AVFilterInOut *p = *curr_inputs;
  199. if (p) {
  200. *curr_inputs = (*curr_inputs)->next;
  201. p->next = NULL;
  202. } else if (!(p = av_mallocz(sizeof(*p))))
  203. return AVERROR(ENOMEM);
  204. if (p->filter_ctx) {
  205. ret = link_filter(p->filter_ctx, p->pad_idx, filt_ctx, pad, log_ctx);
  206. av_free(p->name);
  207. av_free(p);
  208. if (ret < 0)
  209. return ret;
  210. } else {
  211. p->filter_ctx = filt_ctx;
  212. p->pad_idx = pad;
  213. append_inout(open_inputs, &p);
  214. }
  215. }
  216. if (*curr_inputs) {
  217. av_log(log_ctx, AV_LOG_ERROR,
  218. "Too many inputs specified for the \"%s\" filter.\n",
  219. filt_ctx->filter->name);
  220. return AVERROR(EINVAL);
  221. }
  222. pad = filt_ctx->nb_outputs;
  223. while (pad--) {
  224. AVFilterInOut *currlinkn = av_mallocz(sizeof(AVFilterInOut));
  225. if (!currlinkn)
  226. return AVERROR(ENOMEM);
  227. currlinkn->filter_ctx = filt_ctx;
  228. currlinkn->pad_idx = pad;
  229. insert_inout(curr_inputs, currlinkn);
  230. }
  231. return 0;
  232. }
  233. static int parse_inputs(const char **buf, AVFilterInOut **curr_inputs,
  234. AVFilterInOut **open_outputs, void *log_ctx)
  235. {
  236. AVFilterInOut *parsed_inputs = NULL;
  237. int pad = 0;
  238. while (**buf == '[') {
  239. char *name = parse_link_name(buf, log_ctx);
  240. AVFilterInOut *match;
  241. if (!name)
  242. return AVERROR(EINVAL);
  243. /* First check if the label is not in the open_outputs list */
  244. match = extract_inout(name, open_outputs);
  245. if (match) {
  246. av_free(name);
  247. } else {
  248. /* Not in the list, so add it as an input */
  249. if (!(match = av_mallocz(sizeof(AVFilterInOut)))) {
  250. av_free(name);
  251. return AVERROR(ENOMEM);
  252. }
  253. match->name = name;
  254. match->pad_idx = pad;
  255. }
  256. append_inout(&parsed_inputs, &match);
  257. *buf += strspn(*buf, WHITESPACES);
  258. pad++;
  259. }
  260. append_inout(&parsed_inputs, curr_inputs);
  261. *curr_inputs = parsed_inputs;
  262. return pad;
  263. }
  264. static int parse_outputs(const char **buf, AVFilterInOut **curr_inputs,
  265. AVFilterInOut **open_inputs,
  266. AVFilterInOut **open_outputs, void *log_ctx)
  267. {
  268. int ret, pad = 0;
  269. while (**buf == '[') {
  270. char *name = parse_link_name(buf, log_ctx);
  271. AVFilterInOut *match;
  272. AVFilterInOut *input = *curr_inputs;
  273. if (!name)
  274. return AVERROR(EINVAL);
  275. if (!input) {
  276. av_log(log_ctx, AV_LOG_ERROR,
  277. "No output pad can be associated to link label '%s'.\n", name);
  278. av_free(name);
  279. return AVERROR(EINVAL);
  280. }
  281. *curr_inputs = (*curr_inputs)->next;
  282. /* First check if the label is not in the open_inputs list */
  283. match = extract_inout(name, open_inputs);
  284. if (match) {
  285. if ((ret = link_filter(input->filter_ctx, input->pad_idx,
  286. match->filter_ctx, match->pad_idx, log_ctx)) < 0) {
  287. av_free(name);
  288. return ret;
  289. }
  290. av_free(match->name);
  291. av_free(name);
  292. av_free(match);
  293. av_free(input);
  294. } else {
  295. /* Not in the list, so add the first input as a open_output */
  296. input->name = name;
  297. insert_inout(open_outputs, input);
  298. }
  299. *buf += strspn(*buf, WHITESPACES);
  300. pad++;
  301. }
  302. return pad;
  303. }
  304. static int parse_sws_flags(const char **buf, AVFilterGraph *graph)
  305. {
  306. char *p = strchr(*buf, ';');
  307. if (strncmp(*buf, "sws_flags=", 10))
  308. return 0;
  309. if (!p) {
  310. av_log(graph, AV_LOG_ERROR, "sws_flags not terminated with ';'.\n");
  311. return AVERROR(EINVAL);
  312. }
  313. *buf += 4; // keep the 'flags=' part
  314. av_freep(&graph->scale_sws_opts);
  315. if (!(graph->scale_sws_opts = av_mallocz(p - *buf + 1)))
  316. return AVERROR(ENOMEM);
  317. av_strlcpy(graph->scale_sws_opts, *buf, p - *buf + 1);
  318. *buf = p + 1;
  319. return 0;
  320. }
  321. int avfilter_graph_parse2(AVFilterGraph *graph, const char *filters,
  322. AVFilterInOut **inputs,
  323. AVFilterInOut **outputs)
  324. {
  325. int index = 0, ret;
  326. char chr = 0;
  327. AVFilterInOut *curr_inputs = NULL, *open_inputs = NULL, *open_outputs = NULL;
  328. filters += strspn(filters, WHITESPACES);
  329. if ((ret = parse_sws_flags(&filters, graph)) < 0)
  330. goto fail;
  331. do {
  332. AVFilterContext *filter;
  333. filters += strspn(filters, WHITESPACES);
  334. if ((ret = parse_inputs(&filters, &curr_inputs, &open_outputs, graph)) < 0)
  335. goto fail;
  336. if ((ret = parse_filter(&filter, &filters, graph, index, graph)) < 0)
  337. goto fail;
  338. if ((ret = link_filter_inouts(filter, &curr_inputs, &open_inputs, graph)) < 0)
  339. goto fail;
  340. if ((ret = parse_outputs(&filters, &curr_inputs, &open_inputs, &open_outputs,
  341. graph)) < 0)
  342. goto fail;
  343. filters += strspn(filters, WHITESPACES);
  344. chr = *filters++;
  345. if (chr == ';' && curr_inputs)
  346. append_inout(&open_outputs, &curr_inputs);
  347. index++;
  348. } while (chr == ',' || chr == ';');
  349. if (chr) {
  350. av_log(graph, AV_LOG_ERROR,
  351. "Unable to parse graph description substring: \"%s\"\n",
  352. filters - 1);
  353. ret = AVERROR(EINVAL);
  354. goto fail;
  355. }
  356. append_inout(&open_outputs, &curr_inputs);
  357. *inputs = open_inputs;
  358. *outputs = open_outputs;
  359. return 0;
  360. fail:
  361. while (graph->nb_filters)
  362. avfilter_free(graph->filters[0]);
  363. av_freep(&graph->filters);
  364. avfilter_inout_free(&open_inputs);
  365. avfilter_inout_free(&open_outputs);
  366. avfilter_inout_free(&curr_inputs);
  367. *inputs = NULL;
  368. *outputs = NULL;
  369. return ret;
  370. }
  371. int avfilter_graph_parse(AVFilterGraph *graph, const char *filters,
  372. AVFilterInOut *open_inputs,
  373. AVFilterInOut *open_outputs, void *log_ctx)
  374. {
  375. int ret;
  376. AVFilterInOut *cur, *match, *inputs = NULL, *outputs = NULL;
  377. if ((ret = avfilter_graph_parse2(graph, filters, &inputs, &outputs)) < 0)
  378. goto fail;
  379. /* First input can be omitted if it is "[in]" */
  380. if (inputs && !inputs->name)
  381. inputs->name = av_strdup("in");
  382. for (cur = inputs; cur; cur = cur->next) {
  383. if (!cur->name) {
  384. av_log(log_ctx, AV_LOG_ERROR,
  385. "Not enough inputs specified for the \"%s\" filter.\n",
  386. cur->filter_ctx->filter->name);
  387. ret = AVERROR(EINVAL);
  388. goto fail;
  389. }
  390. if (!(match = extract_inout(cur->name, &open_outputs)))
  391. continue;
  392. ret = avfilter_link(match->filter_ctx, match->pad_idx,
  393. cur->filter_ctx, cur->pad_idx);
  394. avfilter_inout_free(&match);
  395. if (ret < 0)
  396. goto fail;
  397. }
  398. /* Last output can be omitted if it is "[out]" */
  399. if (outputs && !outputs->name)
  400. outputs->name = av_strdup("out");
  401. for (cur = outputs; cur; cur = cur->next) {
  402. if (!cur->name) {
  403. av_log(log_ctx, AV_LOG_ERROR,
  404. "Invalid filterchain containing an unlabelled output pad: \"%s\"\n",
  405. filters);
  406. ret = AVERROR(EINVAL);
  407. goto fail;
  408. }
  409. if (!(match = extract_inout(cur->name, &open_inputs)))
  410. continue;
  411. ret = avfilter_link(cur->filter_ctx, cur->pad_idx,
  412. match->filter_ctx, match->pad_idx);
  413. avfilter_inout_free(&match);
  414. if (ret < 0)
  415. goto fail;
  416. }
  417. fail:
  418. if (ret < 0) {
  419. while (graph->nb_filters)
  420. avfilter_free(graph->filters[0]);
  421. av_freep(&graph->filters);
  422. }
  423. avfilter_inout_free(&inputs);
  424. avfilter_inout_free(&outputs);
  425. avfilter_inout_free(&open_inputs);
  426. avfilter_inout_free(&open_outputs);
  427. return ret;
  428. }