| 1 | /*
|
|---|
| 2 | * Copyright (c) 2010 Lenka Trochtova
|
|---|
| 3 | * All rights reserved.
|
|---|
| 4 | *
|
|---|
| 5 | * Redistribution and use in source and binary forms, with or without
|
|---|
| 6 | * modification, are permitted provided that the following conditions
|
|---|
| 7 | * are met:
|
|---|
| 8 | *
|
|---|
| 9 | * - Redistributions of source code must retain the above copyright
|
|---|
| 10 | * notice, this list of conditions and the following disclaimer.
|
|---|
| 11 | * - Redistributions in binary form must reproduce the above copyright
|
|---|
| 12 | * notice, this list of conditions and the following disclaimer in the
|
|---|
| 13 | * documentation and/or other materials provided with the distribution.
|
|---|
| 14 | * - The name of the author may not be used to endorse or promote products
|
|---|
| 15 | * derived from this software without specific prior written permission.
|
|---|
| 16 | *
|
|---|
| 17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|---|
| 18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|---|
| 19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|---|
| 20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|---|
| 21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|---|
| 22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|---|
| 23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|---|
| 24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|---|
| 25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|---|
| 26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|---|
| 27 | */
|
|---|
| 28 |
|
|---|
| 29 | /** @addtogroup ns8250
|
|---|
| 30 | * @{
|
|---|
| 31 | */
|
|---|
| 32 | /** @file
|
|---|
| 33 | */
|
|---|
| 34 |
|
|---|
| 35 | #ifndef CYCLIC_BUFFER_H_
|
|---|
| 36 | #define CYCLIC_BUFFER_H_
|
|---|
| 37 |
|
|---|
| 38 | #define BUF_LEN 256
|
|---|
| 39 |
|
|---|
| 40 | typedef struct cyclic_buffer {
|
|---|
| 41 | uint8_t buf[BUF_LEN];
|
|---|
| 42 | int start;
|
|---|
| 43 | int cnt;
|
|---|
| 44 | } cyclic_buffer_t;
|
|---|
| 45 |
|
|---|
| 46 | /*
|
|---|
| 47 | * @return False if the buffer is full.
|
|---|
| 48 | */
|
|---|
| 49 | static inline bool buf_push_back(cyclic_buffer_t *buf, uint8_t item)
|
|---|
| 50 | {
|
|---|
| 51 | if (buf->cnt >= BUF_LEN)
|
|---|
| 52 | return false;
|
|---|
| 53 | int pos = (buf->start + buf->cnt) % BUF_LEN;
|
|---|
| 54 | buf->buf[pos] = item;
|
|---|
| 55 | buf->cnt++;
|
|---|
| 56 | return true;
|
|---|
| 57 | }
|
|---|
| 58 |
|
|---|
| 59 | static inline bool buf_is_empty(cyclic_buffer_t *buf)
|
|---|
| 60 | {
|
|---|
| 61 | return buf->cnt == 0;
|
|---|
| 62 | }
|
|---|
| 63 |
|
|---|
| 64 | static inline uint8_t buf_pop_front(cyclic_buffer_t *buf)
|
|---|
| 65 | {
|
|---|
| 66 | assert(!buf_is_empty(buf));
|
|---|
| 67 |
|
|---|
| 68 | uint8_t res = buf->buf[buf->start];
|
|---|
| 69 | buf->start = (buf->start + 1) % BUF_LEN;
|
|---|
| 70 | buf->cnt--;
|
|---|
| 71 | return res;
|
|---|
| 72 | }
|
|---|
| 73 |
|
|---|
| 74 | static inline void buf_clear(cyclic_buffer_t *buf)
|
|---|
| 75 | {
|
|---|
| 76 | buf->cnt = 0;
|
|---|
| 77 | }
|
|---|
| 78 |
|
|---|
| 79 | #endif
|
|---|
| 80 |
|
|---|
| 81 | /**
|
|---|
| 82 | * @}
|
|---|
| 83 | */
|
|---|
