mirror of
https://github.com/icsharpcode/ILSpy.git
synced 2026-10-12 11:09:54 +00:00
Backfills the standard MIT X11 header on hand-written files that never got one, attributing each to its first-commit author and year from git history. Code vendored from dotnet/runtime and Humanizr/Humanizer gets its origin's license lines and a provenance note instead. Generated files (Resources.Designer.cs, the version-info template), tool-managed suppression files, and BAML test-case fixtures intentionally stay header-less. Assisted-by: Claude:claude-fable-5:Claude Code
63 lines
1.8 KiB
C#
63 lines
1.8 KiB
C#
// Licensed to the .NET Foundation under one or more agreements.
|
|
// The .NET Foundation licenses this file to you under the MIT license.
|
|
//
|
|
// Vendored from dotnet/runtime: the System.Numerics.BitOperations members used by this
|
|
// project, as a polyfill for target frameworks that lack the type.
|
|
|
|
using System;
|
|
using System.Runtime.CompilerServices;
|
|
using System.Runtime.InteropServices;
|
|
|
|
#if !NET8_0_OR_GREATER
|
|
namespace System.Numerics
|
|
{
|
|
internal static class BitOperations
|
|
{
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|
public static uint RotateLeft(uint value, int offset)
|
|
=> (value << offset) | (value >> (32 - offset));
|
|
|
|
private static ReadOnlySpan<byte> TrailingZeroCountDeBruijn => new byte[32]
|
|
{
|
|
00, 01, 28, 02, 29, 14, 24, 03,
|
|
30, 22, 20, 15, 25, 17, 04, 08,
|
|
31, 27, 13, 23, 21, 19, 16, 07,
|
|
26, 12, 18, 06, 11, 05, 10, 09
|
|
};
|
|
public static int TrailingZeroCount(uint value)
|
|
{
|
|
// Unguarded fallback contract is 0->0, BSF contract is 0->undefined
|
|
if (value == 0)
|
|
{
|
|
return 32;
|
|
}
|
|
|
|
unchecked
|
|
{
|
|
// uint.MaxValue >> 27 is always in range [0 - 31] so we use Unsafe.AddByteOffset to avoid bounds check
|
|
return Unsafe.AddByteOffset(
|
|
// Using deBruijn sequence, k=2, n=5 (2^5=32) : 0b_0000_0111_0111_1100_1011_0101_0011_0001u
|
|
ref MemoryMarshal.GetReference(TrailingZeroCountDeBruijn),
|
|
// uint|long -> IntPtr cast on 32-bit platforms does expensive overflow checks not needed here
|
|
(IntPtr)(int)(((value & (uint)-(int)value) * 0x077CB531u) >> 27)); // Multi-cast mitigates redundant conv.u8
|
|
}
|
|
}
|
|
|
|
public static int TrailingZeroCount(ulong value)
|
|
{
|
|
unchecked
|
|
{
|
|
uint lo = (uint)value;
|
|
|
|
if (lo == 0)
|
|
{
|
|
return 32 + TrailingZeroCount((uint)(value >> 32));
|
|
}
|
|
|
|
return TrailingZeroCount(lo);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
#endif
|