1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
|
/*
* AT-SPI - Assistive Technology Service Provider Interface
* (Gnome Accessibility Project; http://developer.gnome.org/projects/gap)
*
* Copyright 2007 IBM Corp.
* Copyright 2010, 2011 Novell, Inc.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the
* Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*/
#include "atspi-private.h"
/* TODO: Improve documentation and implement some missing functions */
/**
* atspi_collection_is_ancestor_of:
*
* Not yet implemented.
*
**/
gboolean
atspi_collection_is_ancestor_of (AtspiCollection *collection,
AtspiAccessible *test,
GError **error)
{
g_warning ("AT-SPI: TODO: Implement is_ancestor_of");
return FALSE;
}
static DBusMessage *
new_message (AtspiCollection *collection, char *method)
{
AtspiAccessible *accessible;
if (!collection)
return NULL;
accessible = ATSPI_ACCESSIBLE (collection);
if (!accessible->parent.app)
return NULL;
return dbus_message_new_method_call (accessible->parent.app->bus_name,
accessible->parent.path,
atspi_interface_collection,
method);
}
static gboolean
append_match_rule (DBusMessage *message, AtspiMatchRule *rule)
{
DBusMessageIter iter;
dbus_message_iter_init_append (message, &iter);
return _atspi_match_rule_marshal (rule, &iter);
}
static gboolean
append_accessible (DBusMessage *message, AtspiAccessible *accessible)
{
DBusMessageIter iter;
dbus_message_iter_init_append (message, &iter);
dbus_message_iter_append_basic (&iter, DBUS_TYPE_OBJECT_PATH,
&accessible->parent.path);
return TRUE; /* TODO: Check for out-of-memory */
}
static GArray *
return_accessibles (DBusMessage *message)
{
DBusMessageIter iter, iter_array;
GArray *ret = g_array_new (TRUE, TRUE, sizeof (AtspiAccessible *));
_ATSPI_DBUS_CHECK_SIG (message, "a(so)", NULL, NULL);
dbus_message_iter_init (message, &iter);
dbus_message_iter_recurse (&iter, &iter_array);
while (dbus_message_iter_get_arg_type (&iter_array) != DBUS_TYPE_INVALID)
{
AtspiAccessible *accessible;
accessible = _atspi_dbus_return_accessible_from_iter (&iter_array);
ret = g_array_append_val (ret, accessible);
/* Iter was moved already, so no need to call dbus_message_iter_next */
}
dbus_message_unref (message);
return ret;
}
/**
* atspi_collection_get_matches:
* @collection: A pointer to the #AtspiCollection to query.
* @rule: An #AtspiMatchRule describing the match criteria.
* @sortby: An #AtspiCollectionSortOrder specifying the way the results are to
* be sorted.
* @count: The maximum number of results to return, or 0 for no limit.
* @traverse: Not supported.
*
* Gets all #AtspiAccessible objects from the @collection matching a given
* @rule.
*
* Returns: (element-type AtspiAccessible*) (transfer full): All
* #AtspiAccessible objects matching the given match rule.
**/
GArray *
atspi_collection_get_matches (AtspiCollection *collection,
AtspiMatchRule *rule,
AtspiCollectionSortOrder sortby,
gint count,
gboolean traverse,
GError **error)
{
DBusMessage *message = new_message (collection, "GetMatches");
DBusMessage *reply;
dbus_int32_t d_sortby = sortby;
dbus_int32_t d_count = count;
dbus_bool_t d_traverse = traverse;
if (!message)
return NULL;
if (!append_match_rule (message, rule))
return NULL;
dbus_message_append_args (message, DBUS_TYPE_UINT32, &d_sortby,
DBUS_TYPE_INT32, &d_count,
DBUS_TYPE_BOOLEAN, &d_traverse,
DBUS_TYPE_INVALID);
reply = _atspi_dbus_send_with_reply_and_block (message, error);
if (!reply)
return NULL;
return return_accessibles (reply);
}
/**
* atspi_collection_get_matches_to:
* @collection: A pointer to the #AtspiCollection to query.
* @current_object: The object at which to start searching.
* @rule: An #AtspiMatchRule describing the match criteria.
* @sortby: An #AtspiCollectionSortOrder specifying the way the results are to
* be sorted.
* @tree: An #AtspiCollectionTreeTraversalType specifying restrictions on
* the objects to be traversed.
* @limit_scope: If #TRUE, only descendants of @current_object's parent
* will be returned. Otherwise (if #FALSE), any accessible may be
* returned if it would preceed @current_object in a flattened
* hierarchy.
* @count: The maximum number of results to return, or 0 for no limit.
* @traverse: Not supported.
*
* Gets all #AtspiAccessible objects from the @collection, after
* @current_object, matching a given @rule.
*
* Returns: (element-type AtspiAccessible*) (transfer full): All
* #AtspiAccessible objects matching the given match rule after
* @current_object.
**/
GArray *
atspi_collection_get_matches_to (AtspiCollection *collection,
AtspiAccessible *current_object,
AtspiMatchRule *rule,
AtspiCollectionSortOrder sortby,
AtspiCollectionTreeTraversalType tree,
gboolean limit_scope,
gint count,
gboolean traverse,
GError **error)
{
DBusMessage *message = new_message (collection, "GetMatchesTo");
DBusMessage *reply;
dbus_int32_t d_sortby = sortby;
dbus_int32_t d_tree = tree;
dbus_bool_t d_limit_scope = limit_scope;
dbus_int32_t d_count = count;
dbus_bool_t d_traverse = traverse;
if (!message)
return NULL;
if (!append_accessible (message, current_object))
return NULL;
if (!append_match_rule (message, rule))
return NULL;
dbus_message_append_args (message, DBUS_TYPE_UINT32, &d_sortby,
DBUS_TYPE_UINT32, &d_tree,
DBUS_TYPE_BOOLEAN, &d_limit_scope,
DBUS_TYPE_INT32, &d_count,
DBUS_TYPE_BOOLEAN, &d_traverse,
DBUS_TYPE_INVALID);
reply = _atspi_dbus_send_with_reply_and_block (message, error);
if (!reply)
return NULL;
return return_accessibles (reply);
}
/**
* atspi_collection_get_matches_from:
* @collection: A pointer to the #AtspiCollection to query.
* @current_object: Upon reaching this object, searching should stop.
* @rule: An #AtspiMatchRule describing the match criteria.
* @sortby: An #AtspiCollectionSortOrder specifying the way the results are to
* be sorted.
* @tree: An #AtspiCollectionTreeTraversalType specifying restrictions on
* the objects to be traversed.
* @count: The maximum number of results to return, or 0 for no limit.
* @traverse: Not supported.
*
* Gets all #AtspiAccessible objects from the @collection, before
* @current_object, matching a given @rule.
*
* Returns: (element-type AtspiAccessible*) (transfer full): All
* #AtspiAccessible objects matching the given match rule that preceed
* @current_object.
**/
GArray *
atspi_collection_get_matches_from (AtspiCollection *collection,
AtspiAccessible *current_object,
AtspiMatchRule *rule,
AtspiCollectionSortOrder sortby,
AtspiCollectionTreeTraversalType tree,
gint count,
gboolean traverse,
GError **error)
{
DBusMessage *message = new_message (collection, "GetMatchesFrom");
DBusMessage *reply;
dbus_int32_t d_sortby = sortby;
dbus_int32_t d_tree = tree;
dbus_int32_t d_count = count;
dbus_bool_t d_traverse = traverse;
if (!message)
return NULL;
if (!append_accessible (message, current_object))
return NULL;
if (!append_match_rule (message, rule))
return NULL;
dbus_message_append_args (message, DBUS_TYPE_UINT32, &d_sortby,
DBUS_TYPE_UINT32, &d_tree,
DBUS_TYPE_INT32, &d_count,
DBUS_TYPE_BOOLEAN, &d_traverse,
DBUS_TYPE_INVALID);
reply = _atspi_dbus_send_with_reply_and_block (message, error);
if (!reply)
return NULL;
return return_accessibles (reply);
}
/**
* atspi_collection_get_active_descendant:
*
* Returns: (transfer full): The active descendant of the given object.
* Not yet implemented.
**/
AtspiAccessible *
atspi_collection_get_active_descendant (AtspiCollection *collection, GError **error)
{
g_warning ("AT-SPI: TODO: Implement get_active_descendants");
return NULL;
}
static void
atspi_collection_base_init (AtspiCollection *klass)
{
}
GType
atspi_collection_get_type (void)
{
static GType type = 0;
if (!type) {
static const GTypeInfo tinfo =
{
sizeof (AtspiCollection),
(GBaseInitFunc) atspi_collection_base_init,
(GBaseFinalizeFunc) NULL,
};
type = g_type_register_static (G_TYPE_INTERFACE, "AtspiCollection", &tinfo, 0);
}
return type;
}
|