1 files changed, 86 insertions, 0 deletions
diff --git a/btt/dip_rb.c b/btt/dip_rb.c
new file mode 100644
index 0000000..867a97b
--- /dev/null
+++ b/btt/dip_rb.c
@@ -0,0 +1,86 @@
+/*
+ * blktrace output analysis: generate a timeline & gather statistics
+ *
+ * Copyright (C) 2006 Alan D. Brunelle <Alan.Brunelle@hp.com>
+ *
+ *  This program is free software; you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation; either version 2 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program; if not, write to the Free Software
+ *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ *
+ */
+#include <stdio.h>
+#include "globals.h"
+
+int rb_insert(struct rb_root *root, struct io *iop)
+{
+	struct io *__iop;
+	struct rb_node *parent = NULL;
+	struct rb_node **p = &root->rb_node;
+	__u64 __s, s = BIT_START(iop);
+
+	while (*p) {
+		parent = *p;
+		__iop = rb_entry(parent, struct io, rb_node);
+		__s = BIT_START(__iop);
+
+		if (s < __s)
+			p = &(*p)->rb_left;
+		else if (s > __s)
+			p = &(*p)->rb_right;
+		else
+			return 0;
+	}
+
+	rb_link_node(&iop->rb_node, parent, p);
+	rb_insert_color(&iop->rb_node, root);
+	return 1;
+}
+
+struct io *rb_find_sec(struct rb_root *root, __u64 sec)
+{
+	struct io *__iop;
+	struct rb_node *n = root->rb_node;
+
+	while (n) {
+		__iop = rb_entry(n, struct io, rb_node);
+		if (sec < BIT_START(__iop))
+			n = n->rb_left;
+		else if (sec >= BIT_END(__iop))
+			n = n->rb_right;
+		else
+			return __iop;
+	}
+
+	return NULL;
+}
+
+void rb_foreach(struct rb_node *n, struct io *iop,
+		      void (*fnc)(struct io *iop, struct io *this),
+		      struct list_head *head)
+{
+	if (n) {
+		struct io *this = rb_entry(n, struct io, rb_node);
+		__u64 iop_s = BIT_START(iop), iop_e = BIT_END(iop);
+		__u64 this_s = BIT_START(this), this_e = BIT_END(this);
+
+		if ((iop_s <= this_s) && (this_e <= iop_e)) {
+			if (fnc) fnc(iop, this);
+			if (head)
+				list_add_tail(&this->f_head, head);
+		}
+		if (iop_s < this_s)
+			rb_foreach(n->rb_left, iop, fnc, head);
+		if (this_e < iop_e)
+			rb_foreach(n->rb_right, iop, fnc, head);
+	}
+}