我有一个原子计数器(std::atomic<uint32_t> count),它按顺序递增值到多个线程.
uint32_t my_val = ++count;
Run Code Online (Sandbox Code Playgroud)
在我得到之前,我my_val想确保增量不会溢出(即:返回0)
if (count == std::numeric_limits<uint32_t>::max())
throw std::runtime_error("count overflow");
Run Code Online (Sandbox Code Playgroud)
我认为这是一个天真的检查,因为如果在增加计数器之前由两个线程执行检查,则增加的第二个线程将返回0
if (count == std::numeric_limits<uint32_t>::max()) // if 2 threads execute this
throw std::runtime_error("count overflow");
uint32_t my_val = ++count; // before either gets here - possible overflow
Run Code Online (Sandbox Code Playgroud)
因此我想我需要使用一个CAS操作来确保当我增加计数器时,我确实防止了可能的溢出.
所以我的问题是:
max两次)?我的代码(带有工作范例)如下:
#include <iostream>
#include <atomic>
#include <limits>
#include <stdexcept>
#include <thread>
std::atomic<uint16_t> count;
uint16_t get_val() // called by multiple threads
{
uint16_t my_val;
do
{
my_val = count;
// make sure I get the next value
if (count.compare_exchange_strong(my_val, my_val + 1))
{
// if I got the next value, make sure we don't overflow
if (my_val == std::numeric_limits<uint16_t>::max())
{
count = std::numeric_limits<uint16_t>::max() - 1;
throw std::runtime_error("count overflow");
}
break;
}
// if I didn't then check if there are still numbers available
if (my_val == std::numeric_limits<uint16_t>::max())
{
count = std::numeric_limits<uint16_t>::max() - 1;
throw std::runtime_error("count overflow");
}
// there are still numbers available, so try again
}
while (1);
return my_val + 1;
}
void run()
try
{
while (1)
{
if (get_val() == 0)
exit(1);
}
}
catch(const std::runtime_error& e)
{
// overflow
}
int main()
{
while (1)
{
count = 1;
std::thread a(run);
std::thread b(run);
std::thread c(run);
std::thread d(run);
a.join();
b.join();
c.join();
d.join();
std::cout << ".";
}
return 0;
}
Run Code Online (Sandbox Code Playgroud)
是的,你需要使用CAS操作.
std::atomic<uint16_t> g_count;
uint16_t get_next() {
uint16_t new_val = 0;
do {
uint16_t cur_val = g_count; // 1
if (cur_val == std::numeric_limits<uint16_t>::max()) { // 2
throw std::runtime_error("count overflow");
}
new_val = cur_val + 1; // 3
} while(!std::atomic_compare_exchange_weak(&g_count, &cur_val, new_val)); // 4
return new_val;
}
Run Code Online (Sandbox Code Playgroud)
这个想法如下:一旦g_count == std::numeric_limits<uint16_t>::max(),get_next()函数将始终抛出异常.
脚步:
| 归档时间: |
|
| 查看次数: |
1380 次 |
| 最近记录: |