summary refs log tree commit diff
path: root/crypto/src/util/Longs.cs
blob: 66b14b95c79c3517509e95ecb83c542fbd94a0ae (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
using System;

using Org.BouncyCastle.Math.Raw;

namespace Org.BouncyCastle.Utilities
{
    public abstract class Longs
    {
        public const int NumBits = 64;
        public const int NumBytes = 8;

        private static readonly byte[] DeBruijnTZ = {
            0x3F, 0x00, 0x01, 0x34, 0x02, 0x06, 0x35, 0x1A, 0x03, 0x25, 0x28, 0x07, 0x21, 0x36, 0x2F, 0x1B,
            0x3D, 0x04, 0x26, 0x2D, 0x2B, 0x29, 0x15, 0x08, 0x17, 0x22, 0x3A, 0x37, 0x30, 0x11, 0x1C, 0x0A,
            0x3E, 0x33, 0x05, 0x19, 0x24, 0x27, 0x20, 0x2E, 0x3C, 0x2C, 0x2A, 0x14, 0x16, 0x39, 0x10, 0x09,
            0x32, 0x18, 0x23, 0x1F, 0x3B, 0x13, 0x38, 0x0F, 0x31, 0x1E, 0x12, 0x0E, 0x1D, 0x0D, 0x0C, 0x0B };

        public static int NumberOfLeadingZeros(long i)
        {
            int x = (int)(i >> 32), n = 0;
            if (x == 0)
            {
                n = 32;
                x = (int)i;
            }
            return n + Integers.NumberOfLeadingZeros(x);
        }

        public static int NumberOfTrailingZeros(long i)
        {
            int n = DeBruijnTZ[(uint)((ulong)((i & -i) * 0x045FBAC7992A70DAL) >> 58)];
            long m = (((i & 0xFFFFFFFFL) | (long)((ulong)i >> 32)) - 1L) >> 63;
            return n - (int)m;
        }

        public static long Reverse(long i)
        {
            i = (long)Bits.BitPermuteStepSimple((ulong)i, 0x5555555555555555UL, 1);
            i = (long)Bits.BitPermuteStepSimple((ulong)i, 0x3333333333333333UL, 2);
            i = (long)Bits.BitPermuteStepSimple((ulong)i, 0x0F0F0F0F0F0F0F0FUL, 4);
            return ReverseBytes(i);
        }

        [CLSCompliantAttribute(false)]
        public static ulong Reverse(ulong i)
        {
            i = Bits.BitPermuteStepSimple(i, 0x5555555555555555UL, 1);
            i = Bits.BitPermuteStepSimple(i, 0x3333333333333333UL, 2);
            i = Bits.BitPermuteStepSimple(i, 0x0F0F0F0F0F0F0F0FUL, 4);
            return ReverseBytes(i);
        }

        public static long ReverseBytes(long i)
        {
            return RotateLeft((long)((ulong)i & 0xFF000000FF000000UL),  8) |
                   RotateLeft((long)((ulong)i & 0x00FF000000FF0000UL), 24) |
                   RotateLeft((long)((ulong)i & 0x0000FF000000FF00UL), 40) |
                   RotateLeft((long)((ulong)i & 0x000000FF000000FFUL), 56);
        }

        [CLSCompliantAttribute(false)]
        public static ulong ReverseBytes(ulong i)
        {
            return RotateLeft(i & 0xFF000000FF000000UL,  8) |
                   RotateLeft(i & 0x00FF000000FF0000UL, 24) |
                   RotateLeft(i & 0x0000FF000000FF00UL, 40) |
                   RotateLeft(i & 0x000000FF000000FFUL, 56);
        }

        public static long RotateLeft(long i, int distance)
        {
            return (i << distance) ^ (long)((ulong)i >> -distance);
        }

        [CLSCompliantAttribute(false)]
        public static ulong RotateLeft(ulong i, int distance)
        {
            return (i << distance) ^ (i >> -distance);
        }

        public static long RotateRight(long i, int distance)
        {
            return (long)((ulong)i >> distance) ^ (i << -distance);
        }

        [CLSCompliantAttribute(false)]
        public static ulong RotateRight(ulong i, int distance)
        {
            return (i >> distance) ^ (i << -distance);
        }
    }
}