Source-Changes-HG archive
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index][Old Index]
[src/riastradh-drm2]: src/sys Dumb implementation of a subset of Linux's idr ...
details: https://anonhg.NetBSD.org/src/rev/7a73127b5714
branches: riastradh-drm2
changeset: 788002:7a73127b5714
user: riastradh <riastradh%NetBSD.org@localhost>
date: Wed Jul 24 00:50:36 2013 +0000
description:
Dumb implementation of a subset of Linux's idr abstraction.
An idr maintains a mapping from integers to data, like file descriptors
to struct file pointers.
diffstat:
sys/external/bsd/drm2/include/linux/idr.h | 21 +++-
sys/external/bsd/drm2/linux/linux_idr.c | 178 ++++++++++++++++++++++++++++++
sys/modules/drm2/Makefile | 5 +-
3 files changed, 202 insertions(+), 2 deletions(-)
diffs (238 lines):
diff -r 39be40ee49de -r 7a73127b5714 sys/external/bsd/drm2/include/linux/idr.h
--- a/sys/external/bsd/drm2/include/linux/idr.h Wed Jul 24 00:50:03 2013 +0000
+++ b/sys/external/bsd/drm2/include/linux/idr.h Wed Jul 24 00:50:36 2013 +0000
@@ -1,4 +1,4 @@
-/* $NetBSD: idr.h,v 1.1.2.1 2013/07/24 00:33:12 riastradh Exp $ */
+/* $NetBSD: idr.h,v 1.1.2.2 2013/07/24 00:50:36 riastradh Exp $ */
/*-
* Copyright (c) 2013 The NetBSD Foundation, Inc.
@@ -32,4 +32,23 @@
#ifndef _LINUX_IDR_H_
#define _LINUX_IDR_H_
+#include <sys/types.h>
+#include <sys/rwlock.h>
+#include <sys/rbtree.h>
+
+/* XXX Stupid expedient algorithm should be replaced by something better. */
+
+struct idr {
+ krwlock_t idr_lock;
+ rb_tree_t idr_tree;
+ struct idr_node *idr_temp;
+};
+
+void idr_init(struct idr *);
+void idr_destroy(struct idr *);
+void *idr_find(struct idr *, int);
+void idr_remove(struct idr *, int);
+int idr_pre_get(struct idr *, int);
+int idr_get_new_above(struct idr *, void *, int, int *);
+
#endif /* _LINUX_IDR_H_ */
diff -r 39be40ee49de -r 7a73127b5714 sys/external/bsd/drm2/linux/linux_idr.c
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/sys/external/bsd/drm2/linux/linux_idr.c Wed Jul 24 00:50:36 2013 +0000
@@ -0,0 +1,178 @@
+/* $NetBSD: linux_idr.c,v 1.1.2.1 2013/07/24 00:50:36 riastradh Exp $ */
+
+/*-
+ * Copyright (c) 2013 The NetBSD Foundation, Inc.
+ * All rights reserved.
+ *
+ * This code is derived from software contributed to The NetBSD Foundation
+ * by Taylor R. Campbell.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ * notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ * notice, this list of conditions and the following disclaimer in the
+ * documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
+ * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
+ * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
+ * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include <sys/cdefs.h>
+__KERNEL_RCSID(0, "$NetBSD: linux_idr.c,v 1.1.2.1 2013/07/24 00:50:36 riastradh Exp $");
+
+#include <sys/param.h>
+#include <sys/atomic.h>
+#include <sys/kmem.h>
+#include <sys/rbtree.h>
+
+#include <linux/idr.h>
+
+struct idr_node {
+ rb_node_t in_rb_node;
+ int in_index;
+ void *in_data;
+};
+
+static signed int idr_tree_compare_nodes(void *, const void *, const void *);
+static signed int idr_tree_compare_key(void *, const void *, const void *);
+
+static const rb_tree_ops_t idr_rb_ops = {
+ .rbto_compare_nodes = &idr_tree_compare_nodes,
+ .rbto_compare_key = &idr_tree_compare_key,
+ .rbto_node_offset = offsetof(struct idr_node, in_rb_node),
+ .rbto_context = NULL,
+};
+
+static signed int
+idr_tree_compare_nodes(void *ctx __unused, const void *na, const void *nb)
+{
+ const int a = ((const struct idr_node *)na)->in_index;
+ const int b = ((const struct idr_node *)nb)->in_index;
+
+ if (a < b)
+ return -1;
+ else if (b < a)
+ return +1;
+ else
+ return 0;
+}
+
+static signed int
+idr_tree_compare_key(void *ctx __unused, const void *n, const void *key)
+{
+ const int a = ((const struct idr_node *)n)->in_index;
+ const int b = *(const int *)key;
+
+ if (a < b)
+ return -1;
+ else if (b < a)
+ return +1;
+ else
+ return 0;
+}
+
+void
+idr_init(struct idr *idr)
+{
+
+ rw_init(&idr->idr_lock);
+ rb_tree_init(&idr->idr_tree, &idr_rb_ops);
+ idr->idr_temp = NULL;
+}
+
+void
+idr_destroy(struct idr *idr)
+{
+
+ if (idr->idr_temp != NULL) {
+ /* XXX Probably shouldn't happen. */
+ kmem_free(idr->idr_temp, sizeof(*idr->idr_temp));
+ idr->idr_temp = NULL;
+ }
+#if 0 /* XXX No rb_tree_destroy? */
+ rb_tree_destroy(&idr->idr_tree);
+#endif
+ rw_destroy(&idr->idr_lock);
+}
+
+void *
+idr_find(struct idr *idr, int id)
+{
+ const struct idr_node *node;
+ void *data;
+
+ rw_enter(&idr->idr_lock, RW_READER);
+ node = rb_tree_find_node(&idr->idr_tree, &id);
+ data = (node == NULL? NULL : node->in_data);
+ rw_exit(&idr->idr_lock);
+
+ return data;
+}
+
+void
+idr_remove(struct idr *idr, int id)
+{
+ struct idr_node *node;
+
+ rw_enter(&idr->idr_lock, RW_WRITER);
+ node = rb_tree_find_node(&idr->idr_tree, &id);
+ KASSERT(node != NULL);
+ rb_tree_remove_node(&idr->idr_tree, node);
+ rw_exit(&idr->idr_lock);
+ kmem_free(node, sizeof(*node));
+}
+
+int
+idr_pre_get(struct idr *idr, int flags __unused /* XXX */)
+{
+ struct idr_node *const temp = kmem_alloc(sizeof(*temp), KM_SLEEP);
+
+ if (temp == NULL)
+ return 0;
+
+ if (atomic_cas_ptr(&idr->idr_temp, NULL, temp) != NULL)
+ kmem_free(temp, sizeof(*temp));
+
+ return 1;
+}
+
+int
+idr_get_new_above(struct idr *idr, void *data, int min_id, int *id)
+{
+ struct idr_node *node, *search, *collision __unused;
+ int want_id = min_id;
+
+ node = atomic_swap_ptr(&idr->idr_temp, NULL);
+ if (node == NULL)
+ return -EAGAIN;
+
+ rw_enter(&idr->idr_lock, RW_WRITER);
+
+ search = rb_tree_find_node_geq(&idr->idr_tree, &min_id);
+ while ((search != NULL) && (search->in_index == want_id)) {
+ search = rb_tree_iterate(&idr->idr_tree, search, RB_DIR_RIGHT);
+ want_id++;
+ }
+
+ node->in_index = want_id;
+ node->in_data = data;
+
+ collision = rb_tree_insert_node(&idr->idr_tree, node);
+ KASSERT(collision == node);
+
+ rw_exit(&idr->idr_lock);
+
+ return 0;
+}
diff -r 39be40ee49de -r 7a73127b5714 sys/modules/drm2/Makefile
--- a/sys/modules/drm2/Makefile Wed Jul 24 00:50:03 2013 +0000
+++ b/sys/modules/drm2/Makefile Wed Jul 24 00:50:36 2013 +0000
@@ -1,8 +1,9 @@
-# $NetBSD: Makefile,v 1.1.2.2 2013/07/24 00:38:15 riastradh Exp $
+# $NetBSD: Makefile,v 1.1.2.3 2013/07/24 00:50:36 riastradh Exp $
.include "../Makefile.inc"
.PATH: ${S}/external/bsd/drm2/dist/drm
+.PATH: ${S}/external/bsd/drm2/linux
KMOD= drm2
@@ -41,6 +42,8 @@
SRCS+= drm_stub.c
SRCS+= drm_vm.c
+SRCS+= linux_idr.c
+
CPPFLAGS+= -I${S}/external/bsd/drm2/include
CPPFLAGS+= -I${S}/external/bsd/drm2/dist/uapi
CPPFLAGS+= -I${S}/external/bsd/drm2/dist/include
Home |
Main Index |
Thread Index |
Old Index