mirror of https://github.com/pvnis/srsRAN_4G.git
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
95 lines
2.7 KiB
C++
95 lines
2.7 KiB
C++
/**
|
|
* Copyright 2013-2021 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 byte_buffer_queue.h
|
|
*
|
|
* @brief Queue of unique pointers to byte buffers used in PDCP and RLC TX queues.
|
|
* Uses a blocking queue with bounded capacity to block higher layers
|
|
* when pushing uplink traffic
|
|
*/
|
|
|
|
#ifndef SRSLTE_BYTE_BUFFERQUEUE_H
|
|
#define SRSLTE_BYTE_BUFFERQUEUE_H
|
|
|
|
#include "srslte/common/block_queue.h"
|
|
#include "srslte/common/common.h"
|
|
#include <pthread.h>
|
|
|
|
namespace srslte {
|
|
|
|
class byte_buffer_queue : public block_queue<unique_byte_buffer_t>::call_mutexed_itf
|
|
{
|
|
public:
|
|
byte_buffer_queue(int capacity = 128) : queue(capacity) { queue.set_mutexed_itf(this); }
|
|
// increase/decrease unread_bytes inside push/pop mutexed operations
|
|
void pushing(const unique_byte_buffer_t& msg) final { unread_bytes += msg->N_bytes; }
|
|
void popping(const unique_byte_buffer_t& msg) final
|
|
{
|
|
if (unread_bytes > msg->N_bytes) {
|
|
unread_bytes -= msg->N_bytes;
|
|
} else {
|
|
unread_bytes = 0;
|
|
}
|
|
}
|
|
void write(unique_byte_buffer_t msg) { queue.push(std::move(msg)); }
|
|
|
|
srslte::error_type<unique_byte_buffer_t> try_write(unique_byte_buffer_t&& msg)
|
|
{
|
|
return queue.try_push(std::move(msg));
|
|
}
|
|
|
|
unique_byte_buffer_t read() { return queue.wait_pop(); }
|
|
|
|
bool try_read(unique_byte_buffer_t* 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()) {
|
|
const unique_byte_buffer_t& 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(); }
|
|
|
|
bool is_full() { return queue.full(); }
|
|
|
|
private:
|
|
block_queue<unique_byte_buffer_t> queue;
|
|
uint32_t unread_bytes = 0;
|
|
};
|
|
|
|
} // namespace srslte
|
|
|
|
#endif // SRSLTE_BYTE_BUFFERQUEUE_H
|