tools/genmodule/stringlist.c

   1 /*
   2     Copyright © 1995-2005, The AROS Development Team. All rights reserved.
   3     $Id$
   4
   5     Code to handle list of strings
   6 */
   7 #include <stdio.h>
   8 #include <stdlib.h>
   9 #include <string.h>
  10
  11 #include "stringlist.h"
  12
  13 struct stringlist *slist_append(struct stringlist **list, const char *s)
  14 {
  15     struct stringlist **listit = list;
  16     struct stringlist *node = malloc(sizeof(struct stringlist));
  17
  18     if (node == NULL)
  19     {
  20         fprintf(stderr, "Out of memory!\n");
  21         exit(20);
  22     }
  23
  24     while (*listit != NULL) listit = &(*listit)->next;
  25
  26     *listit = node;
  27     node->next = NULL;
  28     node->s = strdup(s);
  29     if (node->s == NULL)
  30     {
  31         fprintf(stderr, "Out of memory!\n");
  32         exit(20);
  33     }
  34
  35     return node;
  36 }
  37
  38 struct stringlist *slist_prepend(struct stringlist **list, const char *s)
  39 {
  40     struct stringlist **listit = list;
  41     struct stringlist *node = malloc(sizeof(struct stringlist));
  42
  43     if (node == NULL)
  44     {
  45         fprintf(stderr, "Out of memory!\n");
  46         exit(20);
  47     }
  48
  49     node->next = *listit;
  50     node->s = strdup(s);
  51     if (node->s == NULL)
  52     {
  53         fprintf(stderr, "Out of memory!\n");
  54         exit(20);
  55     }
  56     *listit = node;
  57
  58     return node;
  59 }
  60
  61 int slist_remove(struct stringlist **list, struct stringlist *node)
  62 {
  63     struct stringlist **listit = list;
  64
  65     while(*listit != NULL && *listit != node) listit = &(*listit)->next;
  66
  67     if (*listit == node)
  68     {
  69         *listit = (*listit)->next;
  70         free(node->s);
  71         free(node);
  72         return 1;
  73     }
  74     else
  75         return 0;
  76 }
  77
  78 int slist_length(struct stringlist *slist)
  79 {
  80     int i;
  81
  82     for (i=0; slist; i++, slist=slist->next);
  83
  84     return i;
  85 }