circle_buffer.c 2.7 KB

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