nv2a: Add Vulkan renderer

include/qemu/lru.h

@@ -0,0 +1,242 @@
+/*
+ * LRU object list
+ *
+ * Copyright (c) 2021-2024 Matt Borgerson
+ *
+ * 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.
+ *
+ */
+#ifndef LRU_H
+#define LRU_H
+
+#include <assert.h>
+#include <stdint.h>
+#include "qemu/queue.h"
+
+#define LRU_NUM_BINS (1<<16)
+
+typedef struct LruNode {
+	QTAILQ_ENTRY(LruNode) next_global;
+	QTAILQ_ENTRY(LruNode) next_bin;
+	uint64_t hash;
+} LruNode;
+
+typedef struct Lru Lru;
+
+struct Lru {
+	QTAILQ_HEAD(, LruNode) global;
+	QTAILQ_HEAD(, LruNode) bins[LRU_NUM_BINS];
+	int num_used;
+	int num_free;
+
+	/* Initialize a node. */
+	void (*init_node)(Lru *lru, LruNode *node, void *key);
+
+	/* In case of hash collision. Return `true` if nodes differ. */
+	bool (*compare_nodes)(Lru *lru, LruNode *node, void *key);
+
+	/* Optional. Called before eviction. Return `false` to prevent eviction. */
+	bool (*pre_node_evict)(Lru *lru, LruNode *node);
+
+	/* Optional. Called after eviction. Reclaim any associated resources. */
+	void (*post_node_evict)(Lru *lru, LruNode *node);
+};
+
+static inline
+void lru_init(Lru *lru)
+{
+	QTAILQ_INIT(&lru->global);
+	for (unsigned int i = 0; i < LRU_NUM_BINS; i++) {
+		QTAILQ_INIT(&lru->bins[i]);
+	}
+	lru->init_node = NULL;
+	lru->compare_nodes = NULL;
+	lru->pre_node_evict = NULL;
+	lru->post_node_evict = NULL;
+	lru->num_free = 0;
+	lru->num_used = 0;
+}
+
+static inline
+void lru_add_free(Lru *lru, LruNode *node)
+{
+	node->next_bin.tqe_circ.tql_prev = NULL;
+	QTAILQ_INSERT_TAIL(&lru->global, node, next_global);
+	lru->num_free += 1;
+}
+
+static inline
+unsigned int lru_hash_to_bin(Lru *lru, uint64_t hash)
+{
+	return hash % LRU_NUM_BINS;
+}
+
+static inline
+unsigned int lru_get_node_bin(Lru *lru, LruNode *node)
+{
+	return lru_hash_to_bin(lru, node->hash);
+}
+
+static inline
+bool lru_is_node_in_use(Lru *lru, LruNode *node)
+{
+	return QTAILQ_IN_USE(node, next_bin);
+}
+
+static inline
+void lru_evict_node(Lru *lru, LruNode *node)
+{
+	if (!lru_is_node_in_use(lru, node)) {
+		return;
+	}
+
+	unsigned int bin = lru_get_node_bin(lru, node);
+	QTAILQ_REMOVE(&lru->bins[bin], node, next_bin);
+	if (lru->post_node_evict) {
+		lru->post_node_evict(lru, node);
+	}
+
+	lru->num_used -= 1;
+	lru->num_free += 1;
+}
+
+static inline
+LruNode *lru_try_evict_one(Lru *lru)
+{
+	LruNode *found;
+
+	QTAILQ_FOREACH_REVERSE(found, &lru->global, next_global) {
+		if (lru_is_node_in_use(lru, found)
+			&& (!lru->pre_node_evict || lru->pre_node_evict(lru, found))) {
+			lru_evict_node(lru, found);
+			return found;
+		}
+	}
+
+	return NULL;
+}
+
+static inline
+LruNode *lru_evict_one(Lru *lru)
+{
+	LruNode *found = lru_try_evict_one(lru);
+
+	assert(found != NULL); /* No evictable node! */
+
+	return found;
+}
+
+static inline
+LruNode *lru_get_one_free(Lru *lru)
+{
+	LruNode *found;
+
+	QTAILQ_FOREACH_REVERSE(found, &lru->global, next_global) {
+		if (!lru_is_node_in_use(lru, found)) {
+			return found;
+		}
+	}
+
+	return lru_evict_one(lru);
+}
+
+static inline
+bool lru_contains_hash(Lru *lru, uint64_t hash)
+{
+	unsigned int bin = lru_hash_to_bin(lru, hash);
+	LruNode *iter;
+
+	QTAILQ_FOREACH(iter, &lru->bins[bin], next_bin) {
+        if (iter->hash == hash) {
+            return true;
+        }
+    }
+
+	return false;
+}
+
+static inline
+LruNode *lru_lookup(Lru *lru, uint64_t hash, void *key)
+{
+	unsigned int bin = lru_hash_to_bin(lru, hash);
+	LruNode *iter, *found = NULL;
+
+	QTAILQ_FOREACH(iter, &lru->bins[bin], next_bin) {
+        if ((iter->hash == hash) && !lru->compare_nodes(lru, iter, key)) {
+            found = iter;
+            break;
+        }
+    }
+
+	if (found) {
+		QTAILQ_REMOVE(&lru->bins[bin], found, next_bin);
+	} else {
+		found = lru_get_one_free(lru);
+		found->hash = hash;
+		if (lru->init_node) {
+			lru->init_node(lru, found, key);
+		}
+		assert(found->hash == hash);
+
+		lru->num_used += 1;
+		lru->num_free -= 1;
+	}
+
+	QTAILQ_REMOVE(&lru->global, found, next_global);
+	QTAILQ_INSERT_HEAD(&lru->global, found, next_global);
+	QTAILQ_INSERT_HEAD(&lru->bins[bin], found, next_bin);
+
+	return found;
+}
+
+static inline
+void lru_flush(Lru *lru)
+{
+	LruNode *iter, *iter_next;
+
+	for (unsigned int bin = 0; bin < LRU_NUM_BINS; bin++) {
+		QTAILQ_FOREACH_SAFE(iter, &lru->bins[bin], next_bin, iter_next) {
+			bool can_evict = true;
+			if (lru->pre_node_evict) {
+				can_evict = lru->pre_node_evict(lru, iter);
+			}
+			if (can_evict) {
+				lru_evict_node(lru, iter);
+				QTAILQ_REMOVE(&lru->global, iter, next_global);
+				QTAILQ_INSERT_TAIL(&lru->global, iter, next_global);
+			}
+		}
+	}
+}
+
+typedef void (*LruNodeVisitorFunc)(Lru *lru, LruNode *node, void *opaque);
+
+static inline
+void lru_visit_active(Lru *lru, LruNodeVisitorFunc visitor_func, void *opaque)
+{
+	LruNode *iter, *iter_next;
+
+	for (unsigned int bin = 0; bin < LRU_NUM_BINS; bin++) {
+		QTAILQ_FOREACH_SAFE(iter, &lru->bins[bin], next_bin, iter_next) {
+			visitor_func(lru, iter, opaque);
+		}
+	}
+}
+
+#endif

include/qemu/mstring.h

@@ -0,0 +1,82 @@
+#ifndef MSTRING_H
+#define MSTRING_H
+
+#include "qemu/osdep.h"
+#include <string.h>
+
+typedef struct {
+   int ref;
+   gchar *string;
+} MString;
+
+void mstring_append_fmt(MString *mstring, const char *fmt, ...);
+MString *mstring_from_fmt(const char *fmt, ...);
+void mstring_append_va(MString *mstring, const char *fmt, va_list va);
+
+static inline
+void mstring_ref(MString *mstr)
+{
+   mstr->ref++;
+}
+
+static inline
+void mstring_unref(MString *mstr)
+{
+   mstr->ref--;
+   if (!mstr->ref) {
+      g_free(mstr->string);
+      g_free(mstr);
+   }
+}
+
+static inline
+void mstring_append(MString *mstr, const char *str)
+{
+   gchar *n = g_strconcat(mstr->string, str, NULL);
+   g_free(mstr->string);
+   mstr->string = n;
+}
+
+static inline
+void mstring_append_chr(MString *mstr, char chr)
+{
+   mstring_append_fmt(mstr, "%c", chr);
+}
+
+static inline
+void mstring_append_int(MString *mstr, int val)
+{
+   mstring_append_fmt(mstr, "%" PRId64, val);
+}
+
+static inline
+MString *mstring_new(void)
+{
+   MString *mstr = g_malloc(sizeof(MString));
+   mstr->ref = 1;
+   mstr->string = g_strdup("");
+   return mstr;
+}
+
+static inline
+MString *mstring_from_str(const char *str)
+{
+   MString *mstr = g_malloc(sizeof(MString));
+   mstr->ref = 1;
+   mstr->string = g_strdup(str);
+   return mstr;
+}
+
+static inline
+const gchar *mstring_get_str(MString *mstr)
+{
+   return mstr->string;
+}
+
+static inline
+size_t mstring_get_length(MString *mstr)
+{
+   return strlen(mstr->string);
+}
+
+#endif