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.

451 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 "avfilter.h"
  25. #include "avfiltergraph.h"
  26. static AVFilterContext *create_filter(AVFilterGraph *ctx, int index,
  27. const char *name, const char *args,
  28. AVClass *log_ctx)
  29. {
  30. AVFilterContext *filt;
  31. AVFilter *filterdef;
  32. char inst_name[30];
  33. snprintf(inst_name, sizeof(inst_name), "Parsed filter %d", index);
  34. if(!(filterdef = avfilter_get_by_name(name))) {
  35. av_log(log_ctx, AV_LOG_ERROR,
  36. "no such filter: '%s'\n", name);
  37. return NULL;
  38. }
  39. if(!(filt = avfilter_open(filterdef, inst_name))) {
  40. av_log(log_ctx, AV_LOG_ERROR,
  41. "error creating filter '%s'\n", name);
  42. return NULL;
  43. }
  44. if(avfilter_graph_add_filter(ctx, filt) < 0)
  45. return NULL;
  46. if(avfilter_init_filter(filt, args, NULL)) {
  47. av_log(log_ctx, AV_LOG_ERROR,
  48. "error initializing filter '%s' with args '%s'\n", name, args);
  49. return NULL;
  50. }
  51. return filt;
  52. }
  53. static int link_filter(AVFilterContext *src, int srcpad,
  54. AVFilterContext *dst, int dstpad,
  55. AVClass *log_ctx)
  56. {
  57. if(avfilter_link(src, srcpad, dst, dstpad)) {
  58. av_log(log_ctx, AV_LOG_ERROR,
  59. "cannot create the link %s:%d -> %s:%d\n",
  60. src->filter->name, srcpad, dst->filter->name, dstpad);
  61. return -1;
  62. }
  63. return 0;
  64. }
  65. static void consume_whitespace(const char **buf)
  66. {
  67. *buf += strspn(*buf, " \n\t");
  68. }
  69. /**
  70. * Consumes a string from *buf.
  71. * @return a copy of the consumed string, which should be free'd after use
  72. */
  73. static char *consume_string(const char **buf)
  74. {
  75. char *out = av_malloc(strlen(*buf) + 1);
  76. char *ret = out;
  77. consume_whitespace(buf);
  78. do{
  79. char c = *(*buf)++;
  80. switch (c) {
  81. case '\\':
  82. *out++= *(*buf)++;
  83. break;
  84. case '\'':
  85. while(**buf && **buf != '\'')
  86. *out++= *(*buf)++;
  87. if(**buf) (*buf)++;
  88. break;
  89. case 0:
  90. case ']':
  91. case '[':
  92. case '=':
  93. case ',':
  94. case ';':
  95. case ' ':
  96. case '\n':
  97. *out++= 0;
  98. break;
  99. default:
  100. *out++= c;
  101. }
  102. } while(out[-1]);
  103. (*buf)--;
  104. consume_whitespace(buf);
  105. return ret;
  106. }
  107. /**
  108. * Parse "[linkname]"
  109. * @arg name a pointer (that need to be free'd after use) to the name between
  110. * parenthesis
  111. */
  112. static void parse_link_name(const char **buf, char **name, AVClass *log_ctx)
  113. {
  114. const char *start = *buf;
  115. (*buf)++;
  116. *name = consume_string(buf);
  117. if(!*name[0]) {
  118. av_log(log_ctx, AV_LOG_ERROR,
  119. "Bad (empty?) label found in the following: \"%s\".\n", start);
  120. goto fail;
  121. }
  122. if(*(*buf)++ != ']') {
  123. av_log(log_ctx, AV_LOG_ERROR,
  124. "Mismatched '[' found in the following: \"%s\".\n", start);
  125. fail:
  126. av_freep(name);
  127. }
  128. }
  129. enum LinkType {
  130. LinkTypeIn,
  131. LinkTypeOut,
  132. };
  133. /**
  134. * A linked-list of the inputs/outputs of the filter chain.
  135. */
  136. typedef struct AVFilterInOut {
  137. enum LinkType type;
  138. const char *name;
  139. AVFilterContext *filter;
  140. int pad_idx;
  141. struct AVFilterInOut *next;
  142. } AVFilterInOut;
  143. static void free_inout(AVFilterInOut *head)
  144. {
  145. while (head) {
  146. AVFilterInOut *next = head->next;
  147. av_free(head);
  148. head = next;
  149. }
  150. }
  151. static AVFilterInOut *extract_inout(const char *label, AVFilterInOut **links)
  152. {
  153. AVFilterInOut *ret;
  154. while(*links && strcmp((*links)->name, label))
  155. links= &((*links)->next);
  156. ret= *links;
  157. if(ret)
  158. *links= ret->next;
  159. return ret;
  160. }
  161. static int link_filter_inouts(AVFilterContext *filter,
  162. AVFilterInOut **currInputs,
  163. AVFilterInOut **openLinks, AVClass *log_ctx)
  164. {
  165. AVFilterInOut *p;
  166. int pad = 0;
  167. pad = filter->input_count;
  168. while(pad) {
  169. p = *currInputs;
  170. pad--;
  171. if(!p) {
  172. av_log(log_ctx, AV_LOG_ERROR,
  173. "Not enough inputs specified for the \"%s\" filter.\n",
  174. filter->name);
  175. return -1;
  176. }
  177. if(p->filter) {
  178. if(link_filter(p->filter, p->pad_idx, filter, pad, log_ctx))
  179. return -1;
  180. *currInputs = (*currInputs)->next;
  181. av_free(p);
  182. } else {
  183. p = *currInputs;
  184. *currInputs = (*currInputs)->next;
  185. p->filter = filter;
  186. p->pad_idx = pad;
  187. p->next = *openLinks;
  188. *openLinks = p;
  189. }
  190. }
  191. if(*currInputs) {
  192. av_log(log_ctx, AV_LOG_ERROR,
  193. "Too many inputs specified for the \"%s\" filter.\n",
  194. filter->name);
  195. return -1;
  196. }
  197. pad = filter->output_count;
  198. while(pad) {
  199. AVFilterInOut *currlinkn = av_malloc(sizeof(AVFilterInOut));
  200. pad--;
  201. currlinkn->name = NULL;
  202. currlinkn->type = LinkTypeOut;
  203. currlinkn->filter = filter;
  204. currlinkn->pad_idx = pad;
  205. currlinkn->next = *currInputs;
  206. *currInputs = currlinkn;
  207. }
  208. return 0;
  209. }
  210. /**
  211. * Parse "filter=params"
  212. * @arg name a pointer (that need to be free'd after use) to the name of the
  213. * filter
  214. * @arg ars a pointer (that need to be free'd after use) to the args of the
  215. * filter
  216. */
  217. static AVFilterContext *parse_filter(const char **buf, AVFilterGraph *graph,
  218. int index, AVClass *log_ctx)
  219. {
  220. char *opts;
  221. char *name = consume_string(buf);
  222. if(**buf == '=') {
  223. (*buf)++;
  224. opts = consume_string(buf);
  225. } else {
  226. opts = NULL;
  227. }
  228. return create_filter(graph, index, name, opts, log_ctx);
  229. }
  230. static int parse_inputs(const char **buf, AVFilterInOut **currInputs,
  231. AVFilterInOut **openLinks, AVClass *log_ctx)
  232. {
  233. int pad = 0;
  234. AVFilterInOut *p;
  235. while (**buf == '[') {
  236. char *name;
  237. parse_link_name(buf, &name, log_ctx);
  238. if(!name)
  239. return -1;
  240. /* First check if the label is not in the openLinks list */
  241. p = extract_inout(name, openLinks);
  242. /* Not in the list, so add it as an input */
  243. if(!p) {
  244. AVFilterInOut *currlinkn = av_malloc(sizeof(AVFilterInOut));
  245. currlinkn->name = name;
  246. currlinkn->type = LinkTypeIn;
  247. currlinkn->filter = NULL;
  248. currlinkn->pad_idx = pad;
  249. currlinkn->next = *currInputs;
  250. *currInputs = currlinkn;
  251. } else {
  252. /* A label of a open link. Make it one of the inputs of the next
  253. filter */
  254. AVFilterInOut *currlinkn = p;
  255. if (p->type != LinkTypeOut) {
  256. av_log(log_ctx, AV_LOG_ERROR,
  257. "Label \"%s\" appears twice as input!\n", p->name);
  258. return -1;
  259. }
  260. currlinkn->next = *currInputs;
  261. *currInputs = currlinkn;
  262. }
  263. consume_whitespace(buf);
  264. pad++;
  265. }
  266. return pad;
  267. }
  268. static int parse_outputs(const char **buf, AVFilterInOut **currInputs,
  269. AVFilterInOut **openLinks, AVClass *log_ctx)
  270. {
  271. int pad = 0;
  272. while (**buf == '[') {
  273. char *name;
  274. AVFilterInOut *match;
  275. parse_link_name(buf, &name, log_ctx);
  276. if(!name)
  277. return -1;
  278. /* First check if the label is not in the openLinks list */
  279. match = extract_inout(name, openLinks);
  280. /* Not in the list, so add the first input as a openLink */
  281. if(!match) {
  282. AVFilterInOut *p = *currInputs;
  283. *currInputs = (*currInputs)->next;
  284. p->next = *openLinks;
  285. p->type = LinkTypeOut;
  286. p->name = name;
  287. *openLinks = p;
  288. } else {
  289. /* A label of a open link. Link it. */
  290. AVFilterInOut *p = *currInputs;
  291. if (match->type != LinkTypeIn) {
  292. av_log(log_ctx, AV_LOG_ERROR,
  293. "Label \"%s\" appears twice as output!\n", match->name);
  294. return -1;
  295. }
  296. *currInputs = (*currInputs)->next;
  297. if(link_filter(p->filter, p->pad_idx,
  298. match->filter, match->pad_idx, log_ctx) < 0)
  299. return -1;
  300. av_free(match);
  301. av_free(p);
  302. }
  303. consume_whitespace(buf);
  304. pad++;
  305. }
  306. return pad;
  307. }
  308. /**
  309. * Parse a string describing a filter graph.
  310. */
  311. int avfilter_parse_graph(AVFilterGraph *graph, const char *filters,
  312. AVFilterContext *in, int inpad,
  313. AVFilterContext *out, int outpad,
  314. AVClass *log_ctx)
  315. {
  316. int index = 0;
  317. char chr = 0;
  318. int pad = 0;
  319. AVFilterInOut *currInputs=NULL;
  320. AVFilterInOut *openLinks = av_malloc(sizeof(AVFilterInOut));
  321. openLinks->name = "in";
  322. openLinks->filter = in;
  323. openLinks->type = LinkTypeOut;
  324. openLinks->pad_idx = inpad;
  325. openLinks->next = av_malloc(sizeof(AVFilterInOut));
  326. openLinks->next->name = "out";
  327. openLinks->next->filter = out;
  328. openLinks->next->type = LinkTypeIn;
  329. openLinks->next->pad_idx = outpad;
  330. openLinks->next->next = NULL;
  331. do {
  332. AVFilterContext *filter;
  333. consume_whitespace(&filters);
  334. pad = parse_inputs(&filters, &currInputs, &openLinks, log_ctx);
  335. if(pad < 0)
  336. goto fail;
  337. if(!(filter = parse_filter(&filters, graph, index, log_ctx)))
  338. goto fail;
  339. if(filter->input_count == 1 && !currInputs && !index) {
  340. // First input can be ommitted if it is "[in]"
  341. const char *tmp = "[in]";
  342. pad = parse_inputs(&tmp, &currInputs, &openLinks, log_ctx);
  343. if (pad < 0)
  344. goto fail;
  345. }
  346. if(link_filter_inouts(filter, &currInputs, &openLinks, log_ctx) < 0)
  347. goto fail;
  348. pad = parse_outputs(&filters, &currInputs, &openLinks, log_ctx);
  349. if(pad < 0)
  350. goto fail;
  351. consume_whitespace(&filters);
  352. chr = *filters++;
  353. if (chr == ';' && currInputs) {
  354. av_log(log_ctx, AV_LOG_ERROR,
  355. "Could not find a output to link when parsing \"%s\"\n",
  356. filters - 1);
  357. goto fail;
  358. }
  359. index++;
  360. } while (chr == ',' || chr == ';');
  361. if(openLinks && !strcmp(openLinks->name, "out") && currInputs) {
  362. // Last output can be ommitted if it is "[out]"
  363. const char *tmp = "[out]";
  364. if(parse_outputs(&tmp, &currInputs, &openLinks, log_ctx) < 0)
  365. goto fail;
  366. }
  367. return 0;
  368. fail:
  369. avfilter_destroy_graph(graph);
  370. free_inout(openLinks);
  371. free_inout(currInputs);
  372. return -1;
  373. }