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.

685 lines
19KB

  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. #include <string.h>
  22. #include <stddef.h>
  23. #include "avstring.h"
  24. #include "avfilter.h"
  25. #include "avfiltergraph.h"
  26. #include "allfilters.h"
  27. typedef struct AVFilterGraph {
  28. unsigned filter_count;
  29. AVFilterContext **filters;
  30. /** fake filters to handle links to internal filters */
  31. AVFilterContext *link_filter_in;
  32. AVFilterContext *link_filter_out;
  33. } GraphContext;
  34. typedef struct {
  35. AVFilterContext *graph;
  36. } GraphLinkContext;
  37. static int link_init(AVFilterContext *ctx, const char *args, void *opaque)
  38. {
  39. GraphLinkContext *linkctx = ctx->priv;
  40. linkctx->graph = opaque;
  41. return !opaque;
  42. }
  43. /**
  44. * Given the link between the dummy filter and an internal filter whose input
  45. * is being exported outside the graph, this returns the externally visible
  46. * link.
  47. */
  48. static inline AVFilterLink *get_extern_input_link(AVFilterLink *link)
  49. {
  50. GraphLinkContext *lctx = link->src->priv;
  51. return lctx->graph->inputs[link->srcpad];
  52. }
  53. /** request a frame from a filter providing input to the graph */
  54. static int link_in_request_frame(AVFilterLink *link)
  55. {
  56. AVFilterLink *link2 = get_extern_input_link(link);
  57. if(!link2)
  58. return -1;
  59. return avfilter_request_frame(link2);
  60. }
  61. static int link_in_poll_frame(AVFilterLink *link)
  62. {
  63. AVFilterLink *link2 = get_extern_input_link(link);
  64. if(!link2)
  65. return -1;
  66. return avfilter_poll_frame(link2);
  67. }
  68. static int link_in_config_props(AVFilterLink *link)
  69. {
  70. AVFilterLink *link2 = get_extern_input_link(link);
  71. int (*config_props)(AVFilterLink *);
  72. int ret;
  73. if(!link2)
  74. return -1;
  75. if(!(config_props = link2->src->output_pads[link2->srcpad].config_props))
  76. config_props = avfilter_default_config_output_link;
  77. ret = config_props(link2);
  78. link->w = link2->w;
  79. link->h = link2->h;
  80. return ret;
  81. }
  82. /**
  83. * Given the link between the dummy filter and an internal filter whose input
  84. * is being exported outside the graph, this returns the externally visible
  85. * link.
  86. */
  87. static inline AVFilterLink *get_extern_output_link(AVFilterLink *link)
  88. {
  89. GraphLinkContext *lctx = link->dst->priv;
  90. return lctx->graph->outputs[link->dstpad];
  91. }
  92. static int link_out_config_props(AVFilterLink *link)
  93. {
  94. AVFilterLink *link2 = get_extern_output_link(link);
  95. if(!link2)
  96. return 0;
  97. link2->w = link->w;
  98. link2->h = link->h;
  99. return 0;
  100. }
  101. static void link_out_start_frame(AVFilterLink *link, AVFilterPicRef *picref)
  102. {
  103. AVFilterLink *link2 = get_extern_output_link(link);
  104. if(!link2)
  105. avfilter_unref_pic(picref);
  106. else
  107. avfilter_start_frame(link2, picref);
  108. }
  109. static void link_out_end_frame(AVFilterLink *link)
  110. {
  111. AVFilterLink *link2 = get_extern_output_link(link);
  112. if(link2)
  113. avfilter_end_frame(link2);
  114. }
  115. static AVFilterPicRef *link_out_get_video_buffer(AVFilterLink *link, int perms)
  116. {
  117. AVFilterLink *link2 = get_extern_output_link(link);
  118. if(!link2)
  119. return NULL;
  120. else
  121. return avfilter_get_video_buffer(link2, perms);
  122. }
  123. static void link_out_draw_slice(AVFilterLink *link, int y, int height)
  124. {
  125. AVFilterLink *link2 = get_extern_output_link(link);
  126. if(link2)
  127. avfilter_draw_slice(link2, y, height);
  128. }
  129. /** dummy filter used to help export filters pads outside the graph */
  130. static AVFilter vf_graph_dummy =
  131. {
  132. .name = "graph_dummy",
  133. .author = "Bobby Bingham",
  134. .priv_size = sizeof(GraphLinkContext),
  135. .init = link_init,
  136. .inputs = (AVFilterPad[]) {{ .name = NULL, }},
  137. .outputs = (AVFilterPad[]) {{ .name = NULL, }},
  138. };
  139. static AVFilterLink *get_intern_input_link(AVFilterLink *link)
  140. {
  141. GraphContext *graph = link->dst->priv;
  142. return graph->link_filter_in->outputs[link->dstpad];
  143. }
  144. static void graph_in_start_frame(AVFilterLink *link, AVFilterPicRef *picref)
  145. {
  146. AVFilterLink *link2 = get_intern_input_link(link);
  147. if(link2)
  148. avfilter_start_frame(link2, picref);
  149. }
  150. static void graph_in_end_frame(AVFilterLink *link)
  151. {
  152. AVFilterLink *link2 = get_intern_input_link(link);
  153. if(link2)
  154. avfilter_end_frame(link2);
  155. }
  156. static AVFilterPicRef *graph_in_get_video_buffer(AVFilterLink *link, int perms)
  157. {
  158. AVFilterLink *link2 = get_intern_input_link(link);
  159. if(link2)
  160. return avfilter_get_video_buffer(link2, perms);
  161. return NULL;
  162. }
  163. static void graph_in_draw_slice(AVFilterLink *link, int y, int height)
  164. {
  165. AVFilterLink *link2 = get_intern_input_link(link);
  166. if(link2)
  167. avfilter_draw_slice(link2, y, height);
  168. }
  169. static int graph_in_config_props(AVFilterLink *link)
  170. {
  171. AVFilterLink *link2 = get_intern_input_link(link);
  172. int (*config_props)(AVFilterLink *);
  173. int ret;
  174. if(!link2)
  175. return -1;
  176. /* copy link properties over to the dummy internal link */
  177. link2->w = link->w;
  178. link2->h = link->h;
  179. link2->format = link->format;
  180. if(!(config_props = link2->dst->input_pads[link2->dstpad].config_props))
  181. return 0; /* FIXME? */
  182. //config_props = avfilter_default_config_input_link;
  183. if(!(ret = config_props(link2)))
  184. link2->init_state = AVLINK_INIT;
  185. else
  186. link2->init_state = AVLINK_STARTINIT;
  187. return ret;
  188. }
  189. static AVFilterLink *get_intern_output_link(AVFilterLink *link)
  190. {
  191. GraphContext *graph = link->src->priv;
  192. return graph->link_filter_out->inputs[link->srcpad];
  193. }
  194. static int graph_out_request_frame(AVFilterLink *link)
  195. {
  196. AVFilterLink *link2 = get_intern_output_link(link);
  197. if(link2)
  198. return avfilter_request_frame(link2);
  199. return -1;
  200. }
  201. static int graph_out_poll_frame(AVFilterLink *link)
  202. {
  203. AVFilterLink *link2 = get_intern_output_link(link);
  204. if(!link2)
  205. return -1;
  206. return avfilter_poll_frame(link2);
  207. }
  208. static int graph_out_config_props(AVFilterLink *link)
  209. {
  210. GraphContext *graph = link->src->priv;
  211. AVFilterLink *link2 = graph->link_filter_out->inputs[link->srcpad];
  212. int ret;
  213. if((ret = avfilter_config_links(graph->link_filter_out)))
  214. return ret;
  215. if(!link2)
  216. return 0;
  217. link->w = link2->w;
  218. link->h = link2->h;
  219. link->format = link2->format;
  220. return 0;
  221. }
  222. static int add_graph_input(AVFilterContext *gctx, AVFilterContext *filt, unsigned idx,
  223. char *name)
  224. {
  225. GraphContext *graph = gctx->priv;
  226. AVFilterPad graph_inpad =
  227. {
  228. .name = name,
  229. .type = AV_PAD_VIDEO,
  230. .start_frame = graph_in_start_frame,
  231. .end_frame = graph_in_end_frame,
  232. .get_video_buffer = graph_in_get_video_buffer,
  233. .draw_slice = graph_in_draw_slice,
  234. .config_props = graph_in_config_props,
  235. /* XXX */
  236. };
  237. AVFilterPad dummy_outpad =
  238. {
  239. .name = NULL, /* FIXME? */
  240. .type = AV_PAD_VIDEO,
  241. .request_frame = link_in_request_frame,
  242. .poll_frame = link_in_poll_frame,
  243. .config_props = link_in_config_props,
  244. };
  245. avfilter_insert_inpad (gctx, gctx->input_count, &graph_inpad);
  246. avfilter_insert_outpad(graph->link_filter_in, graph->link_filter_in->output_count,
  247. &dummy_outpad);
  248. return avfilter_link(graph->link_filter_in,
  249. graph->link_filter_in->output_count-1, filt, idx);
  250. }
  251. static int add_graph_output(AVFilterContext *gctx, AVFilterContext *filt, unsigned idx,
  252. char *name)
  253. {
  254. GraphContext *graph = gctx->priv;
  255. AVFilterPad graph_outpad =
  256. {
  257. .name = name,
  258. .type = AV_PAD_VIDEO,
  259. .request_frame = graph_out_request_frame,
  260. .poll_frame = graph_out_poll_frame,
  261. .config_props = graph_out_config_props,
  262. };
  263. AVFilterPad dummy_inpad =
  264. {
  265. .name = NULL, /* FIXME? */
  266. .type = AV_PAD_VIDEO,
  267. .start_frame = link_out_start_frame,
  268. .end_frame = link_out_end_frame,
  269. .draw_slice = link_out_draw_slice,
  270. .get_video_buffer = link_out_get_video_buffer,
  271. .config_props = link_out_config_props,
  272. };
  273. avfilter_insert_outpad(gctx, gctx->output_count, &graph_outpad);
  274. avfilter_insert_inpad (graph->link_filter_out, graph->link_filter_out->input_count,
  275. &dummy_inpad);
  276. return avfilter_link(filt, idx, graph->link_filter_out,
  277. graph->link_filter_out->input_count-1);
  278. }
  279. static void uninit(AVFilterContext *ctx)
  280. {
  281. GraphContext *graph = ctx->priv;
  282. if(graph->link_filter_in) {
  283. avfilter_destroy(graph->link_filter_in);
  284. graph->link_filter_in = NULL;
  285. }
  286. if(graph->link_filter_out) {
  287. avfilter_destroy(graph->link_filter_out);
  288. graph->link_filter_out = NULL;
  289. }
  290. for(; graph->filter_count > 0; graph->filter_count --)
  291. avfilter_destroy(graph->filters[graph->filter_count - 1]);
  292. av_freep(&graph->filters);
  293. }
  294. /* TODO: insert in sorted order */
  295. void avfilter_graph_add_filter(AVFilterContext *graphctx, AVFilterContext *filter)
  296. {
  297. GraphContext *graph = graphctx->priv;
  298. graph->filters = av_realloc(graph->filters,
  299. sizeof(AVFilterContext*) * ++graph->filter_count);
  300. graph->filters[graph->filter_count - 1] = filter;
  301. }
  302. /* search intelligently, once we insert in order */
  303. AVFilterContext *avfilter_graph_get_filter(AVFilterContext *ctx, char *name)
  304. {
  305. GraphContext *graph = ctx->priv;
  306. int i;
  307. if(!name)
  308. return NULL;
  309. for(i = 0; i < graph->filter_count; i ++)
  310. if(graph->filters[i]->name && !strcmp(name, graph->filters[i]->name))
  311. return graph->filters[i];
  312. return NULL;
  313. }
  314. static int query_formats(AVFilterContext *graphctx)
  315. {
  316. GraphContext *graph = graphctx->priv;
  317. AVFilterContext *linkfiltin = graph->link_filter_in;
  318. AVFilterContext *linkfiltout = graph->link_filter_out;
  319. int i, j;
  320. /* ask all the sub-filters for their supported colorspaces */
  321. for(i = 0; i < graph->filter_count; i ++) {
  322. if(graph->filters[i]->filter->query_formats)
  323. graph->filters[i]->filter->query_formats(graph->filters[i]);
  324. else
  325. avfilter_default_query_formats(graph->filters[i]);
  326. }
  327. /* use these formats on our exported links */
  328. for(i = 0; i < linkfiltout->input_count; i ++) {
  329. avfilter_formats_ref( linkfiltout->inputs[i]->in_formats,
  330. &linkfiltout->inputs[i]->out_formats);
  331. if(graphctx->outputs[i])
  332. avfilter_formats_ref(linkfiltout->inputs[i]->in_formats,
  333. &graphctx->outputs[i]->in_formats);
  334. }
  335. for(i = 0; i < linkfiltin->output_count; i ++) {
  336. avfilter_formats_ref( linkfiltin->outputs[i]->out_formats,
  337. &linkfiltin->outputs[i]->in_formats);
  338. if(graphctx->inputs[i])
  339. avfilter_formats_ref(linkfiltin->outputs[i]->out_formats,
  340. &graphctx-> inputs[i]->out_formats);
  341. }
  342. /* go through and merge as many format lists as possible */
  343. for(i = 0; i < graph->filter_count; i ++) {
  344. AVFilterContext *filter = graph->filters[i];
  345. for(j = 0; j < filter->input_count; j ++) {
  346. AVFilterLink *link;
  347. if(!(link = filter->inputs[j]))
  348. continue;
  349. if(link->in_formats != link->out_formats) {
  350. if(!avfilter_merge_formats(link->in_formats,
  351. link->out_formats)) {
  352. /* couldn't merge format lists. auto-insert scale filter */
  353. AVFilterContext *scale;
  354. if(!(scale = avfilter_open(&avfilter_vf_scale, NULL)))
  355. return -1;
  356. if(scale->filter->init(scale, NULL, NULL) ||
  357. avfilter_insert_filter(link, scale, 0, 0)) {
  358. avfilter_destroy(scale);
  359. return -1;
  360. }
  361. avfilter_graph_add_filter(graphctx, scale);
  362. scale->filter->query_formats(scale);
  363. if(!avfilter_merge_formats(scale-> inputs[0]->in_formats,
  364. scale-> inputs[0]->out_formats) ||
  365. !avfilter_merge_formats(scale->outputs[0]->in_formats,
  366. scale->outputs[0]->out_formats))
  367. return -1;
  368. }
  369. }
  370. }
  371. }
  372. return 0;
  373. }
  374. static void pick_format(AVFilterLink *link)
  375. {
  376. if(!link || !link->in_formats)
  377. return;
  378. link->in_formats->format_count = 1;
  379. link->format = link->in_formats->formats[0];
  380. avfilter_formats_unref(&link->in_formats);
  381. avfilter_formats_unref(&link->out_formats);
  382. }
  383. static void pick_formats(GraphContext *graph)
  384. {
  385. int i, j;
  386. for(i = 0; i < graph->filter_count; i ++) {
  387. AVFilterContext *filter = graph->filters[i];
  388. if(filter->filter == &avfilter_vf_graph ||
  389. filter->filter == &avfilter_vf_graphfile ||
  390. filter->filter == &avfilter_vf_graphdesc)
  391. pick_formats(filter->priv);
  392. for(j = 0; j < filter->input_count; j ++)
  393. pick_format(filter->inputs[j]);
  394. for(j = 0; j < filter->output_count; j ++)
  395. pick_format(filter->outputs[j]);
  396. }
  397. }
  398. int avfilter_graph_config_formats(AVFilterContext *graphctx)
  399. {
  400. GraphContext *graph = graphctx->priv;
  401. /* find supported formats from sub-filters, and merge along links */
  402. if(query_formats(graphctx))
  403. return -1;
  404. /* Once everything is merged, it's possible that we'll still have
  405. * multiple valid choices of colorspace. We pick the first one. */
  406. pick_formats(graph);
  407. return 0;
  408. }
  409. static int graph_load_from_desc(AVFilterContext *ctx, AVFilterGraphDesc *desc)
  410. {
  411. AVFilterGraphDescFilter *curfilt;
  412. AVFilterGraphDescLink *curlink;
  413. AVFilterGraphDescExport *curpad;
  414. AVFilterContext *filt, *filtb;
  415. AVFilter *filterdef;
  416. /* create all filters */
  417. for(curfilt = desc->filters; curfilt; curfilt = curfilt->next) {
  418. if(!(filterdef = avfilter_get_by_name(curfilt->filter)) ||
  419. !(filt = avfilter_open(filterdef, curfilt->name))) {
  420. av_log(ctx, AV_LOG_ERROR,
  421. "error creating filter '%s'\n", curfilt->name);
  422. goto fail;
  423. }
  424. avfilter_graph_add_filter(ctx, filt);
  425. if(avfilter_init_filter(filt, curfilt->args, NULL)) {
  426. av_log(ctx, AV_LOG_ERROR,
  427. "error initializing filter '%s'\n", curfilt->name);
  428. goto fail;
  429. }
  430. }
  431. /* create all links */
  432. for(curlink = desc->links; curlink; curlink = curlink->next) {
  433. if(!(filt = avfilter_graph_get_filter(ctx, curlink->src))) {
  434. av_log(ctx, AV_LOG_ERROR, "link source does not exist in graph\n");
  435. goto fail;
  436. }
  437. if(!(filtb = avfilter_graph_get_filter(ctx, curlink->dst))) {
  438. av_log(ctx, AV_LOG_ERROR, "link destination does not exist in graph\n");
  439. goto fail;
  440. }
  441. if(avfilter_link(filt, curlink->srcpad, filtb, curlink->dstpad)) {
  442. av_log(ctx, AV_LOG_ERROR, "cannot create link between source and destination filters\n");
  443. goto fail;
  444. }
  445. }
  446. /* export all input pads */
  447. for(curpad = desc->inputs; curpad; curpad = curpad->next) {
  448. if(!(filt = avfilter_graph_get_filter(ctx, curpad->filter))) {
  449. av_log(ctx, AV_LOG_ERROR, "filter owning exported pad does not exist\n");
  450. goto fail;
  451. }
  452. add_graph_input(ctx, filt, curpad->pad, curpad->name);
  453. }
  454. /* export all output pads */
  455. for(curpad = desc->outputs; curpad; curpad = curpad->next) {
  456. if(!(filt = avfilter_graph_get_filter(ctx, curpad->filter))) {
  457. av_log(ctx, AV_LOG_ERROR, "filter owning exported pad does not exist\n");
  458. goto fail;
  459. }
  460. add_graph_output(ctx, filt, curpad->pad, curpad->name);
  461. }
  462. return 0;
  463. fail:
  464. uninit(ctx);
  465. return -1;
  466. }
  467. static int init(AVFilterContext *ctx, const char *args, void *opaque)
  468. {
  469. GraphContext *gctx = ctx->priv;
  470. AVFilterGraphDesc *desc;
  471. int ret;
  472. if(!(gctx->link_filter_in = avfilter_open(&vf_graph_dummy, NULL)))
  473. return -1;
  474. if(avfilter_init_filter(gctx->link_filter_in, NULL, ctx))
  475. goto fail;
  476. if(!(gctx->link_filter_out = avfilter_open(&vf_graph_dummy, NULL)))
  477. goto fail;
  478. if(avfilter_init_filter(gctx->link_filter_out, NULL, ctx))
  479. goto fail;
  480. if(!args)
  481. return 0;
  482. if(!(desc = avfilter_graph_parse_chain(args)))
  483. goto fail;
  484. ret = graph_load_from_desc(ctx, desc);
  485. avfilter_graph_free_desc(desc);
  486. return ret;
  487. fail:
  488. avfilter_destroy(gctx->link_filter_in);
  489. if(gctx->link_filter_out)
  490. avfilter_destroy(gctx->link_filter_out);
  491. return -1;
  492. }
  493. AVFilter avfilter_vf_graph =
  494. {
  495. .name = "graph",
  496. .author = "Bobby Bingham",
  497. .priv_size = sizeof(GraphContext),
  498. .init = init,
  499. .uninit = uninit,
  500. .query_formats = query_formats,
  501. .inputs = (AVFilterPad[]) {{ .name = NULL, }},
  502. .outputs = (AVFilterPad[]) {{ .name = NULL, }},
  503. };
  504. static int init_desc(AVFilterContext *ctx, const char *args, void *opaque)
  505. {
  506. GraphContext *gctx = ctx->priv;
  507. if(!opaque)
  508. return -1;
  509. if(!(gctx->link_filter_in = avfilter_open(&vf_graph_dummy, NULL)))
  510. return -1;
  511. if(avfilter_init_filter(gctx->link_filter_in, NULL, ctx))
  512. goto fail;
  513. if(!(gctx->link_filter_out = avfilter_open(&vf_graph_dummy, NULL)))
  514. goto fail;
  515. if(avfilter_init_filter(gctx->link_filter_out, NULL, ctx))
  516. goto fail;
  517. return graph_load_from_desc(ctx, opaque);
  518. fail:
  519. avfilter_destroy(gctx->link_filter_in);
  520. if(gctx->link_filter_out)
  521. avfilter_destroy(gctx->link_filter_out);
  522. return -1;
  523. }
  524. AVFilter avfilter_vf_graphdesc =
  525. {
  526. .name = "graph_desc",
  527. .author = "Bobby Bingham",
  528. .priv_size = sizeof(GraphContext),
  529. .init = init_desc,
  530. .uninit = uninit,
  531. .query_formats = query_formats,
  532. .inputs = (AVFilterPad[]) {{ .name = NULL, }},
  533. .outputs = (AVFilterPad[]) {{ .name = NULL, }},
  534. };
  535. static int init_file(AVFilterContext *ctx, const char *args, void *opaque)
  536. {
  537. AVFilterGraphDesc *desc;
  538. int ret;
  539. if(!args)
  540. return -1;
  541. if(!(desc = avfilter_graph_load_desc(args)))
  542. return -1;
  543. ret = init_desc(ctx, NULL, desc);
  544. avfilter_graph_free_desc(desc);
  545. return ret;
  546. }
  547. AVFilter avfilter_vf_graphfile =
  548. {
  549. .name = "graph_file",
  550. .author = "Bobby Bingham",
  551. .priv_size = sizeof(GraphContext),
  552. .init = init_file,
  553. .uninit = uninit,
  554. .query_formats = query_formats,
  555. .inputs = (AVFilterPad[]) {{ .name = NULL, }},
  556. .outputs = (AVFilterPad[]) {{ .name = NULL, }},
  557. };