circle_buffer.c 2.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117
  1. #include <string.h>
  2. #include "circle_buffer.h"
  3. static int circle_get_write_space(c_buffer_t *cbuff);
  4. static int circle_get_read_space(c_buffer_t *cbuff);
  5. void circle_buffer_init(c_buffer_t *cbuff, uint8_t *buffer, int16_t max_len){
  6. cbuff->buffer = buffer;
  7. cbuff->buffer_len = max_len;
  8. circle_reset(cbuff);
  9. }
  10. void circle_reset(c_buffer_t *cbuff){
  11. cbuff->r_pos = cbuff->w_pos = 0;
  12. }
  13. int circle_put_data(c_buffer_t *cbuff, uint8_t *data, int16_t len){
  14. int16_t size = circle_get_write_space(cbuff);
  15. int16_t w_len = len;
  16. int16_t w1_len = len;
  17. if (size < 0){
  18. return size;
  19. }
  20. w_len = min(len, size);
  21. while(w_len > 0){
  22. //wrapper
  23. if (cbuff->w_pos + w_len > cbuff->buffer_len){
  24. w1_len = cbuff->buffer_len - cbuff->w_pos;
  25. }else{
  26. w1_len = w_len;
  27. }
  28. memcpy(cbuff->buffer + cbuff->w_pos, data, w1_len);
  29. cbuff->w_pos = (cbuff->w_pos + w1_len);
  30. if (cbuff->w_pos == cbuff->buffer_len){
  31. cbuff->w_pos = 0;
  32. }
  33. w_len -= w1_len;
  34. data += w1_len;
  35. }
  36. return min(len, size);
  37. }
  38. int circle_put_one_data(c_buffer_t *cbuff, uint8_t data){
  39. int16_t size = circle_get_write_space(cbuff);
  40. if (size < 0){
  41. return size;
  42. }
  43. cbuff->buffer[cbuff->w_pos] = data;
  44. cbuff->w_pos = cbuff->w_pos + 1;
  45. if (cbuff->w_pos == cbuff->buffer_len){
  46. cbuff->w_pos = 0;
  47. }
  48. return 1;
  49. }
  50. int circle_get_data(c_buffer_t *cbuff, uint8_t *data, int16_t len){
  51. int16_t size = circle_get_read_space(cbuff);
  52. int16_t r_len = len;
  53. int16_t r1_len = 0;
  54. if (size <= 0){
  55. return size;
  56. }
  57. r_len = min(size, len);
  58. while(r_len > 0){
  59. if (cbuff->r_pos + r_len > cbuff->buffer_len){
  60. r1_len = cbuff->buffer_len - cbuff->r_pos;
  61. }else{
  62. r1_len = r_len;
  63. }
  64. memcpy(data, cbuff->buffer + cbuff->r_pos, r1_len);
  65. cbuff->r_pos = (cbuff->r_pos + r1_len);
  66. if (cbuff->r_pos == cbuff->buffer_len){
  67. cbuff->r_pos = 0;
  68. }
  69. r_len -= r1_len;
  70. data += r1_len;
  71. }
  72. return min(size, len);
  73. }
  74. int circle_get_one_data(c_buffer_t *cbuff, uint8_t *data){
  75. int16_t size = circle_get_read_space(cbuff);
  76. if (size <= 0){
  77. return size;
  78. }
  79. *data = cbuff->buffer[cbuff->r_pos];
  80. cbuff->r_pos = cbuff->r_pos + 1;
  81. if (cbuff->r_pos == cbuff->buffer_len){
  82. cbuff->r_pos = 0;
  83. }
  84. return 1;
  85. }
  86. #if 0
  87. static __inline__ int circle_get_write_space(c_buffer_t *cbuff){
  88. int16_t size = (cbuff->w_pos >= cbuff->r_pos)?(cbuff->buffer_len - cbuff->w_pos + cbuff->r_pos):(cbuff->r_pos - cbuff->w_pos);
  89. size -= 1;
  90. if (size <= 0){
  91. return CBUFF_FULL;
  92. }
  93. return size;
  94. }
  95. #endif
  96. static __inline__ int circle_get_read_space(c_buffer_t *cbuff){
  97. int16_t size = (cbuff->r_pos > cbuff->w_pos) ? (cbuff->buffer_len - cbuff->r_pos + cbuff->w_pos) : (cbuff->w_pos - cbuff->r_pos);
  98. if (size <= 0){
  99. return CBUFF_EMPTY;
  100. }
  101. return size;
  102. }