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