ring buffer api（可循环读写）

/*

下面是一套实现简洁的的RingBuffer API，

特点：

1 可以循环读写

2 可以通用

*/

#ifndef RINGBUFFER_T

#define RINGBUFFER_T(elemtype,size) \

struct \

{ \

volatile unsigned int write; /* must be unsigned */ \

volatile unsigned int read; /* must be unsigned */ \

elemtype volatile queue[size]; \

}

#define RB_SIZE( rb ) \

( sizeof( rb.queue ) / sizeof( *rb.queue ) )

#define RB_MASK( rb ) \

( RB_SIZE( rb ) - 1 )

#define RB_INIT( rb ) \

( rb.read = rb.write = 0 )

#define RB_COUNT( rb ) \

( (rb.write >= rb.read) ? rb.write - rb.read : rb.write + RB_SIZE(rb) - rb.read )

#define ASSERT(result) \

if (!result) \

{ \

printf("ASSERT FAIL IN %s : line %d\n", __func__, __LINE__); \

}

//若write index在read index的前一个，则表示RingBuffer已经写满

#define RB_FULL( rb ) \

( RB_COUNT( rb ) >= RB_SIZE( rb ) - 1)

#define RB_EMPTY( rb ) \

( rb.write == rb.read )

#define RB_PUT( rb, value ) \

{ \

if (!RB_FULL( rb )) \

{ \

rb.queue[ rb.write ] = value; \

if (rb.write + 1 > RB_SIZE(rb) -1 ) \

{ \

rb.write = 0; \

} \

else \

{ \

++rb.write; \

} \

}\

else \

{ \

printf("%s:line %d : RingBuffer is full!\n", __func__, __LINE__); \

} \

}

#define RB_GET( rb, value ) \

{ \

if ( !RB_EMPTY( rb ) ) \

{ \

value = rb.queue[ rb.read ]; \

if (rb.read + 1 > RB_SIZE(rb) - 1) \

{ \

rb.read = 0; \

} \

else \

{ \

++rb.read; \

} \

} \

else \

{ \

printf("%s:line %d : RingBuffer is empty!\n", __func__, __LINE__); \

} \

}

#endif /* RINGBUFFER_T */