workbench/prefs/wanderer/entryelements.c

   1 /*
   2     Copyright  2004-2019, The AROS Development Team. All rights reserved.
   3     This file is part of the Wanderer Preferences program, which is distributed
   4     under the terms of version 2 of the GNU General Public License.
   5
   6     $Id$
   7 */
   8
   9 #include <proto/exec.h>
  10 #include <proto/utility.h>
  11 #include <proto/dos.h>
  12
  13 #include <clib/alib_protos.h>
  14 #include <stdio.h>
  15 #include <string.h>
  16
  17 #define HAVE_ELEMENTFUNCS
  18 #include "entryelements.h"
  19
  20 ULONG EntryElementCount(struct List *entry_List)
  21 {
  22     ULONG count = 0;
  23     struct EntryElement__Entry    *current_Node = NULL;
  24
  25     ForeachNode(entry_List, current_Node)
  26     {
  27         count += 1;
  28     }
  29     return count;
  30 }
  31
  32 BOOL EntryElementRegister(struct List *entry_List, ULONG entry_ID, CONST_STRPTR entry_Name)
  33 {
  34     struct EntryElement__Entry    *current_Node = NULL;
  35     IPTR                        element_NameLen = strlen(entry_Name) ;
  36
  37     //If the element already exists fail ..
  38     ForeachNode(entry_List, current_Node)
  39     {
  40         if ((current_Node->EE_E_ID == (IPTR)entry_ID) ||
  41             (strcmp(current_Node->EE_E_Name, entry_Name) == 0))
  42             return FALSE;
  43     }
  44
  45     current_Node = AllocVec(sizeof(struct EntryElement__Entry), MEMF_PUBLIC|MEMF_CLEAR);
  46     current_Node->EE_E_Name = AllocVec(element_NameLen + 1, MEMF_PUBLIC|MEMF_CLEAR);
  47     strcpy(current_Node->EE_E_Name, entry_Name);
  48
  49     current_Node->EE_E_ID = (IPTR)entry_ID;
  50     AddTail(entry_List, (struct Node *)current_Node);
  51
  52     return TRUE;
  53 }
  54
  55 void EntryElementRemove(struct List *entry_List, ULONG entry_ID)
  56 {
  57     struct EntryElement__Entry    *current_Node = NULL;
  58
  59     ForeachNode(entry_List, current_Node)
  60     {
  61         if (current_Node->EE_E_ID == (IPTR)entry_ID)
  62         {
  63 /* TODO: remove the elements node and free its storage */
  64         }
  65     }
  66 }
  67
  68 IPTR EntryElementFindNode(struct List *entry_List, ULONG entry_ID)
  69 {
  70     struct EntryElement__Entry    *current_Node = NULL;
  71
  72     ForeachNode(entry_List, current_Node)
  73     {
  74         if (current_Node->EE_E_ID == (IPTR)entry_ID)
  75             return (IPTR)current_Node;
  76     }
  77     return 0;
  78 }
  79
  80 IPTR EntryElementFindNamedNode(struct List *entry_List, char * entry_Name)
  81 {
  82     struct EntryElement__Entry    *current_Node = NULL;
  83
  84     ForeachNode(entry_List, current_Node)
  85     {
  86         if (strcmp(current_Node->EE_E_Name, entry_Name) == 0)
  87             return (IPTR)current_Node;
  88     }
  89     return 0;
  90 }
  91
  92 IPTR GetEntryElementName(IPTR entry)
  93 {
  94     return (IPTR)(((struct EntryElement__Entry *)entry)->EE_E_Name);
  95 }
  96
  97 IPTR GetEntryElementID(IPTR  entry)
  98 {
  99     return ((struct EntryElement__Entry *)entry)->EE_E_ID;
 100 }