Reputation: 15331
Supposedly I have the following class definition, when one thread wants to set a for multiple (potentially) waiting threads:
public class A {
private int a;
private CountDownLatch gate;
public A(int a) {
a = 1;
gate = new CountDownLatch(1);
}
public int getA() {
latch.await();
return a;
}
public void setA(int a) {
this.a = a;
gate.countDown();
}
}
It seems to me that a needs to be volatile, but I am not sure… Could someone please share why, if at all, there needs to be an extra synchronization around getA, or a needs to be volatile?
Upvotes: 5
Views: 1507
Reputation: 1030
Actually a
doesn't need to be volatile because countDown()
loades and stores into volatile state
variable of AbstractQueuedSynchronizer
which is used inside CountDownLatch
. Volatile store triggers a memory-barrier (great in-depth article about Memory Barriers and etc in JSR-133). And according to the JMM all previous stores (to other variables) would be visible to other threads.
assylias is right, it would be true only if you call setA()
once, because you construct latch as new CountDownLatch(1)
.
Upvotes: 4
Reputation: 328568
According to the javadoc:
Until the count reaches zero, actions in a thread prior to calling
countDown()
happen-before actions following a successful return from a correspondingawait()
in another thread.
So you don't need extra synchronisation if you only call setA
once. If you call it a second time, because the count will already be 0, you won't get the same guarantee.
If the expected use is to only call setA
once you could throw an exception if it is called more than once to enforce that contract (although checking the count AND assigning a new value to a atomically may be tricky without additional synchronisation).
If you are happy that setA
can be called more than once then you need additional synchronisation.
Upvotes: 5