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 "log.h"
  23 #include "macro.h"
  24
  25 #include "bus-match.h"
  26 #include "bus-message.h"
  27 #include "bus-util.h"
  28 #include "bus-slot.h"
  29
  30 static bool mask[32];
  31
  32 static int filter(sd_bus_message *m, void *userdata, sd_bus_error *ret_error) {
  33         log_info("Ran %u", PTR_TO_UINT(userdata));
  34         assert_se(PTR_TO_UINT(userdata) < ELEMENTSOF(mask));
  35         mask[PTR_TO_UINT(userdata)] = true;
  36         return 0;
  37 }
  38
  39 static bool mask_contains(unsigned a[], unsigned n) {
  40         unsigned i, j;
  41
  42         for (i = 0; i < ELEMENTSOF(mask); i++) {
  43                 bool found = false;
  44
  45                 for (j = 0; j < n; j++)
  46                         if (a[j] == i) {
  47                                 found = true;
  48                                 break;
  49                         }
  50
  51                 if (found != mask[i])
  52                         return false;
  53         }
  54
  55         return true;
  56 }
  57
  58 static int match_add(sd_bus_slot *slots, struct bus_match_node *root, const char *match, int value) {
  59         struct bus_match_component *components = NULL;
  60         unsigned n_components = 0;
  61         sd_bus_slot *s;
  62         int r;
  63
  64         s = slots + value;
  65         zero(*s);
  66
  67         r = bus_match_parse(match, &components, &n_components);
  68         if (r < 0)
  69                 return r;
  70
  71         s->userdata = INT_TO_PTR(value);
  72         s->match_callback.callback = filter;
  73
  74         r = bus_match_add(root, components, n_components, &s->match_callback);
  75         bus_match_parse_free(components, n_components);
  76
  77         return r;
  78 }
  79
  80 int main(int argc, char *argv[]) {
  81         struct bus_match_node root = {
  82                 .type = BUS_MATCH_ROOT,
  83         };
  84
  85         _cleanup_bus_message_unref_ sd_bus_message *m = NULL;
  86         _cleanup_bus_close_unref_ sd_bus *bus = NULL;
  87         enum bus_match_node_type i;
  88         sd_bus_slot slots[19];
  89         int r;
  90
  91         r = sd_bus_open_system(&bus);
  92         if (r < 0)
  93                 return EXIT_TEST_SKIP;
  94
  95         assert_se(match_add(slots, &root, "arg2='wal\\'do',sender='foo',type='signal',interface='bar.x',", 1) >= 0);
  96         assert_se(match_add(slots, &root, "arg2='wal\\'do2',sender='foo',type='signal',interface='bar.x',", 2) >= 0);
  97         assert_se(match_add(slots, &root, "arg3='test',sender='foo',type='signal',interface='bar.x',", 3) >= 0);
  98         assert_se(match_add(slots, &root, "arg3='test',sender='foo',type='method_call',interface='bar.x',", 4) >= 0);
  99         assert_se(match_add(slots, &root, "", 5) >= 0);
 100         assert_se(match_add(slots, &root, "interface='quux.x'", 6) >= 0);
 101         assert_se(match_add(slots, &root, "interface='bar.x'", 7) >= 0);
 102         assert_se(match_add(slots, &root, "member='waldo',path='/foo/bar'", 8) >= 0);
 103         assert_se(match_add(slots, &root, "path='/foo/bar'", 9) >= 0);
 104         assert_se(match_add(slots, &root, "path_namespace='/foo'", 10) >= 0);
 105         assert_se(match_add(slots, &root, "path_namespace='/foo/quux'", 11) >= 0);
 106         assert_se(match_add(slots, &root, "arg1='two'", 12) >= 0);
 107         assert_se(match_add(slots, &root, "member='waldo',arg2path='/prefix/'", 13) >= 0);
 108         assert_se(match_add(slots, &root, "member=waldo,path='/foo/bar',arg3namespace='prefix'", 14) >= 0);
 109         assert_se(match_add(slots, &root, "arg4='pi'", 15) >= 0);
 110         assert_se(match_add(slots, &root, "arg4='pa'", 16) >= 0);
 111         assert_se(match_add(slots, &root, "arg4='po'", 17) >= 0);
 112         assert_se(match_add(slots, &root, "arg4='pu'", 18) >= 0);
 113
 114         bus_match_dump(&root, 0);
 115
 116         assert_se(sd_bus_message_new_signal(bus, &m, "/foo/bar", "bar.x", "waldo") >= 0);
 117         assert_se(sd_bus_message_append(m, "ssssas", "one", "two", "/prefix/three", "prefix.four", 3, "pi", "pa", "po") >= 0);
 118         assert_se(bus_message_seal(m, 1, 0) >= 0);
 119
 120         zero(mask);
 121         assert_se(bus_match_run(NULL, &root, m) == 0);
 122         assert_se(mask_contains((unsigned[]) { 9, 8, 7, 5, 10, 12, 13, 14, 15, 16, 17 }, 11));
 123
 124         assert_se(bus_match_remove(&root, &slots[8].match_callback) >= 0);
 125         assert_se(bus_match_remove(&root, &slots[13].match_callback) >= 0);
 126
 127         bus_match_dump(&root, 0);
 128
 129         zero(mask);
 130         assert_se(bus_match_run(NULL, &root, m) == 0);
 131         assert_se(mask_contains((unsigned[]) { 9, 5, 10, 12, 14, 7, 15, 16, 17 }, 9));
 132
 133         for (i = 0; i < _BUS_MATCH_NODE_TYPE_MAX; i++) {
 134                 char buf[32];
 135                 const char *x;
 136
 137                 assert_se(x = bus_match_node_type_to_string(i, buf, sizeof(buf)));
 138
 139                 if (i >= BUS_MATCH_MESSAGE_TYPE)
 140                         assert_se(bus_match_node_type_from_string(x, strlen(x)) == i);
 141         }
 142
 143         bus_match_free(&root);
 144
 145         return 0;
 146 }