/* ======================================================================== * 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.Generic; using System.Diagnostics; using System.Diagnostics.Metrics; using System.Linq; using System.Threading; using System.Threading.Tasks; using BitFaster.Caching; using BitFaster.Caching.Lfu; using BitFaster.Caching.Lru; using Microsoft.Extensions.Logging; using Opc.Ua.Redaction; namespace Opc.Ua.Client { /// /// This node cache is a real cache and consists of three LRU caches. /// These caches contain nodes and references (Read and browse). /// Cache entries expire after not being accessed for a certain time. /// The cache is thread-safe and can be accessed by multiple readers. /// It is also limited to a capacity at which point least recently used /// entries will be evicted. /// public sealed class NodeCache : INodeCache, IDisposable { /// /// Create cache /// public NodeCache( INodeCacheContext context, ITelemetryContext telemetry, TimeSpan? cacheExpiry = null, int capacity = 4096) { m_context = context; m_logger = telemetry.CreateLogger(); cacheExpiry ??= TimeSpan.FromMinutes(5); BitFaster.Caching.Lru.Builder.AtomicAsyncConcurrentLruBuilder< NodeId, INode > nodesBuilder = new ConcurrentLruBuilder() .WithAtomicGetOrAdd() .AsAsyncCache() .WithCapacity(capacity) .WithKeyComparer(NodeIdComparer.Default) .WithExpireAfterAccess(cacheExpiry.Value) .WithMetrics(); BitFaster.Caching.Lru.Builder.AtomicAsyncConcurrentLruBuilder< NodeId, ArrayOf > refsBuilder = new ConcurrentLruBuilder>() .WithAtomicGetOrAdd() .AsAsyncCache() .WithCapacity(capacity) .WithKeyComparer(NodeIdComparer.Default) .WithExpireAfterAccess(cacheExpiry.Value) .WithMetrics(); BitFaster.Caching.Lru.Builder.AtomicAsyncConcurrentLruBuilder< NodeId, DataValue > valuesBuilder = new ConcurrentLruBuilder() .WithAtomicGetOrAdd() .AsAsyncCache() .WithCapacity(capacity) .WithKeyComparer(NodeIdComparer.Default) .WithExpireAfterAccess(cacheExpiry.Value) .WithMetrics(); m_nodes = nodesBuilder.Build(); m_values = valuesBuilder.Build(); m_refs = refsBuilder.Build(); m_meter = telemetry.CreateMeter(); RegisterMetrics(m_meter, "nodes", m_nodes); RegisterMetrics(m_meter, "values", m_values); RegisterMetrics(m_meter, "references", m_refs); } /// /// Dispose the underlying meter. /// public void Dispose() { m_meter.Dispose(); } private static void RegisterMetrics( Meter meter, string cacheTag, IAsyncCache cache) where TKey : notnull { KeyValuePair[] tag = [ new KeyValuePair("cache", cacheTag) ]; meter.CreateObservableCounter( "opcua.client.nodecache.hits", () => { Optional metrics = cache.Metrics; return new Measurement(metrics.HasValue ? metrics.Value!.Hits : 0, tag); }, description: "Number of cache hits in the OPC UA client node cache."); meter.CreateObservableCounter( "opcua.client.nodecache.misses", () => { Optional metrics = cache.Metrics; return new Measurement(metrics.HasValue ? metrics.Value!.Misses : 0, tag); }, description: "Number of cache misses in the OPC UA client node cache."); meter.CreateObservableCounter( "opcua.client.nodecache.evictions", () => { Optional metrics = cache.Metrics; return new Measurement(metrics.HasValue ? metrics.Value!.Evicted : 0, tag); }, description: "Number of evictions from the OPC UA client node cache."); meter.CreateObservableGauge( "opcua.client.nodecache.size", () => new Measurement(cache.Count, tag), description: "Current number of entries in the OPC UA client node cache."); } /// /// Node metrics /// public ICacheMetrics? NodesMetrics => m_nodes.Metrics.Value; /// /// Value metrics /// public ICacheMetrics? ValuesMetrics => m_values.Metrics.Value; /// /// References metrics /// public ICacheMetrics? ReferencesMetrics => m_refs.Metrics.Value; /// public NamespaceTable NamespaceUris => m_context.NamespaceUris; /// public ValueTask GetNodeAsync(NodeId nodeId, CancellationToken ct) { return m_nodes.TryGet(nodeId, out INode? node) ? new ValueTask(node) : FindAsyncCore(nodeId, ct); ValueTask FindAsyncCore(NodeId nodeId, CancellationToken ct) { return m_nodes.GetOrAddAsync( nodeId, async key => { Node node = await m_context.FetchNodeAsync( null, key, NodeClass.Unspecified, ct: ct) .ConfigureAwait(false); // Populate the node's ReferenceTable so callers can // introspect references without an extra round trip. // Mirrors legacy NodeCache behavior. await PopulateReferenceTableAsync(key, node, ct) .ConfigureAwait(false); return node; }); } } /// public ValueTask> GetNodesAsync( ArrayOf nodeIds, CancellationToken ct) { int count = nodeIds.Count; var result = new List(nodeIds.Count); if (count != 0) { var notFound = new List(); foreach (NodeId nodeId in nodeIds) { if (m_nodes.TryGet(nodeId, out INode? node)) { result.Add(node); continue; } notFound.Add(nodeId); result.Add(null); } if (notFound.Count != 0) { return FetchRemainingAsync(notFound, result, ct); } } Debug.Assert(!result.Any(r => r == null)); // None now should be null return new ValueTask>(result.ToArrayOf()!); } /// public ValueTask GetValueAsync(NodeId nodeId, CancellationToken ct) { return m_values.TryGet(nodeId, out DataValue dataValue) ? new ValueTask(dataValue) : FindAsyncCore(nodeId, ct); ValueTask FindAsyncCore(NodeId nodeId, CancellationToken ct) { INodeCacheContext context = m_context; return m_values.GetOrAddAsync( nodeId, async key => await context.FetchValueAsync(null, key, ct) .ConfigureAwait(false)); } } /// public ValueTask> GetValuesAsync( ArrayOf nodeIds, CancellationToken ct) { int count = nodeIds.Count; var result = new List(nodeIds.Count); if (count != 0) { var notFound = new List(); foreach (NodeId nodeId in nodeIds) { if (m_values.TryGet(nodeId, out DataValue dataValue)) { result.Add(dataValue); continue; } notFound.Add(nodeId); result.Add(default); } if (notFound.Count != 0) { return FetchRemainingAsync(notFound, result, ct); } } Debug.Assert(!result.Any(r => r.IsNull)); // None now should be null return new ValueTask>(result.ToArrayOf()); } /// public ValueTask> GetReferencesAsync( NodeId nodeId, NodeId referenceTypeId, bool isInverse, bool includeSubtypes, CancellationToken ct) { return (!includeSubtypes || IsTypeHierarchyLoaded([referenceTypeId])) && m_refs.TryGet(nodeId, out ArrayOf references) ? GetNodesAsync( FilterNodes(references, isInverse, referenceTypeId, includeSubtypes), ct) : FindReferencesAsyncCore(nodeId, referenceTypeId, isInverse, includeSubtypes, ct); async ValueTask> FindReferencesAsyncCore( NodeId nodeId, NodeId referenceTypeId, bool isInverse, bool includeSubtypes, CancellationToken ct) { if (includeSubtypes) { await LoadTypeHierarchyAsync([referenceTypeId], ct).ConfigureAwait(false); } ArrayOf references = await GetOrAddReferencesAsync(nodeId, ct) .ConfigureAwait(false); return await GetNodesAsync( FilterNodes(references, isInverse, referenceTypeId, includeSubtypes), ct) .ConfigureAwait(false); } ArrayOf FilterNodes( ArrayOf references, bool isInverse, NodeId refTypeId, bool includeSubtypes) { return references .Filter(r => r.IsForward == !isInverse && ( r.ReferenceTypeId == refTypeId || (includeSubtypes && IsTypeOf(r.ReferenceTypeId, refTypeId)))) .ConvertAll(r => ToNodeId(r.NodeId)) .Filter(n => !n.IsNull); } } /// public ValueTask> GetReferencesAsync( ArrayOf nodeIds, ArrayOf referenceTypeIds, bool isInverse, bool includeSubtypes, CancellationToken ct) { var targetIds = new List(); var notFound = new List(); if (includeSubtypes && !IsTypeHierarchyLoaded(referenceTypeIds)) { // Type hierarchy is not fully cached, so the synchronous // IsTypeOf used by FilterNodes cannot reliably classify // references. Force every input node through the async // core which loads the hierarchy first before filtering. foreach (NodeId nodeId in nodeIds) { if (!nodeId.IsNull) { notFound.Add(nodeId); } } return FindReferencesAsyncCore( notFound, referenceTypeIds, isInverse, includeSubtypes, targetIds, ct); } foreach (NodeId nodeId in nodeIds) { if (nodeId.IsNull) { continue; } if (m_refs.TryGet(nodeId, out ArrayOf references)) { targetIds.AddRange( FilterNodes(references, isInverse, referenceTypeIds, includeSubtypes)); } else { notFound.Add(nodeId); } } return notFound.Count != 0 ? FindReferencesAsyncCore( notFound, referenceTypeIds, isInverse, includeSubtypes, targetIds, ct) : GetNodesAsync(targetIds.ToArrayOf(), ct); async ValueTask> FindReferencesAsyncCore( List nodeIds, ArrayOf referenceTypeIds, bool isInverse, bool includeSubtypes, List targetIds, CancellationToken ct) { if (includeSubtypes) { await LoadTypeHierarchyAsync(referenceTypeIds, ct).ConfigureAwait(false); } foreach (NodeId nodeId in nodeIds) { ArrayOf references = await GetOrAddReferencesAsync( nodeId, ct) .ConfigureAwait(false); targetIds.AddRange( FilterNodes(references, isInverse, referenceTypeIds, includeSubtypes)); } return await GetNodesAsync(targetIds.ToArrayOf(), ct).ConfigureAwait(false); } ArrayOf FilterNodes( ArrayOf references, bool isInverse, ArrayOf referenceTypeIds, bool includeSubtypes) { return references .Filter(r => r.IsForward == !isInverse && !referenceTypeIds.Find(refTypeId => r.ReferenceTypeId == refTypeId || (includeSubtypes && IsTypeOf(r.ReferenceTypeId, refTypeId))).IsNull) .ConvertAll(r => ToNodeId(r.NodeId)) .Filter(n => !n.IsNull); } } /// public async ValueTask LoadTypeHierarchyAsync( ArrayOf typeIds, CancellationToken ct) { ArrayOf nodes = await GetReferencesAsync( typeIds, [ReferenceTypeIds.HasSubtype], false, false, ct) .ConfigureAwait(false); if (nodes.Count > 0) { await LoadTypeHierarchyAsync(nodes.ConvertAll(n => ToNodeId(n.NodeId)), ct) .ConfigureAwait(false); } } /// /// Synchronous best-effort type-of check used internally by /// the reference filter. Blocks if the subtype's references /// have not been pre-loaded — callers must call /// first to avoid this. /// private bool IsTypeOf(NodeId subTypeId, NodeId superTypeId) { if (subTypeId == superTypeId) { return true; } if (!m_refs.TryGet(subTypeId, out ArrayOf references)) { // block - we can throw here but user should load references = GetOrAddReferencesAsync(subTypeId, default).AsTask().GetAwaiter() .GetResult(); } subTypeId = GetSuperTypeFromReferences(references); return !subTypeId.IsNull && IsTypeOf(subTypeId, superTypeId); } /// public void Clear() { m_nodes.Clear(); m_values.Clear(); m_refs.Clear(); } /// public void InvalidateNode(NodeId nodeId) { if (nodeId.IsNull) { return; } m_nodes.TryRemove(nodeId); m_values.TryRemove(nodeId); m_refs.TryRemove(nodeId); } // IAsyncNodeTable / IAsyncTypeTable / INodeCache implementation /// public StringTable ServerUris => m_context.ServerUris; /// IAsyncTypeTable IAsyncNodeTable.TypeTree => this; /// /// Legacy synchronous type table adapter for backwards compatibility with /// callers that expect . /// public ITypeTable TypeTree => this.AsTypeTable(); /// public async ValueTask ExistsAsync(ExpandedNodeId nodeId, CancellationToken ct) { return await FindAsync(nodeId, ct).ConfigureAwait(false) != null; } /// public async ValueTask FindAsync(ExpandedNodeId nodeId, CancellationToken ct) { if (nodeId.IsNull) { return null; } var localId = ExpandedNodeId.ToNodeId(nodeId, NamespaceUris); if (localId.IsNull) { return null; } try { return await GetNodeAsync(localId, ct).ConfigureAwait(false); } catch (Exception e) { m_logger.LogError( "Could not find node {NodeId}: {Error}", nodeId, Redact.Create(e)); return null; } } /// /// public async ValueTask FindAsync( ExpandedNodeId sourceId, NodeId referenceTypeId, bool isInverse, bool includeSubtypes, QualifiedName browseName, CancellationToken ct) { NodeId localSourceId = ToNodeId(sourceId); if (localSourceId.IsNull) { return null; } ArrayOf nodes = await GetReferencesAsync( localSourceId, referenceTypeId, isInverse, includeSubtypes, ct) .ConfigureAwait(false); foreach (INode node in nodes.ToList()) { if (node.BrowseName == browseName) { return node; } } return null; } /// public async ValueTask> FindAsync( ExpandedNodeId sourceId, NodeId referenceTypeId, bool isInverse, bool includeSubtypes, CancellationToken ct) { NodeId localSourceId = ToNodeId(sourceId); if (localSourceId.IsNull) { return new List(); } return await GetReferencesAsync( localSourceId, referenceTypeId, isInverse, includeSubtypes, ct) .ConfigureAwait(false); } /// /// /// Populate a node's from references /// fetched from the server. Mirrors legacy NodeCache behavior so callers /// can introspect references without an extra round trip. /// private async ValueTask PopulateReferenceTableAsync( NodeId localId, Node node, CancellationToken ct) { try { ArrayOf references = await m_context .FetchReferencesAsync(null, localId, ct) .ConfigureAwait(false); foreach (ReferenceDescription reference in references) { ExpandedNodeId targetId = reference.NodeId; if (targetId.IsAbsolute) { targetId = ExpandedNodeId.ToNodeId(targetId, NamespaceUris); } node.ReferenceTable.Add( reference.ReferenceTypeId, !reference.IsForward, targetId); } } catch (Exception e) { m_logger.LogError( "Could not fetch references for node {NodeId}: {Error}", localId, Redact.Create(e)); } } /// public async ValueTask FetchNodeAsync( ExpandedNodeId nodeId, CancellationToken ct = default) { var localId = ExpandedNodeId.ToNodeId(nodeId, NamespaceUris); if (localId.IsNull) { return null; } try { // Force-refresh semantics: fetch directly from the server. We do not // update the LRU cache here because BitFaster's atomic-async LRU // exhibits hang behavior with sequential AddOrUpdate/GetOrAddAsync. Node node = await m_context.FetchNodeAsync(null, localId, ct: ct) .ConfigureAwait(false); await PopulateReferenceTableAsync(localId, node, ct).ConfigureAwait(false); return node; } catch (Exception e) { m_logger.LogError( "Could not fetch node {NodeId}: {Error}", nodeId, Redact.Create(e)); return null; } } /// public async ValueTask> FetchNodesAsync( ArrayOf nodeIds, CancellationToken ct = default) { if (nodeIds.IsEmpty) { return []; } ArrayOf localIds = nodeIds.ConvertAll(id => ExpandedNodeId.ToNodeId(id, NamespaceUris)); (ArrayOf nodes, ArrayOf errors) = await m_context.FetchNodesAsync(null, localIds, ct: ct) .ConfigureAwait(false); // Populate each node's ReferenceTable so callers can introspect // references without extra round trips. Mirrors legacy NodeCache. (ArrayOf> referenceList, ArrayOf refErrors) = await m_context.FetchReferencesAsync(null, localIds, ct).ConfigureAwait(false); var result = new List(nodes.Count); for (int i = 0; i < nodes.Count; i++) { if (ServiceResult.IsBad(errors[i])) { result.Add(null); continue; } if (!ServiceResult.IsBad(refErrors[i])) { foreach (ReferenceDescription reference in referenceList[i]) { ExpandedNodeId targetId = reference.NodeId; if (targetId.IsAbsolute) { targetId = ExpandedNodeId.ToNodeId(targetId, NamespaceUris); } nodes[i].ReferenceTable.Add( reference.ReferenceTypeId, !reference.IsForward, targetId); } } result.Add(nodes[i]); } return result; } /// public async ValueTask IsKnownAsync(ExpandedNodeId typeId, CancellationToken ct) { return await FindAsync(typeId, ct).ConfigureAwait(false) != null; } /// public async ValueTask IsKnownAsync(NodeId typeId, CancellationToken ct) { if (typeId.IsNull) { return false; } try { await GetNodeAsync(typeId, ct).ConfigureAwait(false); return true; } catch { return false; } } /// public ValueTask FindSuperTypeAsync(ExpandedNodeId typeId, CancellationToken ct) { return FindSuperTypeAsync(ToNodeId(typeId), ct); } /// public ValueTask FindSuperTypeAsync(NodeId typeId, CancellationToken ct) { return m_refs.TryGet(typeId, out ArrayOf references) ? new ValueTask(GetSuperTypeFromReferences(references)) : FindSuperTypeAsyncCore(typeId, ct); async ValueTask FindSuperTypeAsyncCore(NodeId typeId, CancellationToken ct) { ArrayOf references = await GetOrAddReferencesAsync(typeId, ct) .ConfigureAwait(false); return GetSuperTypeFromReferences(references); } } /// public async ValueTask> FindSubTypesAsync( ExpandedNodeId typeId, CancellationToken ct) { NodeId localId = ToNodeId(typeId); if (localId.IsNull) { return new List(); } ArrayOf subtypes = await GetReferencesAsync( localId, ReferenceTypeIds.HasSubtype, false, false, ct) .ConfigureAwait(false); return subtypes.ConvertAll(n => ToNodeId(n.NodeId)).Filter(n => !n.IsNull); } /// public async ValueTask IsTypeOfAsync( ExpandedNodeId subTypeId, ExpandedNodeId superTypeId, CancellationToken ct) { if (subTypeId == superTypeId) { return true; } NodeId localSubTypeId = ToNodeId(subTypeId); NodeId localSuperTypeId = ToNodeId(superTypeId); if (localSubTypeId.IsNull || localSuperTypeId.IsNull) { return false; } return await IsTypeOfAsync(localSubTypeId, localSuperTypeId, ct) .ConfigureAwait(false); } /// public async ValueTask IsTypeOfAsync( NodeId subTypeId, NodeId superTypeId, CancellationToken ct) { if (subTypeId == superTypeId) { return true; } NodeId current = subTypeId; while (!current.IsNull) { NodeId superType = await FindSuperTypeAsync(current, ct).ConfigureAwait(false); if (superType.IsNull) { break; } if (superType == superTypeId) { return true; } current = superType; } return false; } /// public async ValueTask FindReferenceTypeNameAsync( NodeId referenceTypeId, CancellationToken ct) { if (referenceTypeId.IsNull) { return QualifiedName.Null; } try { INode node = await GetNodeAsync(referenceTypeId, ct).ConfigureAwait(false); return node.BrowseName; } catch { return QualifiedName.Null; } } /// public async ValueTask FindReferenceTypeAsync( QualifiedName browseName, CancellationToken ct) { if (browseName.IsNull) { return NodeId.Null; } return await FindReferenceTypeInHierarchyAsync( ReferenceTypeIds.References, browseName, ct) .ConfigureAwait(false); } /// public async ValueTask IsEncodingOfAsync( ExpandedNodeId encodingId, ExpandedNodeId datatypeId, CancellationToken ct) { NodeId localEncodingId = ToNodeId(encodingId); if (localEncodingId.IsNull) { return false; } NodeId localDatatypeId = ToNodeId(datatypeId); // DataType --HasEncoding--> Encoding: inverse from encoding gives datatype ArrayOf dataTypes = await GetReferencesAsync( localEncodingId, ReferenceTypeIds.HasEncoding, true, false, ct) .ConfigureAwait(false); foreach (INode dataType in dataTypes.ToList()) { if (ToNodeId(dataType.NodeId) == localDatatypeId) { return true; } } return false; } /// public async ValueTask IsEncodingForAsync( NodeId expectedTypeId, ExtensionObject value, CancellationToken ct) { if (value.IsNull) { return false; } NodeId encodingId = ToNodeId(value.TypeId); if (encodingId.IsNull) { return false; } if (expectedTypeId == encodingId) { return true; } // DataType --HasEncoding--> Encoding: inverse from encoding gives datatype ArrayOf dataTypes = await GetReferencesAsync( encodingId, ReferenceTypeIds.HasEncoding, true, false, ct) .ConfigureAwait(false); foreach (INode dataType in dataTypes.ToList()) { if (ToNodeId(dataType.NodeId) == expectedTypeId) { return true; } } return false; } /// public async ValueTask IsEncodingForAsync( NodeId expectedTypeId, Variant value, CancellationToken ct) { if (value.IsNull) { return false; } if (expectedTypeId.IsNull) { return true; } NodeId actualTypeId = TypeInfo.GetDataTypeId(value, m_context.NamespaceUris); if (await IsTypeOfAsync(actualTypeId, expectedTypeId, ct).ConfigureAwait(false)) { return true; } // allow matches for non-structure values where actual type is a supertype of expected if (actualTypeId != DataTypes.Structure) { return await IsTypeOfAsync(expectedTypeId, actualTypeId, ct) .ConfigureAwait(false); } if (value.TryGetValue(out ExtensionObject extension)) { return await IsEncodingForAsync(expectedTypeId, extension, ct) .ConfigureAwait(false); } if (value.TryGetValue(out ArrayOf extensions)) { foreach (ExtensionObject ext in extensions.ToList()) { if (!await IsEncodingForAsync(expectedTypeId, ext, ct) .ConfigureAwait(false)) { return false; } } return true; } return false; } /// public async ValueTask FindDataTypeIdAsync( ExpandedNodeId encodingId, CancellationToken ct) { NodeId localId = ToNodeId(encodingId); if (localId.IsNull) { return NodeId.Null; } return await FindDataTypeIdAsync(localId, ct).ConfigureAwait(false); } /// public async ValueTask FindDataTypeIdAsync( NodeId encodingId, CancellationToken ct) { if (encodingId.IsNull) { return NodeId.Null; } // DataType --HasEncoding--> Encoding: inverse from encoding gives datatype ArrayOf dataTypes = await GetReferencesAsync( encodingId, ReferenceTypeIds.HasEncoding, true, false, ct) .ConfigureAwait(false); if (dataTypes.Count > 0) { return ToNodeId(dataTypes[0].NodeId); } return NodeId.Null; } /// /// Recursively searches the reference type hierarchy starting from /// for a node whose BrowseName matches /// . /// private async ValueTask FindReferenceTypeInHierarchyAsync( NodeId startNodeId, QualifiedName browseName, CancellationToken ct) { INode node; try { node = await GetNodeAsync(startNodeId, ct).ConfigureAwait(false); } catch { return NodeId.Null; } if (node.BrowseName == browseName) { return startNodeId; } ArrayOf subtypes = await GetReferencesAsync( startNodeId, ReferenceTypeIds.HasSubtype, false, false, ct) .ConfigureAwait(false); foreach (INode subtype in subtypes.ToList()) { NodeId subtypeId = ToNodeId(subtype.NodeId); if (subtypeId.IsNull) { continue; } NodeId found = await FindReferenceTypeInHierarchyAsync(subtypeId, browseName, ct) .ConfigureAwait(false); if (!found.IsNull) { return found; } } return NodeId.Null; } /// /// Get or add references to cache /// private ValueTask> GetOrAddReferencesAsync( NodeId nodeId, CancellationToken ct) { Debug.Assert(!nodeId.IsNull); INodeCacheContext context = m_context; return m_refs.GetOrAddAsync( nodeId, async key => { ArrayOf references = await context.FetchReferencesAsync(null, key, ct) .ConfigureAwait(false); foreach (ReferenceDescription? reference in references) { // transform absolute identifiers. if (reference.NodeId.IsAbsolute) { reference.NodeId = ExpandedNodeId.ToNodeId( reference.NodeId, context.NamespaceUris); } } return references; }); } /// /// Fetch remaining nodes not yet in the result list /// private async ValueTask> FetchRemainingAsync( List remainingIds, List result, CancellationToken ct) { Debug.Assert(result.Count(r => r == null) == remainingIds.Count); // fetch nodes and references from server. var localIds = new List(remainingIds); (ArrayOf nodes, ArrayOf readErrors) = await m_context.FetchNodesAsync(null, localIds, ct: ct) .ConfigureAwait(false); Debug.Assert(nodes.Count == localIds.Count); Debug.Assert(readErrors.Count == localIds.Count); int resultMissingIndex = 0; for (int index = 0; index < localIds.Count; index++) { if (!ServiceResult.IsBad(readErrors[index])) { // Populate each node's ReferenceTable so callers can // introspect references (e.g. HasTypeDefinition for // leaf-detection on property nodes) without an extra // round trip. Routes through GetOrAddReferencesAsync // so cached references are reused. if (nodes[index].ReferenceTable.Count == 0) { ArrayOf references = await GetOrAddReferencesAsync( remainingIds[index], ct) .ConfigureAwait(false); foreach (ReferenceDescription reference in references) { ExpandedNodeId targetId = reference.NodeId; if (targetId.IsAbsolute) { targetId = ExpandedNodeId.ToNodeId( targetId, NamespaceUris); } nodes[index].ReferenceTable.Add( reference.ReferenceTypeId, !reference.IsForward, targetId); } } m_nodes.AddOrUpdate(remainingIds[index], nodes[index]); } while (result[resultMissingIndex] != null) { resultMissingIndex++; Debug.Assert(resultMissingIndex < result.Count); } result[resultMissingIndex] = nodes[index]; } Debug.Assert(!result.Any(r => r == null)); // None now should be null return result.ToArrayOf()!; } /// /// Fetch remaining nodes not yet in the result list /// private async ValueTask> FetchRemainingAsync( List remainingIds, List result, CancellationToken ct) { Debug.Assert(result.Count(r => r.IsNull) == remainingIds.Count); // fetch nodes and references from server. (ArrayOf values, ArrayOf readErrors) = await m_context.FetchValuesAsync(null, remainingIds.ToArrayOf(), ct: ct) .ConfigureAwait(false); Debug.Assert(values.Count == remainingIds.Count); Debug.Assert(readErrors.Count == remainingIds.Count); int resultMissingIndex = 0; for (int index = 0; index < remainingIds.Count; index++) { if (ServiceResult.IsBad(readErrors[index])) { values = values.ReplaceItem( values[index].WithStatus(readErrors[index].StatusCode), index); } if (StatusCode.IsGood(values[index].StatusCode)) { // Add to cache m_values.AddOrUpdate(remainingIds[index], values[index]); } while (!result[resultMissingIndex].IsNull) { resultMissingIndex++; Debug.Assert(resultMissingIndex < result.Count); } result[resultMissingIndex] = values[index]; } Debug.Assert(!result.Any(r => r.IsNull)); // None now should be null return result.ToArrayOf(); } /// /// Check whether type hierarchy is loaded /// private bool IsTypeHierarchyLoaded(ArrayOf typeIds) { var types = new Queue(typeIds.Filter(nodeId => !nodeId.IsNull).ToList()); while (types.Count > 0) { NodeId typeId = types.Dequeue(); if (!m_refs.TryGet(typeId, out ArrayOf references)) { return false; } foreach (ReferenceDescription reference in references) { if (reference.ReferenceTypeId == ReferenceTypeIds.HasSubtype && reference.IsForward && !reference.NodeId.IsAbsolute) { types.Enqueue(ToNodeId(reference.NodeId)); } } } return true; } /// /// Get supertype from references /// private NodeId GetSuperTypeFromReferences(ArrayOf references) { ArrayOf superTypes = references .Filter(r => !r.IsForward && r.ReferenceTypeId == ReferenceTypeIds.HasSubtype) .ConvertAll(r => ExpandedNodeId.ToNodeId(r.NodeId, NamespaceUris)); return superTypes.IsEmpty ? NodeId.Null : superTypes.Span[0]; } /// /// Convert an expanded node id to a node id. Resolves the namespace URI /// against for absolute identifiers; returns /// if the URI is unknown. /// private NodeId ToNodeId(ExpandedNodeId expandedNodeId) { return ExpandedNodeId.ToNodeId(expandedNodeId, NamespaceUris); } private readonly IAsyncCache m_nodes; private readonly IAsyncCache> m_refs; private readonly IAsyncCache m_values; private readonly INodeCacheContext m_context; private readonly Meter m_meter; private readonly ILogger m_logger; } }