【Java并发】原子类源码分析之AtomicLong

2024-08-30 10:32

本文主要是介绍【Java并发】原子类源码分析之AtomicLong,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!

JDK1.8

// 大部分和AtomicInteger没有太多差别,只标记不同的地方
public class AtomicLong extends Number implements java.io.Serializable {private static final long serialVersionUID = 1927816293512124184L;// setup to use Unsafe.compareAndSwapLong for updates// 通过unsafe来进行更新赋值private static final Unsafe unsafe = Unsafe.getUnsafe();private static final long valueOffset;/*** Records whether the underlying JVM supports lockless* compareAndSwap for longs. While the Unsafe.compareAndSwapLong* method works in either case, some constructions should be* handled at Java level to avoid locking user-visible locks.*/// 这里VM_SUPPORTS_LONG_CAS是一个静态变量,加载时调用VMSupportsCS8方法// VMSupportsCS8判断当前的JVM是否支持无锁的CAS,只调用一次并缓存下来static final boolean VM_SUPPORTS_LONG_CAS = VMSupportsCS8();/*** Returns whether underlying JVM supports lockless CompareAndSet* for longs. Called only once and cached in VM_SUPPORTS_LONG_CAS.*/private static native boolean VMSupportsCS8();static {try {valueOffset = unsafe.objectFieldOffset(AtomicLong.class.getDeclaredField("value"));} catch (Exception ex) { throw new Error(ex); }}private volatile long value;/*** Creates a new AtomicLong with the given initial value.** @param initialValue the initial value*/public AtomicLong(long initialValue) {value = initialValue;}/*** Creates a new AtomicLong with initial value {@code 0}.*/public AtomicLong() {}/*** Gets the current value.** @return the current value*/public final long get() {return value;}/*** Sets to the given value.** @param newValue the new value*/public final void set(long newValue) {value = newValue;}/*** Eventually sets to the given value.** @param newValue the new value* @since 1.6*/public final void lazySet(long newValue) {unsafe.putOrderedLong(this, valueOffset, newValue);}/*** Atomically sets to the given value and returns the old value.** @param newValue the new value* @return the previous value*/public final long getAndSet(long newValue) {return unsafe.getAndSetLong(this, valueOffset, newValue);}/*** Atomically sets the value to the given updated value* if the current value {@code ==} the expected value.** @param expect the expected value* @param update the new value* @return {@code true} if successful. False return indicates that* the actual value was not equal to the expected value.*/public final boolean compareAndSet(long expect, long update) {return unsafe.compareAndSwapLong(this, valueOffset, expect, update);}/*** Atomically sets the value to the given updated value* if the current value {@code ==} the expected value.** <p><a href="package-summary.html#weakCompareAndSet">May fail* spuriously and does not provide ordering guarantees</a>, so is* only rarely an appropriate alternative to {@code compareAndSet}.** @param expect the expected value* @param update the new value* @return {@code true} if successful*/public final boolean weakCompareAndSet(long expect, long update) {return unsafe.compareAndSwapLong(this, valueOffset, expect, update);}/*** Atomically increments by one the current value.** @return the previous value*/public final long getAndIncrement() {return unsafe.getAndAddLong(this, valueOffset, 1L);}/*** Atomically decrements by one the current value.** @return the previous value*/public final long getAndDecrement() {return unsafe.getAndAddLong(this, valueOffset, -1L);}/*** Atomically adds the given value to the current value.** @param delta the value to add* @return the previous value*/public final long getAndAdd(long delta) {return unsafe.getAndAddLong(this, valueOffset, delta);}/*** Atomically increments by one the current value.** @return the updated value*/public final long incrementAndGet() {return unsafe.getAndAddLong(this, valueOffset, 1L) + 1L;}/*** Atomically decrements by one the current value.** @return the updated value*/public final long decrementAndGet() {return unsafe.getAndAddLong(this, valueOffset, -1L) - 1L;}/*** Atomically adds the given value to the current value.** @param delta the value to add* @return the updated value*/public final long addAndGet(long delta) {return unsafe.getAndAddLong(this, valueOffset, delta) + delta;}/*** Atomically updates the current value with the results of* applying the given function, returning the previous value. The* function should be side-effect-free, since it may be re-applied* when attempted updates fail due to contention among threads.** @param updateFunction a side-effect-free function* @return the previous value* @since 1.8*/public final long getAndUpdate(LongUnaryOperator updateFunction) {long prev, next;do {prev = get();next = updateFunction.applyAsLong(prev);} while (!compareAndSet(prev, next));return prev;}/*** Atomically updates the current value with the results of* applying the given function, returning the updated value. The* function should be side-effect-free, since it may be re-applied* when attempted updates fail due to contention among threads.** @param updateFunction a side-effect-free function* @return the updated value* @since 1.8*/public final long updateAndGet(LongUnaryOperator updateFunction) {long prev, next;do {prev = get();next = updateFunction.applyAsLong(prev);} while (!compareAndSet(prev, next));return next;}/*** Atomically updates the current value with the results of* applying the given function to the current and given values,* returning the previous value. The function should be* side-effect-free, since it may be re-applied when attempted* updates fail due to contention among threads.  The function* is applied with the current value as its first argument,* and the given update as the second argument.** @param x the update value* @param accumulatorFunction a side-effect-free function of two arguments* @return the previous value* @since 1.8*/public final long getAndAccumulate(long x,LongBinaryOperator accumulatorFunction) {long prev, next;do {prev = get();next = accumulatorFunction.applyAsLong(prev, x);} while (!compareAndSet(prev, next));return prev;}/*** Atomically updates the current value with the results of* applying the given function to the current and given values,* returning the updated value. The function should be* side-effect-free, since it may be re-applied when attempted* updates fail due to contention among threads.  The function* is applied with the current value as its first argument,* and the given update as the second argument.** @param x the update value* @param accumulatorFunction a side-effect-free function of two arguments* @return the updated value* @since 1.8*/public final long accumulateAndGet(long x,LongBinaryOperator accumulatorFunction) {long prev, next;do {prev = get();next = accumulatorFunction.applyAsLong(prev, x);} while (!compareAndSet(prev, next));return next;}/*** Returns the String representation of the current value.* @return the String representation of the current value*/public String toString() {return Long.toString(get());}/*** Returns the value of this {@code AtomicLong} as an {@code int}* after a narrowing primitive conversion.* @jls 5.1.3 Narrowing Primitive Conversions*/public int intValue() {return (int)get();}/*** Returns the value of this {@code AtomicLong} as a {@code long}.*/public long longValue() {return get();}/*** Returns the value of this {@code AtomicLong} as a {@code float}* after a widening primitive conversion.* @jls 5.1.2 Widening Primitive Conversions*/public float floatValue() {return (float)get();}/*** Returns the value of this {@code AtomicLong} as a {@code double}* after a widening primitive conversion.* @jls 5.1.2 Widening Primitive Conversions*/public double doubleValue() {return (double)get();}}

 

这篇关于【Java并发】原子类源码分析之AtomicLong的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!



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

相关文章

一篇文章彻底搞懂macOS如何决定java环境

《一篇文章彻底搞懂macOS如何决定java环境》MacOS作为一个功能强大的操作系统,为开发者提供了丰富的开发工具和框架,下面:本文主要介绍macOS如何决定java环境的相关资料,文中通过代码... 目录方法一:使用 which命令方法二:使用 Java_home工具(Apple 官方推荐)那问题来了,

Java HashMap的底层实现原理深度解析

《JavaHashMap的底层实现原理深度解析》HashMap基于数组+链表+红黑树结构,通过哈希算法和扩容机制优化性能,负载因子与树化阈值平衡效率,是Java开发必备的高效数据结构,本文给大家介绍... 目录一、概述:HashMap的宏观结构二、核心数据结构解析1. 数组(桶数组)2. 链表节点(Node

Java AOP面向切面编程的概念和实现方式

《JavaAOP面向切面编程的概念和实现方式》AOP是面向切面编程,通过动态代理将横切关注点(如日志、事务)与核心业务逻辑分离,提升代码复用性和可维护性,本文给大家介绍JavaAOP面向切面编程的概... 目录一、AOP 是什么?二、AOP 的核心概念与实现方式核心概念实现方式三、Spring AOP 的关

详解SpringBoot+Ehcache使用示例

《详解SpringBoot+Ehcache使用示例》本文介绍了SpringBoot中配置Ehcache、自定义get/set方式,并实际使用缓存的过程,文中通过示例代码介绍的非常详细,对大家的学习或者... 目录摘要概念内存与磁盘持久化存储:配置灵活性:编码示例引入依赖:配置ehcache.XML文件:配置

Java 虚拟线程的创建与使用深度解析

《Java虚拟线程的创建与使用深度解析》虚拟线程是Java19中以预览特性形式引入,Java21起正式发布的轻量级线程,本文给大家介绍Java虚拟线程的创建与使用,感兴趣的朋友一起看看吧... 目录一、虚拟线程简介1.1 什么是虚拟线程?1.2 为什么需要虚拟线程?二、虚拟线程与平台线程对比代码对比示例:三

Nginx分布式部署流程分析

《Nginx分布式部署流程分析》文章介绍Nginx在分布式部署中的反向代理和负载均衡作用,用于分发请求、减轻服务器压力及解决session共享问题,涵盖配置方法、策略及Java项目应用,并提及分布式事... 目录分布式部署NginxJava中的代理代理分为正向代理和反向代理正向代理反向代理Nginx应用场景

Java中的.close()举例详解

《Java中的.close()举例详解》.close()方法只适用于通过window.open()打开的弹出窗口,对于浏览器的主窗口,如果没有得到用户允许是不能关闭的,:本文主要介绍Java中的.... 目录当你遇到以下三种情况时,一定要记得使用 .close():用法作用举例如何判断代码中的 input

Redis中的有序集合zset从使用到原理分析

《Redis中的有序集合zset从使用到原理分析》Redis有序集合(zset)是字符串与分值的有序映射,通过跳跃表和哈希表结合实现高效有序性管理,适用于排行榜、延迟队列等场景,其时间复杂度低,内存占... 目录开篇:排行榜背后的秘密一、zset的基本使用1.1 常用命令1.2 Java客户端示例二、zse

Redis中的AOF原理及分析

《Redis中的AOF原理及分析》Redis的AOF通过记录所有写操作命令实现持久化,支持always/everysec/no三种同步策略,重写机制优化文件体积,与RDB结合可平衡数据安全与恢复效率... 目录开篇:从日记本到AOF一、AOF的基本执行流程1. 命令执行与记录2. AOF重写机制二、AOF的

Spring Gateway动态路由实现方案

《SpringGateway动态路由实现方案》本文主要介绍了SpringGateway动态路由实现方案,文中通过示例代码介绍的非常详细,对大家的学习或者工作具有一定的参考学习价值,需要的朋友们下面随... 目录前沿何为路由RouteDefinitionRouteLocator工作流程动态路由实现尾巴前沿S