udev_utils.c

   1 /*
   2  * udev_utils.c - generic stuff used by udev
   3  *
   4  * Copyright (C) 2004-2005 Kay Sievers <kay.sievers@vrfy.org>
   5  *
   6  *      This program is free software; you can redistribute it and/or modify it
   7  *      under the terms of the GNU General Public License as published by the
   8  *      Free Software Foundation version 2 of the License.
   9  *
  10  *      This program is distributed in the hope that it will be useful, but
  11  *      WITHOUT ANY WARRANTY; without even the implied warranty of
  12  *      MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  13  *      General Public License for more details.
  14  *
  15  *      You should have received a copy of the GNU General Public License along
  16  *      with this program; if not, write to the Free Software Foundation, Inc.,
  17  *      675 Mass Ave, Cambridge, MA 02139, USA.
  18  *
  19  */
  20
  21
  22 #include <stdlib.h>
  23 #include <stdio.h>
  24 #include <stddef.h>
  25 #include <unistd.h>
  26 #include <fcntl.h>
  27 #include <errno.h>
  28 #include <ctype.h>
  29 #include <dirent.h>
  30 #include <syslog.h>
  31 #include <sys/utsname.h>
  32
  33 #include "udev.h"
  34
  35
  36 int log_priority(const char *priority)
  37 {
  38         char *endptr;
  39         int prio;
  40
  41         prio = strtol(priority, &endptr, 10);
  42         if (endptr[0] == '\0')
  43                 return prio;
  44         if (strncasecmp(priority, "err", 3) == 0)
  45                 return LOG_ERR;
  46         if (strcasecmp(priority, "info") == 0)
  47                 return LOG_INFO;
  48         if (strcasecmp(priority, "debug") == 0)
  49                 return LOG_DEBUG;
  50         if (string_is_true(priority))
  51                 return LOG_ERR;
  52
  53         return 0;
  54 }
  55
  56 char *name_list_add(struct list_head *name_list, const char *name, int sort)
  57 {
  58         struct name_entry *loop_name;
  59         struct name_entry *new_name;
  60
  61         list_for_each_entry(loop_name, name_list, node) {
  62                 /* avoid doubles */
  63                 if (strcmp(loop_name->name, name) == 0) {
  64                         dbg("'%s' is already in the list", name);
  65                         return loop_name->name;
  66                 }
  67         }
  68
  69         if (sort)
  70                 list_for_each_entry(loop_name, name_list, node) {
  71                         if (sort && strcmp(loop_name->name, name) > 0)
  72                                 break;
  73                 }
  74
  75         new_name = malloc(sizeof(struct name_entry));
  76         if (new_name == NULL)
  77                 return NULL;
  78
  79         strlcpy(new_name->name, name, sizeof(new_name->name));
  80         dbg("adding '%s'", new_name->name);
  81         list_add_tail(&new_name->node, &loop_name->node);
  82
  83         return new_name->name;
  84 }
  85
  86 char *name_list_key_add(struct list_head *name_list, const char *key, const char *value)
  87 {
  88         struct name_entry *loop_name;
  89         struct name_entry *new_name;
  90
  91         list_for_each_entry(loop_name, name_list, node) {
  92                 if (strncmp(loop_name->name, key, strlen(key)) == 0) {
  93                         dbg("key already present '%s', replace it", loop_name->name);
  94                         snprintf(loop_name->name, sizeof(loop_name->name), "%s=%s", key, value);
  95                         loop_name->name[sizeof(loop_name->name)-1] = '\0';
  96                         return loop_name->name;
  97                 }
  98         }
  99
 100         new_name = malloc(sizeof(struct name_entry));
 101         if (new_name == NULL)
 102                 return NULL;
 103
 104         snprintf(new_name->name, sizeof(new_name->name), "%s=%s", key, value);
 105         new_name->name[sizeof(new_name->name)-1] = '\0';
 106         dbg("adding '%s'", new_name->name);
 107         list_add_tail(&new_name->node, &loop_name->node);
 108
 109         return new_name->name;
 110 }
 111
 112 void name_list_cleanup(struct list_head *name_list)
 113 {
 114         struct name_entry *name_loop;
 115         struct name_entry *temp_loop;
 116
 117         list_for_each_entry_safe(name_loop, temp_loop, name_list, node) {
 118                 list_del(&name_loop->node);
 119                 free(name_loop);
 120         }
 121 }
 122
 123 /* calls function for every file found in specified directory */
 124 int add_matching_files(struct list_head *name_list, const char *dirname, const char *suffix)
 125 {
 126         struct dirent *ent;
 127         DIR *dir;
 128         char *ext;
 129         char filename[PATH_SIZE];
 130
 131         dbg("open directory '%s'", dirname);
 132         dir = opendir(dirname);
 133         if (dir == NULL) {
 134                 err("unable to open '%s': %s", dirname, strerror(errno));
 135                 return -1;
 136         }
 137
 138         while (1) {
 139                 ent = readdir(dir);
 140                 if (ent == NULL || ent->d_name[0] == '\0')
 141                         break;
 142
 143                 if ((ent->d_name[0] == '.') || (ent->d_name[0] == COMMENT_CHARACTER))
 144                         continue;
 145
 146                 /* look for file matching with specified suffix */
 147                 ext = strrchr(ent->d_name, '.');
 148                 if (ext == NULL)
 149                         continue;
 150
 151                 if (strcmp(ext, suffix) != 0)
 152                         continue;
 153
 154                 dbg("put file '%s/%s' in list", dirname, ent->d_name);
 155
 156                 snprintf(filename, sizeof(filename), "%s/%s", dirname, ent->d_name);
 157                 filename[sizeof(filename)-1] = '\0';
 158                 name_list_add(name_list, filename, 1);
 159         }
 160
 161         closedir(dir);
 162         return 0;
 163 }