atomic_t<>: remove inline assignment

Add atomic_op/fetch_op overloads with template argument (may be removed in future)
Remove args... in atomic_op (capturing lambda is preferred)
This commit is contained in:
Nekotekina 2018-09-09 12:59:24 +03:00
parent 3ac1b46df2
commit 2226125728
4 changed files with 149 additions and 58 deletions

View file

@ -618,9 +618,11 @@ public:
while (true) while (true)
{ {
_new = old;
if constexpr (std::is_void_v<RT>) if constexpr (std::is_void_v<RT>)
{ {
std::invoke(func, (_new = old)); std::invoke(std::forward<F>(func), _new);
if (LIKELY(atomic_storage<type>::compare_exchange(m_data, old, _new))) if (LIKELY(atomic_storage<type>::compare_exchange(m_data, old, _new)))
{ {
@ -629,7 +631,7 @@ public:
} }
else else
{ {
RT ret = std::invoke(func, (_new = old)); RT ret = std::invoke(std::forward<F>(func), _new);
if (LIKELY(!ret || atomic_storage<type>::compare_exchange(m_data, old, _new))) if (LIKELY(!ret || atomic_storage<type>::compare_exchange(m_data, old, _new)))
{ {
@ -639,17 +641,50 @@ public:
} }
} }
// Atomic operation; returns function result value (TODO: remove args) // fetch_op overload with function (invokable) provided as a template parameter
template <typename F, typename... Args, typename RT = std::invoke_result_t<F, T&, const Args&...>> template <auto F, typename RT = std::invoke_result_t<decltype(F), T&>>
RT atomic_op(F&& func, const Args&... args) std::conditional_t<std::is_void_v<RT>, type, std::pair<type, RT>> fetch_op()
{ {
type _new, old = atomic_storage<type>::load(m_data); type _new, old = atomic_storage<type>::load(m_data);
while (true) while (true)
{ {
_new = old;
if constexpr (std::is_void_v<RT>) if constexpr (std::is_void_v<RT>)
{ {
std::invoke(func, (_new = old), args...); std::invoke(F, _new);
if (LIKELY(atomic_storage<type>::compare_exchange(m_data, old, _new)))
{
return old;
}
}
else
{
RT ret = std::invoke(F, _new);
if (LIKELY(!ret || atomic_storage<type>::compare_exchange(m_data, old, _new)))
{
return {old, std::move(ret)};
}
}
}
}
// Atomic operation; returns function result value, function is the lambda
template <typename F, typename RT = std::invoke_result_t<F, T&>>
RT atomic_op(F&& func)
{
type _new, old = atomic_storage<type>::load(m_data);
while (true)
{
_new = old;
if constexpr (std::is_void_v<RT>)
{
std::invoke(std::forward<F>(func), _new);
if (LIKELY(atomic_storage<type>::compare_exchange(m_data, old, _new))) if (LIKELY(atomic_storage<type>::compare_exchange(m_data, old, _new)))
{ {
@ -658,7 +693,38 @@ public:
} }
else else
{ {
RT result = std::invoke(func, (_new = old), args...); RT result = std::invoke(std::forward<F>(func), _new);
if (LIKELY(atomic_storage<type>::compare_exchange(m_data, old, _new)))
{
return result;
}
}
}
}
// atomic_op overload with function (invokable) provided as a template parameter
template <auto F, typename RT = std::invoke_result_t<decltype(F), T&>>
RT atomic_op()
{
type _new, old = atomic_storage<type>::load(m_data);
while (true)
{
_new = old;
if constexpr (std::is_void_v<RT>)
{
std::invoke(F, _new);
if (LIKELY(atomic_storage<type>::compare_exchange(m_data, old, _new)))
{
return;
}
}
else
{
RT result = std::invoke(F, _new);
if (LIKELY(atomic_storage<type>::compare_exchange(m_data, old, _new))) if (LIKELY(atomic_storage<type>::compare_exchange(m_data, old, _new)))
{ {

View file

@ -74,7 +74,7 @@ error_code cellSyncMutexLock(ppu_thread& ppu, vm::ptr<CellSyncMutex> mutex)
} }
// Increase acq value and remember its old value // Increase acq value and remember its old value
const auto order = mutex->ctrl.atomic_op(&CellSyncMutex::lock_begin); const auto order = mutex->ctrl.atomic_op<&CellSyncMutex::Counter::lock_begin>();
// Wait until rel value is equal to old acq value // Wait until rel value is equal to old acq value
while (mutex->ctrl.load().rel != order) while (mutex->ctrl.load().rel != order)
@ -101,7 +101,7 @@ error_code cellSyncMutexTryLock(vm::ptr<CellSyncMutex> mutex)
return CELL_SYNC_ERROR_ALIGN; return CELL_SYNC_ERROR_ALIGN;
} }
if (!mutex->ctrl.atomic_op(&CellSyncMutex::try_lock)) if (!mutex->ctrl.atomic_op<&CellSyncMutex::Counter::try_lock>())
{ {
return not_an_error(CELL_SYNC_ERROR_BUSY); return not_an_error(CELL_SYNC_ERROR_BUSY);
} }
@ -123,7 +123,7 @@ error_code cellSyncMutexUnlock(vm::ptr<CellSyncMutex> mutex)
return CELL_SYNC_ERROR_ALIGN; return CELL_SYNC_ERROR_ALIGN;
} }
mutex->ctrl.atomic_op(&CellSyncMutex::unlock); mutex->ctrl.atomic_op<&CellSyncMutex::Counter::unlock>();
return CELL_OK; return CELL_OK;
} }
@ -167,7 +167,7 @@ error_code cellSyncBarrierNotify(ppu_thread& ppu, vm::ptr<CellSyncBarrier> barri
return CELL_SYNC_ERROR_ALIGN; return CELL_SYNC_ERROR_ALIGN;
} }
while (!barrier->ctrl.atomic_op(&CellSyncBarrier::try_notify)) while (!barrier->ctrl.atomic_op<&CellSyncBarrier::try_notify>())
{ {
ppu.test_state(); ppu.test_state();
} }
@ -191,7 +191,7 @@ error_code cellSyncBarrierTryNotify(vm::ptr<CellSyncBarrier> barrier)
_mm_mfence(); _mm_mfence();
if (!barrier->ctrl.atomic_op(&CellSyncBarrier::try_notify)) if (!barrier->ctrl.atomic_op<&CellSyncBarrier::try_notify>())
{ {
return not_an_error(CELL_SYNC_ERROR_BUSY); return not_an_error(CELL_SYNC_ERROR_BUSY);
} }
@ -215,7 +215,7 @@ error_code cellSyncBarrierWait(ppu_thread& ppu, vm::ptr<CellSyncBarrier> barrier
_mm_mfence(); _mm_mfence();
while (!barrier->ctrl.atomic_op(&CellSyncBarrier::try_wait)) while (!barrier->ctrl.atomic_op<&CellSyncBarrier::try_wait>())
{ {
ppu.test_state(); ppu.test_state();
} }
@ -239,7 +239,7 @@ error_code cellSyncBarrierTryWait(vm::ptr<CellSyncBarrier> barrier)
_mm_mfence(); _mm_mfence();
if (!barrier->ctrl.atomic_op(&CellSyncBarrier::try_wait)) if (!barrier->ctrl.atomic_op<&CellSyncBarrier::try_wait>())
{ {
return not_an_error(CELL_SYNC_ERROR_BUSY); return not_an_error(CELL_SYNC_ERROR_BUSY);
} }
@ -291,7 +291,7 @@ error_code cellSyncRwmRead(ppu_thread& ppu, vm::ptr<CellSyncRwm> rwm, vm::ptr<vo
} }
// wait until `writers` is zero, increase `readers` // wait until `writers` is zero, increase `readers`
while (!rwm->ctrl.atomic_op(&CellSyncRwm::try_read_begin)) while (!rwm->ctrl.atomic_op<&CellSyncRwm::try_read_begin>())
{ {
ppu.test_state(); ppu.test_state();
} }
@ -300,7 +300,7 @@ error_code cellSyncRwmRead(ppu_thread& ppu, vm::ptr<CellSyncRwm> rwm, vm::ptr<vo
std::memcpy(buffer.get_ptr(), rwm->buffer.get_ptr(), rwm->size); std::memcpy(buffer.get_ptr(), rwm->buffer.get_ptr(), rwm->size);
// decrease `readers`, return error if already zero // decrease `readers`, return error if already zero
if (!rwm->ctrl.atomic_op(&CellSyncRwm::try_read_end)) if (!rwm->ctrl.atomic_op<&CellSyncRwm::try_read_end>())
{ {
return CELL_SYNC_ERROR_ABORT; return CELL_SYNC_ERROR_ABORT;
} }
@ -323,7 +323,7 @@ error_code cellSyncRwmTryRead(vm::ptr<CellSyncRwm> rwm, vm::ptr<void> buffer)
} }
// increase `readers` if `writers` is zero // increase `readers` if `writers` is zero
if (!rwm->ctrl.atomic_op(&CellSyncRwm::try_read_begin)) if (!rwm->ctrl.atomic_op<&CellSyncRwm::try_read_begin>())
{ {
return not_an_error(CELL_SYNC_ERROR_BUSY); return not_an_error(CELL_SYNC_ERROR_BUSY);
} }
@ -332,7 +332,7 @@ error_code cellSyncRwmTryRead(vm::ptr<CellSyncRwm> rwm, vm::ptr<void> buffer)
std::memcpy(buffer.get_ptr(), rwm->buffer.get_ptr(), rwm->size); std::memcpy(buffer.get_ptr(), rwm->buffer.get_ptr(), rwm->size);
// decrease `readers`, return error if already zero // decrease `readers`, return error if already zero
if (!rwm->ctrl.atomic_op(&CellSyncRwm::try_read_end)) if (!rwm->ctrl.atomic_op<&CellSyncRwm::try_read_end>())
{ {
return CELL_SYNC_ERROR_ABORT; return CELL_SYNC_ERROR_ABORT;
} }
@ -355,7 +355,7 @@ error_code cellSyncRwmWrite(ppu_thread& ppu, vm::ptr<CellSyncRwm> rwm, vm::cptr<
} }
// wait until `writers` is zero, set to 1 // wait until `writers` is zero, set to 1
while (!rwm->ctrl.atomic_op(&CellSyncRwm::try_write_begin)) while (!rwm->ctrl.atomic_op<&CellSyncRwm::try_write_begin>())
{ {
ppu.test_state(); ppu.test_state();
} }
@ -457,7 +457,10 @@ error_code cellSyncQueuePush(ppu_thread& ppu, vm::ptr<CellSyncQueue> queue, vm::
u32 position; u32 position;
while (!queue->ctrl.atomic_op(&CellSyncQueue::try_push_begin, depth, &position)) while (!queue->ctrl.atomic_op([&](auto& ctrl)
{
return CellSyncQueue::try_push_begin(ctrl, depth, &position);
}))
{ {
ppu.test_state(); ppu.test_state();
} }
@ -465,7 +468,7 @@ error_code cellSyncQueuePush(ppu_thread& ppu, vm::ptr<CellSyncQueue> queue, vm::
// copy data from the buffer at the position // copy data from the buffer at the position
std::memcpy(&queue->buffer[position * queue->size], buffer.get_ptr(), queue->size); std::memcpy(&queue->buffer[position * queue->size], buffer.get_ptr(), queue->size);
queue->ctrl.atomic_op(&CellSyncQueue::push_end); queue->ctrl.atomic_op<&CellSyncQueue::push_end>();
return CELL_OK; return CELL_OK;
} }
@ -488,7 +491,10 @@ error_code cellSyncQueueTryPush(vm::ptr<CellSyncQueue> queue, vm::cptr<void> buf
u32 position; u32 position;
if (!queue->ctrl.atomic_op(&CellSyncQueue::try_push_begin, depth, &position)) while (!queue->ctrl.atomic_op([&](auto& ctrl)
{
return CellSyncQueue::try_push_begin(ctrl, depth, &position);
}))
{ {
return not_an_error(CELL_SYNC_ERROR_BUSY); return not_an_error(CELL_SYNC_ERROR_BUSY);
} }
@ -496,7 +502,7 @@ error_code cellSyncQueueTryPush(vm::ptr<CellSyncQueue> queue, vm::cptr<void> buf
// copy data from the buffer at the position // copy data from the buffer at the position
std::memcpy(&queue->buffer[position * queue->size], buffer.get_ptr(), queue->size); std::memcpy(&queue->buffer[position * queue->size], buffer.get_ptr(), queue->size);
queue->ctrl.atomic_op(&CellSyncQueue::push_end); queue->ctrl.atomic_op<&CellSyncQueue::push_end>();
return CELL_OK; return CELL_OK;
} }
@ -519,7 +525,10 @@ error_code cellSyncQueuePop(ppu_thread& ppu, vm::ptr<CellSyncQueue> queue, vm::p
u32 position; u32 position;
while (!queue->ctrl.atomic_op(&CellSyncQueue::try_pop_begin, depth, &position)) while (!queue->ctrl.atomic_op([&](auto& ctrl)
{
return CellSyncQueue::try_pop_begin(ctrl, depth, &position);
}))
{ {
ppu.test_state(); ppu.test_state();
} }
@ -527,7 +536,7 @@ error_code cellSyncQueuePop(ppu_thread& ppu, vm::ptr<CellSyncQueue> queue, vm::p
// copy data at the position to the buffer // copy data at the position to the buffer
std::memcpy(buffer.get_ptr(), &queue->buffer[position % depth * queue->size], queue->size); std::memcpy(buffer.get_ptr(), &queue->buffer[position % depth * queue->size], queue->size);
queue->ctrl.atomic_op(&CellSyncQueue::pop_end); queue->ctrl.atomic_op<&CellSyncQueue::pop_end>();
return CELL_OK; return CELL_OK;
} }
@ -550,7 +559,10 @@ error_code cellSyncQueueTryPop(vm::ptr<CellSyncQueue> queue, vm::ptr<void> buffe
u32 position; u32 position;
if (!queue->ctrl.atomic_op(&CellSyncQueue::try_pop_begin, depth, &position)) while (!queue->ctrl.atomic_op([&](auto& ctrl)
{
return CellSyncQueue::try_pop_begin(ctrl, depth, &position);
}))
{ {
return not_an_error(CELL_SYNC_ERROR_BUSY); return not_an_error(CELL_SYNC_ERROR_BUSY);
} }
@ -558,7 +570,7 @@ error_code cellSyncQueueTryPop(vm::ptr<CellSyncQueue> queue, vm::ptr<void> buffe
// copy data at the position to the buffer // copy data at the position to the buffer
std::memcpy(buffer.get_ptr(), &queue->buffer[position % depth * queue->size], queue->size); std::memcpy(buffer.get_ptr(), &queue->buffer[position % depth * queue->size], queue->size);
queue->ctrl.atomic_op(&CellSyncQueue::pop_end); queue->ctrl.atomic_op<&CellSyncQueue::pop_end>();
return CELL_OK; return CELL_OK;
} }
@ -581,7 +593,10 @@ error_code cellSyncQueuePeek(ppu_thread& ppu, vm::ptr<CellSyncQueue> queue, vm::
u32 position; u32 position;
while (!queue->ctrl.atomic_op(&CellSyncQueue::try_peek_begin, depth, &position)) while (!queue->ctrl.atomic_op([&](auto& ctrl)
{
return CellSyncQueue::try_peek_begin(ctrl, depth, &position);
}))
{ {
ppu.test_state(); ppu.test_state();
} }
@ -589,7 +604,7 @@ error_code cellSyncQueuePeek(ppu_thread& ppu, vm::ptr<CellSyncQueue> queue, vm::
// copy data at the position to the buffer // copy data at the position to the buffer
std::memcpy(buffer.get_ptr(), &queue->buffer[position % depth * queue->size], queue->size); std::memcpy(buffer.get_ptr(), &queue->buffer[position % depth * queue->size], queue->size);
queue->ctrl.atomic_op(&CellSyncQueue::pop_end); queue->ctrl.atomic_op<&CellSyncQueue::pop_end>();
return CELL_OK; return CELL_OK;
} }
@ -612,7 +627,10 @@ error_code cellSyncQueueTryPeek(vm::ptr<CellSyncQueue> queue, vm::ptr<void> buff
u32 position; u32 position;
if (!queue->ctrl.atomic_op(&CellSyncQueue::try_peek_begin, depth, &position)) while (!queue->ctrl.atomic_op([&](auto& ctrl)
{
return CellSyncQueue::try_peek_begin(ctrl, depth, &position);
}))
{ {
return not_an_error(CELL_SYNC_ERROR_BUSY); return not_an_error(CELL_SYNC_ERROR_BUSY);
} }
@ -620,7 +638,7 @@ error_code cellSyncQueueTryPeek(vm::ptr<CellSyncQueue> queue, vm::ptr<void> buff
// copy data at the position to the buffer // copy data at the position to the buffer
std::memcpy(buffer.get_ptr(), &queue->buffer[position % depth * queue->size], queue->size); std::memcpy(buffer.get_ptr(), &queue->buffer[position % depth * queue->size], queue->size);
queue->ctrl.atomic_op(&CellSyncQueue::pop_end); queue->ctrl.atomic_op<&CellSyncQueue::pop_end>();
return CELL_OK; return CELL_OK;
} }
@ -660,12 +678,12 @@ error_code cellSyncQueueClear(ppu_thread& ppu, vm::ptr<CellSyncQueue> queue)
const u32 depth = queue->check_depth(); const u32 depth = queue->check_depth();
while (!queue->ctrl.atomic_op(&CellSyncQueue::try_clear_begin_1)) while (!queue->ctrl.atomic_op<&CellSyncQueue::try_clear_begin_1>())
{ {
ppu.test_state(); ppu.test_state();
} }
while (!queue->ctrl.atomic_op(&CellSyncQueue::try_clear_begin_2)) while (!queue->ctrl.atomic_op<&CellSyncQueue::try_clear_begin_2>())
{ {
ppu.test_state(); ppu.test_state();
} }

View file

@ -2,8 +2,6 @@
#include "Utilities/BitField.h" #include "Utilities/BitField.h"
// Return Codes // Return Codes
enum CellSyncError : u32 enum CellSyncError : u32
{ {
@ -36,34 +34,34 @@ enum CellSyncError1 : u32
struct CellSyncMutex struct CellSyncMutex
{ {
struct alignas(4) ctrl_t struct alignas(4) Counter
{ {
be_t<u16> rel; be_t<u16> rel;
be_t<u16> acq; be_t<u16> acq;
};
atomic_t<ctrl_t> ctrl; auto lock_begin()
static inline auto lock_begin(ctrl_t& ctrl)
{
return ctrl.acq++;
}
static inline bool try_lock(ctrl_t& ctrl)
{
if (UNLIKELY(ctrl.rel != ctrl.acq))
{ {
return false; return acq++;
} }
ctrl.acq++; bool try_lock()
return true; {
} if (UNLIKELY(rel != acq))
{
return false;
}
static inline void unlock(ctrl_t& ctrl) acq++;
{ return true;
ctrl.rel++; }
}
void unlock()
{
rel++;
}
};
atomic_t<Counter> ctrl;
}; };
CHECK_SIZE_ALIGN(CellSyncMutex, 4, 4); CHECK_SIZE_ALIGN(CellSyncMutex, 4, 4);

View file

@ -115,7 +115,10 @@ error_code sys_event_flag_wait(ppu_thread& ppu, u32 id, u64 bitptn, u32 mode, vm
const auto flag = idm::get<lv2_obj, lv2_event_flag>(id, [&](lv2_event_flag& flag) -> CellError const auto flag = idm::get<lv2_obj, lv2_event_flag>(id, [&](lv2_event_flag& flag) -> CellError
{ {
if (flag.pattern.atomic_op(lv2_event_flag::check_pattern, bitptn, mode, &ppu.gpr[6])) if (flag.pattern.atomic_op([&](u64& pat)
{
return lv2_event_flag::check_pattern(pat, bitptn, mode, &ppu.gpr[6]);
}))
{ {
// TODO: is it possible to return EPERM in this case? // TODO: is it possible to return EPERM in this case?
return {}; return {};
@ -123,7 +126,10 @@ error_code sys_event_flag_wait(ppu_thread& ppu, u32 id, u64 bitptn, u32 mode, vm
std::lock_guard lock(flag.mutex); std::lock_guard lock(flag.mutex);
if (flag.pattern.atomic_op(lv2_event_flag::check_pattern, bitptn, mode, &ppu.gpr[6])) if (flag.pattern.atomic_op([&](u64& pat)
{
return lv2_event_flag::check_pattern(pat, bitptn, mode, &ppu.gpr[6]);
}))
{ {
return {}; return {};
} }
@ -208,7 +214,10 @@ error_code sys_event_flag_trywait(u32 id, u64 bitptn, u32 mode, vm::ptr<u64> res
const auto flag = idm::check<lv2_obj, lv2_event_flag>(id, [&](lv2_event_flag& flag) const auto flag = idm::check<lv2_obj, lv2_event_flag>(id, [&](lv2_event_flag& flag)
{ {
return flag.pattern.atomic_op(lv2_event_flag::check_pattern, bitptn, mode, &pattern); return flag.pattern.atomic_op([&](u64& pat)
{
return lv2_event_flag::check_pattern(pat, bitptn, mode, &pattern);
});
}); });
if (!flag) if (!flag)