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.mdsal.dom.broker;
10 import com.google.common.base.Preconditions;
11 import com.google.common.collect.ImmutableSet;
12 import com.google.common.util.concurrent.CheckedFuture;
13 import com.google.common.util.concurrent.FutureCallback;
14 import com.google.common.util.concurrent.Futures;
15 import com.google.common.util.concurrent.ListenableFuture;
16 import com.google.common.util.concurrent.SettableFuture;
17 import java.util.Deque;
18 import java.util.HashMap;
19 import java.util.HashSet;
20 import java.util.LinkedList;
21 import java.util.List;
23 import java.util.Map.Entry;
25 import java.util.concurrent.atomic.AtomicLong;
26 import java.util.stream.Collectors;
27 import javax.annotation.Nonnull;
28 import javax.annotation.concurrent.GuardedBy;
29 import javax.annotation.concurrent.NotThreadSafe;
30 import org.opendaylight.mdsal.common.api.TransactionCommitFailedException;
31 import org.opendaylight.mdsal.dom.api.DOMDataTreeCursorAwareTransaction;
32 import org.opendaylight.mdsal.dom.api.DOMDataTreeIdentifier;
33 import org.opendaylight.mdsal.dom.api.DOMDataTreeProducer;
34 import org.opendaylight.mdsal.dom.api.DOMDataTreeWriteCursor;
35 import org.opendaylight.mdsal.dom.store.inmemory.DOMDataTreeShardProducer;
36 import org.opendaylight.mdsal.dom.store.inmemory.DOMDataTreeShardWriteTransaction;
37 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier;
38 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.PathArgument;
39 import org.opendaylight.yangtools.yang.data.api.schema.NormalizedNode;
40 import org.slf4j.Logger;
41 import org.slf4j.LoggerFactory;
44 final class ShardedDOMDataTreeWriteTransaction implements DOMDataTreeCursorAwareTransaction {
45 private static final Logger LOG = LoggerFactory.getLogger(ShardedDOMDataTreeWriteTransaction.class);
46 private static final AtomicLong COUNTER = new AtomicLong();
47 private final Map<DOMDataTreeIdentifier, DOMDataTreeShardWriteTransaction> idToTransaction;
48 private final ShardedDOMDataTreeProducer producer;
49 private final String identifier;
50 private final Set<YangInstanceIdentifier> childBoundaries = new HashSet<>();
52 private boolean closed = false;
55 private DOMDataTreeWriteCursor openCursor;
57 ShardedDOMDataTreeWriteTransaction(final ShardedDOMDataTreeProducer producer,
58 final Map<DOMDataTreeIdentifier, DOMDataTreeShardProducer> idToProducer,
59 final Map<DOMDataTreeIdentifier, DOMDataTreeProducer> childProducers) {
60 this.producer = Preconditions.checkNotNull(producer);
61 idToTransaction = new HashMap<>();
62 Preconditions.checkNotNull(idToProducer).forEach((id, prod) -> idToTransaction.put(
63 id, prod.createTransaction()));
64 this.identifier = "SHARDED-DOM-" + COUNTER.getAndIncrement();
65 childProducers.forEach((id, prod) -> childBoundaries.add(id.getRootIdentifier()));
68 // FIXME: use atomic operations
70 private DOMDataTreeShardWriteTransaction lookup(final DOMDataTreeIdentifier prefix) {
71 for (final Entry<DOMDataTreeIdentifier, DOMDataTreeShardWriteTransaction> e : idToTransaction.entrySet()) {
72 if (e.getKey().contains(prefix)) {
73 Preconditions.checkArgument(!producer.isDelegatedToChild(prefix),
74 "Path %s is delegated to child producer.",
79 throw new IllegalArgumentException(String.format("Path %s is not accessible from transaction %s",
84 public String getIdentifier() {
89 public synchronized boolean cancel() {
94 LOG.debug("Cancelling transaction {}", identifier);
95 if (openCursor != null) {
98 for (final DOMDataTreeShardWriteTransaction tx : ImmutableSet.copyOf(idToTransaction.values())) {
103 producer.cancelTransaction(this);
108 public synchronized DOMDataTreeWriteCursor createCursor(final DOMDataTreeIdentifier prefix) {
109 Preconditions.checkState(!closed, "Transaction is closed already");
110 Preconditions.checkState(openCursor == null, "There is still a cursor open");
111 final DOMDataTreeShardWriteTransaction lookup = lookup(prefix);
112 openCursor = new DelegatingCursor(lookup.createCursor(prefix), prefix);
117 public synchronized CheckedFuture<Void, TransactionCommitFailedException> submit() {
118 Preconditions.checkState(!closed, "Transaction %s is already closed", identifier);
119 Preconditions.checkState(openCursor == null, "Cannot submit transaction while there is a cursor open");
121 final Set<DOMDataTreeShardWriteTransaction> txns = ImmutableSet.copyOf(idToTransaction.values());
122 final ListenableFuture<List<Void>> listListenableFuture =
123 Futures.allAsList(txns.stream().map(tx -> {
126 }).collect(Collectors.toList()));
128 final SettableFuture<Void> ret = SettableFuture.create();
129 Futures.addCallback(listListenableFuture, new FutureCallback<List<Void>>() {
131 public void onSuccess(final List<Void> result) {
136 public void onFailure(final Throwable exp) {
137 ret.setException(exp);
141 producer.transactionSubmitted(this);
142 return Futures.makeChecked(ret, TransactionCommitFailedExceptionMapper.create("submit"));
145 synchronized void cursorClosed() {
149 private class DelegatingCursor implements DOMDataTreeWriteCursor {
151 private final DOMDataTreeWriteCursor delegate;
152 private final Deque<PathArgument> path = new LinkedList<>();
154 DelegatingCursor(final DOMDataTreeWriteCursor delegate, final DOMDataTreeIdentifier rootPosition) {
155 this.delegate = delegate;
156 path.addAll(rootPosition.getRootIdentifier().getPathArguments());
160 public void enter(@Nonnull final PathArgument child) {
161 checkAvailable(child);
163 delegate.enter(child);
167 public void enter(@Nonnull final PathArgument... path) {
168 for (final PathArgument pathArgument : path) {
174 public void enter(@Nonnull final Iterable<PathArgument> path) {
175 for (final PathArgument pathArgument : path) {
187 public void exit(final int depth) {
188 for (int i = 0; i < depth; i++) {
191 delegate.exit(depth);
195 public void close() {
201 public void delete(final PathArgument child) {
202 checkAvailable(child);
203 delegate.delete(child);
207 public void merge(final PathArgument child, final NormalizedNode<?, ?> data) {
208 checkAvailable(child);
209 delegate.merge(child, data);
213 public void write(final PathArgument child, final NormalizedNode<?, ?> data) {
214 checkAvailable(child);
215 delegate.write(child, data);
218 void checkAvailable(final PathArgument child) {
220 final YangInstanceIdentifier yid = YangInstanceIdentifier.create(path);
221 childBoundaries.forEach(id -> {
222 if (id.contains(yid)) {
224 throw new IllegalArgumentException("Path {" + yid + "} is not available to this cursor"
225 + " since it's already claimed by a child producer");