MAV'RIC
|
00001 /******************************************************************************* 00002 * Copyright (c) 2009-2016, MAV'RIC Development Team 00003 * All rights reserved. 00004 * 00005 * Redistribution and use in source and binary forms, with or without 00006 * modification, are permitted provided that the following conditions are met: 00007 * 00008 * 1. Redistributions of source code must retain the above copyright notice, 00009 * this list of conditions and the following disclaimer. 00010 * 00011 * 2. Redistributions in binary form must reproduce the above copyright notice, 00012 * this list of conditions and the following disclaimer in the documentation 00013 * and/or other materials provided with the distribution. 00014 * 00015 * 3. Neither the name of the copyright holder nor the names of its contributors 00016 * may be used to endorse or promote products derived from this software without 00017 * specific prior written permission. 00018 * 00019 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 00020 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00021 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 00022 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE 00023 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 00024 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 00025 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 00026 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 00027 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 00028 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 00029 * POSSIBILITY OF SUCH DAMAGE. 00030 ******************************************************************************/ 00031 00032 /******************************************************************************* 00033 * \file buffer.cpp 00034 * 00035 * \author MAV'RIC Team 00036 * \author Felix Schill 00037 * \author Julien Lecoeur 00038 * 00039 * \brief Buffer 00040 * 00041 ******************************************************************************/ 00042 00043 #ifndef BUFFER_HXX_ 00044 #define BUFFER_HXX_ 00045 00046 00047 template<uint32_t S, typename T> 00048 Buffer_T<S, T>::Buffer_T(void): 00049 head_(0), 00050 tail_(0) 00051 {} 00052 00053 00054 template<uint32_t S, typename T> 00055 bool Buffer_T<S, T>::put_lossy(const T& data) 00056 { 00057 uint32_t tmp; 00058 00059 tmp = (head_ + 1) % (S + 1); 00060 00061 if (tmp == tail_) 00062 { 00063 // error: receive buffer overflow!! 00064 // lose old incoming data at the end of the buffer 00065 tail_ = (tail_ + 1) % (S + 1); 00066 } 00067 00068 // store incoming data in buffer 00069 buffer_[head_] = data; 00070 head_ = tmp; 00071 00072 return true; 00073 } 00074 00075 00076 template<uint32_t S, typename T> 00077 bool Buffer_T<S, T>::put(const T& data) 00078 { 00079 uint32_t tmp; 00080 tmp = (head_ + 1) % (S + 1); 00081 00082 if (tmp == tail_) 00083 { 00084 // error: buffer full! 00085 return false; 00086 } 00087 else 00088 { 00089 // store incoming data in buffer 00090 buffer_[head_] = data; 00091 head_ = tmp; 00092 00093 return true; 00094 } 00095 } 00096 00097 00098 template<uint32_t S, typename T> 00099 bool Buffer_T<S, T>::get(T& data) 00100 { 00101 bool ret = false; 00102 00103 if (head_ != tail_) 00104 { 00105 data = buffer_[tail_]; 00106 tail_ = (tail_ + 1) % (S + 1); 00107 ret = true; 00108 } 00109 00110 return ret; 00111 } 00112 00113 00114 template<uint32_t S, typename T> 00115 void Buffer_T<S, T>::clear(void) 00116 { 00117 head_ = 0; 00118 tail_ = 0; 00119 } 00120 00121 00122 template<uint32_t S, typename T> 00123 uint32_t Buffer_T<S, T>::readable(void) const 00124 { 00125 return (S + 1 + head_ - tail_) % (S + 1); 00126 } 00127 00128 00129 template<uint32_t S, typename T> 00130 uint32_t Buffer_T<S, T>::writeable(void) const 00131 { 00132 return S - readable(); 00133 } 00134 00135 00136 template<uint32_t S, typename T> 00137 bool Buffer_T<S, T>::full(void) const 00138 { 00139 return (((head_ + 1) % (S + 1)) == tail_); 00140 } 00141 00142 00143 template<uint32_t S, typename T> 00144 bool Buffer_T<S, T>::empty(void) const 00145 { 00146 return (head_ == tail_); 00147 } 00148 00149 template<uint32_t S, typename T> 00150 bool Buffer_T<S, T>::get_element(uint32_t index, T& elem) const 00151 { 00152 if (index > S) 00153 { 00154 return false; 00155 } 00156 else if (readable() < index) 00157 { 00158 return false; 00159 } 00160 else 00161 { 00162 elem = buffer_[(tail_ + index)%(S+1)]; 00163 return true; 00164 } 00165 } 00166 00167 00168 #endif /* BUFFER_HXX_ */