/*
- * Copyright 2013 Facebook, Inc.
+ * Copyright 2016 Facebook, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
// @author Bo Hu (bhu@fb.com)
// @author Jordan DeLong (delong.j@fb.com)
-#ifndef PRODUCER_CONSUMER_QUEUE_H_
-#define PRODUCER_CONSUMER_QUEUE_H_
+#pragma once
#include <atomic>
#include <cassert>
#include <cstdlib>
+#include <memory>
#include <stdexcept>
#include <type_traits>
#include <utility>
-#include <boost/noncopyable.hpp>
namespace folly {
* without locks.
*/
template<class T>
-struct ProducerConsumerQueue : private boost::noncopyable {
+struct ProducerConsumerQueue {
typedef T value_type;
+ ProducerConsumerQueue(const ProducerConsumerQueue&) = delete;
+ ProducerConsumerQueue& operator = (const ProducerConsumerQueue&) = delete;
+
// size must be >= 2.
//
// Also, note that the number of usable slots in the queue at any
// We need to destruct anything that may still exist in our queue.
// (No real synchronization needed at destructor time: only one
// thread can be doing this.)
- if (!boost::has_trivial_destructor<T>::value) {
- int read = readIndex_;
- int end = writeIndex_;
+ if (!std::is_trivially_destructible<T>::value) {
+ size_t read = readIndex_;
+ size_t end = writeIndex_;
while (read != end) {
records_[read].~T();
if (++read == size_) {
}
bool isEmpty() const {
- return readIndex_.load(std::memory_order_consume) ==
- writeIndex_.load(std::memory_order_consume);
+ return readIndex_.load(std::memory_order_acquire) ==
+ writeIndex_.load(std::memory_order_acquire);
}
bool isFull() const {
- auto nextRecord = writeIndex_.load(std::memory_order_consume) + 1;
+ auto nextRecord = writeIndex_.load(std::memory_order_acquire) + 1;
if (nextRecord == size_) {
nextRecord = 0;
}
- if (nextRecord != readIndex_.load(std::memory_order_consume)) {
+ if (nextRecord != readIndex_.load(std::memory_order_acquire)) {
return false;
}
// queue is full
// be removing items concurrently).
// * It is undefined to call this from any other thread.
size_t sizeGuess() const {
- int ret = writeIndex_.load(std::memory_order_consume) -
- readIndex_.load(std::memory_order_consume);
+ int ret = writeIndex_.load(std::memory_order_acquire) -
+ readIndex_.load(std::memory_order_acquire);
if (ret < 0) {
ret += size_;
}
const uint32_t size_;
T* const records_;
- std::atomic<int> readIndex_;
- std::atomic<int> writeIndex_;
+ std::atomic<unsigned int> readIndex_;
+ std::atomic<unsigned int> writeIndex_;
};
}
-
-#endif