首页
学习
活动
专区
圈层
工具
发布
社区首页 >问答首页 >通用环缓冲器

通用环缓冲器
EN

Stack Overflow用户
提问于 2018-05-18 14:13:24
回答 1查看 184关注 0票数 1

我实现了一个通用的环缓冲区,但是我遇到了一些奇怪的results.First --我成功地推送了15个整数,但是当我试图打印到缓冲区的内容时,它打印了一些错误的元素。

首先,我正在为10 integers.Then分配内存,我试图推动15和调整缓冲区的大小出现在place.Maybe中,调整大小以某种方式破坏了它,因为如果没有它,它就能正常工作。

RingBuffer.c

代码语言:javascript
复制
#include<stdlib.h>
#include<string.h>
#include <stdio.h>
#include"RingBuffer.h"

unsigned char RingInit(RingBuffer* buffer, int elemLen, int elemSize, void (*fn)(void*))
{
    buffer->dataLen = elemLen;
    buffer->dataSize = elemSize;
    
    if( (buffer->data = malloc( buffer->dataSize * buffer->dataLen )) == NULL){
        
        return 1;
    }

    buffer->head = 0;
    buffer->tail = 0;
    buffer->elemCount = 0;
    buffer->freeFn = fn;
    buffer->doResize = 1;
    buffer->resizeBy = 2;
    
    return 0;
}

unsigned char RingPush(RingBuffer* buffer, void* elem)
{
    if(RingIsFull(buffer)){

        if(!buffer->doResize || RingResize(buffer)){
            
            return 1;
        }
    }

    memcpy((buffer->data + (buffer->head*buffer->dataSize)), elem, buffer->dataSize);
    buffer->head = (buffer->head + 1) % buffer->dataLen;
    buffer->elemCount++;
    
    return 0;
}

unsigned char RingRead(RingBuffer* buffer, void* elem)
{
    if(!RingIsEmpty(buffer)){
        
        memcpy(elem, (buffer->data + (buffer->tail*buffer->dataSize)), buffer->dataSize);
        buffer->tail = (buffer->tail + 1) % buffer->dataLen;
        buffer->elemCount--;

        return 0;
    }

    return 1;
}

unsigned char RingIsEmpty(RingBuffer* buffer)
{
    return (buffer->elemCount == 0);
}

unsigned char RingIsFull(RingBuffer* buffer)
{
    return (buffer->elemCount == buffer->dataLen);
}

void RingFree(RingBuffer* buffer)
{
    buffer->freeFn(buffer->data);
}

unsigned char RingResize(RingBuffer* buffer)
{
    unsigned char* newMemory = NULL;

    if ( (newMemory = realloc(buffer->data, buffer->dataLen + (buffer->resizeBy * buffer->dataSize))) == NULL){
        
        return 1;
    }
    
    buffer->data = newMemory;
    buffer->dataLen += buffer->resizeBy;    
    buffer->head = buffer->elemCount;
    
    return 0;
}

RingBuffer.h

代码语言:javascript
复制
#ifndef RINGBUFFER_H_
#define RINGBUFFER_H_

typedef struct
{
    void *data;
    int dataSize;
    int dataLen;
    int head;
    int tail;
    int elemCount;
    int doResize;
    int resizeBy;
    void (*freeFn)(void*);

}RingBuffer;

unsigned char RingInit      (RingBuffer* buffer, int elemLen, int elemSize, void (*fn)(void*));
unsigned char RingRead      (RingBuffer* buffer, void* elem);
unsigned char RingIsEmpty   (RingBuffer* buffer);
unsigned char RingIsFull    (RingBuffer* buffer);
void          RingFree      (RingBuffer* buffer);
unsigned char RingResize    (RingBuffer* buffer);
unsigned char RingPush      (RingBuffer* buffer, void* elem);

#endif /* RINGBUFFER_H_ */

Test.c

代码语言:javascript
复制
#include<stdlib.h>
#include<string.h>
#include <stdio.h>
#include"RingBuffer.h"

#define ARRAY_LENGTH(a)     sizeof(a)/sizeof(a[0])

void freeInt(void* data)
{
    free(data);
}

int main(void)
{
    RingBuffer Ring;
    int buf[15] = {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
    int i = 0;
    
    if(RingInit(&Ring, ARRAY_LENGTH(buf)-5, sizeof(int), freeInt) == 0){
        
        printf("\nRING INIT OK");
    }
    else{
        
        printf("\nRING INIT FAIL");
        RingFree(&Ring);
        return 0;
    }
    
    Ring.doResize = 1;
    for(i = 0 ; i < ARRAY_LENGTH(buf) ; i++){
        
        if(RingPush(&Ring, &buf[i])){
            
            printf("\nRING PUSH FAIL");
            RingFree(&Ring);
            return 0;
        }
        
        printf("\nRING PUSH OK->%d", buf[i]);
        printf(" %d", ((int*)(Ring.data))[i]); 
    }
    
    printf("\n");
    for(i = 0 ; i < ARRAY_LENGTH(buf); i++){
        
        printf(" %d", ((int*)(Ring.data))[i]);
    }
    
    memset(buf, 0, sizeof(buf));
    printf("\nLOAD ZEROS:");
    for(i = 0 ; i < ARRAY_LENGTH(buf); i++){
        printf(" %d", buf[i]);
    }
    
    i = 0;
    while(!RingIsEmpty(&Ring)){
        
        if(RingRead(&Ring, &buf[i])){
            
            printf("\nRING READ FAIL");
            RingFree(&Ring);
            return 0;
        }
        
        printf("\nRING READ OK->%d", buf[i]);
        i++;
    }
    
    getchar();
    RingFree(&Ring);
    return 0;
}

结果:

代码语言:javascript
复制
RING INIT OK
RING PUSH OK->1 1
RING PUSH OK->2 2
RING PUSH OK->3 3
RING PUSH OK->4 4
RING PUSH OK->5 5
RING PUSH OK->6 6
RING PUSH OK->7 7
RING PUSH OK->8 8
RING PUSH OK->9 9
RING PUSH OK->10 10
RING PUSH OK->11 11
RING PUSH OK->12 12
RING PUSH OK->13 1313427978
RING PUSH OK->14 1431314503
RING PUSH OK->15 1327515731
 1 2 3 4 5 6 -1326086846 5687 12790216 12779712 11 12 926036256 842412848 909391924
LOAD ZEROS: 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
RING READ OK->1
RING READ OK->2
RING READ OK->3
RING READ OK->4
RING READ OK->5
RING READ OK->6
RING READ OK->-1326086846
RING READ OK->5687
RING READ OK->12790216
RING READ OK->12779712
RING READ OK->11
RING READ OK->12
RING READ OK->1313427978
RING READ OK->1163010119
RING READ OK->1327514689   

它应该打印数字1-15,所发生的是它打印的一些数字,wrong.Every,当我启动程序,不同的元素是错误的。

编译

gcc测试,c,RingBuffer.c

编译器版本

gcc (MinGW.org GCC-6.3.0-1) 6.3.0版权(C) 2016自由软件基金会,这是免费软件,请参阅复制条件的来源。没有任何保证,即使是适销性或适合某一特定用途。

EN

回答 1

Stack Overflow用户

回答已采纳

发布于 2018-05-18 14:24:50

您将buffer->dataLen + (buffer->resizeBy * buffer->dataSize)作为要在函数RingResize中分配的大小传递。

不幸的是,buffer->dataLen是元素数,而不是字节数。

因此,新分配的缓冲区将没有足够的字节数。这将导致错误。

要分配的大小应该是buffer->dataSize * (buffer->dataLen + buffer->resizeBy)

票数 8
EN
页面原文内容由Stack Overflow提供。腾讯云小微IT领域专用引擎提供翻译支持
原文链接:

https://stackoverflow.com/questions/50413261

复制
相关文章

相似问题

领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档