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.

344 lines
9.9KB

  1. /*
  2. * Copyright (c) 2013 Nicolas George
  3. *
  4. * This file is part of FFmpeg.
  5. *
  6. * FFmpeg is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU Lesser General Public License
  8. * as published by the Free Software Foundation; either
  9. * version 2.1 of the License, or (at your option) any later version.
  10. *
  11. * FFmpeg is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. * GNU Lesser General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU Lesser General Public License
  17. * along with FFmpeg; if not, write to the Free Software Foundation, Inc.,
  18. * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  19. */
  20. #define FF_INTERNAL_FIELDS 1
  21. #include "framequeue.h"
  22. #include "libavutil/avassert.h"
  23. #include "avfilter.h"
  24. #include "bufferqueue.h"
  25. #include "framesync.h"
  26. #include "internal.h"
  27. #define OFFSET(member) offsetof(FFFrameSync, member)
  28. static const char *framesync_name(void *ptr)
  29. {
  30. return "framesync";
  31. }
  32. static const AVClass framesync_class = {
  33. .version = LIBAVUTIL_VERSION_INT,
  34. .class_name = "framesync",
  35. .item_name = framesync_name,
  36. .category = AV_CLASS_CATEGORY_FILTER,
  37. .option = NULL,
  38. .parent_log_context_offset = OFFSET(parent),
  39. };
  40. enum {
  41. STATE_BOF,
  42. STATE_RUN,
  43. STATE_EOF,
  44. };
  45. int ff_framesync_init(FFFrameSync *fs, void *parent, unsigned nb_in)
  46. {
  47. fs->class = &framesync_class;
  48. fs->parent = parent;
  49. fs->nb_in = nb_in;
  50. fs->in = av_calloc(nb_in, sizeof(*fs->in));
  51. if (!fs->in)
  52. return AVERROR(ENOMEM);
  53. return 0;
  54. }
  55. static void framesync_sync_level_update(FFFrameSync *fs)
  56. {
  57. unsigned i, level = 0;
  58. for (i = 0; i < fs->nb_in; i++)
  59. if (fs->in[i].state != STATE_EOF)
  60. level = FFMAX(level, fs->in[i].sync);
  61. av_assert0(level <= fs->sync_level);
  62. if (level < fs->sync_level)
  63. av_log(fs, AV_LOG_VERBOSE, "Sync level %u\n", level);
  64. if (level)
  65. fs->sync_level = level;
  66. else
  67. fs->eof = 1;
  68. }
  69. int ff_framesync_configure(FFFrameSync *fs)
  70. {
  71. unsigned i;
  72. int64_t gcd, lcm;
  73. if (!fs->time_base.num) {
  74. for (i = 0; i < fs->nb_in; i++) {
  75. if (fs->in[i].sync) {
  76. if (fs->time_base.num) {
  77. gcd = av_gcd(fs->time_base.den, fs->in[i].time_base.den);
  78. lcm = (fs->time_base.den / gcd) * fs->in[i].time_base.den;
  79. if (lcm < AV_TIME_BASE / 2) {
  80. fs->time_base.den = lcm;
  81. fs->time_base.num = av_gcd(fs->time_base.num,
  82. fs->in[i].time_base.num);
  83. } else {
  84. fs->time_base.num = 1;
  85. fs->time_base.den = AV_TIME_BASE;
  86. break;
  87. }
  88. } else {
  89. fs->time_base = fs->in[i].time_base;
  90. }
  91. }
  92. }
  93. if (!fs->time_base.num) {
  94. av_log(fs, AV_LOG_ERROR, "Impossible to set time base\n");
  95. return AVERROR(EINVAL);
  96. }
  97. av_log(fs, AV_LOG_VERBOSE, "Selected %d/%d time base\n",
  98. fs->time_base.num, fs->time_base.den);
  99. }
  100. for (i = 0; i < fs->nb_in; i++)
  101. fs->in[i].pts = fs->in[i].pts_next = AV_NOPTS_VALUE;
  102. fs->sync_level = UINT_MAX;
  103. framesync_sync_level_update(fs);
  104. return 0;
  105. }
  106. static void framesync_advance(FFFrameSync *fs)
  107. {
  108. int latest;
  109. unsigned i;
  110. int64_t pts;
  111. if (fs->eof)
  112. return;
  113. while (!fs->frame_ready) {
  114. latest = -1;
  115. for (i = 0; i < fs->nb_in; i++) {
  116. if (!fs->in[i].have_next) {
  117. if (latest < 0 || fs->in[i].pts < fs->in[latest].pts)
  118. latest = i;
  119. }
  120. }
  121. if (latest >= 0) {
  122. fs->in_request = latest;
  123. break;
  124. }
  125. pts = fs->in[0].pts_next;
  126. for (i = 1; i < fs->nb_in; i++)
  127. if (fs->in[i].pts_next < pts)
  128. pts = fs->in[i].pts_next;
  129. if (pts == INT64_MAX) {
  130. fs->eof = 1;
  131. break;
  132. }
  133. for (i = 0; i < fs->nb_in; i++) {
  134. if (fs->in[i].pts_next == pts ||
  135. (fs->in[i].before == EXT_INFINITY &&
  136. fs->in[i].state == STATE_BOF)) {
  137. av_frame_free(&fs->in[i].frame);
  138. fs->in[i].frame = fs->in[i].frame_next;
  139. fs->in[i].pts = fs->in[i].pts_next;
  140. fs->in[i].frame_next = NULL;
  141. fs->in[i].pts_next = AV_NOPTS_VALUE;
  142. fs->in[i].have_next = 0;
  143. fs->in[i].state = fs->in[i].frame ? STATE_RUN : STATE_EOF;
  144. if (fs->in[i].sync == fs->sync_level && fs->in[i].frame)
  145. fs->frame_ready = 1;
  146. if (fs->in[i].state == STATE_EOF &&
  147. fs->in[i].after == EXT_STOP)
  148. fs->eof = 1;
  149. }
  150. }
  151. if (fs->eof)
  152. fs->frame_ready = 0;
  153. if (fs->frame_ready)
  154. for (i = 0; i < fs->nb_in; i++)
  155. if ((fs->in[i].state == STATE_BOF &&
  156. fs->in[i].before == EXT_STOP))
  157. fs->frame_ready = 0;
  158. fs->pts = pts;
  159. }
  160. }
  161. static int64_t framesync_pts_extrapolate(FFFrameSync *fs, unsigned in,
  162. int64_t pts)
  163. {
  164. /* Possible enhancement: use the link's frame rate */
  165. return pts + 1;
  166. }
  167. static void framesync_inject_frame(FFFrameSync *fs, unsigned in, AVFrame *frame)
  168. {
  169. int64_t pts;
  170. av_assert0(!fs->in[in].have_next);
  171. if (frame) {
  172. pts = av_rescale_q(frame->pts, fs->in[in].time_base, fs->time_base);
  173. frame->pts = pts;
  174. } else {
  175. pts = fs->in[in].state != STATE_RUN || fs->in[in].after == EXT_INFINITY
  176. ? INT64_MAX : framesync_pts_extrapolate(fs, in, fs->in[in].pts);
  177. fs->in[in].sync = 0;
  178. framesync_sync_level_update(fs);
  179. }
  180. fs->in[in].frame_next = frame;
  181. fs->in[in].pts_next = pts;
  182. fs->in[in].have_next = 1;
  183. }
  184. int ff_framesync_add_frame(FFFrameSync *fs, unsigned in, AVFrame *frame)
  185. {
  186. av_assert1(in < fs->nb_in);
  187. if (!fs->in[in].have_next)
  188. framesync_inject_frame(fs, in, frame);
  189. else
  190. ff_bufqueue_add(fs, &fs->in[in].queue, frame);
  191. return 0;
  192. }
  193. void ff_framesync_next(FFFrameSync *fs)
  194. {
  195. unsigned i;
  196. av_assert0(!fs->frame_ready);
  197. for (i = 0; i < fs->nb_in; i++)
  198. if (!fs->in[i].have_next && fs->in[i].queue.available)
  199. framesync_inject_frame(fs, i, ff_bufqueue_get(&fs->in[i].queue));
  200. fs->frame_ready = 0;
  201. framesync_advance(fs);
  202. }
  203. void ff_framesync_drop(FFFrameSync *fs)
  204. {
  205. fs->frame_ready = 0;
  206. }
  207. int ff_framesync_get_frame(FFFrameSync *fs, unsigned in, AVFrame **rframe,
  208. unsigned get)
  209. {
  210. AVFrame *frame;
  211. unsigned need_copy = 0, i;
  212. int64_t pts_next;
  213. int ret;
  214. if (!fs->in[in].frame) {
  215. *rframe = NULL;
  216. return 0;
  217. }
  218. frame = fs->in[in].frame;
  219. if (get) {
  220. /* Find out if we need to copy the frame: is there another sync
  221. stream, and do we know if its current frame will outlast this one? */
  222. pts_next = fs->in[in].have_next ? fs->in[in].pts_next : INT64_MAX;
  223. for (i = 0; i < fs->nb_in && !need_copy; i++)
  224. if (i != in && fs->in[i].sync &&
  225. (!fs->in[i].have_next || fs->in[i].pts_next < pts_next))
  226. need_copy = 1;
  227. if (need_copy) {
  228. if (!(frame = av_frame_clone(frame)))
  229. return AVERROR(ENOMEM);
  230. if ((ret = av_frame_make_writable(frame)) < 0) {
  231. av_frame_free(&frame);
  232. return ret;
  233. }
  234. } else {
  235. fs->in[in].frame = NULL;
  236. }
  237. fs->frame_ready = 0;
  238. }
  239. *rframe = frame;
  240. return 0;
  241. }
  242. void ff_framesync_uninit(FFFrameSync *fs)
  243. {
  244. unsigned i;
  245. for (i = 0; i < fs->nb_in; i++) {
  246. av_frame_free(&fs->in[i].frame);
  247. av_frame_free(&fs->in[i].frame_next);
  248. ff_bufqueue_discard_all(&fs->in[i].queue);
  249. }
  250. av_freep(&fs->in);
  251. }
  252. int ff_framesync_process_frame(FFFrameSync *fs, unsigned all)
  253. {
  254. int ret, count = 0;
  255. av_assert0(fs->on_event);
  256. while (1) {
  257. ff_framesync_next(fs);
  258. if (fs->eof || !fs->frame_ready)
  259. break;
  260. if ((ret = fs->on_event(fs)) < 0)
  261. return ret;
  262. ff_framesync_drop(fs);
  263. count++;
  264. if (!all)
  265. break;
  266. }
  267. if (!count && fs->eof)
  268. return AVERROR_EOF;
  269. return count;
  270. }
  271. int ff_framesync_filter_frame(FFFrameSync *fs, AVFilterLink *inlink,
  272. AVFrame *in)
  273. {
  274. int ret;
  275. if ((ret = ff_framesync_process_frame(fs, 1)) < 0)
  276. return ret;
  277. if ((ret = ff_framesync_add_frame(fs, FF_INLINK_IDX(inlink), in)) < 0)
  278. return ret;
  279. if ((ret = ff_framesync_process_frame(fs, 0)) < 0)
  280. return ret;
  281. return 0;
  282. }
  283. int ff_framesync_request_frame(FFFrameSync *fs, AVFilterLink *outlink)
  284. {
  285. AVFilterContext *ctx = outlink->src;
  286. int input, ret, i;
  287. if ((ret = ff_framesync_process_frame(fs, 0)) < 0)
  288. return ret;
  289. if (ret > 0)
  290. return 0;
  291. if (fs->eof)
  292. return AVERROR_EOF;
  293. input = fs->in_request;
  294. /* Detect status change early */
  295. for (i = 0; i < fs->nb_in; i++)
  296. if (!ff_framequeue_queued_frames(&ctx->inputs[i]->fifo) &&
  297. ctx->inputs[i]->status_in && !ctx->inputs[i]->status_out)
  298. input = i;
  299. ret = ff_request_frame(ctx->inputs[input]);
  300. if (ret == AVERROR_EOF) {
  301. if ((ret = ff_framesync_add_frame(fs, input, NULL)) < 0)
  302. return ret;
  303. if ((ret = ff_framesync_process_frame(fs, 0)) < 0)
  304. return ret;
  305. ret = 0;
  306. }
  307. return ret;
  308. }