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.

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