var/da/makedepf90-2.8.8/list.c

   1 /*
   2  * Copyright (C) 2000-2005 Erik Edelmann <Erik.Edelmann@iki.fi>
   3  *
   4  *     This program is free software;  you  can  redistribute  it
   5  *     and/or modify it under the terms of the GNU General Public
   6  *     License version 2 as published  by  the  Free  Software
   7  *     Foundation.
   8  *
   9  *     This program is distributed in the hope that  it  will  be
  10  *     useful, but WITHOUT ANY WARRANTY; without even the implied
  11  *     warranty of MERCHANTABILITY or FITNESS  FOR  A  PARTICULAR
  12  *     PURPOSE.   See  the  GNU  General  Public License for more
  13  *     details.
  14  *
  15  *     You should have received a copy of the GNU General  Public
  16  *     License along with this program; if not, write to the Free
  17  *     Software Foundation, Inc., 59  Temple  Place,  Suite  330,
  18  *     Boston, MA  02111-1307  USA
  19  */
  20
  21 #include <stdlib.h>
  22 #include <assert.h>
  23 #include "list.h"
  24 #include "xmalloc.h"
  25
  26
  27 List *list_find (List *l, const void *data,
  28                  int (*cmpfunc)(const void *, const void *))
  29 /*
  30  * If data matching 's' is found, return it's address.  If no such data is
  31  * found, return NULL.
  32  *
  33  * 'cmpfunc' should return 0 for equal, non 0 for unequal
  34  */
  35 {
  36     List *h;
  37
  38     if (!l)  return NULL;
  39
  40     for (h = l; h; h = h->next)
  41         if (cmpfunc(data, h->data) == 0)  return h;
  42
  43     return NULL;
  44 }
  45
  46
  47 List *list_prepend (List *l, void *data)
  48 /*
  49  * Prepend 'data' to 'l', return address to the updated list.
  50  */
  51 {
  52     List *new;
  53
  54     new = (List *) xmalloc(sizeof(List));
  55     new->data = data;
  56     new->next = l;
  57     return new;
  58 }
  59
  60
  61 List *list_append (List *l, void *data)
  62 /*
  63  * Append 'data' to 'l', return address to the updated list.  This function is
  64  * slower than 'list_prepend', use only when ordering is important.
  65  */
  66 {
  67     List *new, *h;
  68
  69     new = (List *) xmalloc(sizeof(List));
  70     new->data = data;
  71     new->next = NULL;
  72
  73     if (l == NULL)
  74         return new;
  75     else {
  76         for (h = l; h->next; h = h->next)   ;
  77         h->next = new;
  78         return l;
  79     }
  80 }
  81
  82
  83 void list_free (List *l)
  84 {
  85     List *h;
  86
  87     while (l) {
  88         h = l->next;
  89         free (l);
  90         l = h;
  91     }
  92 }
  93
  94
  95 List *list_remove (List *l, List *node)
  96 /* Remove 'node' from 'l'.  Return address of the new updated list */
  97 {
  98     List *h, *hold;
  99
 100     if (!l) return NULL;
 101     if (!node) return l;
 102
 103     hold = NULL;
 104     h = l;
 105     while (h != node && h != NULL) {
 106         hold = h;
 107         h = h->next;
 108     }
 109
 110     assert (h != NULL);
 111
 112     if (hold == NULL)
 113         l = h->next;
 114     else
 115         hold->next = h->next;
 116
 117     node->next = NULL;
 118
 119     return l;
 120 }
 121
 122
 123 int list_length (const List *l)
 124 {
 125     int n = 0;
 126     const List *h;
 127
 128     for (h = l; h; h = h->next) n++;
 129
 130     return n;
 131 }