zstd/contrib/pzstd/utils/WorkQueue.h

181 lines
4.3 KiB
C
Raw Normal View History

2016-09-01 22:22:19 +00:00
/**
* Copyright (c) 2016-present, Facebook, Inc.
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree. An additional grant
* of patent rights can be found in the PATENTS file in the same directory.
*/
#pragma once
#include "utils/Buffer.h"
#include <atomic>
#include <cassert>
2016-09-02 20:53:23 +00:00
#include <cstddef>
2016-09-01 22:22:19 +00:00
#include <condition_variable>
#include <cstddef>
#include <functional>
#include <mutex>
#include <queue>
namespace pzstd {
/// Unbounded thread-safe work queue.
template <typename T>
class WorkQueue {
// Protects all member variable access
std::mutex mutex_;
2016-09-02 20:53:23 +00:00
std::condition_variable readerCv_;
std::condition_variable writerCv_;
2016-10-06 22:51:58 +00:00
std::condition_variable finishCv_;
2016-09-01 22:22:19 +00:00
std::queue<T> queue_;
bool done_;
2016-09-02 20:53:23 +00:00
std::size_t maxSize_;
// Must have lock to call this function
bool full() const {
if (maxSize_ == 0) {
return false;
}
return queue_.size() >= maxSize_;
}
2016-09-01 22:22:19 +00:00
public:
2016-09-02 20:53:23 +00:00
/**
* Constructs an empty work queue with an optional max size.
* If `maxSize == 0` the queue size is unbounded.
*
* @param maxSize The maximum allowed size of the work queue.
*/
WorkQueue(std::size_t maxSize = 0) : done_(false), maxSize_(maxSize) {}
2016-09-01 22:22:19 +00:00
/**
* Push an item onto the work queue. Notify a single thread that work is
* available. If `finish()` has been called, do nothing and return false.
*
* @param item Item to push onto the queue.
* @returns True upon success, false if `finish()` has been called. An
* item was pushed iff `push()` returns true.
*/
bool push(T item) {
{
2016-09-02 20:53:23 +00:00
std::unique_lock<std::mutex> lock(mutex_);
while (full() && !done_) {
writerCv_.wait(lock);
}
2016-09-01 22:22:19 +00:00
if (done_) {
return false;
}
queue_.push(std::move(item));
}
2016-09-02 20:53:23 +00:00
readerCv_.notify_one();
2016-09-01 22:22:19 +00:00
return true;
}
/**
* Attempts to pop an item off the work queue. It will block until data is
* available or `finish()` has been called.
*
* @param[out] item If `pop` returns `true`, it contains the popped item.
* If `pop` returns `false`, it is unmodified.
* @returns True upon success. False if the queue is empty and
* `finish()` has been called.
*/
bool pop(T& item) {
2016-09-02 20:53:23 +00:00
{
std::unique_lock<std::mutex> lock(mutex_);
while (queue_.empty() && !done_) {
readerCv_.wait(lock);
}
if (queue_.empty()) {
assert(done_);
return false;
}
item = std::move(queue_.front());
queue_.pop();
2016-09-01 22:22:19 +00:00
}
2016-09-02 20:53:23 +00:00
writerCv_.notify_one();
2016-09-01 22:22:19 +00:00
return true;
}
2016-09-03 03:11:22 +00:00
/**
* Sets the maximum queue size. If `maxSize == 0` then it is unbounded.
*
* @param maxSize The new maximum queue size.
*/
void setMaxSize(std::size_t maxSize) {
{
std::lock_guard<std::mutex> lock(mutex_);
maxSize_ = maxSize;
}
writerCv_.notify_all();
}
2016-09-01 22:22:19 +00:00
/**
* Promise that `push()` won't be called again, so once the queue is empty
* there will never any more work.
*/
void finish() {
{
std::lock_guard<std::mutex> lock(mutex_);
assert(!done_);
done_ = true;
}
2016-09-02 20:53:23 +00:00
readerCv_.notify_all();
writerCv_.notify_all();
2016-10-06 22:51:58 +00:00
finishCv_.notify_all();
2016-09-01 22:22:19 +00:00
}
/// Blocks until `finish()` has been called (but the queue may not be empty).
void waitUntilFinished() {
std::unique_lock<std::mutex> lock(mutex_);
while (!done_) {
2016-10-06 22:51:58 +00:00
finishCv_.wait(lock);
2016-09-01 22:22:19 +00:00
}
}
};
/// Work queue for `Buffer`s that knows the total number of bytes in the queue.
class BufferWorkQueue {
WorkQueue<Buffer> queue_;
std::atomic<std::size_t> size_;
public:
2016-09-02 20:53:23 +00:00
BufferWorkQueue(std::size_t maxSize = 0) : queue_(maxSize), size_(0) {}
2016-09-01 22:22:19 +00:00
void push(Buffer buffer) {
size_.fetch_add(buffer.size());
queue_.push(std::move(buffer));
}
bool pop(Buffer& buffer) {
bool result = queue_.pop(buffer);
if (result) {
size_.fetch_sub(buffer.size());
}
return result;
}
2016-09-03 03:11:22 +00:00
void setMaxSize(std::size_t maxSize) {
queue_.setMaxSize(maxSize);
}
2016-09-01 22:22:19 +00:00
void finish() {
queue_.finish();
}
/**
* Blocks until `finish()` has been called.
*
* @returns The total number of bytes of all the `Buffer`s currently in the
* queue.
*/
std::size_t size() {
queue_.waitUntilFinished();
return size_.load();
}
};
}