C++无锁编程：std::atomic原子操作实践

#include 
#include 
#include 
std::atomic counter{0};
void increment() {
for (int i = 0; i < 1000; ++i) {
counter.fetch_add(1, std::memory_order_relaxed);
}
}
int main() {
std::thread t1(increment);
std::thread t2(increment);
t1.join();
t2.join();

std::cout << "Counter: " << counter.load() << "\n";
return 0;
}

std::atomic ready{false};
int data = 0;
// 线程1：生产数据
void producer() {
data = 42;
ready.store(true, std::memory_order_release);
}
// 线程2：消费数据
void consumer() {
while (!ready.load(std::memory_order_acquire)) {
// 自旋等待
}
std::cout << "Data: " << data << "\n";
}

template
class LockFreeStack {
private:
    struct Node {
        T data;
        Node* next;
        Node(T const& d) : data(d), next(nullptr) {}
    };
    std::atomic head{nullptr};
public:
void push(T const& data) {
Node* new_node = new Node(data);
new_node->next = head.load();
while (!head.compare_exchange_weak(new_node->next, new_node)) {
// 如果 head 被其他线程修改，new_node->next 会被更新为当前 head
// 循环继续尝试
}
}
bool pop(T& result) {
    Node* old_head = head.load();
    while (old_head && !head.compare_exchange_weak(old_head, old_head->next)) {
        // 更新 old_head 为当前 head，继续尝试
    }
    if (old_head) {
        result = old_head->data;
        delete old_head;
        return true;
    }
    return false;
}
};