nonce iteration optimization
efficient and correct nonce iteration without duplicates
This commit is contained in:
parent
0f09883429
commit
b826985d05
3 changed files with 39 additions and 69 deletions
|
@ -26,18 +26,14 @@
|
|||
#include "crypto/common/Nonce.h"
|
||||
|
||||
|
||||
#include <mutex>
|
||||
|
||||
|
||||
namespace xmrig {
|
||||
|
||||
|
||||
std::atomic<bool> Nonce::m_paused;
|
||||
std::atomic<uint64_t> Nonce::m_sequence[Nonce::MAX];
|
||||
uint32_t Nonce::m_nonces[2] = { 0, 0 };
|
||||
std::atomic<uint64_t> Nonce::m_nonces[2] = { {0}, {0} };
|
||||
|
||||
|
||||
static std::mutex mutex;
|
||||
static Nonce nonce;
|
||||
|
||||
|
||||
|
@ -54,40 +50,33 @@ xmrig::Nonce::Nonce()
|
|||
}
|
||||
|
||||
|
||||
uint32_t xmrig::Nonce::next(uint8_t index, uint32_t nonce, uint32_t reserveCount, bool nicehash, bool *ok)
|
||||
bool xmrig::Nonce::next(uint8_t index, uint32_t *nonce, uint32_t reserveCount, bool nicehash, size_t nonceSize)
|
||||
{
|
||||
uint32_t next;
|
||||
|
||||
std::lock_guard<std::mutex> lock(mutex);
|
||||
|
||||
if (nicehash) {
|
||||
if ((m_nonces[index] + reserveCount) > 0x1000000) {
|
||||
if (ok) {
|
||||
*ok = false;
|
||||
}
|
||||
const uint64_t mask = nicehash ? 0xFFFFFFULL : (nonceSize == sizeof(uint64_t) ? 0x7FFFFFFFFFFFFFFFULL : 0xFFFFFFFFULL);
|
||||
if (reserveCount == 0 || mask < reserveCount - 1) {
|
||||
return false;
|
||||
}
|
||||
|
||||
uint64_t counter = m_nonces[index].fetch_add(reserveCount, std::memory_order_relaxed);
|
||||
while (true) {
|
||||
if (mask < counter) {
|
||||
return false;
|
||||
} else if (mask - counter <= reserveCount - 1) {
|
||||
pause(true);
|
||||
|
||||
return 0;
|
||||
if (mask - counter < reserveCount - 1) {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
|
||||
next = (nonce & 0xFF000000) | m_nonces[index];
|
||||
else if (0xFFFFFFFFUL - (uint32_t)counter < reserveCount - 1) {
|
||||
counter = m_nonces[index].fetch_add(reserveCount, std::memory_order_relaxed);
|
||||
continue;
|
||||
}
|
||||
*nonce = (nonce[0] & ~mask) | counter;
|
||||
if (mask > 0xFFFFFFFFULL) {
|
||||
nonce[1] = (counter >> 32);
|
||||
}
|
||||
return true;
|
||||
}
|
||||
else {
|
||||
next = m_nonces[index];
|
||||
}
|
||||
|
||||
m_nonces[index] += reserveCount;
|
||||
|
||||
return next;
|
||||
}
|
||||
|
||||
|
||||
void xmrig::Nonce::reset(uint8_t index)
|
||||
{
|
||||
std::lock_guard<std::mutex> lock(mutex);
|
||||
|
||||
m_nonces[index] = 0;
|
||||
}
|
||||
|
||||
|
||||
|
|
|
@ -27,6 +27,7 @@
|
|||
|
||||
|
||||
#include <atomic>
|
||||
#include <cstddef>
|
||||
|
||||
|
||||
namespace xmrig {
|
||||
|
@ -49,18 +50,18 @@ public:
|
|||
static inline bool isPaused() { return m_paused.load(std::memory_order_relaxed); }
|
||||
static inline uint64_t sequence(Backend backend) { return m_sequence[backend].load(std::memory_order_relaxed); }
|
||||
static inline void pause(bool paused) { m_paused = paused; }
|
||||
static inline void reset(uint8_t index) { m_nonces[index] = 0; }
|
||||
static inline void stop(Backend backend) { m_sequence[backend] = 0; }
|
||||
static inline void touch(Backend backend) { m_sequence[backend]++; }
|
||||
|
||||
static uint32_t next(uint8_t index, uint32_t nonce, uint32_t reserveCount, bool nicehash, bool *ok = nullptr);
|
||||
static void reset(uint8_t index);
|
||||
static bool next(uint8_t index, uint32_t *nonce, uint32_t reserveCount, bool nicehash, size_t nonceSize);
|
||||
static void stop();
|
||||
static void touch();
|
||||
|
||||
private:
|
||||
static std::atomic<bool> m_paused;
|
||||
static std::atomic<uint64_t> m_sequence[MAX];
|
||||
static uint32_t m_nonces[2];
|
||||
static std::atomic<uint64_t> m_nonces[2];
|
||||
};
|
||||
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue