*/
package org.opendaylight.yangtools.yang.data.impl.schema.tree;
-import static com.google.common.base.Preconditions.checkArgument;
import static java.util.Objects.requireNonNull;
import com.google.common.base.MoreObjects;
+import java.lang.invoke.MethodHandles;
+import java.lang.invoke.VarHandle;
import java.util.Optional;
-import java.util.concurrent.atomic.AtomicReferenceFieldUpdater;
import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier;
import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.NodeIdentifierWithPredicates;
import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.PathArgument;
import org.opendaylight.yangtools.yang.data.api.schema.tree.spi.TreeNode;
import org.opendaylight.yangtools.yang.data.util.DataSchemaContextNode;
import org.opendaylight.yangtools.yang.data.util.DataSchemaContextTree;
-import org.opendaylight.yangtools.yang.model.api.ContainerSchemaNode;
+import org.opendaylight.yangtools.yang.model.api.ContainerLike;
import org.opendaylight.yangtools.yang.model.api.DataNodeContainer;
import org.opendaylight.yangtools.yang.model.api.DataSchemaNode;
+import org.opendaylight.yangtools.yang.model.api.EffectiveModelContext;
import org.opendaylight.yangtools.yang.model.api.ListSchemaNode;
-import org.opendaylight.yangtools.yang.model.api.SchemaContext;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
* Read-only snapshot of the data tree.
*/
final class InMemoryDataTree extends AbstractDataTreeTip implements DataTree {
- private static final AtomicReferenceFieldUpdater<InMemoryDataTree, DataTreeState> STATE_UPDATER =
- AtomicReferenceFieldUpdater.newUpdater(InMemoryDataTree.class, DataTreeState.class, "state");
+ private static final VarHandle STATE;
+
+ static {
+ try {
+ STATE = MethodHandles.lookup().findVarHandle(InMemoryDataTree.class, "state", DataTreeState.class);
+ } catch (NoSuchFieldException | IllegalAccessException e) {
+ throw new ExceptionInInitializerError(e);
+ }
+ }
+
private static final Logger LOG = LoggerFactory.getLogger(InMemoryDataTree.class);
private final DataTreeConfiguration treeConfig;
private final boolean maskMandatory;
/**
- * Current data store state generation.
+ * Current data store state generation. All accesses need to go through {@link #STATE}
*/
+ @SuppressWarnings("unused")
private volatile DataTreeState state;
InMemoryDataTree(final TreeNode rootNode, final DataTreeConfiguration treeConfig,
- final SchemaContext schemaContext) {
+ final EffectiveModelContext schemaContext) {
this.treeConfig = requireNonNull(treeConfig, "treeConfig");
maskMandatory = true;
state = DataTreeState.createInitial(rootNode);
if (schemaContext != null) {
- setSchemaContext(schemaContext);
+ setEffectiveModelContext(schemaContext);
}
}
InMemoryDataTree(final TreeNode rootNode, final DataTreeConfiguration treeConfig,
- final SchemaContext schemaContext, final DataSchemaNode rootSchemaNode, final boolean maskMandatory) {
+ final EffectiveModelContext schemaContext, final DataSchemaNode rootSchemaNode,
+ final boolean maskMandatory) {
this.treeConfig = requireNonNull(treeConfig, "treeConfig");
this.maskMandatory = maskMandatory;
}
private ModificationApplyOperation getOperation(final DataSchemaNode rootSchemaNode) {
- if (rootSchemaNode instanceof ContainerSchemaNode && maskMandatory) {
- return new ContainerModificationStrategy((ContainerSchemaNode) rootSchemaNode, treeConfig);
+ if (rootSchemaNode instanceof ContainerLike && maskMandatory) {
+ return new ContainerModificationStrategy((ContainerLike) rootSchemaNode, treeConfig);
}
if (rootSchemaNode instanceof ListSchemaNode) {
final PathArgument arg = treeConfig.getRootPath().getLastPathArgument();
if (arg instanceof NodeIdentifierWithPredicates) {
- return maskMandatory ? new ListEntryModificationStrategy((ListSchemaNode) rootSchemaNode, treeConfig)
- : ListEntryModificationStrategy.of((ListSchemaNode) rootSchemaNode, treeConfig);
+ return maskMandatory ? new MapEntryModificationStrategy((ListSchemaNode) rootSchemaNode, treeConfig)
+ : MapEntryModificationStrategy.of((ListSchemaNode) rootSchemaNode, treeConfig);
}
}
- return SchemaAwareApplyOperation.from(rootSchemaNode, treeConfig);
+ try {
+ return SchemaAwareApplyOperation.from(rootSchemaNode, treeConfig);
+ } catch (ExcludedDataSchemaNodeException e) {
+ throw new IllegalArgumentException("Root node does not belong current data tree", e);
+ }
+ }
+
+ @Override
+ public void setEffectiveModelContext(final EffectiveModelContext newModelContext) {
+ internalSetSchemaContext(newModelContext);
}
/*
* This method is synchronized to guard against user attempting to install
* multiple contexts. Otherwise it runs in a lock-free manner.
*/
- @Override
- public synchronized void setSchemaContext(final SchemaContext newSchemaContext) {
+ private synchronized void internalSetSchemaContext(final EffectiveModelContext newSchemaContext) {
requireNonNull(newSchemaContext);
LOG.debug("Following schema contexts will be attempted {}", newSchemaContext);
DataTreeState currentState;
DataTreeState newState;
do {
- currentState = state;
+ currentState = currentState();
newState = currentState.withSchemaContext(newSchemaContext, rootNode);
- } while (!STATE_UPDATER.compareAndSet(this, currentState, newState));
+ // TODO: can we lower this to compareAndSwapRelease?
+ } while (!STATE.compareAndSet(this, currentState, newState));
}
@Override
public InMemoryDataTreeSnapshot takeSnapshot() {
- return state.newSnapshot();
+ return currentState().newSnapshot();
}
@Override
if (candidate instanceof NoopDataTreeCandidate) {
return;
}
- checkArgument(candidate instanceof InMemoryDataTreeCandidate, "Invalid candidate class %s",
- candidate.getClass());
- final InMemoryDataTreeCandidate c = (InMemoryDataTreeCandidate)candidate;
+ if (!(candidate instanceof InMemoryDataTreeCandidate)) {
+ throw new IllegalArgumentException("Invalid candidate class " + candidate.getClass());
+ }
+ final InMemoryDataTreeCandidate c = (InMemoryDataTreeCandidate)candidate;
if (LOG.isTraceEnabled()) {
LOG.trace("Data Tree is {}", NormalizedNodes.toStringTree(c.getTipRoot().getData()));
}
DataTreeState currentState;
DataTreeState newState;
do {
- currentState = state;
+ currentState = currentState();
final TreeNode currentRoot = currentState.getRoot();
LOG.debug("Updating datastore from {} to {}", currentRoot, newRoot);
newState = currentState.withRoot(newRoot);
LOG.trace("Updated state from {} to {}", currentState, newState);
- } while (!STATE_UPDATER.compareAndSet(this, currentState, newState));
+ // TODO: can we lower this to compareAndSwapRelease?
+ } while (!STATE.compareAndSet(this, currentState, newState));
}
private static String simpleToString(final Object obj) {
return obj.getClass().getName() + "@" + Integer.toHexString(obj.hashCode());
}
+ private DataTreeState currentState() {
+ return (DataTreeState) STATE.getAcquire(this);
+ }
+
@Override
public YangInstanceIdentifier getRootPath() {
return treeConfig.getRootPath();
return MoreObjects.toStringHelper(this)
.add("object", super.toString())
.add("config", treeConfig)
- .add("state", state)
+ .add("state", currentState())
.toString();
}
@Override
protected TreeNode getTipRoot() {
- return state.getRoot();
+ return currentState().getRoot();
}
}
Code Review / yangtools.git / blobdiff