-/************************** toolbox/list.c *************************************
+/* src/toolbox/list.c - double linked list
- Copyright (c) 1997 A. Krall, R. Grafl, M. Gschwind, M. Probst
+ Copyright (C) 1996-2005, 2006, 2007 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., 51 Franklin Street, Fifth Floor, Boston, MA
+ 02110-1301, USA.
-*******************************************************************************/
+*/
+
+
+#include "config.h"
-#include <stdio.h>
#include <stdlib.h>
-#include <assert.h>
-#include "list.h"
+#include "vm/types.h"
+
+#include "mm/memory.h"
+
+#include "threads/lock-common.h"
+
+#include "toolbox/list.h"
-void list_init (list *l, int nodeoffset)
+/* list_create *****************************************************************
+
+ Allocates a new list and initializes the lock object.
+
+*******************************************************************************/
+
+list_t *list_create(s4 nodeoffset)
{
- l->first = NULL;
- l->last = NULL;
+ list_t *l;
+
+ l = NEW(list_t);
+
+ LOCK_INIT_OBJECT_LOCK(l);
+
+ l->first = NULL;
+ l->last = NULL;
l->nodeoffset = nodeoffset;
+ l->size = 0;
+
+ return l;
}
-void list_addlast (list *l, void *element)
+
+/* list_create_dump ************************************************************
+
+ Allocates a new list on the dump memory.
+
+ ATTENTION: This list does NOT initialize the locking object!!!
+
+*******************************************************************************/
+
+list_t *list_create_dump(s4 nodeoffset)
{
- listnode *n = (listnode*) ( ((char*) element) + l->nodeoffset );
+ list_t *l;
- if (l->last) {
- n->prev = l->last;
- n->next = NULL;
- l->last->next = n;
- l->last = n;
- }
- else {
- n->prev = NULL;
- n->next = NULL;
- l->last = n;
- l->first = n;
- }
+ l = DNEW(list_t);
+
+ l->first = NULL;
+ l->last = NULL;
+ l->nodeoffset = nodeoffset;
+ l->size = 0;
+
+ return l;
+}
+
+
+/* list_add_first **************************************************************
+
+ Adds the element as first element.
+
+*******************************************************************************/
+
+void list_add_first(list_t *l, void *element)
+{
+ LOCK_MONITOR_ENTER(l);
+
+ list_add_first_unsynced(l, element);
+
+ LOCK_MONITOR_EXIT(l);
}
-void list_addfirst (list *l, void *element)
+
+/* list_add_first_unsynced *****************************************************
+
+ Adds the element as first element, but WITHOUT LOCKING!
+
+ ATTENTION: Use this function with care!!!
+
+*******************************************************************************/
+
+void list_add_first_unsynced(list_t *l, void *element)
{
- listnode *n = (listnode*) ( ((char*) element) + l->nodeoffset );
+ listnode_t *ln;
+
+ ln = (listnode_t *) (((u1 *) element) + l->nodeoffset);
if (l->first) {
- n->prev = NULL;
- n->next = l->first;
- l->first->prev = n;
- l->first = n;
- }
+ ln->prev = NULL;
+ ln->next = l->first;
+ l->first->prev = ln;
+ l->first = ln;
+ }
else {
- n->prev = NULL;
- n->next = NULL;
- l->last = n;
- l->first = n;
- }
+ ln->prev = NULL;
+ ln->next = NULL;
+ l->last = ln;
+ l->first = ln;
+ }
+
+ /* increase number of elements */
+
+ l->size++;
}
-void list_remove (list *l, void *element)
+/* list_add_last ***************************************************************
+
+ Adds the element as last element.
+
+*******************************************************************************/
+
+void list_add_last(list_t *l, void *element)
{
- listnode *n = (listnode*) ( ((char*) element) + l->nodeoffset );
+ LOCK_MONITOR_ENTER(l);
+
+ list_add_last_unsynced(l, element);
+
+ LOCK_MONITOR_EXIT(l);
+}
+
+
+/* list_add_last_unsynced ******************************************************
+
+ Adds the element as last element but does NO locking!
+
+ ATTENTION: Use this function with care!!!
+
+*******************************************************************************/
+
+void list_add_last_unsynced(list_t *l, void *element)
+{
+ listnode_t *ln;
+
+ ln = (listnode_t *) (((u1 *) element) + l->nodeoffset);
+
+ if (l->last) {
+ ln->prev = l->last;
+ ln->next = NULL;
+ l->last->next = ln;
+ l->last = ln;
+ }
+ else {
+ ln->prev = NULL;
+ ln->next = NULL;
+ l->last = ln;
+ l->first = ln;
+ }
+
+ /* increase number of elements */
+
+ l->size++;
+}
+
+
+/* list_add_before *************************************************************
+
+ Adds the element newelement to the list l before element.
+
+ [ A ] <-> [ newn ] <-> [ n ] <-> [ B ]
+
+*******************************************************************************/
+
+void list_add_before(list_t *l, void *element, void *newelement)
+{
+ listnode_t *ln;
+ listnode_t *newln;
+
+ ln = (listnode_t *) (((u1 *) element) + l->nodeoffset);
+ newln = (listnode_t *) (((u1 *) newelement) + l->nodeoffset);
+
+ LOCK_MONITOR_ENTER(l);
+
+ /* set the new links */
+
+ newln->prev = ln->prev;
+ newln->next = ln;
+
+ if (newln->prev)
+ newln->prev->next = newln;
+
+ ln->prev = newln;
+
+ /* set list's first and last if necessary */
+
+ if (l->first == ln)
+ l->first = newln;
+
+ if (l->last == ln)
+ l->last = newln;
+
+ /* increase number of elements */
+
+ l->size++;
+
+ LOCK_MONITOR_EXIT(l);
+}
+
+
+/* list_remove ***************************************************************
+
+ Removes the element.
+
+*******************************************************************************/
+
+void list_remove(list_t *l, void *element)
+{
+ LOCK_MONITOR_ENTER(l);
+
+ list_remove_unsynced(l, element);
+
+ LOCK_MONITOR_EXIT(l);
+}
+
+
+/* list_remove_unsynced ********************************************************
+
+ Removes the element but does NO locking!
+
+ ATTENTION: Use this function with care!!!
+
+*******************************************************************************/
+
+void list_remove_unsynced(list_t *l, void *element)
+{
+ listnode_t *ln;
+
+ ln = (listnode_t *) (((u1 *) 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 (ln->next)
+ ln->next->prev = ln->prev;
+ else
+ l->last = ln->prev;
+
+ if (ln->prev)
+ ln->prev->next = ln->next;
+ else
+ l->first = ln->next;
+
+ ln->next = NULL;
+ ln->prev = NULL;
+
+ /* decrease number of elements */
+
+ l->size--;
}
-void *list_first (list *l)
+/* list_first ******************************************************************
+
+ Returns the first element of the list.
+
+*******************************************************************************/
+
+void *list_first(list_t *l)
+{
+ void *el;
+
+ LOCK_MONITOR_ENTER(l);
+
+ el = list_first_unsynced(l);
+
+ LOCK_MONITOR_EXIT(l);
+
+ return el;
+}
+
+
+/* list_first_unsynced *********************************************************
+
+ Returns the first element of the list, but does NO locking!
+
+ ATTENTION: Use this function with care!!!
+
+*******************************************************************************/
+
+void *list_first_unsynced(list_t *l)
+{
+ void *el;
+
+ if (l->first == NULL)
+ el = NULL;
+ else
+ el = ((u1 *) l->first) - l->nodeoffset;
+
+ return el;
+}
+
+
+/* list_last *******************************************************************
+
+ Returns the last element of the list.
+
+*******************************************************************************/
+
+void *list_last(list_t *l)
+{
+ void *el;
+
+ LOCK_MONITOR_ENTER(l);
+
+ el = list_last_unsynced(l);
+
+ LOCK_MONITOR_EXIT(l);
+
+ return el;
+}
+
+
+/* list_last_unsynced **********************************************************
+
+ Returns the last element of the list, but does NO locking!
+
+ ATTENTION: Use this function with care!!!
+
+*******************************************************************************/
+
+void *list_last_unsynced(list_t *l)
{
- if (!l->first) return NULL;
- return ((char*) l->first) - l->nodeoffset;
+ void *el;
+
+ if (l->last == NULL)
+ el = NULL;
+ else
+ el = ((u1 *) l->last) - l->nodeoffset;
+
+ return el;
}
-void *list_last (list *l)
+/* list_next *******************************************************************
+
+ Returns the next element of element from the list.
+
+*******************************************************************************/
+
+void *list_next(list_t *l, void *element)
{
- if (!l->last) return NULL;
- return ((char*) l->last) - l->nodeoffset;
+ void *el;
+
+ LOCK_MONITOR_ENTER(l);
+
+ el = list_next_unsynced(l, element);
+
+ LOCK_MONITOR_EXIT(l);
+
+ return el;
}
-void *list_next (list *l, void *element)
+/* list_next_unsynced **********************************************************
+
+ Returns the next element of element from the list, but does NO
+ locking!
+
+ ATTENTION: Use this function with care!!!
+
+*******************************************************************************/
+
+void *list_next_unsynced(list_t *l, void *element)
{
- listnode *n;
- n = (listnode*) ( ((char*) element) + l->nodeoffset );
- if (!n->next) return NULL;
- return ((char*) n->next) - l->nodeoffset;
+ listnode_t *ln;
+ void *el;
+
+ ln = (listnode_t *) (((u1 *) element) + l->nodeoffset);
+
+ if (ln->next == NULL)
+ el = NULL;
+ else
+ el = ((u1 *) ln->next) - l->nodeoffset;
+
+ return el;
}
-void *list_prev (list *l, void *element)
+/* list_prev *******************************************************************
+
+ Returns the previous element of element from the list.
+
+*******************************************************************************/
+
+void *list_prev(list_t *l, void *element)
{
- listnode *n;
- n = (listnode*) ( ((char*) element) + l->nodeoffset );
- if (!n->prev) return NULL;
- return ((char*) n->prev) - l->nodeoffset;
+ void *el;
+
+ LOCK_MONITOR_ENTER(l);
+
+ el = list_prev_unsynced(l, element);
+
+ LOCK_MONITOR_EXIT(l);
+
+ return el;
}
+
+/* list_prev_unsynced **********************************************************
+
+ Returns the previous element of element from the list, but does NO
+ locking!
+
+ ATTENTION: Use this function with care!!!
+
+*******************************************************************************/
+
+void *list_prev_unsynced(list_t *l, void *element)
+{
+ listnode_t *ln;
+ void *el;
+
+ ln = (listnode_t *) (((u1 *) element) + l->nodeoffset);
+
+ if (ln->prev == NULL)
+ el = NULL;
+ else
+ el = ((u1 *) ln->prev) - l->nodeoffset;
+
+ return el;
+}
+
+
+/*
+ * 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:
+ */
projects / cacao.git / blobdiff