2 * AT-SPI - Assistive Technology Service Provider Interface
3 * (Gnome Accessibility Project; http://developer.gnome.org/projects/gap)
5 * Copyright 2007 IBM Corp.
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Library General Public
9 * License as published by the Free Software Foundation; either
10 * version 2 of the License, or (at your option) any later version.
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Library General Public License for more details.
17 * You should have received a copy of the GNU Library General Public
18 * License along with this library; if not, write to the
19 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
20 * Boston, MA 02111-1307, USA.
23 /* collection.c: implements the Collection interface */
28 #include <droute/droute.h>
30 #include "common/bitarray.h"
31 #include "common/spi-dbus.h"
32 #include "common/spi-stateset.h"
34 #include "accessible-register.h"
36 #include "introspection.h"
38 typedef struct _MatchRulePrivate MatchRulePrivate;
39 struct _MatchRulePrivate
42 Accessibility_Collection_MatchType statematchtype;
43 AtkAttributeSet *attributes;
44 Accessibility_Collection_MatchType attributematchtype;
46 Accessibility_Collection_MatchType rolematchtype;
48 Accessibility_Collection_MatchType interfacematchtype;
53 child_interface_p (AtkObject * child, gchar * repo_id)
55 if (!strcasecmp (repo_id, "action"))
56 return ATK_IS_ACTION (child);
57 if (!strcasecmp (repo_id, "component"))
58 return ATK_IS_COMPONENT (child);
59 if (!strcasecmp (repo_id, "editabletext"))
60 return ATK_IS_EDITABLE_TEXT (child);
61 if (!strcasecmp (repo_id, "text"))
62 return ATK_IS_TEXT (child);
63 if (!strcasecmp (repo_id, "hypertext"))
64 return ATK_IS_HYPERTEXT (child);
65 if (!strcasecmp (repo_id, "image"))
66 return ATK_IS_IMAGE (child);
67 if (!strcasecmp (repo_id, "selection"))
68 return ATK_IS_SELECTION (child);
69 if (!strcasecmp (repo_id, "table"))
70 return ATK_IS_TABLE (child);
71 if (!strcasecmp (repo_id, "value"))
72 return ATK_IS_VALUE (child);
73 if (!strcasecmp (repo_id, "streamablecontent"))
74 return ATK_IS_STREAMABLE_CONTENT (child);
75 if (!strcasecmp (repo_id, "document"))
76 return ATK_IS_DOCUMENT (child);
80 #define child_collection_p(ch) (TRUE)
83 match_states_all_p (AtkObject * child, gint * set)
92 chs = atk_object_ref_state_set (child);
94 // TODO: use atk-state_set_contains_states; would be more efficient
95 for (i = 0; set[i] != BITARRAY_SEQ_TERM; i++)
97 if (!atk_state_set_contains_state (chs, set[i]))
104 g_object_unref (chs);
109 match_states_any_p (AtkObject * child, gint * set)
113 gboolean ret = FALSE;
118 chs = atk_object_ref_state_set (child);
120 for (i = 0; set[i] != BITARRAY_SEQ_TERM; i++)
122 if (!atk_state_set_contains_state (chs, set[i]))
129 g_object_unref (chs);
134 match_states_none_p (AtkObject * child, gint * set)
143 chs = atk_object_ref_state_set (child);
145 for (i = 0; set[i] != BITARRAY_SEQ_TERM; i++)
147 if (atk_state_set_contains_state (chs, set[i]))
154 g_object_unref (chs);
158 // TODO: need to convert at-spi roles/states to atk roles/states */
160 match_states_lookup (AtkObject * child, MatchRulePrivate * mrp)
162 switch (mrp->statematchtype)
164 case Accessibility_Collection_MATCH_ALL:
165 if (match_states_all_p (child, mrp->states))
169 case Accessibility_Collection_MATCH_ANY:
170 if (match_states_any_p (child, mrp->states))
174 case Accessibility_Collection_MATCH_NONE:
175 if (match_states_none_p (child, mrp->states))
186 // TODO: Map at-spi -> atk roles at mrp creation instead of doing this;
187 // would be more efficient
188 #define spi_get_role(obj) spi_accessible_role_from_atk_role(atk_object_get_role(obj))
191 match_roles_all_p (AtkObject * child, gint * roles)
193 if (roles == NULL || roles[0] == BITARRAY_SEQ_TERM)
195 else if (roles[1] != BITARRAY_SEQ_TERM)
198 return (atk_object_get_role (child) == roles[0]);
203 match_roles_any_p (AtkObject * child, gint * roles)
205 Accessibility_Role role;
208 if (roles == NULL || roles[0] == BITARRAY_SEQ_TERM)
211 role = spi_accessible_role_from_atk_role (atk_object_get_role (child));
213 for (i = 0; roles[i] != BITARRAY_SEQ_TERM; i++)
214 if (role == roles[i])
221 match_roles_none_p (AtkObject * child, gint * roles)
226 if (roles == NULL || roles[0] == BITARRAY_SEQ_TERM)
229 role = atk_object_get_role (child);
231 for (i = 0; roles[i] != BITARRAY_SEQ_TERM; i++)
232 if (role == roles[i])
239 match_roles_lookup (AtkObject * child, MatchRulePrivate * mrp)
241 switch (mrp->rolematchtype)
243 case Accessibility_Collection_MATCH_ALL:
244 if (match_roles_all_p (child, mrp->roles))
248 case Accessibility_Collection_MATCH_ANY:
249 if (match_roles_any_p (child, mrp->roles))
253 case Accessibility_Collection_MATCH_NONE:
254 if (match_roles_none_p (child, mrp->roles))
266 match_interfaces_all_p (AtkObject * obj, gchar ** ifaces)
273 for (i = 0; ifaces[i]; i++)
274 if (!child_interface_p (obj, ifaces[i]))
282 match_interfaces_any_p (AtkObject * obj, gchar ** ifaces)
290 for (i = 0; ifaces[i]; i++)
291 if (child_interface_p (obj, ifaces[i]))
299 match_interfaces_none_p (AtkObject * obj, gchar ** ifaces)
303 for (i = 0; ifaces[i]; i++)
304 if (child_interface_p (obj, ifaces[i]))
311 match_interfaces_lookup (AtkObject * child, MatchRulePrivate * mrp)
313 switch (mrp->interfacematchtype)
316 case Accessibility_Collection_MATCH_ALL:
317 if (match_interfaces_all_p (child, mrp->ifaces))
321 case Accessibility_Collection_MATCH_ANY:
322 if (match_interfaces_any_p (child, mrp->ifaces))
326 case Accessibility_Collection_MATCH_NONE:
327 if (match_interfaces_none_p (child, mrp->ifaces))
338 #define split_attributes(attributes) (g_strsplit (attributes, ";", 0))
341 match_attributes_all_p (AtkObject * child, AtkAttributeSet * attributes)
345 gint length, oa_length;
346 gboolean flag = FALSE;
348 if (attributes == NULL || g_slist_length (attributes) == 0)
351 oa = atk_object_get_attributes (child);
352 length = g_slist_length (attributes);
353 oa_length = g_slist_length (oa);
355 for (i = 0; i < length; i++)
357 AtkAttribute *attr = g_slist_nth_data (attributes, i);
358 for (k = 0; k < oa_length; k++)
360 AtkAttribute *oa_attr = g_slist_nth_data (attributes, i);
361 if (!g_ascii_strcasecmp (oa_attr->name, attr->name) &&
362 !g_ascii_strcasecmp (oa_attr->value, attr->value))
372 atk_attribute_set_free (oa);
376 atk_attribute_set_free (oa);
381 match_attributes_any_p (AtkObject * child, AtkAttributeSet * attributes)
386 gint length, oa_length;
388 length = g_slist_length (attributes);
392 oa = atk_object_get_attributes (child);
393 oa_length = g_slist_length (oa);
395 for (i = 0; i < length; i++)
397 AtkAttribute *attr = g_slist_nth_data (attributes, i);
398 for (k = 0; k < oa_length; k++)
400 AtkAttribute *oa_attr = g_slist_nth_data (attributes, i);
401 if (!g_ascii_strcasecmp (oa_attr->name, attr->name) &&
402 !g_ascii_strcasecmp (oa_attr->value, attr->value))
404 atk_attribute_set_free (oa);
409 atk_attribute_set_free (oa);
414 match_attributes_none_p (AtkObject * child, AtkAttributeSet * attributes)
419 gint length, oa_length;
421 length = g_slist_length (attributes);
425 oa = atk_object_get_attributes (child);
426 oa_length = g_slist_length (oa);
428 for (i = 0; i < length; i++)
430 AtkAttribute *attr = g_slist_nth_data (attributes, i);
431 for (k = 0; k < oa_length; k++)
433 AtkAttribute *oa_attr = g_slist_nth_data (attributes, i);
434 if (!g_ascii_strcasecmp (oa_attr->name, attr->name) &&
435 !g_ascii_strcasecmp (oa_attr->value, attr->value))
437 atk_attribute_set_free (oa);
442 atk_attribute_set_free (oa);
447 match_attributes_lookup (AtkObject * child, MatchRulePrivate * mrp)
449 switch (mrp->attributematchtype)
452 case Accessibility_Collection_MATCH_ALL:
453 if (match_attributes_all_p (child, mrp->attributes))
457 case Accessibility_Collection_MATCH_ANY:
458 if (match_attributes_any_p (child, mrp->attributes))
462 case Accessibility_Collection_MATCH_NONE:
463 if (match_attributes_none_p (child, mrp->attributes))
474 traverse_p (AtkObject * child, const gboolean traverse)
479 return !child_collection_p (child);
483 sort_order_canonical (MatchRulePrivate * mrp, GList * ls,
484 gint kount, gint max,
485 AtkObject * obj, glong index, gboolean flag,
486 AtkObject * pobj, gboolean recurse, gboolean traverse)
489 glong acount = atk_object_get_n_accessible_children (obj);
490 gboolean prev = pobj ? TRUE : FALSE;
492 for (; i < acount && (max == 0 || kount < max); i++)
494 AtkObject *child = atk_object_ref_accessible_child (obj, i);
496 g_object_unref (child);
497 if (prev && child == pobj)
502 if (flag && match_interfaces_lookup (child, mrp)
503 && match_states_lookup (child, mrp)
504 && match_roles_lookup (child, mrp)
505 && match_attributes_lookup (child, mrp))
508 ls = g_list_append (ls, child);
515 if (recurse && traverse_p (child, traverse))
516 kount = sort_order_canonical (mrp, ls, kount,
518 pobj, recurse, traverse);
524 sort_order_rev_canonical (MatchRulePrivate * mrp, GList * ls,
525 gint kount, gint max,
526 AtkObject * obj, gboolean flag, AtkObject * pobj)
532 /* This breaks us out of the recursion. */
533 if (!obj || obj == pobj)
538 /* Add to the list if it matches */
539 if (flag && match_interfaces_lookup (obj, mrp)
540 && match_states_lookup (obj, mrp)
541 && match_roles_lookup (obj, mrp) && match_attributes_lookup (obj, mrp))
543 ls = g_list_append (ls, obj);
550 /* Get the current nodes index in it's parent and the parent object. */
551 indexinparent = atk_object_get_index_in_parent (obj);
552 parent = atk_object_get_parent (obj);
554 if (indexinparent > 0)
556 /* there are still some siblings to visit so get the previous sibling
557 and get it's last descendant.
558 First, get the previous sibling */
559 nextobj = atk_object_ref_accessible_child (parent, indexinparent - 1);
560 g_object_unref (nextobj);
562 /* Now, drill down the right side to the last descendant */
563 while (atk_object_get_n_accessible_children (nextobj) > 0)
565 nextobj = atk_object_ref_accessible_child (nextobj,
566 atk_object_get_n_accessible_children
568 g_object_unref (nextobj);
570 /* recurse with the last descendant */
571 kount = sort_order_rev_canonical (mrp, ls, kount, max,
572 nextobj, TRUE, pobj);
576 /* no more siblings so next node must be the parent */
577 kount = sort_order_rev_canonical (mrp, ls, kount, max,
585 query_exec (MatchRulePrivate * mrp, Accessibility_Collection_SortOrder sortby,
586 GList * ls, gint kount, gint max,
587 AtkObject * obj, glong index,
589 AtkObject * pobj, gboolean recurse, gboolean traverse)
593 case Accessibility_Collection_SORT_ORDER_CANONICAL:
594 kount = sort_order_canonical (mrp, ls, 0, max, obj, index, flag,
595 pobj, recurse, traverse);
597 case Accessibility_Collection_SORT_ORDER_REVERSE_CANONICAL:
598 kount = sort_order_canonical (mrp, ls, 0, max, obj, index, flag,
599 pobj, recurse, traverse);
603 g_warning ("Sort method not implemented yet");
611 bitarray_to_seq (int *array, int array_count, int **ret)
616 int *out = (int *) g_malloc (out_size * sizeof (int));
620 for (i = 0; i < array_count; i++)
622 for (j = 0; j < 32; j++)
624 if (array[i] & (1 << j))
626 if (out_count == out_size - 2)
629 out = (int *) g_realloc (out, out_size * sizeof (int));
633 out[out_count++] = i * 32 + j;
637 out[out_count] = BITARRAY_SEQ_TERM;
644 read_mr (DBusMessageIter * iter, MatchRulePrivate * mrp)
646 DBusMessageIter mrc, arrayc;
647 dbus_uint32_t *array;
648 dbus_int32_t matchType;
653 char *interfaces = NULL;
655 dbus_message_iter_recurse (iter, &mrc);
656 dbus_message_iter_recurse (&mrc, &arrayc);
657 dbus_message_iter_get_fixed_array (&arrayc, &array, &array_count);
658 bitarray_to_seq (array, array_count, &mrp->states);
659 for (i = 0; mrp->states[i] != BITARRAY_SEQ_TERM; i++)
661 mrp->states[i] = spi_atk_state_from_spi_state (mrp->states[i]);
663 dbus_message_iter_next (&mrc);
664 dbus_message_iter_get_basic (&mrc, &matchType);
665 dbus_message_iter_next (&mrc);
666 mrp->statematchtype = matchType;;
668 mrp->attributes = NULL;
669 if (dbus_message_iter_get_arg_type (&mrc) == DBUS_TYPE_STRING)
674 dbus_message_iter_get_basic (&mrc, &str);
675 attributes = g_strsplit (str, "\n", -1);
676 for (pp = attributes; *pp; pp++)
679 attr = g_new (AtkAttribute, 1);
682 int len = strcspn (str, ":");
683 attr->name = g_strndup (str, len);
689 attr->value = g_strdup (str + len);
693 mrp->attributes = g_slist_prepend (mrp->attributes, attr);
696 g_strfreev (attributes);
700 dbus_message_iter_recurse (&mrc, &arrayc);
701 while (dbus_message_iter_get_arg_type (&arrayc) != DBUS_TYPE_INVALID)
703 dbus_message_iter_get_basic (&arrayc, &str);
704 // TODO: remove this print
705 g_print ("Got attribute: %s\n", str);
706 attr = g_new (AtkAttribute, 1);
709 int len = strcspn (str, ":");
710 attr->name = g_strndup (str, len);
716 attr->value = g_strdup (str + len);
720 mrp->attributes = g_slist_prepend (mrp->attributes, attr);
722 dbus_message_iter_next (&arrayc);
725 dbus_message_iter_next (&mrc);
726 dbus_message_iter_get_basic (&mrc, &matchType);
727 mrp->attributematchtype = matchType;;
728 dbus_message_iter_next (&mrc);
729 /* Get roles and role match */
730 dbus_message_iter_recurse (&mrc, &arrayc);
731 dbus_message_iter_get_fixed_array (&arrayc, &array, &array_count);
732 bitarray_to_seq (array, array_count, &mrp->roles);
733 dbus_message_iter_next (&mrc);
734 dbus_message_iter_get_basic (&mrc, &matchType);
735 mrp->rolematchtype = matchType;;
736 dbus_message_iter_next (&mrc);
737 /* Get interfaces and interface match */
738 dbus_message_iter_get_basic (&mrc, &interfaces);
739 dbus_message_iter_next (&mrc);
740 mrp->ifaces = g_strsplit (interfaces, ";", 0);
741 dbus_message_iter_get_basic (&mrc, &matchType);
742 mrp->interfacematchtype = matchType;;
743 dbus_message_iter_next (&mrc);
745 dbus_message_iter_get_basic (&mrc, &mrp->invert);
746 dbus_message_iter_next (iter);
751 return_and_free_list (DBusMessage * message, GList * ls)
754 DBusMessageIter iter, iter_array;
757 reply = dbus_message_new_method_return (message);
760 dbus_message_iter_init_append (reply, &iter);
761 if (!dbus_message_iter_open_container
762 (&iter, DBUS_TYPE_ARRAY, "(so)", &iter_array))
764 for (item = ls; item; item = g_list_next (item))
766 spi_object_append_reference (&iter_array, ATK_OBJECT (item->data));
768 if (!dbus_message_iter_close_container (&iter, &iter_array))
773 // TODO: Handle out of memory
779 free_mrp_data (MatchRulePrivate * mrp)
781 g_free (mrp->states);
782 atk_attribute_set_free (mrp->attributes);
784 g_strfreev (mrp->ifaces);
788 GetMatchesFrom (DBusMessage * message,
789 AtkObject * current_object,
790 MatchRulePrivate * mrp,
791 const Accessibility_Collection_SortOrder sortby,
792 const dbus_bool_t isrestrict,
793 dbus_int32_t count, const dbus_bool_t traverse)
797 glong index = atk_object_get_index_in_parent (current_object);
800 ls = g_list_append (ls, current_object);
804 parent = atk_object_get_parent (current_object);
805 kount = query_exec (mrp, sortby, ls, 0, count, parent, index,
806 FALSE, NULL, TRUE, traverse);
809 kount = query_exec (mrp, sortby, ls, 0, count,
810 current_object, 0, FALSE, NULL, TRUE, traverse);
812 ls = g_list_remove (ls, ls->data);
814 if (sortby == Accessibility_Collection_SORT_ORDER_REVERSE_CANONICAL)
815 ls = g_list_reverse (ls);
818 return return_and_free_list (message, ls);
822 inorder traversal from a given object in the hierarchy
826 inorder (AtkObject * collection, MatchRulePrivate * mrp,
827 GList * ls, gint kount, gint max,
829 gboolean flag, AtkObject * pobj, dbus_bool_t traverse)
833 /* First, look through the children recursively. */
834 kount = sort_order_canonical (mrp, ls, kount, max, obj, 0, TRUE,
837 /* Next, we look through the right subtree */
838 while ((max == 0 || kount < max) && obj != collection)
840 AtkObject *parent = atk_object_get_parent (obj);
841 i = atk_object_get_index_in_parent (obj);
842 kount = sort_order_canonical (mrp, ls, kount, max, parent,
843 i + 1, TRUE, FALSE, TRUE, TRUE);
849 kount = sort_order_canonical (mrp, ls, kount, max,
850 obj, i + 1, TRUE, FALSE, TRUE, TRUE);
857 GetMatchesInOrder: get matches from a given object in an inorder traversal.
861 GetMatchesInOrder (DBusMessage * message,
862 AtkObject * current_object,
863 MatchRulePrivate * mrp,
864 const Accessibility_Collection_SortOrder sortby,
865 const dbus_bool_t recurse,
866 dbus_int32_t count, const dbus_bool_t traverse)
872 ls = g_list_append (ls, current_object);
874 obj = ATK_OBJECT(spi_register_path_to_object (spi_global_register, dbus_message_get_path (message)));
876 kount = inorder (obj, mrp, ls, 0, count,
877 current_object, TRUE, NULL, traverse);
879 ls = g_list_remove (ls, ls->data);
881 if (sortby == Accessibility_Collection_SORT_ORDER_REVERSE_CANONICAL)
882 ls = g_list_reverse (ls);
885 return return_and_free_list (message, ls);
889 GetMatchesInBackOrder: get matches from a given object in a
890 reverse order traversal.
894 GetMatchesInBackOrder (DBusMessage * message,
895 AtkObject * current_object,
896 MatchRulePrivate * mrp,
897 const Accessibility_Collection_SortOrder sortby,
901 AtkObject *collection;
904 ls = g_list_append (ls, current_object);
906 collection = ATK_OBJECT(spi_register_path_to_object (spi_global_register, dbus_message_get_path (message)));
908 kount = sort_order_rev_canonical (mrp, ls, 0, count, current_object,
911 ls = g_list_remove (ls, ls->data);
913 if (sortby == Accessibility_Collection_SORT_ORDER_REVERSE_CANONICAL)
914 ls = g_list_reverse (ls);
917 return return_and_free_list (message, ls);
921 GetMatchesTo (DBusMessage * message,
922 AtkObject * current_object,
923 MatchRulePrivate * mrp,
924 const Accessibility_Collection_SortOrder sortby,
925 const dbus_bool_t recurse,
926 const dbus_bool_t isrestrict,
927 dbus_int32_t count, const dbus_bool_t traverse)
932 ls = g_list_append (ls, current_object);
936 obj = ATK_OBJECT (atk_object_get_parent (current_object));
937 kount = query_exec (mrp, sortby, ls, 0, count,
938 obj, 0, TRUE, current_object, TRUE, traverse);
942 obj = ATK_OBJECT (spi_register_path_to_object (spi_global_register, dbus_message_get_path (message)));
943 kount = query_exec (mrp, sortby, ls, 0, count,
944 obj, 0, TRUE, current_object, TRUE, traverse);
948 ls = g_list_remove (ls, ls->data);
950 if (sortby != Accessibility_Collection_SORT_ORDER_REVERSE_CANONICAL)
951 ls = g_list_reverse (ls);
954 return return_and_free_list (message, ls);
958 impl_GetMatchesFrom (DBusConnection * bus, DBusMessage * message,
961 char *current_object_path = NULL;
962 AtkObject *current_object;
963 DBusMessageIter iter;
964 MatchRulePrivate rule;
965 dbus_uint32_t sortby;
968 dbus_bool_t traverse;
970 const char *signature;
972 signature = dbus_message_get_signature (message);
973 if (strcmp (signature, "o(aiisiaiisib)uuib") != 0 &&
974 strcmp (signature, "o(aii(as)iaiisib)uuib") != 0)
976 return droute_invalid_arguments_error (message);
979 dbus_message_iter_init (message, &iter);
980 dbus_message_iter_get_basic (&iter, ¤t_object_path);
981 current_object = ATK_OBJECT (spi_register_path_to_object (spi_global_register, current_object_path));
984 // TODO: object-not-found error
985 return spi_dbus_general_error (message);
987 dbus_message_iter_next (&iter);
988 if (!read_mr (&iter, &rule))
990 return spi_dbus_general_error (message);
992 dbus_message_iter_get_basic (&iter, &sortby);
993 dbus_message_iter_next (&iter);
994 dbus_message_iter_get_basic (&iter, &tree);
995 dbus_message_iter_next (&iter);
996 dbus_message_iter_get_basic (&iter, &count);
997 dbus_message_iter_next (&iter);
998 dbus_message_iter_get_basic (&iter, &traverse);
999 dbus_message_iter_next (&iter);
1003 case Accessibility_Collection_TREE_RESTRICT_CHILDREN:
1004 return GetMatchesFrom (message, current_object,
1005 &rule, sortby, TRUE, count, traverse);
1007 case Accessibility_Collection_TREE_RESTRICT_SIBLING:
1008 return GetMatchesFrom (message, current_object,
1009 &rule, sortby, FALSE, count, traverse);
1011 case Accessibility_Collection_TREE_INORDER:
1012 return GetMatchesInOrder (message, current_object,
1013 &rule, sortby, TRUE, count, traverse);
1020 static DBusMessage *
1021 impl_GetMatchesTo (DBusConnection * bus, DBusMessage * message,
1024 char *current_object_path = NULL;
1025 AtkObject *current_object;
1026 DBusMessageIter iter;
1027 MatchRulePrivate rule;
1028 dbus_uint32_t sortby;
1030 dbus_bool_t recurse;
1032 dbus_bool_t traverse;
1034 const char *signature;
1036 signature = dbus_message_get_signature (message);
1037 if (strcmp (signature, "o(aiisiaiisib)uubib") != 0 &&
1038 strcmp (signature, "o(aii(as)iaiisib)uubib") != 0)
1040 return droute_invalid_arguments_error (message);
1043 dbus_message_iter_init (message, &iter);
1044 dbus_message_iter_get_basic (&iter, ¤t_object_path);
1045 current_object = ATK_OBJECT (spi_register_path_to_object (spi_global_register, current_object_path));
1046 if (!current_object)
1048 // TODO: object-not-found error
1049 return spi_dbus_general_error (message);
1051 dbus_message_iter_next (&iter);
1052 if (!read_mr (&iter, &rule))
1054 return spi_dbus_general_error (message);
1056 dbus_message_iter_get_basic (&iter, &sortby);
1057 dbus_message_iter_next (&iter);
1058 dbus_message_iter_get_basic (&iter, &tree);
1059 dbus_message_iter_next (&iter);
1060 dbus_message_iter_get_basic (&iter, &recurse);
1061 dbus_message_iter_next (&iter);
1062 dbus_message_iter_get_basic (&iter, &count);
1063 dbus_message_iter_next (&iter);
1064 dbus_message_iter_get_basic (&iter, &traverse);
1065 dbus_message_iter_next (&iter);
1069 case Accessibility_Collection_TREE_RESTRICT_CHILDREN:
1070 return GetMatchesTo (message, current_object,
1071 &rule, sortby, recurse, TRUE, count, traverse);
1073 case Accessibility_Collection_TREE_RESTRICT_SIBLING:
1074 return GetMatchesTo (message, current_object,
1075 &rule, sortby, recurse, FALSE, count, traverse);
1077 case Accessibility_Collection_TREE_INORDER:
1078 return GetMatchesInBackOrder (message, current_object,
1079 &rule, sortby, count);
1086 static DBusMessage *
1087 impl_GetMatches (DBusConnection * bus, DBusMessage * message, void *user_data)
1089 AtkObject *obj = ATK_OBJECT (spi_register_path_to_object (spi_global_register, dbus_message_get_path (message)));
1090 DBusMessageIter iter;
1091 MatchRulePrivate rule;
1092 dbus_uint32_t sortby;
1094 dbus_bool_t traverse;
1096 const char *signature;
1098 signature = dbus_message_get_signature (message);
1099 if (strcmp (signature, "(aiisiaiisib)uib") != 0 &&
1100 strcmp (signature, "(aii(as)iaiisib)uib") != 0)
1102 return droute_invalid_arguments_error (message);
1105 dbus_message_iter_init (message, &iter);
1106 if (!read_mr (&iter, &rule))
1108 return spi_dbus_general_error (message);
1110 dbus_message_iter_get_basic (&iter, &sortby);
1111 dbus_message_iter_next (&iter);
1112 dbus_message_iter_get_basic (&iter, &count);
1113 dbus_message_iter_next (&iter);
1114 dbus_message_iter_get_basic (&iter, &traverse);
1115 dbus_message_iter_next (&iter);
1116 ls = g_list_prepend (ls, obj);
1117 count = query_exec (&rule, sortby, ls, 0, count,
1118 obj, 0, TRUE, NULL, TRUE, traverse);
1119 ls = g_list_remove (ls, ls->data);
1121 if (sortby == Accessibility_Collection_SORT_ORDER_REVERSE_CANONICAL)
1122 ls = g_list_reverse (ls);
1123 free_mrp_data (&rule);
1124 return return_and_free_list (message, ls);
1127 static DRouteMethod methods[] = {
1128 {impl_GetMatchesFrom, "GetMatchesFrom"},
1129 {impl_GetMatchesTo, "GetMatchesTo"},
1130 {impl_GetMatches, "GetMatches"},
1135 spi_initialize_collection (DRoutePath * path)
1137 droute_path_add_interface (path,
1138 SPI_DBUS_INTERFACE_COLLECTION, spi_org_a11y_atspi_Collection, methods, NULL);