1 /* -*- mode: C; c-file-style: "gnu" -*- */
2 /* dbus-object-tree.c DBusObjectTree (internals of DBusConnection)
4 * Copyright (C) 2003 Red Hat Inc.
6 * Licensed under the Academic Free License version 2.0
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or
11 * (at your option) any later version.
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software
20 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
23 #include "dbus-object-tree.h"
24 #include "dbus-connection-internal.h"
25 #include "dbus-internals.h"
26 #include "dbus-hash.h"
27 #include "dbus-protocol.h"
28 #include "dbus-string.h"
33 * @defgroup DBusObjectTree A hierarchy of objects with container-contained relationship
34 * @ingroup DBusInternals
35 * @brief DBusObjectTree is used by DBusConnection to track the object tree
37 * Types and functions related to DBusObjectTree. These
38 * are all library-internal.
43 /** Subnode of the object hierarchy */
44 typedef struct DBusObjectSubtree DBusObjectSubtree;
46 static DBusObjectSubtree* _dbus_object_subtree_new (const char *name,
47 const DBusObjectPathVTable *vtable,
49 static DBusObjectSubtree* _dbus_object_subtree_ref (DBusObjectSubtree *subtree);
50 static void _dbus_object_subtree_unref (DBusObjectSubtree *subtree);
53 * Internals of DBusObjectTree
57 int refcount; /**< Reference count */
58 DBusConnection *connection; /**< Connection this tree belongs to */
60 DBusObjectSubtree *root; /**< Root of the tree ("/" node) */
64 * Struct representing a single registered subtree handler, or node
65 * that's a parent of a registered subtree handler. If
66 * message_function != NULL there's actually a handler at this node.
68 struct DBusObjectSubtree
70 DBusAtomic refcount; /**< Reference count */
71 DBusObjectSubtree *parent; /**< Parent node */
72 DBusObjectPathUnregisterFunction unregister_function; /**< Function to call on unregister */
73 DBusObjectPathMessageFunction message_function; /**< Function to handle messages */
74 void *user_data; /**< Data for functions */
75 DBusObjectSubtree **subtrees; /**< Child nodes */
76 int n_subtrees; /**< Number of child nodes */
77 unsigned int subtrees_sorted : 1; /**< Whether children are sorted */
78 unsigned int invoke_as_fallback : 1; /**< Whether to invoke message_function when child nodes don't handle the message */
79 char name[1]; /**< Allocated as large as necessary */
83 * Creates a new object tree, representing a mapping from paths
86 * @param connection the connection this tree belongs to
87 * @returns the new tree or #NULL if no memory
90 _dbus_object_tree_new (DBusConnection *connection)
94 /* the connection passed in here isn't fully constructed,
95 * so don't do anything more than store a pointer to
99 tree = dbus_new0 (DBusObjectTree, 1);
104 tree->connection = connection;
105 tree->root = _dbus_object_subtree_new ("/", NULL, NULL);
106 if (tree->root == NULL)
108 tree->root->invoke_as_fallback = TRUE;
122 * Increment the reference count
123 * @param tree the object tree
124 * @returns the object tree
127 _dbus_object_tree_ref (DBusObjectTree *tree)
129 _dbus_assert (tree->refcount > 0);
137 * Decrement the reference count
138 * @param tree the object tree
141 _dbus_object_tree_unref (DBusObjectTree *tree)
143 _dbus_assert (tree->refcount > 0);
147 if (tree->refcount == 0)
149 _dbus_object_tree_free_all_unlocked (tree);
156 subtree_cmp (DBusObjectSubtree *subtree_a,
157 DBusObjectSubtree *subtree_b)
159 return strcmp (subtree_a->name, subtree_b->name);
163 subtree_qsort_cmp (const void *a,
166 DBusObjectSubtree **subtree_a_p = (void*) a;
167 DBusObjectSubtree **subtree_b_p = (void*) b;
169 return subtree_cmp (*subtree_a_p, *subtree_b_p);
173 ensure_sorted (DBusObjectSubtree *subtree)
175 if (subtree->subtrees && !subtree->subtrees_sorted)
177 qsort (subtree->subtrees,
179 sizeof (DBusObjectSubtree*),
181 subtree->subtrees_sorted = TRUE;
185 /** Set to 1 to get a bunch of debug spew about finding the
188 #define VERBOSE_FIND 0
190 static DBusObjectSubtree*
191 find_subtree_recurse (DBusObjectSubtree *subtree,
193 dbus_bool_t create_if_not_found,
194 int *index_in_parent,
195 dbus_bool_t *exact_match)
198 dbus_bool_t return_deepest_match;
200 return_deepest_match = exact_match != NULL;
202 _dbus_assert (!(return_deepest_match && create_if_not_found));
207 _dbus_verbose (" path exhausted, returning %s\n",
210 if (exact_match != NULL)
216 _dbus_verbose (" searching children of %s for %s\n",
217 subtree->name, path[0]);
220 ensure_sorted (subtree);
222 /* FIXME we should do a binary search here instead
227 while (i < subtree->n_subtrees)
231 v = strcmp (path[0], subtree->subtrees[i]->name);
234 _dbus_verbose (" %s cmp %s = %d\n",
235 path[0], subtree->subtrees[i]->name,
244 _dbus_verbose (" storing parent index %d\n", i);
246 *index_in_parent = i;
249 if (return_deepest_match)
251 DBusObjectSubtree *next;
253 next = find_subtree_recurse (subtree->subtrees[i],
254 &path[1], create_if_not_found,
255 index_in_parent, exact_match);
257 subtree->invoke_as_fallback)
260 _dbus_verbose (" no deeper match found, returning %s\n",
263 if (exact_match != NULL)
264 *exact_match = FALSE;
271 return find_subtree_recurse (subtree->subtrees[i],
272 &path[1], create_if_not_found,
273 index_in_parent, exact_match);
285 _dbus_verbose (" no match found, current tree %s, create_if_not_found = %d\n",
286 subtree->name, create_if_not_found);
289 if (create_if_not_found)
291 DBusObjectSubtree* child;
292 DBusObjectSubtree **new_subtrees;
296 _dbus_verbose (" creating subtree %s\n",
300 child = _dbus_object_subtree_new (path[0],
305 /* FIXME we should do the "double alloc each time" standard thing */
306 new_n_subtrees = subtree->n_subtrees + 1;
307 new_subtrees = dbus_realloc (subtree->subtrees,
308 new_n_subtrees * sizeof (DBusObjectSubtree*));
309 if (new_subtrees == NULL)
311 child->unregister_function = NULL;
312 child->message_function = NULL;
313 _dbus_object_subtree_unref (child);
317 new_subtrees[subtree->n_subtrees] = child;
319 *index_in_parent = subtree->n_subtrees;
320 subtree->subtrees_sorted = FALSE;
321 subtree->n_subtrees = new_n_subtrees;
322 subtree->subtrees = new_subtrees;
324 child->parent = subtree;
326 return find_subtree_recurse (child,
327 &path[1], create_if_not_found,
328 index_in_parent, exact_match);
332 if (exact_match != NULL)
333 *exact_match = FALSE;
334 return (return_deepest_match && subtree->invoke_as_fallback) ? subtree : NULL;
338 static DBusObjectSubtree*
339 find_subtree (DBusObjectTree *tree,
341 int *index_in_parent)
343 DBusObjectSubtree *subtree;
346 _dbus_verbose ("Looking for exact registered subtree\n");
349 subtree = find_subtree_recurse (tree->root, path, FALSE, index_in_parent, NULL);
351 if (subtree && subtree->message_function == NULL)
357 static DBusObjectSubtree*
358 lookup_subtree (DBusObjectTree *tree,
362 _dbus_verbose ("Looking for subtree\n");
364 return find_subtree_recurse (tree->root, path, FALSE, NULL, NULL);
367 static DBusObjectSubtree*
368 find_handler (DBusObjectTree *tree,
370 dbus_bool_t *exact_match)
373 _dbus_verbose ("Looking for deepest handler\n");
375 _dbus_assert (exact_match != NULL);
376 return find_subtree_recurse (tree->root, path, FALSE, NULL, exact_match);
379 static DBusObjectSubtree*
380 ensure_subtree (DBusObjectTree *tree,
384 _dbus_verbose ("Ensuring subtree\n");
386 return find_subtree_recurse (tree->root, path, TRUE, NULL, NULL);
390 * Registers a new subtree in the global object tree.
392 * @param tree the global object tree
393 * @param fallback #TRUE to handle messages to children of this path
394 * @param path NULL-terminated array of path elements giving path to subtree
395 * @param vtable the vtable used to traverse this subtree
396 * @param user_data user data to pass to methods in the vtable
397 * @returns #FALSE if not enough memory
400 _dbus_object_tree_register (DBusObjectTree *tree,
401 dbus_bool_t fallback,
403 const DBusObjectPathVTable *vtable,
406 DBusObjectSubtree *subtree;
408 _dbus_assert (tree != NULL);
409 _dbus_assert (vtable->message_function != NULL);
410 _dbus_assert (path != NULL);
412 subtree = ensure_subtree (tree, path);
416 #ifndef DBUS_DISABLE_CHECKS
417 if (subtree->message_function != NULL)
419 _dbus_warn ("A handler is already registered for the path starting with path[0] = \"%s\"\n",
420 path[0] ? path[0] : "null");
424 _dbus_assert (subtree->message_function == NULL);
427 subtree->message_function = vtable->message_function;
428 subtree->unregister_function = vtable->unregister_function;
429 subtree->user_data = user_data;
430 subtree->invoke_as_fallback = fallback != FALSE;
436 * Unregisters an object subtree that was registered with the
439 * @param tree the global object tree
440 * @param path path to the subtree (same as the one passed to _dbus_object_tree_register())
443 _dbus_object_tree_unregister_and_unlock (DBusObjectTree *tree,
447 DBusObjectSubtree *subtree;
448 DBusObjectPathUnregisterFunction unregister_function;
450 DBusConnection *connection;
452 _dbus_assert (path != NULL);
454 subtree = find_subtree (tree, path, &i);
456 #ifndef DBUS_DISABLE_CHECKS
459 _dbus_warn ("Attempted to unregister path (path[0] = %s path[1] = %s) which isn't registered\n",
460 path[0] ? path[0] : "null",
461 path[1] ? path[1] : "null");
465 _dbus_assert (subtree != NULL);
468 _dbus_assert (subtree->parent == NULL ||
469 (i >= 0 && subtree->parent->subtrees[i] == subtree));
471 subtree->message_function = NULL;
473 unregister_function = subtree->unregister_function;
474 user_data = subtree->user_data;
476 subtree->unregister_function = NULL;
477 subtree->user_data = NULL;
479 /* If we have no subtrees of our own, remove from
480 * our parent (FIXME could also be more aggressive
481 * and remove our parent if it becomes empty)
483 if (subtree->parent && subtree->n_subtrees == 0)
485 /* assumes a 0-byte memmove is OK */
486 memmove (&subtree->parent->subtrees[i],
487 &subtree->parent->subtrees[i+1],
488 (subtree->parent->n_subtrees - i - 1) *
489 sizeof (subtree->parent->subtrees[0]));
490 subtree->parent->n_subtrees -= 1;
492 subtree->parent = NULL;
494 _dbus_object_subtree_unref (subtree);
498 connection = tree->connection;
500 /* Unlock and call application code */
501 #ifdef DBUS_BUILD_TESTS
505 _dbus_connection_ref_unlocked (connection);
506 _dbus_connection_unlock (connection);
509 if (unregister_function)
510 (* unregister_function) (connection, user_data);
512 #ifdef DBUS_BUILD_TESTS
515 dbus_connection_unref (connection);
519 free_subtree_recurse (DBusConnection *connection,
520 DBusObjectSubtree *subtree)
522 /* Delete them from the end, for slightly
523 * more robustness against odd reentrancy.
525 while (subtree->n_subtrees > 0)
527 DBusObjectSubtree *child;
529 child = subtree->subtrees[subtree->n_subtrees - 1];
530 subtree->subtrees[subtree->n_subtrees - 1] = NULL;
531 subtree->n_subtrees -= 1;
532 child->parent = NULL;
534 free_subtree_recurse (connection, child);
537 /* Call application code */
538 if (subtree->unregister_function)
540 (* subtree->unregister_function) (connection,
542 subtree->message_function = NULL;
543 subtree->unregister_function = NULL;
544 subtree->user_data = NULL;
547 /* Now free ourselves */
548 _dbus_object_subtree_unref (subtree);
552 * Free all the handlers in the tree. Lock on tree's connection
555 * @param tree the object tree
558 _dbus_object_tree_free_all_unlocked (DBusObjectTree *tree)
561 free_subtree_recurse (tree->connection,
567 _dbus_object_tree_list_registered_unlocked (DBusObjectTree *tree,
568 const char **parent_path,
569 char ***child_entries)
571 DBusObjectSubtree *subtree;
574 _dbus_assert (parent_path != NULL);
575 _dbus_assert (child_entries != NULL);
577 *child_entries = NULL;
579 subtree = lookup_subtree (tree, parent_path);
582 retval = dbus_new0 (char *, 1);
587 retval = dbus_new0 (char*, subtree->n_subtrees + 1);
591 while (i < subtree->n_subtrees)
593 retval[i] = _dbus_strdup (subtree->subtrees[i]->name);
594 if (retval[i] == NULL)
596 dbus_free_string_array (retval);
606 *child_entries = retval;
607 return retval != NULL;
610 static DBusHandlerResult
611 handle_default_introspect_unlocked (DBusObjectTree *tree,
612 DBusMessage *message,
616 DBusHandlerResult result;
620 if (!dbus_message_is_method_call (message,
621 DBUS_INTERFACE_ORG_FREEDESKTOP_INTROSPECTABLE,
623 return DBUS_HANDLER_RESULT_NOT_YET_HANDLED;
625 if (!_dbus_string_init (&xml))
626 return DBUS_HANDLER_RESULT_NEED_MEMORY;
628 result = DBUS_HANDLER_RESULT_NEED_MEMORY;
631 if (!_dbus_object_tree_list_registered_unlocked (tree, path, &children))
634 if (!_dbus_string_append (&xml, "<node>\n"))
638 while (children[i] != NULL)
640 if (!_dbus_string_append_printf (&xml, " <node name=\"%s\"/>\n",
647 if (!_dbus_string_append (&xml, "</node>\n"))
650 result = DBUS_HANDLER_RESULT_HANDLED;
653 _dbus_string_free (&xml);
654 dbus_free_string_array (children);
660 * Tries to dispatch a message by directing it to handler for the
661 * object path listed in the message header, if any. Messages are
662 * dispatched first to the registered handler that matches the largest
663 * number of path elements; that is, message to /foo/bar/baz would go
664 * to the handler for /foo/bar before the one for /foo.
666 * @todo thread problems
668 * @param tree the global object tree
669 * @param message the message to dispatch
670 * @returns whether message was handled successfully
673 _dbus_object_tree_dispatch_and_unlock (DBusObjectTree *tree,
674 DBusMessage *message)
677 dbus_bool_t exact_match;
680 DBusHandlerResult result;
681 DBusObjectSubtree *subtree;
684 _dbus_verbose ("Dispatch of message by object path\n");
688 if (!dbus_message_get_path_decomposed (message, &path))
690 #ifdef DBUS_BUILD_TESTS
691 if (tree->connection)
693 _dbus_connection_unlock (tree->connection);
695 _dbus_verbose ("No memory to get decomposed path\n");
697 return DBUS_HANDLER_RESULT_NEED_MEMORY;
702 #ifdef DBUS_BUILD_TESTS
703 if (tree->connection)
705 _dbus_connection_unlock (tree->connection);
707 _dbus_verbose ("No path field in message\n");
708 return DBUS_HANDLER_RESULT_NOT_YET_HANDLED;
711 /* Find the deepest path that covers the path in the message */
712 subtree = find_handler (tree, (const char**) path, &exact_match);
714 /* Build a list of all paths that cover the path in the message */
718 while (subtree != NULL)
720 if (subtree->message_function != NULL && (exact_match || subtree->invoke_as_fallback))
722 _dbus_object_subtree_ref (subtree);
724 /* run deepest paths first */
725 if (!_dbus_list_append (&list, subtree))
727 result = DBUS_HANDLER_RESULT_NEED_MEMORY;
728 _dbus_object_subtree_unref (subtree);
729 goto free_and_return;
734 subtree = subtree->parent;
737 _dbus_verbose ("%d handlers in the path tree for this message\n",
738 _dbus_list_get_length (&list));
740 /* Invoke each handler in the list */
742 result = DBUS_HANDLER_RESULT_NOT_YET_HANDLED;
744 link = _dbus_list_get_first_link (&list);
747 DBusList *next = _dbus_list_get_next_link (&list, link);
748 subtree = link->data;
750 /* message_function is NULL if we're unregistered
753 if (subtree->message_function)
755 DBusObjectPathMessageFunction message_function;
758 message_function = subtree->message_function;
759 user_data = subtree->user_data;
762 _dbus_verbose (" (invoking a handler)\n");
765 #ifdef DBUS_BUILD_TESTS
766 if (tree->connection)
768 _dbus_connection_unlock (tree->connection);
770 /* FIXME you could unregister the subtree in another thread
771 * before we invoke the callback, and I can't figure out a
772 * good way to solve this.
775 result = (* message_function) (tree->connection,
779 #ifdef DBUS_BUILD_TESTS
780 if (tree->connection)
782 _dbus_connection_lock (tree->connection);
784 if (result != DBUS_HANDLER_RESULT_NOT_YET_HANDLED)
785 goto free_and_return;
793 if (result == DBUS_HANDLER_RESULT_NOT_YET_HANDLED)
795 /* This hardcoded default handler does a minimal Introspect()
797 result = handle_default_introspect_unlocked (tree, message,
798 (const char**) path);
801 #ifdef DBUS_BUILD_TESTS
802 if (tree->connection)
804 _dbus_connection_unlock (tree->connection);
808 link = _dbus_list_get_first_link (&list);
809 _dbus_object_subtree_unref (link->data);
810 _dbus_list_remove_link (&list, link);
813 dbus_free_string_array (path);
819 * Allocates a subtree object.
821 * @param name name to duplicate.
822 * @returns newly-allocated subtree
824 static DBusObjectSubtree*
825 allocate_subtree_object (const char *name)
828 DBusObjectSubtree *subtree;
829 const size_t front_padding = _DBUS_STRUCT_OFFSET (DBusObjectSubtree, name);
831 _dbus_assert (name != NULL);
835 subtree = dbus_malloc (front_padding + (len + 1));
840 memcpy (subtree->name, name, len + 1);
845 static DBusObjectSubtree*
846 _dbus_object_subtree_new (const char *name,
847 const DBusObjectPathVTable *vtable,
850 DBusObjectSubtree *subtree;
852 subtree = allocate_subtree_object (name);
856 _dbus_assert (name != NULL);
858 subtree->parent = NULL;
862 subtree->message_function = vtable->message_function;
863 subtree->unregister_function = vtable->unregister_function;
867 subtree->message_function = NULL;
868 subtree->unregister_function = NULL;
871 subtree->user_data = user_data;
872 subtree->refcount.value = 1;
873 subtree->subtrees = NULL;
874 subtree->n_subtrees = 0;
875 subtree->subtrees_sorted = TRUE;
876 subtree->invoke_as_fallback = FALSE;
889 static DBusObjectSubtree *
890 _dbus_object_subtree_ref (DBusObjectSubtree *subtree)
892 _dbus_assert (subtree->refcount.value > 0);
893 _dbus_atomic_inc (&subtree->refcount);
899 _dbus_object_subtree_unref (DBusObjectSubtree *subtree)
901 _dbus_assert (subtree->refcount.value > 0);
903 if (_dbus_atomic_dec (&subtree->refcount) == 1)
905 _dbus_assert (subtree->unregister_function == NULL);
906 _dbus_assert (subtree->message_function == NULL);
908 dbus_free (subtree->subtrees);
914 * Lists the registered fallback handlers and object path handlers at
915 * the given parent_path. The returned array should be freed with
916 * dbus_free_string_array().
918 * @param tree the object tree
919 * @param parent_path the path to list the child handlers of
920 * @param child_entries returns #NULL-terminated array of children
921 * @returns #FALSE if no memory to allocate the child entries
924 _dbus_object_tree_list_registered_and_unlock (DBusObjectTree *tree,
925 const char **parent_path,
926 char ***child_entries)
930 result = _dbus_object_tree_list_registered_unlocked (tree,
934 #ifdef DBUS_BUILD_TESTS
935 if (tree->connection)
937 _dbus_connection_unlock (tree->connection);
944 #ifdef DBUS_BUILD_TESTS
945 #include "dbus-test.h"
949 flatten_path (const char **path)
955 if (!_dbus_string_init (&str))
961 if (!_dbus_string_append_byte (&str, '/'))
964 if (!_dbus_string_append (&str, path[i]))
970 if (!_dbus_string_steal_data (&str, &s))
973 _dbus_string_free (&str);
978 _dbus_string_free (&str);
990 /* Returns TRUE if container is a parent of child
993 path_contains (const char **container,
999 while (child[i] != NULL)
1003 if (container[i] == NULL)
1004 return STR_PREFIX; /* container ran out, child continues;
1005 * thus the container is a parent of the
1009 _dbus_assert (container[i] != NULL);
1010 _dbus_assert (child[i] != NULL);
1012 v = strcmp (container[i], child[i]);
1015 return STR_DIFFERENT; /* they overlap until here and then are different,
1022 /* Child ran out; if container also did, they are equal;
1023 * otherwise, the child is a parent of the container.
1025 if (container[i] == NULL)
1028 return STR_DIFFERENT;
1033 spew_subtree_recurse (DBusObjectSubtree *subtree,
1041 _dbus_verbose (" ");
1045 _dbus_verbose ("%s (%d children)\n",
1046 subtree->name, subtree->n_subtrees);
1049 while (i < subtree->n_subtrees)
1051 spew_subtree_recurse (subtree->subtrees[i], indent + 2);
1058 spew_tree (DBusObjectTree *tree)
1060 spew_subtree_recurse (tree->root, 0);
1065 * Callback data used in tests
1069 const char **path; /**< Path */
1070 dbus_bool_t handler_fallback; /**< true if the handler may be called as fallback */
1071 dbus_bool_t message_handled; /**< Gets set to true if message handler called */
1072 dbus_bool_t handler_unregistered; /**< gets set to true if handler is unregistered */
1077 test_unregister_function (DBusConnection *connection,
1080 TreeTestData *ttd = user_data;
1082 ttd->handler_unregistered = TRUE;
1085 static DBusHandlerResult
1086 test_message_function (DBusConnection *connection,
1087 DBusMessage *message,
1090 TreeTestData *ttd = user_data;
1092 ttd->message_handled = TRUE;
1094 return DBUS_HANDLER_RESULT_NOT_YET_HANDLED;
1098 do_register (DBusObjectTree *tree,
1100 dbus_bool_t fallback,
1102 TreeTestData *tree_test_data)
1104 DBusObjectPathVTable vtable = { test_unregister_function,
1105 test_message_function, NULL };
1107 tree_test_data[i].message_handled = FALSE;
1108 tree_test_data[i].handler_unregistered = FALSE;
1109 tree_test_data[i].handler_fallback = fallback;
1110 tree_test_data[i].path = path;
1112 if (!_dbus_object_tree_register (tree, fallback, path,
1114 &tree_test_data[i]))
1121 do_test_dispatch (DBusObjectTree *tree,
1124 TreeTestData *tree_test_data,
1127 DBusMessage *message;
1129 DBusHandlerResult result;
1134 flat = flatten_path (path);
1138 message = dbus_message_new_method_call (NULL,
1140 "org.freedesktop.TestInterface",
1143 if (message == NULL)
1147 while (j < n_test_data)
1149 tree_test_data[j].message_handled = FALSE;
1153 result = _dbus_object_tree_dispatch_and_unlock (tree, message);
1154 if (result == DBUS_HANDLER_RESULT_NEED_MEMORY)
1157 _dbus_assert (tree_test_data[i].message_handled);
1160 while (j < n_test_data)
1162 if (tree_test_data[j].message_handled)
1164 if (tree_test_data[j].handler_fallback)
1165 _dbus_assert (path_contains (tree_test_data[j].path,
1166 path) != STR_DIFFERENT);
1168 _dbus_assert (path_contains (tree_test_data[j].path, path) == STR_EQUAL);
1172 if (tree_test_data[j].handler_fallback)
1173 _dbus_assert (path_contains (tree_test_data[j].path,
1174 path) == STR_DIFFERENT);
1176 _dbus_assert (path_contains (tree_test_data[j].path, path) != STR_EQUAL);
1182 dbus_message_unref (message);
1188 dbus_message_unref (message);
1193 string_array_length (char **array)
1196 for (i = 0; array[i]; i++) ;
1202 object_tree_test_iteration (void *data)
1204 const char *path1[] = { "foo", NULL };
1205 const char *path2[] = { "foo", "bar", NULL };
1206 const char *path3[] = { "foo", "bar", "baz", NULL };
1207 const char *path4[] = { "foo", "bar", "boo", NULL };
1208 const char *path5[] = { "blah", NULL };
1209 const char *path6[] = { "blah", "boof", NULL };
1210 const char *path7[] = { "blah", "boof", "this", "is", "really", "long", NULL };
1211 const char *path8[] = { "childless", NULL };
1212 DBusObjectTree *tree;
1213 TreeTestData tree_test_data[8];
1215 dbus_bool_t exact_match;
1219 tree = _dbus_object_tree_new (NULL);
1223 if (!do_register (tree, path1, TRUE, 0, tree_test_data))
1226 _dbus_assert (find_subtree (tree, path1, NULL));
1227 _dbus_assert (!find_subtree (tree, path2, NULL));
1228 _dbus_assert (!find_subtree (tree, path3, NULL));
1229 _dbus_assert (!find_subtree (tree, path4, NULL));
1230 _dbus_assert (!find_subtree (tree, path5, NULL));
1231 _dbus_assert (!find_subtree (tree, path6, NULL));
1232 _dbus_assert (!find_subtree (tree, path7, NULL));
1233 _dbus_assert (!find_subtree (tree, path8, NULL));
1235 _dbus_assert (find_handler (tree, path1, &exact_match) && exact_match);
1236 _dbus_assert (find_handler (tree, path2, &exact_match) && !exact_match);
1237 _dbus_assert (find_handler (tree, path3, &exact_match) && !exact_match);
1238 _dbus_assert (find_handler (tree, path4, &exact_match) && !exact_match);
1239 _dbus_assert (find_handler (tree, path5, &exact_match) == tree->root && !exact_match);
1240 _dbus_assert (find_handler (tree, path6, &exact_match) == tree->root && !exact_match);
1241 _dbus_assert (find_handler (tree, path7, &exact_match) == tree->root && !exact_match);
1242 _dbus_assert (find_handler (tree, path8, &exact_match) == tree->root && !exact_match);
1244 if (!do_register (tree, path2, TRUE, 1, tree_test_data))
1247 _dbus_assert (find_subtree (tree, path1, NULL));
1248 _dbus_assert (find_subtree (tree, path2, NULL));
1249 _dbus_assert (!find_subtree (tree, path3, NULL));
1250 _dbus_assert (!find_subtree (tree, path4, NULL));
1251 _dbus_assert (!find_subtree (tree, path5, NULL));
1252 _dbus_assert (!find_subtree (tree, path6, NULL));
1253 _dbus_assert (!find_subtree (tree, path7, NULL));
1254 _dbus_assert (!find_subtree (tree, path8, NULL));
1256 if (!do_register (tree, path3, TRUE, 2, tree_test_data))
1259 _dbus_assert (find_subtree (tree, path1, NULL));
1260 _dbus_assert (find_subtree (tree, path2, NULL));
1261 _dbus_assert (find_subtree (tree, path3, NULL));
1262 _dbus_assert (!find_subtree (tree, path4, NULL));
1263 _dbus_assert (!find_subtree (tree, path5, NULL));
1264 _dbus_assert (!find_subtree (tree, path6, NULL));
1265 _dbus_assert (!find_subtree (tree, path7, NULL));
1266 _dbus_assert (!find_subtree (tree, path8, NULL));
1268 if (!do_register (tree, path4, TRUE, 3, tree_test_data))
1271 _dbus_assert (find_subtree (tree, path1, NULL));
1272 _dbus_assert (find_subtree (tree, path2, NULL));
1273 _dbus_assert (find_subtree (tree, path3, NULL));
1274 _dbus_assert (find_subtree (tree, path4, NULL));
1275 _dbus_assert (!find_subtree (tree, path5, NULL));
1276 _dbus_assert (!find_subtree (tree, path6, NULL));
1277 _dbus_assert (!find_subtree (tree, path7, NULL));
1278 _dbus_assert (!find_subtree (tree, path8, NULL));
1280 if (!do_register (tree, path5, TRUE, 4, tree_test_data))
1283 _dbus_assert (find_subtree (tree, path1, NULL));
1284 _dbus_assert (find_subtree (tree, path2, NULL));
1285 _dbus_assert (find_subtree (tree, path3, NULL));
1286 _dbus_assert (find_subtree (tree, path4, NULL));
1287 _dbus_assert (find_subtree (tree, path5, NULL));
1288 _dbus_assert (!find_subtree (tree, path6, NULL));
1289 _dbus_assert (!find_subtree (tree, path7, NULL));
1290 _dbus_assert (!find_subtree (tree, path8, NULL));
1292 _dbus_assert (find_handler (tree, path1, &exact_match) != tree->root && exact_match);
1293 _dbus_assert (find_handler (tree, path2, &exact_match) != tree->root && exact_match);
1294 _dbus_assert (find_handler (tree, path3, &exact_match) != tree->root && exact_match);
1295 _dbus_assert (find_handler (tree, path4, &exact_match) != tree->root && exact_match);
1296 _dbus_assert (find_handler (tree, path5, &exact_match) != tree->root && exact_match);
1297 _dbus_assert (find_handler (tree, path6, &exact_match) != tree->root && !exact_match);
1298 _dbus_assert (find_handler (tree, path7, &exact_match) != tree->root && !exact_match);
1299 _dbus_assert (find_handler (tree, path8, &exact_match) == tree->root && !exact_match);
1301 if (!do_register (tree, path6, TRUE, 5, tree_test_data))
1304 _dbus_assert (find_subtree (tree, path1, NULL));
1305 _dbus_assert (find_subtree (tree, path2, NULL));
1306 _dbus_assert (find_subtree (tree, path3, NULL));
1307 _dbus_assert (find_subtree (tree, path4, NULL));
1308 _dbus_assert (find_subtree (tree, path5, NULL));
1309 _dbus_assert (find_subtree (tree, path6, NULL));
1310 _dbus_assert (!find_subtree (tree, path7, NULL));
1311 _dbus_assert (!find_subtree (tree, path8, NULL));
1313 if (!do_register (tree, path7, TRUE, 6, tree_test_data))
1316 _dbus_assert (find_subtree (tree, path1, NULL));
1317 _dbus_assert (find_subtree (tree, path2, NULL));
1318 _dbus_assert (find_subtree (tree, path3, NULL));
1319 _dbus_assert (find_subtree (tree, path4, NULL));
1320 _dbus_assert (find_subtree (tree, path5, NULL));
1321 _dbus_assert (find_subtree (tree, path6, NULL));
1322 _dbus_assert (find_subtree (tree, path7, NULL));
1323 _dbus_assert (!find_subtree (tree, path8, NULL));
1325 if (!do_register (tree, path8, TRUE, 7, tree_test_data))
1328 _dbus_assert (find_subtree (tree, path1, NULL));
1329 _dbus_assert (find_subtree (tree, path2, NULL));
1330 _dbus_assert (find_subtree (tree, path3, NULL));
1331 _dbus_assert (find_subtree (tree, path4, NULL));
1332 _dbus_assert (find_subtree (tree, path5, NULL));
1333 _dbus_assert (find_subtree (tree, path6, NULL));
1334 _dbus_assert (find_subtree (tree, path7, NULL));
1335 _dbus_assert (find_subtree (tree, path8, NULL));
1337 _dbus_assert (find_handler (tree, path1, &exact_match) != tree->root && exact_match);
1338 _dbus_assert (find_handler (tree, path2, &exact_match) != tree->root && exact_match);
1339 _dbus_assert (find_handler (tree, path3, &exact_match) != tree->root && exact_match);
1340 _dbus_assert (find_handler (tree, path4, &exact_match) != tree->root && exact_match);
1341 _dbus_assert (find_handler (tree, path5, &exact_match) != tree->root && exact_match);
1342 _dbus_assert (find_handler (tree, path6, &exact_match) != tree->root && exact_match);
1343 _dbus_assert (find_handler (tree, path7, &exact_match) != tree->root && exact_match);
1344 _dbus_assert (find_handler (tree, path8, &exact_match) != tree->root && exact_match);
1346 /* test the list_registered function */
1349 const char *root[] = { NULL };
1350 char **child_entries;
1353 _dbus_object_tree_list_registered_unlocked (tree, path1, &child_entries);
1354 if (child_entries != NULL)
1356 nb = string_array_length (child_entries);
1357 _dbus_assert (nb == 1);
1358 dbus_free_string_array (child_entries);
1361 _dbus_object_tree_list_registered_unlocked (tree, path2, &child_entries);
1362 if (child_entries != NULL)
1364 nb = string_array_length (child_entries);
1365 _dbus_assert (nb == 2);
1366 dbus_free_string_array (child_entries);
1369 _dbus_object_tree_list_registered_unlocked (tree, path8, &child_entries);
1370 if (child_entries != NULL)
1372 nb = string_array_length (child_entries);
1373 _dbus_assert (nb == 0);
1374 dbus_free_string_array (child_entries);
1377 _dbus_object_tree_list_registered_unlocked (tree, root, &child_entries);
1378 if (child_entries != NULL)
1380 nb = string_array_length (child_entries);
1381 _dbus_assert (nb == 3);
1382 dbus_free_string_array (child_entries);
1386 /* Check that destroying tree calls unregister funcs */
1387 _dbus_object_tree_unref (tree);
1390 while (i < (int) _DBUS_N_ELEMENTS (tree_test_data))
1392 _dbus_assert (tree_test_data[i].handler_unregistered);
1393 _dbus_assert (!tree_test_data[i].message_handled);
1397 /* Now start again and try the individual unregister function */
1398 tree = _dbus_object_tree_new (NULL);
1402 if (!do_register (tree, path1, TRUE, 0, tree_test_data))
1404 if (!do_register (tree, path2, TRUE, 1, tree_test_data))
1406 if (!do_register (tree, path3, TRUE, 2, tree_test_data))
1408 if (!do_register (tree, path4, TRUE, 3, tree_test_data))
1410 if (!do_register (tree, path5, TRUE, 4, tree_test_data))
1412 if (!do_register (tree, path6, TRUE, 5, tree_test_data))
1414 if (!do_register (tree, path7, TRUE, 6, tree_test_data))
1416 if (!do_register (tree, path8, TRUE, 7, tree_test_data))
1419 _dbus_object_tree_unregister_and_unlock (tree, path1);
1421 _dbus_assert (!find_subtree (tree, path1, NULL));
1422 _dbus_assert (find_subtree (tree, path2, NULL));
1423 _dbus_assert (find_subtree (tree, path3, NULL));
1424 _dbus_assert (find_subtree (tree, path4, NULL));
1425 _dbus_assert (find_subtree (tree, path5, NULL));
1426 _dbus_assert (find_subtree (tree, path6, NULL));
1427 _dbus_assert (find_subtree (tree, path7, NULL));
1428 _dbus_assert (find_subtree (tree, path8, NULL));
1430 _dbus_object_tree_unregister_and_unlock (tree, path2);
1432 _dbus_assert (!find_subtree (tree, path1, NULL));
1433 _dbus_assert (!find_subtree (tree, path2, NULL));
1434 _dbus_assert (find_subtree (tree, path3, NULL));
1435 _dbus_assert (find_subtree (tree, path4, NULL));
1436 _dbus_assert (find_subtree (tree, path5, NULL));
1437 _dbus_assert (find_subtree (tree, path6, NULL));
1438 _dbus_assert (find_subtree (tree, path7, NULL));
1439 _dbus_assert (find_subtree (tree, path8, NULL));
1441 _dbus_object_tree_unregister_and_unlock (tree, path3);
1443 _dbus_assert (!find_subtree (tree, path1, NULL));
1444 _dbus_assert (!find_subtree (tree, path2, NULL));
1445 _dbus_assert (!find_subtree (tree, path3, NULL));
1446 _dbus_assert (find_subtree (tree, path4, NULL));
1447 _dbus_assert (find_subtree (tree, path5, NULL));
1448 _dbus_assert (find_subtree (tree, path6, NULL));
1449 _dbus_assert (find_subtree (tree, path7, NULL));
1450 _dbus_assert (find_subtree (tree, path8, NULL));
1452 _dbus_object_tree_unregister_and_unlock (tree, path4);
1454 _dbus_assert (!find_subtree (tree, path1, NULL));
1455 _dbus_assert (!find_subtree (tree, path2, NULL));
1456 _dbus_assert (!find_subtree (tree, path3, NULL));
1457 _dbus_assert (!find_subtree (tree, path4, NULL));
1458 _dbus_assert (find_subtree (tree, path5, NULL));
1459 _dbus_assert (find_subtree (tree, path6, NULL));
1460 _dbus_assert (find_subtree (tree, path7, NULL));
1461 _dbus_assert (find_subtree (tree, path8, NULL));
1463 _dbus_object_tree_unregister_and_unlock (tree, path5);
1465 _dbus_assert (!find_subtree (tree, path1, NULL));
1466 _dbus_assert (!find_subtree (tree, path2, NULL));
1467 _dbus_assert (!find_subtree (tree, path3, NULL));
1468 _dbus_assert (!find_subtree (tree, path4, NULL));
1469 _dbus_assert (!find_subtree (tree, path5, NULL));
1470 _dbus_assert (find_subtree (tree, path6, NULL));
1471 _dbus_assert (find_subtree (tree, path7, NULL));
1472 _dbus_assert (find_subtree (tree, path8, NULL));
1474 _dbus_object_tree_unregister_and_unlock (tree, path6);
1476 _dbus_assert (!find_subtree (tree, path1, NULL));
1477 _dbus_assert (!find_subtree (tree, path2, NULL));
1478 _dbus_assert (!find_subtree (tree, path3, NULL));
1479 _dbus_assert (!find_subtree (tree, path4, NULL));
1480 _dbus_assert (!find_subtree (tree, path5, NULL));
1481 _dbus_assert (!find_subtree (tree, path6, NULL));
1482 _dbus_assert (find_subtree (tree, path7, NULL));
1483 _dbus_assert (find_subtree (tree, path8, NULL));
1485 _dbus_object_tree_unregister_and_unlock (tree, path7);
1487 _dbus_assert (!find_subtree (tree, path1, NULL));
1488 _dbus_assert (!find_subtree (tree, path2, NULL));
1489 _dbus_assert (!find_subtree (tree, path3, NULL));
1490 _dbus_assert (!find_subtree (tree, path4, NULL));
1491 _dbus_assert (!find_subtree (tree, path5, NULL));
1492 _dbus_assert (!find_subtree (tree, path6, NULL));
1493 _dbus_assert (!find_subtree (tree, path7, NULL));
1494 _dbus_assert (find_subtree (tree, path8, NULL));
1496 _dbus_object_tree_unregister_and_unlock (tree, path8);
1498 _dbus_assert (!find_subtree (tree, path1, NULL));
1499 _dbus_assert (!find_subtree (tree, path2, NULL));
1500 _dbus_assert (!find_subtree (tree, path3, NULL));
1501 _dbus_assert (!find_subtree (tree, path4, NULL));
1502 _dbus_assert (!find_subtree (tree, path5, NULL));
1503 _dbus_assert (!find_subtree (tree, path6, NULL));
1504 _dbus_assert (!find_subtree (tree, path7, NULL));
1505 _dbus_assert (!find_subtree (tree, path8, NULL));
1508 while (i < (int) _DBUS_N_ELEMENTS (tree_test_data))
1510 _dbus_assert (tree_test_data[i].handler_unregistered);
1511 _dbus_assert (!tree_test_data[i].message_handled);
1515 /* Register it all again, and test dispatch */
1517 if (!do_register (tree, path1, FALSE, 0, tree_test_data))
1519 if (!do_register (tree, path2, TRUE, 1, tree_test_data))
1521 if (!do_register (tree, path3, TRUE, 2, tree_test_data))
1523 if (!do_register (tree, path4, TRUE, 3, tree_test_data))
1525 if (!do_register (tree, path5, TRUE, 4, tree_test_data))
1527 if (!do_register (tree, path6, FALSE, 5, tree_test_data))
1529 if (!do_register (tree, path7, TRUE, 6, tree_test_data))
1531 if (!do_register (tree, path8, TRUE, 7, tree_test_data))
1538 if (!do_test_dispatch (tree, path1, 0, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1540 if (!do_test_dispatch (tree, path2, 1, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1542 if (!do_test_dispatch (tree, path3, 2, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1544 if (!do_test_dispatch (tree, path4, 3, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1546 if (!do_test_dispatch (tree, path5, 4, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1548 if (!do_test_dispatch (tree, path6, 5, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1550 if (!do_test_dispatch (tree, path7, 6, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1552 if (!do_test_dispatch (tree, path8, 7, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1559 _dbus_object_tree_ref (tree);
1560 _dbus_object_tree_unref (tree);
1561 _dbus_object_tree_unref (tree);
1568 * @ingroup DBusObjectTree
1569 * Unit test for DBusObjectTree
1570 * @returns #TRUE on success.
1573 _dbus_object_tree_test (void)
1575 _dbus_test_oom_handling ("object tree",
1576 object_tree_test_iteration,
1582 #endif /* DBUS_BUILD_TESTS */