00001 /* 00002 * Copyright (c) 2010 Lenka Trochtova 00003 * All rights reserved. 00004 * 00005 * Redistribution and use in source and binary forms, with or without 00006 * modification, are permitted provided that the following conditions 00007 * are met: 00008 * 00009 * - Redistributions of source code must retain the above copyright 00010 * notice, this list of conditions and the following disclaimer. 00011 * - Redistributions in binary form must reproduce the above copyright 00012 * notice, this list of conditions and the following disclaimer in the 00013 * documentation and/or other materials provided with the distribution. 00014 * - The name of the author may not be used to endorse or promote products 00015 * derived from this software without specific prior written permission. 00016 * 00017 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 00018 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 00019 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 00020 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 00021 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 00022 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 00023 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 00024 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 00025 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 00026 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00027 */ 00028 00035 #ifndef CYCLIC_BUFFER_H_ 00036 #define CYCLIC_BUFFER_H_ 00037 00038 #define BUF_LEN 256 00039 00040 typedef struct cyclic_buffer { 00041 uint8_t buf[BUF_LEN]; 00042 int start; 00043 int cnt; 00044 } cyclic_buffer_t; 00045 00046 /* 00047 * @return False if the buffer is full. 00048 */ 00049 static inline bool buf_push_back(cyclic_buffer_t *buf, uint8_t item) 00050 { 00051 if (buf->cnt >= BUF_LEN) 00052 return false; 00053 int pos = (buf->start + buf->cnt) % BUF_LEN; 00054 buf->buf[pos] = item; 00055 buf->cnt++; 00056 return true; 00057 } 00058 00059 static inline bool buf_is_empty(cyclic_buffer_t *buf) 00060 { 00061 return buf->cnt == 0; 00062 } 00063 00064 static inline uint8_t buf_pop_front(cyclic_buffer_t *buf) 00065 { 00066 assert(!buf_is_empty(buf)); 00067 00068 uint8_t res = buf->buf[buf->start]; 00069 buf->start = (buf->start + 1) % BUF_LEN; 00070 buf->cnt--; 00071 return res; 00072 } 00073 00074 static inline void buf_clear(cyclic_buffer_t *buf) 00075 { 00076 buf->cnt = 0; 00077 } 00078 00079 #endif 00080