DEEPSEEK帮写的STM32消息流函数,直接可用.已经测试

cpp 复制代码
#include "main.h"
#include "MessageBuffer.h"


static RingBuffer msgQueue = {0};

// 初始化队列
void InitQueue(void) {
    msgQueue.head = 0;
    msgQueue.tail = 0;
    msgQueue.count = 0;
}

// 检查队列状态
type_usart_queue_status GetQueueStatus(void) {
    if (msgQueue.count == 0) {
        return USART_QUEUE_EMPTY;
    } else if (msgQueue.count >= (QUEUE_SIZE - MAX_MSG_LEN - sizeof(uint16_t))) {
        return USART_QUEUE_FULL;
    }
    return USART_QUEUE_OK;
}

// 中断安全的推送消息到队列
type_usart_queue_status PushMsgData(type_Msg *pMsg) {
    uint32_t primask;
    type_usart_queue_status result = USART_QUEUE_ERR;
    
    if (pMsg == NULL || pMsg->Length == 0 || pMsg->pData == NULL) {
        return USART_QUEUE_ERR;
    }

    // 检查消息长度是否有效
    if (pMsg->Length > MAX_MSG_LEN) {
        return USART_QUEUE_ERR;
    }

    // 进入临界区(关闭中断)
    primask = __get_PRIMASK();
    __disable_irq();

    // 检查是否有足够空间
    if ((QUEUE_SIZE - msgQueue.count) >= (pMsg->Length + sizeof(uint16_t))) {
        // 写入消息长度(小端格式)
        msgQueue.buffer[msgQueue.head] = (uint8_t)(pMsg->Length & 0xFF);
        msgQueue.head = (msgQueue.head + 1) % QUEUE_SIZE;
        msgQueue.buffer[msgQueue.head] = (uint8_t)((pMsg->Length >> 8) & 0xFF);
        msgQueue.head = (msgQueue.head + 1) % QUEUE_SIZE;

        // 写入消息数据
        for (uint16_t i = 0; i < pMsg->Length; i++) {
            msgQueue.buffer[msgQueue.head] = pMsg->pData[i];
            msgQueue.head = (msgQueue.head + 1) % QUEUE_SIZE;
        }

        msgQueue.count += (pMsg->Length + sizeof(uint16_t));
        result = USART_QUEUE_OK;
    } else {
        result = USART_QUEUE_FULL;
    }

    // 退出临界区(恢复中断状态)
    __set_PRIMASK(primask);

    return result;
}

// 从队列弹出消息(主程序中使用)
type_usart_queue_status PopMsgData(type_Msg *pMsg) {
    uint32_t primask;
    type_usart_queue_status result = USART_QUEUE_ERR;
    
    if (pMsg == NULL || pMsg->pData == NULL) {
        return USART_QUEUE_ERR;
    }

    // 进入临界区(关闭中断)
    primask = __get_PRIMASK();
    __disable_irq();

    if (msgQueue.count == 0) {
        result = USART_QUEUE_EMPTY;
    } else {
        // 读取消息长度(小端格式)
        uint16_t msgLength = msgQueue.buffer[msgQueue.tail];
        msgQueue.tail = (msgQueue.tail + 1) % QUEUE_SIZE;
        msgLength |= (uint16_t)(msgQueue.buffer[msgQueue.tail] << 8);
        msgQueue.tail = (msgQueue.tail + 1) % QUEUE_SIZE;

        // 检查消息长度是否有效
        if (msgLength <= MAX_MSG_LEN) {
            // 读取消息数据
            for (uint16_t i = 0; i < msgLength; i++) {
                pMsg->pData[i] = msgQueue.buffer[msgQueue.tail];
                msgQueue.tail = (msgQueue.tail + 1) % QUEUE_SIZE;
            }

            pMsg->Length = msgLength;
            msgQueue.count -= (msgLength + sizeof(uint16_t));
            result = USART_QUEUE_OK;
        } else {
            // 无效长度,重置队列
            InitQueue();
            result = USART_QUEUE_ERR;
        }
    }

    // 退出临界区(恢复中断状态)
    __set_PRIMASK(primask);

    return result;
}
cpp 复制代码
#ifndef __MESSAGEBUFFER_H__
#define __MESSAGEBUFFER_H__


#define QUEUE_SIZE  1024*3    // 环形队列缓冲区大小
#define MAX_MSG_LEN 1024       // 单条消息最大长度

typedef struct {
    uint16_t Length;
    uint8_t *pData;
} type_Msg;

typedef struct {
    uint8_t buffer[QUEUE_SIZE];
    volatile uint16_t head;     // 使用volatile确保中断和主程序都能正确访问
    volatile uint16_t tail;
    volatile uint16_t count;
} RingBuffer;


//typedef enum
//{
//	USART_QUEUE_EMPTY = 0,
//	USART_QUEUE_FULL = 1,
//	USART_QUEUE_OK = 2,
//    USART_QUEUE_ERR = 3,
//} type_usart_queue_status;


void MessageBufferInitFunc(void);
type_usart_queue_status PopMsgData(type_Msg *pMsg);
type_usart_queue_status PushMsgData(type_Msg *pMsg);


#endif

中断压入:

type_Msg RevMsg; //接收消息

RevMsg.Length = counter;

RevMsg.pData = RevBuff;

PushMsgData(&RevMsg);

主程序取出:

if (PopMsgData(&RevMsg) == USART_QUEUE_OK)

{

SendFlag = 1;

SendUartDataFunc(USART1, RevMsg.pData, RevMsg.Length);

}

相关推荐
ting94520004 小时前
Humalike X Hermes 深度技术剖析:单指令注入群聊社交智能的底层架构、算法与跨 IM 平台实现
人工智能·算法·架构
吴声子夜歌4 小时前
Java面试——算法
java·算法·面试
h_a_o777oah4 小时前
【图论】Tarjan 缩点:解决有向图中环的问题
c++·算法·图论·acm·强连通分量·缩点·tarjan
Tisfy4 小时前
LeetCode 1386.安排电影院座位:哈希表+位运算
算法·leetcode·散列表·题解·哈希表
Nil2085 小时前
leetcode 199二叉树的右视图
算法·leetcode·深度优先
M78佐菲6 小时前
c语言学习笔记:排序与查找方法整理
linux·c语言·笔记·学习·算法
AI备案指南-满满8 小时前
人工智能拟人化互动服务安全自评估报告的评估要点有哪些?
人工智能·算法·安全·机器人·大模型备案·算法备案
土司大王9 小时前
LeetCode hot100——两两交换链表中的节点
算法·leetcode·职场和发展
大熊背10 小时前
树莓派IspPipeline LSC模块原理详解
算法·lsc·isppipeline·mesh lsc