2 * Copyright (c) 2020 PANTHEON.tech, s.r.o. 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.yangtools.yang.parser.stmt.reactor;
10 import static com.google.common.base.Preconditions.checkArgument;
11 import static com.google.common.base.Verify.verify;
13 import com.google.common.base.MoreObjects;
14 import com.google.common.base.MoreObjects.ToStringHelper;
15 import com.google.common.base.VerifyException;
16 import java.util.Collection;
18 import java.util.Optional;
20 import java.util.stream.Stream;
21 import org.eclipse.jdt.annotation.NonNull;
22 import org.eclipse.jdt.annotation.Nullable;
23 import org.opendaylight.yangtools.yang.common.Empty;
24 import org.opendaylight.yangtools.yang.common.QName;
25 import org.opendaylight.yangtools.yang.common.QNameModule;
26 import org.opendaylight.yangtools.yang.common.YangVersion;
27 import org.opendaylight.yangtools.yang.model.api.meta.DeclaredStatement;
28 import org.opendaylight.yangtools.yang.model.api.meta.EffectiveStatement;
29 import org.opendaylight.yangtools.yang.model.api.meta.StatementDefinition;
30 import org.opendaylight.yangtools.yang.model.api.stmt.AugmentStatement;
31 import org.opendaylight.yangtools.yang.model.api.stmt.ConfigEffectiveStatement;
32 import org.opendaylight.yangtools.yang.model.api.stmt.DeviationStatement;
33 import org.opendaylight.yangtools.yang.model.api.stmt.RefineStatement;
34 import org.opendaylight.yangtools.yang.model.api.stmt.SchemaNodeIdentifier;
35 import org.opendaylight.yangtools.yang.model.api.stmt.UsesStatement;
36 import org.opendaylight.yangtools.yang.model.repo.api.SourceIdentifier;
37 import org.opendaylight.yangtools.yang.parser.spi.meta.CopyType;
38 import org.opendaylight.yangtools.yang.parser.spi.meta.EffectiveStatementState;
39 import org.opendaylight.yangtools.yang.parser.spi.meta.EffectiveStmtCtx.Current;
40 import org.opendaylight.yangtools.yang.parser.spi.meta.InferenceException;
41 import org.opendaylight.yangtools.yang.parser.spi.meta.ModelActionBuilder;
42 import org.opendaylight.yangtools.yang.parser.spi.meta.ModelProcessingPhase;
43 import org.opendaylight.yangtools.yang.parser.spi.meta.ModelProcessingPhase.ExecutionOrder;
44 import org.opendaylight.yangtools.yang.parser.spi.meta.NamespaceBehaviour.Registry;
45 import org.opendaylight.yangtools.yang.parser.spi.meta.ParserNamespace;
46 import org.opendaylight.yangtools.yang.parser.spi.meta.StatementFactory;
47 import org.opendaylight.yangtools.yang.parser.spi.meta.StmtContext;
48 import org.opendaylight.yangtools.yang.parser.spi.meta.StmtContext.Mutable;
49 import org.opendaylight.yangtools.yang.parser.spi.meta.StmtContextUtils;
50 import org.opendaylight.yangtools.yang.parser.spi.source.SourceException;
51 import org.opendaylight.yangtools.yang.parser.spi.source.SupportedFeaturesNamespace;
52 import org.slf4j.Logger;
53 import org.slf4j.LoggerFactory;
56 * Real "core" reactor statement implementation of {@link Mutable}, supporting basic reactor lifecycle.
58 * @param <A> Argument type
59 * @param <D> Declared Statement representation
60 * @param <E> Effective Statement representation
62 abstract class ReactorStmtCtx<A, D extends DeclaredStatement<A>, E extends EffectiveStatement<A, D>>
63 extends NamespaceStorageSupport implements Mutable<A, D, E>, Current<A, D> {
64 private static final Logger LOG = LoggerFactory.getLogger(ReactorStmtCtx.class);
67 * Substatement refcount tracking. This mechanics deals with retaining substatements for the purposes of
68 * instantiating their lazy copies in InferredStatementContext. It works in concert with {@link #buildEffective()}
69 * and {@link #declared()}: declared/effective statement views hold an implicit reference and refcount-based
70 * sweep is not activated until they are done (or this statement is not {@link #isSupportedToBuildEffective}).
73 * Reference count is hierarchical in that parent references also pin down their child statements and do not allow
77 * The counter's positive values are tracking incoming references via {@link #incRef()}/{@link #decRef()} methods.
78 * Once we transition to sweeping, this value becomes negative counting upwards to {@link #REFCOUNT_NONE} based on
79 * {@link #sweepOnChildDone()}. Once we reach that, we transition to {@link #REFCOUNT_SWEPT}.
81 private int refcount = REFCOUNT_NONE;
83 * No outstanding references, this statement is a potential candidate for sweeping, provided it has populated its
84 * declared and effective views and {@link #parentRef} is known to be absent.
86 private static final int REFCOUNT_NONE = 0;
88 * Reference count overflow or some other recoverable logic error. Do not rely on refcounts and do not sweep
92 * Note on value assignment:
93 * This allow our incRef() to naturally progress to being saturated. Others jump there directly.
94 * It also makes it it impossible to observe {@code Interger.MAX_VALUE} children, which we take advantage of for
95 * {@link #REFCOUNT_SWEEPING}.
97 private static final int REFCOUNT_DEFUNCT = Integer.MAX_VALUE;
99 * This statement is being actively swept. This is a transient value set when we are sweeping our children, so that
100 * we prevent re-entering this statement.
103 * Note on value assignment:
104 * The value is lower than any legal child refcount due to {@link #REFCOUNT_DEFUNCT} while still being higher than
105 * {@link #REFCOUNT_SWEPT}.
107 private static final int REFCOUNT_SWEEPING = -Integer.MAX_VALUE;
109 * This statement, along with its entire subtree has been swept and we positively know all our children have reached
110 * this state. We {@link #sweepNamespaces()} upon reaching this state.
113 * Note on value assignment:
114 * This is the lowest value observable, making it easier on checking others on equality.
116 private static final int REFCOUNT_SWEPT = Integer.MIN_VALUE;
119 * Effective instance built from this context. This field as dual types. Under normal circumstances in matches the
120 * {@link #buildEffective()} instance. If this context is reused, it can be inflated to {@link EffectiveInstances}
121 * and also act as a common instance reuse site.
123 private @Nullable Object effectiveInstance;
125 // Master flag controlling whether this context can yield an effective statement
126 // FIXME: investigate the mechanics that are being supported by this, as it would be beneficial if we can get rid
127 // of this flag -- eliminating the initial alignment shadow used by below gap-filler fields.
128 private boolean isSupportedToBuildEffective = true;
130 // EffectiveConfig mapping
131 private static final int MASK_CONFIG = 0x03;
132 private static final int HAVE_CONFIG = 0x04;
133 // Effective instantiation mechanics for StatementContextBase: if this flag is set all substatements are known not
134 // change when instantiated. This includes context-independent statements as well as any statements which are
135 // ignored during copy instantiation.
136 private static final int ALL_INDEPENDENT = 0x08;
137 // Flag bit assignments
138 private static final int IS_SUPPORTED_BY_FEATURES = 0x10;
139 private static final int HAVE_SUPPORTED_BY_FEATURES = 0x20;
140 private static final int IS_IGNORE_IF_FEATURE = 0x40;
141 private static final int HAVE_IGNORE_IF_FEATURE = 0x80;
142 // Have-and-set flag constants, also used as masks
143 private static final int SET_SUPPORTED_BY_FEATURES = HAVE_SUPPORTED_BY_FEATURES | IS_SUPPORTED_BY_FEATURES;
144 private static final int SET_IGNORE_IF_FEATURE = HAVE_IGNORE_IF_FEATURE | IS_IGNORE_IF_FEATURE;
146 private static final EffectiveConfig[] EFFECTIVE_CONFIGS;
149 final EffectiveConfig[] values = EffectiveConfig.values();
150 final int length = values.length;
151 verify(length == 4, "Unexpected EffectiveConfig cardinality %s", length);
152 EFFECTIVE_CONFIGS = values;
155 // Flags for use with SubstatementContext. These are hiding in the alignment shadow created by above boolean and
156 // hence improve memory layout.
159 // Flag for use by AbstractResumedStatement, ReplicaStatementContext and InferredStatementContext. Each of them
160 // uses it to indicated a different condition. This is hiding in the alignment shadow created by
161 // 'isSupportedToBuildEffective'.
162 // FIXME: move this out once we have JDK15+
163 private boolean boolFlag;
169 ReactorStmtCtx(final ReactorStmtCtx<A, D, E> original) {
170 isSupportedToBuildEffective = original.isSupportedToBuildEffective;
171 boolFlag = original.boolFlag;
172 flags = original.flags;
175 // Used by ReplicaStatementContext only
176 ReactorStmtCtx(final ReactorStmtCtx<A, D, E> original, final Void dummy) {
177 boolFlag = isSupportedToBuildEffective = original.isSupportedToBuildEffective;
178 flags = original.flags;
183 // Common public interface contracts with simple mechanics. Please keep this in one logical block, so we do not end
184 // up mixing concerns and simple details with more complex logic.
189 public abstract StatementContextBase<?, ?, ?> getParentContext();
192 public abstract RootStatementContext<?, ?, ?> getRoot();
195 public abstract Collection<? extends @NonNull StatementContextBase<?, ?, ?>> mutableDeclaredSubstatements();
198 public final Registry getBehaviourRegistry() {
199 return getRoot().getBehaviourRegistryImpl();
203 public final YangVersion yangVersion() {
204 return getRoot().getRootVersionImpl();
208 public final void setRootVersion(final YangVersion version) {
209 getRoot().setRootVersionImpl(version);
213 public final void addRequiredSource(final SourceIdentifier dependency) {
214 getRoot().addRequiredSourceImpl(dependency);
218 public final void setRootIdentifier(final SourceIdentifier identifier) {
219 getRoot().setRootIdentifierImpl(identifier);
223 public final ModelActionBuilder newInferenceAction(final ModelProcessingPhase phase) {
224 return getRoot().getSourceContext().newInferenceAction(phase);
228 public final StatementDefinition publicDefinition() {
229 return definition().getPublicView();
233 public final Parent effectiveParent() {
234 return getParentContext();
238 public final QName moduleName() {
239 final var root = getRoot();
240 return QName.create(StmtContextUtils.getModuleQName(root), root.getRawArgument());
244 // In the next two methods we are looking for an effective statement. If we already have an effective instance,
245 // defer to it's implementation of the equivalent search. Otherwise we search our substatement contexts.
247 // Note that the search function is split, so as to allow InferredStatementContext to do its own thing first.
251 public final <X, Z extends EffectiveStatement<X, ?>> @NonNull Optional<X> findSubstatementArgument(
252 final @NonNull Class<Z> type) {
253 final E existing = effectiveInstance();
254 return existing != null ? existing.findFirstEffectiveSubstatementArgument(type)
255 : findSubstatementArgumentImpl(type);
259 public final boolean hasSubstatement(final @NonNull Class<? extends EffectiveStatement<?, ?>> type) {
260 final E existing = effectiveInstance();
261 return existing != null ? existing.findFirstEffectiveSubstatement(type).isPresent() : hasSubstatementImpl(type);
264 private E effectiveInstance() {
265 final Object existing = effectiveInstance;
266 return existing != null ? EffectiveInstances.local(existing) : null;
269 // Visible due to InferredStatementContext's override. At this point we do not have an effective instance available.
270 <X, Z extends EffectiveStatement<X, ?>> @NonNull Optional<X> findSubstatementArgumentImpl(
271 final @NonNull Class<Z> type) {
272 return allSubstatementsStream()
273 .filter(ctx -> ctx.isSupportedToBuildEffective() && ctx.producesEffective(type))
275 .map(ctx -> (X) ctx.getArgument());
278 // Visible due to InferredStatementContext's override. At this point we do not have an effective instance available.
279 boolean hasSubstatementImpl(final @NonNull Class<? extends EffectiveStatement<?, ?>> type) {
280 return allSubstatementsStream()
281 .anyMatch(ctx -> ctx.isSupportedToBuildEffective() && ctx.producesEffective(type));
286 @SuppressWarnings("unchecked")
287 public final <Z extends EffectiveStatement<A, D>> StmtContext<A, D, Z> caerbannog() {
288 return (StmtContext<A, D, Z>) this;
292 public final String toString() {
293 return addToStringAttributes(MoreObjects.toStringHelper(this).omitNullValues()).toString();
296 protected ToStringHelper addToStringAttributes(final ToStringHelper toStringHelper) {
297 return toStringHelper.add("definition", definition()).add("argument", argument()).add("refCount", refString());
300 private String refString() {
301 final int current = refcount;
302 return switch (current) {
303 case REFCOUNT_DEFUNCT -> "DEFUNCT";
304 case REFCOUNT_SWEEPING -> "SWEEPING";
305 case REFCOUNT_SWEPT -> "SWEPT";
306 default -> String.valueOf(refcount);
311 * Return the context in which this statement was defined.
313 * @return statement definition
315 abstract @NonNull StatementDefinitionContext<A, D, E> definition();
319 // NamespaceStorageSupport/Mutable integration methods. Keep these together.
324 public final <K, V, T extends K, N extends ParserNamespace<K, V>> V namespaceItem(final Class<@NonNull N> type,
326 return getBehaviourRegistry().getNamespaceBehaviour(type).getFrom(this, key);
330 public final <K, V, N extends ParserNamespace<K, V>> Map<K, V> namespace(final Class<@NonNull N> type) {
331 return getNamespace(type);
335 public final <K, V, N extends ParserNamespace<K, V>>
336 Map<K, V> localNamespacePortion(final Class<@NonNull N> type) {
337 return getLocalNamespace(type);
341 protected <K, V, N extends ParserNamespace<K, V>> void onNamespaceElementAdded(final Class<N> type, final K key,
343 // definition().onNamespaceElementAdded(this, type, key, value);
347 * Return the effective statement view of a copy operation. This method may return one of:
349 * <li>{@code this}, when the effective view did not change</li>
350 * <li>an InferredStatementContext, when there is a need for inference-equivalent copy</li>
351 * <li>{@code null}, when the statement failed to materialize</li>
354 * @param parent Proposed new parent
355 * @param type Copy operation type
356 * @param targetModule New target module
357 * @return {@link ReactorStmtCtx} holding effective view
359 abstract @Nullable ReactorStmtCtx<?, ?, ?> asEffectiveChildOf(StatementContextBase<?, ?, ?> parent, CopyType type,
360 QNameModule targetModule);
363 public final ReplicaStatementContext<A, D, E> replicaAsChildOf(final Mutable<?, ?, ?> parent) {
364 checkArgument(parent instanceof StatementContextBase, "Unsupported parent %s", parent);
365 final var ret = replicaAsChildOf((StatementContextBase<?, ?, ?>) parent);
366 definition().onStatementAdded(ret);
370 abstract @NonNull ReplicaStatementContext<A, D, E> replicaAsChildOf(@NonNull StatementContextBase<?, ?, ?> parent);
374 // Statement build entry points -- both public and package-private.
379 public final E buildEffective() {
380 final Object existing;
381 return (existing = effectiveInstance) != null ? EffectiveInstances.local(existing) : loadEffective();
384 private @NonNull E loadEffective() {
385 final E ret = createEffective();
386 effectiveInstance = ret;
387 // we have called createEffective(), substatements are no longer guarded by us. Let's see if we can clear up
389 if (refcount == REFCOUNT_NONE) {
395 abstract @NonNull E createEffective();
398 * Routing of the request to build an effective statement from {@link InferredStatementContext} towards the original
399 * definition site. This is needed to pick the correct instantiation method: for declared statements we will
400 * eventually land in {@link AbstractResumedStatement}, for underclared statements that will be
401 * {@link UndeclaredStmtCtx}.
403 * @param factory Statement factory
404 * @param ctx Inferred statement context, i.e. where the effective statement is instantiated
405 * @return Built effective stateue
407 abstract @NonNull E createInferredEffective(@NonNull StatementFactory<A, D, E> factory,
408 @NonNull InferredStatementContext<A, D, E> ctx, Stream<? extends StmtContext<?, ?, ?>> declared,
409 Stream<? extends StmtContext<?, ?, ?>> effective);
412 * Attach an effective copy of this statement. This essentially acts as a map, where we make a few assumptions:
414 * <li>{@code copy} and {@code this} statement share {@link #getOriginalCtx()} if it exists</li>
415 * <li>{@code copy} did not modify any statements relative to {@code this}</li>
418 * @param state effective statement state, acting as a lookup key
419 * @param stmt New copy to append
420 * @return {@code stmt} or a previously-created instances with the same {@code state}
422 @SuppressWarnings("unchecked")
423 final @NonNull E attachEffectiveCopy(final @NonNull EffectiveStatementState state, final @NonNull E stmt) {
424 final Object local = effectiveInstance;
425 final EffectiveInstances<E> instances;
426 if (local instanceof EffectiveInstances) {
427 instances = (EffectiveInstances<E>) local;
429 effectiveInstance = instances = new EffectiveInstances<>((E) local);
431 return instances.attachCopy(state, stmt);
435 * Walk this statement's copy history and return the statement closest to original which has not had its effective
436 * statements modified. This statement and returned substatement logically have the same set of substatements, hence
437 * share substatement-derived state.
439 * @return Closest {@link ReactorStmtCtx} with equivalent effective substatements
441 abstract @NonNull ReactorStmtCtx<A, D, E> unmodifiedEffectiveSource();
444 public final ModelProcessingPhase getCompletedPhase() {
445 return ModelProcessingPhase.ofExecutionOrder(executionOrder());
448 abstract byte executionOrder();
451 * Try to execute current {@link ModelProcessingPhase} of source parsing. If the phase has already been executed,
452 * this method does nothing. This must not be called with {@link ExecutionOrder#NULL}.
454 * @param phase to be executed (completed)
455 * @return true if phase was successfully completed
456 * @throws SourceException when an error occurred in source parsing
458 final boolean tryToCompletePhase(final byte executionOrder) {
459 return executionOrder() >= executionOrder || doTryToCompletePhase(executionOrder);
462 abstract boolean doTryToCompletePhase(byte targetOrder);
466 // Flags-based mechanics. These include public interfaces as well as all the crud we have lurking in our alignment
471 // Non-final form ImplicitStmtCtx
473 public boolean isSupportedToBuildEffective() {
474 return isSupportedToBuildEffective;
478 public final void setUnsupported() {
479 this.isSupportedToBuildEffective = false;
483 public final boolean isSupportedByFeatures() {
484 final int fl = flags & SET_SUPPORTED_BY_FEATURES;
486 return fl == SET_SUPPORTED_BY_FEATURES;
488 if (isIgnoringIfFeatures()) {
489 flags |= SET_SUPPORTED_BY_FEATURES;
494 * If parent is supported, we need to check if-features statements of this context.
496 if (isParentSupportedByFeatures()) {
497 // If the set of supported features has not been provided, all features are supported by default.
498 final Set<QName> supportedFeatures = getFromNamespace(SupportedFeaturesNamespace.class, Empty.value());
499 if (supportedFeatures == null || StmtContextUtils.checkFeatureSupport(this, supportedFeatures)) {
500 flags |= SET_SUPPORTED_BY_FEATURES;
505 // Either parent is not supported or this statement is not supported
506 flags |= HAVE_SUPPORTED_BY_FEATURES;
510 protected abstract boolean isParentSupportedByFeatures();
513 * Config statements are not all that common which means we are performing a recursive search towards the root
514 * every time {@link #effectiveConfig()} is invoked. This is quite expensive because it causes a linear search
515 * for the (usually non-existent) config statement.
518 * This method maintains a resolution cache, so once we have returned a result, we will keep on returning the same
519 * result without performing any lookups, solely to support {@link #effectiveConfig()}.
522 * Note: use of this method implies that {@link #isIgnoringConfig()} is realized with
523 * {@link #isIgnoringConfig(StatementContextBase)}.
525 final @NonNull EffectiveConfig effectiveConfig(final ReactorStmtCtx<?, ?, ?> parent) {
526 return (flags & HAVE_CONFIG) != 0 ? EFFECTIVE_CONFIGS[flags & MASK_CONFIG] : loadEffectiveConfig(parent);
529 private @NonNull EffectiveConfig loadEffectiveConfig(final ReactorStmtCtx<?, ?, ?> parent) {
530 final EffectiveConfig parentConfig = parent.effectiveConfig();
532 final EffectiveConfig myConfig;
533 if (parentConfig != EffectiveConfig.IGNORED && !definition().support().isIgnoringConfig()) {
534 final Optional<Boolean> optConfig = findSubstatementArgument(ConfigEffectiveStatement.class);
535 if (optConfig.isPresent()) {
536 if (optConfig.orElseThrow()) {
537 // Validity check: if parent is config=false this cannot be a config=true
538 InferenceException.throwIf(parentConfig == EffectiveConfig.FALSE, this,
539 "Parent node has config=false, this node must not be specifed as config=true");
540 myConfig = EffectiveConfig.TRUE;
542 myConfig = EffectiveConfig.FALSE;
545 // If "config" statement is not specified, the default is the same as the parent's "config" value.
546 myConfig = parentConfig;
549 myConfig = EffectiveConfig.IGNORED;
552 flags = (byte) (flags & ~MASK_CONFIG | HAVE_CONFIG | myConfig.ordinal());
556 protected abstract boolean isIgnoringConfig();
559 * This method maintains a resolution cache for ignore config, so once we have returned a result, we will
560 * keep on returning the same result without performing any lookups. Exists only to support
561 * {@link SubstatementContext#isIgnoringConfig()}.
564 * Note: use of this method implies that {@link #isConfiguration()} is realized with
565 * {@link #effectiveConfig(StatementContextBase)}.
567 final boolean isIgnoringConfig(final StatementContextBase<?, ?, ?> parent) {
568 return EffectiveConfig.IGNORED == effectiveConfig(parent);
571 protected abstract boolean isIgnoringIfFeatures();
574 * This method maintains a resolution cache for ignore if-feature, so once we have returned a result, we will
575 * keep on returning the same result without performing any lookups. Exists only to support
576 * {@link SubstatementContext#isIgnoringIfFeatures()}.
578 final boolean isIgnoringIfFeatures(final StatementContextBase<?, ?, ?> parent) {
579 final int fl = flags & SET_IGNORE_IF_FEATURE;
581 return fl == SET_IGNORE_IF_FEATURE;
583 if (definition().support().isIgnoringIfFeatures() || parent.isIgnoringIfFeatures()) {
584 flags |= SET_IGNORE_IF_FEATURE;
588 flags |= HAVE_IGNORE_IF_FEATURE;
592 // These two exist only due to memory optimization, should live in AbstractResumedStatement.
593 final boolean fullyDefined() {
597 final void setFullyDefined() {
601 // This exists only due to memory optimization, should live in ReplicaStatementContext. In this context the flag
602 // indicates the need to drop source's reference count when we are being swept.
603 final boolean haveSourceReference() {
607 // These three exist due to memory optimization, should live in InferredStatementContext. In this context the flag
608 // indicates whether or not this statement's substatement file was modified, i.e. it is not quite the same as the
610 final boolean isModified() {
614 final void setModified() {
618 final void setUnmodified() {
622 // These two exist only for StatementContextBase. Since we are squeezed for size, with only a single bit available
623 // in flags, we default to 'false' and only set the flag to true when we are absolutely sure -- and all other cases
624 // err on the side of caution by taking the time to evaluate each substatement separately.
625 final boolean allSubstatementsContextIndependent() {
626 return (flags & ALL_INDEPENDENT) != 0;
629 final void setAllSubstatementsContextIndependent() {
630 flags |= ALL_INDEPENDENT;
635 // Various functionality from AbstractTypeStatementSupport. This used to work on top of SchemaPath, now it still
636 // lives here. Ultimate future is either proper graduation or (more likely) move to AbstractTypeStatementSupport.
641 public final QName argumentAsTypeQName() {
642 // FIXME: This may yield illegal argument exceptions
643 return StmtContextUtils.qnameFromArgument(getOriginalCtx().orElse(this), getRawArgument());
647 public final QNameModule effectiveNamespace() {
648 if (StmtContextUtils.isUnknownStatement(this)) {
649 return publicDefinition().getStatementName().getModule();
651 if (producesDeclared(UsesStatement.class)) {
652 return coerceParent().effectiveNamespace();
655 final Object argument = argument();
656 if (argument instanceof QName qname) {
657 return qname.getModule();
659 if (argument instanceof String str) {
660 // FIXME: This may yield illegal argument exceptions
661 return StmtContextUtils.qnameFromArgument(getOriginalCtx().orElse(this), str).getModule();
663 if (argument instanceof SchemaNodeIdentifier sni
664 && (producesDeclared(AugmentStatement.class) || producesDeclared(RefineStatement.class)
665 || producesDeclared(DeviationStatement.class))) {
666 return sni.lastNodeIdentifier().getModule();
669 return coerceParent().effectiveNamespace();
672 private ReactorStmtCtx<?, ?, ?> coerceParent() {
673 return (ReactorStmtCtx<?, ?, ?>) coerceParentContext();
678 // Reference counting mechanics start. Please keep these methods in one block for clarity. Note this does not
679 // contribute to state visible outside of this package.
684 * Local knowledge of {@link #refcount} values up to statement root. We use this field to prevent recursive lookups
685 * in {@link #noParentRefs(StatementContextBase)} -- once we discover a parent reference once, we keep that
686 * knowledge and update it when {@link #sweep()} is invoked.
688 private byte parentRef = PARENTREF_UNKNOWN;
689 private static final byte PARENTREF_UNKNOWN = -1;
690 private static final byte PARENTREF_ABSENT = 0;
691 private static final byte PARENTREF_PRESENT = 1;
694 * Acquire a reference on this context. As long as there is at least one reference outstanding,
695 * {@link #buildEffective()} will not result in {@link #effectiveSubstatements()} being discarded.
697 * @throws VerifyException if {@link #effectiveSubstatements()} has already been discarded
699 final void incRef() {
700 final int current = refcount;
701 verify(current >= REFCOUNT_NONE, "Attempted to access reference count of %s", this);
702 if (current != REFCOUNT_DEFUNCT) {
703 // Note: can end up becoming REFCOUNT_DEFUNCT on overflow
704 refcount = current + 1;
706 LOG.debug("Disabled refcount increment of {}", this);
711 * Release a reference on this context. This call may result in {@link #effectiveSubstatements()} becoming
714 final void decRef() {
715 final int current = refcount;
716 if (current == REFCOUNT_DEFUNCT) {
718 LOG.debug("Disabled refcount decrement of {}", this);
721 if (current <= REFCOUNT_NONE) {
722 // Underflow, become defunct
723 // FIXME: add a global 'warn once' flag
724 LOG.warn("Statement refcount underflow, reference counting disabled for {}", this, new Throwable());
725 refcount = REFCOUNT_DEFUNCT;
729 refcount = current - 1;
730 LOG.trace("Refcount {} on {}", refcount, this);
732 if (refcount == REFCOUNT_NONE) {
738 * Return {@code true} if this context has no outstanding references.
740 * @return True if this context has no outstanding references.
742 final boolean noRefs() {
743 final int local = refcount;
744 return local < REFCOUNT_NONE || local == REFCOUNT_NONE && noParentRef();
747 private void lastDecRef() {
748 if (noImplictRef()) {
749 // We are no longer guarded by effective instance
754 final byte prevRefs = parentRef;
755 if (prevRefs == PARENTREF_ABSENT) {
756 // We are the last reference towards root, any children who observed PARENTREF_PRESENT from us need to be
759 } else if (prevRefs == PARENTREF_UNKNOWN) {
760 // Noone observed our parentRef, just update it
761 loadParentRefcount();
765 static final void markNoParentRef(final Collection<? extends ReactorStmtCtx<?, ?, ?>> substatements) {
766 for (ReactorStmtCtx<?, ?, ?> stmt : substatements) {
767 final byte prevRef = stmt.parentRef;
768 stmt.parentRef = PARENTREF_ABSENT;
769 if (prevRef == PARENTREF_PRESENT && stmt.refcount == REFCOUNT_NONE) {
770 // Child thinks it is pinned down, update its perspective
771 stmt.markNoParentRef();
776 abstract void markNoParentRef();
778 static final void sweep(final Collection<? extends ReactorStmtCtx<?, ?, ?>> substatements) {
779 for (ReactorStmtCtx<?, ?, ?> stmt : substatements) {
785 * Sweep this statement context as a result of {@link #sweepSubstatements()}, i.e. when parent is also being swept.
787 private void sweep() {
788 parentRef = PARENTREF_ABSENT;
789 if (refcount == REFCOUNT_NONE && noImplictRef()) {
790 LOG.trace("Releasing {}", this);
795 static final int countUnswept(final Collection<? extends ReactorStmtCtx<?, ?, ?>> substatements) {
797 for (ReactorStmtCtx<?, ?, ?> stmt : substatements) {
798 if (stmt.refcount > REFCOUNT_NONE || !stmt.noImplictRef()) {
806 * Implementation-specific sweep action. This is expected to perform a recursive {@link #sweep(Collection)} on all
807 * {@link #declaredSubstatements()} and {@link #effectiveSubstatements()} and report the result of the sweep
811 * {@link #effectiveSubstatements()} as well as namespaces may become inoperable as a result of this operation.
813 * @return True if the entire tree has been completely swept, false otherwise.
815 abstract int sweepSubstatements();
817 // Called when this statement does not have an implicit reference and have reached REFCOUNT_NONE
818 private void sweepOnDecrement() {
819 LOG.trace("Sweeping on decrement {}", this);
821 // No further parent references, sweep our state.
825 // Propagate towards parent if there is one
829 private void sweepParent() {
830 final ReactorStmtCtx<?, ?, ?> parent = getParentContext();
831 if (parent != null) {
832 parent.sweepOnChildDecrement();
836 // Called from child when it has lost its final reference
837 private void sweepOnChildDecrement() {
838 if (isAwaitingChildren()) {
839 // We are a child for which our parent is waiting. Notify it and we are done.
844 // Check parent reference count
845 final int refs = refcount;
846 if (refs > REFCOUNT_NONE || refs <= REFCOUNT_SWEEPING || !noImplictRef()) {
851 // parent is potentially reclaimable
853 LOG.trace("Cleanup {} of parent {}", refs, this);
860 private boolean noImplictRef() {
861 return effectiveInstance != null || !isSupportedToBuildEffective();
864 private boolean noParentRef() {
865 return parentRefcount() == PARENTREF_ABSENT;
868 private byte parentRefcount() {
870 return (refs = parentRef) != PARENTREF_UNKNOWN ? refs : loadParentRefcount();
873 private byte loadParentRefcount() {
874 return parentRef = calculateParentRefcount();
877 private byte calculateParentRefcount() {
878 final ReactorStmtCtx<?, ?, ?> parent = getParentContext();
879 if (parent == null) {
880 return PARENTREF_ABSENT;
883 // A slight wrinkle here is that our machinery handles only PRESENT -> ABSENT invalidation and we can reach here
884 // while inference is still ongoing and hence we may not have a complete picture about existing references. We
885 // could therefore end up caching an ABSENT result and then that information becoming stale as a new reference
887 if (parent.executionOrder() < ExecutionOrder.EFFECTIVE_MODEL) {
888 return PARENTREF_UNKNOWN;
891 // There are three possibilities:
892 // - REFCOUNT_NONE, in which case we need to search next parent
893 // - negative (< REFCOUNT_NONE), meaning parent is in some stage of sweeping, hence it does not have
895 // - positive (> REFCOUNT_NONE), meaning parent has an explicit refcount which is holding us down
896 final int refs = parent.refcount;
897 if (refs == REFCOUNT_NONE) {
898 return parent.parentRefcount();
900 return refs < REFCOUNT_NONE ? PARENTREF_ABSENT : PARENTREF_PRESENT;
903 private boolean isAwaitingChildren() {
904 return refcount > REFCOUNT_SWEEPING && refcount < REFCOUNT_NONE;
907 private void sweepOnChildDone() {
908 LOG.trace("Sweeping on child done {}", this);
909 final int current = refcount;
910 if (current >= REFCOUNT_NONE) {
911 // no-op, perhaps we want to handle some cases differently?
912 LOG.trace("Ignoring child sweep of {} for {}", this, current);
915 verify(current != REFCOUNT_SWEPT, "Attempt to sweep a child of swept %s", this);
917 refcount = current + 1;
918 LOG.trace("Child refcount {}", refcount);
919 if (refcount == REFCOUNT_NONE) {
921 final ReactorStmtCtx<?, ?, ?> parent = getParentContext();
922 LOG.trace("Propagating to parent {}", parent);
923 if (parent != null && parent.isAwaitingChildren()) {
924 parent.sweepOnChildDone();
929 private void sweepDone() {
930 LOG.trace("Sweep done for {}", this);
931 refcount = REFCOUNT_SWEPT;
935 private boolean sweepState() {
936 refcount = REFCOUNT_SWEEPING;
937 final int childRefs = sweepSubstatements();
938 if (childRefs == 0) {
942 if (childRefs < 0 || childRefs >= REFCOUNT_DEFUNCT) {
943 // FIXME: add a global 'warn once' flag
944 LOG.warn("Negative child refcount {} cannot be stored, reference counting disabled for {}", childRefs, this,
946 refcount = REFCOUNT_DEFUNCT;
948 LOG.trace("Still {} outstanding children of {}", childRefs, this);
949 refcount = -childRefs;