scalos/libraries/popupmenu/pmdlist.c

   1 //
   2 // pmdlist.c
   3 //
   4 // PopupMenu Library - Linked Lists
   5 //
   6 // Copyright (C)2000 Henrik Isaksson <henrik@boing.nu>
   7 // All Rights Reserved.
   8 //
   9 // $Date$
  10 // $Revision$
  11 //
  12
  13 #include "pmdlist.h"
  14
  15 #include <exec/memory.h>
  16
  17 #include <proto/exec.h>
  18 #include <clib/alib_protos.h>
  19
  20 //
  21 // PM_InitList - allocate and initialize an Exec MinList structure.
  22 //
  23 PMDList *PM_InitList(void)
  24 {
  25     PMDList *newlist;
  26
  27     newlist=(PMDList *)AllocVec(sizeof(struct MinList), MEMF_ANY);
  28     if (newlist) {
  29         NewList((struct List *)newlist);
  30     }
  31
  32     return newlist;
  33 }
  34
  35 //
  36 // PM_FreeList - free all nodes in a list and the list structure itself.
  37 //
  38 void PM_FreeList(PMDList *list)
  39 {
  40     PMGLN *worknode;
  41     PMGLN *nextnode;
  42
  43     worknode = (PMGLN *)(list->mlh_Head); /* First node */
  44     while ((nextnode = (PMGLN *)(worknode->n.mln_Succ))) {
  45         PM_FreeNode((PMNode *)worknode);
  46         worknode = nextnode;
  47     }
  48
  49     FreeVec(list);
  50 }
  51
  52 //
  53 // PM_CopyList - copy a list.
  54 //
  55 PMDList *PM_CopyList(PMDList *list)
  56 {
  57     PMDList *newlist;
  58     PMGLN *worknode;
  59     PMGLN *nextnode;
  60
  61     newlist=PM_InitList();
  62     if (newlist) {
  63         if (list) {
  64             worknode = (PMGLN *)(list->mlh_Head); /* First node */
  65             while ((nextnode = (PMGLN *)(worknode->n.mln_Succ))) {
  66                 PMGLN *copy=(PMGLN *)PM_CopyNode((PMNode *)worknode);
  67                 if (copy) PM_AddToList(newlist, (PMNode *)copy);
  68                 worknode = nextnode;
  69             }
  70         }
  71     }
  72
  73     return newlist;
  74 }
  75
  76 //
  77 // PM_AddToList - add A to list l.
  78 //
  79 void PM_AddToList(PMDList *l, PMNode *A)
  80 {
  81     AddHead((struct List *)l, (struct Node *)A);
  82 }
  83
  84 //
  85 // PM_Unlink - remove A from list l.
  86 //
  87 void PM_Unlink(PMDList *l, PMNode *A)
  88 {
  89     Remove((struct Node *)A);
  90 }
  91
  92 //
  93 // PM_FreeNode - free a PMNode.
  94 //
  95 void PM_FreeNode(PMNode *A)
  96 {
  97     FreeVec(A);
  98 }
  99
 100 //
 101 // PM_CopyNode - copy a PMNode.
 102 //
 103 PMNode *PM_CopyNode(PMNode *A)
 104 {
 105     PMNode *newnode=NULL;
 106
 107     if (A) {
 108         newnode=(PMNode *)AllocVec(((PMGLN *)A)->Length, MEMF_ANY);
 109         if (newnode) {
 110             CopyMem(A, newnode, ((PMGLN *)A)->Length);
 111         }
 112     }
 113
 114     return newnode;
 115 }