compiler/arossupport/removeslist.c

   1 /*
   2     Copyright © 1995-2001, The AROS Development Team. All rights reserved.
   3     $Id$
   4
   5     Desc: Remove a node from a single linked list
   6     Lang: english
   7 */
   8
   9 #include <aros/system.h>
  10 #include <proto/arossupport.h>
  11
  12 /*****************************************************************************
  13
  14     NAME */
  15         #include <proto/arossupport.h>
  16
  17         APTR RemoveSList (
  18
  19 /*  SYNOPSIS */
  20         APTR * list,
  21         APTR   node)
  22
  23 /*  FUNCTION
  24         Remove the node from a single linked list.
  25
  26     INPUTS
  27         list - Pointer to the pointer which contains the first element
  28                 of the single linked list.
  29         node - The node which is to be removed.
  30
  31     RESULT
  32         Returns the node if it was in the list.
  33
  34     NOTES
  35         This function is not part of a library and may thus be called
  36         any time.
  37
  38     EXAMPLE
  39         @atend
  40
  41     BUGS
  42
  43     SEE ALSO
  44
  45     INTERNALS
  46
  47     HISTORY
  48         24-12-95    digulla created
  49
  50 ******************************************************************************/
  51 {
  52     while (*list && *list != node)
  53         list = (APTR *)(*list);
  54
  55     if (*list)
  56     {
  57         *list = *((APTR *)node);
  58         *((APTR *)node) = NULL;
  59
  60         return node;
  61     }
  62
  63     return NULL;
  64 } /* RemoveSList */
  65
  66 #ifdef TEST
  67 #include <stdio.h>
  68
  69 /* A single linked list looks like this: */
  70 struct SNode
  71 {
  72     /* No data before this entry ! */
  73     struct SNode * Next;
  74     int data;
  75 };
  76
  77 struct SNode * List;
  78 struct SNode node1, node2;
  79
  80 int main (int argc, char ** argv)
  81 {
  82     struct SNode * ptr;
  83
  84     List = &node1;
  85     node1.Next = &node2;
  86     node2.Next = NULL;
  87
  88     ptr = RemoveSList ((APTR *)&List, &node2);
  89     if (ptr != &node2)
  90         fprintf (stderr, "Error: Couldn't find node2\n");
  91     else
  92         printf ("node2 removed.\n");
  93
  94     ptr = RemoveSList ((APTR *)&List, &node1);
  95     if (ptr != &node1)
  96         fprintf (stderr, "Error: Couldn't find node1\n");
  97     else
  98         printf ("node1 removed.\n");
  99
 100     if (List)
 101         fprintf (stderr, "Error: List is not empty\n");
 102     else
 103         printf ("List is now empty.\n");
 104
 105     printf ("End.\n");
 106 }
 107 #endif
 108