跳至主要内容

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

Elasticsearch: Join and SubQuery

Elasticsearch: Join and SubQuery Tony was bothered by the recent change of search engine requirement: they want the functionality of SQL-like join in Elasticsearch! “They are crazy! How can they think like that. Didn’t they understand that Elasticsearch is kind-of NoSQL 1 in which every index should be independent and self-contained? In this way, every index can work independently and scale as they like without considering other indexes, so the performance can boost. Following this design principle, Elasticsearch has little related supports.” Tony thought, after listening their requirements. Leader notice tony’s unwillingness and said, “Maybe it is hard to do, but the requirement is reasonable. We need to search person by his friends, didn’t we? What’s more, the harder to implement, the more you can learn from it, right?” Tony thought leader’s word does make sense so he set out to do the related implementations Application-Side Join “The first implementation

Implement isdigit

It is seems very easy to implement c library function isdigit , but for a library code, performance is very important. So we will try to implement it and make it faster. Function So, first we make it right. int isdigit ( char c) { return c >= '0' && c <= '9' ; } Improvements One – Macro When it comes to performance for c code, macro can always be tried. #define isdigit (c) c >= '0' && c <= '9' Two – Table Upper version use two comparison and one logical operation, but we can do better with more space: # define isdigit(c) table[c] This works and faster, but somewhat wasteful. We need only one bit to represent true or false, but we use a int. So what to do? There are many similar functions like isalpha(), isupper ... in c header file, so we can combine them into one int and get result by table[c]&SOME_BIT , which is what source do. Source code of ctype.h : # define _ISbit(bit) (1 << (