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.

134 lines
3.5KB

  1. /*
  2. * a very simple circular buffer FIFO implementation
  3. * Copyright (c) 2000, 2001, 2002 Fabrice Bellard
  4. * Copyright (c) 2006 Roman Shaposhnik
  5. *
  6. * This file is part of Libav.
  7. *
  8. * Libav 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. * Libav 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 Libav; if not, write to the Free Software
  20. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  21. */
  22. #include "common.h"
  23. #include "fifo.h"
  24. AVFifoBuffer *av_fifo_alloc(unsigned int size)
  25. {
  26. AVFifoBuffer *f = av_mallocz(sizeof(AVFifoBuffer));
  27. if (!f)
  28. return NULL;
  29. f->buffer = av_malloc(size);
  30. f->end = f->buffer + size;
  31. av_fifo_reset(f);
  32. if (!f->buffer)
  33. av_freep(&f);
  34. return f;
  35. }
  36. void av_fifo_free(AVFifoBuffer *f)
  37. {
  38. if (f) {
  39. av_free(f->buffer);
  40. av_free(f);
  41. }
  42. }
  43. void av_fifo_reset(AVFifoBuffer *f)
  44. {
  45. f->wptr = f->rptr = f->buffer;
  46. f->wndx = f->rndx = 0;
  47. }
  48. int av_fifo_size(AVFifoBuffer *f)
  49. {
  50. return (uint32_t)(f->wndx - f->rndx);
  51. }
  52. int av_fifo_space(AVFifoBuffer *f)
  53. {
  54. return f->end - f->buffer - av_fifo_size(f);
  55. }
  56. int av_fifo_realloc2(AVFifoBuffer *f, unsigned int new_size)
  57. {
  58. unsigned int old_size = f->end - f->buffer;
  59. if (old_size < new_size) {
  60. int len = av_fifo_size(f);
  61. AVFifoBuffer *f2 = av_fifo_alloc(new_size);
  62. if (!f2)
  63. return AVERROR(ENOMEM);
  64. av_fifo_generic_read(f, f2->buffer, len, NULL);
  65. f2->wptr += len;
  66. f2->wndx += len;
  67. av_free(f->buffer);
  68. *f = *f2;
  69. av_free(f2);
  70. }
  71. return 0;
  72. }
  73. /* src must NOT be const as it can be a context for func that may need
  74. * updating (like a pointer or byte counter) */
  75. int av_fifo_generic_write(AVFifoBuffer *f, void *src, int size,
  76. int (*func)(void *, void *, int))
  77. {
  78. int total = size;
  79. do {
  80. int len = FFMIN(f->end - f->wptr, size);
  81. if (func) {
  82. if (func(src, f->wptr, len) <= 0)
  83. break;
  84. } else {
  85. memcpy(f->wptr, src, len);
  86. src = (uint8_t *)src + len;
  87. }
  88. // Write memory barrier needed for SMP here in theory
  89. f->wptr += len;
  90. if (f->wptr >= f->end)
  91. f->wptr = f->buffer;
  92. f->wndx += len;
  93. size -= len;
  94. } while (size > 0);
  95. return total - size;
  96. }
  97. int av_fifo_generic_read(AVFifoBuffer *f, void *dest, int buf_size,
  98. void (*func)(void *, void *, int))
  99. {
  100. // Read memory barrier needed for SMP here in theory
  101. do {
  102. int len = FFMIN(f->end - f->rptr, buf_size);
  103. if (func)
  104. func(dest, f->rptr, len);
  105. else {
  106. memcpy(dest, f->rptr, len);
  107. dest = (uint8_t *)dest + len;
  108. }
  109. // memory barrier needed for SMP here in theory
  110. av_fifo_drain(f, len);
  111. buf_size -= len;
  112. } while (buf_size > 0);
  113. return 0;
  114. }
  115. /** Discard data from the FIFO. */
  116. void av_fifo_drain(AVFifoBuffer *f, int size)
  117. {
  118. f->rptr += size;
  119. if (f->rptr >= f->end)
  120. f->rptr -= f->end - f->buffer;
  121. f->rndx += size;
  122. }