ReentrantLock原理4-公平锁原理

最新推荐文章于 2023-06-11 16:31:46 发布

_衍

最新推荐文章于 2023-06-11 16:31:46 发布

阅读量73

点赞数

文章标签： java jvm 数据结构

本文链接：https://blog.csdn.net/m0_60181979/article/details/126375984

版权

非公平锁tryAcquire直接时将state状态从0改为1

        final boolean nonfairTryAcquire(int acquires) {
            final Thread current = Thread.currentThread();
            int c = getState();
            if (c == 0) {
                if (compareAndSetState(0, acquires)) {
                    setExclusiveOwnerThread(current);
                    return true;
                }
            }
            else if (current == getExclusiveOwnerThread()) {
                int nextc = c + acquires;
                if (nextc < 0) // overflow
                    throw new Error("Maximum lock count exceeded");
                setState(nextc);
                return true;
            }
            return false;
        }

公平锁会在执行CAS之前，先**!hasQueuedPredecessors() **检查AQS队列中是否有前驱节点，没有才去竞争

        protected final boolean tryAcquire(int acquires) {
            final Thread current = Thread.currentThread();
            int c = getState();
            if (c == 0) {
                if (!hasQueuedPredecessors() &&
                    compareAndSetState(0, acquires)) {
                    setExclusiveOwnerThread(current);
                    return true;
                }
            }
            else if (current == getExclusiveOwnerThread()) {
                int nextc = c + acquires;
                if (nextc < 0)
                    throw new Error("Maximum lock count exceeded");
                setState(nextc);
                return true;
            }
            return false;
        }