2021-12-29 21:09:00 +00:00
|
|
|
const std = @import("std");
|
2022-03-17 01:28:24 +00:00
|
|
|
const Log2Int = std.math.Log2Int;
|
2021-12-29 21:09:00 +00:00
|
|
|
|
2022-03-17 01:28:24 +00:00
|
|
|
pub inline fn sext(comptime bits: comptime_int, value: u32) u32 {
|
2022-03-01 00:38:50 +00:00
|
|
|
comptime std.debug.assert(bits <= 32);
|
|
|
|
const amount = 32 - bits;
|
2022-01-01 09:41:50 +00:00
|
|
|
|
2022-03-01 00:38:50 +00:00
|
|
|
return @bitCast(u32, @bitCast(i32, value << amount) >> amount);
|
2021-12-29 21:09:00 +00:00
|
|
|
}
|
2022-03-14 11:54:48 +00:00
|
|
|
|
2022-03-17 01:28:24 +00:00
|
|
|
/// See https://godbolt.org/z/W3en9Eche
|
|
|
|
pub inline fn rotr(comptime T: type, value: T, r: anytype) T {
|
|
|
|
comptime std.debug.assert(@typeInfo(T).Int.signedness == .unsigned);
|
|
|
|
const ar = @truncate(Log2Int(T), r);
|
|
|
|
|
|
|
|
return value >> ar | value << @truncate(Log2Int(T), @typeInfo(T).Int.bits - @as(T, ar));
|
|
|
|
}
|
|
|
|
|
2022-03-14 11:54:48 +00:00
|
|
|
pub const FpsAverage = struct {
|
|
|
|
const Self = @This();
|
|
|
|
|
|
|
|
total: u64,
|
|
|
|
sample_count: u64,
|
|
|
|
|
|
|
|
pub fn init() Self {
|
2022-03-18 12:41:06 +00:00
|
|
|
return .{ .total = 0, .sample_count = 1 };
|
2022-03-14 11:54:48 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
pub fn add(self: *Self, sample: u64) void {
|
2022-03-14 23:38:29 +00:00
|
|
|
if (self.sample_count == 600) return self.reset(sample);
|
2022-03-14 11:54:48 +00:00
|
|
|
|
|
|
|
self.total += sample;
|
|
|
|
self.sample_count += 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
pub fn calc(self: *const Self) u64 {
|
|
|
|
return self.total / self.sample_count;
|
|
|
|
}
|
|
|
|
|
|
|
|
fn reset(self: *Self, sample: u64) void {
|
|
|
|
self.total = sample;
|
|
|
|
self.sample_count = 1;
|
|
|
|
}
|
|
|
|
};
|
2022-03-18 09:27:37 +00:00
|
|
|
|
|
|
|
pub fn intToBytes(comptime T: type, value: anytype) [@sizeOf(T)]u8 {
|
|
|
|
comptime std.debug.assert(@typeInfo(T) == .Int);
|
|
|
|
|
|
|
|
var result: [@sizeOf(T)]u8 = undefined;
|
|
|
|
|
|
|
|
var i: Log2Int(T) = 0;
|
|
|
|
while (i < result.len) : (i += 1) result[i] = @truncate(u8, value >> i * @bitSizeOf(u8));
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|