libudev-util.c revision 1328f66ad16b5afeb5684858c27e121a46c1959e
/***
This file is part of systemd.
Copyright 2008-2012 Kay Sievers <kay@vrfy.org>
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/>.
***/
#include <stdio.h>
#include <stdlib.h>
#include <stddef.h>
#include <unistd.h>
#include <errno.h>
#include <string.h>
#include <dirent.h>
#include <ctype.h>
#include <fcntl.h>
#include <time.h>
#include <pwd.h>
#include <grp.h>
#include "libudev.h"
#include "libudev-private.h"
/**
* SECTION:libudev-util
* @short_description: utils
*
* Utilities useful when dealing with devices and device node names.
*/
{
char p[UTIL_PATH_SIZE];
char *pos;
int err = 0;
if (path[0] == '/')
path++;
util_strscpy(p, sizeof(p), path);
return 0;
for (;;) {
*pos = '\0';
/* don't remove the last one */
break;
if (err < 0) {
err = 0;
break;
}
}
return err;
}
{
char *endptr;
return 0;
if (endptr[0] == '\0')
return uid;
else
return 0;
}
{
char *endptr;
return 0;
if (endptr[0] == '\0')
return gid;
gid = 0;
for (;;) {
char *newbuf;
if (!newbuf)
break;
buflen *= 2;
continue;
} else {
}
break;
}
return gid;
}
/* handle "[<SUBSYSTEM>/<KERNEL>]<attribute>" format */
{
char temp[UTIL_PATH_SIZE];
char *subsys;
char *sysname;
struct udev_device *dev;
char *attr;
if (string[0] != '[')
return -1;
return -1;
sysname[0] = '\0';
return -1;
attr[0] = '\0';
if (attr[0] == '/')
if (attr[0] == '\0')
return -1;
return -1;
if (read_value) {
const char *val;
else
result[0] = '\0';
} else {
size_t l;
char *s;
s = result;
}
return 0;
}
ssize_t util_get_sys_core_link_value(struct udev *udev, const char *slink, const char *syspath, char *value, size_t size)
{
char path[UTIL_PATH_SIZE];
char target[UTIL_PATH_SIZE];
const char *pos;
return -1;
return -1;
}
{
char link_target[UTIL_PATH_SIZE];
int i;
int back;
return -1;
;
for (i = 0; i <= back; i++) {
return -EINVAL;
base[0] = '\0';
}
return -EINVAL;
return 0;
}
int util_log_priority(const char *priority)
{
char *endptr;
int prio;
return prio;
return LOG_ERR;
return LOG_INFO;
return LOG_DEBUG;
return 0;
}
{
size_t i, j;
for (i = 0, j = 0; src[i] != '\0'; i++) {
if (src[i] == '/') {
if (j+4 >= size) {
j = 0;
break;
}
j += 4;
} else if (src[i] == '\\') {
if (j+4 >= size) {
j = 0;
break;
}
j += 4;
} else {
if (j+1 >= size) {
j = 0;
break;
}
j++;
}
}
dest[j] = '\0';
return j;
}
void util_remove_trailing_chars(char *path, char c)
{
return;
}
/*
* Concatenates strings. In any case, terminates in _all_ cases with '\0'
* and moves the @dest pointer forward to the added '\0'. Returns the
* remaining size, and 0 if the string was truncated.
*/
{
if (size > 1)
size = 0;
} else {
if (len > 0) {
}
}
*dest[0] = '\0';
return size;
}
{
int i;
if (i < (int)size) {
*dest += i;
size -= i;
} else {
size = 0;
}
*dest[0] = '\0';
return size;
}
/* concatenates list of strings, moves dest forward */
{
do {
return size;
}
/* copies string */
{
char *s;
s = dest;
}
/* concatenates list of strings */
{
char *s;
s = dest;
do {
return size;
}
/* count of characters used to encode one unicode char */
static int utf8_encoded_expected_len(const char *str)
{
unsigned char c = (unsigned char)str[0];
if (c < 0x80)
return 1;
if ((c & 0xe0) == 0xc0)
return 2;
if ((c & 0xf0) == 0xe0)
return 3;
if ((c & 0xf8) == 0xf0)
return 4;
if ((c & 0xfc) == 0xf8)
return 5;
if ((c & 0xfe) == 0xfc)
return 6;
return 0;
}
/* decode one unicode char */
static int utf8_encoded_to_unichar(const char *str)
{
int unichar;
int len;
int i;
switch (len) {
case 1:
return (int)str[0];
case 2:
break;
case 3:
break;
case 4:
break;
case 5:
break;
case 6:
break;
default:
return -1;
}
for (i = 1; i < len; i++) {
return -1;
unichar <<= 6;
}
return unichar;
}
/* expected size used to encode one unicode char */
static int utf8_unichar_to_encoded_len(int unichar)
{
if (unichar < 0x80)
return 1;
if (unichar < 0x800)
return 2;
if (unichar < 0x10000)
return 3;
if (unichar < 0x200000)
return 4;
if (unichar < 0x4000000)
return 5;
return 6;
}
/* check if unicode char has a valid numeric range */
static int utf8_unichar_valid_range(int unichar)
{
if (unichar > 0x10ffff)
return 0;
return 0;
return 0;
return 0;
return 1;
}
/* validate one encoded unicode char and return its length */
static int utf8_encoded_valid_unichar(const char *str)
{
int len;
int unichar;
int i;
if (len == 0)
return -1;
/* ascii is valid */
if (len == 1)
return 1;
/* check if expected encoded chars are available */
for (i = 0; i < len; i++)
return -1;
/* check if encoded length matches encoded value */
return -1;
/* check if value has valid range */
if (!utf8_unichar_valid_range(unichar))
return -1;
return len;
}
{
size_t i, j;
/* strip trailing whitespace */
len--;
/* strip leading whitespace */
i = 0;
i++;
j = 0;
while (i < len) {
/* substitute multiple whitespace with a single '_' */
i++;
to[j++] = '_';
}
}
to[j] = '\0';
return 0;
}
static int is_whitelisted(char c, const char *white)
{
if ((c >= '0' && c <= '9') ||
(c >= 'A' && c <= 'Z') ||
(c >= 'a' && c <= 'z') ||
return 1;
return 0;
}
/* allow chars in whitelist, plain ascii, hex-escaping and valid utf8 */
{
size_t i = 0;
int replaced = 0;
while (str[i] != '\0') {
int len;
i++;
continue;
}
/* accept hex encoding */
i += 2;
continue;
}
/* accept valid utf8 */
if (len > 1) {
i += len;
continue;
}
/* if space is allowed, replace whitespace with ordinary space */
str[i] = ' ';
i++;
replaced++;
continue;
}
/* everything else is replaced with '_' */
str[i] = '_';
i++;
replaced++;
}
return replaced;
}
/**
* udev_util_encode_string:
* @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
* corresponding 2 char hex value prefixed by '\x'.
*
* Returns: 0 if the entire string was copied, non-zero otherwise.
**/
{
size_t i, j;
return -1;
for (i = 0, j = 0; str[i] != '\0'; i++) {
int seqlen;
if (seqlen > 1) {
goto err;
j += seqlen;
i += (seqlen-1);
if (len-j < 4)
goto err;
j += 4;
} else {
if (len-j < 1)
goto err;
j++;
}
}
if (len-j < 1)
goto err;
str_enc[j] = '\0';
return 0;
err:
return -1;
}
/*
*
* All code is released to the public domain. For business purposes,
* Murmurhash is under the MIT license.
*
*/
{
/*
* 'm' and 'r' are mixing constants generated offline.
* They're not really 'magic', they just happen to work well.
*/
const unsigned int m = 0x5bd1e995;
const int r = 24;
/* initialize the hash to a 'random' value */
/* mix 4 bytes at a time into the hash */
while(len >= 4) {
unsigned int k = *(unsigned int *)data;
k *= m;
k ^= k >> r;
k *= m;
h *= m;
h ^= k;
data += 4;
len -= 4;
}
/* handle the last few bytes of the input array */
switch(len) {
case 3:
case 2:
case 1:
h ^= data[0];
h *= m;
};
/* do a few final mixes of the hash to ensure the last few bytes are well-incorporated */
h ^= h >> 13;
h *= m;
h ^= h >> 15;
return h;
}
unsigned int util_string_hash32(const char *str)
{
}
/* get a bunch of bit numbers out of the hash, and set the bits in our bit field */
{
return bits;
}
{
int fd;
char text[1024];
if (fd < 0)
return -errno;
if (ret < 0)
return ret;
}