机智云里的的环形缓冲区算法.docVIP

机智云里的环形缓冲区算法 ringbuffer.h /** * Project page: /wangrn/ringbuffer * Copyright (c) 2013 Wang Ruining /wangrn * @date 2013/01/16 13:33:20 * @brief a simple ringbuffer, DO NOT support dynamic expanded memory */ #ifndef RINGBUFFER_H #define RINGBUFFER_H #include stdlib.h typedef struct { size_t rb_capacity; char *rb_head; char *rb_tail; char rb_buff[256]; }RingBuffer; //struct RingBuffer; // RingBuffer* rb_new(size_t capacity); void rb_new(RingBuffer* rb); void rb_free(RingBuffer *rb); size_t rb_capacity(RingBuffer *rb); size_t rb_can_read(RingBuffer *rb); size_t rb_can_write(RingBuffer *rb); size_t rb_read(RingBuffer *rb, void *data, size_t count); size_t rb_write(RingBuffer *rb, const void *data, size_t count); #endif ringbuffer.c /** ******************************************************** * * @file ringbuffer.c * @author Gizwtis * @version V2.3 * @date 2015-07-06 * * @brief 机智云 只为智能硬件而生 * Gizwits Smart Cloud for Smart Products * 链接|增值|开放|中立|安全|自有|自由|生态 * * *********************************************************/ //#include assert.h #include stdlib.h #include string.h #include ringbuffer.h #include Protocol.h #define min(a, b) (a)(b)?(a):(b) //static char buff[512] = {0}; void rb_new(RingBuffer* rb) { //RingBuffer *rb = (RingBuffer *)buff;//malloc(sizeof(RingBuffer) + capacity); //if (rb == NULL) return NULL; rb-rb_capacity = MAX_RINGBUFFER_LEN;//-sizeof(RingBuffer);//capacity; //rb-rb_buff = buff+sizeof(RingBuffer);//(char*)rb + sizeof(RingBuffer); rb-rb_head = rb-rb_buff; rb-rb_tail = rb-rb_buff; //return rb; }; void rb_free(RingBuffer *rb) { //free((char*)rb); } size_t rb_capacity(RingBuffer *rb) { //assert(rb != NULL); return rb-rb_capacity; } size_t rb_can_read(RingBuffer *rb) { //assert(rb != NULL); if (rb-rb_head == rb-rb_tail) return 0; if (rb-rb_head rb-rb_tail) return rb-rb_tail - rb-rb_head; return rb_capacity(rb) - (rb-rb_head - rb-rb_tai