1 /* -*- mode: C; c-file-style: "gnu"; indent-tabs-mode: nil; -*- */
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 int max_subtrees; /**< Number of allocated entries in subtrees */
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);
155 /** Set to 1 to get a bunch of debug spew about finding the
158 #define VERBOSE_FIND 0
160 static DBusObjectSubtree*
161 find_subtree_recurse (DBusObjectSubtree *subtree,
163 dbus_bool_t create_if_not_found,
164 int *index_in_parent,
165 dbus_bool_t *exact_match)
168 dbus_bool_t return_deepest_match;
170 return_deepest_match = exact_match != NULL;
172 _dbus_assert (!(return_deepest_match && create_if_not_found));
177 _dbus_verbose (" path exhausted, returning %s\n",
180 if (exact_match != NULL)
186 _dbus_verbose (" searching children of %s for %s\n",
187 subtree->name, path[0]);
191 j = subtree->n_subtrees;
197 v = strcmp (path[0], subtree->subtrees[k]->name);
200 _dbus_verbose (" %s cmp %s = %d\n",
201 path[0], subtree->subtrees[k]->name,
210 _dbus_verbose (" storing parent index %d\n", k);
212 *index_in_parent = k;
215 if (return_deepest_match)
217 DBusObjectSubtree *next;
219 next = find_subtree_recurse (subtree->subtrees[k],
220 &path[1], create_if_not_found,
221 index_in_parent, exact_match);
223 subtree->invoke_as_fallback)
226 _dbus_verbose (" no deeper match found, returning %s\n",
229 if (exact_match != NULL)
230 *exact_match = FALSE;
237 return find_subtree_recurse (subtree->subtrees[k],
238 &path[1], create_if_not_found,
239 index_in_parent, exact_match);
252 _dbus_verbose (" no match found, current tree %s, create_if_not_found = %d\n",
253 subtree->name, create_if_not_found);
256 if (create_if_not_found)
258 DBusObjectSubtree* child;
259 int child_pos, new_n_subtrees;
262 _dbus_verbose (" creating subtree %s\n",
266 child = _dbus_object_subtree_new (path[0],
271 new_n_subtrees = subtree->n_subtrees + 1;
272 if (new_n_subtrees > subtree->max_subtrees)
274 int new_max_subtrees;
275 DBusObjectSubtree **new_subtrees;
277 new_max_subtrees = subtree->max_subtrees == 0 ? 1 : 2 * subtree->max_subtrees;
278 new_subtrees = dbus_realloc (subtree->subtrees,
279 new_max_subtrees * sizeof (DBusObjectSubtree*));
280 if (new_subtrees == NULL)
282 _dbus_object_subtree_unref (child);
285 subtree->subtrees = new_subtrees;
286 subtree->max_subtrees = new_max_subtrees;
289 /* The binary search failed, so i == j points to the
290 place the child should be inserted. */
292 _dbus_assert (child_pos < new_n_subtrees &&
293 new_n_subtrees <= subtree->max_subtrees);
294 if (child_pos + 1 < new_n_subtrees)
296 memmove (&subtree->subtrees[child_pos+1],
297 &subtree->subtrees[child_pos],
298 (new_n_subtrees - child_pos - 1) *
299 sizeof subtree->subtrees[0]);
301 subtree->subtrees[child_pos] = child;
304 *index_in_parent = child_pos;
305 subtree->n_subtrees = new_n_subtrees;
306 child->parent = subtree;
308 return find_subtree_recurse (child,
309 &path[1], create_if_not_found,
310 index_in_parent, exact_match);
314 if (exact_match != NULL)
315 *exact_match = FALSE;
316 return (return_deepest_match && subtree->invoke_as_fallback) ? subtree : NULL;
320 static DBusObjectSubtree*
321 find_subtree (DBusObjectTree *tree,
323 int *index_in_parent)
325 DBusObjectSubtree *subtree;
328 _dbus_verbose ("Looking for exact registered subtree\n");
331 subtree = find_subtree_recurse (tree->root, path, FALSE, index_in_parent, NULL);
333 if (subtree && subtree->message_function == NULL)
339 static DBusObjectSubtree*
340 lookup_subtree (DBusObjectTree *tree,
344 _dbus_verbose ("Looking for subtree\n");
346 return find_subtree_recurse (tree->root, path, FALSE, NULL, NULL);
349 static DBusObjectSubtree*
350 find_handler (DBusObjectTree *tree,
352 dbus_bool_t *exact_match)
355 _dbus_verbose ("Looking for deepest handler\n");
357 _dbus_assert (exact_match != NULL);
359 *exact_match = FALSE; /* ensure always initialized */
361 return find_subtree_recurse (tree->root, path, FALSE, NULL, exact_match);
364 static DBusObjectSubtree*
365 ensure_subtree (DBusObjectTree *tree,
369 _dbus_verbose ("Ensuring subtree\n");
371 return find_subtree_recurse (tree->root, path, TRUE, NULL, NULL);
374 static char *flatten_path (const char **path);
377 * Registers a new subtree in the global object tree.
379 * @param tree the global object tree
380 * @param fallback #TRUE to handle messages to children of this path
381 * @param path NULL-terminated array of path elements giving path to subtree
382 * @param vtable the vtable used to traverse this subtree
383 * @param user_data user data to pass to methods in the vtable
384 * @param error address where an error can be returned
385 * @returns #FALSE if an error (#DBUS_ERROR_NO_MEMORY or
386 * #DBUS_ERROR_OBJECT_PATH_IN_USE) is reported
389 _dbus_object_tree_register (DBusObjectTree *tree,
390 dbus_bool_t fallback,
392 const DBusObjectPathVTable *vtable,
396 DBusObjectSubtree *subtree;
398 _dbus_assert (tree != NULL);
399 _dbus_assert (vtable->message_function != NULL);
400 _dbus_assert (path != NULL);
402 subtree = ensure_subtree (tree, path);
405 _DBUS_SET_OOM (error);
409 if (subtree->message_function != NULL)
413 char *complete_path = flatten_path (path);
415 dbus_set_error (error, DBUS_ERROR_OBJECT_PATH_IN_USE,
416 "A handler is already registered for %s",
417 complete_path ? complete_path
418 : "(cannot represent path: out of memory!)");
420 dbus_free (complete_path);
426 subtree->message_function = vtable->message_function;
427 subtree->unregister_function = vtable->unregister_function;
428 subtree->user_data = user_data;
429 subtree->invoke_as_fallback = fallback != FALSE;
435 * Unregisters an object subtree that was registered with the
438 * @param tree the global object tree
439 * @param path path to the subtree (same as the one passed to _dbus_object_tree_register())
442 _dbus_object_tree_unregister_and_unlock (DBusObjectTree *tree,
446 DBusObjectSubtree *subtree;
447 DBusObjectPathUnregisterFunction unregister_function;
449 DBusConnection *connection;
451 _dbus_assert (path != NULL);
453 unregister_function = NULL;
456 subtree = find_subtree (tree, path, &i);
458 #ifndef DBUS_DISABLE_CHECKS
461 _dbus_warn ("Attempted to unregister path (path[0] = %s path[1] = %s) which isn't registered\n",
462 path[0] ? path[0] : "null",
463 path[1] ? path[1] : "null");
467 _dbus_assert (subtree != NULL);
470 _dbus_assert (subtree->parent == NULL ||
471 (i >= 0 && subtree->parent->subtrees[i] == subtree));
473 subtree->message_function = NULL;
475 unregister_function = subtree->unregister_function;
476 user_data = subtree->user_data;
478 subtree->unregister_function = NULL;
479 subtree->user_data = NULL;
481 /* If we have no subtrees of our own, remove from
482 * our parent (FIXME could also be more aggressive
483 * and remove our parent if it becomes empty)
485 if (subtree->parent && subtree->n_subtrees == 0)
487 /* assumes a 0-byte memmove is OK */
488 memmove (&subtree->parent->subtrees[i],
489 &subtree->parent->subtrees[i+1],
490 (subtree->parent->n_subtrees - i - 1) *
491 sizeof (subtree->parent->subtrees[0]));
492 subtree->parent->n_subtrees -= 1;
494 subtree->parent = NULL;
496 _dbus_object_subtree_unref (subtree);
501 connection = tree->connection;
503 /* Unlock and call application code */
504 #ifdef DBUS_BUILD_TESTS
508 _dbus_connection_ref_unlocked (connection);
509 _dbus_verbose ("unlock %s\n", _DBUS_FUNCTION_NAME);
510 _dbus_connection_unlock (connection);
513 if (unregister_function)
514 (* unregister_function) (connection, user_data);
516 #ifdef DBUS_BUILD_TESTS
519 dbus_connection_unref (connection);
523 free_subtree_recurse (DBusConnection *connection,
524 DBusObjectSubtree *subtree)
526 /* Delete them from the end, for slightly
527 * more robustness against odd reentrancy.
529 while (subtree->n_subtrees > 0)
531 DBusObjectSubtree *child;
533 child = subtree->subtrees[subtree->n_subtrees - 1];
534 subtree->subtrees[subtree->n_subtrees - 1] = NULL;
535 subtree->n_subtrees -= 1;
536 child->parent = NULL;
538 free_subtree_recurse (connection, child);
541 /* Call application code */
542 if (subtree->unregister_function)
543 (* subtree->unregister_function) (connection,
546 subtree->message_function = NULL;
547 subtree->unregister_function = NULL;
548 subtree->user_data = NULL;
550 /* Now free ourselves */
551 _dbus_object_subtree_unref (subtree);
555 * Free all the handlers in the tree. Lock on tree's connection
558 * @param tree the object tree
561 _dbus_object_tree_free_all_unlocked (DBusObjectTree *tree)
564 free_subtree_recurse (tree->connection,
570 _dbus_object_tree_list_registered_unlocked (DBusObjectTree *tree,
571 const char **parent_path,
572 char ***child_entries)
574 DBusObjectSubtree *subtree;
577 _dbus_assert (parent_path != NULL);
578 _dbus_assert (child_entries != NULL);
580 *child_entries = NULL;
582 subtree = lookup_subtree (tree, parent_path);
585 retval = dbus_new0 (char *, 1);
590 retval = dbus_new0 (char*, subtree->n_subtrees + 1);
594 while (i < subtree->n_subtrees)
596 retval[i] = _dbus_strdup (subtree->subtrees[i]->name);
597 if (retval[i] == NULL)
599 dbus_free_string_array (retval);
609 *child_entries = retval;
610 return retval != NULL;
613 static DBusHandlerResult
614 handle_default_introspect_and_unlock (DBusObjectTree *tree,
615 DBusMessage *message,
619 DBusHandlerResult result;
623 DBusMessageIter iter;
624 const char *v_STRING;
625 dbus_bool_t already_unlocked;
627 /* We have the connection lock here */
629 already_unlocked = FALSE;
631 _dbus_verbose (" considering default Introspect() handler...\n");
635 if (!dbus_message_is_method_call (message,
636 DBUS_INTERFACE_INTROSPECTABLE,
639 #ifdef DBUS_BUILD_TESTS
640 if (tree->connection)
643 _dbus_verbose ("unlock %s %d\n", _DBUS_FUNCTION_NAME, __LINE__);
644 _dbus_connection_unlock (tree->connection);
647 return DBUS_HANDLER_RESULT_NOT_YET_HANDLED;
650 _dbus_verbose (" using default Introspect() handler!\n");
652 if (!_dbus_string_init (&xml))
654 #ifdef DBUS_BUILD_TESTS
655 if (tree->connection)
658 _dbus_verbose ("unlock %s %d\n", _DBUS_FUNCTION_NAME, __LINE__);
659 _dbus_connection_unlock (tree->connection);
662 return DBUS_HANDLER_RESULT_NEED_MEMORY;
665 result = DBUS_HANDLER_RESULT_NEED_MEMORY;
668 if (!_dbus_object_tree_list_registered_unlocked (tree, path, &children))
671 if (!_dbus_string_append (&xml, DBUS_INTROSPECT_1_0_XML_DOCTYPE_DECL_NODE))
674 if (!_dbus_string_append (&xml, "<node>\n"))
678 while (children[i] != NULL)
680 if (!_dbus_string_append_printf (&xml, " <node name=\"%s\"/>\n",
687 if (!_dbus_string_append (&xml, "</node>\n"))
690 reply = dbus_message_new_method_return (message);
694 dbus_message_iter_init_append (reply, &iter);
695 v_STRING = _dbus_string_get_const_data (&xml);
696 if (!dbus_message_iter_append_basic (&iter, DBUS_TYPE_STRING, &v_STRING))
699 #ifdef DBUS_BUILD_TESTS
700 if (tree->connection)
703 already_unlocked = TRUE;
705 if (!_dbus_connection_send_and_unlock (tree->connection, reply, NULL))
709 result = DBUS_HANDLER_RESULT_HANDLED;
712 #ifdef DBUS_BUILD_TESTS
713 if (tree->connection)
716 if (!already_unlocked)
718 _dbus_verbose ("unlock %s %d\n", _DBUS_FUNCTION_NAME, __LINE__);
719 _dbus_connection_unlock (tree->connection);
723 _dbus_string_free (&xml);
724 dbus_free_string_array (children);
726 dbus_message_unref (reply);
732 * Tries to dispatch a message by directing it to handler for the
733 * object path listed in the message header, if any. Messages are
734 * dispatched first to the registered handler that matches the largest
735 * number of path elements; that is, message to /foo/bar/baz would go
736 * to the handler for /foo/bar before the one for /foo.
738 * @todo thread problems
740 * @param tree the global object tree
741 * @param message the message to dispatch
742 * @returns whether message was handled successfully
745 _dbus_object_tree_dispatch_and_unlock (DBusObjectTree *tree,
746 DBusMessage *message)
749 dbus_bool_t exact_match;
752 DBusHandlerResult result;
753 DBusObjectSubtree *subtree;
756 _dbus_verbose ("Dispatch of message by object path\n");
760 if (!dbus_message_get_path_decomposed (message, &path))
762 #ifdef DBUS_BUILD_TESTS
763 if (tree->connection)
766 _dbus_verbose ("unlock %s\n", _DBUS_FUNCTION_NAME);
767 _dbus_connection_unlock (tree->connection);
770 _dbus_verbose ("No memory to get decomposed path\n");
772 return DBUS_HANDLER_RESULT_NEED_MEMORY;
777 #ifdef DBUS_BUILD_TESTS
778 if (tree->connection)
781 _dbus_verbose ("unlock %s\n", _DBUS_FUNCTION_NAME);
782 _dbus_connection_unlock (tree->connection);
785 _dbus_verbose ("No path field in message\n");
786 return DBUS_HANDLER_RESULT_NOT_YET_HANDLED;
789 /* Find the deepest path that covers the path in the message */
790 subtree = find_handler (tree, (const char**) path, &exact_match);
792 /* Build a list of all paths that cover the path in the message */
796 while (subtree != NULL)
798 if (subtree->message_function != NULL && (exact_match || subtree->invoke_as_fallback))
800 _dbus_object_subtree_ref (subtree);
802 /* run deepest paths first */
803 if (!_dbus_list_append (&list, subtree))
805 result = DBUS_HANDLER_RESULT_NEED_MEMORY;
806 _dbus_object_subtree_unref (subtree);
807 goto free_and_return;
812 subtree = subtree->parent;
815 _dbus_verbose ("%d handlers in the path tree for this message\n",
816 _dbus_list_get_length (&list));
818 /* Invoke each handler in the list */
820 result = DBUS_HANDLER_RESULT_NOT_YET_HANDLED;
822 link = _dbus_list_get_first_link (&list);
825 DBusList *next = _dbus_list_get_next_link (&list, link);
826 subtree = link->data;
828 /* message_function is NULL if we're unregistered
831 if (subtree->message_function)
833 DBusObjectPathMessageFunction message_function;
836 message_function = subtree->message_function;
837 user_data = subtree->user_data;
840 _dbus_verbose (" (invoking a handler)\n");
843 #ifdef DBUS_BUILD_TESTS
844 if (tree->connection)
847 _dbus_verbose ("unlock %s\n", _DBUS_FUNCTION_NAME);
848 _dbus_connection_unlock (tree->connection);
851 /* FIXME you could unregister the subtree in another thread
852 * before we invoke the callback, and I can't figure out a
853 * good way to solve this.
856 result = (* message_function) (tree->connection,
860 #ifdef DBUS_BUILD_TESTS
861 if (tree->connection)
863 _dbus_connection_lock (tree->connection);
865 if (result != DBUS_HANDLER_RESULT_NOT_YET_HANDLED)
866 goto free_and_return;
874 if (result == DBUS_HANDLER_RESULT_NOT_YET_HANDLED)
876 /* This hardcoded default handler does a minimal Introspect()
878 result = handle_default_introspect_and_unlock (tree, message,
879 (const char**) path);
883 #ifdef DBUS_BUILD_TESTS
884 if (tree->connection)
887 _dbus_verbose ("unlock %s\n", _DBUS_FUNCTION_NAME);
888 _dbus_connection_unlock (tree->connection);
894 link = _dbus_list_get_first_link (&list);
895 _dbus_object_subtree_unref (link->data);
896 _dbus_list_remove_link (&list, link);
899 dbus_free_string_array (path);
905 * Looks up the data passed to _dbus_object_tree_register() for a
906 * handler at the given path.
908 * @param tree the global object tree
909 * @param path NULL-terminated array of path elements giving path to subtree
910 * @returns the object's user_data or #NULL if none found
913 _dbus_object_tree_get_user_data_unlocked (DBusObjectTree *tree,
916 dbus_bool_t exact_match;
917 DBusObjectSubtree *subtree;
919 _dbus_assert (tree != NULL);
920 _dbus_assert (path != NULL);
922 /* Find the deepest path that covers the path in the message */
923 subtree = find_handler (tree, (const char**) path, &exact_match);
925 if ((subtree == NULL) || !exact_match)
927 _dbus_verbose ("%s: No object at specified path found\n",
928 _DBUS_FUNCTION_NAME);
932 return subtree->user_data;
936 * Allocates a subtree object.
938 * @param name name to duplicate.
939 * @returns newly-allocated subtree
941 static DBusObjectSubtree*
942 allocate_subtree_object (const char *name)
945 DBusObjectSubtree *subtree;
946 const size_t front_padding = _DBUS_STRUCT_OFFSET (DBusObjectSubtree, name);
948 _dbus_assert (name != NULL);
952 subtree = dbus_malloc (MAX (front_padding + (len + 1), sizeof (DBusObjectSubtree)));
957 memcpy (subtree->name, name, len + 1);
962 static DBusObjectSubtree*
963 _dbus_object_subtree_new (const char *name,
964 const DBusObjectPathVTable *vtable,
967 DBusObjectSubtree *subtree;
969 subtree = allocate_subtree_object (name);
973 _dbus_assert (name != NULL);
975 subtree->parent = NULL;
979 subtree->message_function = vtable->message_function;
980 subtree->unregister_function = vtable->unregister_function;
984 subtree->message_function = NULL;
985 subtree->unregister_function = NULL;
988 subtree->user_data = user_data;
989 subtree->refcount.value = 1;
990 subtree->subtrees = NULL;
991 subtree->n_subtrees = 0;
992 subtree->max_subtrees = 0;
993 subtree->invoke_as_fallback = FALSE;
1001 static DBusObjectSubtree *
1002 _dbus_object_subtree_ref (DBusObjectSubtree *subtree)
1004 _dbus_assert (subtree->refcount.value > 0);
1005 _dbus_atomic_inc (&subtree->refcount);
1011 _dbus_object_subtree_unref (DBusObjectSubtree *subtree)
1013 _dbus_assert (subtree->refcount.value > 0);
1015 if (_dbus_atomic_dec (&subtree->refcount) == 1)
1017 _dbus_assert (subtree->unregister_function == NULL);
1018 _dbus_assert (subtree->message_function == NULL);
1020 dbus_free (subtree->subtrees);
1021 dbus_free (subtree);
1026 * Lists the registered fallback handlers and object path handlers at
1027 * the given parent_path. The returned array should be freed with
1028 * dbus_free_string_array().
1030 * @param tree the object tree
1031 * @param parent_path the path to list the child handlers of
1032 * @param child_entries returns #NULL-terminated array of children
1033 * @returns #FALSE if no memory to allocate the child entries
1036 _dbus_object_tree_list_registered_and_unlock (DBusObjectTree *tree,
1037 const char **parent_path,
1038 char ***child_entries)
1042 result = _dbus_object_tree_list_registered_unlocked (tree,
1046 #ifdef DBUS_BUILD_TESTS
1047 if (tree->connection)
1050 _dbus_verbose ("unlock %s\n", _DBUS_FUNCTION_NAME);
1051 _dbus_connection_unlock (tree->connection);
1058 /** Set to 1 to get a bunch of spew about disassembling the path string */
1059 #define VERBOSE_DECOMPOSE 0
1062 * Decompose an object path. A path of just "/" is
1063 * represented as an empty vector of strings.
1064 * The path need not be nul terminated.
1066 * @param data the path data
1067 * @param len the length of the path string
1068 * @param path address to store new object path
1069 * @param path_len length of stored path
1072 _dbus_decompose_path (const char* data,
1081 _dbus_assert (data != NULL);
1083 #if VERBOSE_DECOMPOSE
1084 _dbus_verbose ("Decomposing path \"%s\"\n",
1089 if (len > 1) /* if path is not just "/" */
1100 retval = dbus_new0 (char*, n_components + 1);
1106 if (n_components == 0)
1110 while (comp < n_components)
1112 _dbus_assert (i < len);
1118 while (j < len && data[j] != '/')
1121 /* Now [i, j) is the path component */
1122 _dbus_assert (i < j);
1123 _dbus_assert (data[i] != '/');
1124 _dbus_assert (j == len || data[j] == '/');
1126 #if VERBOSE_DECOMPOSE
1127 _dbus_verbose (" (component in [%d,%d))\n",
1131 retval[comp] = _dbus_memdup (&data[i], j - i + 1);
1132 if (retval[comp] == NULL)
1134 dbus_free_string_array (retval);
1137 retval[comp][j-i] = '\0';
1138 #if VERBOSE_DECOMPOSE
1139 _dbus_verbose (" (component %d = \"%s\")\n",
1140 comp, retval[comp]);
1146 _dbus_assert (i == len);
1150 *path_len = n_components;
1158 flatten_path (const char **path)
1163 if (!_dbus_string_init (&str))
1166 if (path[0] == NULL)
1168 if (!_dbus_string_append_byte (&str, '/'))
1178 if (!_dbus_string_append_byte (&str, '/'))
1181 if (!_dbus_string_append (&str, path[i]))
1188 if (!_dbus_string_steal_data (&str, &s))
1191 _dbus_string_free (&str);
1196 _dbus_string_free (&str);
1201 #ifdef DBUS_BUILD_TESTS
1203 #ifndef DOXYGEN_SHOULD_SKIP_THIS
1205 #include "dbus-test.h"
1215 /* Returns TRUE if container is a parent of child
1217 static StrComparison
1218 path_contains (const char **container,
1224 while (child[i] != NULL)
1228 if (container[i] == NULL)
1229 return STR_PREFIX; /* container ran out, child continues;
1230 * thus the container is a parent of the
1234 _dbus_assert (container[i] != NULL);
1235 _dbus_assert (child[i] != NULL);
1237 v = strcmp (container[i], child[i]);
1240 return STR_DIFFERENT; /* they overlap until here and then are different,
1247 /* Child ran out; if container also did, they are equal;
1248 * otherwise, the child is a parent of the container.
1250 if (container[i] == NULL)
1253 return STR_DIFFERENT;
1258 spew_subtree_recurse (DBusObjectSubtree *subtree,
1266 _dbus_verbose (" ");
1270 _dbus_verbose ("%s (%d children)\n",
1271 subtree->name, subtree->n_subtrees);
1274 while (i < subtree->n_subtrees)
1276 spew_subtree_recurse (subtree->subtrees[i], indent + 2);
1283 spew_tree (DBusObjectTree *tree)
1285 spew_subtree_recurse (tree->root, 0);
1290 * Callback data used in tests
1294 const char **path; /**< Path */
1295 dbus_bool_t handler_fallback; /**< true if the handler may be called as fallback */
1296 dbus_bool_t message_handled; /**< Gets set to true if message handler called */
1297 dbus_bool_t handler_unregistered; /**< gets set to true if handler is unregistered */
1302 test_unregister_function (DBusConnection *connection,
1305 TreeTestData *ttd = user_data;
1307 ttd->handler_unregistered = TRUE;
1310 static DBusHandlerResult
1311 test_message_function (DBusConnection *connection,
1312 DBusMessage *message,
1315 TreeTestData *ttd = user_data;
1317 ttd->message_handled = TRUE;
1319 return DBUS_HANDLER_RESULT_NOT_YET_HANDLED;
1323 do_register (DBusObjectTree *tree,
1325 dbus_bool_t fallback,
1327 TreeTestData *tree_test_data)
1329 DBusObjectPathVTable vtable = { test_unregister_function,
1330 test_message_function, NULL };
1332 tree_test_data[i].message_handled = FALSE;
1333 tree_test_data[i].handler_unregistered = FALSE;
1334 tree_test_data[i].handler_fallback = fallback;
1335 tree_test_data[i].path = path;
1337 if (!_dbus_object_tree_register (tree, fallback, path,
1343 _dbus_assert (_dbus_object_tree_get_user_data_unlocked (tree, path) ==
1344 &tree_test_data[i]);
1350 do_test_dispatch (DBusObjectTree *tree,
1353 TreeTestData *tree_test_data,
1356 DBusMessage *message;
1358 DBusHandlerResult result;
1363 flat = flatten_path (path);
1367 message = dbus_message_new_method_call (NULL,
1369 "org.freedesktop.TestInterface",
1372 if (message == NULL)
1376 while (j < n_test_data)
1378 tree_test_data[j].message_handled = FALSE;
1382 result = _dbus_object_tree_dispatch_and_unlock (tree, message);
1383 if (result == DBUS_HANDLER_RESULT_NEED_MEMORY)
1386 _dbus_assert (tree_test_data[i].message_handled);
1389 while (j < n_test_data)
1391 if (tree_test_data[j].message_handled)
1393 if (tree_test_data[j].handler_fallback)
1394 _dbus_assert (path_contains (tree_test_data[j].path,
1395 path) != STR_DIFFERENT);
1397 _dbus_assert (path_contains (tree_test_data[j].path, path) == STR_EQUAL);
1401 if (tree_test_data[j].handler_fallback)
1402 _dbus_assert (path_contains (tree_test_data[j].path,
1403 path) == STR_DIFFERENT);
1405 _dbus_assert (path_contains (tree_test_data[j].path, path) != STR_EQUAL);
1411 dbus_message_unref (message);
1417 dbus_message_unref (message);
1422 string_array_length (const char **array)
1425 for (i = 0; array[i]; i++) ;
1432 const char *result[20];
1433 } DecomposePathTest;
1435 static DecomposePathTest decompose_tests[] = {
1436 { "/foo", { "foo", NULL } },
1437 { "/foo/bar", { "foo", "bar", NULL } },
1439 { "/a/b", { "a", "b", NULL } },
1440 { "/a/b/c", { "a", "b", "c", NULL } },
1441 { "/a/b/c/d", { "a", "b", "c", "d", NULL } },
1442 { "/foo/bar/q", { "foo", "bar", "q", NULL } },
1443 { "/foo/bar/this/is/longer", { "foo", "bar", "this", "is", "longer", NULL } }
1447 run_decompose_tests (void)
1452 while (i < _DBUS_N_ELEMENTS (decompose_tests))
1458 if (!_dbus_decompose_path (decompose_tests[i].path,
1459 strlen (decompose_tests[i].path),
1460 &result, &result_len))
1463 expected_len = string_array_length (decompose_tests[i].result);
1465 if (result_len != (int) string_array_length ((const char**)result) ||
1466 expected_len != result_len ||
1467 path_contains (decompose_tests[i].result,
1468 (const char**) result) != STR_EQUAL)
1470 int real_len = string_array_length ((const char**)result);
1471 _dbus_warn ("Expected decompose of %s to have len %d, returned %d, appears to have %d\n",
1472 decompose_tests[i].path, expected_len, result_len,
1474 _dbus_warn ("Decompose resulted in elements: { ");
1476 while (i < real_len)
1478 _dbus_warn ("\"%s\"%s", result[i],
1479 (i + 1) == real_len ? "" : ", ");
1483 _dbus_assert_not_reached ("path decompose failed\n");
1486 dbus_free_string_array (result);
1495 object_tree_test_iteration (void *data)
1497 const char *path0[] = { NULL };
1498 const char *path1[] = { "foo", NULL };
1499 const char *path2[] = { "foo", "bar", NULL };
1500 const char *path3[] = { "foo", "bar", "baz", NULL };
1501 const char *path4[] = { "foo", "bar", "boo", NULL };
1502 const char *path5[] = { "blah", NULL };
1503 const char *path6[] = { "blah", "boof", NULL };
1504 const char *path7[] = { "blah", "boof", "this", "is", "really", "long", NULL };
1505 const char *path8[] = { "childless", NULL };
1506 DBusObjectTree *tree;
1507 TreeTestData tree_test_data[9];
1509 dbus_bool_t exact_match;
1511 if (!run_decompose_tests ())
1516 tree = _dbus_object_tree_new (NULL);
1520 if (!do_register (tree, path0, TRUE, 0, tree_test_data))
1523 _dbus_assert (find_subtree (tree, path0, NULL));
1524 _dbus_assert (!find_subtree (tree, path1, NULL));
1525 _dbus_assert (!find_subtree (tree, path2, NULL));
1526 _dbus_assert (!find_subtree (tree, path3, NULL));
1527 _dbus_assert (!find_subtree (tree, path4, NULL));
1528 _dbus_assert (!find_subtree (tree, path5, NULL));
1529 _dbus_assert (!find_subtree (tree, path6, NULL));
1530 _dbus_assert (!find_subtree (tree, path7, NULL));
1531 _dbus_assert (!find_subtree (tree, path8, NULL));
1533 _dbus_assert (find_handler (tree, path0, &exact_match) && exact_match);
1534 _dbus_assert (find_handler (tree, path1, &exact_match) == tree->root && !exact_match);
1535 _dbus_assert (find_handler (tree, path2, &exact_match) == tree->root && !exact_match);
1536 _dbus_assert (find_handler (tree, path3, &exact_match) == tree->root && !exact_match);
1537 _dbus_assert (find_handler (tree, path4, &exact_match) == tree->root && !exact_match);
1538 _dbus_assert (find_handler (tree, path5, &exact_match) == tree->root && !exact_match);
1539 _dbus_assert (find_handler (tree, path6, &exact_match) == tree->root && !exact_match);
1540 _dbus_assert (find_handler (tree, path7, &exact_match) == tree->root && !exact_match);
1541 _dbus_assert (find_handler (tree, path8, &exact_match) == tree->root && !exact_match);
1543 if (!do_register (tree, path1, TRUE, 1, tree_test_data))
1546 _dbus_assert (find_subtree (tree, path0, NULL));
1547 _dbus_assert (find_subtree (tree, path1, NULL));
1548 _dbus_assert (!find_subtree (tree, path2, NULL));
1549 _dbus_assert (!find_subtree (tree, path3, NULL));
1550 _dbus_assert (!find_subtree (tree, path4, NULL));
1551 _dbus_assert (!find_subtree (tree, path5, NULL));
1552 _dbus_assert (!find_subtree (tree, path6, NULL));
1553 _dbus_assert (!find_subtree (tree, path7, NULL));
1554 _dbus_assert (!find_subtree (tree, path8, NULL));
1556 _dbus_assert (find_handler (tree, path0, &exact_match) && exact_match);
1557 _dbus_assert (find_handler (tree, path1, &exact_match) && exact_match);
1558 _dbus_assert (find_handler (tree, path2, &exact_match) && !exact_match);
1559 _dbus_assert (find_handler (tree, path3, &exact_match) && !exact_match);
1560 _dbus_assert (find_handler (tree, path4, &exact_match) && !exact_match);
1561 _dbus_assert (find_handler (tree, path5, &exact_match) == tree->root && !exact_match);
1562 _dbus_assert (find_handler (tree, path6, &exact_match) == tree->root && !exact_match);
1563 _dbus_assert (find_handler (tree, path7, &exact_match) == tree->root && !exact_match);
1564 _dbus_assert (find_handler (tree, path8, &exact_match) == tree->root && !exact_match);
1566 if (!do_register (tree, path2, TRUE, 2, tree_test_data))
1569 _dbus_assert (find_subtree (tree, path1, NULL));
1570 _dbus_assert (find_subtree (tree, path2, NULL));
1571 _dbus_assert (!find_subtree (tree, path3, NULL));
1572 _dbus_assert (!find_subtree (tree, path4, NULL));
1573 _dbus_assert (!find_subtree (tree, path5, NULL));
1574 _dbus_assert (!find_subtree (tree, path6, NULL));
1575 _dbus_assert (!find_subtree (tree, path7, NULL));
1576 _dbus_assert (!find_subtree (tree, path8, NULL));
1578 if (!do_register (tree, path3, TRUE, 3, tree_test_data))
1581 _dbus_assert (find_subtree (tree, path0, NULL));
1582 _dbus_assert (find_subtree (tree, path1, NULL));
1583 _dbus_assert (find_subtree (tree, path2, NULL));
1584 _dbus_assert (find_subtree (tree, path3, NULL));
1585 _dbus_assert (!find_subtree (tree, path4, NULL));
1586 _dbus_assert (!find_subtree (tree, path5, NULL));
1587 _dbus_assert (!find_subtree (tree, path6, NULL));
1588 _dbus_assert (!find_subtree (tree, path7, NULL));
1589 _dbus_assert (!find_subtree (tree, path8, NULL));
1591 if (!do_register (tree, path4, TRUE, 4, tree_test_data))
1594 _dbus_assert (find_subtree (tree, path0, NULL));
1595 _dbus_assert (find_subtree (tree, path1, NULL));
1596 _dbus_assert (find_subtree (tree, path2, NULL));
1597 _dbus_assert (find_subtree (tree, path3, NULL));
1598 _dbus_assert (find_subtree (tree, path4, NULL));
1599 _dbus_assert (!find_subtree (tree, path5, NULL));
1600 _dbus_assert (!find_subtree (tree, path6, NULL));
1601 _dbus_assert (!find_subtree (tree, path7, NULL));
1602 _dbus_assert (!find_subtree (tree, path8, NULL));
1604 if (!do_register (tree, path5, TRUE, 5, tree_test_data))
1607 _dbus_assert (find_subtree (tree, path0, NULL));
1608 _dbus_assert (find_subtree (tree, path1, NULL));
1609 _dbus_assert (find_subtree (tree, path2, NULL));
1610 _dbus_assert (find_subtree (tree, path3, NULL));
1611 _dbus_assert (find_subtree (tree, path4, NULL));
1612 _dbus_assert (find_subtree (tree, path5, NULL));
1613 _dbus_assert (!find_subtree (tree, path6, NULL));
1614 _dbus_assert (!find_subtree (tree, path7, NULL));
1615 _dbus_assert (!find_subtree (tree, path8, NULL));
1617 _dbus_assert (find_handler (tree, path0, &exact_match) == tree->root && exact_match);
1618 _dbus_assert (find_handler (tree, path1, &exact_match) != tree->root && exact_match);
1619 _dbus_assert (find_handler (tree, path2, &exact_match) != tree->root && exact_match);
1620 _dbus_assert (find_handler (tree, path3, &exact_match) != tree->root && exact_match);
1621 _dbus_assert (find_handler (tree, path4, &exact_match) != tree->root && exact_match);
1622 _dbus_assert (find_handler (tree, path5, &exact_match) != tree->root && exact_match);
1623 _dbus_assert (find_handler (tree, path6, &exact_match) != tree->root && !exact_match);
1624 _dbus_assert (find_handler (tree, path7, &exact_match) != tree->root && !exact_match);
1625 _dbus_assert (find_handler (tree, path8, &exact_match) == tree->root && !exact_match);
1627 if (!do_register (tree, path6, TRUE, 6, tree_test_data))
1630 _dbus_assert (find_subtree (tree, path0, NULL));
1631 _dbus_assert (find_subtree (tree, path1, NULL));
1632 _dbus_assert (find_subtree (tree, path2, NULL));
1633 _dbus_assert (find_subtree (tree, path3, NULL));
1634 _dbus_assert (find_subtree (tree, path4, NULL));
1635 _dbus_assert (find_subtree (tree, path5, NULL));
1636 _dbus_assert (find_subtree (tree, path6, NULL));
1637 _dbus_assert (!find_subtree (tree, path7, NULL));
1638 _dbus_assert (!find_subtree (tree, path8, NULL));
1640 if (!do_register (tree, path7, TRUE, 7, tree_test_data))
1643 _dbus_assert (find_subtree (tree, path0, NULL));
1644 _dbus_assert (find_subtree (tree, path1, NULL));
1645 _dbus_assert (find_subtree (tree, path2, NULL));
1646 _dbus_assert (find_subtree (tree, path3, NULL));
1647 _dbus_assert (find_subtree (tree, path4, NULL));
1648 _dbus_assert (find_subtree (tree, path5, NULL));
1649 _dbus_assert (find_subtree (tree, path6, NULL));
1650 _dbus_assert (find_subtree (tree, path7, NULL));
1651 _dbus_assert (!find_subtree (tree, path8, NULL));
1653 if (!do_register (tree, path8, TRUE, 8, tree_test_data))
1656 _dbus_assert (find_subtree (tree, path0, NULL));
1657 _dbus_assert (find_subtree (tree, path1, NULL));
1658 _dbus_assert (find_subtree (tree, path2, NULL));
1659 _dbus_assert (find_subtree (tree, path3, NULL));
1660 _dbus_assert (find_subtree (tree, path4, NULL));
1661 _dbus_assert (find_subtree (tree, path5, NULL));
1662 _dbus_assert (find_subtree (tree, path6, NULL));
1663 _dbus_assert (find_subtree (tree, path7, NULL));
1664 _dbus_assert (find_subtree (tree, path8, NULL));
1666 _dbus_assert (find_handler (tree, path0, &exact_match) == tree->root && exact_match);
1667 _dbus_assert (find_handler (tree, path1, &exact_match) != tree->root && exact_match);
1668 _dbus_assert (find_handler (tree, path2, &exact_match) != tree->root && exact_match);
1669 _dbus_assert (find_handler (tree, path3, &exact_match) != tree->root && exact_match);
1670 _dbus_assert (find_handler (tree, path4, &exact_match) != tree->root && exact_match);
1671 _dbus_assert (find_handler (tree, path5, &exact_match) != tree->root && exact_match);
1672 _dbus_assert (find_handler (tree, path6, &exact_match) != tree->root && exact_match);
1673 _dbus_assert (find_handler (tree, path7, &exact_match) != tree->root && exact_match);
1674 _dbus_assert (find_handler (tree, path8, &exact_match) != tree->root && exact_match);
1676 /* test the list_registered function */
1679 const char *root[] = { NULL };
1680 char **child_entries;
1683 _dbus_object_tree_list_registered_unlocked (tree, path1, &child_entries);
1684 if (child_entries != NULL)
1686 nb = string_array_length ((const char**)child_entries);
1687 _dbus_assert (nb == 1);
1688 dbus_free_string_array (child_entries);
1691 _dbus_object_tree_list_registered_unlocked (tree, path2, &child_entries);
1692 if (child_entries != NULL)
1694 nb = string_array_length ((const char**)child_entries);
1695 _dbus_assert (nb == 2);
1696 dbus_free_string_array (child_entries);
1699 _dbus_object_tree_list_registered_unlocked (tree, path8, &child_entries);
1700 if (child_entries != NULL)
1702 nb = string_array_length ((const char**)child_entries);
1703 _dbus_assert (nb == 0);
1704 dbus_free_string_array (child_entries);
1707 _dbus_object_tree_list_registered_unlocked (tree, root, &child_entries);
1708 if (child_entries != NULL)
1710 nb = string_array_length ((const char**)child_entries);
1711 _dbus_assert (nb == 3);
1712 dbus_free_string_array (child_entries);
1716 /* Check that destroying tree calls unregister funcs */
1717 _dbus_object_tree_unref (tree);
1720 while (i < (int) _DBUS_N_ELEMENTS (tree_test_data))
1722 _dbus_assert (tree_test_data[i].handler_unregistered);
1723 _dbus_assert (!tree_test_data[i].message_handled);
1727 /* Now start again and try the individual unregister function */
1728 tree = _dbus_object_tree_new (NULL);
1732 if (!do_register (tree, path0, TRUE, 0, tree_test_data))
1734 if (!do_register (tree, path1, TRUE, 1, tree_test_data))
1736 if (!do_register (tree, path2, TRUE, 2, tree_test_data))
1738 if (!do_register (tree, path3, TRUE, 3, tree_test_data))
1740 if (!do_register (tree, path4, TRUE, 4, tree_test_data))
1742 if (!do_register (tree, path5, TRUE, 5, tree_test_data))
1744 if (!do_register (tree, path6, TRUE, 6, tree_test_data))
1746 if (!do_register (tree, path7, TRUE, 7, tree_test_data))
1748 if (!do_register (tree, path8, TRUE, 8, tree_test_data))
1751 _dbus_object_tree_unregister_and_unlock (tree, path0);
1752 _dbus_assert (_dbus_object_tree_get_user_data_unlocked (tree, path0) == NULL);
1754 _dbus_assert (!find_subtree (tree, path0, NULL));
1755 _dbus_assert (find_subtree (tree, path1, NULL));
1756 _dbus_assert (find_subtree (tree, path2, NULL));
1757 _dbus_assert (find_subtree (tree, path3, NULL));
1758 _dbus_assert (find_subtree (tree, path4, NULL));
1759 _dbus_assert (find_subtree (tree, path5, NULL));
1760 _dbus_assert (find_subtree (tree, path6, NULL));
1761 _dbus_assert (find_subtree (tree, path7, NULL));
1762 _dbus_assert (find_subtree (tree, path8, NULL));
1764 _dbus_object_tree_unregister_and_unlock (tree, path1);
1765 _dbus_assert (_dbus_object_tree_get_user_data_unlocked (tree, path1) == NULL);
1767 _dbus_assert (!find_subtree (tree, path0, NULL));
1768 _dbus_assert (!find_subtree (tree, path1, NULL));
1769 _dbus_assert (find_subtree (tree, path2, NULL));
1770 _dbus_assert (find_subtree (tree, path3, NULL));
1771 _dbus_assert (find_subtree (tree, path4, NULL));
1772 _dbus_assert (find_subtree (tree, path5, NULL));
1773 _dbus_assert (find_subtree (tree, path6, NULL));
1774 _dbus_assert (find_subtree (tree, path7, NULL));
1775 _dbus_assert (find_subtree (tree, path8, NULL));
1777 _dbus_object_tree_unregister_and_unlock (tree, path2);
1778 _dbus_assert (_dbus_object_tree_get_user_data_unlocked (tree, path2) == NULL);
1780 _dbus_assert (!find_subtree (tree, path0, NULL));
1781 _dbus_assert (!find_subtree (tree, path1, NULL));
1782 _dbus_assert (!find_subtree (tree, path2, NULL));
1783 _dbus_assert (find_subtree (tree, path3, NULL));
1784 _dbus_assert (find_subtree (tree, path4, NULL));
1785 _dbus_assert (find_subtree (tree, path5, NULL));
1786 _dbus_assert (find_subtree (tree, path6, NULL));
1787 _dbus_assert (find_subtree (tree, path7, NULL));
1788 _dbus_assert (find_subtree (tree, path8, NULL));
1790 _dbus_object_tree_unregister_and_unlock (tree, path3);
1791 _dbus_assert (_dbus_object_tree_get_user_data_unlocked (tree, path3) == NULL);
1793 _dbus_assert (!find_subtree (tree, path0, NULL));
1794 _dbus_assert (!find_subtree (tree, path1, NULL));
1795 _dbus_assert (!find_subtree (tree, path2, NULL));
1796 _dbus_assert (!find_subtree (tree, path3, NULL));
1797 _dbus_assert (find_subtree (tree, path4, NULL));
1798 _dbus_assert (find_subtree (tree, path5, NULL));
1799 _dbus_assert (find_subtree (tree, path6, NULL));
1800 _dbus_assert (find_subtree (tree, path7, NULL));
1801 _dbus_assert (find_subtree (tree, path8, NULL));
1803 _dbus_object_tree_unregister_and_unlock (tree, path4);
1804 _dbus_assert (_dbus_object_tree_get_user_data_unlocked (tree, path4) == NULL);
1806 _dbus_assert (!find_subtree (tree, path0, NULL));
1807 _dbus_assert (!find_subtree (tree, path1, NULL));
1808 _dbus_assert (!find_subtree (tree, path2, NULL));
1809 _dbus_assert (!find_subtree (tree, path3, NULL));
1810 _dbus_assert (!find_subtree (tree, path4, NULL));
1811 _dbus_assert (find_subtree (tree, path5, NULL));
1812 _dbus_assert (find_subtree (tree, path6, NULL));
1813 _dbus_assert (find_subtree (tree, path7, NULL));
1814 _dbus_assert (find_subtree (tree, path8, NULL));
1816 _dbus_object_tree_unregister_and_unlock (tree, path5);
1817 _dbus_assert (_dbus_object_tree_get_user_data_unlocked (tree, path5) == NULL);
1819 _dbus_assert (!find_subtree (tree, path0, NULL));
1820 _dbus_assert (!find_subtree (tree, path1, NULL));
1821 _dbus_assert (!find_subtree (tree, path2, NULL));
1822 _dbus_assert (!find_subtree (tree, path3, NULL));
1823 _dbus_assert (!find_subtree (tree, path4, NULL));
1824 _dbus_assert (!find_subtree (tree, path5, NULL));
1825 _dbus_assert (find_subtree (tree, path6, NULL));
1826 _dbus_assert (find_subtree (tree, path7, NULL));
1827 _dbus_assert (find_subtree (tree, path8, NULL));
1829 _dbus_object_tree_unregister_and_unlock (tree, path6);
1830 _dbus_assert (_dbus_object_tree_get_user_data_unlocked (tree, path6) == NULL);
1832 _dbus_assert (!find_subtree (tree, path0, NULL));
1833 _dbus_assert (!find_subtree (tree, path1, NULL));
1834 _dbus_assert (!find_subtree (tree, path2, NULL));
1835 _dbus_assert (!find_subtree (tree, path3, NULL));
1836 _dbus_assert (!find_subtree (tree, path4, NULL));
1837 _dbus_assert (!find_subtree (tree, path5, NULL));
1838 _dbus_assert (!find_subtree (tree, path6, NULL));
1839 _dbus_assert (find_subtree (tree, path7, NULL));
1840 _dbus_assert (find_subtree (tree, path8, NULL));
1842 _dbus_object_tree_unregister_and_unlock (tree, path7);
1843 _dbus_assert (_dbus_object_tree_get_user_data_unlocked (tree, path7) == NULL);
1845 _dbus_assert (!find_subtree (tree, path0, NULL));
1846 _dbus_assert (!find_subtree (tree, path1, NULL));
1847 _dbus_assert (!find_subtree (tree, path2, NULL));
1848 _dbus_assert (!find_subtree (tree, path3, NULL));
1849 _dbus_assert (!find_subtree (tree, path4, NULL));
1850 _dbus_assert (!find_subtree (tree, path5, NULL));
1851 _dbus_assert (!find_subtree (tree, path6, NULL));
1852 _dbus_assert (!find_subtree (tree, path7, NULL));
1853 _dbus_assert (find_subtree (tree, path8, NULL));
1855 _dbus_object_tree_unregister_and_unlock (tree, path8);
1856 _dbus_assert (_dbus_object_tree_get_user_data_unlocked (tree, path8) == NULL);
1858 _dbus_assert (!find_subtree (tree, path0, NULL));
1859 _dbus_assert (!find_subtree (tree, path1, NULL));
1860 _dbus_assert (!find_subtree (tree, path2, NULL));
1861 _dbus_assert (!find_subtree (tree, path3, NULL));
1862 _dbus_assert (!find_subtree (tree, path4, NULL));
1863 _dbus_assert (!find_subtree (tree, path5, NULL));
1864 _dbus_assert (!find_subtree (tree, path6, NULL));
1865 _dbus_assert (!find_subtree (tree, path7, NULL));
1866 _dbus_assert (!find_subtree (tree, path8, NULL));
1869 while (i < (int) _DBUS_N_ELEMENTS (tree_test_data))
1871 _dbus_assert (tree_test_data[i].handler_unregistered);
1872 _dbus_assert (!tree_test_data[i].message_handled);
1876 /* Register it all again, and test dispatch */
1878 if (!do_register (tree, path0, TRUE, 0, tree_test_data))
1880 if (!do_register (tree, path1, FALSE, 1, tree_test_data))
1882 if (!do_register (tree, path2, TRUE, 2, tree_test_data))
1884 if (!do_register (tree, path3, TRUE, 3, tree_test_data))
1886 if (!do_register (tree, path4, TRUE, 4, tree_test_data))
1888 if (!do_register (tree, path5, TRUE, 5, tree_test_data))
1890 if (!do_register (tree, path6, FALSE, 6, tree_test_data))
1892 if (!do_register (tree, path7, TRUE, 7, tree_test_data))
1894 if (!do_register (tree, path8, TRUE, 8, tree_test_data))
1901 if (!do_test_dispatch (tree, path0, 0, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1903 if (!do_test_dispatch (tree, path1, 1, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1905 if (!do_test_dispatch (tree, path2, 2, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1907 if (!do_test_dispatch (tree, path3, 3, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1909 if (!do_test_dispatch (tree, path4, 4, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1911 if (!do_test_dispatch (tree, path5, 5, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1913 if (!do_test_dispatch (tree, path6, 6, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1915 if (!do_test_dispatch (tree, path7, 7, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1917 if (!do_test_dispatch (tree, path8, 8, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1924 _dbus_object_tree_ref (tree);
1925 _dbus_object_tree_unref (tree);
1926 _dbus_object_tree_unref (tree);
1933 * @ingroup DBusObjectTree
1934 * Unit test for DBusObjectTree
1935 * @returns #TRUE on success.
1938 _dbus_object_tree_test (void)
1940 _dbus_test_oom_handling ("object tree",
1941 object_tree_test_iteration,
1947 #endif /* !DOXYGEN_SHOULD_SKIP_THIS */
1949 #endif /* DBUS_BUILD_TESTS */