wmradio/lists.c

   1 #include "lists.h"
   2 #include <string.h>
   3
   4 List *list_new_item()
   5 {
   6     List *item;
   7     item = (List *)malloc(sizeof(List));
   8     if(item) memset(item, 0, sizeof(List));
   9     return item;
  10 }
  11
  12 List *list_last(List *list)
  13 {
  14     List *item;
  15
  16     item = list;
  17     if(!item) return NULL;
  18     while(item->next) item = item->next;
  19     return item;
  20 }
  21
  22 List *list_add(List *list, List *newitem)
  23 {
  24     List *lastitem;
  25
  26     if(!newitem) return list;
  27     if(!list) return newitem;
  28
  29     lastitem = list_last(list);
  30     lastitem -> next = newitem;
  31     newitem  -> prev = lastitem;
  32
  33     return list;
  34 }
  35
  36 List *list_add_data(List *list, void *data)
  37 {
  38     List *newitem;
  39
  40     newitem = list_new_item();
  41     if(!newitem) return list;
  42     list = list_add(list,newitem);
  43     newitem  -> data = data;
  44     return list;
  45 }
  46
  47 List *list_node_with_data(List *list, void *data)
  48 {
  49     List *item;
  50
  51     item = list;
  52     while(item) {
  53         if(item->data == data) return item;
  54         item = item->next;
  55     }
  56     return NULL;
  57 }
  58
  59 int list_length(List *list)
  60 {
  61     int l = 0;
  62     List *item;
  63
  64     if(!list) return 0;
  65     item = list;
  66     while(item) {
  67         l++;
  68         item = item->next;
  69     }
  70     return l;
  71 }
  72
  73 List *list_nth_node(List *list, int index)
  74 {
  75     List *item;
  76     int i;
  77
  78     item = list;
  79     i = 0;
  80     while(item) {
  81         if( i == index ) return item;
  82         i++;
  83         item = item->next;
  84     }
  85     return NULL;
  86 }
  87
  88 List *list_remove_node(List *list, List *node)
  89 {
  90     List *prev,*next;
  91
  92     if(!list) return list;
  93     if(!node) return list;
  94
  95     prev = node ->prev;
  96     next = node ->next;
  97     node -> next = NULL;
  98     node -> prev = NULL;
  99     if(prev) prev->next = next;
 100     if(next) next->prev = prev;
 101     if(prev) return list;
 102     return prev;
 103 }
 104
 105 List *list_delete_node(List *list, List *node)
 106 {
 107     list = list_remove_node(list,node);
 108     free(node);
 109     return list;
 110 }
 111
 112 void list_for_each(List *list, list_for_each_function func, void *data)
 113 {
 114     List *item = list;
 115
 116     if(!list) return;
 117     if(!func) return;
 118
 119     while(item) {
 120         if( func(item, data) ) return;
 121         item = item -> next;
 122     }
 123 }
 124
 125 void list_free(List *list)
 126 {
 127     List *item, *prev;
 128
 129     item = list_last(list);
 130
 131     while(item) {
 132         prev = item->prev;
 133         free(item);
 134         item = prev;
 135     }
 136 }
 137
 138 int list_has_node(List *list, List *node)
 139 {
 140     List *i;
 141
 142     for(i=list; i ; i = i->next) {
 143         if( i == node ) return 1;
 144     }
 145     return 0;
 146 }
 147