-
Notifications
You must be signed in to change notification settings - Fork 272
/
Perf_BitOperations.cs
115 lines (105 loc) · 3.07 KB
/
Perf_BitOperations.cs
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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
// Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
// See the LICENSE file in the project root for more information.
using System.Numerics;
using BenchmarkDotNet.Attributes;
using MicroBenchmarks;
using System.Runtime.CompilerServices;
using BenchmarkDotNet.Extensions;
namespace System.Numerics.Tests
{
[BenchmarkCategory(Categories.Libraries, Categories.SIMD, Categories.JIT)]
public class Perf_BitOperations
{
private static uint[] input_uint = ValuesGenerator.Array<uint>(1000);
private static ulong[] input_ulong = ValuesGenerator.Array<ulong>(1000);
[Benchmark]
public int LeadingZeroCount_uint()
{
int sum = 0;
uint[] input = input_uint;
for (int i = 0; i < input.Length; i++)
{
sum += BitOperations.LeadingZeroCount(input[i]);
}
return sum;
}
[Benchmark]
public int LeadingZeroCount_ulong()
{
int sum = 0;
ulong[] input = input_ulong;
for (int i = 0; i < input.Length; i++)
{
sum += BitOperations.LeadingZeroCount(input[i]);
}
return sum;
}
[Benchmark]
public int Log2_uint()
{
int sum = 0;
uint[] input = input_uint;
for (int i = 0; i < input.Length; i++)
{
sum += BitOperations.Log2(input[i]);
}
return sum;
}
[Benchmark]
public int Log2_ulong()
{
int sum = 0;
ulong[] input = input_ulong;
for (int i = 0; i < input.Length; i++)
{
sum += BitOperations.Log2(input[i]);
}
return sum;
}
[Benchmark]
public int TrailingZeroCount_uint()
{
int sum = 0;
uint[] input = input_uint;
for (int i = 0; i < input.Length; i++)
{
sum += BitOperations.TrailingZeroCount(input[i]);
}
return sum;
}
[Benchmark]
public int TrailingZeroCount_ulong()
{
int sum = 0;
ulong[] input = input_ulong;
for (int i = 0; i < input.Length; i++)
{
sum += BitOperations.TrailingZeroCount(input[i]);
}
return sum;
}
[Benchmark]
public int PopCount_uint()
{
int sum = 0;
uint[] input = input_uint;
for (int i = 0; i < input.Length; i++)
{
sum += BitOperations.PopCount(input[i]);
}
return sum;
}
[Benchmark]
public int PopCount_ulong()
{
int sum = 0;
ulong[] input = input_ulong;
for (int i = 0; i < input.Length; i++)
{
sum += BitOperations.PopCount(input[i]);
}
return sum;
}
}
}