Curator实现分布式锁的基本原理-InterProcessMutex.internalLock

private boolean internalLock(long time, TimeUnit unit) throws Exception{ 
	Thread currentThread = Thread.currentThread(); 
	LockData lockData = threadData.get(currentThread); 
	if ( lockData != null ){ 
		// 实现可重入 
		// 同一线程再次acquire，首先判断当前的映射表内（threadData）是否有该线程的锁信息，如果有则原子+1，然后返回  
		lockData.lockCount.incrementAndGet();  
		return true;  
	} 
	 
	// 映射表内没有对应的锁信息，尝试通过LockInternals获取锁 
	String lockPath = internals.attemptLock(time, unit, getLockNodeBytes()); 
	if ( lockPath != null ){ 
		// 成功获取锁，记录信息到映射表 
		LockData newLockData = new LockData(currentThread, lockPath); 
		threadData.put(currentThread, newLockData); 
		return true; 
	} 
	return false; 
} 


// 映射表 
// 记录线程与锁信息的映射关系 
private final ConcurrentMap<Thread, LockData> threadData = Maps.newConcurrentMap(); 
// 锁信息 
// Zookeeper中一个临时顺序节点对应一个“锁”，但让锁生效激活需要排队（公平锁），下面会继续分析 
private static class LockData{ 
	final Thread owningThread; 
	final String lockPath; 
	final AtomicInteger lockCount = new AtomicInteger(1); // 分布式锁重入次数 
	private LockData(Thread owningThread, String lockPath){ 
		this.owningThread = owningThread; 
		this.lockPath = lockPath; 
	} 
}