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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
|
/* SPDX-License-Identifier: LGPL-2.1+ */
#include "alloc-util.h"
#include "bus-internal.h"
#include "bus-message.h"
#include "hexdecoct.h"
#include "string-util.h"
bool object_path_is_valid(const char *p) {
const char *q;
bool slash;
if (!p)
return false;
if (p[0] != '/')
return false;
if (p[1] == 0)
return true;
for (slash = true, q = p+1; *q; q++)
if (*q == '/') {
if (slash)
return false;
slash = true;
} else {
bool good;
good =
(*q >= 'a' && *q <= 'z') ||
(*q >= 'A' && *q <= 'Z') ||
(*q >= '0' && *q <= '9') ||
*q == '_';
if (!good)
return false;
slash = false;
}
if (slash)
return false;
return true;
}
char* object_path_startswith(const char *a, const char *b) {
const char *p;
if (!object_path_is_valid(a) ||
!object_path_is_valid(b))
return NULL;
if (streq(b, "/"))
return (char*) a + 1;
p = startswith(a, b);
if (!p)
return NULL;
if (*p == 0)
return (char*) p;
if (*p == '/')
return (char*) p + 1;
return NULL;
}
bool interface_name_is_valid(const char *p) {
const char *q;
bool dot, found_dot = false;
if (isempty(p))
return false;
for (dot = true, q = p; *q; q++)
if (*q == '.') {
if (dot)
return false;
found_dot = dot = true;
} else {
bool good;
good =
(*q >= 'a' && *q <= 'z') ||
(*q >= 'A' && *q <= 'Z') ||
(!dot && *q >= '0' && *q <= '9') ||
*q == '_';
if (!good)
return false;
dot = false;
}
if (q - p > 255)
return false;
if (dot)
return false;
if (!found_dot)
return false;
return true;
}
bool service_name_is_valid(const char *p) {
const char *q;
bool dot, found_dot = false, unique;
if (isempty(p))
return false;
unique = p[0] == ':';
for (dot = true, q = unique ? p+1 : p; *q; q++)
if (*q == '.') {
if (dot)
return false;
found_dot = dot = true;
} else {
bool good;
good =
(*q >= 'a' && *q <= 'z') ||
(*q >= 'A' && *q <= 'Z') ||
((!dot || unique) && *q >= '0' && *q <= '9') ||
IN_SET(*q, '_', '-');
if (!good)
return false;
dot = false;
}
if (q - p > 255)
return false;
if (dot)
return false;
if (!found_dot)
return false;
return true;
}
bool member_name_is_valid(const char *p) {
const char *q;
if (isempty(p))
return false;
for (q = p; *q; q++) {
bool good;
good =
(*q >= 'a' && *q <= 'z') ||
(*q >= 'A' && *q <= 'Z') ||
(*q >= '0' && *q <= '9') ||
*q == '_';
if (!good)
return false;
}
if (q - p > 255)
return false;
return true;
}
/*
* Complex pattern match
* This checks whether @a is a 'complex-prefix' of @b, or @b is a
* 'complex-prefix' of @a, based on strings that consist of labels with @c as
* spearator. This function returns true if:
* - both strings are equal
* - either is a prefix of the other and ends with @c
* The second rule makes sure that either string needs to be fully included in
* the other, and the string which is considered the prefix needs to end with a
* separator.
*/
static bool complex_pattern_check(char c, const char *a, const char *b) {
bool separator = false;
if (!a && !b)
return true;
if (!a || !b)
return false;
for (;;) {
if (*a != *b)
return (separator && (*a == 0 || *b == 0));
if (*a == 0)
return true;
separator = *a == c;
a++, b++;
}
}
bool namespace_complex_pattern(const char *pattern, const char *value) {
return complex_pattern_check('.', pattern, value);
}
bool path_complex_pattern(const char *pattern, const char *value) {
return complex_pattern_check('/', pattern, value);
}
/*
* Simple pattern match
* This checks whether @a is a 'simple-prefix' of @b, based on strings that
* consist of labels with @c as separator. This function returns true, if:
* - if @a and @b are equal
* - if @a is a prefix of @b, and the first following character in @b (or the
* last character in @a) is @c
* The second rule basically makes sure that if @a is a prefix of @b, then @b
* must follow with a new label separated by @c. It cannot extend the label.
*/
static bool simple_pattern_check(char c, const char *a, const char *b) {
bool separator = false;
if (!a && !b)
return true;
if (!a || !b)
return false;
for (;;) {
if (*a != *b)
return *a == 0 && (*b == c || separator);
if (*a == 0)
return true;
separator = *a == c;
a++, b++;
}
}
bool namespace_simple_pattern(const char *pattern, const char *value) {
return simple_pattern_check('.', pattern, value);
}
bool path_simple_pattern(const char *pattern, const char *value) {
return simple_pattern_check('/', pattern, value);
}
int bus_message_type_from_string(const char *s, uint8_t *u) {
if (streq(s, "signal"))
*u = SD_BUS_MESSAGE_SIGNAL;
else if (streq(s, "method_call"))
*u = SD_BUS_MESSAGE_METHOD_CALL;
else if (streq(s, "error"))
*u = SD_BUS_MESSAGE_METHOD_ERROR;
else if (streq(s, "method_return"))
*u = SD_BUS_MESSAGE_METHOD_RETURN;
else
return -EINVAL;
return 0;
}
const char *bus_message_type_to_string(uint8_t u) {
if (u == SD_BUS_MESSAGE_SIGNAL)
return "signal";
else if (u == SD_BUS_MESSAGE_METHOD_CALL)
return "method_call";
else if (u == SD_BUS_MESSAGE_METHOD_ERROR)
return "error";
else if (u == SD_BUS_MESSAGE_METHOD_RETURN)
return "method_return";
else
return NULL;
}
char *bus_address_escape(const char *v) {
const char *a;
char *r, *b;
r = new(char, strlen(v)*3+1);
if (!r)
return NULL;
for (a = v, b = r; *a; a++) {
if ((*a >= '0' && *a <= '9') ||
(*a >= 'a' && *a <= 'z') ||
(*a >= 'A' && *a <= 'Z') ||
strchr("_-/.", *a))
*(b++) = *a;
else {
*(b++) = '%';
*(b++) = hexchar(*a >> 4);
*(b++) = hexchar(*a & 0xF);
}
}
*b = 0;
return r;
}
int bus_maybe_reply_error(sd_bus_message *m, int r, sd_bus_error *error) {
assert(m);
if (r < 0) {
if (m->header->type == SD_BUS_MESSAGE_METHOD_CALL)
sd_bus_reply_method_errno(m, r, error);
} else if (sd_bus_error_is_set(error)) {
if (m->header->type == SD_BUS_MESSAGE_METHOD_CALL)
sd_bus_reply_method_error(m, error);
} else
return r;
log_debug("Failed to process message type=%s sender=%s destination=%s path=%s interface=%s member=%s cookie=%" PRIu64 " reply_cookie=%" PRIu64 " signature=%s error-name=%s error-message=%s: %s",
bus_message_type_to_string(m->header->type),
strna(sd_bus_message_get_sender(m)),
strna(sd_bus_message_get_destination(m)),
strna(sd_bus_message_get_path(m)),
strna(sd_bus_message_get_interface(m)),
strna(sd_bus_message_get_member(m)),
BUS_MESSAGE_COOKIE(m),
m->reply_cookie,
strna(m->root_container.signature),
strna(m->error.name),
strna(m->error.message),
bus_error_message(error, r));
return 1;
}
|
