plugins/valgrind/list.c

   1 /* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
   2 /*
   3  *  Authors: Jeffrey Stedfast <fejj@ximian.com>
   4  *
   5  *  Copyright 2003 Ximian, Inc. (www.ximian.com)
   6  *
   7  *  This program is free software; you can redistribute it and/or modify
   8  *  it under the terms of the GNU General Public License as published by
   9  *  the Free Software Foundation; either version 2 of the License, or
  10  *  (at your option) any later version.
  11  *
  12  *  This program is distributed in the hope that it will be useful,
  13  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
  14  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15  *  GNU General Public License for more details.
  16  *
  17  *  You should have received a copy of the GNU General Public License
  18  *  along with this program; if not, write to the Free Software
  19  *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
  20  *
  21  */
  22
  23
  24 #ifdef HAVE_CONFIG_H
  25 #include <config.h>
  26 #endif
  27
  28 #include "list.h"
  29
  30
  31 void
  32 list_init (List *list)
  33 {
  34         list->head = (ListNode *) &list->tail;
  35         list->tail = NULL;
  36         list->tailpred = (ListNode *) &list->head;
  37 }
  38
  39
  40 int
  41 list_is_empty (List *list)
  42 {
  43         return list->head == (ListNode *) &list->tail;
  44 }
  45
  46
  47 int
  48 list_length (List *list)
  49 {
  50         ListNode *node;
  51         int n = 0;
  52
  53         node = list->head;
  54         while (node->next) {
  55                 node = node->next;
  56                 n++;
  57         }
  58
  59         return n;
  60 }
  61
  62
  63 ListNode *
  64 list_unlink_head (List *list)
  65 {
  66         ListNode *n, *nn;
  67
  68         n = list->head;
  69         nn = n->next;
  70         if (nn) {
  71                 nn->prev = n->prev;
  72                 list->head = nn;
  73                 return n;
  74         }
  75
  76         return NULL;
  77 }
  78
  79
  80 ListNode *
  81 list_unlink_tail (List *list)
  82 {
  83         ListNode *n, *np;
  84
  85         n = list->tailpred;
  86         np = n->prev;
  87         if (np) {
  88                 np->next = n->next;
  89                 list->tailpred = np;
  90                 return n;
  91         }
  92
  93         return NULL;
  94 }
  95
  96
  97 ListNode *
  98 list_prepend_node (List *list, ListNode *node)
  99 {
 100         node->next = list->head;
 101         node->prev = (ListNode *) &list->head;
 102         list->head->prev = node;
 103         list->head = node;
 104
 105         return node;
 106 }
 107
 108
 109 ListNode *
 110 list_append_node (List *list, ListNode *node)
 111 {
 112         node->next = (ListNode *) &list->tail;
 113         node->prev = list->tailpred;
 114         list->tailpred->next = node;
 115         list->tailpred = node;
 116
 117         return node;
 118 }
 119
 120
 121 ListNode *
 122 list_node_unlink  (ListNode *node)
 123 {
 124         node->next->prev = node->prev;
 125         node->prev->next = node->next;
 126
 127         return node;
 128 }