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, void *addr = NULL) {
00026         write = 0;
00027         read = 0;
00028         size = length + 1;
00029         if (addr) {
00030             buf = (T *)addr;
00031         } else {
00032             buf = (T *)malloc(size * sizeof(T));
00033         }
00034         if (buf == NULL)
00035             error("Can't allocate memory");
00036     };
00037 
00038     bool isFull() {
00039         return (((write + 1) % size) == read);
00040     };
00041 
00042     bool isEmpty() {
00043         return (read == write);
00044     };
00045 
00046     void queue(T k) {
00047         if (isFull()) {
00048 //            read++;
00049 //            read %= size;
00050             return;
00051         }
00052         buf[write++] = k;
00053         write %= size;
00054     }
00055     
00056     void flush() {
00057         read = 0;
00058         write = 0;
00059     }
00060     
00061 
00062     uint32_t available() {
00063         return (write >= read) ? write - read : size - read + write;
00064     };
00065 
00066     bool dequeue(T * c) {
00067         bool empty = isEmpty();
00068         if (!empty) {
00069             *c = buf[read++];
00070             read %= size;
00071         }
00072         return(!empty);
00073     };
00074 
00075 private:
00076     volatile uint32_t write;
00077     volatile uint32_t read;
00078     uint32_t size;
00079     T * buf;
00080 };
00081 
00082 #endif