-
Notifications
You must be signed in to change notification settings - Fork 786
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Exponential Bucket Histogram - part 2 (#3468)
- Loading branch information
Showing
5 changed files
with
399 additions
and
157 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,119 @@ | ||
// <copyright file="CircularBufferBuckets.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 OpenTelemetry.Internal; | ||
|
||
namespace OpenTelemetry.Metrics; | ||
|
||
/// <summary> | ||
/// A histogram buckets implementation based on circular buffer. | ||
/// </summary> | ||
internal class CircularBufferBuckets | ||
{ | ||
private long[] trait; | ||
private int begin = 0; | ||
private int end = -1; | ||
|
||
public CircularBufferBuckets(int capacity) | ||
{ | ||
Guard.ThrowIfOutOfRange(capacity, min: 1); | ||
|
||
this.Capacity = capacity; | ||
} | ||
|
||
/// <summary> | ||
/// Gets the capacity of the <see cref="CircularBufferBuckets"/>. | ||
/// </summary> | ||
public int Capacity { get; } | ||
|
||
/// <summary> | ||
/// Gets the size of the <see cref="CircularBufferBuckets"/>. | ||
/// </summary> | ||
public int Size => this.end - this.begin + 1; | ||
|
||
/// <summary> | ||
/// Returns the value of <c>Bucket[index]</c>. | ||
/// </summary> | ||
/// <param name="index">The index of the bucket.</param> | ||
/// <remarks> | ||
/// The "index" value can be positive, zero or negative. | ||
/// This method does not validate if "index" falls into [begin, end], | ||
/// the caller is responsible for the validation. | ||
/// </remarks> | ||
public long this[int index] | ||
{ | ||
get => this.trait[this.ModuloIndex(index)]; | ||
} | ||
|
||
/// <summary> | ||
/// Attempts to increment the value of <c>Bucket[index]</c>. | ||
/// </summary> | ||
/// <param name="index">The index of the bucket.</param> | ||
/// <returns> | ||
/// Returns <c>true</c> if the increment attempt succeeded; | ||
/// <c>false</c> if the underlying buffer is running out of capacity. | ||
/// </returns> | ||
/// <remarks> | ||
/// The "index" value can be positive, zero or negative. | ||
/// </remarks> | ||
public bool TryIncrement(int index) | ||
{ | ||
if (this.trait == null) | ||
{ | ||
this.trait = new long[this.Capacity]; | ||
|
||
this.begin = index; | ||
this.end = index; | ||
} | ||
else if (index > this.end) | ||
{ | ||
if (index - this.begin >= this.Capacity) | ||
{ | ||
return false; | ||
} | ||
|
||
this.end = index; | ||
} | ||
else if (index < this.begin) | ||
{ | ||
if (this.end - index >= this.Capacity) | ||
{ | ||
return false; | ||
} | ||
|
||
this.begin = index; | ||
} | ||
|
||
this.trait[this.ModuloIndex(index)] += 1; | ||
|
||
return true; | ||
} | ||
|
||
[MethodImpl(MethodImplOptions.AggressiveInlining)] | ||
private int ModuloIndex(int value) | ||
{ | ||
value %= this.Capacity; | ||
|
||
if (value < 0) | ||
{ | ||
value += this.Capacity; | ||
} | ||
|
||
return value; | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.