Java多线程框架源码阅读之---ReentrantLock
2024-10-21 09:46:11
ReentrantLock基于Sync内部类来完成锁。Sync有两个不同的子类NonfairSync和FairSync。Sync继承于AbstractQueuedSynchronizer。
ReentrantLock的大部分方法都是基于AbstractQueuedSynchronizer实现，大部分仅仅是对AbstractQueuedSynchronizer的转发。因此，了解AbstractQueuedSynchronizer就非常重要。
作为AbstractQueuedSynchronizer的实现者需要实现isHeldExclusively，tryAcquire，tryRelease,(可选tryAcquireShared,tryReleaseShared)
那么我们看看对于一个常用的套路，ReentrantLock是如何实现同步的
for(int j=0;j<10000000;j++){
lock.lock();
try{
i++;
}finally {
lock.unlock();
}
}lock.lock()内部实现为
public void lock() {
sync.lock();
}我们先看一下Sync和NonfairSync的实现。
abstract static class Sync extends AbstractQueuedSynchronizer {
private static final long serialVersionUID = -5179523762034025860L;
/**
* Performs {@link Lock#lock}. The main reason for subclassing
* is to allow fast path for nonfair version.
*/
abstract void lock();
/**
* Performs non-fair tryLock. tryAcquire is implemented in
* subclasses, but both need nonfair try for trylock method.
*/
final boolean nonfairTryAcquire(int acquires) {
final Thread current = Thread.currentThread();
int c = getState();
//如果没有锁上，则设置为锁上并设置自己为独占线程
if (c == 0) {
if (compareAndSetState(0, acquires)) {
setExclusiveOwnerThread(current);
return true;
}
}
//如果锁上了，而且独占线程是自己，那么重新设置state+1，并且返回true
else if (current == getExclusiveOwnerThread()) {
int nextc = c + acquires;
if (nextc < 0) // overflow
throw new Error("Maximum lock count exceeded");
setState(nextc);
return true;
}
//否则返回false
return false;
}
protected final boolean tryRelease(int releases) {
int c = getState() - releases;
if (Thread.currentThread() != www.97yingyuan.org getExclusiveOwnerThread())
throw new IllegalMonitorStateException();
boolean free = false;
if (c == 0) {
free = true;
setExclusiveOwnerThread(null);
}
setState(c);
return free;
}
protected final boolean isHeldExclusively() {
// While we must in general read state before owner,
// we don't need to do so to check if current thread is owner
return getExclusiveOwnerThread() == Thread.currentThread();
}
final ConditionObject newCondition() {
return new ConditionObject();
}
// Methods relayed from outer class
final Thread getOwner() {
return getState() == 0 ? null : getExclusiveOwnerThread();
}
final int getHoldCount() {
return isHeldExclusively() ? getState() : 0;
}
final boolean isLocked() {
return getState() != 0;
}
/**
* Reconstitutes the instance from a stream (that is, deserializes it).
*/
private void readObject(java.io.ObjectInputStream s)
throws java.io.IOException, ClassNotFoundException {
s.defaultReadObject();
setState(0); // reset to unlocked state
}
}static final class NonfairSync extends Sync {
private static final long serialVersionUID = 7316153563782823691L;
/**
* Performs lock. Try immediate barge, backing up to normal
* acquire on failure.
*/
final void lock() {
//如果没有人锁上，那么就设置我自己为独占线程，否则再acquire一次
if (compareAndSetState(0, 1))
setExclusiveOwnerThread(Thread.currentThread());
else
//调用到了AQS的acquire里面
acquire(1);
}
protected final boolean tryAcquire(int acquires) {
return nonfairTryAcquire(acquires);
}
}上面的代码中，调用了AQS的acquire。下面看一下AQS的实现
public final void acquire(int arg) {
if (!tryAcquire(arg) &&
acquireQueued(addWaiter(Node.EXCLUSIVE), arg))
selfInterrupt();
}对于非公平的锁，tryAcquire会调用到NonfairSync里面的tryAcquire，而tryAcquire又会调用到Sync的nonfairTryAcquire。
addWaiter方法用于创建一个节点（值为当前线程）并维护一个双向链表。注意head是一个假节点，97影院 阻塞的节点是作为head后面的节点出现的。
private Node addWaiter(Node mode) {
Node node = new Node(Thread.currentThread(), mode);
// Try the fast path of enq; backup to full enq on failure
Node pred = tail;
if (pred != null) {
node.prev = pred;
if (compareAndSetTail(pred, node)) {
pred.next = node;
return node;
}
}
enq(node);
return node;
}
private Node enq(final Node node) {
for (;;) {
Node t = tail;
if (t == null) { // Must initialize
if (compareAndSetHead(new Node()))
tail = head;
} else {
node.prev = t;
if (compareAndSetTail(t, node)) {
t.next = node;
return t;
}
}
}
} final boolean acquireQueued(final Node node, int arg) {
boolean failed = true;
try {
boolean interrupted = false;
for (;;) {
final Node p = node.predecessor();
if (p == head && tryAcquire(arg)) {
setHead(node);
p.next = null; // help GC
failed = false;
return interrupted;
}
if (shouldParkAfterFailedAcquire(p, node) &&
parkAndCheckInterrupt())
interrupted = true;
}
} finally {
if (failed)
cancelAcquire(node);
}
}最新文章
- less 入门1
- 如何使用LiveSuite debian img格式的镜像文件刷入nand
- tachyon 命令行接口
- Spring中Bean的生命中期与InitializingBean和DisposableBean接口
- 使用JDK自带的工具将中文转换为ascii码
- PHP生成短信验证码
- QTP自动化测试培训：描述编程之WebElement
- Android--app性能问题的总结（一）
- 文本超出显示省略号/数字英文字母折行有关css 属性/显示两行，第二行省略号显示css方法
- NOIP2015题解
- HDU3033 I love sneakers!———分组背包
- eclipse配置ant开发环境，一键部署项目
- Lua面向对象之一：简单例子
- Linux系统中连接使用NAS
- ringojs 基于jvm 的javascript 平台试用
- [洛谷P4962]朋也与光玉
- 洛谷——P2009 跑步
- selenium之 chromedriver与chrome版本映射表
- EDM邮件群发十大技巧提升邮件群发效果
- 笔记-Python-cProfile