tools/toollib/toollib.c

   1 /*
   2     Copyright © 1995-2001, The AROS Development Team. All rights reserved.
   3     $Id$
   4 */
   5 #include <stdio.h>
   6 #include <stdlib.h>
   7 #include <string.h>
   8 #include <ctype.h>
   9 #include <assert.h>
  10 #include <toollib/toollib.h>
  11
  12 int verbose;
  13
  14 /* Functions */
  15 char *
  16 _xstrdup (const char * str, const char * file, int line)
  17 {
  18     char * nstr;
  19
  20     assert (str);
  21
  22     nstr = strdup (str);
  23
  24     if (!nstr)
  25     {
  26         fprintf (stderr, "Out of memory in %s:%d", file, line);
  27         exit (20);
  28     }
  29
  30     return nstr;
  31 }
  32
  33 void *
  34 _xmalloc (size_t size, const char * file, int line)
  35 {
  36     void * ptr;
  37
  38     ptr = malloc (size);
  39
  40     if (size && !ptr)
  41     {
  42         fprintf (stderr, "Out of memory in %s:%d", file, line);
  43         exit (20);
  44     }
  45
  46     return ptr;
  47 }
  48
  49 void *
  50 _xrealloc (void * optr, size_t size, const char * file, int line)
  51 {
  52     void * ptr;
  53
  54     ptr = realloc (optr, size);
  55
  56     if (size && !ptr)
  57     {
  58         fprintf (stderr, "Out of memory in %s:%d", file, line);
  59         exit (20);
  60     }
  61
  62     return ptr;
  63 }
  64
  65 void
  66 _xfree (void * ptr, const char * file, int line)
  67 {
  68     if (ptr)
  69         free (ptr);
  70     else
  71         fprintf (stderr, "Illegal free(NULL) in %s:%d", file, line);
  72 }
  73
  74 void *
  75 _xcalloc (size_t number, size_t size, const char * file, int line)
  76 {
  77     void * ptr;
  78
  79     ptr = calloc (number, size);
  80
  81     if (size && !ptr)
  82     {
  83         fprintf (stderr, "Out of memory in %s:%d", file, line);
  84         exit (20);
  85     }
  86
  87     return ptr;
  88 }
  89
  90 Node *
  91 FindNode (const List * l, const char * name)
  92 {
  93     Node * n;
  94
  95     ForeachNode (l, n)
  96     {
  97         if (!strcmp (n->name, name))
  98             return n;
  99     }
 100
 101     return NULL;
 102 }
 103
 104 Node *
 105 FindNodeNC (const List * l, const char * name)
 106 {
 107     Node * n;
 108
 109     ForeachNode (l, n)
 110     {
 111         if (!strcasecmp (n->name, name))
 112             return n;
 113     }
 114
 115     return NULL;
 116 }
 117
 118 void
 119 printlist (const List * l)
 120 {
 121     Node * n;
 122
 123     ForeachNode (l,n)
 124     {
 125         printf ("    \"%s\"\n", n->name);
 126     }
 127 }
 128
 129 int
 130 execute (const char * cmd, const char * args,
 131          const char * in, const char * out)
 132 {
 133     char buffer[4096];
 134     int rc;
 135
 136     strcpy (buffer, cmd);
 137     strcat (buffer, " ");
 138
 139     if (strcmp (in, "-"))
 140     {
 141         strcat (buffer, "<");
 142         strcat (buffer, in);
 143         strcat (buffer, " ");
 144     }
 145
 146     if (strcmp (out, "-"))
 147     {
 148         strcat (buffer, ">");
 149         strcat (buffer, out);
 150         strcat (buffer, " ");
 151     }
 152
 153     strcat (buffer, args);
 154
 155     if (verbose)
 156         printf ("Executing %s...\n", buffer);
 157
 158     rc = system (buffer);
 159
 160     if (rc)
 161     {
 162         printf ("%s failed: %d\n", buffer, rc);
 163     }
 164
 165     return !rc;
 166 }
 167
 168 Node *
 169 RemHead (List * l)
 170 {
 171     Node * node = GetHead (l);
 172
 173     Remove (node);
 174
 175     return node;
 176 }