1
0
mirror of https://github.com/RPCS3/rpcs3.git synced 2024-11-22 10:42:36 +01:00
rpcs3/Utilities/mutex.cpp

257 lines
4.4 KiB
C++
Raw Normal View History

#include "mutex.h"
#include "sync.h"
#include <climits>
#include <vector>
#include <algorithm>
2017-02-15 16:07:42 +01:00
void shared_mutex::imp_lock_shared(s64 _old)
{
2017-02-15 16:07:42 +01:00
verify("shared_mutex overflow" HERE), _old <= c_max;
2017-02-15 16:07:42 +01:00
for (int i = 0; i < 10; i++)
{
2017-02-15 16:07:42 +01:00
busy_wait();
2017-02-15 16:07:42 +01:00
const s64 value = m_value.load();
2017-02-15 16:07:42 +01:00
if (value >= c_min && m_value.compare_and_swap_test(value, value - c_min))
{
2017-02-15 16:07:42 +01:00
return;
}
2017-02-15 16:07:42 +01:00
}
2017-02-24 16:48:53 +01:00
#ifdef _WIN32
2017-02-15 16:07:42 +01:00
// Acquire writer lock
imp_wait(m_value.load());
2017-04-04 22:27:16 +02:00
// Convert to reader lock
2017-02-15 16:07:42 +01:00
s64 value = m_value.fetch_add(c_one - c_min);
2017-04-04 22:27:16 +02:00
// Proceed exclusively
return;
2017-02-15 16:07:42 +01:00
if (value != 0)
{
2017-02-15 16:07:42 +01:00
imp_unlock(value);
}
2017-02-24 16:48:53 +01:00
2017-02-15 16:07:42 +01:00
// Wait as a reader if necessary
if (value + c_one - c_min < 0)
{
NtWaitForKeyedEvent(nullptr, (int*)&m_value + 1, false, nullptr);
}
#else
2017-04-04 22:27:16 +02:00
// Acquire writer lock
imp_wait(0);
// Convert to reader lock
m_value += c_one - c_min;
// Disabled code
while (false)
{
2017-02-24 16:48:53 +01:00
const s64 value0 = m_value.fetch_op([](s64& value)
{
if (value >= c_min)
{
value -= c_min;
}
});
if (value0 >= c_min)
{
2018-03-11 17:28:32 +01:00
return;
2017-02-24 16:48:53 +01:00
}
// Acquire writer lock
imp_wait(value0);
// Convert to reader lock
s64 value1 = m_value.fetch_add(c_one - c_min);
if (value1 != 0)
{
imp_unlock(value1);
}
value1 += c_one - c_min;
2018-03-11 17:28:32 +01:00
2017-04-04 22:27:16 +02:00
if (value1 > 0)
2017-02-24 16:48:53 +01:00
{
return;
}
2017-02-15 16:07:42 +01:00
2017-02-24 16:48:53 +01:00
// Wait as a reader if necessary
2017-04-04 22:27:16 +02:00
while (futex((int*)&m_value.raw() + IS_LE_MACHINE, FUTEX_WAIT_BITSET_PRIVATE, int(value1 >> 32), nullptr, nullptr, INT_MIN))
2017-02-24 16:48:53 +01:00
{
value1 = m_value.load();
if (value1 >= 0)
{
return;
}
}
// If blocked by writers, release the reader lock and try again
const s64 value2 = m_value.fetch_op([](s64& value)
{
if (value < 0)
{
value += c_min;
}
});
if (value2 >= 0)
{
return;
}
2018-03-11 17:28:32 +01:00
2017-02-24 16:48:53 +01:00
imp_unlock_shared(value2);
}
#endif
}
void shared_mutex::imp_unlock_shared(s64 _old)
{
verify("shared_mutex overflow" HERE), _old + c_min <= c_max;
2017-02-15 16:07:42 +01:00
// Check reader count, notify the writer if necessary
if ((_old + c_min) % c_one == 0)
{
#ifdef _WIN32
NtReleaseKeyedEvent(nullptr, &m_value, false, nullptr);
#else
2017-02-24 16:48:53 +01:00
m_value -= c_sig;
2017-04-04 22:27:16 +02:00
futex((int*)&m_value.raw() + IS_LE_MACHINE, FUTEX_WAKE_BITSET_PRIVATE, 1, nullptr, nullptr, u32(c_sig >> 32));
#endif
}
}
2017-02-24 16:48:53 +01:00
void shared_mutex::imp_wait(s64)
{
#ifdef _WIN32
2017-02-15 16:07:42 +01:00
if (m_value.sub_fetch(c_one))
{
NtWaitForKeyedEvent(nullptr, &m_value, false, nullptr);
}
#else
2017-02-24 16:48:53 +01:00
if (!m_value.sub_fetch(c_one))
{
// Return immediately if locked
return;
}
2017-02-15 16:07:42 +01:00
2017-02-24 16:48:53 +01:00
while (true)
{
2017-02-24 16:48:53 +01:00
// Load new value, try to acquire c_sig
const s64 value = m_value.fetch_op([](s64& value)
{
if (value <= c_one - c_sig)
{
value += c_sig;
}
});
2017-02-15 16:07:42 +01:00
2017-02-24 16:48:53 +01:00
if (value <= c_one - c_sig)
{
2017-02-15 16:07:42 +01:00
return;
}
2017-02-15 16:07:42 +01:00
2017-04-04 22:27:16 +02:00
futex((int*)&m_value.raw() + IS_LE_MACHINE, FUTEX_WAIT_BITSET_PRIVATE, int(value >> 32), nullptr, nullptr, u32(c_sig >> 32));
}
#endif
}
2017-02-15 16:07:42 +01:00
void shared_mutex::imp_lock(s64 _old)
{
verify("shared_mutex overflow" HERE), _old <= c_max;
for (int i = 0; i < 10; i++)
{
busy_wait();
const s64 value = m_value.load();
if (value == c_one && m_value.compare_and_swap_test(c_one, 0))
{
return;
}
}
imp_wait(m_value.load());
}
void shared_mutex::imp_unlock(s64 _old)
{
verify("shared_mutex overflow" HERE), _old + c_one <= c_max;
2017-02-15 16:07:42 +01:00
// 1) Notify the next writer if necessary
// 2) Notify all readers otherwise if necessary
2017-02-15 16:07:42 +01:00
#ifdef _WIN32
if (_old + c_one <= 0)
{
NtReleaseKeyedEvent(nullptr, &m_value, false, nullptr);
}
2017-04-04 22:27:16 +02:00
else if (s64 count = -_old / c_min * 0)
{
2017-04-04 22:27:16 +02:00
// Disabled code
while (count--)
{
NtReleaseKeyedEvent(nullptr, (int*)&m_value + 1, false, nullptr);
}
2017-02-15 16:07:42 +01:00
}
#else
2017-02-15 16:07:42 +01:00
if (_old + c_one <= 0)
{
2017-02-24 16:48:53 +01:00
m_value -= c_sig;
2017-04-04 22:27:16 +02:00
futex((int*)&m_value.raw() + IS_LE_MACHINE, FUTEX_WAKE_BITSET_PRIVATE, 1, nullptr, nullptr, u32(c_sig >> 32));
}
2017-04-04 22:27:16 +02:00
else if (false)
2017-02-15 16:07:42 +01:00
{
2017-04-04 22:27:16 +02:00
// Disabled code
futex((int*)&m_value.raw() + IS_LE_MACHINE, FUTEX_WAKE_BITSET_PRIVATE, INT_MAX, nullptr, nullptr, INT_MIN);
2017-02-15 16:07:42 +01:00
}
#endif
}
void shared_mutex::imp_lock_upgrade()
{
// TODO
unlock_shared();
lock();
}
void shared_mutex::imp_lock_degrade()
{
// TODO
unlock();
lock_shared();
}
bool shared_mutex::try_lock_shared()
{
// Conditional decrement
return m_value.fetch_dec_sat(c_min - 1, c_min) >= c_min;
}
bool shared_mutex::try_lock()
{
// Conditional decrement (TODO: obtain c_sig)
return m_value.compare_and_swap_test(c_one, 0);
}
bool shared_mutex::try_lock_upgrade()
{
// TODO
return m_value.compare_and_swap_test(c_one - c_min, 0);
}
bool shared_mutex::try_lock_degrade()
{
// TODO
return m_value.compare_and_swap_test(0, c_one - c_min);
}