feat(host): vendor PyroWave + minimal Granite subset as crates/pyrowave-sys

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>
2026-07-15 00:35:10 +02:00
parent 1b73361372
commit 4c3b11445c
396 changed files with 140058 additions and 0 deletions
@@ -0,0 +1,163 @@
+/* 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
+
+#include "object_pool.hpp"
+#include "intrusive_list.hpp"
+#include "intrusive_hash_map.hpp"
+
+namespace Util
+{
+template <typename T>
+class LRUCache
+{
+public:
+	void set_total_cost(uint64_t cost)
+	{
+		total_cost_limit = cost;
+	}
+
+	uint64_t get_current_cost() const
+	{
+		return total_cost;
+	}
+
+	T *find_and_mark_as_recent(uint64_t cookie)
+	{
+		auto *entry = hashmap.find(get_hash(cookie));
+		if (entry)
+		{
+			lru.move_to_front(lru, entry->get());
+			return &entry->get()->t;
+		}
+		else
+			return nullptr;
+	}
+
+	T *allocate(uint64_t cookie, uint64_t cost)
+	{
+		Hash hash = get_hash(cookie);
+		auto *hash_entry = hashmap.find(hash);
+		if (hash_entry)
+		{
+			total_cost += cost - hash_entry->get()->cost;
+			hash_entry->get()->cost = cost;
+			lru.move_to_front(lru, hash_entry->get());
+			return &hash_entry->get()->t;
+		}
+
+		total_cost += cost;
+
+		auto *entry = pool.allocate();
+		entry->cost = cost;
+		entry->hash = hash;
+
+		lru.insert_front(entry);
+		hashmap.emplace_replace(get_hash(cookie), lru.begin());
+		return &entry->t;
+	}
+
+	uint64_t prune()
+	{
+		uint64_t total_pruned = 0;
+		while (total_cost > total_cost_limit)
+		{
+			auto itr = lru.rbegin();
+			total_cost -= itr->cost;
+			total_pruned += itr->cost;
+			lru.erase(itr);
+			hashmap.erase(itr->hash);
+			pool.free(itr.get());
+		}
+		return total_pruned;
+	}
+
+	bool evict(uint64_t cookie)
+	{
+		auto *entry = hashmap.find(get_hash(cookie));
+		if (entry)
+		{
+			lru.move_to_back(lru, entry->get());
+			return true;
+		}
+		else
+			return false;
+	}
+
+	bool erase(uint64_t cookie)
+	{
+		auto *entry = hashmap.find(get_hash(cookie));
+		if (entry)
+		{
+			hashmap.erase(entry);
+			lru.erase(entry->get());
+			pool.free(entry->get().get());
+			return true;
+		}
+		else
+			return false;
+	}
+
+	~LRUCache()
+	{
+		while (!lru.empty())
+		{
+			auto itr = lru.begin();
+			lru.erase(itr);
+			pool.free(itr.get());
+		}
+	}
+
+	struct CacheEntry : IntrusiveListEnabled<CacheEntry>
+	{
+		uint64_t cost;
+		Hash hash;
+		T t;
+	};
+
+	typename IntrusiveList<CacheEntry>::Iterator begin()
+	{
+		return lru.begin();
+	}
+
+	typename IntrusiveList<CacheEntry>::Iterator end()
+	{
+		return lru.end();
+	}
+
+private:
+	uint64_t total_cost = 0;
+	uint64_t total_cost_limit = 0;
+
+	ObjectPool<CacheEntry> pool;
+	IntrusiveList<CacheEntry> lru;
+	IntrusiveHashMap<IntrusivePODWrapper<typename IntrusiveList<CacheEntry>::Iterator>> hashmap;
+
+	static Hash get_hash(uint64_t cookie)
+	{
+		Hasher h;
+		h.u64(cookie);
+		return h.get();
+	}
+};
+}