MySimpleReadWriteLock

10 篇文章 0 订阅
3 篇文章 0 订阅
import java.util.concurrent.TimeUnit;
import java.util.concurrent.locks.AbstractQueuedSynchronizer;
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;


public class MySimpleReadWriteLock {

	private Syn syn = new Syn();
	private Lock readLock = new ReadLock(syn);
	private Lock writeLock = new WriteLock(syn);

	public MySimpleReadWriteLock() {
		
	}
	
	private static class ReadLock implements Lock {
		final private Syn syn;
		public ReadLock(Syn syn) {
			this.syn = syn;
		}
		@Override
		public void lock() {
			syn.acquireShared(1);
		}
		@Override
		public void lockInterruptibly() throws InterruptedException {
			syn.acquireInterruptibly(1);
		}
		@Override
		public boolean tryLock() {
			return syn.justTryAcquire(1);
		}
		@Override
		public boolean tryLock(long time, TimeUnit unit)
				throws InterruptedException {
			return syn.tryAcquireNanos(1, unit.toNanos(time));
		}
		@Override
		public void unlock() {
			syn.release(1);
		}
		@Override
		public Condition newCondition() {
			return syn.newCondition();
		}
	}
	
	private static class WriteLock implements Lock{
		private final Syn syn;
		public WriteLock(Syn syn) {
			this.syn = syn;
		}
		@Override
		public void lock() {
			syn.acquire(1);
		}
		@Override
		public void lockInterruptibly() throws InterruptedException {
			syn.acquireInterruptibly(1);
		}
		@Override
		public boolean tryLock() {
			return syn.justTryAcquire(1);
		}
		@Override
		public boolean tryLock(long time, TimeUnit unit)
				throws InterruptedException {
			return syn.tryAcquireNanos(1, unit.toNanos(time));
		}
		@Override
		public void unlock() {
			syn.release(1);
		}
		@Override
		public Condition newCondition() {
			return syn.newCondition();
		}
	}

	private static class Syn extends AbstractQueuedSynchronizer {

		private static final long serialVersionUID = 1L;
		private static final int SHARED_SHIFT = 16;
		private static final int SHARED_UNIT = 1 << SHARED_SHIFT;
		private static final int EXCLUSIVE_MASK = (1 << SHARED_SHIFT) - 1;
		private static final HoldCounterThreadLocal LOCAL = new HoldCounterThreadLocal();
		private HoldCounter holdCounter = null;
		
		private static class HoldCounterThreadLocal extends ThreadLocal<HoldCounter>{
			@Override
			protected MySimpleReadWriteLock.Syn.HoldCounter initialValue() {
				return new HoldCounter();
			}
		}
		
		private static class HoldCounter {
			int i = 0;
			long tid = Thread.currentThread().getId();
			public int decrement(int arg) {
				return i-=arg;
			}
			
			public int increment(int acquires) {
				return i+=acquires;
			}
		}

		@Override
		protected int tryAcquireShared(int acquires) {
			int state = super.getState();
			Thread current = Thread.currentThread();
			int exclusiveCount = exclusiveCount(state);
			if(exclusiveCount != 0 && current != getExclusiveOwnerThread()) {//current != getExclusiveOwnerThread()  保证写锁可以让读锁进
				return -1;
			}
			int c = state + (acquires<<SHARED_SHIFT);
			if(compareAndSetState(state, c)) {
				HoldCounter hc = holdCounter;
				if(hc == null || hc.tid != current.getId() ) {//holdCounter.tid != current.getId()  利用的底层的缓存,导致每个线程可能看到的holdCounter是不一样的,很有可能是自己的,也有可能是其他线程的
					holdCounter = hc = LOCAL.get();
				}
				hc.increment(acquires);
				return 1;
			}
			
			return -1;
		}
		private int exclusiveCount(int state) {
			return EXCLUSIVE_MASK & state;
		}

		@Override
		protected boolean tryReleaseShared(int arg) {
			Thread current = Thread.currentThread();
			HoldCounter hc = holdCounter;
			if(hc == null || hc.tid != current.getId()) {
				holdCounter = hc = LOCAL.get();
			}
			if(hc.i-arg < 0)
				throw new IllegalMonitorStateException("release arg is illegal");
			else 
				hc.decrement(arg);
			
			for(;;) {	//独占模式下的release不用for(;;) 因为只要判断了current和exclusiveOwnerThead就可以		 但是共享模式下的,由于release可能会并发执行,需要保证原子操作,就for和cas
				int state = getState();
				int nextc = state - (arg<<SHARED_SHIFT);
				if(compareAndSetState(state, nextc)) {
					return nextc == 0; 
				}
			}
		}

		@Override
		protected boolean tryAcquire(int acquires) {
			return justTryAcquire(acquires);
		}

		private boolean justTryAcquire(int acquires) {
			int state = super.getState();
			int w = exclusiveCount(state);
			Thread current = Thread.currentThread();
			if(state==0) {
				if(super.compareAndSetState(state, state+acquires)) {
					setExclusiveOwnerThread(current);
					return true;
				}
			} else if(w==0 || current!=getExclusiveOwnerThread()) {
				return false;
			} else {
				if(compareAndSetState(state, state+acquires)) {
					return true;
				}
			}
			return false;
		}

		@Override
		protected boolean tryRelease(int arg) {
			Thread current = Thread.currentThread();
			if(current!=getExclusiveOwnerThread()) {
				throw new IllegalMonitorStateException("release error");
			}
			int p = super.getState();
			int c = p-arg;
			if(c==0) {
				setState(c);
				setExclusiveOwnerThread(null);
				return true;
			} else {
				setState(c);
				return false;
			}
		}
		
		public Condition newCondition() {
			return new ConditionObject();
		}

		@Override
		protected boolean isHeldExclusively() {
			return getExclusiveOwnerThread() == Thread.currentThread();
		}
		
	}
	
	public Lock readLock() {
		return readLock;
	}
	
	public Lock writeLock() {
		return writeLock;
	}
	
	public boolean tryLock() {
		return syn.justTryAcquire(1);
	}
	
	public void lock() {
		syn.acquire(1);
	}
	
	public void unlock() {
		syn.release(1);
	}
	
}

 

import java.util.concurrent.locks.Lock;


public class MySimpleRWLockTest {
	static Lock readLock = null;
	static Lock writeLock = null;
	static {
		MySimpleReadWriteLock lock = new MySimpleReadWriteLock();
		readLock = lock.readLock();
		writeLock = lock.writeLock();
	}

	public static void main(String[] args) {
		writeLockTest();
		readLockTest();
	}

	private static void writeLockTest() {
		TestWorker worker = new TestWorker() {
			@Override
			public void exe() {
				System.out.println("..........start write ....");
				writeLock.lock();
				try {
					System.out.println("enter write ....");
					Thread.sleep(2000);
					System.out.println("exit write ....");
				} catch (Exception e) {
				} finally {
					writeLock.unlock();
				}
			}
		};
		worker.printTakeTimeMutil(2);
	}

	private static void readLockTest() {
		TestWorker worker = new TestWorker() {
			@Override
			public void exe() {
				System.out.println("..........start read ....");
				readLock.lock();
				try {
					System.out.println("enter read ....");
					Thread.sleep(1000);
					System.out.println("exit read ....");
				} catch (Exception e) {
				} finally {
					readLock.unlock();
				}
			}
		};
		worker.printTakeTimeMutil(5);
	}

}

..........start write ....

..........start read ....

enter write ....

..........start read ....

..........start write ....

..........start read ....

..........start read ....

..........start read ....

exit write ....

enter read ....

enter read ....

exit read ....

exit read ....

enter write ....

exit write ....

enter read ....

enter read ....

enter read ....

exit read ....

exit read ....

exit read ....

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
代码下载:完整代码,可直接运行 ;运行版本:2022a或2019b或2014a;若运行有问题,可私信博主; **仿真咨询 1 各类智能优化算法改进及应用** 生产调度、经济调度、装配线调度、充电优化、车间调度、发车优化、水库调度、三维装箱、物流选址、货位优化、公交排班优化、充电桩布局优化、车间布局优化、集装箱船配载优化、水泵组合优化、解医疗资源分配优化、设施布局优化、可视域基站和无人机选址优化 **2 机器学习和深度学习方面** 卷积神经网络(CNN)、LSTM、支持向量机(SVM)、最小二乘支持向量机(LSSVM)、极限学习机(ELM)、核极限学习机(KELM)、BP、RBF、宽度学习、DBN、RF、RBF、DELM、XGBOOST、TCN实现风电预测、光伏预测、电池寿命预测、辐射源识别、交通流预测、负荷预测、股价预测、PM2.5浓度预测、电池健康状态预测、水体光学参数反演、NLOS信号识别、地铁停车精准预测、变压器故障诊断 **3 图像处理方面** 图像识别、图像分割、图像检测、图像隐藏、图像配准、图像拼接、图像融合、图像增强、图像压缩感知 **4 路径规划方面** 旅行商问题(TSP)、车辆路径问题(VRP、MVRP、CVRP、VRPTW等)、无人机三维路径规划、无人机协同、无人机编队、机器人路径规划、栅格地图路径规划、多式联运运输问题、车辆协同无人机路径规划、天线线性阵列分布优化、车间布局优化 **5 无人机应用方面** 无人机路径规划、无人机控制、无人机编队、无人机协同、无人机任务分配 **6 无线传感器定位及布局方面** 传感器部署优化、通信协议优化、路由优化、目标定位优化、Dv-Hop定位优化、Leach协议优化、WSN覆盖优化、组播优化、RSSI定位优化 **7 信号处理方面** 信号识别、信号加密、信号去噪、信号增强、雷达信号处理、信号水印嵌入提取、肌电信号、脑电信号、信号配时优化 **8 电力系统方面** 微电网优化、无功优化、配电网重构、储能配置 **9 元胞自动机方面** 交通流 人群疏散 病毒扩散 晶体生长 **10 雷达方面** 卡尔曼滤波跟踪、航迹关联、航迹融合

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值