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/>.
32 #include "libudev-private.h"
34 static ssize_t get_sys_link(struct udev *udev, const char *slink, const char *syspath, char *subsystem, size_t size)
36 char path[UTIL_PATH_SIZE];
40 util_strlcpy(path, syspath, sizeof(path));
41 util_strlcat(path, "/", sizeof(path));
42 util_strlcat(path, slink, sizeof(path));
43 len = readlink(path, path, sizeof(path));
44 if (len < 0 || len >= (ssize_t) sizeof(path))
47 pos = strrchr(path, '/');
51 info(udev, "resolved link to: '%s'\n", pos);
52 return util_strlcpy(subsystem, pos, size);
55 ssize_t util_get_sys_subsystem(struct udev *udev, const char *syspath, char *subsystem, size_t size)
57 return get_sys_link(udev, "subsystem", syspath, subsystem, size);
60 ssize_t util_get_sys_driver(struct udev *udev, const char *syspath, char *driver, size_t size)
62 return get_sys_link(udev, "driver", syspath, driver, size);
65 int util_resolve_sys_link(struct udev *udev, char *syspath, size_t size)
67 char link_target[UTIL_PATH_SIZE];
73 len = readlink(syspath, link_target, sizeof(link_target));
76 link_target[len] = '\0';
77 dbg(udev, "path link '%s' points to '%s'\n", syspath, link_target);
79 for (back = 0; strncmp(&link_target[back * 3], "../", 3) == 0; back++)
81 dbg(udev, "base '%s', tail '%s', back %i\n", syspath, &link_target[back * 3], back);
82 for (i = 0; i <= back; i++) {
83 char *pos = strrchr(syspath, '/');
89 dbg(udev, "after moving back '%s'\n", syspath);
90 util_strlcat(syspath, "/", size);
91 util_strlcat(syspath, &link_target[back * 3], size);
95 struct util_name_entry *util_name_list_add(struct udev *udev, struct list_head *name_list,
96 const char *name, const char *value, int sort)
98 struct util_name_entry *name_loop;
99 struct util_name_entry *name_new;
101 /* avoid duplicate entries */
102 list_for_each_entry(name_loop, name_list, node) {
103 if (strcmp(name_loop->name, name) == 0) {
104 dbg(udev, "'%s' is already in the list\n", name);
110 list_for_each_entry(name_loop, name_list, node) {
111 if (strcmp(name_loop->name, name) > 0)
116 name_new = malloc(sizeof(struct util_name_entry));
117 if (name_new == NULL)
119 memset(name_new, 0x00, sizeof(struct util_name_entry));
120 name_new->name = strdup(name);
121 if (name_new->name == NULL) {
126 name_new->value = strdup(value);
127 if (name_new->value == NULL) {
132 dbg(udev, "adding '%s=%s'\n", name_new->name, name_new->value);
133 list_add_tail(&name_new->node, &name_loop->node);
137 void util_name_list_cleanup(struct udev *udev, struct list_head *name_list)
139 struct util_name_entry *name_loop;
140 struct util_name_entry *name_tmp;
142 list_for_each_entry_safe(name_loop, name_tmp, name_list, node) {
143 list_del(&name_loop->node);
144 free(name_loop->name);
145 free(name_loop->value);
150 int util_log_priority(const char *priority)
155 prio = strtol(priority, &endptr, 10);
156 if (endptr[0] == '\0')
158 if (strncasecmp(priority, "err", 3) == 0)
160 if (strcasecmp(priority, "info") == 0)
162 if (strcasecmp(priority, "debug") == 0)
167 size_t util_path_encode(char *s, size_t len)
173 for (i = 0, j = 0; s[i] != '\0'; i++) {
175 memcpy(&t[j], "\\x2f", 4);
177 } else if (s[i] == '\\') {
178 memcpy(&t[j], "\\x5c", 4);
190 size_t util_path_decode(char *s)
194 for (i = 0, j = 0; s[i] != '\0'; j++) {
195 if (memcmp(&s[i], "\\x2f", 4) == 0) {
198 }else if (memcmp(&s[i], "\\x5c", 4) == 0) {
210 void util_remove_trailing_chars(char *path, char c)
217 while (len > 0 && path[len-1] == c)
221 size_t util_strlcpy(char *dst, const char *src, size_t size)
228 while ((ch = *p++)) {
234 /* If size == 0 there is no space for a final null... */
240 size_t util_strlcat(char *dst, const char *src, size_t size)
247 while (bytes < size && *q) {
252 return (bytes + strlen(src));
254 while ((ch = *p++)) {
264 /* count of characters used to encode one unicode char */
265 static int utf8_encoded_expected_len(const char *str)
267 unsigned char c = (unsigned char)str[0];
271 if ((c & 0xe0) == 0xc0)
273 if ((c & 0xf0) == 0xe0)
275 if ((c & 0xf8) == 0xf0)
277 if ((c & 0xfc) == 0xf8)
279 if ((c & 0xfe) == 0xfc)
284 /* decode one unicode char */
285 static int utf8_encoded_to_unichar(const char *str)
291 len = utf8_encoded_expected_len(str);
296 unichar = str[0] & 0x1f;
299 unichar = (int)str[0] & 0x0f;
302 unichar = (int)str[0] & 0x07;
305 unichar = (int)str[0] & 0x03;
308 unichar = (int)str[0] & 0x01;
314 for (i = 1; i < len; i++) {
315 if (((int)str[i] & 0xc0) != 0x80)
318 unichar |= (int)str[i] & 0x3f;
324 /* expected size used to encode one unicode char */
325 static int utf8_unichar_to_encoded_len(int unichar)
331 if (unichar < 0x10000)
333 if (unichar < 0x200000)
335 if (unichar < 0x4000000)
340 /* check if unicode char has a valid numeric range */
341 static int utf8_unichar_valid_range(int unichar)
343 if (unichar > 0x10ffff)
345 if ((unichar & 0xfffff800) == 0xd800)
347 if ((unichar > 0xfdcf) && (unichar < 0xfdf0))
349 if ((unichar & 0xffff) == 0xffff)
354 /* validate one encoded unicode char and return its length */
355 static int utf8_encoded_valid_unichar(const char *str)
361 len = utf8_encoded_expected_len(str);
369 /* check if expected encoded chars are available */
370 for (i = 0; i < len; i++)
371 if ((str[i] & 0x80) != 0x80)
374 unichar = utf8_encoded_to_unichar(str);
376 /* check if encoded length matches encoded value */
377 if (utf8_unichar_to_encoded_len(unichar) != len)
380 /* check if value has valid range */
381 if (!utf8_unichar_valid_range(unichar))
387 /* allow chars in whitelist, plain ascii, hex-escaping and valid utf8 */
388 int util_replace_chars(char *str, const char *white)
393 while (str[i] != '\0') {
396 /* accept whitelist */
397 if (white != NULL && strchr(white, str[i]) != NULL) {
402 /* accept plain ascii char */
403 if ((str[i] >= '0' && str[i] <= '9') ||
404 (str[i] >= 'A' && str[i] <= 'Z') ||
405 (str[i] >= 'a' && str[i] <= 'z')) {
410 /* accept hex encoding */
411 if (str[i] == '\\' && str[i+1] == 'x') {
416 /* accept valid utf8 */
417 len = utf8_encoded_valid_unichar(&str[i]);
423 /* if space is allowed, replace whitespace with ordinary space */
424 if (isspace(str[i]) && strchr(white, ' ') != NULL) {
431 /* everything else is replaced with '_' */