synchronized（三） 锁的膨胀过程（锁的升级过程）深入剖析
警告⚠️：本文耗时很长，先做好心理准备................哈哈哈
本篇我们讲通过大量实例代码及hotspot源码分析偏向锁(批量重偏向、批量撤销)、轻量级锁、重量级锁及锁的膨胀过程（也就是锁的升级过程）
我们先来说一下我们为什么需要锁？
因为在并发情况为了保证线程的安全性，是在一个多线程环境下正确性的概念，也就是保证多线程环境下共享的、可修改的状态的正确性（这里的状态指的是程序里的数据），在java程序中我们可以使用synchronized关键字来对程序进行加锁。
当声明synchronized代码块的时候，编译成的字节码将包含monitorenter指令 和 monitorexit指令。这两种指令均会消耗操作数栈上的一个引用类型的元素（也就是 synchronized 关键字括号里的引用），作为所要加锁解锁的锁对象。
（注意：jdk 1.6以前synchronized 关键字只表示重量级锁，1.6之后区分为偏向锁、轻量级锁、重量级锁。）
所谓锁的升级、降级，就是 JVM 优化 synchronized 运行的机制，当 JVM 检测到不同的竞争状况时，会自动切换到适合的锁实现，这种切换就是锁的升级、降级：
- 当没有竞争出现时，默认会使用偏向锁。JVM 会利用 CAS 操作（compare and swap），在对象头上的 Mark Word 部分设置线程 ID，以表示这个对象偏向于当前线程，所以并不涉及真正的互斥锁。这样做的假设是基于在很多应用场景中，大部分对象生命周期中最多会被一个线程锁定，使用偏向锁可以降低无竞争开销。
- 如果有另外的线程试图锁定某个已经被偏向过的对象，JVM 就需要撤销（revoke）偏向锁，并切换到轻量级锁实现。轻量级锁依赖 CAS 操作 Mark Word 来试图获取锁，如果重试成功，就使用轻量级锁；否则，进一步升级为重量级锁
那么我们来看段synchronized代码分析：
java代码：
public class TestDemo {
}
public class DemoExample1 {
static TestDemo testDemo;
public static void main(String[] args) throws Exception {
testDemo= new TestDemo();
synchronized (testDemo){
System.out.println("lock ing");
testDemo.hashCode();
System.out.println(ClassLayout.parseInstance(testDemo).toPrintable());
}
}
}
运行并分析TestDemo.class文件命令：
javap -c DemoExample1.class
分析结果：
Compiled from "DemoExample1.java"
public class com.boke.DemoExample1 {
static com.boke.TestDemo testDemo; public com.boke.DemoExample1();
Code:
: aload_0
: invokespecial # // Method java/lang/Object."<init>":()V
: return public static void main(java.lang.String[]) throws java.lang.Exception;
Code:
: new # // class com/boke/TestDemo
: dup
: invokespecial # // Method com/boke/TestDemo."<init>":()V
: putstatic # // Field testDemo:Lcom/boke/TestDemo;
: getstatic # // Field testDemo:Lcom/boke/TestDemo;
: dup
: astore_1
: monitorenter
: getstatic # // Field java/lang/System.out:Ljava/io/PrintStream;
: ldc # // String lock ing
: invokevirtual # // Method java/io/PrintStream.println:(Ljava/lang/String;)V
: getstatic # // Field testDemo:Lcom/boke/TestDemo;
: invokevirtual # // Method java/lang/Object.hashCode:()I
: pop
: getstatic # // Field java/lang/System.out:Ljava/io/PrintStream;
: getstatic # // Field testDemo:Lcom/boke/TestDemo;
: invokestatic # // Method org/openjdk/jol/info/ClassLayout.parseInstance:(Ljava/lang/Object;)Lorg/openjdk/jol/info/ClassLayout;
: invokevirtual # // Method org/openjdk/jol/info/ClassLayout.toPrintable:()Ljava/lang/String;
: invokevirtual # // Method java/io/PrintStream.println:(Ljava/lang/String;)V
: aload_1
: monitorexit
: goto
: astore_2
: aload_1
: monitorexit
: aload_2
: athrow
: return
Exception table:
from to target type
any
any
}
通过字节码可以看出包含一个monitorenter指令以及多个monitorexit指令。这是因为jvm需要确保所获得的锁在正常执行路径，以及异常执行路径上都能够被解锁。
我们可以抽象的理解为每个锁对象拥有一个锁计数器和一个指向持有该锁的线程的指针：
- 当执行 monitorenter 时，如果目标锁对象的计数器为 0，那么说明它没有被其他线程所持有。在这个情况下，Java 虚拟机会将该锁对象的持有线程设置为当前线程，并且将其计数器加 1。
- 在目标锁对象的计数器不为 0 的情况下，如果锁对象的持有线程是当前线程，那么 Java 虚拟机可以将其计数器加 1，否则需要等待，直至持有线程释放该锁。当执行 monitorexit 时，Java 虚拟机则需将锁对象的计数器减 1。当计数器减为 0 时，那便代表该锁已经被释放掉了。
- 之所以采用这种计数器的方式，是为了允许同一个线程重复获取同一把锁。举个例子，如果一个 Java 类中拥有多个 synchronized 方法，那么这些方法之间的相互调用，不管是直接的还是间接的，都会涉及对同一把锁的重复加锁操作。因此，我们需要设计这么一个可重入的特性，来避免编程里的隐式约束。
我们来看一个案例：在不加锁的情况多下通过取两次数值然后进行对比，来模拟两次共享状态的操作:
java代码：
public class DemoExample3 {
public int sharedState;
public void nonSafeAction() {
while (sharedState < ) {
int former = sharedState++;
int latter = sharedState;
if (former != latter - ) {
System.out.println("Observed data race, former is " +
former + ", " + "latter is " + latter);
}
}
}
public static void main(String[] args) throws InterruptedException {
final DemoExample3 demoExample3 = new DemoExample3();
Thread thread1 = new Thread() {
@Override
public void run() {
demoExample3.nonSafeAction();
}
};
Thread thread2 = new Thread() {
@Override
public void run() {
demoExample3.nonSafeAction();
}
};
thread1.start();
thread2.start();
thread1.join();
thread2.join();
}
}
在没有加 synchronized 关键字的时候打印出来的结果（截取部分）：
Observed data race, former is , latter is
Observed data race, former is , latter is
Observed data race, former is , latter is
Observed data race, former is , latter is
Observed data race, former is , latter is
Observed data race, former is , latter is
Observed data race, former is , latter is
Observed data race, former is , latter is
Observed data race, former is , latter is
Observed data race, former is , latter is
Observed data race, former is , latter is
Observed data race, former is , latter is
Observed data race, former is , latter is
就会发现，打印出好多与if (former != latter - 1) 条件相符的值，这是错误的，正确的结果应该是一条也没有；
我们在来看一下加上synchronized关键字的代码：
java代码：
public class DemoExample3 {
public int sharedState;
public void nonSafeAction() {
while (sharedState < ) {
synchronized (this) {
int former = sharedState++;
int latter = sharedState;
if (former != latter - ) {
System.out.println("Observed data race, former is " +
former + ", " + "latter is " + latter);
}
}
}
}
public static void main(String[] args) throws InterruptedException {
final DemoExample3 demoExample3 = new DemoExample3();
Thread thread1 = new Thread() {
@Override
public void run() {
demoExample3.nonSafeAction();
}
};
Thread thread2 = new Thread() {
@Override
public void run() {
demoExample3.nonSafeAction();
}
};
thread1.start();
thread2.start();
thread1.join();
thread2.join();
}
}
这次看下加上synchronized关键字的打印出来的结果：
Process finished with exit code
说明将两次赋值过程用synchronized保护起来，使用this作为互斥单元，就可以避免别的线程并发的去修改sharedState；这也就是我刚开说的并发情况下为了保证线程的安全性，我们可以通过加锁来保证。
说完我们为什么需要锁，接下来我们介绍偏向锁、轻量级锁、重量级锁及锁的膨胀过程：
首先我们先从jvm源码中来分析锁的膨胀过程（锁升级的过程）：
在jvm中synchronized的是行为是jvm runntime的一部分，所以我们需要先找到 Runtime 相关的功能实现。通过在代码中查询类似“monitor_enter”或“Monitor Enter”，很直观的就可以定位到：
sharedRuntime.cpp（http://hg.openjdk.java.net/jdk/jdk/file/6659a8f57d78/src/hotspot/share/runtime/sharedRuntime.cpp），它是解释器和编译器运行时的基类：
// Handles the uncommon case in locking, i.e., contention or an inflated lock.
JRT_BLOCK_ENTRY(void, SharedRuntime::complete_monitor_locking_C(oopDesc* _obj, BasicLock* lock, JavaThread* thread))
// Disable ObjectSynchronizer::quick_enter() in default config
// on AARCH64 and ARM until JDK-8153107 is resolved.
if (ARM_ONLY((SyncFlags & ) != &&)
AARCH64_ONLY((SyncFlags & ) != &&)
!SafepointSynchronize::is_synchronizing()) {
// Only try quick_enter() if we're not trying to reach a safepoint
// so that the calling thread reaches the safepoint more quickly.
if (ObjectSynchronizer::quick_enter(_obj, thread, lock)) return;
}
// NO_ASYNC required because an async exception on the state transition destructor
// would leave you with the lock held and it would never be released.
// The normal monitorenter NullPointerException is thrown without acquiring a lock
// and the model is that an exception implies the method failed.
JRT_BLOCK_NO_ASYNC
oop obj(_obj);
if (PrintBiasedLockingStatistics) {
Atomic::inc(BiasedLocking::slow_path_entry_count_addr());
}
Handle h_obj(THREAD, obj);
//在 JVM 启动时，我们可以指定是否开启偏向锁
if (UseBiasedLocking) {
// Retry fast entry if bias is revoked to avoid unnecessary inflation
<strong> //fast_enter 是我们熟悉的完整锁获取路径</strong>
ObjectSynchronizer::fast_enter(h_obj, lock, true, CHECK);
} else {
//slow_enter 则是绕过偏向锁，直接进入轻量级锁获取逻辑
ObjectSynchronizer::slow_enter(h_obj, lock, CHECK);
}
assert(!HAS_PENDING_EXCEPTION, "Should have no exception here");
JRT_BLOCK_END
JRT_END
synchronizer.cpp（https://hg.openjdk.java.net/jdk/jdk/file/896e80158d35/src/hotspot/share/runtime/synchronizer.cpp），JVM 同步相关的各种基础（不仅仅是 synchronized 的逻辑，包括从本地代码，也就是 JNI，触发的 Monitor 动作，全都可以在里面找到例如（jni_enter/jni_exit））：
// -----------------------------------------------------------------------------
// Fast Monitor Enter/Exit
// This the fast monitor enter. The interpreter and compiler use
// some assembly copies of this code. Make sure update those code
// if the following function is changed. The implementation is
// extremely sensitive to race condition. Be careful.
void ObjectSynchronizer::fast_enter(Handle obj, BasicLock* lock,
bool attempt_rebias, TRAPS) {
if (UseBiasedLocking) {
if (!SafepointSynchronize::is_at_safepoint()) {
//biasedLocking定义了偏向锁相关操作，revoke_and_rebias revokeatsafepoint 则定义了当检测到安全点时的处理
BiasedLocking::Condition cond = BiasedLocking::revoke_and_rebias(obj, attempt_rebias, THREAD);
if (cond == BiasedLocking::BIAS_REVOKED_AND_REBIASED) {
return;
}
} else {
assert(!attempt_rebias, "can not rebias toward VM thread");
BiasedLocking::revoke_at_safepoint(obj);
}
assert(!obj->mark()->has_bias_pattern(), "biases should be revoked by now");
}
//如果获取偏向锁失败，则进入 slow_enter，锁升级
slow_enter(obj, lock, THREAD);
} // -----------------------------------------------------------------------------
// Interpreter/Compiler Slow Case
// This routine is used to handle interpreter/compiler slow case
// We don't need to use fast path here, because it must have been
// failed in the interpreter/compiler code.
void ObjectSynchronizer::slow_enter(Handle obj, BasicLock* lock, TRAPS) {
markOop mark = obj->mark();
assert(!mark->has_bias_pattern(), "should not see bias pattern here");
if (mark->is_neutral()) {
// Anticipate successful CAS -- the ST of the displaced mark must
// be visible <= the ST performed by the CAS.
// 将目前的 Mark Word 复制到 Displaced Header 上
lock->set_displaced_header(mark);
// 利用 CAS 设置对象的 Mark Wo
if (mark == obj()->cas_set_mark((markOop) lock, mark)) {
return;
}
// Fall through to inflate() …
// 检查存在竞争
} else if (mark->has_locker() &&
THREAD->is_lock_owned((address)mark->locker())) {
assert(lock != mark->locker(), "must not re-lock the same lock");
assert(lock != (BasicLock*)obj->mark(), "don't relock with same BasicLock”);
// 清除
lock->set_displaced_header(NULL);
return;
}
// The object header will never be displaced to this lock,
// so it does not matter what the value is, except that it
// must be non-zero to avoid looking like a re-entrant lock,
// and must not look locked either.
// 重置 Displaced Header
lock->set_displaced_header(markOopDesc::unused_mark());
//锁膨胀
ObjectSynchronizer::inflate(THREAD,
obj(),
inflate_cause_monitor_enter)->enter(THREAD);
}
// This routine is used to handle interpreter/compiler slow case
// We don't need to use fast path here, because it must have
// failed in the interpreter/compiler code. Simply use the heavy
// weight monitor should be ok, unless someone find otherwise.
void ObjectSynchronizer::slow_exit(oop object, BasicLock* lock, TRAPS) {
fast_exit(object, lock, THREAD);
} //锁膨胀
ObjectMonitor * ATTR ObjectSynchronizer::inflate (Thread * Self, oop object) {
// Inflate mutates the heap ...
// Relaxing assertion for bug 6320749.
assert (Universe::verify_in_progress() ||
!SafepointSynchronize::is_at_safepoint(), "invariant") ; for (;;) {//自旋
const markOop mark = object->mark() ;
assert (!mark->has_bias_pattern(), "invariant") ; // The mark can be in one of the following states:
// * Inflated - just return
// * Stack-locked - coerce it to inflated
// * INFLATING - busy wait for conversion to complete
// * Neutral - aggressively inflate the object.
// * BIASED - Illegal. We should never see this // CASE: inflated已膨胀，即重量级锁
if (mark->has_monitor()) {//判断当前是否为重量级锁
ObjectMonitor * inf = mark->monitor() ;//获取指向ObjectMonitor的指针
assert (inf->header()->is_neutral(), "invariant");
assert (inf->object() == object, "invariant") ;
assert (ObjectSynchronizer::verify_objmon_isinpool(inf), "monitor is invalid");
return inf ;
} // CASE: inflation in progress - inflating over a stack-lock.膨胀等待（其他线程正在从轻量级锁转为膨胀锁）
// Some other thread is converting from stack-locked to inflated.
// Only that thread can complete inflation -- other threads must wait.
// The INFLATING value is transient.
// Currently, we spin/yield/park and poll the markword, waiting for inflation to finish.
// We could always eliminate polling by parking the thread on some auxiliary list.
if (mark == markOopDesc::INFLATING()) {
TEVENT (Inflate: spin while INFLATING) ;
ReadStableMark(object) ;
continue ;
} // CASE: stack-locked栈锁（轻量级锁）
// Could be stack-locked either by this thread or by some other thread.
//
// Note that we allocate the objectmonitor speculatively, _before_ attempting
// to install INFLATING into the mark word. We originally installed INFLATING,
// allocated the objectmonitor, and then finally STed the address of the
// objectmonitor into the mark. This was correct, but artificially lengthened
// the interval in which INFLATED appeared in the mark, thus increasing
// the odds of inflation contention.
//
// We now use per-thread private objectmonitor free lists.
// These list are reprovisioned from the global free list outside the
// critical INFLATING...ST interval. A thread can transfer
// multiple objectmonitors en-mass from the global free list to its local free list.
// This reduces coherency traffic and lock contention on the global free list.
// Using such local free lists, it doesn't matter if the omAlloc() call appears
// before or after the CAS(INFLATING) operation.
// See the comments in omAlloc(). if (mark->has_locker()) {
ObjectMonitor * m = omAlloc (Self) ;//获取一个可用的ObjectMonitor
// Optimistically prepare the objectmonitor - anticipate successful CAS
// We do this before the CAS in order to minimize the length of time
// in which INFLATING appears in the mark.
m->Recycle();
m->_Responsible = NULL ;
m->OwnerIsThread = ;
m->_recursions = ;
m->_SpinDuration = ObjectMonitor::Knob_SpinLimit ; // Consider: maintain by type/class markOop cmp = (markOop) Atomic::cmpxchg_ptr (markOopDesc::INFLATING(), object->mark_addr(), mark) ;
if (cmp != mark) {//CAS失败//CAS失败，说明冲突了，自旋等待//CAS失败，说明冲突了，自旋等待//CAS失败，说明冲突了，自旋等待
omRelease (Self, m, true) ;//释放监视器锁
continue ; // Interference -- just retry
} // We've successfully installed INFLATING (0) into the mark-word.
// This is the only case where 0 will appear in a mark-work.
// Only the singular thread that successfully swings the mark-word
// to 0 can perform (or more precisely, complete) inflation.
//
// Why do we CAS a 0 into the mark-word instead of just CASing the
// mark-word from the stack-locked value directly to the new inflated state?
// Consider what happens when a thread unlocks a stack-locked object.
// It attempts to use CAS to swing the displaced header value from the
// on-stack basiclock back into the object header. Recall also that the
// header value (hashcode, etc) can reside in (a) the object header, or
// (b) a displaced header associated with the stack-lock, or (c) a displaced
// header in an objectMonitor. The inflate() routine must copy the header
// value from the basiclock on the owner's stack to the objectMonitor, all
// the while preserving the hashCode stability invariants. If the owner
// decides to release the lock while the value is 0, the unlock will fail
// and control will eventually pass from slow_exit() to inflate. The owner
// will then spin, waiting for the 0 value to disappear. Put another way,
// the 0 causes the owner to stall if the owner happens to try to
// drop the lock (restoring the header from the basiclock to the object)
// while inflation is in-progress. This protocol avoids races that might
// would otherwise permit hashCode values to change or "flicker" for an object.
// Critically, while object->mark is 0 mark->displaced_mark_helper() is stable.
// 0 serves as a "BUSY" inflate-in-progress indicator
// fetch the displaced mark from the owner's stack.
// The owner can't die or unwind past the lock while our INFLATING
// object is in the mark. Furthermore the owner can't complete
// an unlock on the object, either.
markOop dmw = mark->displaced_mark_helper() ;
assert (dmw->is_neutral(), "invariant") ;
//CAS成功，设置ObjectMonitor的_header、_owner和_object等
// Setup monitor fields to proper values -- prepare the monitor
m->set_header(dmw) ; // Optimization: if the mark->locker stack address is associated
// with this thread we could simply set m->_owner = Self and
// m->OwnerIsThread = 1. Note that a thread can inflate an object
// that it has stack-locked -- as might happen in wait() -- directly
// with CAS. That is, we can avoid the xchg-NULL .... ST idiom.
m->set_owner(mark->locker());
m->set_object(object);
// TODO-FIXME: assert BasicLock->dhw != 0. // Must preserve store ordering. The monitor state must
// be stable at the time of publishing the monitor address.
guarantee (object->mark() == markOopDesc::INFLATING(), "invariant") ;
object->release_set_mark(markOopDesc::encode(m)); // Hopefully the performance counters are allocated on distinct cache lines
// to avoid false sharing on MP systems ...
if (ObjectMonitor::_sync_Inflations != NULL) ObjectMonitor::_sync_Inflations->inc() ;
TEVENT(Inflate: overwrite stacklock) ;
if (TraceMonitorInflation) {
if (object->is_instance()) {
ResourceMark rm;
tty->print_cr("Inflating object " INTPTR_FORMAT " , mark " INTPTR_FORMAT " , type %s",
(void *) object, (intptr_t) object->mark(),
object->klass()->external_name());
}
}
return m ;
} // CASE: neutral 无锁
// TODO-FIXME: for entry we currently inflate and then try to CAS _owner.
// If we know we're inflating for entry it's better to inflate by swinging a
// pre-locked objectMonitor pointer into the object header. A successful
// CAS inflates the object *and* confers ownership to the inflating thread.
// In the current implementation we use a 2-step mechanism where we CAS()
// to inflate and then CAS() again to try to swing _owner from NULL to Self.
// An inflateTry() method that we could call from fast_enter() and slow_enter()
// would be useful. assert (mark->is_neutral(), "invariant");
ObjectMonitor * m = omAlloc (Self) ;
// prepare m for installation - set monitor to initial state
m->Recycle();
m->set_header(mark);
m->set_owner(NULL);
m->set_object(object);
m->OwnerIsThread = ;
m->_recursions = ;
m->_Responsible = NULL ;
m->_SpinDuration = ObjectMonitor::Knob_SpinLimit ; // consider: keep metastats by type/class if (Atomic::cmpxchg_ptr (markOopDesc::encode(m), object->mark_addr(), mark) != mark) {
m->set_object (NULL) ;
m->set_owner (NULL) ;
m->OwnerIsThread = ;
m->Recycle() ;
omRelease (Self, m, true) ;
m = NULL ;
continue ;
// interference - the markword changed - just retry.
// The state-transitions are one-way, so there's no chance of
// live-lock -- "Inflated" is an absorbing state.
} // Hopefully the performance counters are allocated on distinct
// cache lines to avoid false sharing on MP systems ...
if (ObjectMonitor::_sync_Inflations != NULL) ObjectMonitor::_sync_Inflations->inc() ;
TEVENT(Inflate: overwrite neutral) ;
if (TraceMonitorInflation) {
if (object->is_instance()) {
ResourceMark rm;
tty->print_cr("Inflating object " INTPTR_FORMAT " , mark " INTPTR_FORMAT " , type %s",
(void *) object, (intptr_t) object->mark(),
object->klass()->external_name());
}
}
return m ;
}
}
膨胀过程的实现比较复杂，大概实现过程如下：
1、整个膨胀过程在自旋下完成；
2、mark->has_monitor()方法判断当前是否为重量级锁，即Mark Word的锁标识位为 10，如果当前状态为重量级锁，执行步骤（3），否则执行步骤（4）；
3、mark->monitor()方法获取指向ObjectMonitor的指针，并返回，说明膨胀过程已经完成；
4、如果当前锁处于膨胀中，说明该锁正在被其它线程执行膨胀操作，则当前线程就进行自旋等待锁膨胀完成，这里需要注意一点，虽然是自旋操作，但不会一直占用cpu资源，每隔一段时间会通过os::NakedYield方法放弃cpu资源，或通过park方法挂起；如果其他线程完成锁的膨胀操作，则退出自旋并返回；
5、如果当前是轻量级锁状态，即锁标识位为 00，膨胀过程如下：
- 通过omAlloc方法，获取一个可用的ObjectMonitor monitor，并重置monitor数据；
- 通过CAS尝试将Mark Word设置为markOopDesc:INFLATING，标识当前锁正在膨胀中，如果CAS失败，说明同一时刻其它线程已经将Mark Word设置为markOopDesc:INFLATING，当前线程进行自旋等待膨胀完成；
- 如果CAS成功，设置monitor的各个字段：_header、_owner和_object等，并返回；
6、如果是无锁，重置监视器值；
以上就是从jvm源码来分析锁的膨胀过程了。
接下来我们案例入手开始分析偏向锁（批量重偏向、批量撤销）、轻量级锁、重量级锁及膨胀过程：
偏向锁：
- 偏向锁是指一段同步代码一直被一个线程所访问，那么该线程会自动获取锁，降低获取锁的代价。
- 在大多数情况下，锁总是由同一线程多次获得，不存在多线程竞争，所以出现了偏向锁。其目标就是在只有一个线程执行同步代码块时能够提高性能。
- 当一个线程访问同步代码块并获取锁时，会在Mark Word里存储锁偏向的线程ID。在线程进入和退出同步块时不再通过CAS操作来加锁和解锁，而是检测Mark Word里是否存储着指向当前线程的偏向锁。引入偏向锁是为了在无多线程竞争的情况下尽量减少不必要的轻量级锁执行路径，因为轻量级锁的获取及释放依赖多次CAS原子指令，而偏向锁只需要在置换ThreadID的时候依赖一次CAS原子指令即可。
- 偏向锁只有遇到其他线程尝试竞争偏向锁时，持有偏向锁的线程才会释放锁，线程不会主动释放偏向锁。偏向锁的撤销，需要等待全局安全点（在这个时间点上没有字节码正在执行），它会首先暂停拥有偏向锁的线程，判断锁对象是否处于被锁定状态。撤销偏向锁后恢复到无锁（标志位为“01”）或轻量级锁（标志位为“00”）的状态。
- 偏向锁在JDK 6及以后的JVM里是默认启用的。可以通过JVM参数关闭偏向锁：-XX:-UseBiasedLocking=false，关闭之后程序默认会进入轻量级锁状态。
在上篇【java并发笔记三之synchronized 偏向锁 轻量级锁 重量级锁证明】说过偏向锁在没有禁止延迟的时候还没加锁之前就已经是偏向锁了，但是加锁完之后，退出同步代码块 还是偏向锁；计算过hashcode之后就不能被偏向。
一、我们来看段代码证明下，在没有计算hashcode的情况下：
//创建一个啥都没有的类：
public class TestDemo {} public class DemoExample {
static TestDemo testDemo;
public static void main(String[] args) throws Exception {
//此处睡眠50000ms，取消jvm默认偏向锁延迟4000ms
Thread.sleep();
testDemo= new TestDemo(); //hash计算？
//testDemo.hashCode(); System.out.println("befor lock");
//无锁：偏向锁？
System.out.println(ClassLayout.parseInstance(testDemo).toPrintable()); synchronized (testDemo){
System.out.println("lock ing");
System.out.println(ClassLayout.parseInstance(testDemo).toPrintable());
} System.out.println("after lock");
System.out.println(ClassLayout.parseInstance(testDemo).toPrintable());
}
}
运行结果：
befor lock
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total lock ing
com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ac ( ) (-)
(object header) 8d 7f ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total after lock
com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ac ( ) (-)
(object header) 8d 7f ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total
分析结果：
befor lock：绿颜色表示：虽然是偏向锁，但是黄颜色表示没有任何线程持有锁（一个对象被初始化的时候是可偏向的）
lock ing： 绿颜色表示偏向锁，黄颜色的表示当前线程拿到锁
after lock：绿颜色表示偏向锁，黄颜色的表示当前线程拿到锁，还是偏向的状态；（偏向锁退出锁后依然是偏向状态）
jvm在初始化一个对象的时候，如果没有启用偏向锁延迟，就会去判断这个对象是否可以被偏向，如果可以就是偏向锁；退出同步代码块 还是偏向锁。
二、在对象进行hashcode计算之后就会输出下面的结果（也就是代码的这块testDemo.hashCode()去掉注释，进行hashcode运算）：
befor lock
com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total lock ing
com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) f8 4b 0c ( ) ()
(object header) ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total after lock
com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ac ( ) (-)
(object header) 8d 7f ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total
结果显示并不是偏向锁了，说明对象在计算过hashcode之后就不能被偏向；
- 具体来说，在线程进行加锁时，如果该锁对象支持偏向锁，那么 Java 虚拟机会通过 CAS操作，将当前线程的地址记录在锁对象的标记字段之中，并且将标记字段的最后三位设置为：1 01；
- 在接下来的运行过程中，每当有线程请求这把锁，Java 虚拟机只需判断锁对象标记字段中：最后三位是否为： 1 01，是否包含当前线程的地址，以及 epoch 值是否和锁对象的类的epoch 值相同。如果都满足，那么当前线程持有该偏向锁，可以直接返回；
这里的 epoch 值是一个什么概念呢？
- 我们先从偏向锁的撤销讲起。当请求加锁的线程和锁对象标记字段保持的线程地址不匹配时（而且 epoch 值相等，如若不等，那么当前线程可以将该锁重偏向至自己），Java 虚拟机需要撤销该偏向锁。这个撤销过程非常麻烦，它要求持有偏向锁的线程到达安全点，再将偏向锁替换成轻量级锁；
- 如果某一类锁对象的总撤销数超过了一个阈值（对应 jvm参数 -XX:BiasedLockingBulkRebiasThreshold，默认为 20），那么 Java 虚拟机会宣布这个类的偏向锁失效；（这里说的就是批量重偏向）
JVM源码：
product(intx, BiasedLockingBulkRebiasThreshold, , \
"Threshold of number of revocations per type to try to " \
"rebias all objects in the heap of that type") \
range(, max_intx) \
constraint(BiasedLockingBulkRebiasThresholdFunc,AfterErgo) \
- 具体的做法便是在每个类中维护一个 epoch 值，你可以理解为第几代偏向锁。当设置偏向锁时，Java 虚拟机需要将该 epoch 值复制到锁对象的标记字段中；
- 在宣布某个类的偏向锁失效时，Java 虚拟机实则将该类的 epoch 值加 1，表示之前那一代的偏向锁已经失效。而新设置的偏向锁则需要复制新的 epoch 值；
- 为了保证当前持有偏向锁并且已加锁的线程不至于因此丢锁，Java 虚拟机需要遍历所有线程的 Java 栈，找出该类已加锁的实例，并且将它们标记字段中的 epoch 值加 1。该操作需要所有线程处于安全点状态；
- 如果总撤销数超过另一个阈值（对应 jvm 参数 -XX:BiasedLockingBulkRevokeThreshold，默认值为 40），那么 Java 虚拟机会认为这个类已经不再适合偏向锁。此时，Java 虚拟机会撤销该类实例的偏向锁，并且在之后的加锁过程中直接为该类实例设置轻量级锁(这里说的就是偏向批量撤销)
JVM源码：
product(intx, BiasedLockingBulkRevokeThreshold, , \
"Threshold of number of revocations per type to permanently " \
"revoke biases of all objects in the heap of that type") \
range(, max_intx) \
constraint(BiasedLockingBulkRevokeThresholdFunc,AfterErgo)
接下来我们分析两个批量重偏向相关案例（禁止偏向锁延迟的情况下：-XX:+UseBiasedLocking -XX:BiasedLockingStartupDelay=0）：
案例一：
java代码：
public class TestDemo {
}
public class DemoExample4 {
public static void main(String[] args) throws InterruptedException {
test1();
}
public class DemoExample5 {
public static void main(String[] args) throws InterruptedException {
test1();
}
/**
* 仅证明批量重偏向
* @throws InterruptedException
*/
public static void test1() throws InterruptedException {
List<TestDemo> list = new ArrayList<>();
for (int i = ; i < ; i++) {
list.add(new TestDemo());
}
Thread t1 = new Thread(()->{
System.out.println("加锁前 get(0) 应该是无锁可偏向 "+ ClassLayout.parseInstance(list.get()).toPrintable());
for (TestDemo a:list ) {
synchronized (a){
System.out.print("加锁 >");
}
}
System.out.println();
System.out.println("加锁后 get(0) 应该是偏向锁"+ClassLayout.parseInstance(list.get()).toPrintable());
try {
TimeUnit.SECONDS.sleep();//这里不让线程死，防止线程ID复用
} catch (InterruptedException e) {
e.printStackTrace();
}
});
t1.start();
TimeUnit.SECONDS.sleep();
Thread t2 = new Thread(()->{
for (int i = ; i < ; i++) {
TestDemo a = list.get(i);
synchronized (a){
System.out.print("加锁 >");
}
if (i==){
System.out.println();
System.out.println("加锁后 get(18) 应该是无锁（轻量级锁释放） "+ClassLayout.parseInstance(list.get(i)).toPrintable());
}
if (i==){ //开始重偏向
System.out.println();
System.out.println("加锁后 get(19) 应该是偏向锁 "+ClassLayout.parseInstance(list.get(i)).toPrintable());
System.out.println("加锁后 get(0) 应该是无锁（轻量级锁释放） "+ClassLayout.parseInstance(list.get()).toPrintable());
System.out.println("加锁后 get(99) 应该是偏向锁 偏向t1 "+ClassLayout.parseInstance(list.get()).toPrintable());
}
if (i==){
System.out.println();
System.out.println("加锁后 get(20) 应该是偏向锁 "+ClassLayout.parseInstance(list.get(i)).toPrintable());
}
}
});
t2.start();
}
}
运行并分析结果：
com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 > 加锁后 get() 应该是偏向锁com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) 8a ( ) ()
(object header) c4 7f ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >
加锁后 get() 应该是无锁（轻量级锁释放） com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 加锁 >
加锁后 get() 应该是偏向锁 com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) 0b ( ) ()
(object header) c4 7f ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 加锁后 get() 应该是无锁（轻量级锁释放） com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 加锁后 get() 应该是偏向锁 偏向t1 com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) 8a ( ) ()
(object header) c4 7f ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 加锁 >
加锁后 get() 应该是偏向锁 com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) 0b ( ) ()
(object header) c4 7f ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >
案例二：
java代码：
public class TestDemo {
}
public class DemoExample7 {
public static void main(String[] args) throws Exception {
List<TestDemo> list = new ArrayList<>();
//初始化数据
for (int i = ; i < ; i++) {
list.add(new TestDemo());
}
Thread t1 = new Thread() {
String name = "";
public void run() {
System.out.printf(name);
for (TestDemo a : list) {
synchronized (a) {
if (a == list.get()) {
System.out.println("t1 预期是偏向锁" + + ClassLayout.parseInstance(a).toPrintable());
}
}
}
try {
Thread.sleep();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
};
t1.start();
Thread.sleep();
System.out.println("main 预期是偏向锁" + + ClassLayout.parseInstance(list.get()).toPrintable());
Thread t2 = new Thread() {
String name = "";
public void run() {
System.out.printf(name);
for (int i = ; i < ; i++) {
TestDemo a = list.get(i);
// hack 为了在批量重偏向发生后再次加锁,前面使用了轻量级锁的对象
if (i == ) {
a = list.get();
}
synchronized (a) {
if (i == ) {
//已经经过偏向锁撤销，并使用轻量级锁的对象，释放后 状态依为001 无锁状态
System.out.println("t2 i=10 get(1)预期是无锁" + ClassLayout.parseInstance(list.get()).toPrintable());
//因为和t1交替使用对象a 没有发生竞争，但偏向锁已偏向，另外不满足重偏向条件，所以使用轻量级锁
System.out.println("t2 i=10 get(i) 预期轻量级锁 " + i + ClassLayout.parseInstance(a).toPrintable());
}
if (i == ) {
//已经经过偏向锁撤销，并使用轻量级锁的对象，在批量重偏向发生后。不会影响现有的状态 状态依然为001
System.out.println("t2 i=19 get(10)预期是无锁" + + ClassLayout.parseInstance(list.get()).toPrintable());
//满足重偏向条件后，已偏向的对象可以重新使用偏向锁 将线程id指向当前线程，101
System.out.println("t2 i=19 get(i) 满足重偏向条件20 预期偏向锁 " + i + ClassLayout.parseInstance(a).toPrintable());
//满足重偏向条件后，已偏向还为需要加锁的对象依然偏向线程1 因为偏向锁的撤销是发生在下次加锁的时候。这里没有执行到同步此对象，所以依然偏向t1
System.out.println("t2 i=19 get(i) 满足重偏向条件20 但后面的对象没有被加锁，所以依旧偏向t1 " + i + ClassLayout.parseInstance(list.get()).toPrintable());
}
if (i == ) {
//满足重偏向条件后，再次加锁之前使用了轻量级锁的对象，依然轻量级锁，证明重偏向这个状态只针对偏向锁。已经发生锁升级的，不会退回到偏向锁
System.out.println("t2 i=20 满足偏向条件之后，之前被设置为无锁状态的对象，不可偏向，这里使用的是轻量级锁 get(9)预期是轻量级锁 " + ClassLayout.parseInstance(a).toPrintable());
}
}
}
try {
Thread.sleep();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
};
t2.start();
Thread.sleep();
}
}
运行并分析结果：
t1 预期是偏向锁10 com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) af ( ) (-)
(object header) f6 7f ( ) ()
(object header) d6 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total main 预期是偏向锁 com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) af ( ) (-)
(object header) f6 7f ( ) ()
(object header) d6 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 2t2 i= get()预期是无锁 com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) d6 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total t2 i= get(i) 预期轻量级锁 com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) d6 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total t2 i= get()预期是无锁10com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) d6 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total t2 i= get(i) 满足重偏向条件20 预期偏向锁 19com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ae ( ) (-)
(object header) f6 7f ( ) ()
(object header) d6 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total t2 i= get(i) 满足重偏向条件20 但后面的对象没有被加锁，所以依旧偏向t1 19com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) af ( ) (-)
(object header) f6 7f ( ) ()
(object header) d6 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total t2 i= 满足偏向条件之后，之前被设置为无锁状态的对象，不可偏向，这里使用的是轻量级锁 get()预期是轻量级锁 com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) d6 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total
接下来我们分析两个批量偏向撤销的相关案例（禁止偏向锁延迟的情况下：-XX:+UseBiasedLocking -XX:BiasedLockingStartupDelay=0）：
案例一：
public class TestDemo {
}
public class DemoExample6 {
public static void main(String[] args) throws InterruptedException {
test2();
}
/**
* 证明偏量偏向撤销
* @throws InterruptedException
*/
public static void test2() throws InterruptedException {
List<TestDemo> list = new ArrayList<TestDemo>();
for (int i = ; i < ; i++) {
list.add(new TestDemo());
}
Thread t1 = new Thread(()->{
System.out.println("加锁前 get(0) 应该是无锁可偏向 "+ClassLayout.parseInstance(list.get()).toPrintable());
for (TestDemo a:list ) {
synchronized (a){
System.out.print("加锁 >");
}
}
System.out.println();
System.out.println("加锁后 get(0) 应该是偏向锁"+ClassLayout.parseInstance(list.get()).toPrintable());
try {
TimeUnit.SECONDS.sleep();//这里不让线程死，防止线程ID复用
} catch (InterruptedException e) {
e.printStackTrace();
}
});
t1.start();
TimeUnit.SECONDS.sleep();
Thread t2 = new Thread(()->{
for (int i = ; i < ; i++) {
TestDemo a = list.get(i);
synchronized (a){
System.out.println(Thread.currentThread().getId()+"加锁 >");
}
try {
TimeUnit.MILLISECONDS.sleep();
} catch (InterruptedException e) {
e.printStackTrace();
}
if (i==){//这里刚好是第19个上锁的（同样是第19个偏向锁升级的）
System.out.println();
System.out.println("加锁后 get(9) 应该是无锁（轻量级锁释放） "+ClassLayout.parseInstance(list.get(i)).toPrintable());
}
if (i==){//这里刚好是第21个上锁的
System.out.println();
System.out.println("加锁后 get(10) 应该是偏向锁 偏向t2 "+ClassLayout.parseInstance(list.get(i)).toPrintable());
}
if (i==){//50开始升级为轻量级锁（同样是第21个偏向锁升级的）
System.out.println();
System.out.println("加锁后 get(50) 无锁（轻量级锁释放） "+ClassLayout.parseInstance(list.get(i)).toPrintable());
}
if (i==){//60（同样是第39个偏向锁升级的）
System.out.println();
System.out.println("加锁后 get(59) 无锁（轻量级锁释放） "+ClassLayout.parseInstance(list.get(i)).toPrintable());
}
if (i==){//69（同样是第59个偏向锁升级的）
System.out.println();
System.out.println("加锁后 get(69) 无锁（轻量级锁释放） "+ClassLayout.parseInstance(list.get(i)).toPrintable());
TestDemo a1 = new TestDemo();
synchronized (a1){
System.out.println("偏向撤销发生后的该类新建的对象都不会再偏向任何线程 "+ClassLayout.parseInstance(a1).toPrintable());
}
}
}
});
Thread t3 = new Thread(()->{
for (int i = ; i >= ; i--) {
TestDemo a = list.get(i);
synchronized (a){
System.out.println(Thread.currentThread().getId()+"加锁 >");
}
try {
TimeUnit.MILLISECONDS.sleep();
} catch (InterruptedException e) {
e.printStackTrace();
}
/**
* 重点：重偏向撤销
*/
if (i==){//40升级为轻量级锁（同样是第40个偏向锁升级的，这时候发生偏向撤销）
System.out.println();
System.out.println("加锁后 get("+i+") 应该是无锁（轻量级锁释放） "+ClassLayout.parseInstance(list.get()).toPrintable());
TestDemo a1 = new TestDemo();
synchronized (a1){
System.out.println("偏向撤销发生后的该类新建的对象都不会再偏向任何线程 "+ClassLayout.parseInstance(a1).toPrintable());
}
}
if (i==){//39升级为轻量级锁（同样是第42个偏向锁升级的）
System.out.println();
System.out.println("加锁后 get("+i+") 应该是无锁（轻量级锁释放） "+ClassLayout.parseInstance(list.get()).toPrintable());
TestDemo a1 = new TestDemo();
synchronized (a1){
System.out.println("偏向撤销发生后的该类新建的对象都不会再偏向任何线程 "+ClassLayout.parseInstance(a1).toPrintable());
}
}
}
});
t2.start();
TimeUnit.MILLISECONDS.sleep();
t3.start();
}
}
运行结果（截取部分）：
加锁前 get() 应该是无锁可偏向 com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 >加锁 > 加锁后 get() 应该是偏向锁com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) e0 ( ) ()
(object header) b1 7f ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 加锁后 get() 应该是无锁（轻量级锁释放） com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 15加锁 > 加锁后 get() 应该是偏向锁 偏向t3com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) 0c ( ) ()
(object header) b1 7f ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 加锁后 get() 应该是偏向锁 偏向t2 com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) b1 0a ( ) ()
(object header) b1 7f ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 15加锁 > 加锁后 get() 应该是无锁（轻量级锁释放） com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 加锁后 get() 无锁（轻量级锁释放） com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 15加锁 > 加锁后 get() 应该是无锁（轻量级锁释放） com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 加锁后 get() 无锁（轻量级锁释放） com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 15加锁 > 加锁后 get() 应该是无锁（轻量级锁释放） com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 偏向撤销发生后的该类新建的对象都不会再偏向任何线程 com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) a6 ( ) ()
(object header) ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 加锁后 get() 无锁（轻量级锁释放） com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 偏向撤销发生后的该类新建的对象都不会再偏向任何线程 com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) e8 ( ) ()
(object header) ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 15加锁 > 加锁后 get() 应该是无锁（轻量级锁释放） com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 偏向撤销发生后的该类新建的对象都不会再偏向任何线程 com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) a6 ( ) ()
(object header) ( ) ()
(object header) c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total
案例二：
public class TestDemo {
}
public class DemoExample8 {
public static void main(String[] args) throws Exception {
List<TestDemo> list = new ArrayList<>();
List<TestDemo> list2 = new ArrayList<>();
List<TestDemo> list3 = new ArrayList<>();
for (int i = ; i < ; i++) {
list.add(new TestDemo());
list2.add(new TestDemo());
list3.add(new TestDemo());
}
//偏向锁
System.out.println("初始状态" + + ClassLayout.parseClass(TestDemo.class).toPrintable());
Thread t1 = new Thread() {
String name = "";
public void run() {
System.out.printf(name);
for (TestDemo a : list) {
synchronized (a) {
if (a == list.get()) {
//偏向锁
System.out.println("t1 预期是偏向锁" + + ClassLayout.parseInstance(a).toPrintable());
}
}
}
try {
Thread.sleep();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
};
t1.start();
Thread.sleep();
//偏向锁
System.out.println("main 预期是偏向锁" + + ClassLayout.parseInstance(list.get()).toPrintable());
Thread t2 = new Thread() {
String name = "";
public void run() {
System.out.printf(name);
for (int i = ; i < ; i++) {
TestDemo a = list.get(i);
synchronized (a) {
if (a == list.get()) {
System.out.println("t2 i=10 get(1)预期是无锁" + ClassLayout.parseInstance(list.get()).toPrintable());//偏向锁
System.out.println("t2 i=10 get(10) 预期轻量级锁 " + i + ClassLayout.parseInstance(a).toPrintable());//偏向锁
}
if (a == list.get()) {
System.out.println("t2 i=19 get(10)预期是无锁" + + ClassLayout.parseInstance(list.get()).toPrintable());//偏向锁
System.out.println("t2 i=19 get(19) 满足重偏向条件20 预期偏向锁 " + i + ClassLayout.parseInstance(a).toPrintable());//偏向锁
System.out.println("类的对象累计撤销达到20");
}
}
}
try {
Thread.sleep();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
};
t2.start();
Thread.sleep();
Thread t3 = new Thread() {
String name = "";
public void run() {
System.out.printf(name);
for (TestDemo a : list2) {
synchronized (a) {
if (a == list2.get()) {
System.out.println("t3 预期是偏向锁" + + ClassLayout.parseInstance(a).toPrintable());//偏向锁
}
}
}
try {
Thread.sleep();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
};
t3.start();
Thread.sleep();
Thread t4 = new Thread() {
String name = "";
public void run() {
System.out.printf(name);
for (int i = ; i < ; i++) {
TestDemo a = list2.get(i);
synchronized (a) {
if (a == list2.get()) {
System.out.println("t4 i=10 get(1)预期是无锁" + ClassLayout.parseInstance(list2.get()).toPrintable());//偏向锁
System.out.println("t4 i=10 get(10) 当前不满足重偏向条件 20 预期轻量级锁 " + i + ClassLayout.parseInstance(a).toPrintable());//偏向锁
}
if (a == list2.get()) {
System.out.println("t4 i=19 get(10)预期是无锁" + + ClassLayout.parseInstance(list2.get()).toPrintable());//偏向锁
System.out.println("t4 i=19 get(19) 当前满足重偏向条件 20 但A类的对象累计撤销达到40 预期轻量级锁 " + i + ClassLayout.parseInstance(a).toPrintable());//偏向锁
System.out.println("类的对象累计撤销达到40");
}
if (a == list2.get()) {
System.out.println("t4 i=20 get(20) 当前满足重偏向条件 20 预期轻量级锁 " + i + ClassLayout.parseInstance(a).toPrintable());//偏向锁
}
}
}
}
};
t4.start();
Thread.sleep();
System.out.println("main 预期是偏向锁" + + ClassLayout.parseInstance(list3.get()).toPrintable());//偏向锁
Thread t5 = new Thread() {
String name = "";
public void run() {
System.out.printf(name);
for (TestDemo a : list3) {
synchronized (a) {
if (a == list3.get()) {
System.out.println("t5 预期是轻量级锁，类的对象累计撤销达到40 不可以用偏向锁了" + + ClassLayout.parseInstance(a).toPrintable());//偏向锁
}
}
}
try {
Thread.sleep();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
};
t5.start();
Thread.sleep();
System.out.println("main 预期是偏向锁" + + ClassLayout.parseInstance(list.get()).toPrintable());//偏向锁
Thread t6 = new Thread() {
String name = "";
public void run() {
System.out.printf(name);
for (int i = ; i < ; i++) {
TestDemo a = list3.get(i);
synchronized (a) {
if (a == list3.get()) {
System.out.println("t6 i=10 get(1)预期是无锁" + ClassLayout.parseInstance(list3.get()).toPrintable());//偏向锁
System.out.println("t6 i=10 get(10) 预期轻量级锁 " + i + ClassLayout.parseInstance(a).toPrintable());//偏向锁
}
if (a == list3.get()) {
System.out.println("t6 i=19 get(10)预期是无锁" + + ClassLayout.parseInstance(list3.get()).toPrintable());//偏向锁
System.out.println("t6 i=19 get(19) 满足重偏向条件20 但类的对象累计撤销达到40 不可以用偏向锁了 " + i + ClassLayout.parseInstance(a).toPrintable());//偏向锁
}
}
}
try {
Thread.sleep();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
};
t6.start();
Thread.sleep();
System.out.println("由于撤销锁次数达到默认的 BiasedLockingBulkRevokeThreshold=40 这里实例化的对象 是无锁状态" + ClassLayout.parseInstance(new TestDemo()).toPrintable());//偏向锁
System.out.println("撤销偏向后状态" + + ClassLayout.parseInstance(new TestDemo()).toPrintable());//偏向锁
}
}
运行结果：
初始状态10 com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) N/A
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 1t1 预期是偏向锁10 com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) e0 8e ( ) (-)
(object header) ec 7f ( ) ()
(object header) bf c3 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total main 预期是偏向锁10 com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) e0 8e ( ) (-)
(object header) ec 7f ( ) ()
(object header) bf c3 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 2t2 i= get()预期是无锁com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) bf c3 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total t2 i= get() 预期轻量级锁 com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) 7a ( ) ()
(object header) ( ) ()
(object header) bf c3 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total t2 i= get()预期是无锁10 com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) bf c3 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total t2 i= get() 满足重偏向条件20 预期偏向锁 19com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) (-)
(object header) ec 7f ( ) ()
(object header) bf c3 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 类的对象累计撤销达到20
3t3 预期是偏向锁10com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) (-)
(object header) ec 7f ( ) ()
(object header) bf c3 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 4t4 i= get()预期是无锁com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) bf c3 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total t4 i= get() 当前不满足重偏向条件 预期轻量级锁 10com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) f9 9a ( ) ()
(object header) ( ) ()
(object header) bf c3 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total t4 i= get()预期是无锁10com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) bf c3 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total t4 i= get() 当前满足重偏向条件 但A类的对象累计撤销达到40 预期轻量级锁 19com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) f9 9a ( ) ()
(object header) ( ) ()
(object header) bf c3 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 类的对象累计撤销达到40
t4 i= get() 当前满足重偏向条件 预期轻量级锁 20com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) f9 9a ( ) ()
(object header) ( ) ()
(object header) bf c3 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total main 预期是偏向锁10com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) bf c3 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 5t5 预期是轻量级锁，A类的对象累计撤销达到40 不可以用偏向锁了10com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) f9 9a ( ) ()
(object header) ( ) ()
(object header) bf c3 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total main 预期是偏向锁10com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) bf c3 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 6t6 i= get()预期是无锁com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) bf c3 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total t6 i= get() 预期轻量级锁 10com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ab ( ) ()
(object header) ( ) ()
(object header) bf c3 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total t6 i= get()预期是无锁10com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) bf c3 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total t6 i= get() 满足重偏向条件20 但A类的对象累计撤销达到40 不可以用偏向锁了 19com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ab ( ) ()
(object header) ( ) ()
(object header) bf c3 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 由于类撤销锁次数达到默认的 BiasedLockingBulkRevokeThreshold= 这里实例化的对象 是无锁状态com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) bf c3 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total 撤销偏向后状态10com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) ( ) ()
(object header) ( ) ()
(object header) bf c3 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total
以上案例证实了偏向锁的批量重偏向和批量撤销，接下来我们讲解轻量级锁；
轻量级锁：
- 当锁是偏向锁的时候，被另外的线程所访问，偏向锁就会升级为轻量级锁，其他线程会通过自旋的形式尝试获取锁，不会阻塞，从而提高性能。
- 在代码进入同步块的时候，如果同步对象锁状态为无锁状态（锁标志位为“01”状态，是否为偏向锁为“0”），虚拟机首先将在当前线程的栈帧中建立一个名为锁记录（Lock Record）的空间，用于存储锁对象目前的Mark Word的拷贝，然后拷贝对象头中的Mark Word复制到锁记录中。
- 拷贝成功后，虚拟机将使用CAS操作尝试将对象的Mark Word更新为指向Lock Record的指针，并将Lock Record里的owner指针指向对象的Mark Word。
- 如果这个更新动作成功了，那么这个线程就拥有了该对象的锁，并且对象Mark Word的锁标志位设置为“00”，表示此对象处于轻量级锁定状态。
- 如果轻量级锁的更新操作失败了，虚拟机首先会检查对象的Mark Word是否指向当前线程的栈帧，如果是就说明当前线程已经拥有了这个对象的锁，那就可以直接进入同步块继续执行，否则说明多个线程竞争锁。
- 若当前只有一个等待线程，则该线程通过自旋进行等待。但是当自旋超过一定的次数，或者一个线程在持有锁，一个在自旋，又有第三个来访时，轻量级锁升级为重量级锁。
- 多个线程在不同的时间段请求同一把锁，也就是说没有锁竞争。针对这种情形，Java 虚拟机采用了轻量级锁，来避免重量级锁的阻塞以及唤醒
- 在没有锁竞争的前提下，减少传统锁使用OS互斥量产生的性能损耗
- 在竞争激烈时，轻量级锁会多做很多额外操作，导致性能下降
- 可以认为两个线程交替执行的情况下请求同一把锁
分析一个由偏向锁膨胀成轻量级锁的案例：
public class TestDemo {
}
public class DemoExample9 {
public static void main(String[] args) throws Exception {
TestDemo testDemo = new TestDemo();
//子线程
Thread t1 = new Thread(){
@Override
public void run() {
synchronized (testDemo){
System.out.println("t1 lock ing");
System.out.println(ClassLayout.parseInstance(testDemo).toPrintable());
}
}
};
t1.join();
//主线程
synchronized (testDemo){
System.out.println("main lock ing");
System.out.println(ClassLayout.parseInstance(testDemo).toPrintable());
}
}
}
运行结果（两个线程交替执行的情况下）：
main lock ing
com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) e8 ( ) ()
(object header) ( ) ()
(object header) a0 c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total
重量级锁：
- 多个线程竞争同一个锁的时候，虚拟机会阻塞加锁失败的线程，并且在目标锁被释放的时候，唤醒这些线程；
- Java 线程的阻塞以及唤醒，都是依靠操作系统来完成的：os pthread_mutex_lock() ；
- 升级为重量级锁时，锁标志的状态值变为“10”，此时Mark Word中存储的是指向重量级锁的指针，此时等待锁的线程都会进入阻塞状态
分析一个由轻量级锁膨胀成重量级锁的案例：
public class TestDemo {
}
public class DemoExample9 {
public static void main(String[] args) throws Exception {
TestDemo testDemo = new TestDemo();
Thread t1 = new Thread(){
@Override
public void run() {
synchronized (testDemo){
System.out.println("t1 lock ing");
System.out.println(ClassLayout.parseInstance(testDemo).toPrintable());
}
}
};
t1.start();
synchronized (testDemo){
System.out.println("main lock ing");
System.out.println(ClassLayout.parseInstance(testDemo).toPrintable());
}
}
}
运行结果：
main lock ing
com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) 5a ad b0 ( ) (-)
(object header) cf 7f ( ) ()
(object header) a0 c1 f8 ( ) (-)
(loss due to the next object alignment)
Instance size: bytes
Space losses: bytes internal + bytes external = bytes total t1 lock ing
com.boke.TestDemo object internals:
OFFSET SIZE TYPE DESCRIPTION VALUE
(object header) 5a ad b0 ( ) (-)
(object header) cf 7f ( ) ()
(object header) a0 c1 f8 ( ) (-)
(loss due to the next object alignment)
我们再来说一下Java 虚拟机是怎么区分轻量级锁和重量级锁的：
- 当进行加锁操作时，Java 虚拟机会判断是否已经是重量级锁。如果不是，它会在当前线程的当前栈桢中划出一块空间，作为该锁的锁记录，并且将锁对象的标记字段复制到该锁记录中。
- 然后，Java 虚拟机会尝试用 CAS（compare-and-swap）操作替换锁对象的标记字段。这里解释一下，CAS 是一个原子操作，它会比较目标地址的值是否和期望值相等，如果相等，则替换为一个新的值。
- 假设当前锁对象的标记字段为 X…XYZ，Java 虚拟机会比较该字段是否为 X…X01。如果是，则替换为刚才分配的锁记录的地址。由于内存对齐的缘故，它的最后两位为 00。此时，该线程已成功获得这把锁，可以继续执行了。
- 如果不是 X…X01，那么有两种可能。第一，该线程重复获取同一把锁。此时，Java 虚拟机会将锁记录清零，以代表该锁被重复获取。第二，其他线程持有该锁。此时，Java 虚拟机会将这把锁膨胀为重量级锁，并且阻塞当前线程。
- 当进行解锁操作时，如果当前锁记录（你可以将一个线程的所有锁记录想象成一个栈结构，每次加锁压入一条锁记录，解锁弹出一条锁记录，当前锁记录指的便是栈顶的锁记录）的值为 0，则代表重复进入同一把锁，直接返回即可。
- 否则，Java 虚拟机会尝试用 CAS 操作，比较锁对象的标记字段的值是否为当前锁记录的地址。如果是，则替换为锁记录中的值，也就是锁对象原本的标记字段。此时，该线程已经成
- 功释放这把锁。
- 如果不是，则意味着这把锁已经被膨胀为重量级锁。此时，Java 虚拟机会进入重量级锁的释放过程，唤醒因竞争该锁而被阻塞了的线程
到此为止本篇就讲完了锁的膨胀过程：
总结一下：
- 偏向锁只会在第一次请求时采用 CAS 操作，在锁对象的标记字段中记录下当前线程的地址。在之后的运行过程中，持有该偏向锁的线程的加锁操作将直接返回。它针对的是锁仅会被同一线程持有的情况。
- 轻量级锁采用 CAS 操作，将锁对象的标记字段替换为一个指针，指向当前线程栈上的一块空间，存储着锁对象原本的标记字段。它针对的是多个线程在不同时间段申请同一把锁的情况。
- 重量级锁会阻塞、唤醒请求加锁的线程。它针对的是多个线程同时竞争同一把锁的情况。Java 虚拟机采取了自适应自旋，来避免线程在面对非常小的 synchronized 代码块时，仍会被阻塞、唤醒的情况。
说完了锁的膨胀过程，那么会不会有锁的降级呢？
我在hotspot源码中找到了这样的注释：
// We create a list of in-use monitors for each thread.
//
// deflate_thread_local_monitors() scans a single thread's in-use list, while
// deflate_idle_monitors() scans only a global list of in-use monitors which
// is populated only as a thread dies (see omFlush()).
//
// These operations are called at all safepoints, immediately after mutators
// are stopped, but before any objects have moved. Collectively they traverse
// the population of in-use monitors, deflating where possible. The scavenged
// monitors are returned to the monitor free list.
//
// Beware that we scavenge at *every* stop-the-world point. Having a large
// number of monitors in-use could negatively impact performance. We also want
// to minimize the total # of monitors in circulation, as they incur a small
// footprint penalty.
//
// Perversely, the heap size -- and thus the STW safepoint rate --
// typically drives the scavenge rate. Large heaps can mean infrequent GC,
// which in turn can mean large(r) numbers of objectmonitors in circulation.
// This is an unfortunate aspect of this design.
//大概意思是：锁降级确实是会发生的，当 JVM 进入安全点（SafePoint）的时候，会检查是否有闲置的 Monitor，然后试图进行降级
有兴趣的大佬可以在https://hg.openjdk.java.net/jdk/jdk/file/896e80158d35/src/hotspot/share/runtime/synchronizer.cpp链接中：
研究一下deflate_idle_monitors是分析锁降级逻辑的入口，这部分行为还在进行持续改进，因为其逻辑是在安全点内运行，处理不当可能拖长 JVM 停顿（STW，stop-the-world）的时间。
synchronized（三） 锁的膨胀过程（锁的升级过程）深入剖析的更多相关文章
- android recovery升级过程中掉电处理
一般在升级过程,都会提示用户,请勿断电,不管是android的STB,TV还是PHONE,或者是其他的终端设备,升级过程,基本上都可以看到“正在升级,请勿断电”,然后有个进度条,显示升级的进度. 但是 ...
- java并发笔记之四synchronized 锁的膨胀过程（锁的升级过程）深入剖析
警告⚠️:本文耗时很长,先做好心理准备,建议PC端浏览器浏览效果更佳. 本篇我们讲通过大量实例代码及hotspot源码分析偏向锁(批量重偏向.批量撤销).轻量级锁.重量级锁及锁的膨胀过程(也就是锁的升 ...
- java架构之路（多线程）synchronized详解以及锁的膨胀升级过程
上几次博客,我们把volatile基本都说完了,剩下的还有我们的synchronized,还有我们的AQS,这次博客我来说一下synchronized的使用和原理. synchronized是jvm内 ...
- Synchronized用法原理和锁优化升级过程(面试)
简介 多线程一直是面试中的重点和难点,无论你现在处于啥级别段位,对synchronized关键字的学习避免不了,这是我的心得体会.下面咱们以面试的思维来对synchronized做一个系统的描述,如果 ...
- 详细了解 synchronized 锁升级过程
前言 首先,synchronized 是什么?我们需要明确的给个定义--同步锁,没错,它就是把锁. 可以用来干嘛?锁,当然当然是用于线程间的同步,以及保护临界区内的资源.我们知道,锁是个非常笼统的概念 ...
- JAVA锁的膨胀过程和优化
首先说一下锁的优化策略. 1,自旋锁 自选锁其实就是在拿锁时发现已经有线程拿了锁,自己如果去拿会阻塞自己,这个时候会选择进行一次忙循环尝试.也就是不停循环看是否能等到上个线程自己释放锁.这个问题是基于 ...
- 并发编程：synchronized 锁升级过程的验证
关于synchronized关键字以及偏向锁.轻量级锁.重量级锁的介绍广大网友已经给出了太多文章和例子,这里就不再重复了,也可点击链接来回顾一下.在这里来实战操作一把,验证JVM是怎么一步一步 ...
- JAVA锁的膨胀过程和优化(阿里)
阿里的人问什么是锁膨胀,答不上来,回来做了总结: 关于锁的膨胀,synchronized的原理参考:深入分析Synchronized原理(阿里面试题) 首先说一下锁的优化策略. 1,自旋锁 自旋锁其实 ...
- synchronized优化手段：锁膨胀、锁消除、锁粗化和自适应自旋锁...
synchronized 在 JDK 1.5 时性能是比较低的,然而在后续的版本中经过各种优化迭代,它的性能也得到了前所未有的提升,上一篇中我们谈到了锁膨胀对 synchronized 性能的提升,然 ...
随机推荐
- 【Wince-ListView】Wince中的 ListView怎么显示网格？
using System.Runtime.InteropServices; using System.Windows.Forms; namespace CETEST { public class Co ...
- jquery image选择器 语法
jquery image选择器 语法 作用::image 选择器选取类型为 image 的 <input> 元素.无锡大理石测量平台 语法:$(":image") jq ...
- Android源码开发利器——Java源码调试(基于4.1.2)
原文地址:http://blog.csdn.net/jinzhuojun/article/details/8868038 调试Android Java源码 草帽的后花园——Neo 写在之前的 ...
- 【WebStorm】前端工具开发利器webstrom专篇
---------------------------------------------------------------------------------[亲身实测] WebStorm混搭sv ...
- 深入理解 Java 线程池
一.简介 什么是线程池 线程池是一种多线程处理形式,处理过程中将任务添加到队列,然后在创建线程后自动启动这些任务. 为什么要用线程池 如果并发请求数量很多,但每个线程执行的时间很短,就会出现频繁的创建 ...
- jQuery事件之解绑事件
语法: $(selector).unbind([eventType][,handler(eventObject)]); 返回值:jQuery 参数解释: eventTypey:类型:String以后包 ...
- jQuery属性操作之类样式操作
类样式的操作:指对DOM属性className进行添加.移除操作.比如addClass().removeClass().toggleClass(). 1. addClass() 1.1 概述 $(se ...
- error while loading shared libraries: libXXXX.so: cannot open shared object file: No such file or directory
出现这个问题的原因是运行程序缺少依赖库,或者运行程序的依赖库缺少依赖库,可能你的本地目录下面就有这个库文件,但是linux搜索路劲不会从当前路径下去搜索:这种情况可能出现在切换环境上,可能你在一个li ...
- CSS效果——绝对居中
实现效果 不论窗口尺寸,都可以垂直和水平居中. 代码 <!DOCTYPE html> <html> <head> <meta charset="ut ...
- 导出Excel/Pdf/txt/json/XML/PNG/CSV/SQL/MS-Word/ Ms-Powerpoint/等通过tableExport.js插件来实现
首先去我的云盘下载需要的js: 链接:https://pan.baidu.com/s/13vC-u92ulpx3RbljsuadWw 提取码:mo8m 页面代码: <!DOCTYPE html& ...