/*
 * Licensed to the Apache Software Foundation (ASF) under one or more
 * contributor license agreements.  See the NOTICE file distributed with
 * this work for additional information regarding copyright ownership.
 * The ASF licenses this file to You 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 org.apache.accumulo.tserver;

import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Objects;
import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.locks.ReentrantLock;

import org.apache.accumulo.core.data.ArrayByteSequence;
import org.apache.accumulo.core.data.ByteSequence;
import org.apache.accumulo.core.dataImpl.KeyExtent;
import org.apache.accumulo.tserver.ConditionalMutationSet.DeferFilter;
import org.apache.accumulo.tserver.data.ServerConditionalMutation;

import com.google.common.base.Preconditions;

class RowLocks {

  private final Map<ByteSequence,RowLock> rowLocks = new ConcurrentHashMap<>();

  static class RowLock {
    ReentrantLock rlock;
    int count;
    ByteSequence rowSeq;

    RowLock(ReentrantLock rlock, ByteSequence rowSeq) {
      this.rlock = rlock;
      this.count = 1;
      this.rowSeq = rowSeq;
    }

    public boolean tryLock() {
      return rlock.tryLock();
    }

    public void lock() {
      rlock.lock();
    }

    public void unlock() {
      rlock.unlock();
    }
  }

  private RowLock getRowLock(ArrayByteSequence rowSeq) {
    return rowLocks.compute(rowSeq, (key, value) -> {
      if (value == null) {
        return new RowLock(new ReentrantLock(), rowSeq);
      }
      value.count++;
      return value;
    });
  }

  private void returnRowLock(RowLock lock) {
    Objects.requireNonNull(lock);
    rowLocks.compute(lock.rowSeq, (key, value) -> {
      Preconditions.checkState(value == lock);
      Preconditions.checkState(value.count > 0);
      return (--value.count > 0) ? value : null;
    });
  }

  List<RowLock> acquireRowlocks(Map<KeyExtent,List<ServerConditionalMutation>> updates,
      Map<KeyExtent,List<ServerConditionalMutation>> deferred) {
    ArrayList<RowLock> locks = new ArrayList<>();

    for (List<ServerConditionalMutation> scml : updates.values()) {
      for (ServerConditionalMutation scm : scml) {
        locks.add(getRowLock(new ArrayByteSequence(scm.getRow())));
      }
    }

    HashSet<ByteSequence> rowsNotLocked = null;

    if (locks.size() > 1) {
      // Assuming mutations are in sorted order which avoids deadlock. Acquire as many locks as
      // possible, not blocking on rows that are already locked.
      for (RowLock rowLock : locks) {
        if (!rowLock.tryLock()) {
          if (rowsNotLocked == null)
            rowsNotLocked = new HashSet<>();
          rowsNotLocked.add(rowLock.rowSeq);
        }
      }
    } else {
      // if there is only one lock, then wait for it
      locks.get(0).lock();
    }

    if (rowsNotLocked != null) {

      final HashSet<ByteSequence> rnlf = rowsNotLocked;
      // assume will get locks needed, do something expensive otherwise
      ConditionalMutationSet.defer(updates, deferred, new DeferFilter() {
        @Override
        public void defer(List<ServerConditionalMutation> scml,
            List<ServerConditionalMutation> okMutations, List<ServerConditionalMutation> deferred) {
          for (ServerConditionalMutation scm : scml) {
            if (rnlf.contains(new ArrayByteSequence(scm.getRow())))
              deferred.add(scm);
            else
              okMutations.add(scm);

          }
        }
      });

      ArrayList<RowLock> filteredLocks = new ArrayList<>();
      ArrayList<RowLock> locksToReturn = new ArrayList<>();
      for (RowLock rowLock : locks) {
        if (rowsNotLocked.contains(rowLock.rowSeq)) {
          locksToReturn.add(rowLock);
        } else {
          filteredLocks.add(rowLock);
        }
      }

      for (RowLock rowLock : locksToReturn) {
        returnRowLock(rowLock);
      }

      locks = filteredLocks;
    }
    return locks;
  }

  void releaseRowLocks(List<RowLock> locks) {
    for (RowLock rowLock : locks) {
      rowLock.unlock();
    }

    for (RowLock rowLock : locks) {
      returnRowLock(rowLock);
    }
  }

}

@@ -1417,16 +1417,404 @@
 ocks %7B%0A%0A
+  // The compute function in Concurrent Hash Map supports atomic execution of the remapping function%0A  // and will only execute it once. Properly computing the reference counts relies on this specific%0A  // behavior. Not all concurrent map implementations have the desired behavior. For example%0A  // ConcurrentSkipListMap.compute is not atomic and may execute the function multiple times.%0A
   privat

update row lock comments #1364 (#1380)