mirror of
https://github.com/VolmitSoftware/Iris.git
synced 2025-07-18 18:23:06 +00:00
I'm not proud of this
This commit is contained in:
parent
cd3f9af232
commit
dff88403b5
111
src/main/java/com/volmit/iris/engine/parallel/HyperLock.java
Normal file
111
src/main/java/com/volmit/iris/engine/parallel/HyperLock.java
Normal file
@ -0,0 +1,111 @@
|
|||||||
|
/*
|
||||||
|
* Iris is a World Generator for Minecraft Bukkit Servers
|
||||||
|
* Copyright (c) 2021 Arcane Arts (Volmit Software)
|
||||||
|
*
|
||||||
|
* This program is free software: you can redistribute it and/or modify
|
||||||
|
* it under the terms of the GNU General Public License as published by
|
||||||
|
* the Free Software Foundation, either version 3 of the License, or
|
||||||
|
* (at your option) any later version.
|
||||||
|
*
|
||||||
|
* This program is distributed in the hope that it will be useful,
|
||||||
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||||
|
* GNU General Public License for more details.
|
||||||
|
*
|
||||||
|
* You should have received a copy of the GNU General Public License
|
||||||
|
* along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||||
|
*/
|
||||||
|
|
||||||
|
package com.volmit.iris.engine.parallel;
|
||||||
|
|
||||||
|
import com.googlecode.concurrentlinkedhashmap.ConcurrentLinkedHashMap;
|
||||||
|
import com.volmit.iris.Iris;
|
||||||
|
import com.volmit.iris.engine.cache.Cache;
|
||||||
|
import com.volmit.iris.util.function.NastyRunnable;
|
||||||
|
import com.volmit.iris.util.io.IORunnable;
|
||||||
|
|
||||||
|
import java.io.IOException;
|
||||||
|
import java.util.concurrent.TimeUnit;
|
||||||
|
import java.util.concurrent.locks.ReentrantLock;
|
||||||
|
import java.util.function.BiFunction;
|
||||||
|
import java.util.function.Supplier;
|
||||||
|
|
||||||
|
public class HyperLock {
|
||||||
|
private final ConcurrentLinkedHashMap<Long, ReentrantLock> locks;
|
||||||
|
private final BiFunction<? super Long, ? super ReentrantLock, ? extends ReentrantLock> accessor;
|
||||||
|
|
||||||
|
public HyperLock() {
|
||||||
|
this(1024, false);
|
||||||
|
}
|
||||||
|
|
||||||
|
public HyperLock(int capacity) {
|
||||||
|
this(capacity, false);
|
||||||
|
}
|
||||||
|
|
||||||
|
public HyperLock(int capacity, boolean fair) {
|
||||||
|
locks = new ConcurrentLinkedHashMap.Builder<Long, ReentrantLock>()
|
||||||
|
.initialCapacity(capacity)
|
||||||
|
.maximumWeightedCapacity(capacity)
|
||||||
|
.listener((k, v) -> {
|
||||||
|
if(v.isLocked() || v.isHeldByCurrentThread())
|
||||||
|
{
|
||||||
|
Iris.warn("InfiniLock Eviction of " + k + " still has locks on it!");
|
||||||
|
}
|
||||||
|
})
|
||||||
|
.concurrencyLevel(32)
|
||||||
|
.build();
|
||||||
|
accessor = (k,v) -> v == null ? new ReentrantLock(fair) : v;
|
||||||
|
}
|
||||||
|
|
||||||
|
public void with(int x, int z, Runnable r) {
|
||||||
|
lock(x, z);
|
||||||
|
r.run();
|
||||||
|
unlock(x, z);
|
||||||
|
}
|
||||||
|
|
||||||
|
public void withNasty(int x, int z, NastyRunnable r) throws Throwable {
|
||||||
|
lock(x, z);
|
||||||
|
r.run();
|
||||||
|
unlock(x, z);
|
||||||
|
}
|
||||||
|
|
||||||
|
public void withIO(int x, int z, IORunnable r) throws IOException {
|
||||||
|
lock(x, z);
|
||||||
|
r.run();
|
||||||
|
unlock(x, z);
|
||||||
|
}
|
||||||
|
|
||||||
|
public <T> T withResult(int x, int z, Supplier<T> r) {
|
||||||
|
lock(x, z);
|
||||||
|
T t = r.get();
|
||||||
|
unlock(x, z);
|
||||||
|
return t;
|
||||||
|
}
|
||||||
|
|
||||||
|
public boolean tryLock(int x, int z) {
|
||||||
|
return getLock(x, z).tryLock();
|
||||||
|
}
|
||||||
|
|
||||||
|
public boolean tryLock(int x, int z, long timeout) {
|
||||||
|
try {
|
||||||
|
return getLock(x, z).tryLock(timeout, TimeUnit.MILLISECONDS);
|
||||||
|
} catch (InterruptedException e) {
|
||||||
|
Iris.reportError(e);
|
||||||
|
}
|
||||||
|
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
private ReentrantLock getLock(int x, int z)
|
||||||
|
{
|
||||||
|
return locks.compute(Cache.key(x, z), accessor);
|
||||||
|
}
|
||||||
|
|
||||||
|
public void lock(int x, int z) {
|
||||||
|
getLock(x, z).lock();
|
||||||
|
}
|
||||||
|
|
||||||
|
public void unlock(int x, int z) {
|
||||||
|
getLock(x, z).unlock();
|
||||||
|
}
|
||||||
|
}
|
Loading…
x
Reference in New Issue
Block a user