1 /* -*- mode: C; c-file-style: "gnu" -*- */
2 /* dbus-object-tree.c DBusObjectTree (internals of DBusConnection)
4 * Copyright (C) 2003, 2005 Red Hat Inc.
6 * Licensed under the Academic Free License version 2.1
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);
377 *exact_match = FALSE; /* ensure always initialized */
379 return find_subtree_recurse (tree->root, path, FALSE, NULL, exact_match);
382 static DBusObjectSubtree*
383 ensure_subtree (DBusObjectTree *tree,
387 _dbus_verbose ("Ensuring subtree\n");
389 return find_subtree_recurse (tree->root, path, TRUE, NULL, NULL);
393 * Registers a new subtree in the global object tree.
395 * @param tree the global object tree
396 * @param fallback #TRUE to handle messages to children of this path
397 * @param path NULL-terminated array of path elements giving path to subtree
398 * @param vtable the vtable used to traverse this subtree
399 * @param user_data user data to pass to methods in the vtable
400 * @returns #FALSE if not enough memory
403 _dbus_object_tree_register (DBusObjectTree *tree,
404 dbus_bool_t fallback,
406 const DBusObjectPathVTable *vtable,
409 DBusObjectSubtree *subtree;
411 _dbus_assert (tree != NULL);
412 _dbus_assert (vtable->message_function != NULL);
413 _dbus_assert (path != NULL);
415 subtree = ensure_subtree (tree, path);
419 #ifndef DBUS_DISABLE_CHECKS
420 if (subtree->message_function != NULL)
422 _dbus_warn ("A handler is already registered for the path starting with path[0] = \"%s\"\n",
423 path[0] ? path[0] : "null");
427 _dbus_assert (subtree->message_function == NULL);
430 subtree->message_function = vtable->message_function;
431 subtree->unregister_function = vtable->unregister_function;
432 subtree->user_data = user_data;
433 subtree->invoke_as_fallback = fallback != FALSE;
439 * Unregisters an object subtree that was registered with the
442 * @param tree the global object tree
443 * @param path path to the subtree (same as the one passed to _dbus_object_tree_register())
446 _dbus_object_tree_unregister_and_unlock (DBusObjectTree *tree,
450 DBusObjectSubtree *subtree;
451 DBusObjectPathUnregisterFunction unregister_function;
453 DBusConnection *connection;
455 _dbus_assert (path != NULL);
457 unregister_function = NULL;
460 subtree = find_subtree (tree, path, &i);
462 #ifndef DBUS_DISABLE_CHECKS
465 _dbus_warn ("Attempted to unregister path (path[0] = %s path[1] = %s) which isn't registered\n",
466 path[0] ? path[0] : "null",
467 path[1] ? path[1] : "null");
471 _dbus_assert (subtree != NULL);
474 _dbus_assert (subtree->parent == NULL ||
475 (i >= 0 && subtree->parent->subtrees[i] == subtree));
477 subtree->message_function = NULL;
479 unregister_function = subtree->unregister_function;
480 user_data = subtree->user_data;
482 subtree->unregister_function = NULL;
483 subtree->user_data = NULL;
485 /* If we have no subtrees of our own, remove from
486 * our parent (FIXME could also be more aggressive
487 * and remove our parent if it becomes empty)
489 if (subtree->parent && subtree->n_subtrees == 0)
491 /* assumes a 0-byte memmove is OK */
492 memmove (&subtree->parent->subtrees[i],
493 &subtree->parent->subtrees[i+1],
494 (subtree->parent->n_subtrees - i - 1) *
495 sizeof (subtree->parent->subtrees[0]));
496 subtree->parent->n_subtrees -= 1;
498 subtree->parent = NULL;
500 _dbus_object_subtree_unref (subtree);
505 connection = tree->connection;
507 /* Unlock and call application code */
508 #ifdef DBUS_BUILD_TESTS
512 _dbus_connection_ref_unlocked (connection);
513 _dbus_verbose ("unlock %s\n", _DBUS_FUNCTION_NAME);
514 _dbus_connection_unlock (connection);
517 if (unregister_function)
518 (* unregister_function) (connection, user_data);
520 #ifdef DBUS_BUILD_TESTS
523 dbus_connection_unref (connection);
527 free_subtree_recurse (DBusConnection *connection,
528 DBusObjectSubtree *subtree)
530 /* Delete them from the end, for slightly
531 * more robustness against odd reentrancy.
533 while (subtree->n_subtrees > 0)
535 DBusObjectSubtree *child;
537 child = subtree->subtrees[subtree->n_subtrees - 1];
538 subtree->subtrees[subtree->n_subtrees - 1] = NULL;
539 subtree->n_subtrees -= 1;
540 child->parent = NULL;
542 free_subtree_recurse (connection, child);
545 /* Call application code */
546 if (subtree->unregister_function)
547 (* subtree->unregister_function) (connection,
550 subtree->message_function = NULL;
551 subtree->unregister_function = NULL;
552 subtree->user_data = NULL;
554 /* Now free ourselves */
555 _dbus_object_subtree_unref (subtree);
559 * Free all the handlers in the tree. Lock on tree's connection
562 * @param tree the object tree
565 _dbus_object_tree_free_all_unlocked (DBusObjectTree *tree)
568 free_subtree_recurse (tree->connection,
574 _dbus_object_tree_list_registered_unlocked (DBusObjectTree *tree,
575 const char **parent_path,
576 char ***child_entries)
578 DBusObjectSubtree *subtree;
581 _dbus_assert (parent_path != NULL);
582 _dbus_assert (child_entries != NULL);
584 *child_entries = NULL;
586 subtree = lookup_subtree (tree, parent_path);
589 retval = dbus_new0 (char *, 1);
594 retval = dbus_new0 (char*, subtree->n_subtrees + 1);
598 while (i < subtree->n_subtrees)
600 retval[i] = _dbus_strdup (subtree->subtrees[i]->name);
601 if (retval[i] == NULL)
603 dbus_free_string_array (retval);
613 *child_entries = retval;
614 return retval != NULL;
617 static DBusHandlerResult
618 handle_default_introspect_and_unlock (DBusObjectTree *tree,
619 DBusMessage *message,
623 DBusHandlerResult result;
627 DBusMessageIter iter;
628 const char *v_STRING;
629 dbus_bool_t already_unlocked;
631 /* We have the connection lock here */
633 already_unlocked = FALSE;
635 _dbus_verbose (" considering default Introspect() handler...\n");
639 if (!dbus_message_is_method_call (message,
640 DBUS_INTERFACE_INTROSPECTABLE,
643 #ifdef DBUS_BUILD_TESTS
644 if (tree->connection)
647 _dbus_verbose ("unlock %s %d\n", _DBUS_FUNCTION_NAME, __LINE__);
648 _dbus_connection_unlock (tree->connection);
651 return DBUS_HANDLER_RESULT_NOT_YET_HANDLED;
654 _dbus_verbose (" using default Introspect() handler!\n");
656 if (!_dbus_string_init (&xml))
658 #ifdef DBUS_BUILD_TESTS
659 if (tree->connection)
662 _dbus_verbose ("unlock %s %d\n", _DBUS_FUNCTION_NAME, __LINE__);
663 _dbus_connection_unlock (tree->connection);
666 return DBUS_HANDLER_RESULT_NEED_MEMORY;
669 result = DBUS_HANDLER_RESULT_NEED_MEMORY;
672 if (!_dbus_object_tree_list_registered_unlocked (tree, path, &children))
675 if (!_dbus_string_append (&xml, DBUS_INTROSPECT_1_0_XML_DOCTYPE_DECL_NODE))
678 if (!_dbus_string_append (&xml, "<node>\n"))
682 while (children[i] != NULL)
684 if (!_dbus_string_append_printf (&xml, " <node name=\"%s\"/>\n",
691 if (!_dbus_string_append (&xml, "</node>\n"))
694 reply = dbus_message_new_method_return (message);
698 dbus_message_iter_init_append (reply, &iter);
699 v_STRING = _dbus_string_get_const_data (&xml);
700 if (!dbus_message_iter_append_basic (&iter, DBUS_TYPE_STRING, &v_STRING))
703 #ifdef DBUS_BUILD_TESTS
704 if (tree->connection)
707 already_unlocked = TRUE;
709 if (!_dbus_connection_send_and_unlock (tree->connection, reply, NULL))
713 result = DBUS_HANDLER_RESULT_HANDLED;
716 #ifdef DBUS_BUILD_TESTS
717 if (tree->connection)
720 if (!already_unlocked)
722 _dbus_verbose ("unlock %s %d\n", _DBUS_FUNCTION_NAME, __LINE__);
723 _dbus_connection_unlock (tree->connection);
727 _dbus_string_free (&xml);
728 dbus_free_string_array (children);
730 dbus_message_unref (reply);
736 * Tries to dispatch a message by directing it to handler for the
737 * object path listed in the message header, if any. Messages are
738 * dispatched first to the registered handler that matches the largest
739 * number of path elements; that is, message to /foo/bar/baz would go
740 * to the handler for /foo/bar before the one for /foo.
742 * @todo thread problems
744 * @param tree the global object tree
745 * @param message the message to dispatch
746 * @returns whether message was handled successfully
749 _dbus_object_tree_dispatch_and_unlock (DBusObjectTree *tree,
750 DBusMessage *message)
753 dbus_bool_t exact_match;
756 DBusHandlerResult result;
757 DBusObjectSubtree *subtree;
760 _dbus_verbose ("Dispatch of message by object path\n");
764 if (!dbus_message_get_path_decomposed (message, &path))
766 #ifdef DBUS_BUILD_TESTS
767 if (tree->connection)
770 _dbus_verbose ("unlock %s\n", _DBUS_FUNCTION_NAME);
771 _dbus_connection_unlock (tree->connection);
774 _dbus_verbose ("No memory to get decomposed path\n");
776 return DBUS_HANDLER_RESULT_NEED_MEMORY;
781 #ifdef DBUS_BUILD_TESTS
782 if (tree->connection)
785 _dbus_verbose ("unlock %s\n", _DBUS_FUNCTION_NAME);
786 _dbus_connection_unlock (tree->connection);
789 _dbus_verbose ("No path field in message\n");
790 return DBUS_HANDLER_RESULT_NOT_YET_HANDLED;
793 /* Find the deepest path that covers the path in the message */
794 subtree = find_handler (tree, (const char**) path, &exact_match);
796 /* Build a list of all paths that cover the path in the message */
800 while (subtree != NULL)
802 if (subtree->message_function != NULL && (exact_match || subtree->invoke_as_fallback))
804 _dbus_object_subtree_ref (subtree);
806 /* run deepest paths first */
807 if (!_dbus_list_append (&list, subtree))
809 result = DBUS_HANDLER_RESULT_NEED_MEMORY;
810 _dbus_object_subtree_unref (subtree);
811 goto free_and_return;
816 subtree = subtree->parent;
819 _dbus_verbose ("%d handlers in the path tree for this message\n",
820 _dbus_list_get_length (&list));
822 /* Invoke each handler in the list */
824 result = DBUS_HANDLER_RESULT_NOT_YET_HANDLED;
826 link = _dbus_list_get_first_link (&list);
829 DBusList *next = _dbus_list_get_next_link (&list, link);
830 subtree = link->data;
832 /* message_function is NULL if we're unregistered
835 if (subtree->message_function)
837 DBusObjectPathMessageFunction message_function;
840 message_function = subtree->message_function;
841 user_data = subtree->user_data;
844 _dbus_verbose (" (invoking a handler)\n");
847 #ifdef DBUS_BUILD_TESTS
848 if (tree->connection)
851 _dbus_verbose ("unlock %s\n", _DBUS_FUNCTION_NAME);
852 _dbus_connection_unlock (tree->connection);
855 /* FIXME you could unregister the subtree in another thread
856 * before we invoke the callback, and I can't figure out a
857 * good way to solve this.
860 result = (* message_function) (tree->connection,
864 #ifdef DBUS_BUILD_TESTS
865 if (tree->connection)
867 _dbus_connection_lock (tree->connection);
869 if (result != DBUS_HANDLER_RESULT_NOT_YET_HANDLED)
870 goto free_and_return;
878 if (result == DBUS_HANDLER_RESULT_NOT_YET_HANDLED)
880 /* This hardcoded default handler does a minimal Introspect()
882 result = handle_default_introspect_and_unlock (tree, message,
883 (const char**) path);
887 #ifdef DBUS_BUILD_TESTS
888 if (tree->connection)
891 _dbus_verbose ("unlock %s\n", _DBUS_FUNCTION_NAME);
892 _dbus_connection_unlock (tree->connection);
898 link = _dbus_list_get_first_link (&list);
899 _dbus_object_subtree_unref (link->data);
900 _dbus_list_remove_link (&list, link);
903 dbus_free_string_array (path);
909 * Looks up the data passed to _dbus_object_tree_register() for a
910 * handler at the given path.
912 * @param tree the global object tree
913 * @param path NULL-terminated array of path elements giving path to subtree
914 * @returns the object's user_data or #NULL if none found
917 _dbus_object_tree_get_user_data_unlocked (DBusObjectTree *tree,
920 dbus_bool_t exact_match;
921 DBusObjectSubtree *subtree;
923 _dbus_assert (tree != NULL);
924 _dbus_assert (path != NULL);
926 /* Find the deepest path that covers the path in the message */
927 subtree = find_handler (tree, (const char**) path, &exact_match);
929 if ((subtree == NULL) || !exact_match)
931 _dbus_verbose ("%s: No object at specified path found\n",
932 _DBUS_FUNCTION_NAME);
936 return subtree->user_data;
940 * Allocates a subtree object.
942 * @param name name to duplicate.
943 * @returns newly-allocated subtree
945 static DBusObjectSubtree*
946 allocate_subtree_object (const char *name)
949 DBusObjectSubtree *subtree;
950 const size_t front_padding = _DBUS_STRUCT_OFFSET (DBusObjectSubtree, name);
952 _dbus_assert (name != NULL);
956 subtree = dbus_malloc (front_padding + (len + 1));
961 memcpy (subtree->name, name, len + 1);
966 static DBusObjectSubtree*
967 _dbus_object_subtree_new (const char *name,
968 const DBusObjectPathVTable *vtable,
971 DBusObjectSubtree *subtree;
973 subtree = allocate_subtree_object (name);
977 _dbus_assert (name != NULL);
979 subtree->parent = NULL;
983 subtree->message_function = vtable->message_function;
984 subtree->unregister_function = vtable->unregister_function;
988 subtree->message_function = NULL;
989 subtree->unregister_function = NULL;
992 subtree->user_data = user_data;
993 subtree->refcount.value = 1;
994 subtree->subtrees = NULL;
995 subtree->n_subtrees = 0;
996 subtree->subtrees_sorted = TRUE;
997 subtree->invoke_as_fallback = FALSE;
1004 dbus_free (subtree);
1010 static DBusObjectSubtree *
1011 _dbus_object_subtree_ref (DBusObjectSubtree *subtree)
1013 _dbus_assert (subtree->refcount.value > 0);
1014 _dbus_atomic_inc (&subtree->refcount);
1020 _dbus_object_subtree_unref (DBusObjectSubtree *subtree)
1022 _dbus_assert (subtree->refcount.value > 0);
1024 if (_dbus_atomic_dec (&subtree->refcount) == 1)
1026 _dbus_assert (subtree->unregister_function == NULL);
1027 _dbus_assert (subtree->message_function == NULL);
1029 dbus_free (subtree->subtrees);
1030 dbus_free (subtree);
1035 * Lists the registered fallback handlers and object path handlers at
1036 * the given parent_path. The returned array should be freed with
1037 * dbus_free_string_array().
1039 * @param tree the object tree
1040 * @param parent_path the path to list the child handlers of
1041 * @param child_entries returns #NULL-terminated array of children
1042 * @returns #FALSE if no memory to allocate the child entries
1045 _dbus_object_tree_list_registered_and_unlock (DBusObjectTree *tree,
1046 const char **parent_path,
1047 char ***child_entries)
1051 result = _dbus_object_tree_list_registered_unlocked (tree,
1055 #ifdef DBUS_BUILD_TESTS
1056 if (tree->connection)
1059 _dbus_verbose ("unlock %s\n", _DBUS_FUNCTION_NAME);
1060 _dbus_connection_unlock (tree->connection);
1067 /** Set to 1 to get a bunch of spew about disassembling the path string */
1068 #define VERBOSE_DECOMPOSE 0
1071 * Decompose an object path. A path of just "/" is
1072 * represented as an empty vector of strings.
1073 * The path need not be nul terminated.
1075 * @param data the path data
1076 * @param len the length of the path string
1077 * @param path address to store new object path
1078 * @param path_len length of stored path
1081 _dbus_decompose_path (const char* data,
1090 _dbus_assert (data != NULL);
1092 #if VERBOSE_DECOMPOSE
1093 _dbus_verbose ("Decomposing path \"%s\"\n",
1098 if (len > 1) /* if path is not just "/" */
1109 retval = dbus_new0 (char*, n_components + 1);
1115 if (n_components == 0)
1119 while (comp < n_components)
1121 _dbus_assert (i < len);
1127 while (j < len && data[j] != '/')
1130 /* Now [i, j) is the path component */
1131 _dbus_assert (i < j);
1132 _dbus_assert (data[i] != '/');
1133 _dbus_assert (j == len || data[j] == '/');
1135 #if VERBOSE_DECOMPOSE
1136 _dbus_verbose (" (component in [%d,%d))\n",
1140 retval[comp] = _dbus_memdup (&data[i], j - i + 1);
1141 if (retval[comp] == NULL)
1143 dbus_free_string_array (retval);
1146 retval[comp][j-i] = '\0';
1147 #if VERBOSE_DECOMPOSE
1148 _dbus_verbose (" (component %d = \"%s\")\n",
1149 comp, retval[comp]);
1155 _dbus_assert (i == len);
1159 *path_len = n_components;
1166 #ifdef DBUS_BUILD_TESTS
1167 #include "dbus-test.h"
1171 flatten_path (const char **path)
1176 if (!_dbus_string_init (&str))
1179 if (path[0] == NULL)
1181 if (!_dbus_string_append_byte (&str, '/'))
1191 if (!_dbus_string_append_byte (&str, '/'))
1194 if (!_dbus_string_append (&str, path[i]))
1201 if (!_dbus_string_steal_data (&str, &s))
1204 _dbus_string_free (&str);
1209 _dbus_string_free (&str);
1221 /* Returns TRUE if container is a parent of child
1223 static StrComparison
1224 path_contains (const char **container,
1230 while (child[i] != NULL)
1234 if (container[i] == NULL)
1235 return STR_PREFIX; /* container ran out, child continues;
1236 * thus the container is a parent of the
1240 _dbus_assert (container[i] != NULL);
1241 _dbus_assert (child[i] != NULL);
1243 v = strcmp (container[i], child[i]);
1246 return STR_DIFFERENT; /* they overlap until here and then are different,
1253 /* Child ran out; if container also did, they are equal;
1254 * otherwise, the child is a parent of the container.
1256 if (container[i] == NULL)
1259 return STR_DIFFERENT;
1264 spew_subtree_recurse (DBusObjectSubtree *subtree,
1272 _dbus_verbose (" ");
1276 _dbus_verbose ("%s (%d children)\n",
1277 subtree->name, subtree->n_subtrees);
1280 while (i < subtree->n_subtrees)
1282 spew_subtree_recurse (subtree->subtrees[i], indent + 2);
1289 spew_tree (DBusObjectTree *tree)
1291 spew_subtree_recurse (tree->root, 0);
1296 * Callback data used in tests
1300 const char **path; /**< Path */
1301 dbus_bool_t handler_fallback; /**< true if the handler may be called as fallback */
1302 dbus_bool_t message_handled; /**< Gets set to true if message handler called */
1303 dbus_bool_t handler_unregistered; /**< gets set to true if handler is unregistered */
1308 test_unregister_function (DBusConnection *connection,
1311 TreeTestData *ttd = user_data;
1313 ttd->handler_unregistered = TRUE;
1316 static DBusHandlerResult
1317 test_message_function (DBusConnection *connection,
1318 DBusMessage *message,
1321 TreeTestData *ttd = user_data;
1323 ttd->message_handled = TRUE;
1325 return DBUS_HANDLER_RESULT_NOT_YET_HANDLED;
1329 do_register (DBusObjectTree *tree,
1331 dbus_bool_t fallback,
1333 TreeTestData *tree_test_data)
1335 DBusObjectPathVTable vtable = { test_unregister_function,
1336 test_message_function, NULL };
1338 tree_test_data[i].message_handled = FALSE;
1339 tree_test_data[i].handler_unregistered = FALSE;
1340 tree_test_data[i].handler_fallback = fallback;
1341 tree_test_data[i].path = path;
1343 if (!_dbus_object_tree_register (tree, fallback, path,
1345 &tree_test_data[i]))
1348 _dbus_assert (_dbus_object_tree_get_user_data_unlocked (tree, path) ==
1349 &tree_test_data[i]);
1355 do_test_dispatch (DBusObjectTree *tree,
1358 TreeTestData *tree_test_data,
1361 DBusMessage *message;
1363 DBusHandlerResult result;
1368 flat = flatten_path (path);
1372 message = dbus_message_new_method_call (NULL,
1374 "org.freedesktop.TestInterface",
1377 if (message == NULL)
1381 while (j < n_test_data)
1383 tree_test_data[j].message_handled = FALSE;
1387 result = _dbus_object_tree_dispatch_and_unlock (tree, message);
1388 if (result == DBUS_HANDLER_RESULT_NEED_MEMORY)
1391 _dbus_assert (tree_test_data[i].message_handled);
1394 while (j < n_test_data)
1396 if (tree_test_data[j].message_handled)
1398 if (tree_test_data[j].handler_fallback)
1399 _dbus_assert (path_contains (tree_test_data[j].path,
1400 path) != STR_DIFFERENT);
1402 _dbus_assert (path_contains (tree_test_data[j].path, path) == STR_EQUAL);
1406 if (tree_test_data[j].handler_fallback)
1407 _dbus_assert (path_contains (tree_test_data[j].path,
1408 path) == STR_DIFFERENT);
1410 _dbus_assert (path_contains (tree_test_data[j].path, path) != STR_EQUAL);
1416 dbus_message_unref (message);
1422 dbus_message_unref (message);
1427 string_array_length (const char **array)
1430 for (i = 0; array[i]; i++) ;
1437 const char *result[20];
1438 } DecomposePathTest;
1440 static DecomposePathTest decompose_tests[] = {
1441 { "/foo", { "foo", NULL } },
1442 { "/foo/bar", { "foo", "bar", NULL } },
1444 { "/a/b", { "a", "b", NULL } },
1445 { "/a/b/c", { "a", "b", "c", NULL } },
1446 { "/a/b/c/d", { "a", "b", "c", "d", NULL } },
1447 { "/foo/bar/q", { "foo", "bar", "q", NULL } },
1448 { "/foo/bar/this/is/longer", { "foo", "bar", "this", "is", "longer", NULL } }
1452 run_decompose_tests (void)
1457 while (i < _DBUS_N_ELEMENTS (decompose_tests))
1463 if (!_dbus_decompose_path (decompose_tests[i].path,
1464 strlen (decompose_tests[i].path),
1465 &result, &result_len))
1468 expected_len = string_array_length (decompose_tests[i].result);
1470 if (result_len != (int) string_array_length ((const char**)result) ||
1471 expected_len != result_len ||
1472 path_contains (decompose_tests[i].result,
1473 (const char**) result) != STR_EQUAL)
1475 int real_len = string_array_length ((const char**)result);
1476 _dbus_warn ("Expected decompose of %s to have len %d, returned %d, appears to have %d\n",
1477 decompose_tests[i].path, expected_len, result_len,
1479 _dbus_warn ("Decompose resulted in elements: { ");
1481 while (i < real_len)
1483 _dbus_warn ("\"%s\"%s", result[i],
1484 (i + 1) == real_len ? "" : ", ");
1488 _dbus_assert_not_reached ("path decompose failed\n");
1491 dbus_free_string_array (result);
1500 object_tree_test_iteration (void *data)
1502 const char *path0[] = { NULL };
1503 const char *path1[] = { "foo", NULL };
1504 const char *path2[] = { "foo", "bar", NULL };
1505 const char *path3[] = { "foo", "bar", "baz", NULL };
1506 const char *path4[] = { "foo", "bar", "boo", NULL };
1507 const char *path5[] = { "blah", NULL };
1508 const char *path6[] = { "blah", "boof", NULL };
1509 const char *path7[] = { "blah", "boof", "this", "is", "really", "long", NULL };
1510 const char *path8[] = { "childless", NULL };
1511 DBusObjectTree *tree;
1512 TreeTestData tree_test_data[9];
1514 dbus_bool_t exact_match;
1516 if (!run_decompose_tests ())
1521 tree = _dbus_object_tree_new (NULL);
1525 if (!do_register (tree, path0, TRUE, 0, tree_test_data))
1528 _dbus_assert (find_subtree (tree, path0, NULL));
1529 _dbus_assert (!find_subtree (tree, path1, NULL));
1530 _dbus_assert (!find_subtree (tree, path2, NULL));
1531 _dbus_assert (!find_subtree (tree, path3, NULL));
1532 _dbus_assert (!find_subtree (tree, path4, NULL));
1533 _dbus_assert (!find_subtree (tree, path5, NULL));
1534 _dbus_assert (!find_subtree (tree, path6, NULL));
1535 _dbus_assert (!find_subtree (tree, path7, NULL));
1536 _dbus_assert (!find_subtree (tree, path8, NULL));
1538 _dbus_assert (find_handler (tree, path0, &exact_match) && exact_match);
1539 _dbus_assert (find_handler (tree, path1, &exact_match) == tree->root && !exact_match);
1540 _dbus_assert (find_handler (tree, path2, &exact_match) == tree->root && !exact_match);
1541 _dbus_assert (find_handler (tree, path3, &exact_match) == tree->root && !exact_match);
1542 _dbus_assert (find_handler (tree, path4, &exact_match) == tree->root && !exact_match);
1543 _dbus_assert (find_handler (tree, path5, &exact_match) == tree->root && !exact_match);
1544 _dbus_assert (find_handler (tree, path6, &exact_match) == tree->root && !exact_match);
1545 _dbus_assert (find_handler (tree, path7, &exact_match) == tree->root && !exact_match);
1546 _dbus_assert (find_handler (tree, path8, &exact_match) == tree->root && !exact_match);
1548 if (!do_register (tree, path1, TRUE, 1, tree_test_data))
1551 _dbus_assert (find_subtree (tree, path0, NULL));
1552 _dbus_assert (find_subtree (tree, path1, NULL));
1553 _dbus_assert (!find_subtree (tree, path2, NULL));
1554 _dbus_assert (!find_subtree (tree, path3, NULL));
1555 _dbus_assert (!find_subtree (tree, path4, NULL));
1556 _dbus_assert (!find_subtree (tree, path5, NULL));
1557 _dbus_assert (!find_subtree (tree, path6, NULL));
1558 _dbus_assert (!find_subtree (tree, path7, NULL));
1559 _dbus_assert (!find_subtree (tree, path8, NULL));
1561 _dbus_assert (find_handler (tree, path0, &exact_match) && exact_match);
1562 _dbus_assert (find_handler (tree, path1, &exact_match) && exact_match);
1563 _dbus_assert (find_handler (tree, path2, &exact_match) && !exact_match);
1564 _dbus_assert (find_handler (tree, path3, &exact_match) && !exact_match);
1565 _dbus_assert (find_handler (tree, path4, &exact_match) && !exact_match);
1566 _dbus_assert (find_handler (tree, path5, &exact_match) == tree->root && !exact_match);
1567 _dbus_assert (find_handler (tree, path6, &exact_match) == tree->root && !exact_match);
1568 _dbus_assert (find_handler (tree, path7, &exact_match) == tree->root && !exact_match);
1569 _dbus_assert (find_handler (tree, path8, &exact_match) == tree->root && !exact_match);
1571 if (!do_register (tree, path2, TRUE, 2, tree_test_data))
1574 _dbus_assert (find_subtree (tree, path1, NULL));
1575 _dbus_assert (find_subtree (tree, path2, NULL));
1576 _dbus_assert (!find_subtree (tree, path3, NULL));
1577 _dbus_assert (!find_subtree (tree, path4, NULL));
1578 _dbus_assert (!find_subtree (tree, path5, NULL));
1579 _dbus_assert (!find_subtree (tree, path6, NULL));
1580 _dbus_assert (!find_subtree (tree, path7, NULL));
1581 _dbus_assert (!find_subtree (tree, path8, NULL));
1583 if (!do_register (tree, path3, TRUE, 3, tree_test_data))
1586 _dbus_assert (find_subtree (tree, path0, NULL));
1587 _dbus_assert (find_subtree (tree, path1, NULL));
1588 _dbus_assert (find_subtree (tree, path2, NULL));
1589 _dbus_assert (find_subtree (tree, path3, NULL));
1590 _dbus_assert (!find_subtree (tree, path4, NULL));
1591 _dbus_assert (!find_subtree (tree, path5, NULL));
1592 _dbus_assert (!find_subtree (tree, path6, NULL));
1593 _dbus_assert (!find_subtree (tree, path7, NULL));
1594 _dbus_assert (!find_subtree (tree, path8, NULL));
1596 if (!do_register (tree, path4, TRUE, 4, tree_test_data))
1599 _dbus_assert (find_subtree (tree, path0, NULL));
1600 _dbus_assert (find_subtree (tree, path1, NULL));
1601 _dbus_assert (find_subtree (tree, path2, NULL));
1602 _dbus_assert (find_subtree (tree, path3, NULL));
1603 _dbus_assert (find_subtree (tree, path4, NULL));
1604 _dbus_assert (!find_subtree (tree, path5, NULL));
1605 _dbus_assert (!find_subtree (tree, path6, NULL));
1606 _dbus_assert (!find_subtree (tree, path7, NULL));
1607 _dbus_assert (!find_subtree (tree, path8, NULL));
1609 if (!do_register (tree, path5, TRUE, 5, tree_test_data))
1612 _dbus_assert (find_subtree (tree, path0, NULL));
1613 _dbus_assert (find_subtree (tree, path1, NULL));
1614 _dbus_assert (find_subtree (tree, path2, NULL));
1615 _dbus_assert (find_subtree (tree, path3, NULL));
1616 _dbus_assert (find_subtree (tree, path4, NULL));
1617 _dbus_assert (find_subtree (tree, path5, NULL));
1618 _dbus_assert (!find_subtree (tree, path6, NULL));
1619 _dbus_assert (!find_subtree (tree, path7, NULL));
1620 _dbus_assert (!find_subtree (tree, path8, NULL));
1622 _dbus_assert (find_handler (tree, path0, &exact_match) == tree->root && exact_match);
1623 _dbus_assert (find_handler (tree, path1, &exact_match) != tree->root && exact_match);
1624 _dbus_assert (find_handler (tree, path2, &exact_match) != tree->root && exact_match);
1625 _dbus_assert (find_handler (tree, path3, &exact_match) != tree->root && exact_match);
1626 _dbus_assert (find_handler (tree, path4, &exact_match) != tree->root && exact_match);
1627 _dbus_assert (find_handler (tree, path5, &exact_match) != tree->root && exact_match);
1628 _dbus_assert (find_handler (tree, path6, &exact_match) != tree->root && !exact_match);
1629 _dbus_assert (find_handler (tree, path7, &exact_match) != tree->root && !exact_match);
1630 _dbus_assert (find_handler (tree, path8, &exact_match) == tree->root && !exact_match);
1632 if (!do_register (tree, path6, TRUE, 6, tree_test_data))
1635 _dbus_assert (find_subtree (tree, path0, NULL));
1636 _dbus_assert (find_subtree (tree, path1, NULL));
1637 _dbus_assert (find_subtree (tree, path2, NULL));
1638 _dbus_assert (find_subtree (tree, path3, NULL));
1639 _dbus_assert (find_subtree (tree, path4, NULL));
1640 _dbus_assert (find_subtree (tree, path5, NULL));
1641 _dbus_assert (find_subtree (tree, path6, NULL));
1642 _dbus_assert (!find_subtree (tree, path7, NULL));
1643 _dbus_assert (!find_subtree (tree, path8, NULL));
1645 if (!do_register (tree, path7, TRUE, 7, tree_test_data))
1648 _dbus_assert (find_subtree (tree, path0, NULL));
1649 _dbus_assert (find_subtree (tree, path1, NULL));
1650 _dbus_assert (find_subtree (tree, path2, NULL));
1651 _dbus_assert (find_subtree (tree, path3, NULL));
1652 _dbus_assert (find_subtree (tree, path4, NULL));
1653 _dbus_assert (find_subtree (tree, path5, NULL));
1654 _dbus_assert (find_subtree (tree, path6, NULL));
1655 _dbus_assert (find_subtree (tree, path7, NULL));
1656 _dbus_assert (!find_subtree (tree, path8, NULL));
1658 if (!do_register (tree, path8, TRUE, 8, tree_test_data))
1661 _dbus_assert (find_subtree (tree, path0, NULL));
1662 _dbus_assert (find_subtree (tree, path1, NULL));
1663 _dbus_assert (find_subtree (tree, path2, NULL));
1664 _dbus_assert (find_subtree (tree, path3, NULL));
1665 _dbus_assert (find_subtree (tree, path4, NULL));
1666 _dbus_assert (find_subtree (tree, path5, NULL));
1667 _dbus_assert (find_subtree (tree, path6, NULL));
1668 _dbus_assert (find_subtree (tree, path7, NULL));
1669 _dbus_assert (find_subtree (tree, path8, NULL));
1671 _dbus_assert (find_handler (tree, path0, &exact_match) == tree->root && exact_match);
1672 _dbus_assert (find_handler (tree, path1, &exact_match) != tree->root && exact_match);
1673 _dbus_assert (find_handler (tree, path2, &exact_match) != tree->root && exact_match);
1674 _dbus_assert (find_handler (tree, path3, &exact_match) != tree->root && exact_match);
1675 _dbus_assert (find_handler (tree, path4, &exact_match) != tree->root && exact_match);
1676 _dbus_assert (find_handler (tree, path5, &exact_match) != tree->root && exact_match);
1677 _dbus_assert (find_handler (tree, path6, &exact_match) != tree->root && exact_match);
1678 _dbus_assert (find_handler (tree, path7, &exact_match) != tree->root && exact_match);
1679 _dbus_assert (find_handler (tree, path8, &exact_match) != tree->root && exact_match);
1681 /* test the list_registered function */
1684 const char *root[] = { NULL };
1685 char **child_entries;
1688 _dbus_object_tree_list_registered_unlocked (tree, path1, &child_entries);
1689 if (child_entries != NULL)
1691 nb = string_array_length ((const char**)child_entries);
1692 _dbus_assert (nb == 1);
1693 dbus_free_string_array (child_entries);
1696 _dbus_object_tree_list_registered_unlocked (tree, path2, &child_entries);
1697 if (child_entries != NULL)
1699 nb = string_array_length ((const char**)child_entries);
1700 _dbus_assert (nb == 2);
1701 dbus_free_string_array (child_entries);
1704 _dbus_object_tree_list_registered_unlocked (tree, path8, &child_entries);
1705 if (child_entries != NULL)
1707 nb = string_array_length ((const char**)child_entries);
1708 _dbus_assert (nb == 0);
1709 dbus_free_string_array (child_entries);
1712 _dbus_object_tree_list_registered_unlocked (tree, root, &child_entries);
1713 if (child_entries != NULL)
1715 nb = string_array_length ((const char**)child_entries);
1716 _dbus_assert (nb == 3);
1717 dbus_free_string_array (child_entries);
1721 /* Check that destroying tree calls unregister funcs */
1722 _dbus_object_tree_unref (tree);
1725 while (i < (int) _DBUS_N_ELEMENTS (tree_test_data))
1727 _dbus_assert (tree_test_data[i].handler_unregistered);
1728 _dbus_assert (!tree_test_data[i].message_handled);
1732 /* Now start again and try the individual unregister function */
1733 tree = _dbus_object_tree_new (NULL);
1737 if (!do_register (tree, path0, TRUE, 0, tree_test_data))
1739 if (!do_register (tree, path1, TRUE, 1, tree_test_data))
1741 if (!do_register (tree, path2, TRUE, 2, tree_test_data))
1743 if (!do_register (tree, path3, TRUE, 3, tree_test_data))
1745 if (!do_register (tree, path4, TRUE, 4, tree_test_data))
1747 if (!do_register (tree, path5, TRUE, 5, tree_test_data))
1749 if (!do_register (tree, path6, TRUE, 6, tree_test_data))
1751 if (!do_register (tree, path7, TRUE, 7, tree_test_data))
1753 if (!do_register (tree, path8, TRUE, 8, tree_test_data))
1756 _dbus_object_tree_unregister_and_unlock (tree, path0);
1757 _dbus_assert (_dbus_object_tree_get_user_data_unlocked (tree, path0) == NULL);
1759 _dbus_assert (!find_subtree (tree, path0, NULL));
1760 _dbus_assert (find_subtree (tree, path1, NULL));
1761 _dbus_assert (find_subtree (tree, path2, NULL));
1762 _dbus_assert (find_subtree (tree, path3, NULL));
1763 _dbus_assert (find_subtree (tree, path4, NULL));
1764 _dbus_assert (find_subtree (tree, path5, NULL));
1765 _dbus_assert (find_subtree (tree, path6, NULL));
1766 _dbus_assert (find_subtree (tree, path7, NULL));
1767 _dbus_assert (find_subtree (tree, path8, NULL));
1769 _dbus_object_tree_unregister_and_unlock (tree, path1);
1770 _dbus_assert (_dbus_object_tree_get_user_data_unlocked (tree, path1) == NULL);
1772 _dbus_assert (!find_subtree (tree, path0, NULL));
1773 _dbus_assert (!find_subtree (tree, path1, NULL));
1774 _dbus_assert (find_subtree (tree, path2, NULL));
1775 _dbus_assert (find_subtree (tree, path3, NULL));
1776 _dbus_assert (find_subtree (tree, path4, NULL));
1777 _dbus_assert (find_subtree (tree, path5, NULL));
1778 _dbus_assert (find_subtree (tree, path6, NULL));
1779 _dbus_assert (find_subtree (tree, path7, NULL));
1780 _dbus_assert (find_subtree (tree, path8, NULL));
1782 _dbus_object_tree_unregister_and_unlock (tree, path2);
1783 _dbus_assert (_dbus_object_tree_get_user_data_unlocked (tree, path2) == NULL);
1785 _dbus_assert (!find_subtree (tree, path0, NULL));
1786 _dbus_assert (!find_subtree (tree, path1, NULL));
1787 _dbus_assert (!find_subtree (tree, path2, NULL));
1788 _dbus_assert (find_subtree (tree, path3, NULL));
1789 _dbus_assert (find_subtree (tree, path4, NULL));
1790 _dbus_assert (find_subtree (tree, path5, NULL));
1791 _dbus_assert (find_subtree (tree, path6, NULL));
1792 _dbus_assert (find_subtree (tree, path7, NULL));
1793 _dbus_assert (find_subtree (tree, path8, NULL));
1795 _dbus_object_tree_unregister_and_unlock (tree, path3);
1796 _dbus_assert (_dbus_object_tree_get_user_data_unlocked (tree, path3) == NULL);
1798 _dbus_assert (!find_subtree (tree, path0, NULL));
1799 _dbus_assert (!find_subtree (tree, path1, NULL));
1800 _dbus_assert (!find_subtree (tree, path2, NULL));
1801 _dbus_assert (!find_subtree (tree, path3, NULL));
1802 _dbus_assert (find_subtree (tree, path4, NULL));
1803 _dbus_assert (find_subtree (tree, path5, NULL));
1804 _dbus_assert (find_subtree (tree, path6, NULL));
1805 _dbus_assert (find_subtree (tree, path7, NULL));
1806 _dbus_assert (find_subtree (tree, path8, NULL));
1808 _dbus_object_tree_unregister_and_unlock (tree, path4);
1809 _dbus_assert (_dbus_object_tree_get_user_data_unlocked (tree, path4) == NULL);
1811 _dbus_assert (!find_subtree (tree, path0, NULL));
1812 _dbus_assert (!find_subtree (tree, path1, NULL));
1813 _dbus_assert (!find_subtree (tree, path2, NULL));
1814 _dbus_assert (!find_subtree (tree, path3, NULL));
1815 _dbus_assert (!find_subtree (tree, path4, NULL));
1816 _dbus_assert (find_subtree (tree, path5, NULL));
1817 _dbus_assert (find_subtree (tree, path6, NULL));
1818 _dbus_assert (find_subtree (tree, path7, NULL));
1819 _dbus_assert (find_subtree (tree, path8, NULL));
1821 _dbus_object_tree_unregister_and_unlock (tree, path5);
1822 _dbus_assert (_dbus_object_tree_get_user_data_unlocked (tree, path5) == NULL);
1824 _dbus_assert (!find_subtree (tree, path0, NULL));
1825 _dbus_assert (!find_subtree (tree, path1, NULL));
1826 _dbus_assert (!find_subtree (tree, path2, NULL));
1827 _dbus_assert (!find_subtree (tree, path3, NULL));
1828 _dbus_assert (!find_subtree (tree, path4, NULL));
1829 _dbus_assert (!find_subtree (tree, path5, NULL));
1830 _dbus_assert (find_subtree (tree, path6, NULL));
1831 _dbus_assert (find_subtree (tree, path7, NULL));
1832 _dbus_assert (find_subtree (tree, path8, NULL));
1834 _dbus_object_tree_unregister_and_unlock (tree, path6);
1835 _dbus_assert (_dbus_object_tree_get_user_data_unlocked (tree, path6) == NULL);
1837 _dbus_assert (!find_subtree (tree, path0, NULL));
1838 _dbus_assert (!find_subtree (tree, path1, NULL));
1839 _dbus_assert (!find_subtree (tree, path2, NULL));
1840 _dbus_assert (!find_subtree (tree, path3, NULL));
1841 _dbus_assert (!find_subtree (tree, path4, NULL));
1842 _dbus_assert (!find_subtree (tree, path5, NULL));
1843 _dbus_assert (!find_subtree (tree, path6, NULL));
1844 _dbus_assert (find_subtree (tree, path7, NULL));
1845 _dbus_assert (find_subtree (tree, path8, NULL));
1847 _dbus_object_tree_unregister_and_unlock (tree, path7);
1848 _dbus_assert (_dbus_object_tree_get_user_data_unlocked (tree, path7) == NULL);
1850 _dbus_assert (!find_subtree (tree, path0, NULL));
1851 _dbus_assert (!find_subtree (tree, path1, NULL));
1852 _dbus_assert (!find_subtree (tree, path2, NULL));
1853 _dbus_assert (!find_subtree (tree, path3, NULL));
1854 _dbus_assert (!find_subtree (tree, path4, NULL));
1855 _dbus_assert (!find_subtree (tree, path5, NULL));
1856 _dbus_assert (!find_subtree (tree, path6, NULL));
1857 _dbus_assert (!find_subtree (tree, path7, NULL));
1858 _dbus_assert (find_subtree (tree, path8, NULL));
1860 _dbus_object_tree_unregister_and_unlock (tree, path8);
1861 _dbus_assert (_dbus_object_tree_get_user_data_unlocked (tree, path8) == NULL);
1863 _dbus_assert (!find_subtree (tree, path0, NULL));
1864 _dbus_assert (!find_subtree (tree, path1, NULL));
1865 _dbus_assert (!find_subtree (tree, path2, NULL));
1866 _dbus_assert (!find_subtree (tree, path3, NULL));
1867 _dbus_assert (!find_subtree (tree, path4, NULL));
1868 _dbus_assert (!find_subtree (tree, path5, NULL));
1869 _dbus_assert (!find_subtree (tree, path6, NULL));
1870 _dbus_assert (!find_subtree (tree, path7, NULL));
1871 _dbus_assert (!find_subtree (tree, path8, NULL));
1874 while (i < (int) _DBUS_N_ELEMENTS (tree_test_data))
1876 _dbus_assert (tree_test_data[i].handler_unregistered);
1877 _dbus_assert (!tree_test_data[i].message_handled);
1881 /* Register it all again, and test dispatch */
1883 if (!do_register (tree, path0, TRUE, 0, tree_test_data))
1885 if (!do_register (tree, path1, FALSE, 1, tree_test_data))
1887 if (!do_register (tree, path2, TRUE, 2, tree_test_data))
1889 if (!do_register (tree, path3, TRUE, 3, tree_test_data))
1891 if (!do_register (tree, path4, TRUE, 4, tree_test_data))
1893 if (!do_register (tree, path5, TRUE, 5, tree_test_data))
1895 if (!do_register (tree, path6, FALSE, 6, tree_test_data))
1897 if (!do_register (tree, path7, TRUE, 7, tree_test_data))
1899 if (!do_register (tree, path8, TRUE, 8, tree_test_data))
1906 if (!do_test_dispatch (tree, path0, 0, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1908 if (!do_test_dispatch (tree, path1, 1, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1910 if (!do_test_dispatch (tree, path2, 2, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1912 if (!do_test_dispatch (tree, path3, 3, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1914 if (!do_test_dispatch (tree, path4, 4, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1916 if (!do_test_dispatch (tree, path5, 5, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1918 if (!do_test_dispatch (tree, path6, 6, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1920 if (!do_test_dispatch (tree, path7, 7, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1922 if (!do_test_dispatch (tree, path8, 8, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1929 _dbus_object_tree_ref (tree);
1930 _dbus_object_tree_unref (tree);
1931 _dbus_object_tree_unref (tree);
1938 * @ingroup DBusObjectTree
1939 * Unit test for DBusObjectTree
1940 * @returns #TRUE on success.
1943 _dbus_object_tree_test (void)
1945 _dbus_test_oom_handling ("object tree",
1946 object_tree_test_iteration,
1952 #endif /* DBUS_BUILD_TESTS */