2 * libudev - interface to udev device information
4 * Copyright (C) 2008 Kay Sievers <kay.sievers@vrfy.org>
6 * This program is free software: you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation, either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program. If not, see <http://www.gnu.org/licenses/>.
34 #include "libudev-private.h"
36 static ssize_t get_sys_link(struct udev *udev, const char *slink, const char *syspath, char *subsystem, size_t size)
38 char path[UTIL_PATH_SIZE];
42 util_strlcpy(path, syspath, sizeof(path));
43 util_strlcat(path, "/", sizeof(path));
44 util_strlcat(path, slink, sizeof(path));
45 len = readlink(path, path, sizeof(path));
46 if (len < 0 || len >= (ssize_t) sizeof(path))
49 pos = strrchr(path, '/');
53 info(udev, "resolved link to: '%s'\n", pos);
54 return util_strlcpy(subsystem, pos, size);
57 ssize_t util_get_sys_subsystem(struct udev *udev, const char *syspath, char *subsystem, size_t size)
59 return get_sys_link(udev, "subsystem", syspath, subsystem, size);
62 ssize_t util_get_sys_driver(struct udev *udev, const char *syspath, char *driver, size_t size)
64 return get_sys_link(udev, "driver", syspath, driver, size);
67 int util_resolve_sys_link(struct udev *udev, char *syspath, size_t size)
69 char link_target[UTIL_PATH_SIZE];
75 len = readlink(syspath, link_target, sizeof(link_target));
78 link_target[len] = '\0';
79 dbg(udev, "path link '%s' points to '%s'\n", syspath, link_target);
81 for (back = 0; strncmp(&link_target[back * 3], "../", 3) == 0; back++)
83 dbg(udev, "base '%s', tail '%s', back %i\n", syspath, &link_target[back * 3], back);
84 for (i = 0; i <= back; i++) {
85 char *pos = strrchr(syspath, '/');
91 dbg(udev, "after moving back '%s'\n", syspath);
92 util_strlcat(syspath, "/", size);
93 util_strlcat(syspath, &link_target[back * 3], size);
97 struct util_name_entry *util_name_list_add(struct udev *udev, struct list_head *name_list,
98 const char *name, const char *value, int sort)
100 struct util_name_entry *name_loop;
101 struct util_name_entry *name_new;
103 /* avoid duplicate entries */
104 list_for_each_entry(name_loop, name_list, node) {
105 if (strcmp(name_loop->name, name) == 0) {
106 dbg(udev, "'%s' is already in the list\n", name);
112 list_for_each_entry(name_loop, name_list, node) {
113 if (strcmp(name_loop->name, name) > 0)
118 name_new = malloc(sizeof(struct util_name_entry));
119 if (name_new == NULL)
121 memset(name_new, 0x00, sizeof(struct util_name_entry));
122 name_new->name = strdup(name);
123 if (name_new->name == NULL) {
128 name_new->value = strdup(value);
129 if (name_new->value == NULL) {
134 dbg(udev, "adding '%s=%s'\n", name_new->name, name_new->value);
135 list_add_tail(&name_new->node, &name_loop->node);
139 void util_name_list_cleanup(struct udev *udev, struct list_head *name_list)
141 struct util_name_entry *name_loop;
142 struct util_name_entry *name_tmp;
144 list_for_each_entry_safe(name_loop, name_tmp, name_list, node) {
145 list_del(&name_loop->node);
146 free(name_loop->name);
147 free(name_loop->value);
152 int util_log_priority(const char *priority)
157 prio = strtol(priority, &endptr, 10);
158 if (endptr[0] == '\0')
160 if (strncasecmp(priority, "err", 3) == 0)
162 if (strcasecmp(priority, "info") == 0)
164 if (strcasecmp(priority, "debug") == 0)
169 size_t util_path_encode(char *s, size_t len)
175 for (i = 0, j = 0; s[i] != '\0'; i++) {
177 memcpy(&t[j], "\\x2f", 4);
179 } else if (s[i] == '\\') {
180 memcpy(&t[j], "\\x5c", 4);
192 size_t util_path_decode(char *s)
196 for (i = 0, j = 0; s[i] != '\0'; j++) {
197 if (memcmp(&s[i], "\\x2f", 4) == 0) {
200 }else if (memcmp(&s[i], "\\x5c", 4) == 0) {
212 void util_remove_trailing_chars(char *path, char c)
219 while (len > 0 && path[len-1] == c)
223 size_t util_strlcpy(char *dst, const char *src, size_t size)
230 while ((ch = *p++)) {
236 /* If size == 0 there is no space for a final null... */
242 size_t util_strlcat(char *dst, const char *src, size_t size)
249 while (bytes < size && *q) {
254 return (bytes + strlen(src));
256 while ((ch = *p++)) {
266 /* count of characters used to encode one unicode char */
267 static int utf8_encoded_expected_len(const char *str)
269 unsigned char c = (unsigned char)str[0];
273 if ((c & 0xe0) == 0xc0)
275 if ((c & 0xf0) == 0xe0)
277 if ((c & 0xf8) == 0xf0)
279 if ((c & 0xfc) == 0xf8)
281 if ((c & 0xfe) == 0xfc)
286 /* decode one unicode char */
287 static int utf8_encoded_to_unichar(const char *str)
293 len = utf8_encoded_expected_len(str);
298 unichar = str[0] & 0x1f;
301 unichar = (int)str[0] & 0x0f;
304 unichar = (int)str[0] & 0x07;
307 unichar = (int)str[0] & 0x03;
310 unichar = (int)str[0] & 0x01;
316 for (i = 1; i < len; i++) {
317 if (((int)str[i] & 0xc0) != 0x80)
320 unichar |= (int)str[i] & 0x3f;
326 /* expected size used to encode one unicode char */
327 static int utf8_unichar_to_encoded_len(int unichar)
333 if (unichar < 0x10000)
335 if (unichar < 0x200000)
337 if (unichar < 0x4000000)
342 /* check if unicode char has a valid numeric range */
343 static int utf8_unichar_valid_range(int unichar)
345 if (unichar > 0x10ffff)
347 if ((unichar & 0xfffff800) == 0xd800)
349 if ((unichar > 0xfdcf) && (unichar < 0xfdf0))
351 if ((unichar & 0xffff) == 0xffff)
356 /* validate one encoded unicode char and return its length */
357 static int utf8_encoded_valid_unichar(const char *str)
363 len = utf8_encoded_expected_len(str);
371 /* check if expected encoded chars are available */
372 for (i = 0; i < len; i++)
373 if ((str[i] & 0x80) != 0x80)
376 unichar = utf8_encoded_to_unichar(str);
378 /* check if encoded length matches encoded value */
379 if (utf8_unichar_to_encoded_len(unichar) != len)
382 /* check if value has valid range */
383 if (!utf8_unichar_valid_range(unichar))
389 /* allow chars in whitelist, plain ascii, hex-escaping and valid utf8 */
390 int util_replace_chars(char *str, const char *white)
395 while (str[i] != '\0') {
398 /* accept whitelist */
399 if (white != NULL && strchr(white, str[i]) != NULL) {
404 /* accept plain ascii char */
405 if ((str[i] >= '0' && str[i] <= '9') ||
406 (str[i] >= 'A' && str[i] <= 'Z') ||
407 (str[i] >= 'a' && str[i] <= 'z')) {
412 /* accept hex encoding */
413 if (str[i] == '\\' && str[i+1] == 'x') {
418 /* accept valid utf8 */
419 len = utf8_encoded_valid_unichar(&str[i]);
425 /* if space is allowed, replace whitespace with ordinary space */
426 if (isspace(str[i]) && strchr(white, ' ') != NULL) {
433 /* everything else is replaced with '_' */