2 * Copyright (c) 2016 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 static org.junit.Assert.assertFalse;
11 import static org.junit.Assert.assertNotEquals;
12 import static org.junit.Assert.assertNotNull;
13 import static org.junit.Assert.assertTrue;
14 import static org.junit.Assert.fail;
15 import static org.mockito.Matchers.any;
16 import static org.mockito.Mockito.doReturn;
17 import static org.mockito.MockitoAnnotations.initMocks;
19 import com.google.common.collect.Lists;
20 import com.google.common.util.concurrent.ListenableFuture;
21 import java.util.ArrayDeque;
22 import java.util.Collection;
23 import java.util.Collections;
24 import java.util.Deque;
25 import java.util.HashMap;
26 import java.util.List;
28 import javax.annotation.Nonnull;
29 import org.junit.Test;
30 import org.mockito.Mock;
31 import org.opendaylight.mdsal.common.api.LogicalDatastoreType;
32 import org.opendaylight.mdsal.dom.api.DOMDataTreeCursorAwareTransaction;
33 import org.opendaylight.mdsal.dom.api.DOMDataTreeIdentifier;
34 import org.opendaylight.mdsal.dom.api.DOMDataTreeProducer;
35 import org.opendaylight.mdsal.dom.api.DOMDataTreeWriteCursor;
36 import org.opendaylight.mdsal.dom.store.inmemory.DOMDataTreeShardProducer;
37 import org.opendaylight.mdsal.dom.store.inmemory.DOMDataTreeShardWriteTransaction;
38 import org.opendaylight.mdsal.dom.store.inmemory.WriteableDOMDataTreeShard;
39 import org.opendaylight.yangtools.yang.common.QName;
40 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier;
41 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.PathArgument;
42 import org.opendaylight.yangtools.yang.data.api.schema.NormalizedNode;
44 public class ShardedDOMDataWriteTransactionTest {
45 private static final Map<YangInstanceIdentifier, List<NormalizedNode<?, ?>>> TEST_MAP = new HashMap<>();
47 private static final DOMDataTreeIdentifier ROOT_ID =
48 new DOMDataTreeIdentifier(LogicalDatastoreType.OPERATIONAL, YangInstanceIdentifier.EMPTY);
51 private WriteableDOMDataTreeShard rootShard;
54 private DOMDataTreeShardProducer mockedProducer;
57 public void basicTests() throws Exception {
61 doReturn(new TestDOMShardWriteTransaction()).when(mockedProducer).createTransaction();
62 doReturn(mockedProducer).when(rootShard).createProducer(any(Collection.class));
64 final ShardedDOMDataTree shardedDOMDataTree =
65 new ShardedDOMDataTree();
66 final DOMDataTreeProducer shardRegProducer = shardedDOMDataTree.createProducer(
67 Collections.singletonList(ROOT_ID));
68 shardedDOMDataTree.registerDataTreeShard(ROOT_ID, rootShard, shardRegProducer);
69 shardRegProducer.close();
70 final YangInstanceIdentifier yangInstanceIdentifier = YangInstanceIdentifier.of(QName.create("test"));
72 final DOMDataTreeProducer producer = shardedDOMDataTree.createProducer(Collections.singletonList(ROOT_ID));
73 final DOMDataTreeCursorAwareTransaction transaction = producer.createTransaction(false);
74 final DOMDataTreeWriteCursor cursor = transaction.createCursor(ROOT_ID);
76 assertNotNull(cursor);
77 assertFalse(TEST_MAP.containsKey(yangInstanceIdentifier));
78 cursor.write(yangInstanceIdentifier.getLastPathArgument(), TestUtils.TEST_CONTAINER);
79 assertTrue(TEST_MAP.containsKey(yangInstanceIdentifier));
81 cursor.delete(yangInstanceIdentifier.getLastPathArgument());
82 assertFalse(TEST_MAP.containsKey(yangInstanceIdentifier));
84 cursor.merge(yangInstanceIdentifier.getLastPathArgument(), TestUtils.TEST_CONTAINER);
85 assertTrue(TEST_MAP.get(yangInstanceIdentifier).contains(TestUtils.TEST_CONTAINER));
88 producer.createTransaction(false);
89 fail("Should have failed, there's still a tx open");
90 } catch (final IllegalStateException e) {
91 assertTrue(e.getMessage().contains("open"));
96 transaction.createCursor(new DOMDataTreeIdentifier(LogicalDatastoreType.CONFIGURATION,
97 YangInstanceIdentifier.EMPTY));
98 fail("Should have failed, config ds not available to this tx");
99 } catch (final IllegalArgumentException e) {
100 assertTrue(e.getMessage().contains("not accessible"));
103 assertTrue(transaction.cancel());
104 assertFalse(transaction.cancel());
106 final DOMDataTreeCursorAwareTransaction newTx = producer.createTransaction(false);
107 assertTrue("Transaction identifier incorrect " + transaction.getIdentifier(), (
108 (String) transaction.getIdentifier()).contains("SHARDED-DOM-"));
109 assertNotEquals(transaction.getIdentifier(),
110 newTx.getIdentifier());
113 private final class TestDOMShardWriteTransaction implements DOMDataTreeShardWriteTransaction {
117 public DOMDataTreeWriteCursor createCursor(@Nonnull final DOMDataTreeIdentifier prefix) {
118 return new TestCursor();
122 public void ready() {
127 public void close() {
132 public ListenableFuture<Void> submit() {
137 public ListenableFuture<Boolean> validate() {
142 public ListenableFuture<Void> prepare() {
147 public ListenableFuture<Void> commit() {
152 private final class TestCursor implements DOMDataTreeWriteCursor {
154 private final Deque<PathArgument> stack = new ArrayDeque<>();
157 public void delete(final PathArgument child) {
158 final ArrayDeque<PathArgument> newPath = new ArrayDeque<>(stack);
160 TEST_MAP.remove(YangInstanceIdentifier.create(newPath));
164 public void merge(final PathArgument child, final NormalizedNode<?, ?> data) {
165 final ArrayDeque<PathArgument> newPath = new ArrayDeque<>(stack);
167 final List<NormalizedNode<?, ?>> dataList = TEST_MAP.get(YangInstanceIdentifier.create(newPath));
168 if (dataList != null) {
171 TEST_MAP.put(YangInstanceIdentifier.create(newPath), Lists.newArrayList(data));
176 public void write(final PathArgument child, final NormalizedNode<?, ?> data) {
177 final ArrayDeque<PathArgument> newPath = new ArrayDeque<>(stack);
179 TEST_MAP.put(YangInstanceIdentifier.create(newPath), Lists.newArrayList(data));
183 public void enter(@Nonnull final PathArgument child) {
188 public void enter(@Nonnull final PathArgument... path) {
189 for (final PathArgument pathArgument : path) {
190 stack.push(pathArgument);
195 public void enter(@Nonnull final Iterable<PathArgument> path) {
196 path.forEach(stack::push);
205 public void exit(final int depth) {
210 public void close() {