No Description
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.

ring.c 2.9KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112
  1. /*
  2. * ring.c
  3. *
  4. * Copyright (c) 2023 Thomas Buck (thomas@xythobuz.de)
  5. *
  6. * This program is free software: you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License as published by
  8. * the Free Software Foundation, either version 3 of the License, or
  9. * (at your option) any later version.
  10. *
  11. * This program 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 General Public License for more details.
  15. *
  16. * See <http://www.gnu.org/licenses/>.
  17. */
  18. #define MIN(x, y) ((x < y) ? x : y)
  19. #include <string.h>
  20. #include "config.h"
  21. #include "ring.h"
  22. void rb_add(struct ring_buffer *rb, const void *data, size_t length) {
  23. for (size_t i = 0; i < length; i++) {
  24. memcpy(rb->buffer + rb->head * rb->el_len, data + i * rb->el_len, rb->el_len);
  25. if (rb->full && (++(rb->tail) == rb->size)) {
  26. rb->tail = 0;
  27. }
  28. if (++(rb->head) == rb->size) {
  29. rb->head = 0;
  30. }
  31. rb->full = ((rb->head) == (rb->tail));
  32. }
  33. }
  34. size_t rb_len(struct ring_buffer *rb) {
  35. if (rb->head == rb->tail) {
  36. if (rb->full) {
  37. return rb->size;
  38. } else {
  39. return 0;
  40. }
  41. } else if (rb->head > rb->tail) {
  42. return rb->head - rb->tail;
  43. } else {
  44. return rb->size - rb->tail + rb->head;
  45. }
  46. }
  47. void rb_dump(struct ring_buffer *rb, void (*write)(const void *, size_t), size_t skip) {
  48. if (rb_len(rb) <= skip) {
  49. return;
  50. }
  51. if (rb->head > rb->tail) {
  52. if ((rb->head - rb->tail) > skip) {
  53. write(rb->buffer + ((rb->tail + skip) * rb->el_len), rb->head - rb->tail - skip);
  54. }
  55. } else {
  56. if ((rb->size - rb->tail) > skip) {
  57. write(rb->buffer + ((rb->tail + skip) * rb->el_len), rb->size - rb->tail - skip);
  58. }
  59. skip -= MIN(skip, rb->size - rb->tail);
  60. if (rb->head > skip) {
  61. write(rb->buffer + (skip + rb->el_len), rb->head - skip);
  62. }
  63. }
  64. }
  65. void rb_move(struct ring_buffer *rb, void (*write)(const void *, size_t)) {
  66. rb_dump(rb, write, 0);
  67. rb->head = 0;
  68. rb->tail = 0;
  69. rb->full = false;
  70. }
  71. void rb_peek(struct ring_buffer *rb, void *buf) {
  72. if (rb_len(rb) == 0) {
  73. return;
  74. }
  75. memcpy(buf, rb->buffer + rb->tail * rb->el_len, rb->el_len);
  76. }
  77. void rb_pop(struct ring_buffer *rb, void *buf) {
  78. if (rb_len(rb) == 0) {
  79. return;
  80. }
  81. memcpy(buf, rb->buffer + rb->tail * rb->el_len, rb->el_len);
  82. rb->tail++;
  83. if (rb->tail >= rb->size) {
  84. rb->tail = 0;
  85. }
  86. }
  87. size_t rb_get(struct ring_buffer *rb, void *data, size_t length) {
  88. size_t count = 0;
  89. while ((length > 0) && (rb_len(rb) > 0)) {
  90. rb_pop(rb, data + count * rb->el_len);
  91. count++;
  92. length--;
  93. }
  94. return count;
  95. }