C++ SpinLock、RecursiveSpinLock 基于原子CAS实现自旋锁(TASLock、TTASLock)

本文主要是介绍C++ SpinLock、RecursiveSpinLock 基于原子CAS实现自旋锁(TASLock、TTASLock),希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!

本文使用内存屏障来 VolatileRead、VolatileWrite 保证读写重入自旋锁的当前线程ID(tid),如果不愿意采用内存屏障的方式来处理,人们可以选择使用原子变量读写来代替。

C++ 置R/W内存屏障:

            static inline void							MemoryBarrier() noexcept{std::atomic_thread_fence(std::memory_order_seq_cst);}

头文件:

#pragma once#include <ppp/stdafx.h>namespace ppp
{namespace threading{class SpinLock final{public:explicit SpinLock() noexcept;SpinLock(const SpinLock&) = delete;SpinLock(SpinLock&&) = delete;~SpinLock() noexcept(false);public:SpinLock&                   operator=(const SpinLock&) = delete;public:bool                        TryEnter() noexcept;bool                        TryEnter(int loop, int timeout) noexcept;void                        Enter() noexcept;void                        Leave();inline bool                 IsLockTaken() noexcept { return _.load(); }public:inline void                 lock() noexcept { Enter(); }inline void                 unlock() noexcept { Leave(); }public:std::atomic<bool>           _;};class RecursiveSpinLock final{public:explicit RecursiveSpinLock() noexcept;RecursiveSpinLock(const RecursiveSpinLock&) = delete;RecursiveSpinLock(RecursiveSpinLock&&) = delete;~RecursiveSpinLock() = default;public:RecursiveSpinLock&          operator=(const RecursiveSpinLock&) = delete;public:bool                        TryEnter() noexcept;bool                        TryEnter(int loop, int timeout) noexcept;void                        Enter() noexcept;void                        Leave();inline bool                 IsLockTaken() noexcept { return lockobj_.IsLockTaken(); }public:inline void                 lock() noexcept { Enter(); }inline void                 unlock() noexcept { Leave(); }public:SpinLock                    lockobj_;volatile int                tid_;std::atomic<int>            reentries_;};}
}

源文件:

#include <ppp/threading/SpinLock.h>
#include <ppp/threading/Thread.h>namespace ppp
{namespace threading{template <class LockObject>static constexpr bool Lock_TryEnter(LockObject&                                             lock, int                                                     loop,int                                                     timeout) noexcept{bool lockTaken = false;if (loop > -1){uint64_t last = GetTickCount();for (int i = 0; i < loop; i++){lockTaken = lock.TryEnter();if (lockTaken){break;}if (timeout > -1){uint64_t now = GetTickCount();int64_t diff = now - last;if (diff >= timeout){break;}}}}else{uint64_t last = GetTickCount();for (;;){lockTaken = lock.TryEnter();if (lockTaken){break;}if (timeout > -1){uint64_t now = GetTickCount();int64_t diff = now - last;if (diff >= timeout){break;}}}}return lockTaken;}template <class LockObject, class LockInternalObject, typename... TryEnterArguments>static constexpr bool RecursiveLock_TryEnter(LockObject&    lock, LockInternalObject&                                     lock_internal, volatile int*                                           tid,std::atomic<int>&                                       reentries, TryEnterArguments&&...                                  arguments){int n = ++reentries;assert(n > 0);int current_tid = std::hash<std::thread::id>{}(std::this_thread::get_id());if (n == 1){bool lockTaken = lock_internal.TryEnter(std::forward<TryEnterArguments>(arguments)...);if (!lockTaken){reentries--;return false;}Thread::MemoryBarrier();*tid = current_tid;Thread::MemoryBarrier();}else{Thread::MemoryBarrier();int lockTaken_tid = *tid;Thread::MemoryBarrier();if (lockTaken_tid == current_tid){lock.Leave();return false;}}return true;}SpinLock::SpinLock() noexcept: _(false){}SpinLock::~SpinLock() noexcept(false){bool lockTaken = IsLockTaken();if (lockTaken){throw std::runtime_error("fail to release the atomic lock.");}}void SpinLock::Enter() noexcept{for (;;) {bool lockTaken = TryEnter();if (lockTaken){break;}}}bool SpinLock::TryEnter(int loop, int timeout) noexcept{return Lock_TryEnter(*this, loop, timeout);}bool SpinLock::TryEnter() noexcept{bool expected = false;return _.compare_exchange_strong(expected, true, std::memory_order_acquire);}void SpinLock::Leave(){bool expected = true;if (!_.compare_exchange_strong(expected, false, std::memory_order_release)){throw std::runtime_error("failed to acquire the atomic lock.");}}RecursiveSpinLock::RecursiveSpinLock() noexcept: lockobj_(), tid_(0), reentries_(0){}bool RecursiveSpinLock::TryEnter() noexcept{return RecursiveLock_TryEnter(*this, lockobj_, &tid_, reentries_);}bool RecursiveSpinLock::TryEnter(int loop, int timeout) noexcept{return RecursiveLock_TryEnter(*this, lockobj_, &tid_, reentries_, loop, timeout);}void RecursiveSpinLock::Enter() noexcept{for (;;){bool lockTaken = TryEnter();if (lockTaken){break;}}}void RecursiveSpinLock::Leave() {int n = --reentries_;assert(n >= 0);if (n == 0){lockobj_.Leave();}}}
}

这篇关于C++ SpinLock、RecursiveSpinLock 基于原子CAS实现自旋锁(TASLock、TTASLock)的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!



http://www.chinasem.cn/article/332452

相关文章

C++变换迭代器使用方法小结

《C++变换迭代器使用方法小结》本文主要介绍了C++变换迭代器使用方法小结,文中通过示例代码介绍的非常详细,对大家的学习或者工作具有一定的参考学习价值,需要的朋友们下面随着小编来一起学习学习吧... 目录1、源码2、代码解析代码解析:transform_iterator1. transform_iterat

基于SpringBoot+Mybatis实现Mysql分表

《基于SpringBoot+Mybatis实现Mysql分表》这篇文章主要为大家详细介绍了基于SpringBoot+Mybatis实现Mysql分表的相关知识,文中的示例代码讲解详细,感兴趣的小伙伴可... 目录基本思路定义注解创建ThreadLocal创建拦截器业务处理基本思路1.根据创建时间字段按年进

详解C++中类的大小决定因数

《详解C++中类的大小决定因数》类的大小受多个因素影响,主要包括成员变量、对齐方式、继承关系、虚函数表等,下面就来介绍一下,具有一定的参考价值,感兴趣的可以了解一下... 目录1. 非静态数据成员示例:2. 数据对齐(Padding)示例:3. 虚函数(vtable 指针)示例:4. 继承普通继承虚继承5.

C++中std::distance使用方法示例

《C++中std::distance使用方法示例》std::distance是C++标准库中的一个函数,用于计算两个迭代器之间的距离,本文主要介绍了C++中std::distance使用方法示例,具... 目录语法使用方式解释示例输出:其他说明:总结std::distance&n编程bsp;是 C++ 标准

SpringBoot3实现Gzip压缩优化的技术指南

《SpringBoot3实现Gzip压缩优化的技术指南》随着Web应用的用户量和数据量增加,网络带宽和页面加载速度逐渐成为瓶颈,为了减少数据传输量,提高用户体验,我们可以使用Gzip压缩HTTP响应,... 目录1、简述2、配置2.1 添加依赖2.2 配置 Gzip 压缩3、服务端应用4、前端应用4.1 N

SpringBoot实现数据库读写分离的3种方法小结

《SpringBoot实现数据库读写分离的3种方法小结》为了提高系统的读写性能和可用性,读写分离是一种经典的数据库架构模式,在SpringBoot应用中,有多种方式可以实现数据库读写分离,本文将介绍三... 目录一、数据库读写分离概述二、方案一:基于AbstractRoutingDataSource实现动态

Python FastAPI+Celery+RabbitMQ实现分布式图片水印处理系统

《PythonFastAPI+Celery+RabbitMQ实现分布式图片水印处理系统》这篇文章主要为大家详细介绍了PythonFastAPI如何结合Celery以及RabbitMQ实现简单的分布式... 实现思路FastAPI 服务器Celery 任务队列RabbitMQ 作为消息代理定时任务处理完整

Java枚举类实现Key-Value映射的多种实现方式

《Java枚举类实现Key-Value映射的多种实现方式》在Java开发中,枚举(Enum)是一种特殊的类,本文将详细介绍Java枚举类实现key-value映射的多种方式,有需要的小伙伴可以根据需要... 目录前言一、基础实现方式1.1 为枚举添加属性和构造方法二、http://www.cppcns.co

使用Python实现快速搭建本地HTTP服务器

《使用Python实现快速搭建本地HTTP服务器》:本文主要介绍如何使用Python快速搭建本地HTTP服务器,轻松实现一键HTTP文件共享,同时结合二维码技术,让访问更简单,感兴趣的小伙伴可以了... 目录1. 概述2. 快速搭建 HTTP 文件共享服务2.1 核心思路2.2 代码实现2.3 代码解读3.

MySQL双主搭建+keepalived高可用的实现

《MySQL双主搭建+keepalived高可用的实现》本文主要介绍了MySQL双主搭建+keepalived高可用的实现,文中通过示例代码介绍的非常详细,对大家的学习或者工作具有一定的参考学习价值,... 目录一、测试环境准备二、主从搭建1.创建复制用户2.创建复制关系3.开启复制,确认复制是否成功4.同