summaryrefslogtreecommitdiffstats
path: root/avahi-common/rlist.c
diff options
context:
space:
mode:
authorLennart Poettering <lennart@poettering.net>2005-09-25 19:59:40 +0000
committerLennart Poettering <lennart@poettering.net>2005-09-25 19:59:40 +0000
commit1b8b3c22a69f5d0cf8f6ff6bcb8a4cc770faa113 (patch)
treec3134466d37f58a1cb33234ac77c60453ac81090 /avahi-common/rlist.c
parent8371548df70d1948bf04140c5f73eddd1edac12b (diff)
* add new linked list implementation ala GSList
* install llist.h and rlist.h git-svn-id: file:///home/lennart/svn/public/avahi/trunk@606 941a03a8-eaeb-0310-b9a0-b1bbd8fe43fe
Diffstat (limited to 'avahi-common/rlist.c')
-rw-r--r--avahi-common/rlist.c64
1 files changed, 64 insertions, 0 deletions
diff --git a/avahi-common/rlist.c b/avahi-common/rlist.c
new file mode 100644
index 0000000..f24ab03
--- /dev/null
+++ b/avahi-common/rlist.c
@@ -0,0 +1,64 @@
+/* $Id$ */
+
+/***
+ This file is part of avahi.
+
+ avahi is free software; you can redistribute it and/or modify it
+ under the terms of the GNU Lesser General Public License as
+ published by the Free Software Foundation; either version 2.1 of the
+ License, or (at your option) any later version.
+
+ avahi 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 Lesser General
+ Public License for more details.
+
+ You should have received a copy of the GNU Lesser General Public
+ License along with avahi; if not, write to the Free Software
+ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
+ USA.
+***/
+
+#ifdef HAVE_CONFIG_H
+#include <config.h>
+#endif
+
+#include <stdlib.h>
+
+#include "rlist.h"
+#include "malloc.h"
+
+AvahiRList* avahi_rlist_prepend(AvahiRList *r, void *data) {
+ AvahiRList *n;
+
+ if (!(n = avahi_new(AvahiRList, 1)))
+ return NULL;
+
+ n->data = data;
+
+ AVAHI_LLIST_PREPEND(AvahiRList, rlist, r, n);
+ return r;
+}
+
+AvahiRList* avahi_rlist_remove(AvahiRList *r, void *data) {
+ AvahiRList *n;
+
+ for (n = r; n; n = n->rlist_next)
+
+ if (n->data == data) {
+ AVAHI_LLIST_REMOVE(AvahiRList, rlist, r, n);
+ avahi_free(n);
+ break;
+ }
+
+ return r;
+}
+
+AvahiRList* avahi_rlist_remove_by_link(AvahiRList *r, AvahiRList *n) {
+ assert(n);
+
+ AVAHI_LLIST_REMOVE(AvahiRList, rlist, r, n);
+ avahi_free(n);
+
+ return r;
+}