/
ConcurrencyUtil.java
114 lines (103 loc) · 3.67 KB
/
ConcurrencyUtil.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
/*
* Copyright (c) 2008-2018, Hazelcast, Inc. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.hazelcast.util;
import java.util.concurrent.ConcurrentMap;
import java.util.concurrent.atomic.AtomicLong;
import java.util.concurrent.atomic.AtomicLongFieldUpdater;
/**
* Utility methods to getOrPutSynchronized and getOrPutIfAbsent in a thread safe way
* from a {@link ConcurrentMap} with a {@link ConstructorFunction}.
*/
public final class ConcurrencyUtil {
private ConcurrencyUtil() {
}
/**
* Atomically sets the max value.
*
* If the current value is larger than the provided value, the call is ignored.
* So it will not happen that a smaller value will overwrite a larger value.
*/
public static <E> void setMax(E obj, AtomicLongFieldUpdater<E> updater, long value) {
for (; ; ) {
long current = updater.get(obj);
if (current >= value) {
return;
}
if (updater.compareAndSet(obj, current, value)) {
return;
}
}
}
public static boolean setIfEqualOrGreaterThan(AtomicLong oldValue, long newValue) {
while (true) {
long local = oldValue.get();
if (newValue < local) {
return false;
}
if (oldValue.compareAndSet(local, newValue)) {
return true;
}
}
}
public static <K, V> V getOrPutSynchronized(ConcurrentMap<K, V> map, K key, final Object mutex,
ConstructorFunction<K, V> func) {
if (mutex == null) {
throw new NullPointerException();
}
V value = map.get(key);
if (value == null) {
synchronized (mutex) {
value = map.get(key);
if (value == null) {
value = func.createNew(key);
map.put(key, value);
}
}
}
return value;
}
public static <K, V> V getOrPutSynchronized(ConcurrentMap<K, V> map, K key, ContextMutexFactory contextMutexFactory,
ConstructorFunction<K, V> func) {
if (contextMutexFactory == null) {
throw new NullPointerException();
}
V value = map.get(key);
if (value == null) {
ContextMutexFactory.Mutex mutex = contextMutexFactory.mutexFor(key);
try {
synchronized (mutex) {
value = map.get(key);
if (value == null) {
value = func.createNew(key);
map.put(key, value);
}
}
} finally {
mutex.close();
}
}
return value;
}
public static <K, V> V getOrPutIfAbsent(ConcurrentMap<K, V> map, K key, ConstructorFunction<K, V> func) {
V value = map.get(key);
if (value == null) {
value = func.createNew(key);
V current = map.putIfAbsent(key, value);
value = current == null ? value : current;
}
return value;
}
}