import com.google.common.base.Optional;
import com.google.common.base.Preconditions;
-import com.google.common.collect.Iterables;
import java.util.Collection;
import java.util.Map.Entry;
import java.util.concurrent.atomic.AtomicIntegerFieldUpdater;
+import javax.annotation.Nonnull;
+import org.opendaylight.yangtools.yang.common.QName;
import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier;
import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.PathArgument;
import org.opendaylight.yangtools.yang.data.api.schema.NormalizedNode;
import org.opendaylight.yangtools.yang.data.api.schema.NormalizedNodes;
+import org.opendaylight.yangtools.yang.data.api.schema.tree.CursorAwareDataTreeModification;
import org.opendaylight.yangtools.yang.data.api.schema.tree.DataTreeModification;
import org.opendaylight.yangtools.yang.data.api.schema.tree.DataTreeModificationCursor;
import org.opendaylight.yangtools.yang.data.api.schema.tree.StoreTreeNodes;
import org.opendaylight.yangtools.yang.data.api.schema.tree.spi.TreeNode;
import org.opendaylight.yangtools.yang.data.api.schema.tree.spi.Version;
+import org.opendaylight.yangtools.yang.model.api.SchemaContext;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
-final class InMemoryDataTreeModification implements DataTreeModification {
- private static final AtomicIntegerFieldUpdater<InMemoryDataTreeModification> UPDATER =
+final class InMemoryDataTreeModification extends AbstractCursorAware implements CursorAwareDataTreeModification {
+ private static final AtomicIntegerFieldUpdater<InMemoryDataTreeModification> SEALED_UPDATER =
AtomicIntegerFieldUpdater.newUpdater(InMemoryDataTreeModification.class, "sealed");
private static final Logger LOG = LoggerFactory.getLogger(InMemoryDataTreeModification.class);
@Override
public void write(final YangInstanceIdentifier path, final NormalizedNode<?, ?> data) {
checkSealed();
-
+ checkIdentifierReferencesData(path, data);
resolveModificationFor(path).write(data);
}
@Override
public void merge(final YangInstanceIdentifier path, final NormalizedNode<?, ?> data) {
checkSealed();
-
- resolveModificationFor(path).merge(data);
+ checkIdentifierReferencesData(path, data);
+ resolveModificationFor(path).merge(data, version);
}
@Override
* the requested path which has been modified. If no such node exists,
* we use the node itself.
*/
- final Entry<YangInstanceIdentifier, ModifiedNode> entry = StoreTreeNodes.findClosestsOrFirstMatch(rootNode, path, ModifiedNode.IS_TERMINAL_PREDICATE);
+ final Entry<YangInstanceIdentifier, ModifiedNode> entry = StoreTreeNodes.findClosestsOrFirstMatch(rootNode,
+ path, ModifiedNode.IS_TERMINAL_PREDICATE);
final YangInstanceIdentifier key = entry.getKey();
final ModifiedNode mod = entry.getValue();
final Optional<TreeNode> result = resolveSnapshot(key, mod);
if (result.isPresent()) {
- NormalizedNode<?, ?> data = result.get().getData();
+ final NormalizedNode<?, ?> data = result.get().getData();
return NormalizedNodes.findNode(key, data, path);
} else {
return Optional.absent();
}
try {
- return resolveModificationStrategy(path).apply(modification, modification.getOriginal(),
- version);
- } catch (Exception e) {
+ return resolveModificationStrategy(path).apply(modification, modification.getOriginal(), version);
+ } catch (final Exception e) {
LOG.error("Could not create snapshot for {}:{}", path, modification, e);
throw e;
}
}
- private void upgradeIfPossible() {
+ void upgradeIfPossible() {
if (rootNode.getOperation() == LogicalOperation.NONE) {
strategyTree.upgradeIfPossible();
}
LOG.trace("Resolving modification apply strategy for {}", path);
upgradeIfPossible();
- return StoreTreeNodes.<ModificationApplyOperation>findNodeChecked(strategyTree, path);
+ return StoreTreeNodes.findNodeChecked(strategyTree, path);
}
private OperationWithModification resolveModificationFor(final YangInstanceIdentifier path) {
ModifiedNode modification = rootNode;
int i = 1;
- for (PathArgument pathArg : path.getPathArguments()) {
- Optional<ModificationApplyOperation> potential = operation.getChild(pathArg);
+ for(final PathArgument pathArg : path.getPathArguments()) {
+ final Optional<ModificationApplyOperation> potential = operation.getChild(pathArg);
if (!potential.isPresent()) {
- throw new IllegalArgumentException(String.format("Child %s is not present in schema tree.",
- Iterables.toString(Iterables.limit(path.getPathArguments(), i))));
+ throw new SchemaValidationFailedException(String.format("Child %s is not present in schema tree.",
+ path.getAncestor(i)));
}
operation = potential.get();
++i;
- modification = modification.modifyChild(pathArg, operation.getChildPolicy());
+ modification = modification.modifyChild(pathArg, operation, version);
}
return OperationWithModification.from(operation, modification);
* We will use preallocated version, this means returned snapshot will
* have same version each time this method is called.
*/
- TreeNode originalSnapshotRoot = snapshot.getRootNode();
- Optional<TreeNode> tempRoot = strategyTree.apply(rootNode, Optional.of(originalSnapshotRoot), version);
+ final TreeNode originalSnapshotRoot = snapshot.getRootNode();
+ final Optional<TreeNode> tempRoot = strategyTree.apply(rootNode, Optional.of(originalSnapshotRoot), version);
+ Preconditions.checkState(tempRoot.isPresent(), "Data tree root is not present, possibly removed by previous modification");
- InMemoryDataTreeSnapshot tempTree = new InMemoryDataTreeSnapshot(snapshot.getSchemaContext(), tempRoot.get(), strategyTree);
+ final InMemoryDataTreeSnapshot tempTree = new InMemoryDataTreeSnapshot(snapshot.getSchemaContext(), tempRoot.get(), strategyTree);
return tempTree.newModification();
}
return version;
}
+ boolean isSealed() {
+ return sealed == 1;
+ }
+
private static void applyChildren(final DataTreeModificationCursor cursor, final ModifiedNode node) {
final Collection<ModifiedNode> children = node.getChildren();
if (!children.isEmpty()) {
cursor.enter(node.getIdentifier());
- for (ModifiedNode child : children) {
+ for (final ModifiedNode child : children) {
applyNode(cursor, child);
}
cursor.exit();
}
@Override
- public void applyToCursor(final DataTreeModificationCursor cursor) {
- for (ModifiedNode child : rootNode.getChildren()) {
+ public void applyToCursor(@Nonnull final DataTreeModificationCursor cursor) {
+ for (final ModifiedNode child : rootNode.getChildren()) {
applyNode(cursor, child);
}
}
+ static void checkIdentifierReferencesData(final PathArgument arg, final NormalizedNode<?, ?> data) {
+ Preconditions.checkArgument(arg.equals(data.getIdentifier()),
+ "Instance identifier references %s but data identifier is %s", arg, data.getIdentifier());
+ }
+
+ private static void checkIdentifierReferencesData(final YangInstanceIdentifier path, final NormalizedNode<?, ?> data) {
+ if (!path.isEmpty()) {
+ final PathArgument lastArg = path.getLastPathArgument();
+ Preconditions.checkArgument(lastArg != null, "Instance identifier %s has invalid null path argument", path);
+ checkIdentifierReferencesData(lastArg, data);
+ } else {
+ final QName type = data.getNodeType();
+ Preconditions.checkArgument(SchemaContext.NAME.equals(type), "Incorrect name %s of root node", type);
+ }
+ }
+
+ @Override
+ public DataTreeModificationCursor createCursor(@Nonnull final YangInstanceIdentifier path) {
+ final OperationWithModification op = resolveModificationFor(path);
+ return openCursor(new InMemoryDataTreeModificationCursor(this, path, op));
+ }
+
@Override
public void ready() {
- final boolean wasRunning = UPDATER.compareAndSet(this, 0, 1);
+ final boolean wasRunning = SEALED_UPDATER.compareAndSet(this, 0, 1);
Preconditions.checkState(wasRunning, "Attempted to seal an already-sealed Data Tree.");
- AbstractReadyIterator current = AbstractReadyIterator.create(rootNode);
+ AbstractReadyIterator current = AbstractReadyIterator.create(rootNode, strategyTree);
do {
- current = current.process();
+ current = current.process(version);
} while (current != null);
}
-
}