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);
376 return find_subtree_recurse (tree->root, path, FALSE, NULL, exact_match);
379 static DBusObjectSubtree*
380 ensure_subtree (DBusObjectTree *tree,
384 _dbus_verbose ("Ensuring subtree\n");
386 return find_subtree_recurse (tree->root, path, TRUE, NULL, NULL);
390 * Registers a new subtree in the global object tree.
392 * @param tree the global object tree
393 * @param fallback #TRUE to handle messages to children of this path
394 * @param path NULL-terminated array of path elements giving path to subtree
395 * @param vtable the vtable used to traverse this subtree
396 * @param user_data user data to pass to methods in the vtable
397 * @returns #FALSE if not enough memory
400 _dbus_object_tree_register (DBusObjectTree *tree,
401 dbus_bool_t fallback,
403 const DBusObjectPathVTable *vtable,
406 DBusObjectSubtree *subtree;
408 _dbus_assert (tree != NULL);
409 _dbus_assert (vtable->message_function != NULL);
410 _dbus_assert (path != NULL);
412 subtree = ensure_subtree (tree, path);
416 #ifndef DBUS_DISABLE_CHECKS
417 if (subtree->message_function != NULL)
419 _dbus_warn ("A handler is already registered for the path starting with path[0] = \"%s\"\n",
420 path[0] ? path[0] : "null");
424 _dbus_assert (subtree->message_function == NULL);
427 subtree->message_function = vtable->message_function;
428 subtree->unregister_function = vtable->unregister_function;
429 subtree->user_data = user_data;
430 subtree->invoke_as_fallback = fallback != FALSE;
436 * Unregisters an object subtree that was registered with the
439 * @param tree the global object tree
440 * @param path path to the subtree (same as the one passed to _dbus_object_tree_register())
443 _dbus_object_tree_unregister_and_unlock (DBusObjectTree *tree,
447 DBusObjectSubtree *subtree;
448 DBusObjectPathUnregisterFunction unregister_function;
450 DBusConnection *connection;
452 _dbus_assert (path != NULL);
454 unregister_function = NULL;
457 subtree = find_subtree (tree, path, &i);
459 #ifndef DBUS_DISABLE_CHECKS
462 _dbus_warn ("Attempted to unregister path (path[0] = %s path[1] = %s) which isn't registered\n",
463 path[0] ? path[0] : "null",
464 path[1] ? path[1] : "null");
468 _dbus_assert (subtree != NULL);
471 _dbus_assert (subtree->parent == NULL ||
472 (i >= 0 && subtree->parent->subtrees[i] == subtree));
474 subtree->message_function = NULL;
476 unregister_function = subtree->unregister_function;
477 user_data = subtree->user_data;
479 subtree->unregister_function = NULL;
480 subtree->user_data = NULL;
482 /* If we have no subtrees of our own, remove from
483 * our parent (FIXME could also be more aggressive
484 * and remove our parent if it becomes empty)
486 if (subtree->parent && subtree->n_subtrees == 0)
488 /* assumes a 0-byte memmove is OK */
489 memmove (&subtree->parent->subtrees[i],
490 &subtree->parent->subtrees[i+1],
491 (subtree->parent->n_subtrees - i - 1) *
492 sizeof (subtree->parent->subtrees[0]));
493 subtree->parent->n_subtrees -= 1;
495 subtree->parent = NULL;
497 _dbus_object_subtree_unref (subtree);
502 connection = tree->connection;
504 /* Unlock and call application code */
505 #ifdef DBUS_BUILD_TESTS
509 _dbus_connection_ref_unlocked (connection);
510 _dbus_verbose ("unlock %s\n", _DBUS_FUNCTION_NAME);
511 _dbus_connection_unlock (connection);
514 if (unregister_function)
515 (* unregister_function) (connection, user_data);
517 #ifdef DBUS_BUILD_TESTS
520 dbus_connection_unref (connection);
524 free_subtree_recurse (DBusConnection *connection,
525 DBusObjectSubtree *subtree)
527 /* Delete them from the end, for slightly
528 * more robustness against odd reentrancy.
530 while (subtree->n_subtrees > 0)
532 DBusObjectSubtree *child;
534 child = subtree->subtrees[subtree->n_subtrees - 1];
535 subtree->subtrees[subtree->n_subtrees - 1] = NULL;
536 subtree->n_subtrees -= 1;
537 child->parent = NULL;
539 free_subtree_recurse (connection, child);
542 /* Call application code */
543 if (subtree->unregister_function)
544 (* subtree->unregister_function) (connection,
547 subtree->message_function = NULL;
548 subtree->unregister_function = NULL;
549 subtree->user_data = NULL;
551 /* Now free ourselves */
552 _dbus_object_subtree_unref (subtree);
556 * Free all the handlers in the tree. Lock on tree's connection
559 * @param tree the object tree
562 _dbus_object_tree_free_all_unlocked (DBusObjectTree *tree)
565 free_subtree_recurse (tree->connection,
571 _dbus_object_tree_list_registered_unlocked (DBusObjectTree *tree,
572 const char **parent_path,
573 char ***child_entries)
575 DBusObjectSubtree *subtree;
578 _dbus_assert (parent_path != NULL);
579 _dbus_assert (child_entries != NULL);
581 *child_entries = NULL;
583 subtree = lookup_subtree (tree, parent_path);
586 retval = dbus_new0 (char *, 1);
591 retval = dbus_new0 (char*, subtree->n_subtrees + 1);
595 while (i < subtree->n_subtrees)
597 retval[i] = _dbus_strdup (subtree->subtrees[i]->name);
598 if (retval[i] == NULL)
600 dbus_free_string_array (retval);
610 *child_entries = retval;
611 return retval != NULL;
614 static DBusHandlerResult
615 handle_default_introspect_and_unlock (DBusObjectTree *tree,
616 DBusMessage *message,
620 DBusHandlerResult result;
624 DBusMessageIter iter;
625 const char *v_STRING;
626 dbus_bool_t already_unlocked;
628 /* We have the connection lock here */
630 already_unlocked = FALSE;
632 _dbus_verbose (" considering default Introspect() handler...\n");
636 if (!dbus_message_is_method_call (message,
637 DBUS_INTERFACE_INTROSPECTABLE,
640 #ifdef DBUS_BUILD_TESTS
641 if (tree->connection)
644 _dbus_verbose ("unlock %s %d\n", _DBUS_FUNCTION_NAME, __LINE__);
645 _dbus_connection_unlock (tree->connection);
648 return DBUS_HANDLER_RESULT_NOT_YET_HANDLED;
651 _dbus_verbose (" using default Introspect() handler!\n");
653 if (!_dbus_string_init (&xml))
655 #ifdef DBUS_BUILD_TESTS
656 if (tree->connection)
659 _dbus_verbose ("unlock %s %d\n", _DBUS_FUNCTION_NAME, __LINE__);
660 _dbus_connection_unlock (tree->connection);
663 return DBUS_HANDLER_RESULT_NEED_MEMORY;
666 result = DBUS_HANDLER_RESULT_NEED_MEMORY;
669 if (!_dbus_object_tree_list_registered_unlocked (tree, path, &children))
672 if (!_dbus_string_append (&xml, DBUS_INTROSPECT_1_0_XML_DOCTYPE_DECL_NODE))
675 if (!_dbus_string_append (&xml, "<node>\n"))
679 while (children[i] != NULL)
681 if (!_dbus_string_append_printf (&xml, " <node name=\"%s\"/>\n",
688 if (!_dbus_string_append (&xml, "</node>\n"))
691 reply = dbus_message_new_method_return (message);
695 dbus_message_iter_init_append (reply, &iter);
696 v_STRING = _dbus_string_get_const_data (&xml);
697 if (!dbus_message_iter_append_basic (&iter, DBUS_TYPE_STRING, &v_STRING))
700 #ifdef DBUS_BUILD_TESTS
701 if (tree->connection)
704 already_unlocked = TRUE;
706 if (!_dbus_connection_send_and_unlock (tree->connection, reply, NULL))
710 result = DBUS_HANDLER_RESULT_HANDLED;
713 #ifdef DBUS_BUILD_TESTS
714 if (tree->connection)
717 if (!already_unlocked)
719 _dbus_verbose ("unlock %s %d\n", _DBUS_FUNCTION_NAME, __LINE__);
720 _dbus_connection_unlock (tree->connection);
724 _dbus_string_free (&xml);
725 dbus_free_string_array (children);
727 dbus_message_unref (reply);
733 * Tries to dispatch a message by directing it to handler for the
734 * object path listed in the message header, if any. Messages are
735 * dispatched first to the registered handler that matches the largest
736 * number of path elements; that is, message to /foo/bar/baz would go
737 * to the handler for /foo/bar before the one for /foo.
739 * @todo thread problems
741 * @param tree the global object tree
742 * @param message the message to dispatch
743 * @returns whether message was handled successfully
746 _dbus_object_tree_dispatch_and_unlock (DBusObjectTree *tree,
747 DBusMessage *message)
750 dbus_bool_t exact_match;
753 DBusHandlerResult result;
754 DBusObjectSubtree *subtree;
757 _dbus_verbose ("Dispatch of message by object path\n");
761 if (!dbus_message_get_path_decomposed (message, &path))
763 #ifdef DBUS_BUILD_TESTS
764 if (tree->connection)
767 _dbus_verbose ("unlock %s\n", _DBUS_FUNCTION_NAME);
768 _dbus_connection_unlock (tree->connection);
771 _dbus_verbose ("No memory to get decomposed path\n");
773 return DBUS_HANDLER_RESULT_NEED_MEMORY;
778 #ifdef DBUS_BUILD_TESTS
779 if (tree->connection)
782 _dbus_verbose ("unlock %s\n", _DBUS_FUNCTION_NAME);
783 _dbus_connection_unlock (tree->connection);
786 _dbus_verbose ("No path field in message\n");
787 return DBUS_HANDLER_RESULT_NOT_YET_HANDLED;
790 /* Find the deepest path that covers the path in the message */
791 subtree = find_handler (tree, (const char**) path, &exact_match);
793 /* Build a list of all paths that cover the path in the message */
797 while (subtree != NULL)
799 if (subtree->message_function != NULL && (exact_match || subtree->invoke_as_fallback))
801 _dbus_object_subtree_ref (subtree);
803 /* run deepest paths first */
804 if (!_dbus_list_append (&list, subtree))
806 result = DBUS_HANDLER_RESULT_NEED_MEMORY;
807 _dbus_object_subtree_unref (subtree);
808 goto free_and_return;
813 subtree = subtree->parent;
816 _dbus_verbose ("%d handlers in the path tree for this message\n",
817 _dbus_list_get_length (&list));
819 /* Invoke each handler in the list */
821 result = DBUS_HANDLER_RESULT_NOT_YET_HANDLED;
823 link = _dbus_list_get_first_link (&list);
826 DBusList *next = _dbus_list_get_next_link (&list, link);
827 subtree = link->data;
829 /* message_function is NULL if we're unregistered
832 if (subtree->message_function)
834 DBusObjectPathMessageFunction message_function;
837 message_function = subtree->message_function;
838 user_data = subtree->user_data;
841 _dbus_verbose (" (invoking a handler)\n");
844 #ifdef DBUS_BUILD_TESTS
845 if (tree->connection)
848 _dbus_verbose ("unlock %s\n", _DBUS_FUNCTION_NAME);
849 _dbus_connection_unlock (tree->connection);
852 /* FIXME you could unregister the subtree in another thread
853 * before we invoke the callback, and I can't figure out a
854 * good way to solve this.
857 result = (* message_function) (tree->connection,
861 #ifdef DBUS_BUILD_TESTS
862 if (tree->connection)
864 _dbus_connection_lock (tree->connection);
866 if (result != DBUS_HANDLER_RESULT_NOT_YET_HANDLED)
867 goto free_and_return;
875 if (result == DBUS_HANDLER_RESULT_NOT_YET_HANDLED)
877 /* This hardcoded default handler does a minimal Introspect()
879 result = handle_default_introspect_and_unlock (tree, message,
880 (const char**) path);
884 #ifdef DBUS_BUILD_TESTS
885 if (tree->connection)
888 _dbus_verbose ("unlock %s\n", _DBUS_FUNCTION_NAME);
889 _dbus_connection_unlock (tree->connection);
895 link = _dbus_list_get_first_link (&list);
896 _dbus_object_subtree_unref (link->data);
897 _dbus_list_remove_link (&list, link);
900 dbus_free_string_array (path);
906 * Allocates a subtree object.
908 * @param name name to duplicate.
909 * @returns newly-allocated subtree
911 static DBusObjectSubtree*
912 allocate_subtree_object (const char *name)
915 DBusObjectSubtree *subtree;
916 const size_t front_padding = _DBUS_STRUCT_OFFSET (DBusObjectSubtree, name);
918 _dbus_assert (name != NULL);
922 subtree = dbus_malloc (front_padding + (len + 1));
927 memcpy (subtree->name, name, len + 1);
932 static DBusObjectSubtree*
933 _dbus_object_subtree_new (const char *name,
934 const DBusObjectPathVTable *vtable,
937 DBusObjectSubtree *subtree;
939 subtree = allocate_subtree_object (name);
943 _dbus_assert (name != NULL);
945 subtree->parent = NULL;
949 subtree->message_function = vtable->message_function;
950 subtree->unregister_function = vtable->unregister_function;
954 subtree->message_function = NULL;
955 subtree->unregister_function = NULL;
958 subtree->user_data = user_data;
959 subtree->refcount.value = 1;
960 subtree->subtrees = NULL;
961 subtree->n_subtrees = 0;
962 subtree->subtrees_sorted = TRUE;
963 subtree->invoke_as_fallback = FALSE;
976 static DBusObjectSubtree *
977 _dbus_object_subtree_ref (DBusObjectSubtree *subtree)
979 _dbus_assert (subtree->refcount.value > 0);
980 _dbus_atomic_inc (&subtree->refcount);
986 _dbus_object_subtree_unref (DBusObjectSubtree *subtree)
988 _dbus_assert (subtree->refcount.value > 0);
990 if (_dbus_atomic_dec (&subtree->refcount) == 1)
992 _dbus_assert (subtree->unregister_function == NULL);
993 _dbus_assert (subtree->message_function == NULL);
995 dbus_free (subtree->subtrees);
1001 * Lists the registered fallback handlers and object path handlers at
1002 * the given parent_path. The returned array should be freed with
1003 * dbus_free_string_array().
1005 * @param tree the object tree
1006 * @param parent_path the path to list the child handlers of
1007 * @param child_entries returns #NULL-terminated array of children
1008 * @returns #FALSE if no memory to allocate the child entries
1011 _dbus_object_tree_list_registered_and_unlock (DBusObjectTree *tree,
1012 const char **parent_path,
1013 char ***child_entries)
1017 result = _dbus_object_tree_list_registered_unlocked (tree,
1021 #ifdef DBUS_BUILD_TESTS
1022 if (tree->connection)
1025 _dbus_verbose ("unlock %s\n", _DBUS_FUNCTION_NAME);
1026 _dbus_connection_unlock (tree->connection);
1033 /** Set to 1 to get a bunch of spew about disassembling the path string */
1034 #define VERBOSE_DECOMPOSE 0
1037 * Decompose an object path. A path of just "/" is
1038 * represented as an empty vector of strings.
1039 * The path need not be nul terminated.
1041 * @param data the path data
1042 * @param len the length of the path string
1043 * @param path address to store new object path
1044 * @param path_len length of stored path
1047 _dbus_decompose_path (const char* data,
1056 _dbus_assert (data != NULL);
1058 #if VERBOSE_DECOMPOSE
1059 _dbus_verbose ("Decomposing path \"%s\"\n",
1064 if (len > 1) /* if path is not just "/" */
1075 retval = dbus_new0 (char*, n_components + 1);
1081 if (n_components == 0)
1085 while (comp < n_components)
1087 _dbus_assert (i < len);
1093 while (j < len && data[j] != '/')
1096 /* Now [i, j) is the path component */
1097 _dbus_assert (i < j);
1098 _dbus_assert (data[i] != '/');
1099 _dbus_assert (j == len || data[j] == '/');
1101 #if VERBOSE_DECOMPOSE
1102 _dbus_verbose (" (component in [%d,%d))\n",
1106 retval[comp] = _dbus_memdup (&data[i], j - i + 1);
1107 if (retval[comp] == NULL)
1109 dbus_free_string_array (retval);
1112 retval[comp][j-i] = '\0';
1113 #if VERBOSE_DECOMPOSE
1114 _dbus_verbose (" (component %d = \"%s\")\n",
1115 comp, retval[comp]);
1121 _dbus_assert (i == len);
1125 *path_len = n_components;
1132 #ifdef DBUS_BUILD_TESTS
1133 #include "dbus-test.h"
1137 flatten_path (const char **path)
1142 if (!_dbus_string_init (&str))
1145 if (path[0] == NULL)
1147 if (!_dbus_string_append_byte (&str, '/'))
1157 if (!_dbus_string_append_byte (&str, '/'))
1160 if (!_dbus_string_append (&str, path[i]))
1167 if (!_dbus_string_steal_data (&str, &s))
1170 _dbus_string_free (&str);
1175 _dbus_string_free (&str);
1187 /* Returns TRUE if container is a parent of child
1189 static StrComparison
1190 path_contains (const char **container,
1196 while (child[i] != NULL)
1200 if (container[i] == NULL)
1201 return STR_PREFIX; /* container ran out, child continues;
1202 * thus the container is a parent of the
1206 _dbus_assert (container[i] != NULL);
1207 _dbus_assert (child[i] != NULL);
1209 v = strcmp (container[i], child[i]);
1212 return STR_DIFFERENT; /* they overlap until here and then are different,
1219 /* Child ran out; if container also did, they are equal;
1220 * otherwise, the child is a parent of the container.
1222 if (container[i] == NULL)
1225 return STR_DIFFERENT;
1230 spew_subtree_recurse (DBusObjectSubtree *subtree,
1238 _dbus_verbose (" ");
1242 _dbus_verbose ("%s (%d children)\n",
1243 subtree->name, subtree->n_subtrees);
1246 while (i < subtree->n_subtrees)
1248 spew_subtree_recurse (subtree->subtrees[i], indent + 2);
1255 spew_tree (DBusObjectTree *tree)
1257 spew_subtree_recurse (tree->root, 0);
1262 * Callback data used in tests
1266 const char **path; /**< Path */
1267 dbus_bool_t handler_fallback; /**< true if the handler may be called as fallback */
1268 dbus_bool_t message_handled; /**< Gets set to true if message handler called */
1269 dbus_bool_t handler_unregistered; /**< gets set to true if handler is unregistered */
1274 test_unregister_function (DBusConnection *connection,
1277 TreeTestData *ttd = user_data;
1279 ttd->handler_unregistered = TRUE;
1282 static DBusHandlerResult
1283 test_message_function (DBusConnection *connection,
1284 DBusMessage *message,
1287 TreeTestData *ttd = user_data;
1289 ttd->message_handled = TRUE;
1291 return DBUS_HANDLER_RESULT_NOT_YET_HANDLED;
1295 do_register (DBusObjectTree *tree,
1297 dbus_bool_t fallback,
1299 TreeTestData *tree_test_data)
1301 DBusObjectPathVTable vtable = { test_unregister_function,
1302 test_message_function, NULL };
1304 tree_test_data[i].message_handled = FALSE;
1305 tree_test_data[i].handler_unregistered = FALSE;
1306 tree_test_data[i].handler_fallback = fallback;
1307 tree_test_data[i].path = path;
1309 if (!_dbus_object_tree_register (tree, fallback, path,
1311 &tree_test_data[i]))
1318 do_test_dispatch (DBusObjectTree *tree,
1321 TreeTestData *tree_test_data,
1324 DBusMessage *message;
1326 DBusHandlerResult result;
1331 flat = flatten_path (path);
1335 message = dbus_message_new_method_call (NULL,
1337 "org.freedesktop.TestInterface",
1340 if (message == NULL)
1344 while (j < n_test_data)
1346 tree_test_data[j].message_handled = FALSE;
1350 result = _dbus_object_tree_dispatch_and_unlock (tree, message);
1351 if (result == DBUS_HANDLER_RESULT_NEED_MEMORY)
1354 _dbus_assert (tree_test_data[i].message_handled);
1357 while (j < n_test_data)
1359 if (tree_test_data[j].message_handled)
1361 if (tree_test_data[j].handler_fallback)
1362 _dbus_assert (path_contains (tree_test_data[j].path,
1363 path) != STR_DIFFERENT);
1365 _dbus_assert (path_contains (tree_test_data[j].path, path) == STR_EQUAL);
1369 if (tree_test_data[j].handler_fallback)
1370 _dbus_assert (path_contains (tree_test_data[j].path,
1371 path) == STR_DIFFERENT);
1373 _dbus_assert (path_contains (tree_test_data[j].path, path) != STR_EQUAL);
1379 dbus_message_unref (message);
1385 dbus_message_unref (message);
1390 string_array_length (const char **array)
1393 for (i = 0; array[i]; i++) ;
1400 const char *result[20];
1401 } DecomposePathTest;
1403 static DecomposePathTest decompose_tests[] = {
1404 { "/foo", { "foo", NULL } },
1405 { "/foo/bar", { "foo", "bar", NULL } },
1407 { "/a/b", { "a", "b", NULL } },
1408 { "/a/b/c", { "a", "b", "c", NULL } },
1409 { "/a/b/c/d", { "a", "b", "c", "d", NULL } },
1410 { "/foo/bar/q", { "foo", "bar", "q", NULL } },
1411 { "/foo/bar/this/is/longer", { "foo", "bar", "this", "is", "longer", NULL } }
1415 run_decompose_tests (void)
1420 while (i < _DBUS_N_ELEMENTS (decompose_tests))
1426 if (!_dbus_decompose_path (decompose_tests[i].path,
1427 strlen (decompose_tests[i].path),
1428 &result, &result_len))
1431 expected_len = string_array_length (decompose_tests[i].result);
1433 if (result_len != (int) string_array_length ((const char**)result) ||
1434 expected_len != result_len ||
1435 path_contains (decompose_tests[i].result,
1436 (const char**) result) != STR_EQUAL)
1438 int real_len = string_array_length ((const char**)result);
1439 _dbus_warn ("Expected decompose of %s to have len %d, returned %d, appears to have %d\n",
1440 decompose_tests[i].path, expected_len, result_len,
1442 _dbus_warn ("Decompose resulted in elements: { ");
1444 while (i < real_len)
1446 _dbus_warn ("\"%s\"%s", result[i],
1447 (i + 1) == real_len ? "" : ", ");
1451 _dbus_assert_not_reached ("path decompose failed\n");
1454 dbus_free_string_array (result);
1463 object_tree_test_iteration (void *data)
1465 const char *path0[] = { NULL };
1466 const char *path1[] = { "foo", NULL };
1467 const char *path2[] = { "foo", "bar", NULL };
1468 const char *path3[] = { "foo", "bar", "baz", NULL };
1469 const char *path4[] = { "foo", "bar", "boo", NULL };
1470 const char *path5[] = { "blah", NULL };
1471 const char *path6[] = { "blah", "boof", NULL };
1472 const char *path7[] = { "blah", "boof", "this", "is", "really", "long", NULL };
1473 const char *path8[] = { "childless", NULL };
1474 DBusObjectTree *tree;
1475 TreeTestData tree_test_data[9];
1477 dbus_bool_t exact_match;
1479 if (!run_decompose_tests ())
1484 tree = _dbus_object_tree_new (NULL);
1488 if (!do_register (tree, path0, TRUE, 0, tree_test_data))
1491 _dbus_assert (find_subtree (tree, path0, NULL));
1492 _dbus_assert (!find_subtree (tree, path1, NULL));
1493 _dbus_assert (!find_subtree (tree, path2, NULL));
1494 _dbus_assert (!find_subtree (tree, path3, NULL));
1495 _dbus_assert (!find_subtree (tree, path4, NULL));
1496 _dbus_assert (!find_subtree (tree, path5, NULL));
1497 _dbus_assert (!find_subtree (tree, path6, NULL));
1498 _dbus_assert (!find_subtree (tree, path7, NULL));
1499 _dbus_assert (!find_subtree (tree, path8, NULL));
1501 _dbus_assert (find_handler (tree, path0, &exact_match) && exact_match);
1502 _dbus_assert (find_handler (tree, path1, &exact_match) == tree->root && !exact_match);
1503 _dbus_assert (find_handler (tree, path2, &exact_match) == tree->root && !exact_match);
1504 _dbus_assert (find_handler (tree, path3, &exact_match) == tree->root && !exact_match);
1505 _dbus_assert (find_handler (tree, path4, &exact_match) == tree->root && !exact_match);
1506 _dbus_assert (find_handler (tree, path5, &exact_match) == tree->root && !exact_match);
1507 _dbus_assert (find_handler (tree, path6, &exact_match) == tree->root && !exact_match);
1508 _dbus_assert (find_handler (tree, path7, &exact_match) == tree->root && !exact_match);
1509 _dbus_assert (find_handler (tree, path8, &exact_match) == tree->root && !exact_match);
1511 if (!do_register (tree, path1, TRUE, 1, tree_test_data))
1514 _dbus_assert (find_subtree (tree, path0, NULL));
1515 _dbus_assert (find_subtree (tree, path1, NULL));
1516 _dbus_assert (!find_subtree (tree, path2, NULL));
1517 _dbus_assert (!find_subtree (tree, path3, NULL));
1518 _dbus_assert (!find_subtree (tree, path4, NULL));
1519 _dbus_assert (!find_subtree (tree, path5, NULL));
1520 _dbus_assert (!find_subtree (tree, path6, NULL));
1521 _dbus_assert (!find_subtree (tree, path7, NULL));
1522 _dbus_assert (!find_subtree (tree, path8, NULL));
1524 _dbus_assert (find_handler (tree, path0, &exact_match) && exact_match);
1525 _dbus_assert (find_handler (tree, path1, &exact_match) && exact_match);
1526 _dbus_assert (find_handler (tree, path2, &exact_match) && !exact_match);
1527 _dbus_assert (find_handler (tree, path3, &exact_match) && !exact_match);
1528 _dbus_assert (find_handler (tree, path4, &exact_match) && !exact_match);
1529 _dbus_assert (find_handler (tree, path5, &exact_match) == tree->root && !exact_match);
1530 _dbus_assert (find_handler (tree, path6, &exact_match) == tree->root && !exact_match);
1531 _dbus_assert (find_handler (tree, path7, &exact_match) == tree->root && !exact_match);
1532 _dbus_assert (find_handler (tree, path8, &exact_match) == tree->root && !exact_match);
1534 if (!do_register (tree, path2, TRUE, 2, tree_test_data))
1537 _dbus_assert (find_subtree (tree, path1, NULL));
1538 _dbus_assert (find_subtree (tree, path2, NULL));
1539 _dbus_assert (!find_subtree (tree, path3, NULL));
1540 _dbus_assert (!find_subtree (tree, path4, NULL));
1541 _dbus_assert (!find_subtree (tree, path5, NULL));
1542 _dbus_assert (!find_subtree (tree, path6, NULL));
1543 _dbus_assert (!find_subtree (tree, path7, NULL));
1544 _dbus_assert (!find_subtree (tree, path8, NULL));
1546 if (!do_register (tree, path3, TRUE, 3, tree_test_data))
1549 _dbus_assert (find_subtree (tree, path0, NULL));
1550 _dbus_assert (find_subtree (tree, path1, NULL));
1551 _dbus_assert (find_subtree (tree, path2, NULL));
1552 _dbus_assert (find_subtree (tree, path3, NULL));
1553 _dbus_assert (!find_subtree (tree, path4, NULL));
1554 _dbus_assert (!find_subtree (tree, path5, NULL));
1555 _dbus_assert (!find_subtree (tree, path6, NULL));
1556 _dbus_assert (!find_subtree (tree, path7, NULL));
1557 _dbus_assert (!find_subtree (tree, path8, NULL));
1559 if (!do_register (tree, path4, TRUE, 4, tree_test_data))
1562 _dbus_assert (find_subtree (tree, path0, NULL));
1563 _dbus_assert (find_subtree (tree, path1, NULL));
1564 _dbus_assert (find_subtree (tree, path2, NULL));
1565 _dbus_assert (find_subtree (tree, path3, NULL));
1566 _dbus_assert (find_subtree (tree, path4, NULL));
1567 _dbus_assert (!find_subtree (tree, path5, NULL));
1568 _dbus_assert (!find_subtree (tree, path6, NULL));
1569 _dbus_assert (!find_subtree (tree, path7, NULL));
1570 _dbus_assert (!find_subtree (tree, path8, NULL));
1572 if (!do_register (tree, path5, TRUE, 5, tree_test_data))
1575 _dbus_assert (find_subtree (tree, path0, NULL));
1576 _dbus_assert (find_subtree (tree, path1, NULL));
1577 _dbus_assert (find_subtree (tree, path2, NULL));
1578 _dbus_assert (find_subtree (tree, path3, NULL));
1579 _dbus_assert (find_subtree (tree, path4, NULL));
1580 _dbus_assert (find_subtree (tree, path5, NULL));
1581 _dbus_assert (!find_subtree (tree, path6, NULL));
1582 _dbus_assert (!find_subtree (tree, path7, NULL));
1583 _dbus_assert (!find_subtree (tree, path8, NULL));
1585 _dbus_assert (find_handler (tree, path0, &exact_match) == tree->root && exact_match);
1586 _dbus_assert (find_handler (tree, path1, &exact_match) != tree->root && exact_match);
1587 _dbus_assert (find_handler (tree, path2, &exact_match) != tree->root && exact_match);
1588 _dbus_assert (find_handler (tree, path3, &exact_match) != tree->root && exact_match);
1589 _dbus_assert (find_handler (tree, path4, &exact_match) != tree->root && exact_match);
1590 _dbus_assert (find_handler (tree, path5, &exact_match) != tree->root && exact_match);
1591 _dbus_assert (find_handler (tree, path6, &exact_match) != tree->root && !exact_match);
1592 _dbus_assert (find_handler (tree, path7, &exact_match) != tree->root && !exact_match);
1593 _dbus_assert (find_handler (tree, path8, &exact_match) == tree->root && !exact_match);
1595 if (!do_register (tree, path6, TRUE, 6, tree_test_data))
1598 _dbus_assert (find_subtree (tree, path0, NULL));
1599 _dbus_assert (find_subtree (tree, path1, NULL));
1600 _dbus_assert (find_subtree (tree, path2, NULL));
1601 _dbus_assert (find_subtree (tree, path3, NULL));
1602 _dbus_assert (find_subtree (tree, path4, NULL));
1603 _dbus_assert (find_subtree (tree, path5, NULL));
1604 _dbus_assert (find_subtree (tree, path6, NULL));
1605 _dbus_assert (!find_subtree (tree, path7, NULL));
1606 _dbus_assert (!find_subtree (tree, path8, NULL));
1608 if (!do_register (tree, path7, TRUE, 7, tree_test_data))
1611 _dbus_assert (find_subtree (tree, path0, NULL));
1612 _dbus_assert (find_subtree (tree, path1, NULL));
1613 _dbus_assert (find_subtree (tree, path2, NULL));
1614 _dbus_assert (find_subtree (tree, path3, NULL));
1615 _dbus_assert (find_subtree (tree, path4, NULL));
1616 _dbus_assert (find_subtree (tree, path5, NULL));
1617 _dbus_assert (find_subtree (tree, path6, NULL));
1618 _dbus_assert (find_subtree (tree, path7, NULL));
1619 _dbus_assert (!find_subtree (tree, path8, NULL));
1621 if (!do_register (tree, path8, TRUE, 8, tree_test_data))
1624 _dbus_assert (find_subtree (tree, path0, NULL));
1625 _dbus_assert (find_subtree (tree, path1, NULL));
1626 _dbus_assert (find_subtree (tree, path2, NULL));
1627 _dbus_assert (find_subtree (tree, path3, NULL));
1628 _dbus_assert (find_subtree (tree, path4, NULL));
1629 _dbus_assert (find_subtree (tree, path5, NULL));
1630 _dbus_assert (find_subtree (tree, path6, NULL));
1631 _dbus_assert (find_subtree (tree, path7, NULL));
1632 _dbus_assert (find_subtree (tree, path8, NULL));
1634 _dbus_assert (find_handler (tree, path0, &exact_match) == tree->root && exact_match);
1635 _dbus_assert (find_handler (tree, path1, &exact_match) != tree->root && exact_match);
1636 _dbus_assert (find_handler (tree, path2, &exact_match) != tree->root && exact_match);
1637 _dbus_assert (find_handler (tree, path3, &exact_match) != tree->root && exact_match);
1638 _dbus_assert (find_handler (tree, path4, &exact_match) != tree->root && exact_match);
1639 _dbus_assert (find_handler (tree, path5, &exact_match) != tree->root && exact_match);
1640 _dbus_assert (find_handler (tree, path6, &exact_match) != tree->root && exact_match);
1641 _dbus_assert (find_handler (tree, path7, &exact_match) != tree->root && exact_match);
1642 _dbus_assert (find_handler (tree, path8, &exact_match) != tree->root && exact_match);
1644 /* test the list_registered function */
1647 const char *root[] = { NULL };
1648 char **child_entries;
1651 _dbus_object_tree_list_registered_unlocked (tree, path1, &child_entries);
1652 if (child_entries != NULL)
1654 nb = string_array_length ((const char**)child_entries);
1655 _dbus_assert (nb == 1);
1656 dbus_free_string_array (child_entries);
1659 _dbus_object_tree_list_registered_unlocked (tree, path2, &child_entries);
1660 if (child_entries != NULL)
1662 nb = string_array_length ((const char**)child_entries);
1663 _dbus_assert (nb == 2);
1664 dbus_free_string_array (child_entries);
1667 _dbus_object_tree_list_registered_unlocked (tree, path8, &child_entries);
1668 if (child_entries != NULL)
1670 nb = string_array_length ((const char**)child_entries);
1671 _dbus_assert (nb == 0);
1672 dbus_free_string_array (child_entries);
1675 _dbus_object_tree_list_registered_unlocked (tree, root, &child_entries);
1676 if (child_entries != NULL)
1678 nb = string_array_length ((const char**)child_entries);
1679 _dbus_assert (nb == 3);
1680 dbus_free_string_array (child_entries);
1684 /* Check that destroying tree calls unregister funcs */
1685 _dbus_object_tree_unref (tree);
1688 while (i < (int) _DBUS_N_ELEMENTS (tree_test_data))
1690 _dbus_assert (tree_test_data[i].handler_unregistered);
1691 _dbus_assert (!tree_test_data[i].message_handled);
1695 /* Now start again and try the individual unregister function */
1696 tree = _dbus_object_tree_new (NULL);
1700 if (!do_register (tree, path0, TRUE, 0, tree_test_data))
1702 if (!do_register (tree, path1, TRUE, 1, tree_test_data))
1704 if (!do_register (tree, path2, TRUE, 2, tree_test_data))
1706 if (!do_register (tree, path3, TRUE, 3, tree_test_data))
1708 if (!do_register (tree, path4, TRUE, 4, tree_test_data))
1710 if (!do_register (tree, path5, TRUE, 5, tree_test_data))
1712 if (!do_register (tree, path6, TRUE, 6, tree_test_data))
1714 if (!do_register (tree, path7, TRUE, 7, tree_test_data))
1716 if (!do_register (tree, path8, TRUE, 8, tree_test_data))
1719 _dbus_object_tree_unregister_and_unlock (tree, path0);
1721 _dbus_assert (!find_subtree (tree, path0, NULL));
1722 _dbus_assert (find_subtree (tree, path1, NULL));
1723 _dbus_assert (find_subtree (tree, path2, NULL));
1724 _dbus_assert (find_subtree (tree, path3, NULL));
1725 _dbus_assert (find_subtree (tree, path4, NULL));
1726 _dbus_assert (find_subtree (tree, path5, NULL));
1727 _dbus_assert (find_subtree (tree, path6, NULL));
1728 _dbus_assert (find_subtree (tree, path7, NULL));
1729 _dbus_assert (find_subtree (tree, path8, NULL));
1731 _dbus_object_tree_unregister_and_unlock (tree, path1);
1733 _dbus_assert (!find_subtree (tree, path0, NULL));
1734 _dbus_assert (!find_subtree (tree, path1, NULL));
1735 _dbus_assert (find_subtree (tree, path2, NULL));
1736 _dbus_assert (find_subtree (tree, path3, NULL));
1737 _dbus_assert (find_subtree (tree, path4, NULL));
1738 _dbus_assert (find_subtree (tree, path5, NULL));
1739 _dbus_assert (find_subtree (tree, path6, NULL));
1740 _dbus_assert (find_subtree (tree, path7, NULL));
1741 _dbus_assert (find_subtree (tree, path8, NULL));
1743 _dbus_object_tree_unregister_and_unlock (tree, path2);
1745 _dbus_assert (!find_subtree (tree, path0, NULL));
1746 _dbus_assert (!find_subtree (tree, path1, NULL));
1747 _dbus_assert (!find_subtree (tree, path2, NULL));
1748 _dbus_assert (find_subtree (tree, path3, NULL));
1749 _dbus_assert (find_subtree (tree, path4, NULL));
1750 _dbus_assert (find_subtree (tree, path5, NULL));
1751 _dbus_assert (find_subtree (tree, path6, NULL));
1752 _dbus_assert (find_subtree (tree, path7, NULL));
1753 _dbus_assert (find_subtree (tree, path8, NULL));
1755 _dbus_object_tree_unregister_and_unlock (tree, path3);
1757 _dbus_assert (!find_subtree (tree, path0, NULL));
1758 _dbus_assert (!find_subtree (tree, path1, NULL));
1759 _dbus_assert (!find_subtree (tree, path2, NULL));
1760 _dbus_assert (!find_subtree (tree, path3, NULL));
1761 _dbus_assert (find_subtree (tree, path4, NULL));
1762 _dbus_assert (find_subtree (tree, path5, NULL));
1763 _dbus_assert (find_subtree (tree, path6, NULL));
1764 _dbus_assert (find_subtree (tree, path7, NULL));
1765 _dbus_assert (find_subtree (tree, path8, NULL));
1767 _dbus_object_tree_unregister_and_unlock (tree, path4);
1769 _dbus_assert (!find_subtree (tree, path0, NULL));
1770 _dbus_assert (!find_subtree (tree, path1, NULL));
1771 _dbus_assert (!find_subtree (tree, path2, NULL));
1772 _dbus_assert (!find_subtree (tree, path3, NULL));
1773 _dbus_assert (!find_subtree (tree, path4, NULL));
1774 _dbus_assert (find_subtree (tree, path5, NULL));
1775 _dbus_assert (find_subtree (tree, path6, NULL));
1776 _dbus_assert (find_subtree (tree, path7, NULL));
1777 _dbus_assert (find_subtree (tree, path8, NULL));
1779 _dbus_object_tree_unregister_and_unlock (tree, path5);
1781 _dbus_assert (!find_subtree (tree, path0, NULL));
1782 _dbus_assert (!find_subtree (tree, path1, NULL));
1783 _dbus_assert (!find_subtree (tree, path2, NULL));
1784 _dbus_assert (!find_subtree (tree, path3, NULL));
1785 _dbus_assert (!find_subtree (tree, path4, NULL));
1786 _dbus_assert (!find_subtree (tree, path5, NULL));
1787 _dbus_assert (find_subtree (tree, path6, NULL));
1788 _dbus_assert (find_subtree (tree, path7, NULL));
1789 _dbus_assert (find_subtree (tree, path8, NULL));
1791 _dbus_object_tree_unregister_and_unlock (tree, path6);
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, path7);
1805 _dbus_assert (!find_subtree (tree, path0, NULL));
1806 _dbus_assert (!find_subtree (tree, path1, NULL));
1807 _dbus_assert (!find_subtree (tree, path2, NULL));
1808 _dbus_assert (!find_subtree (tree, path3, NULL));
1809 _dbus_assert (!find_subtree (tree, path4, NULL));
1810 _dbus_assert (!find_subtree (tree, path5, NULL));
1811 _dbus_assert (!find_subtree (tree, path6, NULL));
1812 _dbus_assert (!find_subtree (tree, path7, NULL));
1813 _dbus_assert (find_subtree (tree, path8, NULL));
1815 _dbus_object_tree_unregister_and_unlock (tree, path8);
1817 _dbus_assert (!find_subtree (tree, path0, NULL));
1818 _dbus_assert (!find_subtree (tree, path1, NULL));
1819 _dbus_assert (!find_subtree (tree, path2, NULL));
1820 _dbus_assert (!find_subtree (tree, path3, NULL));
1821 _dbus_assert (!find_subtree (tree, path4, NULL));
1822 _dbus_assert (!find_subtree (tree, path5, NULL));
1823 _dbus_assert (!find_subtree (tree, path6, NULL));
1824 _dbus_assert (!find_subtree (tree, path7, NULL));
1825 _dbus_assert (!find_subtree (tree, path8, NULL));
1828 while (i < (int) _DBUS_N_ELEMENTS (tree_test_data))
1830 _dbus_assert (tree_test_data[i].handler_unregistered);
1831 _dbus_assert (!tree_test_data[i].message_handled);
1835 /* Register it all again, and test dispatch */
1837 if (!do_register (tree, path0, TRUE, 0, tree_test_data))
1839 if (!do_register (tree, path1, FALSE, 1, tree_test_data))
1841 if (!do_register (tree, path2, TRUE, 2, tree_test_data))
1843 if (!do_register (tree, path3, TRUE, 3, tree_test_data))
1845 if (!do_register (tree, path4, TRUE, 4, tree_test_data))
1847 if (!do_register (tree, path5, TRUE, 5, tree_test_data))
1849 if (!do_register (tree, path6, FALSE, 6, tree_test_data))
1851 if (!do_register (tree, path7, TRUE, 7, tree_test_data))
1853 if (!do_register (tree, path8, TRUE, 8, tree_test_data))
1860 if (!do_test_dispatch (tree, path0, 0, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1862 if (!do_test_dispatch (tree, path1, 1, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1864 if (!do_test_dispatch (tree, path2, 2, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1866 if (!do_test_dispatch (tree, path3, 3, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1868 if (!do_test_dispatch (tree, path4, 4, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1870 if (!do_test_dispatch (tree, path5, 5, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1872 if (!do_test_dispatch (tree, path6, 6, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1874 if (!do_test_dispatch (tree, path7, 7, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1876 if (!do_test_dispatch (tree, path8, 8, tree_test_data, _DBUS_N_ELEMENTS (tree_test_data)))
1883 _dbus_object_tree_ref (tree);
1884 _dbus_object_tree_unref (tree);
1885 _dbus_object_tree_unref (tree);
1892 * @ingroup DBusObjectTree
1893 * Unit test for DBusObjectTree
1894 * @returns #TRUE on success.
1897 _dbus_object_tree_test (void)
1899 _dbus_test_oom_handling ("object tree",
1900 object_tree_test_iteration,
1906 #endif /* DBUS_BUILD_TESTS */