C语言-一种写缓存区数组的方法

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define WRITE_BUFFER_SIZE 4096
static unsigned char write_buffer[WRITE_BUFFER_SIZE];
static unsigned char *bufptr;

static int flushbuffer(int size)
{
    return 0;
}

static void bufwrite1(char *p, int n)
{
    while(--n > 0)
    {
        if (bufptr == &write_buffer[WRITE_BUFFER_SIZE])
        {
            if (flushbuffer(WRITE_BUFFER_SIZE) != 0)
            {
                printf("flushbuffer failed \r\n");
            }
            bufptr = write_buffer;
        }
        *bufptr++ = *p++;
    }
}

static void bufwrite(unsigned char *p, int n)
{
    while (n > 0)
    {
        int k, rem;
        if (bufptr == &write_buffer[WRITE_BUFFER_SIZE])
        {
            if (flushbuffer(WRITE_BUFFER_SIZE) != 0)
            {
                printf("flushbuffer failed \r\n");
            }
            bufptr = write_buffer;
        }

        rem = WRITE_BUFFER_SIZE - (bufptr - write_buffer);
        k = n > rem ? rem : n;
        memcpy(bufptr, p, k);
        bufptr += k;
        p += k;
        n -= k;
    }
}

int main(int argc, char *argv[])
{
    printf("hello tyustli\r\n");
    bufptr = write_buffer;

    return 0;
}
  • 1
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
环形缓存滑窗是一种常见的数据缓存方式,它可以在固定大小的缓冲中存储数据,并且可以循环使用。当添加数据时,head指针前进;当使用数据时,tail指针向前移动。当到达缓冲的尾部时,指针又回到缓冲的起始位置。这种方式可以有效地解决在C语言编程场景中需要对一段不定长数据进行缓存的问题。 以下是一个基于数组的环形缓冲队列的C语言代码示例: ``` #include <stdio.h> #include <stdlib.h> #include <assert.h> #define BUFFER_SIZE 5 typedef unsigned char UINT8; typedef unsigned int UINT32; UINT8 buffer[BUFFER_SIZE] = {0}; UINT32 head = 0; UINT32 tail = 0; void writeRingbuffer(UINT8 *data, UINT32 len) { UINT32 i; for(i = 0; i < len; i++) { buffer[head] = data[i]; head = (head + 1) % BUFFER_SIZE; if(head == tail) { tail = (tail + 1) % BUFFER_SIZE; } } } UINT32 readRingbuffer(UINT8 *data, UINT32 len) { UINT32 i; UINT32 readLen = 0; for(i = 0; i < len; i++) { if(head == tail) { break; } data[i] = buffer[tail]; tail = (tail + 1) % BUFFER_SIZE; readLen++; } return readLen; } void releaseRingbuffer() { head = 0; tail = 0; } int main() { UINT8 c; UINT32 readLen,i; UINT8 readBuffer[5] = {0}; printf("Please enter a line>\n"); do{ c = getchar(); putchar(c); switch(c) { case 'Q': goto exit; break; case 'R': readLen = readRingbuffer(readBuffer,5); printf("readRingbuffer len:%d\n",readLen); if(readLen > 0) { printf("readRingbuffer:"); for(i = 0; i < readLen; i++) { printf("%c ",(UINT8)readBuffer[i]); } printf("\n"); } break; default : if(c != '\n') writeRingbuffer((UINT8*)&c,1); break; } }while(1); exit: releaseRingbuffer(); printf("\nexit!\n"); return 0; } ```
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值