-
Notifications
You must be signed in to change notification settings - Fork 770
/
CircularBuffer.cs
180 lines (157 loc) · 5.88 KB
/
CircularBuffer.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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
// <copyright file="CircularBuffer.cs" company="OpenTelemetry Authors">
// Copyright The OpenTelemetry Authors
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
// </copyright>
using System.Runtime.CompilerServices;
using System.Threading;
namespace OpenTelemetry.Internal
{
/// <summary>
/// Lock-free implementation of single-reader multi-writer circular buffer.
/// </summary>
/// <typeparam name="T">The type of the underlying value.</typeparam>
internal class CircularBuffer<T>
where T : class
{
private readonly T[] trait;
private long head;
private long tail;
/// <summary>
/// Initializes a new instance of the <see cref="CircularBuffer{T}"/> class.
/// </summary>
/// <param name="capacity">The capacity of the circular buffer, must be a positive integer.</param>
public CircularBuffer(int capacity)
{
Guard.ThrowIfOutOfRange(capacity, min: 1);
this.Capacity = capacity;
this.trait = new T[capacity];
}
/// <summary>
/// Gets the capacity of the <see cref="CircularBuffer{T}"/>.
/// </summary>
public int Capacity { get; }
/// <summary>
/// Gets the number of items contained in the <see cref="CircularBuffer{T}"/>.
/// </summary>
public int Count
{
get
{
var tailSnapshot = this.tail;
return (int)(this.head - tailSnapshot);
}
}
/// <summary>
/// Gets the number of items added to the <see cref="CircularBuffer{T}"/>.
/// </summary>
public long AddedCount => this.head;
/// <summary>
/// Gets the number of items removed from the <see cref="CircularBuffer{T}"/>.
/// </summary>
public long RemovedCount => this.tail;
/// <summary>
/// Adds the specified item to the buffer.
/// </summary>
/// <param name="value">The value to add.</param>
/// <returns>
/// Returns <c>true</c> if the item was added to the buffer successfully;
/// <c>false</c> if the buffer is full.
/// </returns>
public bool Add(T value)
{
Guard.ThrowIfNull(value);
while (true)
{
var tailSnapshot = this.tail;
var headSnapshot = this.head;
if (headSnapshot - tailSnapshot >= this.Capacity)
{
return false; // buffer is full
}
var head = Interlocked.CompareExchange(ref this.head, headSnapshot + 1, headSnapshot);
if (head != headSnapshot)
{
continue;
}
var index = (int)(head % this.Capacity);
this.trait[index] = value;
return true;
}
}
/// <summary>
/// Attempts to add the specified item to the buffer.
/// </summary>
/// <param name="value">The value to add.</param>
/// <param name="maxSpinCount">The maximum allowed spin count, when set to a negative number or zero, will spin indefinitely.</param>
/// <returns>
/// Returns <c>true</c> if the item was added to the buffer successfully;
/// <c>false</c> if the buffer is full or the spin count exceeded <paramref name="maxSpinCount"/>.
/// </returns>
public bool TryAdd(T value, int maxSpinCount)
{
if (maxSpinCount <= 0)
{
return this.Add(value);
}
Guard.ThrowIfNull(value);
var spinCountDown = maxSpinCount;
while (true)
{
var tailSnapshot = this.tail;
var headSnapshot = this.head;
if (headSnapshot - tailSnapshot >= this.Capacity)
{
return false; // buffer is full
}
var head = Interlocked.CompareExchange(ref this.head, headSnapshot + 1, headSnapshot);
if (head != headSnapshot)
{
if (spinCountDown-- == 0)
{
return false; // exceeded maximum spin count
}
continue;
}
var index = (int)(head % this.Capacity);
this.trait[index] = value;
return true;
}
}
/// <summary>
/// Reads an item from the <see cref="CircularBuffer{T}"/>.
/// </summary>
/// <remarks>
/// This function is not reentrant-safe, only one reader is allowed at any given time.
/// Warning: There is no bounds check in this method. Do not call unless you have verified Count > 0.
/// </remarks>
/// <returns>Item read.</returns>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public T Read()
{
var index = (int)(this.tail % this.Capacity);
while (true)
{
var value = this.trait[index];
if (value == null)
{
// If we got here it means a writer isn't done.
continue;
}
this.trait[index] = null;
this.tail++;
return value;
}
}
}
}