rom/exec/addtail.c

   1 /*
   2     Copyright © 1995-2007, The AROS Development Team. All rights reserved.
   3     $Id$
   4
   5     Desc: Add a node at the end of a list.
   6     Lang: english
   7 */
   8 #include <aros/debug.h>
   9 #include <exec/lists.h>
  10 #include <proto/exec.h>
  11
  12 /*****************************************************************************
  13
  14     NAME */
  15
  16         AROS_LH2I(void, AddTail,
  17
  18 /*  SYNOPSIS */
  19         AROS_LHA(struct List *, list, A0),
  20         AROS_LHA(struct Node *, node, A1),
  21
  22 /*  LOCATION */
  23         struct ExecBase *, SysBase, 41, Exec)
  24
  25 /*  FUNCTION
  26         Insert Node node at the end of a list.
  27
  28     INPUTS
  29         list - The list to insert the node into
  30         node - This node is to be inserted
  31
  32     RESULT
  33
  34     NOTES
  35
  36     EXAMPLE
  37         struct List * list;
  38         struct Node * pred;
  39
  40         // Insert Node at end of the list
  41         AddTail (list, node);
  42
  43     BUGS
  44
  45     SEE ALSO
  46
  47     INTERNALS
  48
  49 ******************************************************************************/
  50 {
  51     AROS_LIBFUNC_INIT
  52 //  ASSERT_VALID_PTR(node); argh! TypeOfMem() doesn't know about the data segment!
  53 //  ASSERT_VALID_PTR(list); argh! Infinite loop in TypeOfMem() if called from ObtainSemaphoreShared() in FindMem()!
  54
  55     /*
  56         Make the node point to the head of the list. Our predecessor is the
  57         previous last node of the list.
  58     */
  59     node->ln_Succ              = (struct Node *)&list->lh_Tail;
  60     node->ln_Pred              = list->lh_TailPred;
  61
  62     /*
  63         Now we are the last now. Make the old last node point to us
  64         and the pointer to the last node, too.
  65     */
  66     list->lh_TailPred->ln_Succ = node;
  67     list->lh_TailPred          = node;
  68     AROS_LIBFUNC_EXIT
  69 } /* AddTail */