2012-11-12 17:50:33 +01:00
|
|
|
/***
|
|
|
|
This file is part of systemd.
|
|
|
|
|
|
|
|
Copyright 2008-2012 Kay Sievers <kay@vrfy.org>
|
|
|
|
|
|
|
|
systemd is free software; you can redistribute it and/or modify it
|
|
|
|
under the terms of the GNU Lesser General Public License as published by
|
|
|
|
the Free Software Foundation; either version 2.1 of the License, or
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
systemd is distributed in the hope that it will be useful, but
|
|
|
|
WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
Lesser General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
|
|
along with systemd; If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
***/
|
2008-08-27 22:02:41 +02:00
|
|
|
|
2015-10-24 22:58:24 +02:00
|
|
|
#include <ctype.h>
|
2008-08-27 22:02:41 +02:00
|
|
|
#include <errno.h>
|
2015-10-24 22:58:24 +02:00
|
|
|
#include <stddef.h>
|
|
|
|
#include <stdlib.h>
|
2008-08-27 22:02:41 +02:00
|
|
|
#include <string.h>
|
2015-10-24 22:58:24 +02:00
|
|
|
#include <unistd.h>
|
2008-08-27 22:02:41 +02:00
|
|
|
|
2015-11-17 06:52:45 +01:00
|
|
|
#include "libudev.h"
|
|
|
|
|
2015-10-24 22:58:24 +02:00
|
|
|
#include "MurmurHash2.h"
|
|
|
|
#include "device-nodes.h"
|
2008-08-27 22:02:41 +02:00
|
|
|
#include "libudev-private.h"
|
2015-10-27 00:40:25 +01:00
|
|
|
#include "syslog-util.h"
|
2013-09-17 21:39:09 +02:00
|
|
|
#include "utf8.h"
|
2008-08-27 22:02:41 +02:00
|
|
|
|
2011-10-06 01:10:59 +02:00
|
|
|
/**
|
|
|
|
* SECTION:libudev-util
|
|
|
|
* @short_description: utils
|
2012-04-20 03:25:36 +02:00
|
|
|
*
|
|
|
|
* Utilities useful when dealing with devices and device node names.
|
2011-10-06 01:10:59 +02:00
|
|
|
*/
|
|
|
|
|
2012-04-17 00:26:02 +02:00
|
|
|
/* handle "[<SUBSYSTEM>/<KERNEL>]<attribute>" format */
|
|
|
|
int util_resolve_subsys_kernel(struct udev *udev, const char *string,
|
|
|
|
char *result, size_t maxsize, int read_value)
|
|
|
|
{
|
|
|
|
char temp[UTIL_PATH_SIZE];
|
|
|
|
char *subsys;
|
|
|
|
char *sysname;
|
|
|
|
struct udev_device *dev;
|
|
|
|
char *attr;
|
|
|
|
|
|
|
|
if (string[0] != '[')
|
|
|
|
return -1;
|
|
|
|
|
2013-01-09 19:06:46 +01:00
|
|
|
strscpy(temp, sizeof(temp), string);
|
2012-04-17 00:26:02 +02:00
|
|
|
|
|
|
|
subsys = &temp[1];
|
|
|
|
|
|
|
|
sysname = strchr(subsys, '/');
|
|
|
|
if (sysname == NULL)
|
|
|
|
return -1;
|
|
|
|
sysname[0] = '\0';
|
|
|
|
sysname = &sysname[1];
|
|
|
|
|
|
|
|
attr = strchr(sysname, ']');
|
|
|
|
if (attr == NULL)
|
|
|
|
return -1;
|
|
|
|
attr[0] = '\0';
|
|
|
|
attr = &attr[1];
|
|
|
|
if (attr[0] == '/')
|
|
|
|
attr = &attr[1];
|
|
|
|
if (attr[0] == '\0')
|
|
|
|
attr = NULL;
|
|
|
|
|
|
|
|
if (read_value && attr == NULL)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
dev = udev_device_new_from_subsystem_sysname(udev, subsys, sysname);
|
|
|
|
if (dev == NULL)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
if (read_value) {
|
|
|
|
const char *val;
|
|
|
|
|
|
|
|
val = udev_device_get_sysattr_value(dev, attr);
|
|
|
|
if (val != NULL)
|
2013-01-09 19:06:46 +01:00
|
|
|
strscpy(result, maxsize, val);
|
2012-04-17 00:26:02 +02:00
|
|
|
else
|
|
|
|
result[0] = '\0';
|
2014-11-28 14:26:31 +01:00
|
|
|
log_debug("value '[%s/%s]%s' is '%s'", subsys, sysname, attr, result);
|
2012-04-17 00:26:02 +02:00
|
|
|
} else {
|
|
|
|
size_t l;
|
|
|
|
char *s;
|
|
|
|
|
|
|
|
s = result;
|
2013-01-09 19:06:46 +01:00
|
|
|
l = strpcpyl(&s, maxsize, udev_device_get_syspath(dev), NULL);
|
2012-04-17 00:26:02 +02:00
|
|
|
if (attr != NULL)
|
2013-01-09 19:06:46 +01:00
|
|
|
strpcpyl(&s, l, "/", attr, NULL);
|
2014-11-28 14:26:31 +01:00
|
|
|
log_debug("path '[%s/%s]%s' is '%s'", subsys, sysname, attr, result);
|
2012-04-17 00:26:02 +02:00
|
|
|
}
|
|
|
|
udev_device_unref(dev);
|
|
|
|
return 0;
|
|
|
|
}
|
2014-02-13 14:45:51 +01:00
|
|
|
|
2008-09-10 17:08:24 +02:00
|
|
|
int util_log_priority(const char *priority)
|
|
|
|
{
|
2012-01-10 01:34:15 +01:00
|
|
|
char *endptr;
|
|
|
|
int prio;
|
|
|
|
|
2014-11-01 17:06:41 +01:00
|
|
|
prio = strtoul(priority, &endptr, 10);
|
|
|
|
if (endptr[0] == '\0' || isspace(endptr[0])) {
|
|
|
|
if (prio >= 0 && prio <= 7)
|
|
|
|
return prio;
|
|
|
|
else
|
|
|
|
return -ERANGE;
|
|
|
|
}
|
2014-09-15 14:21:00 +02:00
|
|
|
|
|
|
|
return log_level_from_string(priority);
|
2008-09-10 17:08:24 +02:00
|
|
|
}
|
|
|
|
|
2009-05-20 17:57:52 +02:00
|
|
|
size_t util_path_encode(const char *src, char *dest, size_t size)
|
2008-09-10 17:08:24 +02:00
|
|
|
{
|
2012-01-10 01:34:15 +01:00
|
|
|
size_t i, j;
|
|
|
|
|
|
|
|
for (i = 0, j = 0; src[i] != '\0'; i++) {
|
|
|
|
if (src[i] == '/') {
|
|
|
|
if (j+4 >= size) {
|
|
|
|
j = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
memcpy(&dest[j], "\\x2f", 4);
|
|
|
|
j += 4;
|
|
|
|
} else if (src[i] == '\\') {
|
|
|
|
if (j+4 >= size) {
|
|
|
|
j = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
memcpy(&dest[j], "\\x5c", 4);
|
|
|
|
j += 4;
|
|
|
|
} else {
|
|
|
|
if (j+1 >= size) {
|
|
|
|
j = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
dest[j] = src[i];
|
|
|
|
j++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
dest[j] = '\0';
|
|
|
|
return j;
|
2008-09-10 17:08:24 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void util_remove_trailing_chars(char *path, char c)
|
|
|
|
{
|
2012-01-10 01:34:15 +01:00
|
|
|
size_t len;
|
2008-09-10 17:08:24 +02:00
|
|
|
|
2012-01-10 01:34:15 +01:00
|
|
|
if (path == NULL)
|
|
|
|
return;
|
|
|
|
len = strlen(path);
|
|
|
|
while (len > 0 && path[len-1] == c)
|
|
|
|
path[--len] = '\0';
|
2008-09-10 17:08:24 +02:00
|
|
|
}
|
2008-09-10 18:00:31 +02:00
|
|
|
|
2011-10-06 01:10:59 +02:00
|
|
|
int util_replace_whitespace(const char *str, char *to, size_t len)
|
2008-11-05 21:49:52 +01:00
|
|
|
{
|
2012-01-10 01:34:15 +01:00
|
|
|
size_t i, j;
|
|
|
|
|
|
|
|
/* strip trailing whitespace */
|
|
|
|
len = strnlen(str, len);
|
|
|
|
while (len && isspace(str[len-1]))
|
|
|
|
len--;
|
|
|
|
|
|
|
|
/* strip leading whitespace */
|
|
|
|
i = 0;
|
2015-04-05 08:30:49 +02:00
|
|
|
while ((i < len) && isspace(str[i]))
|
2012-01-10 01:34:15 +01:00
|
|
|
i++;
|
|
|
|
|
|
|
|
j = 0;
|
|
|
|
while (i < len) {
|
|
|
|
/* substitute multiple whitespace with a single '_' */
|
|
|
|
if (isspace(str[i])) {
|
|
|
|
while (isspace(str[i]))
|
|
|
|
i++;
|
|
|
|
to[j++] = '_';
|
|
|
|
}
|
|
|
|
to[j++] = str[i++];
|
|
|
|
}
|
|
|
|
to[j] = '\0';
|
2017-01-03 20:31:45 +01:00
|
|
|
return j;
|
2008-11-05 21:49:52 +01:00
|
|
|
}
|
|
|
|
|
2008-09-10 18:24:39 +02:00
|
|
|
/* allow chars in whitelist, plain ascii, hex-escaping and valid utf8 */
|
2011-10-06 01:10:59 +02:00
|
|
|
int util_replace_chars(char *str, const char *white)
|
2008-09-10 18:24:39 +02:00
|
|
|
{
|
2012-01-10 01:34:15 +01:00
|
|
|
size_t i = 0;
|
|
|
|
int replaced = 0;
|
|
|
|
|
|
|
|
while (str[i] != '\0') {
|
|
|
|
int len;
|
|
|
|
|
2013-09-18 18:12:04 +02:00
|
|
|
if (whitelisted_char_for_devnode(str[i], white)) {
|
2012-01-10 01:34:15 +01:00
|
|
|
i++;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* accept hex encoding */
|
|
|
|
if (str[i] == '\\' && str[i+1] == 'x') {
|
|
|
|
i += 2;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* accept valid utf8 */
|
|
|
|
len = utf8_encoded_valid_unichar(&str[i]);
|
|
|
|
if (len > 1) {
|
|
|
|
i += len;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* if space is allowed, replace whitespace with ordinary space */
|
|
|
|
if (isspace(str[i]) && white != NULL && strchr(white, ' ') != NULL) {
|
|
|
|
str[i] = ' ';
|
|
|
|
i++;
|
|
|
|
replaced++;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* everything else is replaced with '_' */
|
|
|
|
str[i] = '_';
|
|
|
|
i++;
|
|
|
|
replaced++;
|
|
|
|
}
|
|
|
|
return replaced;
|
2008-09-10 18:24:39 +02:00
|
|
|
}
|
2008-11-05 21:49:52 +01:00
|
|
|
|
|
|
|
/**
|
2011-10-06 01:10:59 +02:00
|
|
|
* udev_util_encode_string:
|
2008-11-05 21:49:52 +01:00
|
|
|
* @str: input string to be encoded
|
|
|
|
* @str_enc: output string to store the encoded input string
|
|
|
|
* @len: maximum size of the output string, which may be
|
|
|
|
* four times as long as the input string
|
|
|
|
*
|
|
|
|
* Encode all potentially unsafe characters of a string to the
|
2011-10-06 01:10:59 +02:00
|
|
|
* corresponding 2 char hex value prefixed by '\x'.
|
2008-11-05 21:49:52 +01:00
|
|
|
*
|
|
|
|
* Returns: 0 if the entire string was copied, non-zero otherwise.
|
|
|
|
**/
|
2012-04-04 13:30:09 +02:00
|
|
|
_public_ int udev_util_encode_string(const char *str, char *str_enc, size_t len)
|
2008-11-05 21:49:52 +01:00
|
|
|
{
|
2013-09-18 18:12:04 +02:00
|
|
|
return encode_devnode_name(str, str_enc, len);
|
2008-11-05 21:49:52 +01:00
|
|
|
}
|
2009-04-06 11:18:41 +02:00
|
|
|
|
2009-04-22 18:38:16 +02:00
|
|
|
unsigned int util_string_hash32(const char *str)
|
2009-04-22 03:50:11 +02:00
|
|
|
{
|
2013-12-23 02:46:39 +01:00
|
|
|
return MurmurHash2(str, strlen(str), 0);
|
2010-04-22 18:12:36 +02:00
|
|
|
}
|
2009-04-22 18:38:16 +02:00
|
|
|
|
2010-04-22 18:12:36 +02:00
|
|
|
/* get a bunch of bit numbers out of the hash, and set the bits in our bit field */
|
|
|
|
uint64_t util_string_bloom64(const char *str)
|
|
|
|
{
|
2012-01-10 01:34:15 +01:00
|
|
|
uint64_t bits = 0;
|
|
|
|
unsigned int hash = util_string_hash32(str);
|
|
|
|
|
|
|
|
bits |= 1LLU << (hash & 63);
|
|
|
|
bits |= 1LLU << ((hash >> 6) & 63);
|
|
|
|
bits |= 1LLU << ((hash >> 12) & 63);
|
|
|
|
bits |= 1LLU << ((hash >> 18) & 63);
|
|
|
|
return bits;
|
2009-04-22 03:50:11 +02:00
|
|
|
}
|