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.
144 lines
3.3 KiB
C++
144 lines
3.3 KiB
C++
/**
|
|
*
|
|
* \section COPYRIGHT
|
|
*
|
|
* Copyright 2013-2015 Software Radio Systems Limited
|
|
*
|
|
* \section LICENSE
|
|
*
|
|
* This file is part of the srsUE library.
|
|
*
|
|
* srsUE 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.
|
|
*
|
|
* srsUE 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: block_queue.h
|
|
* Description: General-purpose blocking queue. It can behave as a bounded or
|
|
* unbounded blocking queue and allows blocking and non-blocking
|
|
* operations in both push and pop
|
|
*****************************************************************************/
|
|
|
|
|
|
#ifndef SRSLTE_BLOCK_QUEUE_H
|
|
#define SRSLTE_BLOCK_QUEUE_H
|
|
|
|
#include <queue>
|
|
#include <memory>
|
|
#include <utility>
|
|
#include <pthread.h>
|
|
#include <stdio.h>
|
|
#include <stdint.h>
|
|
|
|
namespace srslte {
|
|
|
|
template<typename myobj>
|
|
class block_queue {
|
|
|
|
public:
|
|
block_queue<myobj>(int capacity = -1) {
|
|
pthread_mutex_init(&mutex, NULL);
|
|
pthread_cond_init(&cv_empty, NULL);
|
|
pthread_cond_init(&cv_full, NULL);
|
|
this->capacity = capacity;
|
|
}
|
|
void resize(int new_capacity) {
|
|
capacity = new_capacity;
|
|
}
|
|
bool push_(const myobj& value, bool block) {
|
|
pthread_mutex_lock(&mutex);
|
|
if (capacity > 0) {
|
|
if (block) {
|
|
while(q.size() > (uint32_t) capacity) {
|
|
pthread_cond_wait(&cv_full, &mutex);
|
|
}
|
|
} else {
|
|
pthread_mutex_unlock(&mutex);
|
|
return false;
|
|
}
|
|
}
|
|
q.push(value);
|
|
pthread_cond_signal(&cv_empty);
|
|
pthread_mutex_unlock(&mutex);
|
|
return true;
|
|
}
|
|
|
|
void push(const myobj& value) {
|
|
push_(value, true);
|
|
}
|
|
|
|
bool try_push(const myobj& value) {
|
|
return push_(value, false);
|
|
}
|
|
|
|
bool try_pop(myobj *value) {
|
|
pthread_mutex_lock(&mutex);
|
|
if (q.empty()) {
|
|
pthread_mutex_unlock(&mutex);
|
|
return false;
|
|
}
|
|
if (value) {
|
|
*value = q.front();
|
|
q.pop();
|
|
}
|
|
pthread_cond_signal(&cv_full);
|
|
pthread_mutex_unlock(&mutex);
|
|
return true;
|
|
}
|
|
|
|
myobj wait_pop() { // blocking pop
|
|
pthread_mutex_lock(&mutex);
|
|
while(q.empty()) {
|
|
pthread_cond_wait(&cv_empty, &mutex);
|
|
}
|
|
myobj value = q.front();
|
|
q.pop();
|
|
pthread_cond_signal(&cv_full);
|
|
pthread_mutex_unlock(&mutex);
|
|
return value;
|
|
}
|
|
|
|
bool empty() { // queue is empty?
|
|
pthread_mutex_lock(&mutex);
|
|
bool ret = q.empty();
|
|
pthread_mutex_unlock(&mutex);
|
|
return ret;
|
|
}
|
|
|
|
void clear() { // remove all items
|
|
myobj item;
|
|
while (try_pop(item));
|
|
}
|
|
|
|
myobj front() {
|
|
return q.front();
|
|
}
|
|
|
|
size_t size() {
|
|
return q.size();
|
|
}
|
|
|
|
private:
|
|
std::queue<myobj> q;
|
|
pthread_mutex_t mutex;
|
|
pthread_cond_t cv_empty;
|
|
pthread_cond_t cv_full;
|
|
int capacity;
|
|
};
|
|
|
|
}
|
|
|
|
#endif // SRSLTE_BLOCK_QUEUE_H
|