public interface DistributedLock {
 
   /**獲取鎖，如果沒(méi)有得到就等待*/
   public void acquire() throws Exception;
 
   /**
   * 獲取鎖，直到超時(shí)
   * @param time超時(shí)時(shí)間
   * @param unit time參數(shù)的單位
   * @return是否獲取到鎖
   * @throws Exception
   */
   public boolean acquire (long time, TimeUnit unit) throws Exception;
 
   /**
    * 釋放鎖
    * @throws Exception
    */
   public void release() throws Exception;
}

/**鎖接口的具體實(shí)現(xiàn)，主要借助于繼承的父類(lèi)BaseDistributedLock來(lái)實(shí)現(xiàn)的接口方法
 * 該父類(lèi)是基于Zookeeper實(shí)現(xiàn)分布式鎖的具體細(xì)節(jié)實(shí)現(xiàn)*/
public class SimpleDistributedLockMutex extends BaseDistributedLock implements DistributedLock {
  /*用于保存Zookeeper中實(shí)現(xiàn)分布式鎖的節(jié)點(diǎn)，如名稱(chēng)為locker：/locker，
 *該節(jié)點(diǎn)應(yīng)該是持久節(jié)點(diǎn)，在該節(jié)點(diǎn)下面創(chuàng)建臨時(shí)順序節(jié)點(diǎn)來(lái)實(shí)現(xiàn)分布式鎖 */
 private final String basePath;
 
 /*鎖名稱(chēng)前綴，locker下創(chuàng)建的順序節(jié)點(diǎn)例如都以lock-開(kāi)頭，這樣便于過(guò)濾無(wú)關(guān)節(jié)點(diǎn)
 *這樣創(chuàng)建后的節(jié)點(diǎn)類(lèi)似：lock-00000001，lock-000000002*/
 private staticfinal String LOCK_NAME ="lock-";
 
 /*用于保存某個(gè)客戶(hù)端在locker下面創(chuàng)建成功的順序節(jié)點(diǎn)，用于后續(xù)相關(guān)操作使用（如判斷）*/
 private String ourLockPath;
 
 /**
 * 用于獲取鎖資源，通過(guò)父類(lèi)的獲取鎖方法來(lái)獲取鎖
 * @param time獲取鎖的超時(shí)時(shí)間
 * @param unit time的時(shí)間單位
 * @return是否獲取到鎖
 * @throws Exception
 */
 private boolean internalLock (long time, TimeUnit unit) throws Exception {
  //如果ourLockPath不為空則認(rèn)為獲取到了鎖，具體實(shí)現(xiàn)細(xì)節(jié)見(jiàn)attemptLock的實(shí)現(xiàn)
  ourLockPath = attemptLock(time, unit);
  return ourLockPath !=null;
 }
 
 /**
  * 傳入Zookeeper客戶(hù)端連接對(duì)象，和basePath
  * @param client Zookeeper客戶(hù)端連接對(duì)象
  * @param basePath basePath是一個(gè)持久節(jié)點(diǎn)
  */
 public SimpleDistributedLockMutex(ZkClientExt client, String basePath){
  /*調(diào)用父類(lèi)的構(gòu)造方法在Zookeeper中創(chuàng)建basePath節(jié)點(diǎn)，并且為basePath節(jié)點(diǎn)子節(jié)點(diǎn)設(shè)置前綴
  *同時(shí)保存basePath的引用給當(dāng)前類(lèi)屬性*/
  super(client,basePath,LOCK_NAME);
  this.basePath = basePath;
 }
 
 /**獲取鎖，直到超時(shí)，超時(shí)后拋出異常*/
 public void acquire() throws Exception {
  //-1表示不設(shè)置超時(shí)時(shí)間，超時(shí)由Zookeeper決定
  if (!internalLock(-1,null)){
   throw new IOException("連接丟失!在路徑:'"+basePath+"'下不能獲取鎖!");
  }
 }
 
 /**
 * 獲取鎖，帶有超時(shí)時(shí)間
 */
 public boolean acquire(long time, TimeUnit unit) throws Exception {
  return internalLock(time, unit);
 }
 
 /**釋放鎖*/
 public void release()throws Exception {
  releaseLock(ourLockPath);
 }
}

public class BaseDistributedLock {
 
 private final ZkClientExt client;
 private final String path;
 private final String basePath;
 private final String lockName;
 private static final Integer MAX_RETRY_COUNT = 10;
 
 public BaseDistributedLock(ZkClientExt client, String path, String lockName){
 this.client = client;
 this.basePath = path;
 this.path = path.concat("/").concat(lockName); 
 this.lockName = lockName;
 }
 
 private void deleteOurPath(String ourPath) throws Exception{
 client.delete(ourPath);
 }
 
 private String createLockNode(ZkClient client, String path) throws Exception{
 return client.createEphemeralSequential(path, null);
 }
 
 /**
 * 獲取鎖的核心方法
 * @param startMillis
 * @param millisToWait
 * @param ourPath
 * @return
 * @throws Exception
 */
 private boolean waitToLock(long startMillis, Long millisToWait, String ourPath) throws Exception{
 
 boolean haveTheLock = false;
 boolean doDelete = false;
 
 try{
  while ( !haveTheLock ) {
  //該方法實(shí)現(xiàn)獲取locker節(jié)點(diǎn)下的所有順序節(jié)點(diǎn)，并且從小到大排序 
  List<String> children = getSortedChildren();
  String sequenceNodeName = ourPath.substring(basePath.length()+1);
  
  //計(jì)算剛才客戶(hù)端創(chuàng)建的順序節(jié)點(diǎn)在locker的所有子節(jié)點(diǎn)中排序位置，如果是排序?yàn)?，則表示獲取到了鎖
  int ourIndex = children.indexOf(sequenceNodeName);
  
  /*如果在getSortedChildren中沒(méi)有找到之前創(chuàng)建的[臨時(shí)]順序節(jié)點(diǎn)，這表示可能由于網(wǎng)絡(luò)閃斷而導(dǎo)致
   *Zookeeper認(rèn)為連接斷開(kāi)而刪除了我們創(chuàng)建的節(jié)點(diǎn)，此時(shí)需要拋出異常，讓上一級(jí)去處理
   *上一級(jí)的做法是捕獲該異常，并且執(zhí)行重試指定的次數(shù) 見(jiàn)后面的 attemptLock方法 */
  if ( ourIndex<0 ){
   throw new ZkNoNodeException("節(jié)點(diǎn)沒(méi)有找到: " + sequenceNodeName);
  }

  //如果當(dāng)前客戶(hù)端創(chuàng)建的節(jié)點(diǎn)在locker子節(jié)點(diǎn)列表中位置大于0，表示其它客戶(hù)端已經(jīng)獲取了鎖
  //此時(shí)當(dāng)前客戶(hù)端需要等待其它客戶(hù)端釋放鎖，
  boolean isGetTheLock = ourIndex == 0;
  
  //如何判斷其它客戶(hù)端是否已經(jīng)釋放了鎖？從子節(jié)點(diǎn)列表中獲取到比自己次小的哪個(gè)節(jié)點(diǎn)，并對(duì)其建立監(jiān)聽(tīng)
  String pathToWatch = isGetTheLock ? null : children.get(ourIndex - 1);

  if ( isGetTheLock ){
   haveTheLock = true;
  }else{
   //如果次小的節(jié)點(diǎn)被刪除了，則表示當(dāng)前客戶(hù)端的節(jié)點(diǎn)應(yīng)該是最小的了，所以使用CountDownLatch來(lái)實(shí)現(xiàn)等待
   String previousSequencePath = basePath .concat( "/" ) .concat( pathToWatch );
   final CountDownLatch latch = new CountDownLatch(1);
   final IZkDataListener previousListener = new IZkDataListener() {
   
   //次小節(jié)點(diǎn)刪除事件發(fā)生時(shí)，讓countDownLatch結(jié)束等待
   //此時(shí)還需要重新讓程序回到while，重新判斷一次！
   public void handleDataDeleted(String dataPath) throws Exception {
    latch.countDown();  
   }
   
   public void handleDataChange(String dataPath, Object data) throws Exception {
    // ignore     
   }
   };

   try{   
   //如果節(jié)點(diǎn)不存在會(huì)出現(xiàn)異常
   client.subscribeDataChanges(previousSequencePath, previousListener);
   
   if ( millisToWait != null ){
    millisToWait -= (System.currentTimeMillis() - startMillis);
    startMillis = System.currentTimeMillis();
    if ( millisToWait <= 0 ){
    doDelete = true; // timed out - delete our node
    break;
    }

    latch.await(millisToWait, TimeUnit.MICROSECONDS);
   }else{
    latch.await();
   }
   
   }catch ( ZkNoNodeException e ){
   //ignore
   }finally{
   client.unsubscribeDataChanges(previousSequencePath, previousListener);
   }
  }
  }
 }catch ( Exception e ){
  //發(fā)生異常需要?jiǎng)h除節(jié)點(diǎn)
  doDelete = true;
  throw e;
  
 }finally{
  //如果需要?jiǎng)h除節(jié)點(diǎn)
  if ( doDelete ){
  deleteOurPath(ourPath);
  }
 }
 return haveTheLock;
 } 
 
 private String getLockNodeNumber(String str, String lockName) {
 int index = str.lastIndexOf(lockName);
 if ( index >= 0 ){
  index += lockName.length();
  return index <= str.length() ? str.substring(index) : "";
 }
 return str;
 }
 
 private List<String> getSortedChildren() throws Exception {
 try{
  List<String> children = client.getChildren(basePath);
  Collections.sort(
  children,
  new Comparator<String>(){
   public int compare(String lhs, String rhs){
   return getLockNodeNumber(lhs, lockName).compareTo(getLockNodeNumber(rhs, lockName));
   }
  }
  );
  return children;
  
 }catch(ZkNoNodeException e){
  client.createPersistent(basePath, true);
  return getSortedChildren();
 }
 }
 
 
 protected void releaseLock(String lockPath) throws Exception{
 deleteOurPath(lockPath); 
 }
 
 
 protected String attemptLock(long time, TimeUnit unit) throws Exception{
 final long startMillis = System.currentTimeMillis();
 final Long millisToWait = (unit != null) ? unit.toMillis(time) : null;

 String  ourPath = null;
 boolean  hasTheLock = false;
 boolean  isDone = false;
 int  retryCount = 0;
 
 //網(wǎng)絡(luò)閃斷需要重試一試
 while ( !isDone ){
  isDone = true;

  try{
  //createLockNode用于在locker（basePath持久節(jié)點(diǎn)）下創(chuàng)建客戶(hù)端要獲取鎖的[臨時(shí)]順序節(jié)點(diǎn)
  ourPath = createLockNode(client, path);
  /**
   * 該方法用于判斷自己是否獲取到了鎖，即自己創(chuàng)建的順序節(jié)點(diǎn)在locker的所有子節(jié)點(diǎn)中是否最小
   * 如果沒(méi)有獲取到鎖，則等待其它客戶(hù)端鎖的釋放，并且稍后重試直到獲取到鎖或者超時(shí)
   */
  hasTheLock = waitToLock(startMillis, millisToWait, ourPath);
  
  }catch ( ZkNoNodeException e ){
  if ( retryCount++ < MAX_RETRY_COUNT ){
   isDone = false;
  }else{
   throw e;
  }
  }
 }
 
 if ( hasTheLock ){
  return ourPath;
 }
 
 return null；
｝