| /* |
| * 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.ignite.internal.processors.cache; |
| |
| import java.util.Deque; |
| import java.util.HashMap; |
| import java.util.Iterator; |
| import java.util.LinkedList; |
| import java.util.Map; |
| import java.util.concurrent.locks.ReentrantLock; |
| import org.apache.ignite.internal.IgniteInternalFuture; |
| import org.apache.ignite.internal.processors.affinity.AffinityTopologyVersion; |
| import org.apache.ignite.internal.processors.cache.transactions.IgniteTxKey; |
| import org.apache.ignite.internal.processors.cache.version.GridCacheVersion; |
| import org.apache.ignite.internal.util.future.GridFutureAdapter; |
| import org.apache.ignite.internal.util.tostring.GridToStringExclude; |
| import org.apache.ignite.internal.util.tostring.GridToStringInclude; |
| import org.apache.ignite.internal.util.typedef.F; |
| import org.apache.ignite.internal.util.typedef.P1; |
| import org.apache.ignite.internal.util.typedef.internal.S; |
| import org.jetbrains.annotations.Nullable; |
| |
| /** |
| * Collection of near local locks acquired by a thread on one topology version. |
| */ |
| public class GridCacheExplicitLockSpan extends ReentrantLock { |
| /** */ |
| private static final long serialVersionUID = 0L; |
| |
| /** Topology snapshot. */ |
| @GridToStringInclude |
| private final AffinityTopologyVersion topVer; |
| |
| /** Pending candidates. */ |
| @GridToStringInclude |
| private final Map<IgniteTxKey, Deque<GridCacheMvccCandidate>> cands = new HashMap<>(); |
| |
| /** Span lock release future. */ |
| @GridToStringExclude |
| private final GridFutureAdapter<Object> releaseFut; |
| |
| /** |
| * @param topVer Topology version. |
| * @param cand Candidate. |
| */ |
| public GridCacheExplicitLockSpan(final AffinityTopologyVersion topVer, final GridCacheMvccCandidate cand) { |
| this.topVer = topVer; |
| |
| releaseFut = new GridFutureAdapter<Object>() { |
| @Override public String toString() { |
| return "ExplicitLockSpan [topVer=" + topVer + ", firstCand=" + cand + "]"; |
| } |
| }; |
| |
| ensureDeque(cand.key()).addFirst(cand); |
| } |
| |
| /** |
| * Adds candidate to a lock span. |
| * |
| * @param topVer Topology snapshot for which candidate is added. |
| * @param cand Candidate to add. |
| * @return {@code True} if candidate was added, {@code false} if this span is empty and |
| * new span should be created. |
| */ |
| public boolean addCandidate(AffinityTopologyVersion topVer, GridCacheMvccCandidate cand) { |
| lock(); |
| |
| try { |
| if (cands.isEmpty()) |
| return false; |
| |
| assert this.topVer.equals(topVer); |
| |
| Deque<GridCacheMvccCandidate> deque = ensureDeque(cand.key()); |
| |
| GridCacheMvccCandidate old = F.first(deque); |
| |
| deque.add(cand); |
| |
| if (old != null && old.owner()) |
| cand.setOwner(); |
| |
| return true; |
| } |
| finally { |
| unlock(); |
| } |
| } |
| |
| /** |
| * Removes candidate from this lock span. |
| * |
| * @param cand Candidate to remove. |
| * @return {@code True} if span is empty and should be removed, {@code false} otherwise. |
| */ |
| public boolean removeCandidate(GridCacheMvccCandidate cand) { |
| lock(); |
| |
| try { |
| Deque<GridCacheMvccCandidate> deque = cands.get(cand.key()); |
| |
| if (deque != null) { |
| assert !deque.isEmpty(); |
| |
| if (deque.peekFirst().equals(cand)) { |
| deque.removeFirst(); |
| |
| if (deque.isEmpty()) |
| cands.remove(cand.key()); |
| } |
| } |
| |
| boolean empty = cands.isEmpty(); |
| |
| if (empty) |
| releaseFut.onDone(); |
| |
| return empty; |
| } |
| finally { |
| unlock(); |
| } |
| } |
| |
| /** |
| * Removes lock by key and optional version. |
| * |
| * @param key Key. |
| * @param ver Version (or {@code null} if any candidate should be removed.) |
| * @return Removed candidate if matches given parameters. |
| */ |
| public GridCacheMvccCandidate removeCandidate(IgniteTxKey key, @Nullable GridCacheVersion ver) { |
| lock(); |
| |
| try { |
| Deque<GridCacheMvccCandidate> deque = cands.get(key); |
| |
| GridCacheMvccCandidate cand = null; |
| |
| if (deque != null) { |
| assert !deque.isEmpty(); |
| |
| GridCacheMvccCandidate first = deque.peekFirst(); |
| |
| if (ver == null || first.version().equals(ver)) { |
| GridCacheMvccCandidate reentry = first.unenter(); |
| |
| if (reentry != null) { |
| assert reentry.reentry() : reentry; |
| |
| boolean rmvd = false; |
| |
| Iterator<GridCacheMvccCandidate> it = deque.iterator(); |
| |
| while (it.hasNext()) { |
| if (it.next() == reentry) { |
| it.remove(); |
| |
| rmvd = true; |
| |
| break; |
| } |
| } |
| |
| assert rmvd : reentry; |
| |
| cand = reentry; |
| } |
| else |
| cand = deque.removeFirst(); |
| |
| if (deque.isEmpty()) |
| cands.remove(cand.key()); |
| } |
| } |
| |
| boolean empty = cands.isEmpty(); |
| |
| if (empty) |
| releaseFut.onDone(); |
| |
| return cand; |
| } |
| finally { |
| unlock(); |
| } |
| } |
| |
| /** |
| * @return {@code True} if span is empty and candidates cannot be added anymore. |
| */ |
| public boolean isEmpty() { |
| lock(); |
| |
| try { |
| return cands.isEmpty(); |
| } |
| finally { |
| unlock(); |
| } |
| } |
| |
| /** |
| * Marks all candidates added for given key as owned. |
| * |
| * @param key Key. |
| */ |
| public void markOwned(IgniteTxKey key) { |
| lock(); |
| |
| try { |
| Deque<GridCacheMvccCandidate> deque = cands.get(key); |
| |
| assert deque != null; |
| |
| for (GridCacheMvccCandidate cand : deque) |
| cand.setOwner(); |
| } |
| finally { |
| unlock(); |
| } |
| } |
| |
| /** |
| * Gets explicit lock candidate for given key. |
| * |
| * @param key Key to lookup. |
| * @param ver Version to lookup (if {@code null} - return any). |
| * @return Last added explicit lock candidate, if any, or {@code null}. |
| */ |
| @Nullable public GridCacheMvccCandidate candidate(IgniteTxKey key, @Nullable final GridCacheVersion ver) { |
| lock(); |
| |
| try { |
| Deque<GridCacheMvccCandidate> deque = cands.get(key); |
| |
| if (deque != null) { |
| assert !deque.isEmpty(); |
| |
| return ver == null ? deque.peekFirst() : F.find(deque, null, new P1<GridCacheMvccCandidate>() { |
| @Override public boolean apply(GridCacheMvccCandidate cand) { |
| return cand.version().equals(ver); |
| } |
| }); |
| } |
| |
| return null; |
| } |
| finally { |
| unlock(); |
| } |
| } |
| |
| /** |
| * Gets actual topology snapshot for thread lock span. |
| * |
| * @return Topology snapshot or {@code null} if candidate list is empty. |
| */ |
| @Nullable public AffinityTopologyVersion topologyVersion() { |
| return releaseFut.isDone() ? null : topVer; |
| } |
| |
| /** |
| * Gets span release future. Future is completed when last lock is released. |
| * |
| * @return Release future. |
| */ |
| public IgniteInternalFuture<Object> releaseFuture() { |
| return releaseFut; |
| } |
| |
| /** |
| * Gets deque from candidate map and adds it if it does not exist. |
| * |
| * @param key Key to look up. |
| * @return Deque. |
| */ |
| private Deque<GridCacheMvccCandidate> ensureDeque(IgniteTxKey key) { |
| Deque<GridCacheMvccCandidate> deque = cands.get(key); |
| |
| if (deque == null) { |
| deque = new LinkedList<>(); |
| |
| cands.put(key, deque); |
| } |
| |
| return deque; |
| } |
| |
| /** {@inheritDoc} */ |
| @Override public String toString() { |
| lock(); |
| |
| try { |
| return S.toString(GridCacheExplicitLockSpan.class, this); |
| } |
| finally { |
| unlock(); |
| } |
| } |
| } |