X-Git-Url: http://pileus.org/git/?a=blobdiff_plain;ds=sidebyside;f=util.c;h=325c2a2b8ab397dfcd7fd360d3abf0d4a3109d7b;hb=bdfa912aef69869a2385d65d5e8486080fc66895;hp=98c40c68a13e89d317992678da38c8361a617ea9;hpb=ee556f1413d9da165fd6ea74f0bf4039ab28da0d;p=wmpus

diff --git a/util.c b/util.c
index 98c40c6..325c2a2 100644
--- a/util.c
+++ b/util.c
@@ -1,8 +1,27 @@
+/*
+ * Copyright (C) 2011 Andy Spencer <andy753421@gmail.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 3 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, see <http://www.gnu.org/licenses/>.
+ */
+
 #include <stdio.h>
 #include <stdlib.h>
+#include <stdarg.h>
 
 #include "util.h"
 
+/* Doubly linked lists */
 list_t *list_insert(list_t *next, void *data)
 {
 	list_t *node = new0(list_t);
@@ -10,10 +29,34 @@ list_t *list_insert(list_t *next, void *data)
 	node->next = next;
 	node->prev = next ? next->prev : NULL;
 	if (node->next) node->next->prev = node;
-	if (node->prev) node->next->next = node;
+	if (node->prev) node->prev->next = node;
 	return node;
 }
 
+void list_insert_after(list_t *prev, void *data)
+{
+	// prev must be valid,
+	// as we cannot return the original list head
+	list_t *node = new0(list_t);
+	node->data = data;
+	node->prev = prev;
+	node->next = prev->next;
+	prev->next = node;
+	if (node->next) node->next->prev = node;
+}
+
+list_t *list_append(list_t *head, void *data)
+{
+	list_t *last = head;
+	while (last && last->next)
+		last = last->next;
+	list_t *node = new0(list_t);
+	node->data = data;
+	node->prev = last;
+	if (last) last->next = node;
+	return last ? head : node;
+}
+
 list_t *list_remove(list_t *head, list_t *node)
 {
 	list_t *next = node->next;
@@ -32,6 +75,30 @@ int list_length(list_t *node)
 	return len;
 }
 
-void list_move(list_t *node, int offset)
+list_t *list_last(list_t *list)
+{
+	while (list && list->next)
+		list = list->next;
+	return list;
+}
+
+list_t *list_find(list_t *list, void *data)
+{
+	for (list_t *cur = list; cur; cur = cur->next)
+		if (cur->data == data)
+			return cur;
+	return NULL;
+}
+
+/* Misc */
+int error(char *fmt, ...)
 {
+	va_list ap;
+	va_start(ap, fmt);
+	fprintf(stderr, "Error: ");
+	vfprintf(stderr, fmt, ap);
+	fprintf(stderr, "\n");
+	va_end(ap);
+	exit(1);
+	return 0;
 }