bufferqueue.h 3.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121
  1. /*
  2. * Generic buffer queue
  3. * Copyright (c) 2012 Nicolas George
  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. #ifndef AVFILTER_BUFFERQUEUE_H
  22. #define AVFILTER_BUFFERQUEUE_H
  23. /**
  24. * FFBufQueue: simple AVFrame queue API
  25. *
  26. * Note: this API is not thread-safe. Concurrent access to the same queue
  27. * must be protected by a mutex or any synchronization mechanism.
  28. */
  29. /**
  30. * Maximum size of the queue.
  31. *
  32. * This value can be overridden by definying it before including this
  33. * header.
  34. * Powers of 2 are recommended.
  35. */
  36. #ifndef FF_BUFQUEUE_SIZE
  37. #define FF_BUFQUEUE_SIZE 64
  38. #endif
  39. #include "avfilter.h"
  40. #include "libavutil/avassert.h"
  41. /**
  42. * Structure holding the queue
  43. */
  44. struct FFBufQueue {
  45. AVFrame *queue[FF_BUFQUEUE_SIZE];
  46. unsigned short head;
  47. unsigned short available; /**< number of available buffers */
  48. };
  49. #define BUCKET(i) queue->queue[(queue->head + (i)) % FF_BUFQUEUE_SIZE]
  50. /**
  51. * Test if a buffer queue is full.
  52. */
  53. static inline int ff_bufqueue_is_full(struct FFBufQueue *queue)
  54. {
  55. return queue->available == FF_BUFQUEUE_SIZE;
  56. }
  57. /**
  58. * Add a buffer to the queue.
  59. *
  60. * If the queue is already full, then the current last buffer is dropped
  61. * (and unrefed) with a warning before adding the new buffer.
  62. */
  63. static inline void ff_bufqueue_add(void *log, struct FFBufQueue *queue,
  64. AVFrame *buf)
  65. {
  66. if (ff_bufqueue_is_full(queue)) {
  67. av_log(log, AV_LOG_WARNING, "Buffer queue overflow, dropping.\n");
  68. av_frame_free(&BUCKET(--queue->available));
  69. }
  70. BUCKET(queue->available++) = buf;
  71. }
  72. /**
  73. * Get a buffer from the queue without altering it.
  74. *
  75. * Buffer with index 0 is the first buffer in the queue.
  76. * Return NULL if the queue has not enough buffers.
  77. */
  78. static inline AVFrame *ff_bufqueue_peek(struct FFBufQueue *queue,
  79. unsigned index)
  80. {
  81. return index < queue->available ? BUCKET(index) : NULL;
  82. }
  83. /**
  84. * Get the first buffer from the queue and remove it.
  85. *
  86. * Do not use on an empty queue.
  87. */
  88. static inline AVFrame *ff_bufqueue_get(struct FFBufQueue *queue)
  89. {
  90. AVFrame *ret = queue->queue[queue->head];
  91. av_assert0(queue->available);
  92. queue->available--;
  93. queue->queue[queue->head] = NULL;
  94. queue->head = (queue->head + 1) % FF_BUFQUEUE_SIZE;
  95. return ret;
  96. }
  97. /**
  98. * Unref and remove all buffers from the queue.
  99. */
  100. static inline void ff_bufqueue_discard_all(struct FFBufQueue *queue)
  101. {
  102. while (queue->available) {
  103. AVFrame *buf = ff_bufqueue_get(queue);
  104. av_frame_free(&buf);
  105. }
  106. }
  107. #undef BUCKET
  108. #endif /* AVFILTER_BUFFERQUEUE_H */