mirror of
https://github.com/OPCFoundation/UA-.NETStandard.git
synced 2026-10-27 04:59:55 +08:00
# Description Introduces a pluggable user-identity provider model covering all OPC UA Part 6 §6.5 mechanisms (Anonymous, UserName, X509, IssuedToken/JWT) on both client and server, with full `Microsoft.Extensions.DependencyInjection` integration, plus the Part 12 §9 `AuthorizationService` two-phase token-request flow **including refresh-token rotation**, the Part 12 §8 KeyCredential Push model, and a clean provider model for OPC 10000-12 §7.2 `ApplicationSelfAdmin`. The work is split across phase-by-phase commits so it can be reviewed independently; nothing here changes wire-level behaviour or forces existing applications to migrate. ### Documentation All under `Docs/`: - `IdentityProviders.md` — full developer guide: three-layer model, recipes, configuration reference, "what gets auto-wired" matrix, JWS algorithm table, identity-augmenters section, **"Implementing your own provider"** how-to subsections for Entra / OIDC / Windows / AspNetCore (sibling files merged in per review feedback). - `DependencyInjection.md` — `Identity` sections with `appsettings.json` examples, identity-extension matrix, `WithAuthorizationService` + `WithKeyCredentialPush` + `AddIdentityAugmenter` extensions documented. - `RoleBasedUserManagement.md` — claim-criteria callout describing `IIdentityClaims` probe surface. - `AuthorizationService.md` — Architecture diagram + `IAccessTokenProvider` conceptual narrative restored from master; modern `StartRequestToken` / `FinishRequestToken` flow leads; refresh-token recipe added. - `KeyCredentialService.md` — Push model + Pull vs Push vs Bridge decision matrix + Hybrid (Push + Pull) section; explicit experimental warning for the bridge. - `GDS.md` — KeyCredential Push, `StartRequestToken`, `GdsApplicationSelfAdminProvider`, **shipped Refresh-token support with rotation policy and audit semantics** all documented. - `MigrationGuide.md` — User Identity Providers section listing `[Obsolete]` markers + mechanical recipes; SelfAdmin migration via `IIdentityAugmenter`; `EnableRefreshTokens` default note. - `README.md` index entries. ## Checklist - [x] I have signed the [CLA](https://opcfoundation.org/license/cla/ContributorLicenseAgreementv1.0.pdf) and read the [CONTRIBUTING](https://github.com/OPCFoundation/UA-.NETStandard/blob/master/CONTRIBUTING.md) doc. - [x] I have added tests that prove my fix is effective or that my feature works and increased code coverage. - [x] I have added all necessary documentation. - [x] I have verified that my changes do not introduce (new) build or analyzer warnings. - [x] I ran **all** tests locally using the **UA.slnx** solution against at least .net **framework** and .net **10**, and all passed. - [x] I fixed **all** failing and flaky tests in the CI pipelines and **all** CodeQL warnings. - [x] I have addressed **all** PR feedback received.
484 lines
18 KiB
C#
484 lines
18 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.Generic;
|
|
|
|
namespace Opc.Ua.Server
|
|
{
|
|
/// <summary>
|
|
/// Calculates the value of an aggregate.
|
|
/// </summary>
|
|
public class MinMaxAggregateCalculator : AggregateCalculator
|
|
{
|
|
/// <summary>
|
|
/// Initializes the aggregate calculator.
|
|
/// </summary>
|
|
/// <param name="aggregateId">The aggregate function to apply.</param>
|
|
/// <param name="startTime">The start time.</param>
|
|
/// <param name="endTime">The end time.</param>
|
|
/// <param name="processingInterval">The processing interval.</param>
|
|
/// <param name="stepped">Whether to use stepped interpolation.</param>
|
|
/// <param name="configuration">The aggregate configuration.</param>
|
|
/// <param name="telemetry">The telemetry context to use to create obvservability instruments</param>
|
|
public MinMaxAggregateCalculator(
|
|
NodeId aggregateId,
|
|
DateTimeUtc startTime,
|
|
DateTimeUtc endTime,
|
|
double processingInterval,
|
|
bool stepped,
|
|
AggregateConfiguration configuration,
|
|
ITelemetryContext telemetry)
|
|
: base(aggregateId, startTime, endTime, processingInterval, stepped, configuration, telemetry)
|
|
{
|
|
SetPartialBit = true;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Computes the value for the timeslice.
|
|
/// </summary>
|
|
protected override DataValue ComputeValue(TimeSlice slice)
|
|
{
|
|
if (!AggregateId.TryGetValue(out uint numericId))
|
|
{
|
|
return base.ComputeValue(slice);
|
|
}
|
|
switch (numericId)
|
|
{
|
|
case Objects.AggregateFunction_Minimum:
|
|
return ComputeMinMax(slice, 1, false);
|
|
case Objects.AggregateFunction_MinimumActualTime:
|
|
return ComputeMinMax(slice, 1, true);
|
|
case Objects.AggregateFunction_Maximum:
|
|
return ComputeMinMax(slice, 2, false);
|
|
case Objects.AggregateFunction_MaximumActualTime:
|
|
return ComputeMinMax(slice, 2, true);
|
|
case Objects.AggregateFunction_Range:
|
|
return ComputeMinMax(slice, 3, false);
|
|
case Objects.AggregateFunction_Minimum2:
|
|
return ComputeMinMax2(slice, 1, false);
|
|
case Objects.AggregateFunction_MinimumActualTime2:
|
|
return ComputeMinMax2(slice, 1, true);
|
|
case Objects.AggregateFunction_Maximum2:
|
|
return ComputeMinMax2(slice, 2, false);
|
|
case Objects.AggregateFunction_MaximumActualTime2:
|
|
return ComputeMinMax2(slice, 2, true);
|
|
case Objects.AggregateFunction_Range2:
|
|
return ComputeMinMax2(slice, 3, false);
|
|
default:
|
|
return base.ComputeValue(slice);
|
|
}
|
|
}
|
|
|
|
/// <summary>
|
|
/// Calculate the Minimum, Maximum, MinimumActualTime and MaximumActualTime aggregates for the timeslice.
|
|
/// </summary>
|
|
protected DataValue ComputeMinMax(TimeSlice slice, int valueType, bool returnActualTime)
|
|
{
|
|
// get the values in the slice.
|
|
List<DataValue>? values = GetValues(slice);
|
|
|
|
// check for empty slice.
|
|
if (values == null || values.Count == 0)
|
|
{
|
|
return GetNoDataValue(slice);
|
|
}
|
|
|
|
double minimumGoodValue = double.MaxValue;
|
|
double minimumUncertainValue = double.MaxValue;
|
|
double maximumGoodValue = double.MinValue;
|
|
double maximumUncertainValue = double.MinValue;
|
|
|
|
DateTime minimumGoodTimestamp = DateTime.MinValue;
|
|
DateTime maximumGoodTimestamp = DateTime.MinValue;
|
|
|
|
TypeInfo minimumOriginalType = default;
|
|
TypeInfo maximumOriginalType = default;
|
|
|
|
bool badValuesExist = false;
|
|
bool duplicatesMinimumsExist = false;
|
|
bool duplicatesMaximumsExist = false;
|
|
bool goodValueExists = false;
|
|
|
|
for (int ii = 0; ii < values.Count; ii++)
|
|
{
|
|
var currentTime = (DateTime)values[ii].SourceTimestamp;
|
|
StatusCode currentStatus = values[ii].StatusCode;
|
|
|
|
// ignore bad values.
|
|
if (!IsGood(values[ii]))
|
|
{
|
|
badValuesExist = true;
|
|
continue;
|
|
}
|
|
|
|
double currentValue;
|
|
// convert to double.
|
|
try
|
|
{
|
|
currentValue = CastToDouble(values[ii]);
|
|
}
|
|
catch (Exception)
|
|
{
|
|
badValuesExist = true;
|
|
continue;
|
|
}
|
|
|
|
// check for uncertain.
|
|
if (StatusCode.IsUncertain(currentStatus))
|
|
{
|
|
if (minimumUncertainValue > currentValue)
|
|
{
|
|
minimumUncertainValue = currentValue;
|
|
}
|
|
|
|
if (maximumUncertainValue < currentValue)
|
|
{
|
|
maximumUncertainValue = currentValue;
|
|
}
|
|
|
|
continue;
|
|
}
|
|
|
|
// check for new minimum.
|
|
if (minimumGoodValue > currentValue)
|
|
{
|
|
minimumGoodValue = currentValue;
|
|
minimumGoodTimestamp = currentTime;
|
|
minimumOriginalType = values[ii].WrappedValue.TypeInfo;
|
|
duplicatesMinimumsExist = false;
|
|
goodValueExists = true;
|
|
}
|
|
// check for duplicate minimums.
|
|
else if (minimumGoodValue == currentValue)
|
|
{
|
|
duplicatesMinimumsExist = true;
|
|
}
|
|
|
|
// check for new maximum.
|
|
if (maximumGoodValue < currentValue)
|
|
{
|
|
maximumGoodValue = currentValue;
|
|
maximumGoodTimestamp = currentTime;
|
|
maximumOriginalType = values[ii].WrappedValue.TypeInfo;
|
|
duplicatesMaximumsExist = false;
|
|
goodValueExists = true;
|
|
}
|
|
// check for duplicate maximums.
|
|
else if (maximumGoodValue == currentValue)
|
|
{
|
|
duplicatesMaximumsExist = true;
|
|
}
|
|
}
|
|
|
|
// check if at least one good value exists.
|
|
if (!goodValueExists)
|
|
{
|
|
return GetNoDataValue(slice);
|
|
}
|
|
|
|
// set the status code.
|
|
StatusCode statusCode = StatusCodes.Good;
|
|
|
|
// uncertain if any bad values exist.
|
|
if (badValuesExist)
|
|
{
|
|
statusCode = StatusCodes.UncertainDataSubNormal;
|
|
}
|
|
|
|
// determine the calculated value to return.
|
|
Variant processedValue = default;
|
|
TypeInfo processedType = default;
|
|
DateTime processedTimestamp = DateTime.MinValue;
|
|
bool duplicatesExist = false;
|
|
|
|
if (valueType == 1)
|
|
{
|
|
processedValue = minimumGoodValue;
|
|
processedTimestamp = minimumGoodTimestamp;
|
|
processedType = minimumOriginalType;
|
|
duplicatesExist = duplicatesMinimumsExist;
|
|
}
|
|
else if (valueType == 2)
|
|
{
|
|
processedValue = maximumGoodValue;
|
|
processedTimestamp = maximumGoodTimestamp;
|
|
processedType = maximumOriginalType;
|
|
duplicatesExist = duplicatesMaximumsExist;
|
|
}
|
|
else if (valueType == 3)
|
|
{
|
|
processedValue = Math.Abs(maximumGoodValue - minimumGoodValue);
|
|
processedType = TypeInfo.Scalars.Double;
|
|
}
|
|
|
|
// set calculated if not returning actual time and value is not at the start time.
|
|
if (!returnActualTime && processedTimestamp != slice.StartTime)
|
|
{
|
|
statusCode = statusCode.WithAggregateBits(AggregateBits.Calculated);
|
|
}
|
|
|
|
// set the multiple values flags.
|
|
if (duplicatesExist)
|
|
{
|
|
statusCode = statusCode.WithAggregateBits(
|
|
statusCode.AggregateBits | AggregateBits.MultipleValues);
|
|
}
|
|
|
|
// convert back to original datatype.
|
|
if (processedType.IsUnknown ||
|
|
processedType.BuiltInType == BuiltInType.Double)
|
|
{
|
|
processedType = TypeInfo.Scalars.Double;
|
|
}
|
|
processedValue = processedValue.ConvertTo(processedType.BuiltInType);
|
|
|
|
// create processed value.
|
|
var value = new DataValue(processedValue, statusCode);
|
|
|
|
if (returnActualTime)
|
|
{
|
|
DateTimeUtc minMaxStamp = processedTimestamp;
|
|
return value
|
|
.WithSourceTimestamp(minMaxStamp)
|
|
.WithServerTimestamp(minMaxStamp);
|
|
}
|
|
else
|
|
{
|
|
DateTimeUtc sliceStamp = GetTimestamp(slice);
|
|
return value
|
|
.WithSourceTimestamp(sliceStamp)
|
|
.WithServerTimestamp(sliceStamp);
|
|
}
|
|
}
|
|
|
|
/// <summary>
|
|
/// Calculate the Minimum2, Maximum2, MinimumActualTime2, MaximumActualTime2 and Range2 aggregates for the timeslice.
|
|
/// </summary>
|
|
protected DataValue ComputeMinMax2(TimeSlice slice, int valueType, bool returnActualTime)
|
|
{
|
|
// get the values in the slice.
|
|
List<DataValue>? values = GetValuesWithSimpleBounds(slice);
|
|
|
|
// check for empty slice.
|
|
if (values == null || values.Count == 0)
|
|
{
|
|
return GetNoDataValue(slice);
|
|
}
|
|
|
|
double minimumGoodValue = double.MaxValue;
|
|
double maximumGoodValue = double.MinValue;
|
|
|
|
DateTime minimumGoodTimestamp = DateTime.MinValue;
|
|
DateTime maximumGoodTimestamp = DateTime.MinValue;
|
|
|
|
StatusCode minimumGoodStatusCode = StatusCodes.Good;
|
|
StatusCode maximumGoodStatusCode = StatusCodes.Good;
|
|
|
|
TypeInfo minimumOriginalType = default;
|
|
TypeInfo maximumOriginalType = default;
|
|
|
|
bool duplicatesMinimumsExist = false;
|
|
bool duplicatesMaximumsExist = false;
|
|
bool goodValueExists = false;
|
|
|
|
for (int ii = 0; ii < values.Count; ii++)
|
|
{
|
|
var currentTime = (DateTime)values[ii].SourceTimestamp;
|
|
StatusCode currentStatus = values[ii].StatusCode;
|
|
|
|
// ignore bad values (as determined by the TreatUncertainAsBad parameter).
|
|
if (!IsGood(values[ii]))
|
|
{
|
|
continue;
|
|
}
|
|
|
|
double currentValue;
|
|
// convert to double.
|
|
try
|
|
{
|
|
currentValue = CastToDouble(values[ii]);
|
|
}
|
|
catch (Exception)
|
|
{
|
|
continue;
|
|
}
|
|
|
|
// skip endpoint if stepped.
|
|
if (currentTime == slice.EndTime && Stepped)
|
|
{
|
|
break;
|
|
}
|
|
|
|
// check for new minimum.
|
|
if (minimumGoodValue > currentValue)
|
|
{
|
|
minimumGoodValue = currentValue;
|
|
minimumGoodTimestamp = currentTime;
|
|
minimumGoodStatusCode = currentStatus;
|
|
minimumOriginalType = values[ii].WrappedValue.TypeInfo;
|
|
duplicatesMinimumsExist = false;
|
|
goodValueExists = true;
|
|
}
|
|
// check for duplicate minimums.
|
|
else if (minimumGoodValue == currentValue)
|
|
{
|
|
duplicatesMinimumsExist = true;
|
|
}
|
|
|
|
// check for new maximum.
|
|
if (maximumGoodValue < currentValue)
|
|
{
|
|
maximumGoodValue = currentValue;
|
|
maximumGoodTimestamp = currentTime;
|
|
maximumGoodStatusCode = currentStatus;
|
|
maximumOriginalType = values[ii].WrappedValue.TypeInfo;
|
|
duplicatesMaximumsExist = false;
|
|
goodValueExists = true;
|
|
}
|
|
// check for duplicate maximums.
|
|
else if (maximumGoodValue == currentValue)
|
|
{
|
|
duplicatesMaximumsExist = true;
|
|
}
|
|
}
|
|
|
|
// check if at least one good value exists.
|
|
if (!goodValueExists)
|
|
{
|
|
DataValue noDataValue = GetNoDataValue(slice);
|
|
// check if interval is partial and set the flag accordingly
|
|
if (slice.Partial)
|
|
{
|
|
noDataValue = noDataValue.WithStatus(
|
|
noDataValue.StatusCode.WithAggregateBits(AggregateBits.Partial));
|
|
}
|
|
return noDataValue;
|
|
}
|
|
|
|
// determine the calculated value to return.
|
|
Variant processedValue = default;
|
|
TypeInfo processedType = default;
|
|
DateTime processedTimestamp = DateTime.MinValue;
|
|
StatusCode processedStatusCode = StatusCodes.Good;
|
|
bool duplicatesExist = false;
|
|
|
|
if (valueType == 1)
|
|
{
|
|
processedValue = minimumGoodValue;
|
|
processedTimestamp = minimumGoodTimestamp;
|
|
processedStatusCode = minimumGoodStatusCode;
|
|
processedType = minimumOriginalType;
|
|
duplicatesExist = duplicatesMinimumsExist;
|
|
}
|
|
else if (valueType == 2)
|
|
{
|
|
processedValue = maximumGoodValue;
|
|
processedTimestamp = maximumGoodTimestamp;
|
|
processedStatusCode = maximumGoodStatusCode;
|
|
processedType = maximumOriginalType;
|
|
duplicatesExist = duplicatesMaximumsExist;
|
|
}
|
|
else if (valueType == 3)
|
|
{
|
|
processedValue = Math.Abs(maximumGoodValue - minimumGoodValue);
|
|
processedType = TypeInfo.Scalars.Double;
|
|
}
|
|
|
|
// set the status code.
|
|
StatusCode statusCode = processedStatusCode;
|
|
|
|
// set calculated if not returning actual time and value is not at the start time.
|
|
if (!returnActualTime &&
|
|
processedTimestamp != slice.StartTime &&
|
|
(statusCode.AggregateBits & AggregateBits.Interpolated) == 0)
|
|
{
|
|
statusCode = statusCode.WithAggregateBits(
|
|
statusCode.AggregateBits | AggregateBits.Calculated);
|
|
}
|
|
|
|
// set the multiple values flags.
|
|
if (duplicatesExist)
|
|
{
|
|
statusCode = statusCode.WithAggregateBits(
|
|
statusCode.AggregateBits | AggregateBits.MultipleValues);
|
|
}
|
|
|
|
if (processedType.IsUnknown)
|
|
{
|
|
processedType = TypeInfo.Scalars.Double;
|
|
}
|
|
|
|
// convert back to original datatype.
|
|
processedValue = processedValue.ConvertTo(processedType.BuiltInType);
|
|
// create processed value.
|
|
var value = new DataValue(
|
|
processedValue,
|
|
GetTimeBasedStatusCode(slice, values, statusCode));
|
|
|
|
// zero value if status is bad.
|
|
if (StatusCode.IsBad(value.StatusCode))
|
|
{
|
|
value = value.WithWrappedValue(Variant.Null);
|
|
}
|
|
|
|
if (returnActualTime)
|
|
{
|
|
// calculate effective time if end bound is used.
|
|
if (TimeFlowsBackward)
|
|
{
|
|
if (processedTimestamp == slice.StartTime)
|
|
{
|
|
processedTimestamp = processedTimestamp.AddMilliseconds(+1);
|
|
value = value.WithStatus(value.StatusCode.WithAggregateBits(
|
|
value.StatusCode.AggregateBits | AggregateBits.Interpolated));
|
|
}
|
|
}
|
|
else if (processedTimestamp == slice.EndTime)
|
|
{
|
|
processedTimestamp = processedTimestamp.AddMilliseconds(-1);
|
|
value = value.WithStatus(value.StatusCode.WithAggregateBits(
|
|
value.StatusCode.AggregateBits | AggregateBits.Interpolated));
|
|
}
|
|
|
|
return value
|
|
.WithSourceTimestamp(processedTimestamp)
|
|
.WithServerTimestamp(processedTimestamp);
|
|
}
|
|
else
|
|
{
|
|
DateTimeUtc sliceStamp = GetTimestamp(slice);
|
|
return value
|
|
.WithSourceTimestamp(sliceStamp)
|
|
.WithServerTimestamp(sliceStamp);
|
|
}
|
|
}
|
|
}
|
|
}
|