]> git.ipfire.org Git - thirdparty/systemd.git/blob - src/libsystemd/sd-bus/test-bus-match.c
sd-bus: don't allow creating message objects that are not attached to a bus
[thirdparty/systemd.git] / src / libsystemd / sd-bus / test-bus-match.c
1 /*-*- Mode: C; c-basic-offset: 8; indent-tabs-mode: nil -*-*/
2
3 /***
4 This file is part of systemd.
5
6 Copyright 2013 Lennart Poettering
7
8 systemd is free software; you can redistribute it and/or modify it
9 under the terms of the GNU Lesser General Public License as published by
10 the Free Software Foundation; either version 2.1 of the License, or
11 (at your option) any later version.
12
13 systemd is distributed in the hope that it will be useful, but
14 WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 Lesser General Public License for more details.
17
18 You should have received a copy of the GNU Lesser General Public License
19 along with systemd; If not, see <http://www.gnu.org/licenses/>.
20 ***/
21
22 #include <assert.h>
23
24 #include "log.h"
25 #include "util.h"
26 #include "macro.h"
27
28 #include "bus-match.h"
29 #include "bus-message.h"
30 #include "bus-util.h"
31 #include "bus-slot.h"
32
33 static bool mask[32];
34
35 static int filter(sd_bus *b, sd_bus_message *m, void *userdata, sd_bus_error *ret_error) {
36 log_info("Ran %i", PTR_TO_INT(userdata));
37 mask[PTR_TO_INT(userdata)] = true;
38 return 0;
39 }
40
41 static bool mask_contains(unsigned a[], unsigned n) {
42 unsigned i, j;
43
44 for (i = 0; i < ELEMENTSOF(mask); i++) {
45 bool found = false;
46
47 for (j = 0; j < n; j++)
48 if (a[j] == i) {
49 found = true;
50 break;
51 }
52
53 if (found != mask[i])
54 return false;
55 }
56
57 return true;
58 }
59
60 static int match_add(sd_bus_slot *slots, struct bus_match_node *root, const char *match, int value) {
61 struct bus_match_component *components = NULL;
62 unsigned n_components = 0;
63 sd_bus_slot *s;
64 int r;
65
66 s = slots + value;
67 zero(*s);
68
69 r = bus_match_parse(match, &components, &n_components);
70 if (r < 0)
71 return r;
72
73 s->userdata = INT_TO_PTR(value);
74 s->match_callback.callback = filter;
75
76 r = bus_match_add(root, components, n_components, &s->match_callback);
77 bus_match_parse_free(components, n_components);
78
79 return r;
80 }
81
82 int main(int argc, char *argv[]) {
83 struct bus_match_node root = {
84 .type = BUS_MATCH_ROOT,
85 };
86
87 _cleanup_bus_message_unref_ sd_bus_message *m = NULL;
88 _cleanup_bus_unref_ sd_bus *bus = NULL;
89 enum bus_match_node_type i;
90 sd_bus_slot slots[15];
91 int r;
92
93 r = sd_bus_open_system(&bus);
94 if (r < 0)
95 return EXIT_TEST_SKIP;
96
97 assert_se(match_add(slots, &root, "arg2='wal\\'do',sender='foo',type='signal',interface='bar.x',", 1) >= 0);
98 assert_se(match_add(slots, &root, "arg2='wal\\'do2',sender='foo',type='signal',interface='bar.x',", 2) >= 0);
99 assert_se(match_add(slots, &root, "arg3='test',sender='foo',type='signal',interface='bar.x',", 3) >= 0);
100 assert_se(match_add(slots, &root, "arg3='test',sender='foo',type='method_call',interface='bar.x',", 4) >= 0);
101 assert_se(match_add(slots, &root, "", 5) >= 0);
102 assert_se(match_add(slots, &root, "interface='quux.x'", 6) >= 0);
103 assert_se(match_add(slots, &root, "interface='bar.x'", 7) >= 0);
104 assert_se(match_add(slots, &root, "member='waldo',path='/foo/bar'", 8) >= 0);
105 assert_se(match_add(slots, &root, "path='/foo/bar'", 9) >= 0);
106 assert_se(match_add(slots, &root, "path_namespace='/foo'", 10) >= 0);
107 assert_se(match_add(slots, &root, "path_namespace='/foo/quux'", 11) >= 0);
108 assert_se(match_add(slots, &root, "arg1='two'", 12) >= 0);
109 assert_se(match_add(slots, &root, "member='waldo',arg2path='/prefix/'", 13) >= 0);
110 assert_se(match_add(slots, &root, "member=waldo,path='/foo/bar',arg3namespace='prefix'", 14) >= 0);
111
112 bus_match_dump(&root, 0);
113
114 assert_se(sd_bus_message_new_signal(bus, &m, "/foo/bar", "bar.x", "waldo") >= 0);
115 assert_se(sd_bus_message_append(m, "ssss", "one", "two", "/prefix/three", "prefix.four") >= 0);
116 assert_se(bus_message_seal(m, 1, 0) >= 0);
117
118 zero(mask);
119 assert_se(bus_match_run(NULL, &root, m) == 0);
120 assert_se(mask_contains((unsigned[]) { 9, 8, 7, 5, 10, 12, 13, 14 }, 8));
121
122 assert_se(bus_match_remove(&root, &slots[8].match_callback) >= 0);
123 assert_se(bus_match_remove(&root, &slots[13].match_callback) >= 0);
124
125 bus_match_dump(&root, 0);
126
127 zero(mask);
128 assert_se(bus_match_run(NULL, &root, m) == 0);
129 assert_se(mask_contains((unsigned[]) { 9, 5, 10, 12, 14, 7 }, 6));
130
131 for (i = 0; i < _BUS_MATCH_NODE_TYPE_MAX; i++) {
132 char buf[32];
133 const char *x;
134
135 assert_se(x = bus_match_node_type_to_string(i, buf, sizeof(buf)));
136
137 if (i >= BUS_MATCH_MESSAGE_TYPE)
138 assert_se(bus_match_node_type_from_string(x, strlen(x)) == i);
139 }
140
141 bus_match_free(&root);
142
143 return 0;
144 }