| 1 | #pragma once |
| 2 | /* |
| 3 | * This file is part of the libCEC(R) library. |
| 4 | * |
| 5 | * libCEC(R) is Copyright (C) 2011 Pulse-Eight Limited. All rights reserved. |
| 6 | * libCEC(R) is an original work, containing original code. |
| 7 | * |
| 8 | * libCEC(R) is a trademark of Pulse-Eight Limited. |
| 9 | * |
| 10 | * This program is dual-licensed; you can redistribute it and/or modify |
| 11 | * it under the terms of the GNU General Public License as published by |
| 12 | * the Free Software Foundation; either version 2 of the License, or |
| 13 | * (at your option) any later version. |
| 14 | * |
| 15 | * This program is distributed in the hope that it will be useful, |
| 16 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 17 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 18 | * GNU General Public License for more details. |
| 19 | * |
| 20 | * You should have received a copy of the GNU General Public License |
| 21 | * along with this program; if not, write to the Free Software |
| 22 | * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
| 23 | * |
| 24 | * |
| 25 | * Alternatively, you can license this library under a commercial license, |
| 26 | * please contact Pulse-Eight Licensing for more information. |
| 27 | * |
| 28 | * For more information contact: |
| 29 | * Pulse-Eight Licensing <license@pulse-eight.com> |
| 30 | * http://www.pulse-eight.com/ |
| 31 | * http://www.pulse-eight.net/ |
| 32 | */ |
| 33 | |
| 34 | #include "../platform/threads.h" |
| 35 | #include <queue> |
| 36 | |
| 37 | namespace CEC |
| 38 | { |
| 39 | template<typename _BType> |
| 40 | struct CecBuffer |
| 41 | { |
| 42 | public: |
| 43 | CecBuffer(unsigned int iMaxSize = 100) |
| 44 | { |
| 45 | m_maxSize = iMaxSize; |
| 46 | } |
| 47 | |
| 48 | virtual ~CecBuffer(void) |
| 49 | { |
| 50 | Clear(); |
| 51 | } |
| 52 | |
| 53 | void Clear(void) |
| 54 | { |
| 55 | while (!m_buffer.empty()) |
| 56 | m_buffer.pop(); |
| 57 | } |
| 58 | |
| 59 | int Size(void) const { return m_buffer.size(); } |
| 60 | |
| 61 | bool Push(_BType entry) |
| 62 | { |
| 63 | CLockObject lock(&m_mutex); |
| 64 | if (m_buffer.size() == m_maxSize) |
| 65 | return false; |
| 66 | |
| 67 | m_buffer.push(entry); |
| 68 | return true; |
| 69 | } |
| 70 | |
| 71 | bool Pop(_BType &entry) |
| 72 | { |
| 73 | bool bReturn(false); |
| 74 | CLockObject lock(&m_mutex); |
| 75 | if (!m_buffer.empty()) |
| 76 | { |
| 77 | entry = m_buffer.front(); |
| 78 | m_buffer.pop(); |
| 79 | bReturn = true; |
| 80 | } |
| 81 | return bReturn; |
| 82 | } |
| 83 | |
| 84 | private: |
| 85 | unsigned int m_maxSize; |
| 86 | std::queue<_BType> m_buffer; |
| 87 | CMutex m_mutex; |
| 88 | }; |
| 89 | }; |