mirror of
https://github.com/OPCFoundation/UA-.NETStandard.git
synced 2026-10-28 22:55:49 +08:00
Co-authored-by: Claude Opus 5.5 <noreply@anthropic.com> Co-authored-by: Klaus Landsdorf <kl@iniationware.com> Co-authored-by: Marc Schier <marcschier@users.noreply.github.com> Co-authored-by: copilot-swe-agent[bot] <198982749+Copilot@users.noreply.github.com> Co-authored-by: marcschier <11168470+marcschier@users.noreply.github.com> Co-authored-by: romanett <7413710+romanett@users.noreply.github.com>
133 lines
5.8 KiB
C#
133 lines
5.8 KiB
C#
/* ========================================================================
|
|
* Copyright (c) 2005-2026 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.Buffers.Binary;
|
|
using System.IO;
|
|
using NUnit.Framework;
|
|
using Opc.Ua.PubSub.Diagnostics;
|
|
using Opc.Ua.PubSub.Encoding;
|
|
using Opc.Ua.PubSub.Encoding.Uadp;
|
|
|
|
namespace Opc.Ua.Fuzzing
|
|
{
|
|
/// <summary>
|
|
/// Curated reproducers under Assets/Repo, replayed with the resource oracles.
|
|
/// </summary>
|
|
[TestFixture]
|
|
[Category("Fuzzing")]
|
|
public sealed class PubSubReproducerTests
|
|
{
|
|
/// <summary>
|
|
/// U1-1: a UADP discovery request whose array count claims about 2^31 elements
|
|
/// in a 9 byte frame made the decoder allocate gigabytes before reading them.
|
|
/// </summary>
|
|
private const string kDiscoveryCountReproducer = "crash-a37cbc149037fca2713b51983af60846703fce99";
|
|
|
|
[Test]
|
|
public void DiscoveryRequestCountReproducerIsSoftRejectedWithinTheAllocationBudget()
|
|
{
|
|
byte[] input = LoadReproducer(kDiscoveryCountReproducer);
|
|
PubSubNetworkMessageContext context = FuzzableCode.NewContext();
|
|
|
|
// DecodeUadp runs the decode under the allocation oracle, so a decoder that
|
|
// sizes the array from the count fails here with a ResourceBudgetException.
|
|
PubSubNetworkMessage decoded = FuzzableCode.DecodeUadp(input, context);
|
|
|
|
Assert.That(decoded, Is.Null);
|
|
Assert.That(
|
|
context.Diagnostics.Read(PubSubDiagnosticsCounterKind.ReceivedInvalidNetworkMessages),
|
|
Is.EqualTo(1));
|
|
}
|
|
|
|
[Test]
|
|
public void DiscoveryRequestCountReproducerPassesEveryTarget()
|
|
{
|
|
byte[] input = LoadReproducer(kDiscoveryCountReproducer);
|
|
|
|
Assert.DoesNotThrow(() => FuzzableCode.LibfuzzUadpNetworkMessageDecode(input));
|
|
Assert.DoesNotThrow(() => FuzzableCode.LibfuzzUadpChunkReassembly(input));
|
|
Assert.DoesNotThrow(() => FuzzableCode.LibfuzzPubSubJsonDecode(input));
|
|
}
|
|
|
|
/// <summary>
|
|
/// U1-3: a UADP chunk header advertising a huge TotalSize made the reassembler
|
|
/// preallocate that many bytes. The fix bounds TotalSize by MaxReassembledMessageSize
|
|
/// and charges memory per received chunk, so the chunk is rejected before allocation.
|
|
/// The reassembler probe runs under the allocation oracle in ExerciseUadpChunks.
|
|
/// </summary>
|
|
[Test]
|
|
public void OversizedChunkTotalSizeIsRejectedBeforeAllocation()
|
|
{
|
|
byte[] chunk = PubSubReproducerBuilders.BuildOversizedTotalSizeChunk();
|
|
PubSubNetworkMessageContext context = FuzzableCode.NewContext();
|
|
|
|
using (var reassembler = new UadpReassembler(context.TimeProvider))
|
|
{
|
|
bool completed = reassembler.TryAddChunk(
|
|
FuzzableCode.SeedPublisherId, 1, chunk, out ReadOnlyMemory<byte>? reassembled);
|
|
|
|
Assert.That(completed, Is.False);
|
|
Assert.That(reassembled, Is.Null);
|
|
Assert.That(reassembler.PendingCount, Is.Zero);
|
|
}
|
|
|
|
Assert.DoesNotThrow(() => FuzzableCode.LibfuzzUadpChunkReassembly(chunk));
|
|
}
|
|
|
|
private static byte[] LoadReproducer(string name)
|
|
{
|
|
return File.ReadAllBytes(Path.Combine(AppContext.BaseDirectory, "Assets", "Repo", name));
|
|
}
|
|
}
|
|
|
|
/// <summary>
|
|
/// Builders for the PubSub resource reproducers, documenting the wire shape they produce.
|
|
/// </summary>
|
|
internal static class PubSubReproducerBuilders
|
|
{
|
|
/// <summary>
|
|
/// A single UADP chunk (Part 14 Table 159) whose TotalSize advertises about 1 GiB while
|
|
/// the chunk carries one payload byte.
|
|
/// </summary>
|
|
public static byte[] BuildOversizedTotalSizeChunk()
|
|
{
|
|
const uint totalSize = 0x40000000; // 1 GiB.
|
|
byte[] payload = [0x2A];
|
|
byte[] frame = new byte[UadpChunker.ChunkHeaderSize + payload.Length];
|
|
BinaryPrimitives.WriteUInt16LittleEndian(frame.AsSpan(0), 1); // MessageSequenceNumber
|
|
BinaryPrimitives.WriteUInt32LittleEndian(frame.AsSpan(2), 0); // ChunkOffset
|
|
BinaryPrimitives.WriteUInt32LittleEndian(frame.AsSpan(6), totalSize);
|
|
BinaryPrimitives.WriteInt32LittleEndian(frame.AsSpan(10), payload.Length); // ChunkData length
|
|
payload.CopyTo(frame.AsSpan(UadpChunker.ChunkHeaderSize));
|
|
return frame;
|
|
}
|
|
}
|
|
}
|