X-TOUCH to djay bridge
Dependencies: mbed mbed-rtos FATFileSystem
CBuffer.h@1:0dac72ab5910, 2019-06-05 (annotated)
- Committer:
- okini3939
- Date:
- Wed Jun 05 04:54:37 2019 +0000
- Revision:
- 1:0dac72ab5910
sample
Who changed what in which revision?
User | Revision | Line number | New contents of line |
---|---|---|---|
okini3939 | 1:0dac72ab5910 | 1 | /* Copyright (C) 2012 mbed.org, MIT License |
okini3939 | 1:0dac72ab5910 | 2 | * |
okini3939 | 1:0dac72ab5910 | 3 | * Permission is hereby granted, free of charge, to any person obtaining a copy of this software |
okini3939 | 1:0dac72ab5910 | 4 | * and associated documentation files (the "Software"), to deal in the Software without restriction, |
okini3939 | 1:0dac72ab5910 | 5 | * including without limitation the rights to use, copy, modify, merge, publish, distribute, |
okini3939 | 1:0dac72ab5910 | 6 | * sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is |
okini3939 | 1:0dac72ab5910 | 7 | * furnished to do so, subject to the following conditions: |
okini3939 | 1:0dac72ab5910 | 8 | * |
okini3939 | 1:0dac72ab5910 | 9 | * The above copyright notice and this permission notice shall be included in all copies or |
okini3939 | 1:0dac72ab5910 | 10 | * substantial portions of the Software. |
okini3939 | 1:0dac72ab5910 | 11 | * |
okini3939 | 1:0dac72ab5910 | 12 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING |
okini3939 | 1:0dac72ab5910 | 13 | * BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND |
okini3939 | 1:0dac72ab5910 | 14 | * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, |
okini3939 | 1:0dac72ab5910 | 15 | * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
okini3939 | 1:0dac72ab5910 | 16 | * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. |
okini3939 | 1:0dac72ab5910 | 17 | */ |
okini3939 | 1:0dac72ab5910 | 18 | |
okini3939 | 1:0dac72ab5910 | 19 | #ifndef CIRCBUFFER_H_ |
okini3939 | 1:0dac72ab5910 | 20 | #define CIRCBUFFER_H_ |
okini3939 | 1:0dac72ab5910 | 21 | |
okini3939 | 1:0dac72ab5910 | 22 | template <class T> |
okini3939 | 1:0dac72ab5910 | 23 | class CircBuffer { |
okini3939 | 1:0dac72ab5910 | 24 | public: |
okini3939 | 1:0dac72ab5910 | 25 | CircBuffer(int length) { |
okini3939 | 1:0dac72ab5910 | 26 | write = 0; |
okini3939 | 1:0dac72ab5910 | 27 | read = 0; |
okini3939 | 1:0dac72ab5910 | 28 | size = length + 1; |
okini3939 | 1:0dac72ab5910 | 29 | buf = new T[size * sizeof(T)]; |
okini3939 | 1:0dac72ab5910 | 30 | // buf = (T *)malloc(size * sizeof(T)); |
okini3939 | 1:0dac72ab5910 | 31 | if (buf == NULL) |
okini3939 | 1:0dac72ab5910 | 32 | error("Can't allocate memory"); |
okini3939 | 1:0dac72ab5910 | 33 | }; |
okini3939 | 1:0dac72ab5910 | 34 | |
okini3939 | 1:0dac72ab5910 | 35 | bool isFull() { |
okini3939 | 1:0dac72ab5910 | 36 | return (((write + 1) % size) == read); |
okini3939 | 1:0dac72ab5910 | 37 | }; |
okini3939 | 1:0dac72ab5910 | 38 | |
okini3939 | 1:0dac72ab5910 | 39 | bool isEmpty() { |
okini3939 | 1:0dac72ab5910 | 40 | return (read == write); |
okini3939 | 1:0dac72ab5910 | 41 | }; |
okini3939 | 1:0dac72ab5910 | 42 | |
okini3939 | 1:0dac72ab5910 | 43 | void queue(T k) { |
okini3939 | 1:0dac72ab5910 | 44 | if (isFull()) { |
okini3939 | 1:0dac72ab5910 | 45 | // read++; |
okini3939 | 1:0dac72ab5910 | 46 | // read %= size; |
okini3939 | 1:0dac72ab5910 | 47 | return; |
okini3939 | 1:0dac72ab5910 | 48 | } |
okini3939 | 1:0dac72ab5910 | 49 | buf[write++] = k; |
okini3939 | 1:0dac72ab5910 | 50 | write %= size; |
okini3939 | 1:0dac72ab5910 | 51 | } |
okini3939 | 1:0dac72ab5910 | 52 | |
okini3939 | 1:0dac72ab5910 | 53 | void flush() { |
okini3939 | 1:0dac72ab5910 | 54 | read = 0; |
okini3939 | 1:0dac72ab5910 | 55 | write = 0; |
okini3939 | 1:0dac72ab5910 | 56 | } |
okini3939 | 1:0dac72ab5910 | 57 | |
okini3939 | 1:0dac72ab5910 | 58 | |
okini3939 | 1:0dac72ab5910 | 59 | uint32_t available() { |
okini3939 | 1:0dac72ab5910 | 60 | return (write >= read) ? write - read : size - read + write; |
okini3939 | 1:0dac72ab5910 | 61 | }; |
okini3939 | 1:0dac72ab5910 | 62 | |
okini3939 | 1:0dac72ab5910 | 63 | bool dequeue(T * c) { |
okini3939 | 1:0dac72ab5910 | 64 | bool empty = isEmpty(); |
okini3939 | 1:0dac72ab5910 | 65 | if (!empty) { |
okini3939 | 1:0dac72ab5910 | 66 | *c = buf[read++]; |
okini3939 | 1:0dac72ab5910 | 67 | read %= size; |
okini3939 | 1:0dac72ab5910 | 68 | } |
okini3939 | 1:0dac72ab5910 | 69 | return(!empty); |
okini3939 | 1:0dac72ab5910 | 70 | }; |
okini3939 | 1:0dac72ab5910 | 71 | |
okini3939 | 1:0dac72ab5910 | 72 | private: |
okini3939 | 1:0dac72ab5910 | 73 | volatile uint32_t write; |
okini3939 | 1:0dac72ab5910 | 74 | volatile uint32_t read; |
okini3939 | 1:0dac72ab5910 | 75 | uint32_t size; |
okini3939 | 1:0dac72ab5910 | 76 | T * buf; |
okini3939 | 1:0dac72ab5910 | 77 | }; |
okini3939 | 1:0dac72ab5910 | 78 | |
okini3939 | 1:0dac72ab5910 | 79 | #endif |