/* * Copyright 2013-2019 Software Radio Systems Limited * * This file is part of srsLTE. * * srsLTE is free software: you can redistribute it and/or modify * it under the terms of the GNU Affero General Public License as * published by the Free Software Foundation, either version 3 of * the License, or (at your option) any later version. * * srsLTE is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Affero General Public License for more details. * * A copy of the GNU Affero General Public License can be found in * the LICENSE file in the top-level directory of this distribution * and at http://www.gnu.org/licenses/. * */ /****************************************************************************** * File: rlc_tx_queue.h * Description: Queue used in RLC TM/UM/AM TX queues. * Uses a blocking queue with bounded capacity to block higher layers * when pushing Uplink traffic * Reference: *****************************************************************************/ #ifndef SRSLTE_MSG_QUEUE_H #define SRSLTE_MSG_QUEUE_H #include "srslte/common/block_queue.h" #include "srslte/common/common.h" #include namespace srslte { class rlc_tx_queue : public block_queue::call_mutexed_itf { public: rlc_tx_queue(int capacity = 128) : queue(capacity) { unread_bytes = 0; queue.set_mutexed_itf(this); } // increase/decrease unread_bytes inside push/pop mutexed operations void pushing(const unique_byte_buffer& msg) final { unread_bytes += msg->N_bytes; } void popping(const unique_byte_buffer& msg) final { if (unread_bytes > msg->N_bytes) { unread_bytes -= msg->N_bytes; } else { unread_bytes = 0; } } void write(unique_byte_buffer msg) { queue.push(std::move(msg)); } bool try_write(unique_byte_buffer msg) { return queue.try_push(std::move(msg)); } void read(unique_byte_buffer* msg) { *msg = std::move(queue.wait_pop()); } bool try_read(unique_byte_buffer* msg) { return queue.try_pop(msg); } void resize(uint32_t capacity) { queue.resize(capacity); } uint32_t size() { return (uint32_t) queue.size(); } uint32_t size_bytes() { return unread_bytes; } uint32_t size_tail_bytes() { if (!queue.empty()) { unique_byte_buffer& m = queue.front(); if (m.get()) { return m->N_bytes; } } return 0; } // This is a hack to reset N_bytes counter when queue is corrupted (see line 89) void reset() { unread_bytes = 0; } bool is_empty() { return queue.empty(); } private: block_queue queue; uint32_t unread_bytes; }; } // namespace srslte #endif // SRSLTE_MSG_QUEUE_H