4c3b11445c
Phase 0 of design/pyrowave-codec-plan.md — the opt-in wired-LAN ultra-low- latency codec. Vendored at upstream 509e4f88 (API 0.4.0, Granite 44362775, volk + vulkan-headers pins in PUNKTFUNK-VENDOR.txt), pruned to the 6.6 MB the standalone no-renderer build needs; scripts/vendor-pyrowave.sh reproduces the tree (a pin bump is protocol-affecting, plan §4.2). build.rs drives the wrapper CMakeLists (static archives incl. a static C-API lib upstream only ships shared) + bindgen over pyrowave.h; Linux and Windows only, empty stub elsewhere (Apple gets a native Metal port, §4.7). Offline-safe by construction: no network, no system lib, vendored Vulkan headers — same model as the opus dep (flatpak builder has no network). Phase-0 validation on .21 (RTX 5070 Ti, driver 610.43.03): - upstream pyrowave-c-test + interop test (incl. dmabuf/DRM-modifier Vulkan<->Vulkan) pass, from the pristine AND the pruned tree - GPU kernel times at ~1.6 bpp noise: encode/decode 0.090/0.042 ms @800p, 0.146/0.067 @1080p, 0.226/0.103 @1440p, 0.477/0.201 @4K — order of magnitude under NVENC's 1-2 ms retrieve, CBR lands within ~100 B of target - cargo test -p pyrowave-sys green (static link + API-version pin check) Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
200 lines
5.1 KiB
C++
200 lines
5.1 KiB
C++
/* Copyright (c) 2017-2026 Hans-Kristian Arntzen
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining
|
|
* a copy of this software and associated documentation files (the
|
|
* "Software"), to deal in the Software without restriction, including
|
|
* without limitation the rights to use, copy, modify, merge, publish,
|
|
* distribute, sublicense, and/or sell copies of the Software, and to
|
|
* permit persons to whom the Software is furnished to do so, subject to
|
|
* the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be
|
|
* included in all copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
|
|
* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
|
|
* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
|
|
* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
|
* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#ifdef _MSC_VER
|
|
#include <intrin.h>
|
|
#endif
|
|
|
|
namespace Util
|
|
{
|
|
#ifdef __GNUC__
|
|
#define leading_zeroes_(x) ((x) == 0 ? 32 : __builtin_clz(x))
|
|
#define trailing_zeroes_(x) ((x) == 0 ? 32 : __builtin_ctz(x))
|
|
#define trailing_ones_(x) __builtin_ctz(~uint32_t(x))
|
|
#define leading_zeroes64_(x) ((x) == 0 ? 64 : __builtin_clzll(x))
|
|
#define trailing_zeroes64_(x) ((x) == 0 ? 64 : __builtin_ctzll(x))
|
|
#define trailing_ones64_(x) __builtin_ctzll(~uint64_t(x))
|
|
#define popcount32_(x) __builtin_popcount(x)
|
|
#define popcount64_(x) __builtin_popcountll(x)
|
|
|
|
static inline uint32_t leading_zeroes(uint32_t x) { return leading_zeroes_(x); }
|
|
static inline uint32_t trailing_zeroes(uint32_t x) { return trailing_zeroes_(x); }
|
|
static inline uint32_t trailing_ones(uint32_t x) { return trailing_ones_(x); }
|
|
static inline uint32_t leading_zeroes64(uint64_t x) { return leading_zeroes64_(x); }
|
|
static inline uint32_t trailing_zeroes64(uint64_t x) { return trailing_zeroes64_(x); }
|
|
static inline uint32_t trailing_ones64(uint64_t x) { return trailing_ones64_(x); }
|
|
static inline uint32_t popcount32(uint32_t x) { return popcount32_(x); }
|
|
static inline uint32_t popcount64(uint64_t x) { return popcount64_(x); }
|
|
|
|
#elif defined(_MSC_VER)
|
|
namespace Internal
|
|
{
|
|
static inline uint32_t popcount32(uint32_t x)
|
|
{
|
|
return __popcnt(x);
|
|
}
|
|
|
|
static inline uint32_t popcount64(uint64_t x)
|
|
{
|
|
#ifdef _WIN64
|
|
return __popcnt64(x);
|
|
#else
|
|
return popcount32(uint32_t(x)) + popcount32(uint32_t(x >> 32));
|
|
#endif
|
|
}
|
|
|
|
static inline uint32_t clz(uint32_t x)
|
|
{
|
|
unsigned long result;
|
|
if (_BitScanReverse(&result, x))
|
|
return 31 - result;
|
|
else
|
|
return 32;
|
|
}
|
|
|
|
static inline uint32_t ctz(uint32_t x)
|
|
{
|
|
unsigned long result;
|
|
if (_BitScanForward(&result, x))
|
|
return result;
|
|
else
|
|
return 32;
|
|
}
|
|
|
|
static inline uint32_t clz64(uint64_t x)
|
|
{
|
|
#ifdef _WIN64
|
|
unsigned long result;
|
|
if (_BitScanReverse64(&result, x))
|
|
return 63 - result;
|
|
else
|
|
return 64;
|
|
#else
|
|
if (x > UINT32_MAX)
|
|
return clz(uint32_t(x >> 32));
|
|
else
|
|
return clz(uint32_t(x)) + 32;
|
|
#endif
|
|
}
|
|
|
|
static inline uint32_t ctz64(uint64_t x)
|
|
{
|
|
#ifdef _WIN64
|
|
unsigned long result;
|
|
if (_BitScanForward64(&result, x))
|
|
return result;
|
|
else
|
|
return 64;
|
|
#else
|
|
if ((x & UINT32_MAX) != 0)
|
|
return ctz(uint32_t(x));
|
|
else
|
|
return ctz(uint32_t(x >> 32)) + 32;
|
|
#endif
|
|
}
|
|
}
|
|
|
|
static inline uint32_t leading_zeroes(uint32_t x) { return Internal::clz(x); }
|
|
static inline uint32_t trailing_zeroes(uint32_t x) { return Internal::ctz(x); }
|
|
static inline uint32_t trailing_ones(uint32_t x) { return Internal::ctz(~x); }
|
|
static inline uint32_t leading_zeroes64(uint64_t x) { return Internal::clz64(x); }
|
|
static inline uint32_t trailing_zeroes64(uint64_t x) { return Internal::ctz64(x); }
|
|
static inline uint32_t trailing_ones64(uint64_t x) { return Internal::ctz64(~x); }
|
|
static inline uint32_t popcount32(uint32_t x) { return Internal::popcount32(x); }
|
|
static inline uint32_t popcount64(uint64_t x) { return Internal::popcount64(x); }
|
|
#else
|
|
#error "Implement me."
|
|
#endif
|
|
|
|
template <typename T>
|
|
inline void for_each_bit64(uint64_t value, const T &func)
|
|
{
|
|
while (value)
|
|
{
|
|
uint32_t bit = trailing_zeroes64(value);
|
|
func(bit);
|
|
value &= ~(1ull << bit);
|
|
}
|
|
}
|
|
|
|
template <typename T>
|
|
inline void for_each_bit(uint32_t value, const T &func)
|
|
{
|
|
while (value)
|
|
{
|
|
uint32_t bit = trailing_zeroes(value);
|
|
func(bit);
|
|
value &= ~(1u << bit);
|
|
}
|
|
}
|
|
|
|
template <typename T>
|
|
inline void for_each_bit_range(uint32_t value, const T &func)
|
|
{
|
|
if (value == ~0u)
|
|
{
|
|
func(0, 32);
|
|
return;
|
|
}
|
|
|
|
uint32_t bit_offset = 0;
|
|
while (value)
|
|
{
|
|
uint32_t bit = trailing_zeroes(value);
|
|
bit_offset += bit;
|
|
value >>= bit;
|
|
uint32_t range = trailing_ones(value);
|
|
func(bit_offset, range);
|
|
value &= ~((1u << range) - 1);
|
|
}
|
|
}
|
|
|
|
template <typename T>
|
|
inline bool is_pow2(T value)
|
|
{
|
|
return (value & (value - T(1))) == T(0);
|
|
}
|
|
|
|
inline uint32_t next_pow2(uint32_t v)
|
|
{
|
|
v--;
|
|
v |= v >> 16;
|
|
v |= v >> 8;
|
|
v |= v >> 4;
|
|
v |= v >> 2;
|
|
v |= v >> 1;
|
|
return v + 1;
|
|
}
|
|
|
|
inline uint32_t prev_pow2(uint32_t v)
|
|
{
|
|
return next_pow2(v + 1) >> 1;
|
|
}
|
|
|
|
inline uint32_t floor_log2(uint32_t v)
|
|
{
|
|
return 31 - leading_zeroes(v);
|
|
}
|
|
}
|