ringbuffer.c 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295
  1. /**
  2. * OpenAL cross platform audio library
  3. * Copyright (C) 1999-2007 by authors.
  4. * This library is free software; you can redistribute it and/or
  5. * modify it under the terms of the GNU Library General Public
  6. * License as published by the Free Software Foundation; either
  7. * version 2 of the License, or (at your option) any later version.
  8. *
  9. * This library is distributed in the hope that it will be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  12. * Library General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU Library General Public
  15. * License along with this library; if not, write to the
  16. * Free Software Foundation, Inc.,
  17. * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  18. * Or go to http://www.gnu.org/copyleft/lgpl.html
  19. */
  20. #include "config.h"
  21. #include <string.h>
  22. #include <stdlib.h>
  23. #include <limits.h>
  24. #include "ringbuffer.h"
  25. #include "align.h"
  26. #include "atomic.h"
  27. #include "threads.h"
  28. #include "almalloc.h"
  29. #include "compat.h"
  30. /* NOTE: This lockless ringbuffer implementation is copied from JACK, extended
  31. * to include an element size. Consequently, parameters and return values for a
  32. * size or count is in 'elements', not bytes. Additionally, it only supports
  33. * single-consumer/single-provider operation. */
  34. struct ll_ringbuffer {
  35. ATOMIC(size_t) write_ptr;
  36. ATOMIC(size_t) read_ptr;
  37. size_t size;
  38. size_t size_mask;
  39. size_t elem_size;
  40. alignas(16) char buf[];
  41. };
  42. ll_ringbuffer_t *ll_ringbuffer_create(size_t sz, size_t elem_sz, int limit_writes)
  43. {
  44. ll_ringbuffer_t *rb;
  45. size_t power_of_two = 0;
  46. if(sz > 0)
  47. {
  48. power_of_two = sz;
  49. power_of_two |= power_of_two>>1;
  50. power_of_two |= power_of_two>>2;
  51. power_of_two |= power_of_two>>4;
  52. power_of_two |= power_of_two>>8;
  53. power_of_two |= power_of_two>>16;
  54. #if SIZE_MAX > UINT_MAX
  55. power_of_two |= power_of_two>>32;
  56. #endif
  57. }
  58. power_of_two++;
  59. if(power_of_two < sz) return NULL;
  60. rb = al_malloc(16, sizeof(*rb) + power_of_two*elem_sz);
  61. if(!rb) return NULL;
  62. ATOMIC_INIT(&rb->write_ptr, 0);
  63. ATOMIC_INIT(&rb->read_ptr, 0);
  64. rb->size = limit_writes ? sz : power_of_two;
  65. rb->size_mask = power_of_two - 1;
  66. rb->elem_size = elem_sz;
  67. return rb;
  68. }
  69. void ll_ringbuffer_free(ll_ringbuffer_t *rb)
  70. {
  71. al_free(rb);
  72. }
  73. void ll_ringbuffer_reset(ll_ringbuffer_t *rb)
  74. {
  75. ATOMIC_STORE(&rb->write_ptr, 0, almemory_order_release);
  76. ATOMIC_STORE(&rb->read_ptr, 0, almemory_order_release);
  77. memset(rb->buf, 0, (rb->size_mask+1)*rb->elem_size);
  78. }
  79. size_t ll_ringbuffer_read_space(const ll_ringbuffer_t *rb)
  80. {
  81. size_t w = ATOMIC_LOAD(&CONST_CAST(ll_ringbuffer_t*,rb)->write_ptr, almemory_order_acquire);
  82. size_t r = ATOMIC_LOAD(&CONST_CAST(ll_ringbuffer_t*,rb)->read_ptr, almemory_order_acquire);
  83. return (w-r) & rb->size_mask;
  84. }
  85. size_t ll_ringbuffer_write_space(const ll_ringbuffer_t *rb)
  86. {
  87. size_t w = ATOMIC_LOAD(&CONST_CAST(ll_ringbuffer_t*,rb)->write_ptr, almemory_order_acquire);
  88. size_t r = ATOMIC_LOAD(&CONST_CAST(ll_ringbuffer_t*,rb)->read_ptr, almemory_order_acquire);
  89. w = (r-w-1) & rb->size_mask;
  90. return (w > rb->size) ? rb->size : w;
  91. }
  92. size_t ll_ringbuffer_read(ll_ringbuffer_t *rb, char *dest, size_t cnt)
  93. {
  94. size_t read_ptr;
  95. size_t free_cnt;
  96. size_t cnt2;
  97. size_t to_read;
  98. size_t n1, n2;
  99. free_cnt = ll_ringbuffer_read_space(rb);
  100. if(free_cnt == 0) return 0;
  101. to_read = (cnt > free_cnt) ? free_cnt : cnt;
  102. read_ptr = ATOMIC_LOAD(&rb->read_ptr, almemory_order_relaxed) & rb->size_mask;
  103. cnt2 = read_ptr + to_read;
  104. if(cnt2 > rb->size_mask+1)
  105. {
  106. n1 = rb->size_mask+1 - read_ptr;
  107. n2 = cnt2 & rb->size_mask;
  108. }
  109. else
  110. {
  111. n1 = to_read;
  112. n2 = 0;
  113. }
  114. memcpy(dest, &rb->buf[read_ptr*rb->elem_size], n1*rb->elem_size);
  115. read_ptr += n1;
  116. if(n2)
  117. {
  118. memcpy(dest + n1*rb->elem_size, &rb->buf[(read_ptr&rb->size_mask)*rb->elem_size],
  119. n2*rb->elem_size);
  120. read_ptr += n2;
  121. }
  122. ATOMIC_STORE(&rb->read_ptr, read_ptr, almemory_order_release);
  123. return to_read;
  124. }
  125. size_t ll_ringbuffer_peek(ll_ringbuffer_t *rb, char *dest, size_t cnt)
  126. {
  127. size_t free_cnt;
  128. size_t cnt2;
  129. size_t to_read;
  130. size_t n1, n2;
  131. size_t read_ptr;
  132. free_cnt = ll_ringbuffer_read_space(rb);
  133. if(free_cnt == 0) return 0;
  134. to_read = (cnt > free_cnt) ? free_cnt : cnt;
  135. read_ptr = ATOMIC_LOAD(&rb->read_ptr, almemory_order_relaxed) & rb->size_mask;
  136. cnt2 = read_ptr + to_read;
  137. if(cnt2 > rb->size_mask+1)
  138. {
  139. n1 = rb->size_mask+1 - read_ptr;
  140. n2 = cnt2 & rb->size_mask;
  141. }
  142. else
  143. {
  144. n1 = to_read;
  145. n2 = 0;
  146. }
  147. memcpy(dest, &rb->buf[read_ptr*rb->elem_size], n1*rb->elem_size);
  148. if(n2)
  149. {
  150. read_ptr += n1;
  151. memcpy(dest + n1*rb->elem_size, &rb->buf[(read_ptr&rb->size_mask)*rb->elem_size],
  152. n2*rb->elem_size);
  153. }
  154. return to_read;
  155. }
  156. size_t ll_ringbuffer_write(ll_ringbuffer_t *rb, const char *src, size_t cnt)
  157. {
  158. size_t write_ptr;
  159. size_t free_cnt;
  160. size_t cnt2;
  161. size_t to_write;
  162. size_t n1, n2;
  163. free_cnt = ll_ringbuffer_write_space(rb);
  164. if(free_cnt == 0) return 0;
  165. to_write = (cnt > free_cnt) ? free_cnt : cnt;
  166. write_ptr = ATOMIC_LOAD(&rb->write_ptr, almemory_order_relaxed) & rb->size_mask;
  167. cnt2 = write_ptr + to_write;
  168. if(cnt2 > rb->size_mask+1)
  169. {
  170. n1 = rb->size_mask+1 - write_ptr;
  171. n2 = cnt2 & rb->size_mask;
  172. }
  173. else
  174. {
  175. n1 = to_write;
  176. n2 = 0;
  177. }
  178. memcpy(&rb->buf[write_ptr*rb->elem_size], src, n1*rb->elem_size);
  179. write_ptr += n1;
  180. if(n2)
  181. {
  182. memcpy(&rb->buf[(write_ptr&rb->size_mask)*rb->elem_size], src + n1*rb->elem_size,
  183. n2*rb->elem_size);
  184. write_ptr += n2;
  185. }
  186. ATOMIC_STORE(&rb->write_ptr, write_ptr, almemory_order_release);
  187. return to_write;
  188. }
  189. void ll_ringbuffer_read_advance(ll_ringbuffer_t *rb, size_t cnt)
  190. {
  191. ATOMIC_ADD(&rb->read_ptr, cnt, almemory_order_acq_rel);
  192. }
  193. void ll_ringbuffer_write_advance(ll_ringbuffer_t *rb, size_t cnt)
  194. {
  195. ATOMIC_ADD(&rb->write_ptr, cnt, almemory_order_acq_rel);
  196. }
  197. void ll_ringbuffer_get_read_vector(const ll_ringbuffer_t *rb, ll_ringbuffer_data_t vec[2])
  198. {
  199. size_t free_cnt;
  200. size_t cnt2;
  201. size_t w, r;
  202. w = ATOMIC_LOAD(&CONST_CAST(ll_ringbuffer_t*,rb)->write_ptr, almemory_order_acquire);
  203. r = ATOMIC_LOAD(&CONST_CAST(ll_ringbuffer_t*,rb)->read_ptr, almemory_order_acquire);
  204. w &= rb->size_mask;
  205. r &= rb->size_mask;
  206. free_cnt = (w-r) & rb->size_mask;
  207. cnt2 = r + free_cnt;
  208. if(cnt2 > rb->size_mask+1)
  209. {
  210. /* Two part vector: the rest of the buffer after the current write ptr,
  211. * plus some from the start of the buffer. */
  212. vec[0].buf = (char*)&rb->buf[r*rb->elem_size];
  213. vec[0].len = rb->size_mask+1 - r;
  214. vec[1].buf = (char*)rb->buf;
  215. vec[1].len = cnt2 & rb->size_mask;
  216. }
  217. else
  218. {
  219. /* Single part vector: just the rest of the buffer */
  220. vec[0].buf = (char*)&rb->buf[r*rb->elem_size];
  221. vec[0].len = free_cnt;
  222. vec[1].buf = NULL;
  223. vec[1].len = 0;
  224. }
  225. }
  226. void ll_ringbuffer_get_write_vector(const ll_ringbuffer_t *rb, ll_ringbuffer_data_t vec[2])
  227. {
  228. size_t free_cnt;
  229. size_t cnt2;
  230. size_t w, r;
  231. w = ATOMIC_LOAD(&CONST_CAST(ll_ringbuffer_t*,rb)->write_ptr, almemory_order_acquire);
  232. r = ATOMIC_LOAD(&CONST_CAST(ll_ringbuffer_t*,rb)->read_ptr, almemory_order_acquire);
  233. w &= rb->size_mask;
  234. r &= rb->size_mask;
  235. free_cnt = (r-w-1) & rb->size_mask;
  236. if(free_cnt > rb->size) free_cnt = rb->size;
  237. cnt2 = w + free_cnt;
  238. if(cnt2 > rb->size_mask+1)
  239. {
  240. /* Two part vector: the rest of the buffer after the current write ptr,
  241. * plus some from the start of the buffer. */
  242. vec[0].buf = (char*)&rb->buf[w*rb->elem_size];
  243. vec[0].len = rb->size_mask+1 - w;
  244. vec[1].buf = (char*)rb->buf;
  245. vec[1].len = cnt2 & rb->size_mask;
  246. }
  247. else
  248. {
  249. vec[0].buf = (char*)&rb->buf[w*rb->elem_size];
  250. vec[0].len = free_cnt;
  251. vec[1].buf = NULL;
  252. vec[1].len = 0;
  253. }
  254. }