ForkMaster/netgen
1
0
Fork 0
mirror of https://github.com/NGSolve/netgen.git synced 2024-09-22 17:52:50 +05:00
Code Issues Packages Projects Releases Wiki Activity

shared loop with relaxed memory ordering

Browse Source
This commit is contained in:
Joachim Schoeberl 2023-03-30 12:26:58 +02:00
parent a12e9bec61
commit ad6ffaac05
1 changed files with 7 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
libsrc/core/taskmanager.hpp
View File

@ -462,22 +462,26 @@ public:
// return IntRange(begin, end); // return IntRange(begin, end);
// } // }
bool PopFirst (size_t & first) bool PopFirst (size_t & hfirst)
{ {
// first = begin++; // first = begin++;
// return first < end; // return first < end;
first = begin; size_t first = begin.load(std::memory_order_relaxed);
size_t nextfirst = first+1; size_t nextfirst = first+1;
if (first >= end) nextfirst = std::numeric_limits<size_t>::max()-1; if (first >= end) nextfirst = std::numeric_limits<size_t>::max()-1;
while (!begin.compare_exchange_weak (first, nextfirst)) // while (!begin.compare_exchange_weak (first, nextfirst))
while (!begin.compare_exchange_weak (first, nextfirst,
std::memory_order_relaxed,
std::memory_order_relaxed))
{ {
first = begin; first = begin;
nextfirst = first+1; nextfirst = first+1;
if (nextfirst >= end) nextfirst = std::numeric_limits<size_t>::max()-1; if (nextfirst >= end) nextfirst = std::numeric_limits<size_t>::max()-1;
} }
hfirst = first;
return first < end; return first < end;
} }