Integrated program of 4 different kinds of application programs for processing sound signal. 4種類のサウンド信号処理を統合したプログラム.

Dependencies:   F746_GUI F746_SAI_IO FrequencyResponseDrawer SD_PlayerSkeleton UIT_FFT_Real

Committer:
MikamiUitOpen
Date:
Thu Apr 27 23:55:53 2017 +0000
Revision:
16:d60e5187fd31
Parent:
2:fcba17e3d573
17

Who changed what in which revision?

UserRevisionLine numberNew contents of line
MikamiUitOpen 0:224dccbc4edd 1 /* mbed Microcontroller Library
MikamiUitOpen 0:224dccbc4edd 2 * Copyright (c) 2015 ARM Limited
MikamiUitOpen 0:224dccbc4edd 3 *
MikamiUitOpen 0:224dccbc4edd 4 * Licensed under the Apache License, Version 2.0 (the "License");
MikamiUitOpen 0:224dccbc4edd 5 * you may not use this file except in compliance with the License.
MikamiUitOpen 0:224dccbc4edd 6 * You may obtain a copy of the License at
MikamiUitOpen 0:224dccbc4edd 7 *
MikamiUitOpen 0:224dccbc4edd 8 * http://www.apache.org/licenses/LICENSE-2.0
MikamiUitOpen 0:224dccbc4edd 9 *
MikamiUitOpen 0:224dccbc4edd 10 * Unless required by applicable law or agreed to in writing, software
MikamiUitOpen 0:224dccbc4edd 11 * distributed under the License is distributed on an "AS IS" BASIS,
MikamiUitOpen 0:224dccbc4edd 12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
MikamiUitOpen 0:224dccbc4edd 13 * See the License for the specific language governing permissions and
MikamiUitOpen 0:224dccbc4edd 14 * limitations under the License.
MikamiUitOpen 0:224dccbc4edd 15 */
MikamiUitOpen 0:224dccbc4edd 16 #ifndef MBED_CIRCULARBUFFER_H
MikamiUitOpen 0:224dccbc4edd 17 #define MBED_CIRCULARBUFFER_H
MikamiUitOpen 0:224dccbc4edd 18
MikamiUitOpen 0:224dccbc4edd 19 namespace mbed {
MikamiUitOpen 0:224dccbc4edd 20
MikamiUitOpen 0:224dccbc4edd 21 /** Templated Circular buffer class
MikamiUitOpen 0:224dccbc4edd 22 */
MikamiUitOpen 0:224dccbc4edd 23 template<typename T, uint32_t BufferSize, typename CounterType = uint32_t>
MikamiUitOpen 0:224dccbc4edd 24 class CircularBuffer {
MikamiUitOpen 0:224dccbc4edd 25 public:
MikamiUitOpen 0:224dccbc4edd 26 CircularBuffer() : _head(0), _tail(0), _full(false) {
MikamiUitOpen 0:224dccbc4edd 27 }
MikamiUitOpen 0:224dccbc4edd 28
MikamiUitOpen 0:224dccbc4edd 29 ~CircularBuffer() {
MikamiUitOpen 0:224dccbc4edd 30 }
MikamiUitOpen 0:224dccbc4edd 31
MikamiUitOpen 0:224dccbc4edd 32 /** Push the transaction to the buffer. This overwrites the buffer if it's
MikamiUitOpen 0:224dccbc4edd 33 * full
MikamiUitOpen 0:224dccbc4edd 34 *
MikamiUitOpen 0:224dccbc4edd 35 * @param data Data to be pushed to the buffer
MikamiUitOpen 0:224dccbc4edd 36 */
MikamiUitOpen 0:224dccbc4edd 37 void push(const T& data) {
MikamiUitOpen 0:224dccbc4edd 38 if (full()) {
MikamiUitOpen 0:224dccbc4edd 39 _tail++;
MikamiUitOpen 0:224dccbc4edd 40 _tail %= BufferSize;
MikamiUitOpen 0:224dccbc4edd 41 }
MikamiUitOpen 0:224dccbc4edd 42 _pool[_head++] = data;
MikamiUitOpen 0:224dccbc4edd 43 _head %= BufferSize;
MikamiUitOpen 0:224dccbc4edd 44 if (_head == _tail) {
MikamiUitOpen 0:224dccbc4edd 45 _full = true;
MikamiUitOpen 0:224dccbc4edd 46 }
MikamiUitOpen 0:224dccbc4edd 47 }
MikamiUitOpen 0:224dccbc4edd 48
MikamiUitOpen 0:224dccbc4edd 49 /** Pop the transaction from the buffer
MikamiUitOpen 0:224dccbc4edd 50 *
MikamiUitOpen 0:224dccbc4edd 51 * @param data Data to be pushed to the buffer
MikamiUitOpen 0:224dccbc4edd 52 * @return True if the buffer is not empty and data contains a transaction, false otherwise
MikamiUitOpen 0:224dccbc4edd 53 */
MikamiUitOpen 0:224dccbc4edd 54 bool pop(T& data) {
MikamiUitOpen 0:224dccbc4edd 55 if (!empty()) {
MikamiUitOpen 0:224dccbc4edd 56 data = _pool[_tail++];
MikamiUitOpen 0:224dccbc4edd 57 _tail %= BufferSize;
MikamiUitOpen 0:224dccbc4edd 58 _full = false;
MikamiUitOpen 0:224dccbc4edd 59 return true;
MikamiUitOpen 0:224dccbc4edd 60 }
MikamiUitOpen 0:224dccbc4edd 61 return false;
MikamiUitOpen 0:224dccbc4edd 62 }
MikamiUitOpen 0:224dccbc4edd 63
MikamiUitOpen 0:224dccbc4edd 64 /** Check if the buffer is empty
MikamiUitOpen 0:224dccbc4edd 65 *
MikamiUitOpen 0:224dccbc4edd 66 * @return True if the buffer is empty, false if not
MikamiUitOpen 0:224dccbc4edd 67 */
MikamiUitOpen 0:224dccbc4edd 68 bool empty() {
MikamiUitOpen 0:224dccbc4edd 69 return (_head == _tail) && !_full;
MikamiUitOpen 0:224dccbc4edd 70 }
MikamiUitOpen 0:224dccbc4edd 71
MikamiUitOpen 0:224dccbc4edd 72 /** Check if the buffer is full
MikamiUitOpen 0:224dccbc4edd 73 *
MikamiUitOpen 0:224dccbc4edd 74 * @return True if the buffer is full, false if not
MikamiUitOpen 0:224dccbc4edd 75 */
MikamiUitOpen 0:224dccbc4edd 76 bool full() {
MikamiUitOpen 0:224dccbc4edd 77 return _full;
MikamiUitOpen 0:224dccbc4edd 78 }
MikamiUitOpen 0:224dccbc4edd 79
MikamiUitOpen 0:224dccbc4edd 80 /** Reset the buffer
MikamiUitOpen 0:224dccbc4edd 81 *
MikamiUitOpen 0:224dccbc4edd 82 */
MikamiUitOpen 0:224dccbc4edd 83 void reset() {
MikamiUitOpen 0:224dccbc4edd 84 _head = 0;
MikamiUitOpen 0:224dccbc4edd 85 _tail = 0;
MikamiUitOpen 0:224dccbc4edd 86 _full = false;
MikamiUitOpen 0:224dccbc4edd 87 }
MikamiUitOpen 0:224dccbc4edd 88
MikamiUitOpen 0:224dccbc4edd 89 private:
MikamiUitOpen 0:224dccbc4edd 90 T _pool[BufferSize];
MikamiUitOpen 0:224dccbc4edd 91 volatile CounterType _head;
MikamiUitOpen 0:224dccbc4edd 92 volatile CounterType _tail;
MikamiUitOpen 0:224dccbc4edd 93 volatile bool _full;
MikamiUitOpen 0:224dccbc4edd 94 };
MikamiUitOpen 0:224dccbc4edd 95
MikamiUitOpen 0:224dccbc4edd 96 }
MikamiUitOpen 0:224dccbc4edd 97
MikamiUitOpen 0:224dccbc4edd 98 #endif