forked from chromium/chromium
-
Notifications
You must be signed in to change notification settings - Fork 0
/
ax_node_position.cc
367 lines (299 loc) · 10.6 KB
/
ax_node_position.cc
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
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
// Copyright 2016 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ui/accessibility/ax_node_position.h"
#include "base/strings/string_util.h"
#include "build/build_config.h"
#include "ui/accessibility/ax_enums.mojom.h"
#include "ui/accessibility/ax_node_data.h"
#include "ui/accessibility/ax_tree_manager.h"
#include "ui/accessibility/ax_tree_manager_map.h"
namespace ui {
AXEmbeddedObjectBehavior g_ax_embedded_object_behavior =
#if defined(OS_WIN)
AXEmbeddedObjectBehavior::kExposeCharacter;
#else
AXEmbeddedObjectBehavior::kSuppressCharacter;
#endif
// static
AXNodePosition::AXPositionInstance AXNodePosition::CreatePosition(
const AXNode& node,
int child_index_or_text_offset,
ax::mojom::TextAffinity affinity) {
if (!node.tree())
return CreateNullPosition();
AXTreeID tree_id = node.tree()->GetAXTreeID();
if (node.IsText())
return CreateTextPosition(tree_id, node.id(), child_index_or_text_offset,
affinity);
return CreateTreePosition(tree_id, node.id(), child_index_or_text_offset);
}
AXNodePosition::AXNodePosition() = default;
AXNodePosition::~AXNodePosition() = default;
AXNodePosition::AXNodePosition(const AXNodePosition& other)
: AXPosition<AXNodePosition, AXNode>(other) {}
AXNodePosition::AXPositionInstance AXNodePosition::Clone() const {
return AXPositionInstance(new AXNodePosition(*this));
}
void AXNodePosition::AnchorChild(int child_index,
AXTreeID* tree_id,
AXNode::AXID* child_id) const {
DCHECK(tree_id);
DCHECK(child_id);
if (!GetAnchor() || child_index < 0 || child_index >= AnchorChildCount()) {
*tree_id = AXTreeIDUnknown();
*child_id = AXNode::kInvalidAXID;
return;
}
AXNode* child = nullptr;
const AXTreeManager* child_tree_manager =
AXTreeManagerMap::GetInstance().GetManagerForChildTree(*GetAnchor());
if (child_tree_manager) {
// The child node exists in a separate tree from its parent.
child = child_tree_manager->GetRootAsAXNode();
*tree_id = child_tree_manager->GetTreeID();
} else {
child = GetAnchor()->children()[size_t{child_index}];
*tree_id = this->tree_id();
}
DCHECK(child);
*child_id = child->id();
}
int AXNodePosition::AnchorChildCount() const {
if (!GetAnchor())
return 0;
const AXTreeManager* child_tree_manager =
AXTreeManagerMap::GetInstance().GetManagerForChildTree(*GetAnchor());
if (child_tree_manager)
return 1;
return int{GetAnchor()->children().size()};
}
int AXNodePosition::AnchorIndexInParent() const {
return GetAnchor() ? int{GetAnchor()->index_in_parent()} : INVALID_INDEX;
}
base::stack<AXNode*> AXNodePosition::GetAncestorAnchors() const {
base::stack<AXNode*> anchors;
AXNode* current_anchor = GetAnchor();
AXNode::AXID current_anchor_id = GetAnchor()->id();
AXTreeID current_tree_id = tree_id();
AXNode::AXID parent_anchor_id = AXNode::kInvalidAXID;
AXTreeID parent_tree_id = AXTreeIDUnknown();
while (current_anchor) {
anchors.push(current_anchor);
current_anchor = GetParent(
current_anchor /*child*/, current_tree_id /*child_tree_id*/,
&parent_tree_id /*parent_tree_id*/, &parent_anchor_id /*parent_id*/);
current_anchor_id = parent_anchor_id;
current_tree_id = parent_tree_id;
}
return anchors;
}
void AXNodePosition::AnchorParent(AXTreeID* tree_id,
AXNode::AXID* parent_id) const {
DCHECK(tree_id);
DCHECK(parent_id);
*tree_id = AXTreeIDUnknown();
*parent_id = AXNode::kInvalidAXID;
if (!GetAnchor())
return;
AXNode* parent =
GetParent(GetAnchor() /*child*/, this->tree_id() /*child_tree_id*/,
tree_id /*parent_tree_id*/, parent_id /*parent_id*/);
if (!parent) {
*tree_id = AXTreeIDUnknown();
*parent_id = AXNode::kInvalidAXID;
}
}
AXNode* AXNodePosition::GetNodeInTree(AXTreeID tree_id,
AXNode::AXID node_id) const {
if (node_id == AXNode::kInvalidAXID)
return nullptr;
AXTreeManager* manager = AXTreeManagerMap::GetInstance().GetManager(tree_id);
if (manager)
return manager->GetNodeFromTree(tree_id, node_id);
return nullptr;
}
AXNode::AXID AXNodePosition::GetAnchorID(AXNode* node) const {
return node->id();
}
AXTreeID AXNodePosition::GetTreeID(AXNode* node) const {
return node->tree()->GetAXTreeID();
}
base::string16 AXNodePosition::GetText() const {
if (IsNullPosition())
return {};
base::string16 text;
if (IsEmptyObjectReplacedByCharacter()) {
text += kEmbeddedCharacter;
return text;
}
const AXNode* anchor = GetAnchor();
DCHECK(anchor);
// TODO(nektar): Replace with PlatformChildCount when AXNodePosition and
// BrowserAccessibilityPosition will make one.
if (!AnchorChildCount()) {
text =
anchor->data().GetString16Attribute(ax::mojom::StringAttribute::kValue);
if (!text.empty())
return text;
}
if (anchor->IsText()) {
return anchor->data().GetString16Attribute(
ax::mojom::StringAttribute::kName);
}
for (int i = 0; i < AnchorChildCount(); ++i)
text += CreateChildPositionAt(i)->GetText();
return text;
}
bool AXNodePosition::IsInLineBreak() const {
if (IsNullPosition())
return false;
DCHECK(GetAnchor());
return GetAnchor()->IsLineBreak();
}
bool AXNodePosition::IsInTextObject() const {
if (IsNullPosition())
return false;
DCHECK(GetAnchor());
return GetAnchor()->IsText();
}
bool AXNodePosition::IsInWhiteSpace() const {
if (IsNullPosition())
return false;
DCHECK(GetAnchor());
return GetAnchor()->IsLineBreak() ||
base::ContainsOnlyChars(GetText(), base::kWhitespaceUTF16);
}
// This override is an optimized version AXPosition::MaxTextOffset. Instead of
// concatenating the strings in GetText() to then get their text length, we sum
// the lengths of the individual strings. This is faster than concatenating the
// strings first and then taking their length, especially when the process
// is recursive.
int AXNodePosition::MaxTextOffset() const {
if (IsNullPosition())
return INVALID_OFFSET;
if (IsEmptyObjectReplacedByCharacter())
return 1;
const AXNode* anchor = GetAnchor();
DCHECK(anchor);
// TODO(nektar): Replace with PlatformChildCount when AXNodePosition and
// BrowserAccessibilityPosition will make one.
if (!AnchorChildCount()) {
base::string16 value =
anchor->data().GetString16Attribute(ax::mojom::StringAttribute::kValue);
if (!value.empty())
return value.length();
}
if (anchor->IsText()) {
return anchor->data()
.GetString16Attribute(ax::mojom::StringAttribute::kName)
.length();
}
int text_length = 0;
for (int i = 0; i < AnchorChildCount(); ++i)
text_length += CreateChildPositionAt(i)->MaxTextOffset();
return text_length;
}
bool AXNodePosition::IsInLineBreakingObject() const {
if (IsNullPosition())
return false;
DCHECK(GetAnchor());
return GetAnchor()->data().GetBoolAttribute(
ax::mojom::BoolAttribute::kIsLineBreakingObject) &&
!GetAnchor()->IsInListMarker();
}
ax::mojom::Role AXNodePosition::GetRole() const {
if (IsNullPosition())
return ax::mojom::Role::kNone;
DCHECK(GetAnchor());
return GetAnchor()->data().role;
}
AXNodeTextStyles AXNodePosition::GetTextStyles() const {
// Check either the current anchor or its parent for text styles.
AXNodeTextStyles current_anchor_text_styles =
!IsNullPosition() ? GetAnchor()->data().GetTextStyles()
: AXNodeTextStyles();
if (current_anchor_text_styles.IsUnset()) {
AXPositionInstance parent = CreateParentPosition();
if (!parent->IsNullPosition())
return parent->GetAnchor()->data().GetTextStyles();
}
return current_anchor_text_styles;
}
std::vector<int32_t> AXNodePosition::GetWordStartOffsets() const {
if (IsNullPosition())
return std::vector<int32_t>();
DCHECK(GetAnchor());
// Embedded object replacement characters are not represented in |kWordStarts|
// attribute.
if (IsEmptyObjectReplacedByCharacter())
return {0};
return GetAnchor()->data().GetIntListAttribute(
ax::mojom::IntListAttribute::kWordStarts);
}
std::vector<int32_t> AXNodePosition::GetWordEndOffsets() const {
if (IsNullPosition())
return std::vector<int32_t>();
DCHECK(GetAnchor());
// Embedded object replacement characters are not represented in |kWordEnds|
// attribute. Since the whole text exposed inside of an embedded object is of
// length 1 (the embedded object replacement character), the word end offset
// is positioned at 1. Because we want to treat the embedded object
// replacement characters as ordinary characters, it wouldn't be consistent to
// assume they have no length and return 0 instead of 1.
if (IsEmptyObjectReplacedByCharacter())
return {1};
return GetAnchor()->data().GetIntListAttribute(
ax::mojom::IntListAttribute::kWordEnds);
}
AXNode::AXID AXNodePosition::GetNextOnLineID(AXNode::AXID node_id) const {
if (IsNullPosition())
return AXNode::kInvalidAXID;
AXNode* node = GetNodeInTree(tree_id(), node_id);
int next_on_line_id;
if (!node || !node->data().GetIntAttribute(
ax::mojom::IntAttribute::kNextOnLineId, &next_on_line_id)) {
return AXNode::kInvalidAXID;
}
return static_cast<AXNode::AXID>(next_on_line_id);
}
AXNode::AXID AXNodePosition::GetPreviousOnLineID(AXNode::AXID node_id) const {
if (IsNullPosition())
return AXNode::kInvalidAXID;
AXNode* node = GetNodeInTree(tree_id(), node_id);
int previous_on_line_id;
if (!node ||
!node->data().GetIntAttribute(ax::mojom::IntAttribute::kPreviousOnLineId,
&previous_on_line_id)) {
return AXNode::kInvalidAXID;
}
return static_cast<AXNode::AXID>(previous_on_line_id);
}
AXNode* AXNodePosition::GetParent(AXNode* child,
AXTreeID child_tree_id,
AXTreeID* parent_tree_id,
AXNode::AXID* parent_id) {
DCHECK(parent_tree_id);
DCHECK(parent_id);
*parent_tree_id = AXTreeIDUnknown();
*parent_id = AXNode::kInvalidAXID;
if (!child)
return nullptr;
AXNode* parent = child->parent();
*parent_tree_id = child_tree_id;
if (!parent) {
AXTreeManager* manager =
AXTreeManagerMap::GetInstance().GetManager(child_tree_id);
if (manager) {
parent = manager->GetParentNodeFromParentTreeAsAXNode();
*parent_tree_id = manager->GetParentTreeID();
}
}
if (!parent) {
*parent_tree_id = AXTreeIDUnknown();
return parent;
}
*parent_id = parent->id();
return parent;
}
} // namespace ui