mirror of
https://github.com/LMMS/lmms.git
synced 2026-01-23 13:58:17 -05:00
ebed0296b3
* ThreadableJob: Move from AtomicInt to std::atomic This is the first in a series of commits that migrates away from AtomicInt towards the C++11 standard library types. This would allow the removal of AtomicInt and related Qt version-specific code. While we're at it, also make ProcessingState an `enum class` so that it's not implicitly convertible to integers. * LocklessAllocator: Switch from AtomicInt to std::atomic_int If it looks like some assignments around the Compare & Swap loops went missing, it's because compare_exchange_weak() updates the first argument to the current value when it fails (i.e., returns false). * BufferManager: Remove extra AtomicInt include * MixerWorkerThread: AtomicInt to std::atomic_int * NotePlayHandle: AtomicInt to std::atomic_int * Remove AtomicInt.h * Move from QAtomicPointer to std::atomic<T*> This removes some #ifdef trickery that was being used to get load-acquire and store-release from Qt5 and "plain" (presumably sequentially-consistent) loads and stores from Qt4.
96 lines
1.9 KiB
C++
96 lines
1.9 KiB
C++
/*
|
|
* LocklessList.h - list with lockless push and pop
|
|
*
|
|
* Copyright (c) 2016 Javier Serrano Polo <javier@jasp.net>
|
|
*
|
|
* This file is part of LMMS - https://lmms.io
|
|
*
|
|
* 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 (see COPYING); if not, write to the
|
|
* Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
|
|
* Boston, MA 02110-1301 USA.
|
|
*
|
|
*/
|
|
|
|
#ifndef LOCKLESS_LIST_H
|
|
#define LOCKLESS_LIST_H
|
|
|
|
#include "LocklessAllocator.h"
|
|
|
|
#include <atomic>
|
|
|
|
template<typename T>
|
|
class LocklessList
|
|
{
|
|
public:
|
|
struct Element
|
|
{
|
|
T value;
|
|
Element * next;
|
|
} ;
|
|
|
|
LocklessList( size_t size ) :
|
|
m_first(nullptr),
|
|
m_allocator(new LocklessAllocatorT<Element>(size))
|
|
{
|
|
}
|
|
|
|
~LocklessList()
|
|
{
|
|
delete m_allocator;
|
|
}
|
|
|
|
void push( T value )
|
|
{
|
|
Element * e = m_allocator->alloc();
|
|
e->value = value;
|
|
e->next = m_first.load(std::memory_order_relaxed);
|
|
|
|
while (!m_first.compare_exchange_weak(e->next, e,
|
|
std::memory_order_release,
|
|
std::memory_order_relaxed))
|
|
{
|
|
// Empty loop (compare_exchange_weak updates e->next)
|
|
}
|
|
}
|
|
|
|
Element * popList()
|
|
{
|
|
return m_first.exchange(nullptr);
|
|
}
|
|
|
|
Element * first()
|
|
{
|
|
return m_first.load(std::memory_order_acquire);
|
|
}
|
|
|
|
void setFirst( Element * e )
|
|
{
|
|
m_first.store(e, std::memory_order_release);
|
|
}
|
|
|
|
void free( Element * e )
|
|
{
|
|
m_allocator->free( e );
|
|
}
|
|
|
|
|
|
private:
|
|
std::atomic<Element*> m_first;
|
|
LocklessAllocatorT<Element> * m_allocator;
|
|
|
|
} ;
|
|
|
|
|
|
#endif
|