]>
Commit | Line | Data |
---|---|---|
eb1f0e66 KS |
1 | /* |
2 | * libudev - interface to udev device information | |
3 | * | |
4 | * Copyright (C) 2008 Kay Sievers <kay.sievers@vrfy.org> | |
5 | * | |
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. | |
10 | * | |
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. | |
15 | * | |
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/>. | |
18 | */ | |
19 | ||
20 | #include "config.h" | |
21 | ||
22 | #include <stdio.h> | |
23 | #include <stdlib.h> | |
24 | #include <stddef.h> | |
25 | #include <unistd.h> | |
26 | #include <errno.h> | |
27 | #include <string.h> | |
28 | #include <dirent.h> | |
29 | #include <sys/stat.h> | |
30 | ||
31 | #include "libudev.h" | |
32 | #include "libudev-private.h" | |
eb1f0e66 | 33 | |
95d90c4f | 34 | static ssize_t get_sys_link(struct udev *udev, const char *slink, const char *devpath, char *subsystem, size_t size) |
eb1f0e66 | 35 | { |
3eb46ec6 | 36 | char path[UTIL_PATH_SIZE]; |
eb1f0e66 KS |
37 | ssize_t len; |
38 | const char *pos; | |
39 | ||
3eb46ec6 KS |
40 | util_strlcpy(path, udev_get_sys_path(udev), sizeof(path)); |
41 | util_strlcat(path, devpath, sizeof(path)); | |
42 | util_strlcat(path, "/", sizeof(path)); | |
43 | util_strlcat(path, slink, sizeof(path)); | |
eb1f0e66 KS |
44 | len = readlink(path, path, sizeof(path)); |
45 | if (len < 0 || len >= (ssize_t) sizeof(path)) | |
46 | return -1; | |
47 | path[len] = '\0'; | |
48 | pos = strrchr(path, '/'); | |
49 | if (pos == NULL) | |
50 | return -1; | |
51 | pos = &pos[1]; | |
3eb46ec6 | 52 | return util_strlcpy(subsystem, pos, size); |
eb1f0e66 | 53 | } |
95d90c4f KS |
54 | |
55 | ssize_t util_get_sys_subsystem(struct udev *udev, const char *devpath, char *subsystem, size_t size) | |
56 | { | |
57 | return get_sys_link(udev, "subsystem", devpath, subsystem, size); | |
58 | } | |
59 | ||
60 | ssize_t util_get_sys_driver(struct udev *udev, const char *devpath, char *driver, size_t size) | |
61 | { | |
62 | return get_sys_link(udev, "driver", devpath, driver, size); | |
63 | } | |
64 | ||
b21b95d7 KS |
65 | int util_resolve_sys_link(struct udev *udev, char *devpath, size_t size) |
66 | { | |
3eb46ec6 KS |
67 | char link_path[UTIL_PATH_SIZE]; |
68 | char link_target[UTIL_PATH_SIZE]; | |
69 | ||
b21b95d7 KS |
70 | int len; |
71 | int i; | |
72 | int back; | |
73 | ||
3eb46ec6 KS |
74 | util_strlcpy(link_path, udev_get_sys_path(udev), sizeof(link_path)); |
75 | util_strlcat(link_path, devpath, sizeof(link_path)); | |
b21b95d7 KS |
76 | len = readlink(link_path, link_target, sizeof(link_target)); |
77 | if (len <= 0) | |
78 | return -1; | |
79 | link_target[len] = '\0'; | |
80 | dbg(udev, "path link '%s' points to '%s'\n", devpath, link_target); | |
81 | ||
82 | for (back = 0; strncmp(&link_target[back * 3], "../", 3) == 0; back++) | |
83 | ; | |
84 | dbg(udev, "base '%s', tail '%s', back %i\n", devpath, &link_target[back * 3], back); | |
85 | for (i = 0; i <= back; i++) { | |
86 | char *pos = strrchr(devpath, '/'); | |
87 | ||
88 | if (pos == NULL) | |
89 | return -1; | |
90 | pos[0] = '\0'; | |
91 | } | |
92 | dbg(udev, "after moving back '%s'\n", devpath); | |
3eb46ec6 KS |
93 | util_strlcat(devpath, "/", size); |
94 | util_strlcat(devpath, &link_target[back * 3], size); | |
b21b95d7 KS |
95 | return 0; |
96 | } | |
7a01f11a | 97 | |
7a01f11a KS |
98 | struct util_name_entry *util_name_list_add(struct udev *udev, struct list_head *name_list, |
99 | const char *name, int sort) | |
100 | { | |
101 | struct util_name_entry *name_loop; | |
102 | struct util_name_entry *name_new; | |
103 | ||
104 | /* avoid duplicate entries */ | |
105 | list_for_each_entry(name_loop, name_list, node) { | |
106 | if (strcmp(name_loop->name, name) == 0) { | |
107 | dbg(udev, "'%s' is already in the list\n", name); | |
108 | return name_loop; | |
109 | } | |
110 | } | |
111 | ||
112 | if (sort) { | |
113 | list_for_each_entry(name_loop, name_list, node) { | |
114 | if (strcmp(name_loop->name, name) > 0) | |
115 | break; | |
116 | } | |
117 | } | |
118 | ||
3eb46ec6 KS |
119 | name_new = malloc(sizeof(struct util_name_entry)); |
120 | if (name_new == NULL) | |
121 | return NULL; | |
122 | memset(name_new, 0x00, sizeof(struct util_name_entry)); | |
7a01f11a | 123 | name_new->name = strdup(name); |
3eb46ec6 KS |
124 | if (name_new->name == NULL) { |
125 | free(name_new); | |
7a01f11a | 126 | return NULL; |
3eb46ec6 | 127 | } |
7a01f11a KS |
128 | dbg(udev, "adding '%s'\n", name_new->name); |
129 | list_add_tail(&name_new->node, &name_loop->node); | |
130 | return name_new; | |
131 | } | |
132 | ||
133 | void util_name_list_cleanup(struct udev *udev, struct list_head *name_list) | |
134 | { | |
135 | struct util_name_entry *name_loop; | |
136 | struct util_name_entry *name_tmp; | |
137 | ||
138 | list_for_each_entry_safe(name_loop, name_tmp, name_list, node) { | |
139 | list_del(&name_loop->node); | |
140 | free(name_loop->name); | |
141 | free(name_loop); | |
142 | } | |
143 | } | |
144 | ||
145 | int util_log_priority(const char *priority) | |
146 | { | |
147 | char *endptr; | |
148 | int prio; | |
149 | ||
150 | prio = strtol(priority, &endptr, 10); | |
151 | if (endptr[0] == '\0') | |
152 | return prio; | |
153 | if (strncasecmp(priority, "err", 3) == 0) | |
154 | return LOG_ERR; | |
155 | if (strcasecmp(priority, "info") == 0) | |
156 | return LOG_INFO; | |
157 | if (strcasecmp(priority, "debug") == 0) | |
158 | return LOG_DEBUG; | |
159 | return 0; | |
160 | } | |
161 | ||
162 | size_t util_path_encode(char *s, size_t len) | |
163 | { | |
164 | char t[(len * 3)+1]; | |
165 | size_t i, j; | |
166 | ||
167 | t[0] = '\0'; | |
168 | for (i = 0, j = 0; s[i] != '\0'; i++) { | |
169 | if (s[i] == '/') { | |
170 | memcpy(&t[j], "\\x2f", 4); | |
171 | j += 4; | |
172 | } else if (s[i] == '\\') { | |
173 | memcpy(&t[j], "\\x5c", 4); | |
174 | j += 4; | |
175 | } else { | |
176 | t[j] = s[i]; | |
177 | j++; | |
178 | } | |
179 | } | |
180 | t[j] = '\0'; | |
181 | strncpy(s, t, len); | |
182 | return j; | |
183 | } | |
184 | ||
185 | size_t util_path_decode(char *s) | |
186 | { | |
187 | size_t i, j; | |
188 | ||
189 | for (i = 0, j = 0; s[i] != '\0'; j++) { | |
190 | if (memcmp(&s[i], "\\x2f", 4) == 0) { | |
191 | s[j] = '/'; | |
192 | i += 4; | |
193 | }else if (memcmp(&s[i], "\\x5c", 4) == 0) { | |
194 | s[j] = '\\'; | |
195 | i += 4; | |
196 | } else { | |
197 | s[j] = s[i]; | |
198 | i++; | |
199 | } | |
200 | } | |
201 | s[j] = '\0'; | |
202 | return j; | |
203 | } | |
204 | ||
205 | void util_remove_trailing_chars(char *path, char c) | |
206 | { | |
207 | size_t len; | |
208 | ||
209 | if (path == NULL) | |
210 | return; | |
211 | len = strlen(path); | |
212 | while (len > 0 && path[len-1] == c) | |
213 | path[--len] = '\0'; | |
214 | } | |
3eb46ec6 KS |
215 | |
216 | size_t util_strlcpy(char *dst, const char *src, size_t size) | |
217 | { | |
218 | size_t bytes = 0; | |
219 | char *q = dst; | |
220 | const char *p = src; | |
221 | char ch; | |
222 | ||
223 | while ((ch = *p++)) { | |
224 | if (bytes+1 < size) | |
225 | *q++ = ch; | |
226 | bytes++; | |
227 | } | |
228 | ||
229 | /* If size == 0 there is no space for a final null... */ | |
230 | if (size) | |
231 | *q = '\0'; | |
232 | return bytes; | |
233 | } | |
234 | ||
235 | size_t util_strlcat(char *dst, const char *src, size_t size) | |
236 | { | |
237 | size_t bytes = 0; | |
238 | char *q = dst; | |
239 | const char *p = src; | |
240 | char ch; | |
241 | ||
242 | while (bytes < size && *q) { | |
243 | q++; | |
244 | bytes++; | |
245 | } | |
246 | if (bytes == size) | |
247 | return (bytes + strlen(src)); | |
248 | ||
249 | while ((ch = *p++)) { | |
250 | if (bytes+1 < size) | |
251 | *q++ = ch; | |
252 | bytes++; | |
253 | } | |
254 | ||
255 | *q = '\0'; | |
256 | return bytes; | |
257 | } |