GNU header update.

[cacao.git] / src / toolbox / list.c

diff --git a/src/toolbox/list.c b/src/toolbox/list.c
index 6183684d536f809efad3aa04639871d617313bc0..d06f1ca92e63a97e179a4923478a5e43162d25fb 100644 (file)
--- a/src/toolbox/list.c
+++ b/src/toolbox/list.c
@@ -1,107 +1,163 @@
-/************************** toolbox/list.c *************************************
+/* toolbox/list.c - 
 
-       Copyright (c) 1997 A. Krall, R. Grafl, M. Gschwind, M. Probst
+   Copyright (C) 1996-2005 R. Grafl, A. Krall, C. Kruegel, C. Oates,
+   R. Obermaisser, M. Platter, M. Probst, S. Ring, E. Steiner,
+   C. Thalinger, D. Thuernbeck, P. Tomsich, C. Ullrich, J. Wenninger,
+   Institut f. Computersprachen - TU Wien
 
-       See file COPYRIGHT for information on usage and disclaimer of warranties
+   This file is part of CACAO.
 
-       Not documented, see chain.h.
+   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, or (at
+   your option) any later version.
 
-       Authors: Reinhard Grafl      EMAIL: cacao@complang.tuwien.ac.at
+   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.
 
-       Last Change: 1996/10/03
+   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.
+
+   Contact: cacao@complang.tuwien.ac.at
+
+   Authors: Reinhard Grafl
+
+   $Id: list.c 1735 2004-12-07 14:33:27Z twisti $
+
+*/
 
-*******************************************************************************/
 
-#include <stdio.h>
 #include <stdlib.h>
-#include <assert.h>
 
-#include "list.h"
+#include "toolbox/list.h"
 
 
-void list_init (list *l, int nodeoffset)
+void list_init(list *l, int nodeoffset)
 {
        l->first = NULL;
        l->last = NULL;
        l->nodeoffset = nodeoffset;
 }
 
-void list_addlast (list *l, void *element)
+
+void list_addlast(list *l, void *element)
 {
-       listnode *n = (listnode*) ( ((char*) element) + l->nodeoffset );
+       listnode *n = (listnode*) (((char*) element) + l->nodeoffset);
 
        if (l->last) {
                n->prev = l->last;
                n->next = NULL;
                l->last->next = n;
                l->last = n;
-               }
-       else {
+
+       } else {
                n->prev = NULL;
                n->next = NULL;
                l->last = n;
                l->first = n;
-               }
+       }
 }
 
-void list_addfirst (list *l, void *element)
+
+void list_addfirst(list *l, void *element)
 {
-       listnode *n = (listnode*) ( ((char*) element) + l->nodeoffset );
+       listnode *n = (listnode*) (((char*) element) + l->nodeoffset);
 
        if (l->first) {
                n->prev = NULL;
                n->next = l->first;
                l->first->prev = n;
                l->first = n;
-               }
-       else {
+
+       } else {
                n->prev = NULL;
                n->next = NULL;
                l->last = n;
                l->first = n;
-               }
+       }
 }
 
 
-void list_remove (list *l, void *element)
+void list_remove(list *l, void *element)
 {
-       listnode *n = (listnode*) ( ((char*) element) + l->nodeoffset );
+       listnode *n = (listnode*) (((char*) element) + l->nodeoffset);
        
-       if (n->next) n->next->prev = n->prev;
-               else l->last = n->prev;
-       if (n->prev) n->prev->next = n->next;
-               else l->first = n->next;
+       if (n->next) {
+               n->next->prev = n->prev;
+
+       } else {
+               l->last = n->prev;
+       }
+
+       if (n->prev) {
+               n->prev->next = n->next;
+
+       } else {
+               l->first = n->next;
+       }
+
+       n->next = NULL;
+       n->prev = NULL;
 }
 
  
-void *list_first (list *l)
+void *list_first(list *l)
 {
-       if (!l->first) return NULL;
+       if (!l->first)
+               return NULL;
+
        return ((char*) l->first) - l->nodeoffset;
 }
 
 
-void *list_last (list *l)
+void *list_last(list *l)
 {
-       if (!l->last) return NULL;
+       if (!l->last)
+               return NULL;
+
        return ((char*) l->last) - l->nodeoffset;
 }
 
 
-void *list_next (list *l, void *element)
+void *list_next(list *l, void *element)
 {
        listnode *n;
-       n = (listnode*) ( ((char*) element) + l->nodeoffset );
-       if (!n->next) return NULL;
+
+       n = (listnode*) (((char*) element) + l->nodeoffset);
+
+       if (!n->next)
+               return NULL;
+
        return ((char*) n->next) - l->nodeoffset;
 }
 
        
-void *list_prev (list *l, void *element)
+void *list_prev(list *l, void *element)
 {
        listnode *n;
-       n = (listnode*) ( ((char*) element) + l->nodeoffset );
-       if (!n->prev) return NULL;
+
+       n = (listnode*) (((char*) element) + l->nodeoffset);
+
+       if (!n->prev)
+               return NULL;
+
        return ((char*) n->prev) - l->nodeoffset;
 }
 
+
+/*
+ * These are local overrides for various environment variables in Emacs.
+ * Please do not remove this and leave it at the end of the file, where
+ * Emacs will automagically detect them.
+ * ---------------------------------------------------------------------
+ * Local variables:
+ * mode: c
+ * indent-tabs-mode: t
+ * c-basic-offset: 4
+ * tab-width: 4
+ * End:
+ */