2 * Copyright (c) 2014 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.md.sal.dom.store.impl.tree.data;
10 import static com.google.common.base.Preconditions.checkState;
12 import java.util.Map.Entry;
13 import java.util.concurrent.atomic.AtomicIntegerFieldUpdater;
15 import org.opendaylight.controller.md.sal.dom.store.impl.tree.DataTreeModification;
16 import org.opendaylight.controller.md.sal.dom.store.impl.tree.StoreUtils;
17 import org.opendaylight.controller.md.sal.dom.store.impl.tree.TreeNodeUtils;
18 import org.opendaylight.controller.md.sal.dom.store.impl.tree.spi.TreeNode;
19 import org.opendaylight.yangtools.yang.data.api.InstanceIdentifier;
20 import org.opendaylight.yangtools.yang.data.api.InstanceIdentifier.PathArgument;
21 import org.opendaylight.yangtools.yang.data.api.schema.NormalizedNode;
22 import org.opendaylight.yangtools.yang.data.api.schema.NormalizedNodeContainer;
23 import org.opendaylight.yangtools.yang.data.impl.schema.NormalizedNodeUtils;
24 import org.slf4j.Logger;
25 import org.slf4j.LoggerFactory;
27 import com.google.common.base.Optional;
28 import com.google.common.base.Preconditions;
30 final class InMemoryDataTreeModification implements DataTreeModification {
31 private static final Logger LOG = LoggerFactory.getLogger(InMemoryDataTreeModification.class);
34 * FIXME: the thread safety of concurrent write/delete/read/seal operations
35 * needs to be evaluated.
37 private static final AtomicIntegerFieldUpdater<InMemoryDataTreeModification> SEALED_UPDATER =
38 AtomicIntegerFieldUpdater.newUpdater(InMemoryDataTreeModification.class, "sealed");
39 private volatile int sealed = 0;
41 private final ModificationApplyOperation strategyTree;
42 private final InMemoryDataTreeSnapshot snapshot;
43 private final ModifiedNode rootNode;
45 InMemoryDataTreeModification(final InMemoryDataTreeSnapshot snapshot, final ModificationApplyOperation resolver) {
46 this.snapshot = Preconditions.checkNotNull(snapshot);
47 this.strategyTree = Preconditions.checkNotNull(resolver);
48 this.rootNode = ModifiedNode.createUnmodified(snapshot.getRootNode());
51 ModifiedNode getRootModification() {
55 ModificationApplyOperation getStrategy() {
60 public void write(final InstanceIdentifier path, final NormalizedNode<?, ?> value) {
62 resolveModificationFor(path).write(value);
66 public void merge(final InstanceIdentifier path, final NormalizedNode<?, ?> data) {
68 mergeImpl(resolveModificationFor(path),data);
71 private void mergeImpl(final OperationWithModification op,final NormalizedNode<?,?> data) {
73 if(data instanceof NormalizedNodeContainer<?,?,?>) {
74 @SuppressWarnings({ "rawtypes", "unchecked" })
75 NormalizedNodeContainer<?,?,NormalizedNode<PathArgument, ?>> dataContainer = (NormalizedNodeContainer) data;
76 for(NormalizedNode<PathArgument, ?> child : dataContainer.getValue()) {
77 PathArgument childId = child.getIdentifier();
78 mergeImpl(op.forChild(childId), child);
85 public void delete(final InstanceIdentifier path) {
87 resolveModificationFor(path).delete();
91 public Optional<NormalizedNode<?, ?>> readNode(final InstanceIdentifier path) {
93 * Walk the tree from the top, looking for the first node between root and
94 * the requested path which has been modified. If no such node exists,
95 * we use the node itself.
97 final Entry<InstanceIdentifier, ModifiedNode> entry = TreeNodeUtils.findClosestsOrFirstMatch(rootNode, path, ModifiedNode.IS_TERMINAL_PREDICATE);
98 final InstanceIdentifier key = entry.getKey();
99 final ModifiedNode mod = entry.getValue();
101 final Optional<TreeNode> result = resolveSnapshot(key, mod);
102 if (result.isPresent()) {
103 NormalizedNode<?, ?> data = result.get().getData();
104 return NormalizedNodeUtils.findNode(key, data, path);
106 return Optional.absent();
110 private Optional<TreeNode> resolveSnapshot(final InstanceIdentifier path,
111 final ModifiedNode modification) {
112 final Optional<Optional<TreeNode>> potentialSnapshot = modification.getSnapshotCache();
113 if(potentialSnapshot.isPresent()) {
114 return potentialSnapshot.get();
118 return resolveModificationStrategy(path).apply(modification, modification.getOriginal(),
119 StoreUtils.increase(snapshot.getRootNode().getSubtreeVersion()));
120 } catch (Exception e) {
121 LOG.error("Could not create snapshot for {}:{}", path,modification,e);
126 private ModificationApplyOperation resolveModificationStrategy(final InstanceIdentifier path) {
127 LOG.trace("Resolving modification apply strategy for {}", path);
128 return TreeNodeUtils.findNodeChecked(strategyTree, path);
131 private OperationWithModification resolveModificationFor(final InstanceIdentifier path) {
132 ModifiedNode modification = rootNode;
133 // We ensure strategy is present.
134 ModificationApplyOperation operation = resolveModificationStrategy(path);
135 for (PathArgument pathArg : path.getPath()) {
136 modification = modification.modifyChild(pathArg);
138 return OperationWithModification.from(operation, modification);
143 final boolean success = SEALED_UPDATER.compareAndSet(this, 0, 1);
144 Preconditions.checkState(success, "Attempted to seal an already-sealed Data Tree.");
148 private void checkSealed() {
149 checkState(sealed == 0, "Data Tree is sealed. No further modifications allowed.");
153 public String toString() {
154 return "MutableDataTree [modification=" + rootNode + "]";
158 public DataTreeModification newModification() {
159 // FIXME: transaction chaining
160 throw new UnsupportedOperationException("Implement this as part of transaction chaining");