CBuffer.h

00001 /* Copyright (C) 2012 mbed.org, MIT License
00002  *
00003  * Permission is hereby granted, free of charge, to any person obtaining a copy of this software
00004  * and associated documentation files (the "Software"), to deal in the Software without restriction,
00005  * including without limitation the rights to use, copy, modify, merge, publish, distribute,
00006  * sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is
00007  * furnished to do so, subject to the following conditions:
00008  *
00009  * The above copyright notice and this permission notice shall be included in all copies or
00010  * substantial portions of the Software.
00011  *
00012  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING
00013  * BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
00014  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
00015  * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
00016  * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
00017  */
00018 
00019 #ifndef CIRCBUFFER_H_
00020 #define CIRCBUFFER_H_
00021 
00022 template <class T>
00023 class CircBuffer {
00024 public:
00025     CircBuffer(int length) {
00026         write = 0;
00027         read = 0;
00028         size = length + 1;
00029         buf = (T *)malloc(size * sizeof(T));
00030     };
00031 
00032     bool isFull() {
00033         return (((write + 1) % size) == read);
00034     };
00035 
00036     bool isEmpty() {
00037         return (read == write);
00038     };
00039 
00040     void queue(T k) {
00041         
00042         if (isFull()) {
00043             read++;
00044             read %= size;
00045         }
00046         buf[write++] = k;
00047         write %= size;
00048     }
00049     
00050     void flush() {
00051         read = 0;
00052         write = 0;
00053     }
00054     
00055 
00056     uint32_t available() {
00057         return (write >= read) ? write - read : size - read + write;
00058     };
00059 
00060     bool dequeue(T * c) {
00061         bool empty = isEmpty();
00062         if (!empty) {
00063             *c = buf[read++];
00064             read %= size;
00065         }
00066         return(!empty);
00067     };
00068 
00069 private:
00070     volatile uint32_t write;
00071     volatile uint32_t read;
00072     uint32_t size;
00073     T * buf;
00074 };
00075 
00076 #endif