mirror of
https://github.com/OPCFoundation/UA-.NETStandard.git
synced 2026-10-29 15:11:53 +08:00
Closes #4201. Closes #4202. Closes #4203. Closes #4215. Closes #4216. (#4215 and #4216 are @marcschier's originals from the #4188 review; #4202 and #4201 are my later duplicates of the same two findings. All four describe the two changes in section 1 and are closed together.) **This PR now carries what was #4221 as well.** The two were a stack; they have been unstacked and combined here, and #4221 is closed. Everything below the "Read the server diagnostics" section is the work that was previously reviewed as #4221. --- ## 1. The browse path guards itself, and the last node locks are gone `AsyncCustomNodeManager` kept two `lock (source)` sites around `CreateBrowser`, carrying a NOTE that browser creation was not internally synchronized. `NodeBrowser` still handed its lock to derived types through `protected Lock DataLock`. `NodeState.CreateBrowser` now holds a browse lock across `PopulateBrowser` and `OnPopulateBrowser`, so browser construction on a node is serialized — which is what the external `lock (source)` was actually providing, and what a handler that mutates the node during population (the historian's lazy config installer) depends on. Both `lock (source)` statements and the NOTE are gone. **What that lock does not do**, stated plainly in the XML docs and in `docs/NodeManagers.md` rather than over-promised: it is not an atomic snapshot across the node's children, notifiers and references. Writers take those collections' own locks, not the browse lock. The browser is a point-in-time copy and each collection is read consistently, but the combination is not a transaction. No `lock` takes a `NodeState` as its sync root any more. That was the last thing keeping `NodeState` from being documentably self-guarding, so the other eleven went with it: `lock (activeNode)`, `lock (target)`, `lock (source.Node)`, `lock (target.Node)`, `lock (notifier)`, `lock (handle.Node)` in `AsyncCustomNodeManager`, and `lock (node)` in `CustomNodeManager2`. Most were a check-then-act pair now served by `NodeState.AddReferenceIfMissing`, which does the check and the insert under the node's own lock. `NodeBrowser.DataLock` is removed. A browser is **single-consumer**: it belongs to whoever created it, and both server browse paths already serialize on the owning side. The exposed lock only added an inheritance-level locking contract that a derived browser could not reason about. ## 2. Read the server diagnostics under the lock every writer takes `OnUpdateDiagnostics` locked the diagnostics **payload** rather than the lock every writer takes through `UpdateServerDiagnostics`, so the snapshot a client reads from the `ServerDiagnostics` node was never excluded from a concurrent writer. Both halves matter, and the second is the one that is easy to miss: ```csharp lock (m_diagnosticsLock) // was: lock (ServerDiagnostics) { value = Variant.FromStructure(ServerDiagnostics, copy: true); // was: copy defaulted to false } ``` `copy: true` is what makes it a snapshot. `FromStructure(value, copy: false)` does `new ExtensionObject(value, copy)` — it wraps the **live** structure without copying it, so the caller would read the fields long after the lock was released and see them change underneath. Swapping the lock alone would have looked like a fix while still excluding nothing. ## 3. Analyzer numbering The browser rule is **UA0027**, not UA0025. This branch had independently taken UA0025 for `NodeBrowser.DataLock` while #4188 published UA0025 for `ILocalNode.DataLock` and UA0026 for `BaseVariableValue.Lock`. Master's are shipped, so they keep the numbers: | | UA0025 | UA0026 | UA0027 | |---|---|---|---| | master (#4188) | `ILocalNode.DataLock` | `BaseVariableValue.Lock` | — | | **this PR** | `ILocalNode.DataLock` | `BaseVariableValue.Lock` | **`NodeBrowser.DataLock`** | Both sides had written a different `UA0025Tests.cs`, which arrived as an add/add conflict. They are now split: `UA0025Tests.cs` holds master's `ILocalNode` tests, `UA0027Tests.cs` holds the `NodeBrowser` ones. UA0024's help text also drops its reference to `ReadServerDiagnostics`, which #4193 removed as unused, and names `ISession.ReadDiagnostics` / `ISubscription.ReadDiagnostics` instead — those do still exist. ## 4. Two more locks reachable from outside their owner **`ApplicationConfiguration.PropertiesLock` is removed.** It returned the properties dictionary itself, so `lock (configuration.PropertiesLock)` was `lock (configuration.Properties)` — the lock *was* the data it guarded, the same shape as #4203. It had exactly one production consumer (`OAuth2CredentialCollection.Load`, a get-or-add with `ParseExtension` called inside the lock), so it could not simply be deleted. `Properties` is now a `ConcurrentDictionary` — same public type, every operation atomic on its own — and the one multi-operation need gets a member of its own: ```csharp public T GetOrAddProperty<T>(string key, Func<T> valueFactory); ``` It deliberately does **not** invoke the factory under a lock, so `ParseExtension` now runs outside any critical section. Holding a lock across a caller-supplied callback is exactly the shape that produced the attribute/diagnostics deadlock earlier in this work. The two existing tests asserted only `PropertiesLock is not null`, so they tested nothing but its presence. They are replaced by tests of the contract: factory runs once for a missing key, not at all for a present one, 32 concurrent callers all observe the same instance, null arguments throw. `PropertiesLock` ships in 1.5.378, so this is a breaking removal — migration guide section plus analyzer **UA0028**. **`SharedDefinitionCache` no longer hands out its lock.** Three sites in `SharedKeyValueSubscriptionStore` took the nested cache's `Lock` to operate on the cache's own dictionary. Both are private now, behind `ReplaceAll` and `CloneWhere`. `SnapshotCommitLock` stays exposed on purpose: it is a `SemaphoreSlim` sequencing an async commit across `await` points, which `System.Threading.Lock` cannot span, so folding it in would change behaviour rather than hide a lock. ## Verification Merged `master` (`0edfe237a`, including #4234) with no conflicts. - `dotnet build UA.slnx` — 0 warnings, 0 errors - `Opc.Ua.Server.Tests` — 4074 passed - `Opc.Ua.Types.Tests` — 8501 passed - `Opc.Ua.MigrationAnalyzer.Tests` — 151 passed on all five TFMs (138 → 151, the new ones being UA0027 and UA0028) - `Opc.Ua.Core.Tests` — 4249 passed - `Opc.Ua.Redundancy.Server.Tests` — 573 passed ## Note for the reviewer @romanett — your approval was given when this PR's diff was the 7 diagnostics files, because it was measured against `marcschier/node-browse-locks`. Now that the two are combined and the base is `master`, the diff is 23 files, and the extra 16 are the node/browser lock work that was #4221. GitHub kept the approval across the retarget, but it did not cover that code, so please re-review rather than let it ride. --------- Co-authored-by: Copilot <223556219+Copilot@users.noreply.github.com> Copilot-Session: e9c13dd0-a6e3-4ad2-8ad6-1c3fe6323041 Copilot-Session: b3c0e146-5b9e-4d08-a0f6-db3f940484b1 Copilot-Session: d18f87e9-2484-44ce-98ce-463ba6cf5f63 Copilot-Session: 0ee22c1d-c319-4257-bf78-a5a077a1824a
747 lines
29 KiB
C#
747 lines
29 KiB
C#
/* ========================================================================
|
|
* Copyright (c) 2005-2025 The OPC Foundation, Inc. All rights reserved.
|
|
*
|
|
* OPC Foundation MIT License 1.00
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person
|
|
* obtaining a copy of this software and associated documentation
|
|
* files (the "Software"), to deal in the Software without
|
|
* restriction, including without limitation the rights to use,
|
|
* copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
* copies of the Software, and to permit persons to whom the
|
|
* Software is furnished to do so, subject to the following
|
|
* conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be
|
|
* included in all copies or substantial portions of the Software.
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
|
|
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
|
|
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
|
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
|
|
* OTHER DEALINGS IN THE SOFTWARE.
|
|
*
|
|
* The complete license agreement can be found here:
|
|
* http://opcfoundation.org/License/MIT/1.00/
|
|
* ======================================================================*/
|
|
|
|
using System;
|
|
using System.Collections.Concurrent;
|
|
using System.Collections.Generic;
|
|
using System.Threading;
|
|
using System.Threading.Tasks;
|
|
using NUnit.Framework;
|
|
using Opc.Ua.Tests;
|
|
|
|
namespace Opc.Ua.Core.Tests.Stack.State
|
|
{
|
|
/// <summary>
|
|
/// Characterization tests for concurrent attribute read/write on a single
|
|
/// <see cref="NodeState"/>.
|
|
/// </summary>
|
|
/// <remarks>
|
|
/// <para>
|
|
/// These tests pin the observable behaviour of attribute access under contention.
|
|
/// They were written before <see cref="NodeState"/> owned its synchronization and are
|
|
/// retained unchanged in substance afterwards, which is what makes them a regression
|
|
/// net for that change.
|
|
/// </para>
|
|
/// <para>
|
|
/// Previously <see cref="NodeState.ReadAttributeAsync"/> and
|
|
/// <see cref="NodeState.WriteAttributeAsync"/> took <c>lock(this)</c>, and the
|
|
/// synchronous paths relied on external callers taking <c>lock(source)</c> on the node -
|
|
/// a contract carried only in prose. The node now guards its own attribute access with a
|
|
/// private lock, so these tests call it without any external locking; earlier revisions
|
|
/// of this file had to take that lock to satisfy the old contract.
|
|
/// </para>
|
|
/// <para>
|
|
/// The existing <c>NodeStateHandlerConcurrencyTests</c> covers a different concern -
|
|
/// racing a handler assignment against an attribute write. It does not exercise mutual
|
|
/// exclusion between readers and writers, which is what these tests add.
|
|
/// </para>
|
|
/// </remarks>
|
|
[TestFixture]
|
|
[SetCulture("en-us")]
|
|
[SetUICulture("en-us")]
|
|
[Category("NodeStateConcurrency")]
|
|
[Parallelizable]
|
|
public class NodeStateAttributeConcurrencyTests
|
|
{
|
|
private const int kIterations = 2000;
|
|
private const int kReaderCount = 4;
|
|
|
|
/// <summary>
|
|
/// Concurrent asynchronous reads of the same attribute must all succeed and
|
|
/// must never observe a value that was never written.
|
|
/// </summary>
|
|
[Test]
|
|
public async Task ConcurrentAsyncReadsObserveOnlyWrittenValuesAsync()
|
|
{
|
|
(ISystemContext context, BaseVariableState node) = CreateWritableVariable();
|
|
|
|
var observed = new ConcurrentBag<double>();
|
|
using var cts = new CancellationTokenSource(TimeSpan.FromSeconds(10));
|
|
|
|
Task writer = Task.Run(
|
|
() =>
|
|
{
|
|
for (int i = 0; i < kIterations && !cts.IsCancellationRequested; i++)
|
|
{
|
|
// The node is written through the documented contract, with no
|
|
// external locking: the node guards its own attributes.
|
|
ServiceResult result = node.WriteAttribute(
|
|
context,
|
|
Attributes.Value,
|
|
default,
|
|
new DataValue(new Variant((double)i)));
|
|
|
|
Assert.That(
|
|
ServiceResult.IsGood(result),
|
|
Is.True,
|
|
$"value write {i} failed: {result}");
|
|
}
|
|
},
|
|
cts.Token);
|
|
|
|
Task[] readers = new Task[kReaderCount];
|
|
for (int r = 0; r < kReaderCount; r++)
|
|
{
|
|
readers[r] = Task.Run(
|
|
async () =>
|
|
{
|
|
// do-while: guarantees at least one read even when the writer
|
|
// completes before this task is scheduled.
|
|
do
|
|
{
|
|
(ServiceResult result, DataValue value) = await node
|
|
.ReadAttributeAsync(
|
|
context,
|
|
Attributes.Value,
|
|
default,
|
|
default,
|
|
new DataValue(),
|
|
cts.Token)
|
|
.ConfigureAwait(false);
|
|
|
|
Assert.That(ServiceResult.IsGood(result), Is.True);
|
|
|
|
if (value.WrappedValue.TryGetValue(out double observedValue))
|
|
{
|
|
observed.Add(observedValue);
|
|
}
|
|
}
|
|
while (!writer.IsCompleted && !cts.IsCancellationRequested);
|
|
},
|
|
cts.Token);
|
|
}
|
|
|
|
await writer.ConfigureAwait(false);
|
|
await Task.WhenAll(readers).ConfigureAwait(false);
|
|
|
|
Assert.That(observed, Is.Not.Empty, "readers observed no values at all");
|
|
|
|
foreach (double value in observed)
|
|
{
|
|
Assert.That(
|
|
value,
|
|
Is.InRange(0d, kIterations - 1),
|
|
"reader observed a value that was never written");
|
|
Assert.That(
|
|
value % 1d,
|
|
Is.Zero,
|
|
"reader observed a torn or interpolated value");
|
|
}
|
|
}
|
|
|
|
/// <summary>
|
|
/// A value and a status code written as one attribute write must never be observed
|
|
/// apart: the reader must not see the value from one write paired with the status
|
|
/// code from another.
|
|
/// </summary>
|
|
/// <remarks>
|
|
/// The atomic unit is a single attribute write carrying a whole
|
|
/// <see cref="DataValue"/>. The individual <c>Value</c> / <c>StatusCode</c> setters
|
|
/// each take the node's lock separately, so a pair of setter calls is deliberately
|
|
/// <b>not</b> a transaction and a reader may legitimately observe the state between
|
|
/// them. Callers needing an atomic multi-field update must use one attribute write,
|
|
/// which is what the server does.
|
|
/// </remarks>
|
|
[Test]
|
|
public async Task CorrelatedValueAndStatusAreNeverObservedTornAsync()
|
|
{
|
|
(ISystemContext context, BaseVariableState node) = CreateWritableVariable();
|
|
|
|
using var cts = new CancellationTokenSource(TimeSpan.FromSeconds(10));
|
|
var failures = new ConcurrentBag<string>();
|
|
|
|
Task writer = Task.Run(
|
|
() =>
|
|
{
|
|
for (int i = 0; i < kIterations && !cts.IsCancellationRequested; i++)
|
|
{
|
|
// Even iterations write Good, odd write Uncertain, so value
|
|
// parity and status are correlated and a torn read is visible.
|
|
StatusCode status = i % 2 == 0
|
|
? StatusCodes.Good
|
|
: StatusCodes.UncertainLastUsableValue;
|
|
|
|
ServiceResult result = node.WriteAttribute(
|
|
context,
|
|
Attributes.Value,
|
|
default,
|
|
new DataValue(new Variant((double)i), status, DateTimeUtc.Now));
|
|
|
|
Assert.That(
|
|
ServiceResult.IsGood(result),
|
|
Is.True,
|
|
$"correlated write {i} failed: {result}");
|
|
}
|
|
},
|
|
cts.Token);
|
|
|
|
Task[] readers = new Task[kReaderCount];
|
|
for (int r = 0; r < kReaderCount; r++)
|
|
{
|
|
readers[r] = Task.Run(
|
|
async () =>
|
|
{
|
|
// do-while: guarantees at least one read even when the writer
|
|
// completes before this task is scheduled.
|
|
do
|
|
{
|
|
(ServiceResult result, DataValue value) = await node
|
|
.ReadAttributeAsync(
|
|
context,
|
|
Attributes.Value,
|
|
default,
|
|
default,
|
|
new DataValue(),
|
|
cts.Token)
|
|
.ConfigureAwait(false);
|
|
|
|
if (!ServiceResult.IsGood(result) ||
|
|
!value.WrappedValue.TryGetValue(out double observed))
|
|
{
|
|
continue;
|
|
}
|
|
|
|
bool expectedGood = (long)observed % 2 == 0;
|
|
bool actualGood = value.StatusCode == StatusCodes.Good;
|
|
|
|
if (expectedGood != actualGood)
|
|
{
|
|
failures.Add(
|
|
$"value {observed} observed with status {value.StatusCode}");
|
|
}
|
|
}
|
|
while (!writer.IsCompleted && !cts.IsCancellationRequested);
|
|
},
|
|
cts.Token);
|
|
}
|
|
|
|
await writer.ConfigureAwait(false);
|
|
await Task.WhenAll(readers).ConfigureAwait(false);
|
|
|
|
Assert.That(
|
|
failures,
|
|
Is.Empty,
|
|
$"observed {failures.Count} torn value/status pairs, e.g. {FirstOrNone(failures)}");
|
|
}
|
|
|
|
/// <summary>
|
|
/// Interleaved synchronous and asynchronous reads must agree: the async path
|
|
/// must not observe state the synchronous path cannot, and neither must fail.
|
|
/// </summary>
|
|
[Test]
|
|
public async Task SyncAndAsyncReadPathsAgreeUnderContentionAsync()
|
|
{
|
|
(ISystemContext context, BaseVariableState node) = CreateWritableVariable();
|
|
|
|
using var cts = new CancellationTokenSource(TimeSpan.FromSeconds(10));
|
|
|
|
int lastWritten = -1;
|
|
|
|
Task writer = Task.Run(
|
|
() =>
|
|
{
|
|
for (int i = 0; i < kIterations && !cts.IsCancellationRequested; i++)
|
|
{
|
|
node.Value = (double)i;
|
|
Volatile.Write(ref lastWritten, i);
|
|
}
|
|
},
|
|
cts.Token);
|
|
|
|
Task syncReader = Task.Run(
|
|
() =>
|
|
{
|
|
// do-while: guarantees at least one read even when the writer
|
|
// completes before this task is scheduled.
|
|
do
|
|
{
|
|
var value = new DataValue();
|
|
ServiceResult result;
|
|
|
|
result = node.ReadAttribute(
|
|
context,
|
|
Attributes.Value,
|
|
default,
|
|
default,
|
|
ref value);
|
|
|
|
Assert.That(ServiceResult.IsGood(result), Is.True);
|
|
Assert.That(value.WrappedValue.TryGetValue(out double _), Is.True);
|
|
}
|
|
while (!writer.IsCompleted && !cts.IsCancellationRequested);
|
|
},
|
|
cts.Token);
|
|
|
|
Task asyncReader = Task.Run(
|
|
async () =>
|
|
{
|
|
// do-while: guarantees at least one read even when the writer
|
|
// completes before this task is scheduled.
|
|
do
|
|
{
|
|
(ServiceResult result, DataValue value) = await node
|
|
.ReadAttributeAsync(
|
|
context,
|
|
Attributes.Value,
|
|
default,
|
|
default,
|
|
new DataValue(),
|
|
cts.Token)
|
|
.ConfigureAwait(false);
|
|
|
|
Assert.That(ServiceResult.IsGood(result), Is.True);
|
|
Assert.That(value.WrappedValue.TryGetValue(out double _), Is.True);
|
|
}
|
|
while (!writer.IsCompleted && !cts.IsCancellationRequested);
|
|
},
|
|
cts.Token);
|
|
|
|
await writer.ConfigureAwait(false);
|
|
await Task.WhenAll(syncReader, asyncReader).ConfigureAwait(false);
|
|
|
|
var final = new DataValue();
|
|
ServiceResult finalResult = node.ReadAttribute(
|
|
context,
|
|
Attributes.Value,
|
|
default,
|
|
default,
|
|
ref final);
|
|
|
|
Assert.That(ServiceResult.IsGood(finalResult), Is.True);
|
|
Assert.That(final.WrappedValue.TryGetValue(out double finalValue), Is.True);
|
|
|
|
// Asserted against what the writer actually wrote. These tests run in parallel
|
|
// and the timeout may pre-empt the loop, so a fixed expectation would be flaky.
|
|
Assert.That(Volatile.Read(ref lastWritten), Is.GreaterThanOrEqualTo(0));
|
|
Assert.That(finalValue, Is.EqualTo((double)Volatile.Read(ref lastWritten)));
|
|
}
|
|
|
|
/// <summary>
|
|
/// Concurrent writes to distinct attributes of the same node must all be
|
|
/// applied - none may be lost to a race on the shared node state.
|
|
/// </summary>
|
|
[Test]
|
|
public async Task ConcurrentWritesToDistinctAttributesAreAllAppliedAsync()
|
|
{
|
|
(ISystemContext context, BaseVariableState node) = CreateWritableVariable();
|
|
|
|
using var cts = new CancellationTokenSource(TimeSpan.FromSeconds(10));
|
|
|
|
int lastValueWritten = -1;
|
|
int lastDescriptionWritten = -1;
|
|
|
|
Task valueWriter = Task.Run(
|
|
() =>
|
|
{
|
|
for (int i = 0; i < kIterations && !cts.IsCancellationRequested; i++)
|
|
{
|
|
ServiceResult result = node.WriteAttribute(
|
|
context,
|
|
Attributes.Value,
|
|
default,
|
|
new DataValue(new Variant((double)i)));
|
|
Assert.That(ServiceResult.IsGood(result), Is.True);
|
|
Volatile.Write(ref lastValueWritten, i);
|
|
}
|
|
},
|
|
cts.Token);
|
|
|
|
Task descriptionWriter = Task.Run(
|
|
() =>
|
|
{
|
|
for (int i = 0; i < kIterations && !cts.IsCancellationRequested; i++)
|
|
{
|
|
ServiceResult result = node.WriteAttribute(
|
|
context,
|
|
Attributes.Description,
|
|
default,
|
|
new DataValue(
|
|
new Variant(new LocalizedText($"description-{i}"))));
|
|
Assert.That(ServiceResult.IsGood(result), Is.True);
|
|
Volatile.Write(ref lastDescriptionWritten, i);
|
|
}
|
|
},
|
|
cts.Token);
|
|
|
|
await Task.WhenAll(valueWriter, descriptionWriter).ConfigureAwait(false);
|
|
|
|
var value = new DataValue();
|
|
Assert.That(
|
|
ServiceResult.IsGood(
|
|
node.ReadAttribute(context, Attributes.Value, default, default, ref value)),
|
|
Is.True);
|
|
Assert.That(value.WrappedValue.TryGetValue(out double lastValue), Is.True);
|
|
|
|
// Asserted against what each writer actually wrote. These tests run in parallel
|
|
// and the timeout may pre-empt a loop, so fixed expectations would be flaky.
|
|
Assert.That(Volatile.Read(ref lastValueWritten), Is.GreaterThanOrEqualTo(0));
|
|
Assert.That(Volatile.Read(ref lastDescriptionWritten), Is.GreaterThanOrEqualTo(0));
|
|
Assert.That(lastValue, Is.EqualTo((double)Volatile.Read(ref lastValueWritten)));
|
|
|
|
Assert.That(
|
|
node.Description.Text,
|
|
Is.EqualTo($"description-{Volatile.Read(ref lastDescriptionWritten)}"),
|
|
"a write to Description was lost");
|
|
}
|
|
|
|
/// <summary>
|
|
/// Creating a browser while another thread mutates the node's references must never
|
|
/// fault: the node guards the browser build itself, so no caller needs to lock it.
|
|
/// </summary>
|
|
/// <remarks>
|
|
/// This test could not be written before the browse path owned its synchronization.
|
|
/// The lock lived in the node manager, outside the node, so an unrelated caller of
|
|
/// <see cref="NodeState.CreateBrowser"/> raced the reference collection with nothing
|
|
/// excluding it.
|
|
/// </remarks>
|
|
[Test]
|
|
public async Task ConcurrentBrowseAndReferenceWritesNeverFaultAsync()
|
|
{
|
|
(ISystemContext context, BaseVariableState node) = CreateWritableVariable();
|
|
|
|
using var cts = new CancellationTokenSource(TimeSpan.FromSeconds(10));
|
|
|
|
int browsesCompleted = 0;
|
|
|
|
Task writer = Task.Run(
|
|
() =>
|
|
{
|
|
for (int i = 0; i < kIterations && !cts.IsCancellationRequested; i++)
|
|
{
|
|
var targetId = new ExpandedNodeId($"target-{i}", 7);
|
|
|
|
node.AddReferenceIfMissing(
|
|
ReferenceTypeIds.HasCause,
|
|
false,
|
|
targetId);
|
|
node.RemoveReference(ReferenceTypeIds.HasCause, false, targetId);
|
|
}
|
|
},
|
|
cts.Token);
|
|
|
|
Task[] browsers = new Task[kReaderCount];
|
|
for (int r = 0; r < kReaderCount; r++)
|
|
{
|
|
browsers[r] = Task.Run(
|
|
() =>
|
|
{
|
|
// do-while: guarantees at least one browse even when the writer
|
|
// completes before this task is scheduled.
|
|
do
|
|
{
|
|
using INodeBrowser browser = node.CreateBrowser(
|
|
context,
|
|
null,
|
|
default,
|
|
false,
|
|
BrowseDirection.Both,
|
|
default,
|
|
null,
|
|
true);
|
|
|
|
while (browser.Next() != null)
|
|
{
|
|
// drain the snapshot.
|
|
}
|
|
|
|
Interlocked.Increment(ref browsesCompleted);
|
|
}
|
|
while (!writer.IsCompleted && !cts.IsCancellationRequested);
|
|
},
|
|
cts.Token);
|
|
}
|
|
|
|
await writer.ConfigureAwait(false);
|
|
await Task.WhenAll(browsers).ConfigureAwait(false);
|
|
|
|
Assert.That(
|
|
Volatile.Read(ref browsesCompleted),
|
|
Is.GreaterThan(0),
|
|
"no browse completed at all");
|
|
}
|
|
|
|
/// <summary>
|
|
/// A browser is a snapshot: references added after it was created must not appear in
|
|
/// it, and every reference present when it was created must.
|
|
/// </summary>
|
|
[Test]
|
|
public void BrowserIsASnapshotTakenAtCreation()
|
|
{
|
|
(ISystemContext context, BaseVariableState node) = CreateWritableVariable();
|
|
|
|
for (int i = 0; i < 4; i++)
|
|
{
|
|
node.AddReference(
|
|
ReferenceTypeIds.HasCause,
|
|
false,
|
|
new ExpandedNodeId($"before-{i}", 7));
|
|
}
|
|
|
|
using INodeBrowser snapshot = node.CreateBrowser(
|
|
context,
|
|
null,
|
|
ReferenceTypeIds.HasCause,
|
|
false,
|
|
BrowseDirection.Forward,
|
|
default,
|
|
null,
|
|
true);
|
|
|
|
for (int i = 0; i < 3; i++)
|
|
{
|
|
node.AddReference(
|
|
ReferenceTypeIds.HasCause,
|
|
false,
|
|
new ExpandedNodeId($"after-{i}", 7));
|
|
}
|
|
|
|
Assert.That(
|
|
Drain(snapshot),
|
|
Is.EqualTo(4),
|
|
"references added after the browser was created must not appear in it");
|
|
|
|
using INodeBrowser later = node.CreateBrowser(
|
|
context,
|
|
null,
|
|
ReferenceTypeIds.HasCause,
|
|
false,
|
|
BrowseDirection.Forward,
|
|
default,
|
|
null,
|
|
true);
|
|
|
|
Assert.That(
|
|
Drain(later),
|
|
Is.EqualTo(7),
|
|
"a browser created afterwards must see every reference");
|
|
}
|
|
|
|
/// <summary>
|
|
/// Browsing while another thread adds and removes children must never fault and must
|
|
/// never yield a partially built snapshot.
|
|
/// </summary>
|
|
[Test]
|
|
public async Task ConcurrentBrowseAndChildWritesNeverFaultAsync()
|
|
{
|
|
(ISystemContext context, BaseVariableState node) = CreateWritableVariable();
|
|
|
|
using var cts = new CancellationTokenSource(TimeSpan.FromSeconds(10));
|
|
|
|
var faults = new ConcurrentBag<string>();
|
|
int browsesCompleted = 0;
|
|
|
|
Task writer = Task.Run(
|
|
() =>
|
|
{
|
|
for (int i = 0; i < kIterations && !cts.IsCancellationRequested; i++)
|
|
{
|
|
var child = new PropertyState(node)
|
|
{
|
|
NodeId = new NodeId($"child-{i}", 7),
|
|
BrowseName = new QualifiedName($"child-{i}", 7),
|
|
DisplayName = new LocalizedText($"child-{i}"),
|
|
SymbolicName = $"child-{i}",
|
|
ReferenceTypeId = ReferenceTypeIds.HasProperty
|
|
};
|
|
|
|
node.AddChild(child);
|
|
node.RemoveChild(child);
|
|
}
|
|
},
|
|
cts.Token);
|
|
|
|
Task[] browsers = new Task[kReaderCount];
|
|
for (int r = 0; r < kReaderCount; r++)
|
|
{
|
|
browsers[r] = Task.Run(
|
|
() =>
|
|
{
|
|
do
|
|
{
|
|
using INodeBrowser browser = node.CreateBrowser(
|
|
context,
|
|
null,
|
|
ReferenceTypeIds.HasProperty,
|
|
false,
|
|
BrowseDirection.Forward,
|
|
default,
|
|
null,
|
|
true);
|
|
|
|
foreach (IReference reference in Enumerate(browser))
|
|
{
|
|
if (reference.ReferenceTypeId.IsNull)
|
|
{
|
|
faults.Add("browser produced a reference with no type");
|
|
}
|
|
}
|
|
|
|
Interlocked.Increment(ref browsesCompleted);
|
|
}
|
|
while (!writer.IsCompleted && !cts.IsCancellationRequested);
|
|
},
|
|
cts.Token);
|
|
}
|
|
|
|
await writer.ConfigureAwait(false);
|
|
await Task.WhenAll(browsers).ConfigureAwait(false);
|
|
|
|
Assert.That(faults, Is.Empty, FirstOrNone(faults));
|
|
Assert.That(
|
|
Volatile.Read(ref browsesCompleted),
|
|
Is.GreaterThan(0),
|
|
"no browse completed at all");
|
|
}
|
|
|
|
/// <summary>
|
|
/// A browser hands back every reference exactly once, and a pushed-back reference is
|
|
/// returned again before the rest. This is the single-consumer contract that replaced
|
|
/// the browser's former internal lock.
|
|
/// </summary>
|
|
[Test]
|
|
public void BrowserReturnsEachReferenceOnceAndHonoursPushBack()
|
|
{
|
|
(ISystemContext context, BaseVariableState node) = CreateWritableVariable();
|
|
|
|
for (int i = 0; i < 8; i++)
|
|
{
|
|
node.AddReference(
|
|
ReferenceTypeIds.HasCause,
|
|
false,
|
|
new ExpandedNodeId($"target-{i}", 7));
|
|
}
|
|
|
|
using INodeBrowser browser = node.CreateBrowser(
|
|
context,
|
|
null,
|
|
ReferenceTypeIds.HasCause,
|
|
false,
|
|
BrowseDirection.Forward,
|
|
default,
|
|
null,
|
|
true);
|
|
|
|
IReference first = browser.Next();
|
|
Assert.That(first, Is.Not.Null);
|
|
|
|
browser.Push(first);
|
|
Assert.That(
|
|
browser.Next(),
|
|
Is.SameAs(first),
|
|
"a pushed-back reference must be returned before any other");
|
|
|
|
int remaining = Drain(browser);
|
|
Assert.That(remaining, Is.EqualTo(7), "every reference must be returned exactly once");
|
|
}
|
|
|
|
private static int Drain(INodeBrowser browser)
|
|
{
|
|
int count = 0;
|
|
|
|
while (browser.Next() != null)
|
|
{
|
|
count++;
|
|
}
|
|
|
|
return count;
|
|
}
|
|
|
|
private static IEnumerable<IReference> Enumerate(INodeBrowser browser)
|
|
{
|
|
for (IReference reference = browser.Next();
|
|
reference != null;
|
|
reference = browser.Next())
|
|
{
|
|
yield return reference;
|
|
}
|
|
}
|
|
|
|
private static (ISystemContext Context, BaseVariableState Node) CreateWritableVariable()
|
|
{
|
|
ITelemetryContext telemetry = NUnitTelemetryContext.Create();
|
|
var serviceMessageContext = ServiceMessageContext.Create(telemetry);
|
|
|
|
var context = new SystemContext(telemetry)
|
|
{
|
|
NamespaceUris = serviceMessageContext.NamespaceUris
|
|
};
|
|
|
|
// Mirrors the proven setup in NodeStateHandlerConcurrencyTests: a fully
|
|
// created node whose access levels are applied through WriteAttribute.
|
|
var node = new AnalogUnitRangeState(null);
|
|
|
|
node.Create(
|
|
context,
|
|
new NodeId("ConcurrencyTestNode", 7),
|
|
new QualifiedName("ConcurrencyTestNode", 7),
|
|
new LocalizedText("ConcurrencyTestNode"),
|
|
true);
|
|
|
|
node.WriteMask =
|
|
AttributeWriteMask.AccessLevel |
|
|
AttributeWriteMask.Description |
|
|
AttributeWriteMask.DisplayName |
|
|
AttributeWriteMask.UserAccessLevel |
|
|
AttributeWriteMask.UserWriteMask |
|
|
AttributeWriteMask.WriteMask;
|
|
node.UserWriteMask = node.WriteMask;
|
|
|
|
ServiceResult result = node.WriteAttribute(
|
|
context,
|
|
Attributes.AccessLevel,
|
|
default,
|
|
new DataValue(new Variant(AccessLevels.CurrentReadOrWrite)));
|
|
Assert.That(ServiceResult.IsGood(result), Is.True, $"AccessLevel setup: {result}");
|
|
|
|
result = node.WriteAttribute(
|
|
context,
|
|
Attributes.UserAccessLevel,
|
|
default,
|
|
new DataValue(new Variant(AccessLevels.CurrentReadOrWrite)));
|
|
Assert.That(ServiceResult.IsGood(result), Is.True, $"UserAccessLevel setup: {result}");
|
|
|
|
// Seed a value so readers starting before the first write still observe a
|
|
// well-typed double rather than an unset variant.
|
|
result = node.WriteAttribute(
|
|
context,
|
|
Attributes.Value,
|
|
default,
|
|
new DataValue(new Variant(0d)));
|
|
Assert.That(ServiceResult.IsGood(result), Is.True, $"Value seed: {result}");
|
|
|
|
return (context, node);
|
|
}
|
|
|
|
private static string FirstOrNone(ConcurrentBag<string> bag)
|
|
{
|
|
return bag.TryPeek(out string first) ? first : "<none>";
|
|
}
|
|
}
|
|
}
|