-/* toolbox/list.c -
+/* src/toolbox/list.c - double linked list
- Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003
- Institut f. Computersprachen, TU Wien
- R. Grafl, A. Krall, C. Kruegel, C. Oates, R. Obermaisser, M. Probst,
- S. Ring, E. Steiner, C. Thalinger, D. Thuernbeck, P. Tomsich,
- J. Wenninger
+ 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
This file is part of CACAO.
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.
+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
+ 02110-1301, USA.
- Contact: cacao@complang.tuwien.ac.at
+*/
- Authors: Reinhard Grafl
- $Id: list.c 1552 2004-11-19 15:14:58Z twisti $
+#include "config.h"
-*/
+#include <stdlib.h>
+#include "vm/types.h"
-#include <stdlib.h>
+#include "mm/memory.h"
+
+#include "threads/lock-common.h"
-#include "global.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;
-
- } else {
- n->prev = NULL;
- n->next = NULL;
- l->last = n;
- l->first = n;
+ ln->prev = NULL;
+ ln->next = l->first;
+ l->first->prev = ln;
+ l->first = ln;
}
+ else {
+ ln->prev = NULL;
+ ln->next = NULL;
+ l->last = ln;
+ l->first = ln;
+ }
+
+ /* increase number of elements */
+
+ l->size++;
+}
+
+
+/* list_add_last ***************************************************************
+
+ Adds the element as last element.
+
+*******************************************************************************/
+
+void list_add_last(list_t *l, void *element)
+{
+ LOCK_MONITOR_ENTER(l);
+
+ list_add_last_unsynced(l, element);
+
+ LOCK_MONITOR_EXIT(l);
}
-void list_remove(list *l, void *element)
+/* 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 *n = (listnode*) (((char*) element) + l->nodeoffset);
-
- if (n->next) {
- n->next->prev = n->prev;
+ listnode_t *ln;
+
+ ln = (listnode_t *) (((u1 *) element) + l->nodeoffset);
- } else {
- l->last = n->prev;
+ 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;
}
- if (n->prev) {
- n->prev->next = n->next;
+ /* increase number of elements */
- } else {
- l->first = n->next;
- }
+ 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.
- n->next = NULL;
- n->prev = NULL;
+*******************************************************************************/
+
+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 (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;
+ void *el;
+
+ if (l->last == NULL)
+ el = NULL;
+ else
+ el = ((u1 *) l->last) - l->nodeoffset;
- return ((char*) l->first) - 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;
+ void *el;
+
+ LOCK_MONITOR_ENTER(l);
+
+ el = list_next_unsynced(l, element);
- return ((char*) l->last) - l->nodeoffset;
+ 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;
+ listnode_t *ln;
+ void *el;
- n = (listnode*) (((char*) element) + l->nodeoffset);
+ ln = (listnode_t *) (((u1 *) element) + l->nodeoffset);
- if (!n->next)
- return NULL;
+ if (ln->next == NULL)
+ el = NULL;
+ else
+ el = ((u1 *) ln->next) - l->nodeoffset;
- return ((char*) n->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)
+{
+ 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 *n;
+ listnode_t *ln;
+ void *el;
- n = (listnode*) (((char*) element) + l->nodeoffset);
+ ln = (listnode_t *) (((u1 *) element) + l->nodeoffset);
- if (!n->prev)
- return NULL;
+ if (ln->prev == NULL)
+ el = NULL;
+ else
+ el = ((u1 *) ln->prev) - l->nodeoffset;
- return ((char*) n->prev) - l->nodeoffset;
+ return el;
}
projects / cacao.git / blobdiff