Convert __sync* built-ins to std::atomic

Also converts thread_queue_hack to a simpler reserved vector
This commit is contained in:
kannibalox
2024-12-01 13:30:05 -05:00
committed by Jari Sundell
parent 73c1233dc0
commit 0ea7615d0a
5 changed files with 44 additions and 117 deletions
+28 -93
View File
@@ -1,39 +1,3 @@
// libTorrent - BitTorrent library
// Copyright (C) 2005-2011, Jari Sundell
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// This program 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 General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
//
// In addition, as a special exception, the copyright holders give
// permission to link the code of portions of this program with the
// OpenSSL library under certain conditions as described in each
// individual source file, and distribute linked combinations
// including the two.
//
// You must obey the GNU General Public License in all respects for
// all of the code used other than OpenSSL. If you modify file(s)
// with this exception, you may extend this exception to your version
// of the file(s), but you are not obligated to do so. If you do not
// wish to do so, delete this exception statement from your version.
// If you delete this exception statement from all source files in the
// program, then also delete it here.
//
// Contact: Jari Sundell <jaris@ifi.uio.no>
//
// Skomakerveien 33
// 3185 Skoppum, NORWAY
#include "config.h"
#include "thread_base.h"
@@ -41,82 +5,54 @@
#include <cassert>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <signal.h>
#include <unistd.h>
#include <rak/error_number.h>
#include <torrent/exceptions.h>
#include <torrent/torrent.h>
#include <torrent/utils/log.h>
#include <unistd.h>
#include "globals.h"
#include "control.h"
#include "core/manager.h"
// Temporarly injected into config.h.
/* temp hack */
//#define lt_cacheline_aligned __attribute__((__aligned__(128)))
class lt_cacheline_aligned thread_queue_hack {
class lt_cacheline_aligned thread_queue_hack : private std::vector<ThreadBase::thread_base_func> {
public:
typedef ThreadBase::thread_base_func value_type;
typedef ThreadBase::thread_base_func* iterator;
static constexpr unsigned int max_size = 32;
static const unsigned int max_size = 32;
using value_type = ThreadBase::thread_base_func;
using base_type = std::vector<value_type>;
thread_queue_hack() { std::memset(this, 0, sizeof(thread_queue_hack)); }
using base_type::empty;
void lock() { while (!__sync_bool_compare_and_swap(&m_lock, 0, 1)) usleep(0); }
void unlock() { __sync_bool_compare_and_swap(&m_lock, 1, 0); }
iterator begin() { return m_queue; }
iterator max_capacity() { return m_queue + max_size; }
iterator end_and_lock() { lock(); return std::find(begin(), max_capacity(), (value_type)NULL); }
bool empty() const { return m_queue[0] == NULL; }
thread_queue_hack() { reserve(max_size); };
void push_back(value_type v) {
iterator itr = end_and_lock();
if (itr == max_capacity())
throw torrent::internal_error("Overflowed thread_queue.");
__sync_bool_compare_and_swap(itr, NULL, v);
unlock();
if (size() >= max_size)
throw torrent::internal_error("Overflowed thread_queue max size of " + std::to_string(max_size) + ".");
const std::lock_guard<std::mutex> lguard(m_lock);
base_type::push_back(v);
}
value_type* copy_and_clear(value_type* dest) {
iterator itr = begin();
lock();
while (*itr != NULL) *dest++ = *itr++;
clear_and_unlock();
return dest;
void copy_and_clear(base_type& target) {
std::lock_guard<std::mutex> lguard(m_lock);
target.assign(begin(), end());
clear();
}
void clear_and_unlock() {
std::memset(this, 0, sizeof(thread_queue_hack));
__sync_synchronize();
}
private:
int m_lock;
value_type m_queue[max_size + 1];
private:
std::mutex m_lock;
};
void throw_shutdown_exception() { throw torrent::shutdown_exception(); }
void
throw_shutdown_exception() { throw torrent::shutdown_exception(); }
ThreadBase::ThreadBase() {
m_taskShutdown.slot() = std::bind(&throw_shutdown_exception);
m_threadQueue = new thread_queue_hack;
m_threadQueue = std::make_unique<thread_queue_hack>();
}
ThreadBase::~ThreadBase() {
delete m_threadQueue;
}
// Defined in here and not the header so that the default destructor
// can properly deduce how to destruct the unique_ptr<thread_queue_hack>
ThreadBase::~ThreadBase() = default;
// Move to libtorrent...
void
@@ -137,12 +73,11 @@ ThreadBase::next_timeout_usec() {
void
ThreadBase::call_queued_items() {
thread_base_func result[thread_queue_hack::max_size];
thread_base_func* first = result;
thread_base_func* last = m_threadQueue->copy_and_clear((thread_base_func*)result);
while (first != last && *first)
(*first++)(this);
std::vector<thread_queue_hack::value_type> queue;
m_threadQueue->copy_and_clear(queue);
for (auto itr : queue) {
itr(this);
}
}
void