跳至主要内容

Synchronize on Method Call

This week, we are going to talk about a problem we may not notice in common concurrency code but may bite you later.

Synchronize on Method Call

Quick Question

See the following code: thread one will start first, then thread two. So, will the first element of list printed? Or deeper, can second thread enter that synchronized block?

List list;
// thread one
synchronized (list) {
  while (true) {
    try {
      Thread.sleep(1000);
    } catch (InterruptedException e) {
      e.printStackTrace();
    }
  }
}
// thread two
synchronized (list.get(0)) {
  System.out.println(list.get(0));
}

Answer

The answer is yes. Do you get it? let’s analyse what the essence of this problem.

First, we can simply find the the lock of list is always hold by thread one for its infinite loop. So, whether the second thread can enter that synchronized block depends on whether we need to get the lock of list.
Now, we need to understand: whether we get option one or option two when synchronize on a method call?

synchronized (list.get(0)) {}

// option one
obj = list.get(0);
synchronized (obj) {}

// option two
synchronized (list) {
    synchronized (list.get(0)) {}
}

Either by trying with code, or viewing the byte code like following:

ICONST_0
INVOKEINTERFACE java/util/List.get (I)Ljava/lang/Object;
...
MONITORENTER <--- synchronization starts here

we can know compiler give us option one, i.e. we first get element, then only acquire one element lock.

Motivation

When it comes to the motivation, the following is my guess according to my experience.

In the perspective of compiler, nested synchronized block can be prone to deadlock if the acquisition of locks in disorder and compiler should not do it by itself.

In the perspective of programmer, if compiler acquire lock of list first, then the lock of element after compilation in which the result is invisible to programmer, it will be very dangerous, either in readability or in correctness aspects.

More

Now, what about the following code? Will the first element of array printed?

// thread one
synchronized (args) {
  while (true) {
    try {
      Thread.sleep(1000);
    } catch (InterruptedException e) {
      e.printStackTrace();
    }
    System.out.println("sleeping1");
  }
}
// thread two
synchronized (args[0]) {
  System.out.println(args[0]);
}

Short Answer: Yes

You can now run code or view byte code to verify it.

Ref

Written with StackEdit.

评论

此博客中的热门博文

Spring Boot: Customize Environment

Spring Boot: Customize Environment Environment variable is a very commonly used feature in daily programming: used in init script used in startup configuration used by logging etc In Spring Boot, all environment variables are a part of properties in Spring context and managed by Environment abstraction. Because Spring Boot can handle the parse of configuration files, when we want to implement a project which uses yml file as a separate config file, we choose the Spring Boot. The following is the problems we met when we implementing the parse of yml file and it is recorded for future reader. Bind to Class Property values can be injected directly into your beans using the @Value annotation, accessed via Spring’s Environment abstraction or bound to structured objects via @ConfigurationProperties. As the document says, there exists three ways to access properties in *.properties or *.yml : @Value : access single value Environment : can access multi...

LevelDB Source Reading (4): Concurrent Access

In this thread, we come to the issue of concurrent access of LevelDB. As a database, it can be concurrently accessed by users. But, it wouldn’t be easy to provide high throughput under product load. What effort does LevelDB make to achieve this goal both in design and implementation? Goal of Design From this github issue , we can see LevelDB is designed for not allowing multi-process access. this (supporting multiple processes) doesn’t seem like a good feature for LevelDB to implement. They believe let multiple process running would be impossible to share memory/buffer/cache, which may affect the performance of LevelDB. In the case of multiple read-only readers without altering the code base, you could simply copy the file for each reader. Yes, it will be inefficient (though not on file systems that dedupe data), but then again, so would having multiple leveldb processes running as they wouldn’t be able to share their memory/buffer/etc. They achieve it by adding a l...

LevelDB Source Reading (3): Compaction

LevelDB Source Reading (3): Compaction In the last blog that analyzes read/write process of Leveldb, we can see writing only happens to log file and memory table, then it relies on the compaction process to move the new updates into persistent sorted table for future use. So the compaction is a crucial part for the design, and we will dive into it in this blog. Compaction LevelDB compacts its underlying storage data in the background to improve read performance. The upper sentence is cited from the document of Leveldb , and we will see how it is implemented via code review. Background compaction // db_impl.cc void DBImpl :: MaybeScheduleCompaction ( ) { // use background thread to run compaction env_ - > Schedule ( & DBImpl :: BGWork , this ) ; } Two main aspects // arrange background compaction when Get, Open, Write void DBImpl :: BackgroundCompaction ( ) { // compact memtable CompactMemTable ( ) ; // compact ...