1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
|
/* libnih
*
* dbus_util.c - D-Bus utility functions
*
* Copyright © 2009 Scott James Remnant <scott@netsplit.com>.
* Copyright © 2009 Canonical Ltd.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2, as
* published by the Free Software Foundation.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif /* HAVE_CONFIG_H */
#include <stdio.h>
#include <stdarg.h>
#include <string.h>
#include <nih/macros.h>
#include <nih/alloc.h>
#include <nih/logging.h>
#include "dbus_util.h"
/**
* nih_dbus_path:
* @parent: parent object for new string,
* @root: root of path.
*
* Generates a D-Bus path suitable for object registration rooted at
* @root with each of the further elements joined with "/" separators and
* appended after non-permissible characters are removed.
*
* The final argument to this function must be NULL to signify the end
* of elements.
*
* If @parent is not NULL, it should be a pointer to another object which
* will be used as a parent for the returned string. When all parents
* of the returned string are freed, the returned string will also be
* freed.
*
* Returns: newly allocated string or NULL if insufficient memory.
**/
char *
nih_dbus_path (const void *parent,
const char *root,
...)
{
const char *arg;
const char *ptr;
char * path;
va_list args;
size_t len;
nih_assert (root != NULL);
/* First work out how much space we'll need */
len = strlen (root);
va_start (args, root);
for (arg = va_arg (args, const char *); arg != NULL;
arg = va_arg (args, const char *)) {
len += 1;
if (! *arg)
len += 1;
for (ptr = arg; *ptr != '\0'; ptr++) {
if ( ((*ptr >= 'a') && (*ptr <= 'z'))
|| ((*ptr >= 'A') && (*ptr <= 'Z'))
|| ((*ptr >= '0') && (*ptr <= '9'))) {
len += 1;
} else {
len += 3;
}
}
}
va_end (args);
/* Now we can allocate it */
path = nih_alloc (parent, len + 1);
if (! path)
return NULL;
/* And copy the elements in */
strcpy (path, root);
len = strlen (root);
va_start (args, root);
for (arg = va_arg (args, const char *); arg != NULL;
arg = va_arg (args, const char *)) {
path[len++] = '/';
if (! *arg)
path[len++] = '_';
for (ptr = arg; *ptr != '\0'; ptr++) {
if ( ((*ptr >= 'a') && (*ptr <= 'z'))
|| ((*ptr >= 'A') && (*ptr <= 'Z'))
|| ((*ptr >= '0') && (*ptr <= '9'))) {
path[len++] = *ptr;
} else {
path[len++] = '_';
sprintf (path + len, "%02x", *ptr);
len += 2;
}
}
}
va_end (args);
path[len] = '\0';
return path;
}
|