2 * Copyright (c) 2015 Cisco Systems, Inc. and others. All rights reserved.
4 * This program and the accompanying materials are made available under the
5 * terms of the Eclipse Public License v1.0 which accompanies this distribution,
6 * and is available at http://www.eclipse.org/legal/epl-v10.html
8 package org.opendaylight.controller.cluster.datastore;
10 import static akka.actor.ActorRef.noSender;
11 import static com.google.common.base.Preconditions.checkState;
12 import static com.google.common.base.Verify.verify;
13 import static com.google.common.base.Verify.verifyNotNull;
14 import static java.util.Objects.requireNonNull;
15 import static java.util.Objects.requireNonNullElse;
17 import akka.actor.ActorRef;
18 import akka.util.Timeout;
19 import com.google.common.annotations.VisibleForTesting;
20 import com.google.common.base.Stopwatch;
21 import com.google.common.collect.ImmutableList;
22 import com.google.common.collect.ImmutableMap;
23 import com.google.common.collect.ImmutableMap.Builder;
24 import com.google.common.collect.Iterables;
25 import com.google.common.primitives.UnsignedLong;
26 import com.google.common.util.concurrent.FutureCallback;
27 import edu.umd.cs.findbugs.annotations.SuppressFBWarnings;
29 import java.io.IOException;
30 import java.util.ArrayDeque;
31 import java.util.ArrayList;
32 import java.util.Collection;
33 import java.util.Collections;
34 import java.util.Deque;
35 import java.util.HashMap;
36 import java.util.Iterator;
38 import java.util.Map.Entry;
39 import java.util.Optional;
40 import java.util.OptionalLong;
41 import java.util.Queue;
42 import java.util.SortedSet;
43 import java.util.concurrent.TimeUnit;
44 import java.util.concurrent.TimeoutException;
45 import java.util.function.Consumer;
46 import java.util.function.Function;
47 import java.util.function.UnaryOperator;
48 import org.eclipse.jdt.annotation.NonNull;
49 import org.eclipse.jdt.annotation.Nullable;
50 import org.opendaylight.controller.cluster.access.concepts.LocalHistoryIdentifier;
51 import org.opendaylight.controller.cluster.access.concepts.TransactionIdentifier;
52 import org.opendaylight.controller.cluster.datastore.DataTreeCohortActorRegistry.CohortRegistryCommand;
53 import org.opendaylight.controller.cluster.datastore.ShardDataTreeCohort.State;
54 import org.opendaylight.controller.cluster.datastore.node.utils.transformer.ReusableNormalizedNodePruner;
55 import org.opendaylight.controller.cluster.datastore.persisted.AbortTransactionPayload;
56 import org.opendaylight.controller.cluster.datastore.persisted.AbstractIdentifiablePayload;
57 import org.opendaylight.controller.cluster.datastore.persisted.CloseLocalHistoryPayload;
58 import org.opendaylight.controller.cluster.datastore.persisted.CommitTransactionPayload;
59 import org.opendaylight.controller.cluster.datastore.persisted.CreateLocalHistoryPayload;
60 import org.opendaylight.controller.cluster.datastore.persisted.DataTreeCandidateInputOutput.DataTreeCandidateWithVersion;
61 import org.opendaylight.controller.cluster.datastore.persisted.MetadataShardDataTreeSnapshot;
62 import org.opendaylight.controller.cluster.datastore.persisted.PayloadVersion;
63 import org.opendaylight.controller.cluster.datastore.persisted.PurgeLocalHistoryPayload;
64 import org.opendaylight.controller.cluster.datastore.persisted.PurgeTransactionPayload;
65 import org.opendaylight.controller.cluster.datastore.persisted.ShardDataTreeSnapshot;
66 import org.opendaylight.controller.cluster.datastore.persisted.ShardDataTreeSnapshotMetadata;
67 import org.opendaylight.controller.cluster.datastore.persisted.ShardSnapshotState;
68 import org.opendaylight.controller.cluster.datastore.persisted.SkipTransactionsPayload;
69 import org.opendaylight.controller.cluster.datastore.utils.DataTreeModificationOutput;
70 import org.opendaylight.controller.cluster.datastore.utils.ImmutableUnsignedLongSet;
71 import org.opendaylight.controller.cluster.datastore.utils.PruningDataTreeModification;
72 import org.opendaylight.controller.cluster.raft.base.messages.InitiateCaptureSnapshot;
73 import org.opendaylight.controller.cluster.raft.protobuff.client.messages.Payload;
74 import org.opendaylight.mdsal.common.api.OptimisticLockFailedException;
75 import org.opendaylight.mdsal.common.api.TransactionCommitFailedException;
76 import org.opendaylight.mdsal.dom.api.DOMDataTreeChangeListener;
77 import org.opendaylight.yangtools.concepts.Identifier;
78 import org.opendaylight.yangtools.concepts.ListenerRegistration;
79 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier;
80 import org.opendaylight.yangtools.yang.data.api.schema.NormalizedNode;
81 import org.opendaylight.yangtools.yang.data.codec.binfmt.NormalizedNodeStreamVersion;
82 import org.opendaylight.yangtools.yang.data.tree.api.ConflictingModificationAppliedException;
83 import org.opendaylight.yangtools.yang.data.tree.api.DataTree;
84 import org.opendaylight.yangtools.yang.data.tree.api.DataTreeCandidate;
85 import org.opendaylight.yangtools.yang.data.tree.api.DataTreeCandidateTip;
86 import org.opendaylight.yangtools.yang.data.tree.api.DataTreeConfiguration;
87 import org.opendaylight.yangtools.yang.data.tree.api.DataTreeModification;
88 import org.opendaylight.yangtools.yang.data.tree.api.DataTreeSnapshot;
89 import org.opendaylight.yangtools.yang.data.tree.api.DataTreeTip;
90 import org.opendaylight.yangtools.yang.data.tree.api.DataValidationFailedException;
91 import org.opendaylight.yangtools.yang.data.tree.api.ModificationType;
92 import org.opendaylight.yangtools.yang.data.tree.api.TreeType;
93 import org.opendaylight.yangtools.yang.data.tree.impl.di.InMemoryDataTreeFactory;
94 import org.opendaylight.yangtools.yang.data.tree.spi.DataTreeCandidates;
95 import org.opendaylight.yangtools.yang.data.util.DataSchemaContextTree;
96 import org.opendaylight.yangtools.yang.model.api.EffectiveModelContext;
97 import org.opendaylight.yangtools.yang.model.api.SchemaContext;
98 import org.slf4j.Logger;
99 import org.slf4j.LoggerFactory;
100 import scala.concurrent.duration.FiniteDuration;
103 * Internal shard state, similar to a DOMStore, but optimized for use in the actor system, e.g. it does not expose
104 * public interfaces and assumes it is only ever called from a single thread.
107 * This class is not part of the API contract and is subject to change at any time. It is NOT thread-safe.
110 // non-final for mocking
111 public class ShardDataTree extends ShardDataTreeTransactionParent {
112 private static final class CommitEntry {
113 final SimpleShardDataTreeCohort cohort;
116 CommitEntry(final SimpleShardDataTreeCohort cohort, final long now) {
117 this.cohort = requireNonNull(cohort);
122 public String toString() {
123 return "CommitEntry [tx=" + cohort.getIdentifier() + ", state=" + cohort.getState() + "]";
127 private static final Timeout COMMIT_STEP_TIMEOUT = new Timeout(FiniteDuration.create(5, TimeUnit.SECONDS));
128 private static final Logger LOG = LoggerFactory.getLogger(ShardDataTree.class);
131 * Process this many transactions in a single batched run. If we exceed this limit, we need to schedule later
132 * execution to finish up the batch. This is necessary in case of a long list of transactions which progress
133 * immediately through their preCommit phase -- if that happens, their completion eats up stack frames and could
134 * result in StackOverflowError.
136 private static final int MAX_TRANSACTION_BATCH = 100;
138 private final Map<LocalHistoryIdentifier, ShardDataTreeTransactionChain> transactionChains = new HashMap<>();
139 private final DataTreeCohortActorRegistry cohortRegistry = new DataTreeCohortActorRegistry();
140 private final Deque<CommitEntry> pendingTransactions = new ArrayDeque<>();
141 private final Queue<CommitEntry> pendingCommits = new ArrayDeque<>();
142 private final Queue<CommitEntry> pendingFinishCommits = new ArrayDeque<>();
145 * Callbacks that need to be invoked once a payload is replicated.
147 private final Map<Payload, Runnable> replicationCallbacks = new HashMap<>();
149 private final ShardDataTreeChangeListenerPublisher treeChangeListenerPublisher;
150 private final Collection<ShardDataTreeMetadata<?>> metadata;
151 private final DataTree dataTree;
152 private final String logContext;
153 private final Shard shard;
154 private Runnable runOnPendingTransactionsComplete;
157 * Optimistic {@link DataTreeCandidate} preparation. Since our DataTree implementation is a
158 * {@link DataTree}, each {@link DataTreeCandidate} is also a {@link DataTreeTip}, e.g. another
159 * candidate can be prepared on top of it. They still need to be committed in sequence. Here we track the current
160 * tip of the data tree, which is the last DataTreeCandidate we have in flight, or the DataTree itself.
162 private DataTreeTip tip;
164 private SchemaContext schemaContext;
165 private DataSchemaContextTree dataSchemaContext;
167 private int currentTransactionBatch;
169 ShardDataTree(final Shard shard, final EffectiveModelContext schemaContext, final DataTree dataTree,
170 final ShardDataTreeChangeListenerPublisher treeChangeListenerPublisher,
171 final String logContext,
172 final ShardDataTreeMetadata<?>... metadata) {
173 this.dataTree = requireNonNull(dataTree);
174 updateSchemaContext(schemaContext);
176 this.shard = requireNonNull(shard);
177 this.treeChangeListenerPublisher = requireNonNull(treeChangeListenerPublisher);
178 this.logContext = requireNonNull(logContext);
179 this.metadata = ImmutableList.copyOf(metadata);
183 ShardDataTree(final Shard shard, final EffectiveModelContext schemaContext, final TreeType treeType,
184 final YangInstanceIdentifier root,
185 final ShardDataTreeChangeListenerPublisher treeChangeListenerPublisher,
186 final String logContext,
187 final ShardDataTreeMetadata<?>... metadata) {
188 this(shard, schemaContext, createDataTree(treeType, root), treeChangeListenerPublisher, logContext, metadata);
191 private static DataTree createDataTree(final TreeType treeType, final YangInstanceIdentifier root) {
192 final DataTreeConfiguration baseConfig = DataTreeConfiguration.getDefault(treeType);
193 return new InMemoryDataTreeFactory().create(new DataTreeConfiguration.Builder(baseConfig.getTreeType())
194 .setMandatoryNodesValidation(baseConfig.isMandatoryNodesValidationEnabled())
195 .setUniqueIndexes(baseConfig.isUniqueIndexEnabled())
201 public ShardDataTree(final Shard shard, final EffectiveModelContext schemaContext, final TreeType treeType) {
202 this(shard, schemaContext, treeType, YangInstanceIdentifier.empty(),
203 new DefaultShardDataTreeChangeListenerPublisher(""), "");
206 final String logContext() {
210 final long readTime() {
211 return shard.ticker().read();
214 final DataTree getDataTree() {
219 final SchemaContext getSchemaContext() {
220 return schemaContext;
223 final void updateSchemaContext(final @NonNull EffectiveModelContext newSchemaContext) {
224 dataTree.setEffectiveModelContext(newSchemaContext);
225 schemaContext = newSchemaContext;
226 dataSchemaContext = DataSchemaContextTree.from(newSchemaContext);
229 final void resetTransactionBatch() {
230 currentTransactionBatch = 0;
234 * Take a snapshot of current state for later recovery.
236 * @return A state snapshot
238 @NonNull ShardDataTreeSnapshot takeStateSnapshot() {
239 final NormalizedNode rootNode = dataTree.takeSnapshot().readNode(YangInstanceIdentifier.empty()).get();
240 final Builder<Class<? extends ShardDataTreeSnapshotMetadata<?>>, ShardDataTreeSnapshotMetadata<?>> metaBuilder =
241 ImmutableMap.builder();
243 for (ShardDataTreeMetadata<?> m : metadata) {
244 final ShardDataTreeSnapshotMetadata<?> meta = m.toSnapshot();
246 metaBuilder.put(meta.getType(), meta);
250 return new MetadataShardDataTreeSnapshot(rootNode, metaBuilder.build());
253 private boolean anyPendingTransactions() {
254 return !pendingTransactions.isEmpty() || !pendingCommits.isEmpty() || !pendingFinishCommits.isEmpty();
257 private void applySnapshot(final @NonNull ShardDataTreeSnapshot snapshot,
258 final UnaryOperator<DataTreeModification> wrapper) throws DataValidationFailedException {
259 final Stopwatch elapsed = Stopwatch.createStarted();
261 if (anyPendingTransactions()) {
262 LOG.warn("{}: applying state snapshot with pending transactions", logContext);
265 final Map<Class<? extends ShardDataTreeSnapshotMetadata<?>>, ShardDataTreeSnapshotMetadata<?>> snapshotMeta;
266 if (snapshot instanceof MetadataShardDataTreeSnapshot) {
267 snapshotMeta = ((MetadataShardDataTreeSnapshot) snapshot).getMetadata();
269 snapshotMeta = ImmutableMap.of();
272 for (ShardDataTreeMetadata<?> m : metadata) {
273 final ShardDataTreeSnapshotMetadata<?> s = snapshotMeta.get(m.getSupportedType());
281 final DataTreeModification unwrapped = dataTree.takeSnapshot().newModification();
282 final DataTreeModification mod = wrapper.apply(unwrapped);
283 // delete everything first
284 mod.delete(YangInstanceIdentifier.empty());
286 final Optional<NormalizedNode> maybeNode = snapshot.getRootNode();
287 if (maybeNode.isPresent()) {
288 // Add everything from the remote node back
289 mod.write(YangInstanceIdentifier.empty(), maybeNode.get());
293 dataTree.validate(unwrapped);
294 DataTreeCandidateTip candidate = dataTree.prepare(unwrapped);
295 dataTree.commit(candidate);
296 notifyListeners(candidate);
298 LOG.debug("{}: state snapshot applied in {}", logContext, elapsed);
302 * Apply a snapshot coming from the leader. This method assumes the leader and follower SchemaContexts match and
303 * does not perform any pruning.
305 * @param snapshot Snapshot that needs to be applied
306 * @throws DataValidationFailedException when the snapshot fails to apply
308 final void applySnapshot(final @NonNull ShardDataTreeSnapshot snapshot) throws DataValidationFailedException {
309 // TODO: we should be taking ShardSnapshotState here and performing forward-compatibility translation
310 applySnapshot(snapshot, UnaryOperator.identity());
314 * Apply a snapshot coming from recovery. This method does not assume the SchemaContexts match and performs data
315 * pruning in an attempt to adjust the state to our current SchemaContext.
317 * @param snapshot Snapshot that needs to be applied
318 * @throws DataValidationFailedException when the snapshot fails to apply
320 final void applyRecoverySnapshot(final @NonNull ShardSnapshotState snapshot) throws DataValidationFailedException {
321 // TODO: we should be able to reuse the pruner, provided we are not reentrant
322 final ReusableNormalizedNodePruner pruner = ReusableNormalizedNodePruner.forDataSchemaContext(
324 if (snapshot.needsMigration()) {
325 final ReusableNormalizedNodePruner uintPruner = pruner.withUintAdaption();
326 applySnapshot(snapshot.getSnapshot(),
327 delegate -> new PruningDataTreeModification.Proactive(delegate, dataTree, uintPruner));
329 applySnapshot(snapshot.getSnapshot(),
330 delegate -> new PruningDataTreeModification.Reactive(delegate, dataTree, pruner));
334 @SuppressWarnings("checkstyle:IllegalCatch")
335 private void applyRecoveryCandidate(final CommitTransactionPayload payload) throws IOException {
336 final Entry<TransactionIdentifier, DataTreeCandidateWithVersion> entry = payload.acquireCandidate();
337 final DataTreeModification unwrapped = dataTree.takeSnapshot().newModification();
338 final PruningDataTreeModification mod = createPruningModification(unwrapped,
339 NormalizedNodeStreamVersion.MAGNESIUM.compareTo(entry.getValue().getVersion()) > 0);
341 DataTreeCandidates.applyToModification(mod, entry.getValue().getCandidate());
343 LOG.trace("{}: Applying recovery modification {}", logContext, unwrapped);
346 dataTree.validate(unwrapped);
347 dataTree.commit(dataTree.prepare(unwrapped));
348 } catch (Exception e) {
349 File file = new File(System.getProperty("karaf.data", "."),
350 "failed-recovery-payload-" + logContext + ".out");
351 DataTreeModificationOutput.toFile(file, unwrapped);
352 throw new IllegalStateException(String.format(
353 "%s: Failed to apply recovery payload. Modification data was written to file %s",
354 logContext, file), e);
357 allMetadataCommittedTransaction(entry.getKey());
360 private PruningDataTreeModification createPruningModification(final DataTreeModification unwrapped,
361 final boolean uintAdapting) {
362 // TODO: we should be able to reuse the pruner, provided we are not reentrant
363 final ReusableNormalizedNodePruner pruner = ReusableNormalizedNodePruner.forDataSchemaContext(
365 return uintAdapting ? new PruningDataTreeModification.Proactive(unwrapped, dataTree, pruner.withUintAdaption())
366 : new PruningDataTreeModification.Reactive(unwrapped, dataTree, pruner);
370 * Apply a payload coming from recovery. This method does not assume the SchemaContexts match and performs data
371 * pruning in an attempt to adjust the state to our current SchemaContext.
373 * @param payload Payload
374 * @throws IOException when the snapshot fails to deserialize
375 * @throws DataValidationFailedException when the snapshot fails to apply
377 final void applyRecoveryPayload(final @NonNull Payload payload) throws IOException {
378 if (payload instanceof CommitTransactionPayload) {
379 applyRecoveryCandidate((CommitTransactionPayload) payload);
380 } else if (payload instanceof AbortTransactionPayload) {
381 allMetadataAbortedTransaction(((AbortTransactionPayload) payload).getIdentifier());
382 } else if (payload instanceof PurgeTransactionPayload) {
383 allMetadataPurgedTransaction(((PurgeTransactionPayload) payload).getIdentifier());
384 } else if (payload instanceof CreateLocalHistoryPayload) {
385 allMetadataCreatedLocalHistory(((CreateLocalHistoryPayload) payload).getIdentifier());
386 } else if (payload instanceof CloseLocalHistoryPayload) {
387 allMetadataClosedLocalHistory(((CloseLocalHistoryPayload) payload).getIdentifier());
388 } else if (payload instanceof PurgeLocalHistoryPayload) {
389 allMetadataPurgedLocalHistory(((PurgeLocalHistoryPayload) payload).getIdentifier());
390 } else if (payload instanceof SkipTransactionsPayload) {
391 allMetadataSkipTransactions((SkipTransactionsPayload) payload);
393 LOG.debug("{}: ignoring unhandled payload {}", logContext, payload);
397 private void applyReplicatedCandidate(final CommitTransactionPayload payload)
398 throws DataValidationFailedException, IOException {
399 final Entry<TransactionIdentifier, DataTreeCandidateWithVersion> entry = payload.acquireCandidate();
400 final TransactionIdentifier identifier = entry.getKey();
401 LOG.debug("{}: Applying foreign transaction {}", logContext, identifier);
403 final DataTreeModification mod = dataTree.takeSnapshot().newModification();
404 // TODO: check version here, which will enable us to perform forward-compatibility transformations
405 DataTreeCandidates.applyToModification(mod, entry.getValue().getCandidate());
408 LOG.trace("{}: Applying foreign modification {}", logContext, mod);
409 dataTree.validate(mod);
410 final DataTreeCandidate candidate = dataTree.prepare(mod);
411 dataTree.commit(candidate);
413 allMetadataCommittedTransaction(identifier);
414 notifyListeners(candidate);
418 * Apply a payload coming from the leader, which could actually be us. This method assumes the leader and follower
419 * SchemaContexts match and does not perform any pruning.
421 * @param identifier Payload identifier as returned from RaftActor
422 * @param payload Payload
423 * @throws IOException when the snapshot fails to deserialize
424 * @throws DataValidationFailedException when the snapshot fails to apply
426 final void applyReplicatedPayload(final Identifier identifier, final Payload payload) throws IOException,
427 DataValidationFailedException {
429 * This is a bit more involved than it needs to be due to to the fact we do not want to be touching the payload
430 * if we are the leader and it has originated with us.
432 * The identifier will only ever be non-null when we were the leader which achieved consensus. Unfortunately,
433 * though, this may not be the case anymore, as we are being called some time afterwards and we may not be
434 * acting in that capacity anymore.
436 * In any case, we know that this is an entry coming from replication, hence we can be sure we will not observe
437 * pre-Boron state -- which limits the number of options here.
439 if (payload instanceof CommitTransactionPayload) {
440 if (identifier == null) {
441 applyReplicatedCandidate((CommitTransactionPayload) payload);
443 verify(identifier instanceof TransactionIdentifier);
444 // if we did not track this transaction before, it means that it came from another leader and we are in
445 // the process of commiting it while in PreLeader state. That means that it hasnt yet been committed to
446 // the local DataTree and would be lost if it was only applied via payloadReplicationComplete().
447 if (!payloadReplicationComplete((TransactionIdentifier) identifier)) {
448 applyReplicatedCandidate((CommitTransactionPayload) payload);
452 // make sure acquireCandidate() is the last call touching the payload data as we want it to be GC-ed.
453 checkRootOverwrite(((CommitTransactionPayload) payload).acquireCandidate().getValue()
455 } else if (payload instanceof AbortTransactionPayload) {
456 if (identifier != null) {
457 payloadReplicationComplete((AbortTransactionPayload) payload);
459 allMetadataAbortedTransaction(((AbortTransactionPayload) payload).getIdentifier());
460 } else if (payload instanceof PurgeTransactionPayload) {
461 if (identifier != null) {
462 payloadReplicationComplete((PurgeTransactionPayload) payload);
464 allMetadataPurgedTransaction(((PurgeTransactionPayload) payload).getIdentifier());
465 } else if (payload instanceof CloseLocalHistoryPayload) {
466 if (identifier != null) {
467 payloadReplicationComplete((CloseLocalHistoryPayload) payload);
469 allMetadataClosedLocalHistory(((CloseLocalHistoryPayload) payload).getIdentifier());
470 } else if (payload instanceof CreateLocalHistoryPayload) {
471 if (identifier != null) {
472 payloadReplicationComplete((CreateLocalHistoryPayload)payload);
474 allMetadataCreatedLocalHistory(((CreateLocalHistoryPayload) payload).getIdentifier());
475 } else if (payload instanceof PurgeLocalHistoryPayload) {
476 if (identifier != null) {
477 payloadReplicationComplete((PurgeLocalHistoryPayload)payload);
479 allMetadataPurgedLocalHistory(((PurgeLocalHistoryPayload) payload).getIdentifier());
480 } else if (payload instanceof SkipTransactionsPayload) {
481 if (identifier != null) {
482 payloadReplicationComplete((SkipTransactionsPayload)payload);
484 allMetadataSkipTransactions((SkipTransactionsPayload) payload);
486 LOG.warn("{}: ignoring unhandled identifier {} payload {}", logContext, identifier, payload);
490 private void checkRootOverwrite(final DataTreeCandidate candidate) {
491 final DatastoreContext datastoreContext = shard.getDatastoreContext();
492 if (!datastoreContext.isSnapshotOnRootOverwrite()) {
496 if (!datastoreContext.isPersistent()) {
497 // FIXME: why don't we want a snapshot in non-persistent state?
501 // top level container ie "/"
502 if (candidate.getRootPath().isEmpty()
503 && candidate.getRootNode().getModificationType() == ModificationType.WRITE) {
504 LOG.debug("{}: shard root overwritten, enqueuing snapshot", logContext);
505 shard.self().tell(new InitiateCaptureSnapshot(), noSender());
509 private void replicatePayload(final Identifier id, final Payload payload, final @Nullable Runnable callback) {
510 if (callback != null) {
511 replicationCallbacks.put(payload, callback);
513 shard.persistPayload(id, payload, true);
516 private void payloadReplicationComplete(final AbstractIdentifiablePayload<?> payload) {
517 final Runnable callback = replicationCallbacks.remove(payload);
518 if (callback != null) {
519 LOG.debug("{}: replication of {} completed, invoking {}", logContext, payload.getIdentifier(), callback);
522 LOG.debug("{}: replication of {} has no callback", logContext, payload.getIdentifier());
526 private boolean payloadReplicationComplete(final TransactionIdentifier txId) {
527 final CommitEntry current = pendingFinishCommits.peek();
528 if (current == null) {
529 LOG.warn("{}: No outstanding transactions, ignoring consensus on transaction {}", logContext, txId);
530 allMetadataCommittedTransaction(txId);
534 if (!current.cohort.getIdentifier().equals(txId)) {
535 LOG.debug("{}: Head of pendingFinishCommits queue is {}, ignoring consensus on transaction {}", logContext,
536 current.cohort.getIdentifier(), txId);
537 allMetadataCommittedTransaction(txId);
541 finishCommit(current.cohort);
545 private void allMetadataAbortedTransaction(final TransactionIdentifier txId) {
546 for (ShardDataTreeMetadata<?> m : metadata) {
547 m.onTransactionAborted(txId);
551 private void allMetadataCommittedTransaction(final TransactionIdentifier txId) {
552 for (ShardDataTreeMetadata<?> m : metadata) {
553 m.onTransactionCommitted(txId);
557 private void allMetadataPurgedTransaction(final TransactionIdentifier txId) {
558 for (ShardDataTreeMetadata<?> m : metadata) {
559 m.onTransactionPurged(txId);
563 private void allMetadataCreatedLocalHistory(final LocalHistoryIdentifier historyId) {
564 for (ShardDataTreeMetadata<?> m : metadata) {
565 m.onHistoryCreated(historyId);
569 private void allMetadataClosedLocalHistory(final LocalHistoryIdentifier historyId) {
570 for (ShardDataTreeMetadata<?> m : metadata) {
571 m.onHistoryClosed(historyId);
575 private void allMetadataPurgedLocalHistory(final LocalHistoryIdentifier historyId) {
576 for (ShardDataTreeMetadata<?> m : metadata) {
577 m.onHistoryPurged(historyId);
581 private void allMetadataSkipTransactions(final SkipTransactionsPayload payload) {
582 final var historyId = payload.getIdentifier();
583 final var txIds = payload.getTransactionIds();
584 for (ShardDataTreeMetadata<?> m : metadata) {
585 m.onTransactionsSkipped(historyId, txIds);
590 * Create a transaction chain for specified history. Unlike {@link #ensureTransactionChain(LocalHistoryIdentifier)},
591 * this method is used for re-establishing state when we are taking over
593 * @param historyId Local history identifier
594 * @param closed True if the chain should be created in closed state (i.e. pending purge)
595 * @return Transaction chain handle
597 final ShardDataTreeTransactionChain recreateTransactionChain(final LocalHistoryIdentifier historyId,
598 final boolean closed) {
599 final ShardDataTreeTransactionChain ret = new ShardDataTreeTransactionChain(historyId, this);
600 final ShardDataTreeTransactionChain existing = transactionChains.putIfAbsent(historyId, ret);
601 checkState(existing == null, "Attempted to recreate chain %s, but %s already exists", historyId, existing);
605 final ShardDataTreeTransactionChain ensureTransactionChain(final LocalHistoryIdentifier historyId,
606 final @Nullable Runnable callback) {
607 ShardDataTreeTransactionChain chain = transactionChains.get(historyId);
609 chain = new ShardDataTreeTransactionChain(historyId, this);
610 transactionChains.put(historyId, chain);
611 replicatePayload(historyId, CreateLocalHistoryPayload.create(
612 historyId, shard.getDatastoreContext().getInitialPayloadSerializedBufferCapacity()), callback);
613 } else if (callback != null) {
620 final ReadOnlyShardDataTreeTransaction newReadOnlyTransaction(final TransactionIdentifier txId) {
621 shard.getShardMBean().incrementReadOnlyTransactionCount();
623 if (txId.getHistoryId().getHistoryId() == 0) {
624 return new ReadOnlyShardDataTreeTransaction(this, txId, dataTree.takeSnapshot());
627 return ensureTransactionChain(txId.getHistoryId(), null).newReadOnlyTransaction(txId);
630 final ReadWriteShardDataTreeTransaction newReadWriteTransaction(final TransactionIdentifier txId) {
631 shard.getShardMBean().incrementReadWriteTransactionCount();
633 if (txId.getHistoryId().getHistoryId() == 0) {
634 return new ReadWriteShardDataTreeTransaction(ShardDataTree.this, txId, dataTree.takeSnapshot()
638 return ensureTransactionChain(txId.getHistoryId(), null).newReadWriteTransaction(txId);
642 final void notifyListeners(final DataTreeCandidate candidate) {
643 treeChangeListenerPublisher.publishChanges(candidate);
647 * Immediately purge all state relevant to leader. This includes all transaction chains and any scheduled
648 * replication callbacks.
650 final void purgeLeaderState() {
651 for (ShardDataTreeTransactionChain chain : transactionChains.values()) {
655 transactionChains.clear();
656 replicationCallbacks.clear();
660 * Close a single transaction chain.
662 * @param id History identifier
663 * @param callback Callback to invoke upon completion, may be null
665 final void closeTransactionChain(final LocalHistoryIdentifier id, final @Nullable Runnable callback) {
666 if (commonCloseTransactionChain(id, callback)) {
667 replicatePayload(id, CloseLocalHistoryPayload.create(id,
668 shard.getDatastoreContext().getInitialPayloadSerializedBufferCapacity()), callback);
673 * Close a single transaction chain which is received through ask-based protocol. It does not keep a commit record.
675 * @param id History identifier
677 final void closeTransactionChain(final LocalHistoryIdentifier id) {
678 commonCloseTransactionChain(id, null);
681 private boolean commonCloseTransactionChain(final LocalHistoryIdentifier id, final @Nullable Runnable callback) {
682 final ShardDataTreeTransactionChain chain = transactionChains.get(id);
684 LOG.debug("{}: Closing non-existent transaction chain {}", logContext, id);
685 if (callback != null) {
696 * Purge a single transaction chain.
698 * @param id History identifier
699 * @param callback Callback to invoke upon completion, may be null
701 final void purgeTransactionChain(final LocalHistoryIdentifier id, final @Nullable Runnable callback) {
702 final ShardDataTreeTransactionChain chain = transactionChains.remove(id);
704 LOG.debug("{}: Purging non-existent transaction chain {}", logContext, id);
705 if (callback != null) {
711 replicatePayload(id, PurgeLocalHistoryPayload.create(
712 id, shard.getDatastoreContext().getInitialPayloadSerializedBufferCapacity()), callback);
715 final void skipTransactions(final LocalHistoryIdentifier id, final ImmutableUnsignedLongSet transactionIds,
716 final Runnable callback) {
717 final ShardDataTreeTransactionChain chain = transactionChains.get(id);
719 LOG.debug("{}: Skipping on non-existent transaction chain {}", logContext, id);
720 if (callback != null) {
726 replicatePayload(id, SkipTransactionsPayload.create(id, transactionIds,
727 shard.getDatastoreContext().getInitialPayloadSerializedBufferCapacity()), callback);
730 final Optional<DataTreeCandidate> readCurrentData() {
731 return dataTree.takeSnapshot().readNode(YangInstanceIdentifier.empty())
732 .map(state -> DataTreeCandidates.fromNormalizedNode(YangInstanceIdentifier.empty(), state));
735 final void registerTreeChangeListener(final YangInstanceIdentifier path, final DOMDataTreeChangeListener listener,
736 final Optional<DataTreeCandidate> initialState,
737 final Consumer<ListenerRegistration<DOMDataTreeChangeListener>> onRegistration) {
738 treeChangeListenerPublisher.registerTreeChangeListener(path, listener, initialState, onRegistration);
741 final int getQueueSize() {
742 return pendingTransactions.size() + pendingCommits.size() + pendingFinishCommits.size();
746 final void abortTransaction(final AbstractShardDataTreeTransaction<?> transaction, final Runnable callback) {
747 final TransactionIdentifier id = transaction.getIdentifier();
748 LOG.debug("{}: aborting transaction {}", logContext, id);
749 replicatePayload(id, AbortTransactionPayload.create(
750 id, shard.getDatastoreContext().getInitialPayloadSerializedBufferCapacity()), callback);
754 final void abortFromTransactionActor(final AbstractShardDataTreeTransaction<?> transaction) {
755 // No-op for free-standing transactions
759 final ShardDataTreeCohort finishTransaction(final ReadWriteShardDataTreeTransaction transaction,
760 final Optional<SortedSet<String>> participatingShardNames) {
761 final DataTreeModification snapshot = transaction.getSnapshot();
762 final TransactionIdentifier id = transaction.getIdentifier();
763 LOG.debug("{}: readying transaction {}", logContext, id);
765 LOG.debug("{}: transaction {} ready", logContext, id);
767 return createReadyCohort(transaction.getIdentifier(), snapshot, participatingShardNames);
770 final void purgeTransaction(final TransactionIdentifier id, final Runnable callback) {
771 LOG.debug("{}: purging transaction {}", logContext, id);
772 replicatePayload(id, PurgeTransactionPayload.create(
773 id, shard.getDatastoreContext().getInitialPayloadSerializedBufferCapacity()), callback);
777 public final Optional<NormalizedNode> readNode(final YangInstanceIdentifier path) {
778 return dataTree.takeSnapshot().readNode(path);
781 final DataTreeSnapshot takeSnapshot() {
782 return dataTree.takeSnapshot();
786 final DataTreeModification newModification() {
787 return dataTree.takeSnapshot().newModification();
790 final Collection<ShardDataTreeCohort> getAndClearPendingTransactions() {
791 Collection<ShardDataTreeCohort> ret = new ArrayList<>(getQueueSize());
793 for (CommitEntry entry: pendingFinishCommits) {
794 ret.add(entry.cohort);
797 for (CommitEntry entry: pendingCommits) {
798 ret.add(entry.cohort);
801 for (CommitEntry entry: pendingTransactions) {
802 ret.add(entry.cohort);
805 pendingFinishCommits.clear();
806 pendingCommits.clear();
807 pendingTransactions.clear();
813 * Called some time after {@link #processNextPendingTransaction()} decides to stop processing.
815 final void resumeNextPendingTransaction() {
816 LOG.debug("{}: attempting to resume transaction processing", logContext);
817 processNextPending();
820 @SuppressWarnings("checkstyle:IllegalCatch")
821 private void processNextPendingTransaction() {
822 ++currentTransactionBatch;
823 if (currentTransactionBatch > MAX_TRANSACTION_BATCH) {
824 LOG.debug("{}: Already processed {}, scheduling continuation", logContext, currentTransactionBatch);
825 shard.scheduleNextPendingTransaction();
829 processNextPending(pendingTransactions, State.CAN_COMMIT_PENDING, entry -> {
830 final SimpleShardDataTreeCohort cohort = entry.cohort;
831 final DataTreeModification modification = cohort.getDataTreeModification();
833 LOG.debug("{}: Validating transaction {}", logContext, cohort.getIdentifier());
836 tip.validate(modification);
837 LOG.debug("{}: Transaction {} validated", logContext, cohort.getIdentifier());
838 cohort.successfulCanCommit();
839 entry.lastAccess = readTime();
841 } catch (ConflictingModificationAppliedException e) {
842 LOG.warn("{}: Store Tx {}: Conflicting modification for path {}.", logContext, cohort.getIdentifier(),
844 cause = new OptimisticLockFailedException("Optimistic lock failed for path " + e.getPath(), e);
845 } catch (DataValidationFailedException e) {
846 LOG.warn("{}: Store Tx {}: Data validation failed for path {}.", logContext, cohort.getIdentifier(),
849 // For debugging purposes, allow dumping of the modification. Coupled with the above
850 // precondition log, it should allow us to understand what went on.
851 LOG.debug("{}: Store Tx {}: modifications: {}", logContext, cohort.getIdentifier(), modification);
852 LOG.trace("{}: Current tree: {}", logContext, dataTree);
853 cause = new TransactionCommitFailedException("Data did not pass validation for path " + e.getPath(), e);
854 } catch (Exception e) {
855 LOG.warn("{}: Unexpected failure in validation phase", logContext, e);
859 // Failure path: propagate the failure, remove the transaction from the queue and loop to the next one
860 pendingTransactions.poll().cohort.failedCanCommit(cause);
864 private void processNextPending() {
865 processNextPendingCommit();
866 processNextPendingTransaction();
869 private void processNextPending(final Queue<CommitEntry> queue, final State allowedState,
870 final Consumer<CommitEntry> processor) {
871 while (!queue.isEmpty()) {
872 final CommitEntry entry = queue.peek();
873 final SimpleShardDataTreeCohort cohort = entry.cohort;
875 if (cohort.isFailed()) {
876 LOG.debug("{}: Removing failed transaction {}", logContext, cohort.getIdentifier());
881 if (cohort.getState() == allowedState) {
882 processor.accept(entry);
888 maybeRunOperationOnPendingTransactionsComplete();
891 private void processNextPendingCommit() {
892 processNextPending(pendingCommits, State.COMMIT_PENDING,
893 entry -> startCommit(entry.cohort, entry.cohort.getCandidate()));
896 private boolean peekNextPendingCommit() {
897 final CommitEntry first = pendingCommits.peek();
898 return first != null && first.cohort.getState() == State.COMMIT_PENDING;
901 // non-final for mocking
902 void startCanCommit(final SimpleShardDataTreeCohort cohort) {
903 final CommitEntry head = pendingTransactions.peek();
905 LOG.warn("{}: No transactions enqueued while attempting to start canCommit on {}", logContext, cohort);
908 if (!cohort.equals(head.cohort)) {
909 // The tx isn't at the head of the queue so we can't start canCommit at this point. Here we check if this
910 // tx should be moved ahead of other tx's in the READY state in the pendingTransactions queue. If this tx
911 // has other participating shards, it could deadlock with other tx's accessing the same shards
912 // depending on the order the tx's are readied on each shard
913 // (see https://jira.opendaylight.org/browse/CONTROLLER-1836). Therefore, if the preceding participating
914 // shard names for a preceding pending tx, call it A, in the queue matches that of this tx, then this tx
915 // is allowed to be moved ahead of tx A in the queue so it is processed first to avoid potential deadlock
916 // if tx A is behind this tx in the pendingTransactions queue for a preceding shard. In other words, since
917 // canCommmit for this tx was requested before tx A, honor that request. If this tx is moved to the head of
918 // the queue as a result, then proceed with canCommit.
920 Collection<String> precedingShardNames = extractPrecedingShardNames(cohort.getParticipatingShardNames());
921 if (precedingShardNames.isEmpty()) {
922 LOG.debug("{}: Tx {} is scheduled for canCommit step", logContext, cohort.getIdentifier());
926 LOG.debug("{}: Evaluating tx {} for canCommit - preceding participating shard names {}",
927 logContext, cohort.getIdentifier(), precedingShardNames);
928 final Iterator<CommitEntry> iter = pendingTransactions.iterator();
930 int moveToIndex = -1;
931 while (iter.hasNext()) {
932 final CommitEntry entry = iter.next();
935 if (cohort.equals(entry.cohort)) {
936 if (moveToIndex < 0) {
937 LOG.debug("{}: Not moving tx {} - cannot proceed with canCommit",
938 logContext, cohort.getIdentifier());
942 LOG.debug("{}: Moving {} to index {} in the pendingTransactions queue",
943 logContext, cohort.getIdentifier(), moveToIndex);
945 insertEntry(pendingTransactions, entry, moveToIndex);
947 if (!cohort.equals(pendingTransactions.peek().cohort)) {
948 LOG.debug("{}: Tx {} is not at the head of the queue - cannot proceed with canCommit",
949 logContext, cohort.getIdentifier());
953 LOG.debug("{}: Tx {} is now at the head of the queue - proceeding with canCommit",
954 logContext, cohort.getIdentifier());
958 if (entry.cohort.getState() != State.READY) {
959 LOG.debug("{}: Skipping pending transaction {} in state {}",
960 logContext, entry.cohort.getIdentifier(), entry.cohort.getState());
964 final Collection<String> pendingPrecedingShardNames = extractPrecedingShardNames(
965 entry.cohort.getParticipatingShardNames());
967 if (precedingShardNames.equals(pendingPrecedingShardNames)) {
968 if (moveToIndex < 0) {
969 LOG.debug("{}: Preceding shard names {} for pending tx {} match - saving moveToIndex {}",
970 logContext, pendingPrecedingShardNames, entry.cohort.getIdentifier(), index);
974 "{}: Preceding shard names {} for pending tx {} match but moveToIndex already set to {}",
975 logContext, pendingPrecedingShardNames, entry.cohort.getIdentifier(), moveToIndex);
978 LOG.debug("{}: Preceding shard names {} for pending tx {} differ - skipping",
979 logContext, pendingPrecedingShardNames, entry.cohort.getIdentifier());
984 processNextPendingTransaction();
987 private static void insertEntry(final Deque<CommitEntry> queue, final CommitEntry entry, final int atIndex) {
989 queue.addFirst(entry);
993 LOG.trace("Inserting into Deque at index {}", atIndex);
995 Deque<CommitEntry> tempStack = new ArrayDeque<>(atIndex);
996 for (int i = 0; i < atIndex; i++) {
997 tempStack.push(queue.poll());
1000 queue.addFirst(entry);
1002 tempStack.forEach(queue::addFirst);
1005 private Collection<String> extractPrecedingShardNames(final Optional<SortedSet<String>> participatingShardNames) {
1006 return participatingShardNames.map((Function<SortedSet<String>, Collection<String>>)
1007 set -> set.headSet(shard.getShardName())).orElse(Collections.<String>emptyList());
1010 private void failPreCommit(final Throwable cause) {
1011 shard.getShardMBean().incrementFailedTransactionsCount();
1012 pendingTransactions.poll().cohort.failedPreCommit(cause);
1013 processNextPendingTransaction();
1016 // non-final for mocking
1017 @SuppressWarnings("checkstyle:IllegalCatch")
1018 void startPreCommit(final SimpleShardDataTreeCohort cohort) {
1019 final CommitEntry entry = pendingTransactions.peek();
1020 checkState(entry != null, "Attempted to pre-commit of %s when no transactions pending", cohort);
1022 final SimpleShardDataTreeCohort current = entry.cohort;
1023 verify(cohort.equals(current), "Attempted to pre-commit %s while %s is pending", cohort, current);
1025 final TransactionIdentifier currentId = current.getIdentifier();
1026 LOG.debug("{}: Preparing transaction {}", logContext, currentId);
1028 final DataTreeCandidateTip candidate;
1030 candidate = tip.prepare(cohort.getDataTreeModification());
1031 LOG.debug("{}: Transaction {} candidate ready", logContext, currentId);
1032 } catch (DataValidationFailedException | RuntimeException e) {
1037 cohort.userPreCommit(candidate, new FutureCallback<Void>() {
1039 public void onSuccess(final Void noop) {
1040 // Set the tip of the data tree.
1041 tip = verifyNotNull(candidate);
1043 entry.lastAccess = readTime();
1045 pendingTransactions.remove();
1046 pendingCommits.add(entry);
1048 LOG.debug("{}: Transaction {} prepared", logContext, currentId);
1050 cohort.successfulPreCommit(candidate);
1052 processNextPendingTransaction();
1056 public void onFailure(final Throwable failure) {
1057 failPreCommit(failure);
1062 private void failCommit(final Exception cause) {
1063 shard.getShardMBean().incrementFailedTransactionsCount();
1064 pendingFinishCommits.poll().cohort.failedCommit(cause);
1065 processNextPending();
1068 @SuppressWarnings("checkstyle:IllegalCatch")
1069 private void finishCommit(final SimpleShardDataTreeCohort cohort) {
1070 final TransactionIdentifier txId = cohort.getIdentifier();
1071 final DataTreeCandidate candidate = cohort.getCandidate();
1073 LOG.debug("{}: Resuming commit of transaction {}", logContext, txId);
1075 if (tip == candidate) {
1076 // All pending candidates have been committed, reset the tip to the data tree.
1081 dataTree.commit(candidate);
1082 } catch (Exception e) {
1083 LOG.error("{}: Failed to commit transaction {}", logContext, txId, e);
1088 allMetadataCommittedTransaction(txId);
1089 shard.getShardMBean().incrementCommittedTransactionCount();
1090 shard.getShardMBean().setLastCommittedTransactionTime(System.currentTimeMillis());
1092 // FIXME: propagate journal index
1093 pendingFinishCommits.poll().cohort.successfulCommit(UnsignedLong.ZERO, () -> {
1094 LOG.trace("{}: Transaction {} committed, proceeding to notify", logContext, txId);
1095 notifyListeners(candidate);
1097 processNextPending();
1101 // non-final for mocking
1102 void startCommit(final SimpleShardDataTreeCohort cohort, final DataTreeCandidate candidate) {
1103 final CommitEntry entry = pendingCommits.peek();
1104 checkState(entry != null, "Attempted to start commit of %s when no transactions pending", cohort);
1106 final SimpleShardDataTreeCohort current = entry.cohort;
1107 if (!cohort.equals(current)) {
1108 LOG.debug("{}: Transaction {} scheduled for commit step", logContext, cohort.getIdentifier());
1112 LOG.debug("{}: Starting commit for transaction {}", logContext, current.getIdentifier());
1114 final TransactionIdentifier txId = cohort.getIdentifier();
1115 final Payload payload;
1117 payload = CommitTransactionPayload.create(txId, candidate, PayloadVersion.current(),
1118 shard.getDatastoreContext().getInitialPayloadSerializedBufferCapacity());
1119 } catch (IOException e) {
1120 LOG.error("{}: Failed to encode transaction {} candidate {}", logContext, txId, candidate, e);
1121 pendingCommits.poll().cohort.failedCommit(e);
1122 processNextPending();
1126 // We process next transactions pending canCommit before we call persistPayload to possibly progress subsequent
1127 // transactions to the COMMIT_PENDING state so the payloads can be batched for replication. This is done for
1128 // single-shard transactions that immediately transition from canCommit to preCommit to commit. Note that
1129 // if the next pending transaction is progressed to COMMIT_PENDING and this method (startCommit) is called,
1130 // the next transaction will not attempt to replicate b/c the current transaction is still at the head of the
1131 // pendingCommits queue.
1132 processNextPendingTransaction();
1134 // After processing next pending transactions, we can now remove the current transaction from pendingCommits.
1135 // Note this must be done before the call to peekNextPendingCommit below so we check the next transaction
1136 // in order to properly determine the batchHint flag for the call to persistPayload.
1137 pendingCommits.remove();
1138 pendingFinishCommits.add(entry);
1140 // See if the next transaction is pending commit (ie in the COMMIT_PENDING state) so it can be batched with
1141 // this transaction for replication.
1142 boolean replicationBatchHint = peekNextPendingCommit();
1144 // Once completed, we will continue via payloadReplicationComplete
1145 shard.persistPayload(txId, payload, replicationBatchHint);
1147 entry.lastAccess = shard.ticker().read();
1149 LOG.debug("{}: Transaction {} submitted to persistence", logContext, txId);
1151 // Process the next transaction pending commit, if any. If there is one it will be batched with this
1152 // transaction for replication.
1153 processNextPendingCommit();
1156 final Collection<ActorRef> getCohortActors() {
1157 return cohortRegistry.getCohortActors();
1160 final void processCohortRegistryCommand(final ActorRef sender, final CohortRegistryCommand message) {
1161 cohortRegistry.process(sender, message);
1165 final ShardDataTreeCohort createFailedCohort(final TransactionIdentifier txId, final DataTreeModification mod,
1166 final Exception failure) {
1167 final SimpleShardDataTreeCohort cohort = new SimpleShardDataTreeCohort(this, mod, txId, failure);
1168 pendingTransactions.add(new CommitEntry(cohort, readTime()));
1173 final ShardDataTreeCohort createReadyCohort(final TransactionIdentifier txId, final DataTreeModification mod,
1174 final Optional<SortedSet<String>> participatingShardNames) {
1175 SimpleShardDataTreeCohort cohort = new SimpleShardDataTreeCohort(this, mod, txId,
1176 cohortRegistry.createCohort(schemaContext, txId, shard::executeInSelf,
1177 COMMIT_STEP_TIMEOUT), participatingShardNames);
1178 pendingTransactions.add(new CommitEntry(cohort, readTime()));
1182 // Exposed for ShardCommitCoordinator so it does not have deal with local histories (it does not care), this mimics
1183 // the newReadWriteTransaction()
1184 final ShardDataTreeCohort newReadyCohort(final TransactionIdentifier txId, final DataTreeModification mod,
1185 final Optional<SortedSet<String>> participatingShardNames) {
1186 if (txId.getHistoryId().getHistoryId() == 0) {
1187 return createReadyCohort(txId, mod, participatingShardNames);
1190 return ensureTransactionChain(txId.getHistoryId(), null).createReadyCohort(txId, mod, participatingShardNames);
1193 @SuppressFBWarnings(value = "DB_DUPLICATE_SWITCH_CLAUSES", justification = "See inline comments below.")
1194 final void checkForExpiredTransactions(final long transactionCommitTimeoutMillis,
1195 final Function<SimpleShardDataTreeCohort, OptionalLong> accessTimeUpdater) {
1196 final long timeout = TimeUnit.MILLISECONDS.toNanos(transactionCommitTimeoutMillis);
1197 final long now = readTime();
1199 final Queue<CommitEntry> currentQueue = !pendingFinishCommits.isEmpty() ? pendingFinishCommits :
1200 !pendingCommits.isEmpty() ? pendingCommits : pendingTransactions;
1201 final CommitEntry currentTx = currentQueue.peek();
1202 if (currentTx == null) {
1203 // Empty queue, no-op
1207 long delta = now - currentTx.lastAccess;
1208 if (delta < timeout) {
1209 // Not expired yet, bail
1213 final OptionalLong updateOpt = accessTimeUpdater.apply(currentTx.cohort);
1214 if (updateOpt.isPresent()) {
1215 final long newAccess = updateOpt.getAsLong();
1216 final long newDelta = now - newAccess;
1217 if (newDelta < delta) {
1218 LOG.debug("{}: Updated current transaction {} access time", logContext,
1219 currentTx.cohort.getIdentifier());
1220 currentTx.lastAccess = newAccess;
1224 if (delta < timeout) {
1225 // Not expired yet, bail
1230 final long deltaMillis = TimeUnit.NANOSECONDS.toMillis(delta);
1231 final State state = currentTx.cohort.getState();
1233 LOG.warn("{}: Current transaction {} has timed out after {} ms in state {}", logContext,
1234 currentTx.cohort.getIdentifier(), deltaMillis, state);
1235 boolean processNext = true;
1236 final TimeoutException cohortFailure = new TimeoutException("Backend timeout in state " + state + " after "
1237 + deltaMillis + "ms");
1240 case CAN_COMMIT_PENDING:
1241 currentQueue.remove().cohort.failedCanCommit(cohortFailure);
1243 case CAN_COMMIT_COMPLETE:
1244 // The suppression of the FindBugs "DB_DUPLICATE_SWITCH_CLAUSES" warning pertains to this clause
1245 // whose code is duplicated with PRE_COMMIT_COMPLETE. The clauses aren't combined in case the code
1246 // in PRE_COMMIT_COMPLETE is changed.
1247 currentQueue.remove().cohort.reportFailure(cohortFailure);
1249 case PRE_COMMIT_PENDING:
1250 currentQueue.remove().cohort.failedPreCommit(cohortFailure);
1252 case PRE_COMMIT_COMPLETE:
1253 // FIXME: this is a legacy behavior problem. Three-phase commit protocol specifies that after we
1254 // are ready we should commit the transaction, not abort it. Our current software stack does
1255 // not allow us to do that consistently, because we persist at the time of commit, hence
1256 // we can end up in a state where we have pre-committed a transaction, then a leader failover
1257 // occurred ... the new leader does not see the pre-committed transaction and does not have
1258 // a running timer. To fix this we really need two persistence events.
1260 // The first one, done at pre-commit time will hold the transaction payload. When consensus
1261 // is reached, we exit the pre-commit phase and start the pre-commit timer. Followers do not
1262 // apply the state in this event.
1264 // The second one, done at commit (or abort) time holds only the transaction identifier and
1265 // signals to followers that the state should (or should not) be applied.
1267 // In order to make the pre-commit timer working across failovers, though, we need
1268 // a per-shard cluster-wide monotonic time, so a follower becoming the leader can accurately
1269 // restart the timer.
1270 currentQueue.remove().cohort.reportFailure(cohortFailure);
1272 case COMMIT_PENDING:
1273 LOG.warn("{}: Transaction {} is still committing, cannot abort", logContext,
1274 currentTx.cohort.getIdentifier());
1275 currentTx.lastAccess = now;
1276 processNext = false;
1279 currentQueue.remove().cohort.reportFailure(cohortFailure);
1285 currentQueue.remove();
1289 processNextPending();
1293 // non-final for mocking
1294 boolean startAbort(final SimpleShardDataTreeCohort cohort) {
1295 final Iterator<CommitEntry> it = Iterables.concat(pendingFinishCommits, pendingCommits,
1296 pendingTransactions).iterator();
1297 if (!it.hasNext()) {
1298 LOG.debug("{}: no open transaction while attempting to abort {}", logContext, cohort.getIdentifier());
1302 // First entry is special, as it may already be committing
1303 final CommitEntry first = it.next();
1304 if (cohort.equals(first.cohort)) {
1305 if (cohort.getState() != State.COMMIT_PENDING) {
1306 LOG.debug("{}: aborting head of queue {} in state {}", logContext, cohort.getIdentifier(),
1307 cohort.getIdentifier());
1310 if (cohort.getCandidate() != null) {
1311 rebaseTransactions(it, dataTree);
1314 processNextPending();
1318 LOG.warn("{}: transaction {} is committing, skipping abort", logContext, cohort.getIdentifier());
1322 DataTreeTip newTip = requireNonNullElse(first.cohort.getCandidate(), dataTree);
1323 while (it.hasNext()) {
1324 final CommitEntry e = it.next();
1325 if (cohort.equals(e.cohort)) {
1326 LOG.debug("{}: aborting queued transaction {}", logContext, cohort.getIdentifier());
1329 if (cohort.getCandidate() != null) {
1330 rebaseTransactions(it, newTip);
1335 newTip = requireNonNullElse(e.cohort.getCandidate(), newTip);
1339 LOG.debug("{}: aborted transaction {} not found in the queue", logContext, cohort.getIdentifier());
1343 @SuppressWarnings("checkstyle:IllegalCatch")
1344 private void rebaseTransactions(final Iterator<CommitEntry> iter, final @NonNull DataTreeTip newTip) {
1345 tip = requireNonNull(newTip);
1346 while (iter.hasNext()) {
1347 final SimpleShardDataTreeCohort cohort = iter.next().cohort;
1348 if (cohort.getState() == State.CAN_COMMIT_COMPLETE) {
1349 LOG.debug("{}: Revalidating queued transaction {}", logContext, cohort.getIdentifier());
1352 tip.validate(cohort.getDataTreeModification());
1353 } catch (DataValidationFailedException | RuntimeException e) {
1354 LOG.debug("{}: Failed to revalidate queued transaction {}", logContext, cohort.getIdentifier(), e);
1355 cohort.reportFailure(e);
1357 } else if (cohort.getState() == State.PRE_COMMIT_COMPLETE) {
1358 LOG.debug("{}: Repreparing queued transaction {}", logContext, cohort.getIdentifier());
1361 tip.validate(cohort.getDataTreeModification());
1362 DataTreeCandidateTip candidate = tip.prepare(cohort.getDataTreeModification());
1364 cohort.setNewCandidate(candidate);
1366 } catch (RuntimeException | DataValidationFailedException e) {
1367 LOG.debug("{}: Failed to reprepare queued transaction {}", logContext, cohort.getIdentifier(), e);
1368 cohort.reportFailure(e);
1374 final void setRunOnPendingTransactionsComplete(final Runnable operation) {
1375 runOnPendingTransactionsComplete = operation;
1376 maybeRunOperationOnPendingTransactionsComplete();
1379 private void maybeRunOperationOnPendingTransactionsComplete() {
1380 if (runOnPendingTransactionsComplete != null && !anyPendingTransactions()) {
1381 LOG.debug("{}: Pending transactions complete - running operation {}", logContext,
1382 runOnPendingTransactionsComplete);
1384 runOnPendingTransactionsComplete.run();
1385 runOnPendingTransactionsComplete = null;
1389 final ShardStats getStats() {
1390 return shard.getShardMBean();
1393 final Iterator<SimpleShardDataTreeCohort> cohortIterator() {
1394 return Iterables.transform(Iterables.concat(pendingFinishCommits, pendingCommits, pendingTransactions),
1395 e -> e.cohort).iterator();
1398 final void removeTransactionChain(final LocalHistoryIdentifier id) {
1399 if (transactionChains.remove(id) != null) {
1400 LOG.debug("{}: Removed transaction chain {}", logContext, id);