设为首页收藏本站
开启辅助访问 切换到宽版

 找回密码
 立即注册

QQ登录

只需一步，快速开始

热门： 51单片机 | 24小时必答区 | 单片机教程 | 单片机DIY制作 | STM32 | Cortex M3 | 模数电子 | 电子DIY制作 | 音响/功放 | 拆机乐园 | Arduino | 嵌入式OS | 程序设计

搜索
»论坛 › 嵌入式/单片机论坛 › MCU综合技术区 › 环形缓存区ring_buffer源程序
返回列表 发新帖
查看: 2657|回复: 1
打印 上一主题 下一主题
收起左侧

环形缓存区ring_buffer源程序

[复制链接]
跳转到指定楼层
楼主
ID:423034 发表于 2018-11-13 17:07 | 只看该作者 回帖奖励 |倒序浏览 |阅读模式
串口数据接收 及发送处理 节省空间 高效率

单片机源程序如下:
  1. #include <stdlib.h>
  2. #include <string.h>
  3. #include "ring_buffer.h"

  5. /*****************************************************************************
  6. * Private types/enumerations/variables
  7. ****************************************************************************/

  9. #define RB_INDH(rb)                ((rb)->head & ((rb)->count - 1))
  10. #define RB_INDT(rb)                ((rb)->tail & ((rb)->count - 1))

  12. #if !defined(MAX)
  13. #define MAX(a, b) (((a) > (b)) ? (a) : (b))
  14. #endif
  15. #if !defined(MIN)
  16. #define MIN(a, b) (((a) < (b)) ? (a) : (b))
  17. #endif
  18. /*****************************************************************************
  19. * Public types/enumerations/variables
  20. ****************************************************************************/

  22. /*****************************************************************************
  23. * Private functions
  24. ****************************************************************************/

  26. /*****************************************************************************
  27. * Public functions
  28. ****************************************************************************/

  30. /**
  31. * @brief        Resets the ring buffer to empty
  32. * @param        RingBuff        : Pointer to ring buffer
  33. * @return        Nothing
  34. */
  35. void RingBuffer_Flush(RINGBUFF_T *RingBuff)
  36. {
  37.     RingBuff->head = RingBuff->tail = 0;
  38. }

  40. /**
  41. * @brief        Return size the ring buffer
  42. * @param        RingBuff        : Pointer to ring buffer
  43. * @return        Size of the ring buffer in bytes
  44. */
  45. int RingBuffer_GetSize(RINGBUFF_T *RingBuff)
  46. {
  47.     return RingBuff->count;
  48. }

  50. /**
  51. * @brief        Return number of items in the ring buffer
  52. * @param        RingBuff        : Pointer to ring buffer
  53. * @return        Number of items in the ring buffer
  54. */
  55. static int RingBuffer_GetCount(RINGBUFF_T *RingBuff)
  56. {
  57.     return RB_VHEAD(RingBuff) - RB_VTAIL(RingBuff);
  58. }

  60. /**
  61. * @brief        Return number of free items in the ring buffer
  62. * @param        RingBuff        : Pointer to ring buffer
  63. * @return        Number of free items in the ring buffer
  64. */
  65. static int RingBuffer_GetFree(RINGBUFF_T *RingBuff)
  66. {
  67.     return RingBuff->count - RingBuffer_GetCount(RingBuff);
  68. }

  70. /**
  71. * @brief        Return number of items in the ring buffer
  72. * @param        RingBuff        : Pointer to ring buffer
  73. * @return        1 if the ring buffer is full, otherwise 0
  74. */
  75. int RingBuffer_IsFull(RINGBUFF_T *RingBuff)
  76. {
  77.     return (RingBuffer_GetCount(RingBuff) >= RingBuff->count);
  78. }

  80. /**
  81. * @brief        Return empty status of ring buffer
  82. * @param        RingBuff        : Pointer to ring buffer
  83. * @return        1 if the ring buffer is empty, otherwise 0
  84. */
  85. int RingBuffer_IsEmpty(RINGBUFF_T *RingBuff)
  86. {
  87.     return RB_VHEAD(RingBuff) == RB_VTAIL(RingBuff);
  88. }
  89. /* Initialize ring buffer */
  90. int RingBuffer_Init(RINGBUFF_T *RingBuff, void *buffer, int itemSize, int count)
  91. {
  92.     RingBuff->data = buffer;
  93.     RingBuff->count = count;
  94.     RingBuff->itemSz = itemSize;
  95.     RingBuff->head = RingBuff->tail = 0;

  97.     return 1;
  98. }

  100. /* Insert a single item into Ring Buffer */
  101. int RingBuffer_Insert(RINGBUFF_T *RingBuff, const void *data)
  102. {
  103.     u8 *ptr = RingBuff->data;

  105.     /* We cannot insert when queue is full */
  106.     if (RingBuffer_IsFull(RingBuff))
  107.         return 0;
  108.     ptr += RB_INDH(RingBuff) * RingBuff->itemSz;
  109.     memcpy(ptr, data, RingBuff->itemSz);
  110.     RingBuff->head++;
  111.     return 1;
  112. }

  114. /* Insert multiple items into Ring Buffer */
  115. int RingBuffer_InsertMult(RINGBUFF_T *RingBuff, const void *data, int num)
  116. {
  117.     u8 *ptr = RingBuff->data;
  118.     int cnt1, cnt2;

  120.     /* We cannot insert when queue is full */
  121.     if (RingBuffer_IsFull(RingBuff))
  122.         return 0;

  124.     /* Calculate the segment lengths */
  125.     cnt1 = cnt2 = RingBuffer_GetFree(RingBuff);
  126.     if (RB_INDH(RingBuff) + cnt1 >= RingBuff->count)
  127.         cnt1 = RingBuff->count - RB_INDH(RingBuff);
  128.     cnt2 -= cnt1;

  130.     cnt1 = MIN(cnt1, num);
  131.     num -= cnt1;

  133.     cnt2 = MIN(cnt2, num);
  134.     num -= cnt2;

  136.     /* Write segment 1 */
  137.     ptr += RB_INDH(RingBuff) * RingBuff->itemSz;
  138.     memcpy(ptr, data, cnt1 * RingBuff->itemSz);
  139.     RingBuff->head += cnt1;

  141.     /* Write segment 2 */
  142.     ptr = (u8 *) RingBuff->data + RB_INDH(RingBuff) * RingBuff->itemSz;
  143.     data = (const u8 *) data + cnt1 * RingBuff->itemSz;
  144.     memcpy(ptr, data, cnt2 * RingBuff->itemSz);
  145.     RingBuff->head += cnt2;

  147.     return cnt1 + cnt2;
  148. }

  150. /* Pop single item from Ring Buffer */
  151. int RingBuffer_Pop(RINGBUFF_T *RingBuff, void *data)
  152. {
  153.     u8 *ptr = RingBuff->data;

  155.     /* We cannot pop when queue is empty */
  156.     if (RingBuffer_IsEmpty(RingBuff))
  157.         return 0;

  159.     ptr += RB_INDT(RingBuff) * RingBuff->itemSz;
  160.     memcpy(data, ptr, RingBuff->itemSz);
  161.     RingBuff->tail++;

  163.     return 1;
  164. }

  166. /* Pop multiple items from Ring buffer */
  167. int RingBuffer_PopMult(RINGBUFF_T *RingBuff, void *data, int num)
  168. {
  169.     u8 *ptr = RingBuff->data;
  170.     int cnt1, cnt2;

  172.     /* We cannot insert when queue is empty */
  173.     if (RingBuffer_IsEmpty(RingBuff))
  174.         return 0;

  176.     /* Calculate the segment lengths */
  177.     cnt1 = cnt2 = RingBuffer_GetCount(RingBuff);
  178.     if (RB_INDT(RingBuff) + cnt1 >= RingBuff->count)
  179.         cnt1 = RingBuff->count - RB_INDT(RingBuff);
  180.     cnt2 -= cnt1;

  182.     cnt1 = MIN(cnt1, num);
  183.     num -= cnt1;

  185.     cnt2 = MIN(cnt2, num);
  186.     num -= cnt2;

  188.     /* Write segment 1 */
  189.     ptr += RB_INDT(RingBuff) * RingBuff->itemSz;
  190.     memcpy(data, ptr, cnt1 * RingBuff->itemSz);
  191.     RingBuff->tail += cnt1;

  193.     /* Write segment 2 */
  194.     ptr = (u8 *) RingBuff->data + RB_INDT(RingBuff) * RingBuff->itemSz;
  195.     data = (u8 *) data + cnt1 * RingBuff->itemSz;
  196.     memcpy(data, ptr, cnt2 * RingBuff->itemSz);
  197.     RingBuff->tail += cnt2;

  199.     return cnt1 + cnt2;
  200. }
复制代码

所有资料51hei提供下载:
ring_buffer.zip (3.77 KB, 下载次数: 30)


评分

参与人数 1黑币 +50 收起 理由
admin + 50 共享资料的黑币奖励！

查看全部评分

分享到:  QQ好友和群QQ好友和群 QQ空间QQ空间 腾讯微博腾讯微博 腾讯朋友腾讯朋友
收藏收藏1 分享淘帖 顶顶 踩踩
回复

使用道具 举报

沙发
ID:92520 发表于 2020-1-18 10:56 | 只看该作者
正是需要的，感谢分享！
回复

使用道具 举报

返回列表 发新帖
高级模式
B Color Image Link Quote Code Smilies
您需要登录后才可以回帖 登录 | 立即注册

本版积分规则

手机版|小黑屋|51黑电子论坛 |51黑电子论坛6群 QQ 管理员QQ:125739409;技术交流QQ群281945664

Powered by 单片机教程网

快速回复 返回顶部 返回列表