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.binding.dom.adapter;
10 import com.google.common.base.Preconditions;
11 import java.util.ArrayList;
12 import java.util.Collection;
13 import java.util.Iterator;
14 import java.util.List;
15 import java.util.Optional;
16 import org.opendaylight.mdsal.binding.api.DataObjectModification;
17 import org.opendaylight.mdsal.binding.dom.codec.api.BindingCodecTreeNode;
18 import org.opendaylight.yangtools.yang.binding.Augmentation;
19 import org.opendaylight.yangtools.yang.binding.ChildOf;
20 import org.opendaylight.yangtools.yang.binding.DataObject;
21 import org.opendaylight.yangtools.yang.binding.Identifiable;
22 import org.opendaylight.yangtools.yang.binding.Identifier;
23 import org.opendaylight.yangtools.yang.binding.InstanceIdentifier;
24 import org.opendaylight.yangtools.yang.binding.InstanceIdentifier.PathArgument;
25 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier;
26 import org.opendaylight.yangtools.yang.data.api.schema.NormalizedNode;
27 import org.opendaylight.yangtools.yang.data.api.schema.tree.DataTreeCandidateNode;
28 import org.slf4j.Logger;
29 import org.slf4j.LoggerFactory;
32 * Lazily translated {@link DataObjectModification} based on {@link DataTreeCandidateNode}.
35 * {@link LazyDataObjectModification} represents Data tree change event,
36 * but whole tree is not translated or resolved eagerly, but only child nodes
37 * which are directly accessed by user of data object modification.
39 * @param <T> Type of Binding Data Object
41 final class LazyDataObjectModification<T extends DataObject> implements DataObjectModification<T> {
43 private static final Logger LOG = LoggerFactory.getLogger(LazyDataObjectModification.class);
45 private final BindingCodecTreeNode<T> codec;
46 private final DataTreeCandidateNode domData;
47 private final PathArgument identifier;
49 private volatile Collection<DataObjectModification<? extends DataObject>> childNodesCache;
50 private volatile ModificationType modificationType;
52 private LazyDataObjectModification(final BindingCodecTreeNode<T> codec, final DataTreeCandidateNode domData) {
53 this.codec = Preconditions.checkNotNull(codec);
54 this.domData = Preconditions.checkNotNull(domData);
55 this.identifier = codec.deserializePathArgument(domData.getIdentifier());
58 static <T extends DataObject> DataObjectModification<T> create(final BindingCodecTreeNode<T> codec,
59 final DataTreeCandidateNode domData) {
60 return new LazyDataObjectModification<>(codec,domData);
63 private static Collection<DataObjectModification<? extends DataObject>> from(final BindingCodecTreeNode<?>
64 parentCodec, final Collection<DataTreeCandidateNode> domChildNodes) {
65 final List<DataObjectModification<? extends DataObject>> result = new ArrayList<>(domChildNodes.size());
66 populateList(result, parentCodec, domChildNodes);
70 private static void populateList(final List<DataObjectModification<? extends DataObject>> result,
71 final BindingCodecTreeNode<?> parentCodec, final Collection<DataTreeCandidateNode> domChildNodes) {
72 for (final DataTreeCandidateNode domChildNode : domChildNodes) {
73 final BindingStructuralType type = BindingStructuralType.from(domChildNode);
74 if (type != BindingStructuralType.NOT_ADDRESSABLE) {
76 * Even if type is UNKNOWN, from perspective of BindingStructuralType
77 * we try to load codec for it. We will use that type to further specify
81 final BindingCodecTreeNode<?> childCodec =
82 parentCodec.yangPathArgumentChild(domChildNode.getIdentifier());
83 populateList(result,type, childCodec, domChildNode);
84 } catch (final IllegalArgumentException e) {
85 if (type == BindingStructuralType.UNKNOWN) {
86 LOG.debug("Unable to deserialize unknown DOM node {}",domChildNode,e);
88 LOG.debug("Binding representation for DOM node {} was not found",domChildNode,e);
95 private static void populateList(final List<DataObjectModification<? extends DataObject>> result,
96 final BindingStructuralType type, final BindingCodecTreeNode<?> childCodec,
97 final DataTreeCandidateNode domChildNode) {
100 // We use parent codec intentionally.
101 populateListWithSingleCodec(result, childCodec, domChildNode.getChildNodes());
103 case INVISIBLE_CONTAINER:
104 populateList(result, childCodec, domChildNode.getChildNodes());
107 case VISIBLE_CONTAINER:
108 result.add(create(childCodec, domChildNode));
114 private static void populateListWithSingleCodec(final List<DataObjectModification<? extends DataObject>> result,
115 final BindingCodecTreeNode<?> codec, final Collection<DataTreeCandidateNode> childNodes) {
116 for (final DataTreeCandidateNode child : childNodes) {
117 result.add(create(codec, child));
122 public T getDataBefore() {
123 return deserialize(domData.getDataBefore());
127 public T getDataAfter() {
128 return deserialize(domData.getDataAfter());
132 public Class<T> getDataType() {
133 return codec.getBindingClass();
137 public PathArgument getIdentifier() {
142 public ModificationType getModificationType() {
143 ModificationType localType = modificationType;
144 if (localType != null) {
148 switch (domData.getModificationType()) {
151 localType = ModificationType.WRITE;
155 localType = ModificationType.DELETE;
157 case SUBTREE_MODIFIED:
158 localType = resolveSubtreeModificationType();
161 // TODO: Should we lie about modification type instead of exception?
162 throw new IllegalStateException("Unsupported DOM Modification type " + domData.getModificationType());
165 modificationType = localType;
169 private ModificationType resolveSubtreeModificationType() {
170 switch (codec.getChildAddressabilitySummary()) {
172 // All children are addressable, it is safe to report SUBTREE_MODIFIED
173 return ModificationType.SUBTREE_MODIFIED;
175 // All children are non-addressable, report WRITE
176 return ModificationType.WRITE;
178 // This case is not completely trivial, as we may have NOT_ADDRESSABLE nodes underneath us. If that
179 // is the case, we need to turn this modification into a WRITE operation, so that the user is able
180 // to observe those nodes being introduced. This is not efficient, but unfortunately unavoidable,
181 // as we cannot accurately represent such changes.
182 for (DataTreeCandidateNode child : domData.getChildNodes()) {
183 if (BindingStructuralType.recursiveFrom(child) == BindingStructuralType.NOT_ADDRESSABLE) {
184 // We have a non-addressable child, turn this modification into a write
185 return ModificationType.WRITE;
189 // No unaddressable children found, proceed in addressed mode
190 return ModificationType.SUBTREE_MODIFIED;
192 throw new IllegalStateException("Unsupported child addressability summary "
193 + codec.getChildAddressabilitySummary());
198 public Collection<DataObjectModification<? extends DataObject>> getModifiedChildren() {
199 Collection<DataObjectModification<? extends DataObject>> local = childNodesCache;
201 childNodesCache = local = from(codec, domData.getChildNodes());
206 @SuppressWarnings("unchecked")
208 public <C extends ChildOf<? super T>> Collection<DataObjectModification<C>>
209 getModifiedChildren(final Class<C> childType) {
210 List<DataObjectModification<C>> children = new ArrayList<>();
211 for (DataObjectModification<? extends DataObject> potential : getModifiedChildren()) {
212 if (childType.isAssignableFrom(potential.getDataType())) {
213 children.add((DataObjectModification<C>) potential);
220 public DataObjectModification<? extends DataObject> getModifiedChild(final PathArgument arg) {
221 final List<YangInstanceIdentifier.PathArgument> domArgumentList = new ArrayList<>();
222 final BindingCodecTreeNode<?> childCodec = codec.bindingPathArgumentChild(arg, domArgumentList);
223 final Iterator<YangInstanceIdentifier.PathArgument> toEnter = domArgumentList.iterator();
224 DataTreeCandidateNode current = domData;
225 while (toEnter.hasNext() && current != null) {
226 current = current.getModifiedChild(toEnter.next());
228 if (current != null) {
229 return create(childCodec, current);
235 @SuppressWarnings("unchecked")
236 public <C extends Identifiable<K> & ChildOf<? super T>, K extends Identifier<C>> DataObjectModification<C>
237 getModifiedChildListItem(final Class<C> listItem, final K listKey) {
238 return (DataObjectModification<C>) getModifiedChild(new InstanceIdentifier.IdentifiableItem<>(
243 @SuppressWarnings("unchecked")
244 public <C extends ChildOf<? super T>> DataObjectModification<C> getModifiedChildContainer(final Class<C> arg) {
245 return (DataObjectModification<C>) getModifiedChild(new InstanceIdentifier.Item<>(arg));
249 @SuppressWarnings("unchecked")
250 public <C extends Augmentation<T> & DataObject> DataObjectModification<C> getModifiedAugmentation(
251 final Class<C> augmentation) {
252 return (DataObjectModification<C>) getModifiedChild(new InstanceIdentifier.Item<>(augmentation));
255 private T deserialize(final Optional<NormalizedNode<?, ?>> dataAfter) {
256 if (dataAfter.isPresent()) {
257 return codec.deserialize(dataAfter.get());