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
|
// Copyright (c) 2011 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 "chrome/browser/accessibility/browser_accessibility.h"
#include "base/logging.h"
#include "base/string_number_conversions.h"
#include "chrome/browser/accessibility/browser_accessibility_manager.h"
#if defined(OS_POSIX) && !defined(OS_MACOSX)
// There's no OS-specific implementation of BrowserAccessibilityManager
// on Unix, so just instantiate the base class.
// static
BrowserAccessibility* BrowserAccessibility::Create() {
return new BrowserAccessibility();
}
#endif
BrowserAccessibility::BrowserAccessibility()
: manager_(NULL),
parent_(NULL),
child_id_(0),
index_in_parent_(0),
renderer_id_(0),
ref_count_(1),
role_(0),
state_(0),
instance_active_(false) {
}
BrowserAccessibility::~BrowserAccessibility() {
}
void BrowserAccessibility::DetachTree(
std::vector<BrowserAccessibility*>* nodes) {
nodes->push_back(this);
for (size_t i = 0; i < children_.size(); i++)
children_[i]->DetachTree(nodes);
children_.clear();
parent_ = NULL;
}
void BrowserAccessibility::Initialize(
BrowserAccessibilityManager* manager,
BrowserAccessibility* parent,
int32 child_id,
int32 index_in_parent,
const webkit_glue::WebAccessibility& src) {
manager_ = manager;
parent_ = parent;
child_id_ = child_id;
index_in_parent_ = index_in_parent;
renderer_id_ = src.id;
name_ = src.name;
value_ = src.value;
attributes_ = src.attributes;
html_attributes_ = src.html_attributes;
location_ = src.location;
role_ = src.role;
state_ = src.state;
indirect_child_ids_ = src.indirect_child_ids;
line_breaks_ = src.line_breaks;
Initialize();
}
void BrowserAccessibility::Initialize() {
instance_active_ = true;
}
void BrowserAccessibility::AddChild(BrowserAccessibility* child) {
children_.push_back(child);
}
void BrowserAccessibility::UpdateParent(BrowserAccessibility* parent,
int index_in_parent) {
parent_ = parent;
index_in_parent_ = index_in_parent;
}
bool BrowserAccessibility::IsDescendantOf(
BrowserAccessibility* ancestor) {
if (this == ancestor) {
return true;
} else if (parent_) {
return parent_->IsDescendantOf(ancestor);
}
return false;
}
BrowserAccessibility* BrowserAccessibility::GetChild(uint32 child_index) {
DCHECK(child_index < children_.size());
return children_[child_index];
}
BrowserAccessibility* BrowserAccessibility::GetPreviousSibling() {
if (parent_ && index_in_parent_ > 0)
return parent_->children_[index_in_parent_ - 1];
return NULL;
}
BrowserAccessibility* BrowserAccessibility::GetNextSibling() {
if (parent_ &&
index_in_parent_ >= 0 &&
index_in_parent_ < static_cast<int>(parent_->children_.size() - 1)) {
return parent_->children_[index_in_parent_ + 1];
}
return NULL;
}
gfx::Rect BrowserAccessibility::GetBoundsRect() {
gfx::Rect bounds = location_;
// Adjust the bounds by the top left corner of the containing view's bounds
// in screen coordinates.
gfx::Point top_left = manager_->GetViewBounds().origin();
bounds.Offset(top_left);
// Adjust top left position by the root document's scroll offset.
BrowserAccessibility* root = manager_->GetRoot();
int scroll_x = 0;
int scroll_y = 0;
root->GetAttributeAsInt(
WebAccessibility::ATTR_DOC_SCROLLX, &scroll_x);
root->GetAttributeAsInt(
WebAccessibility::ATTR_DOC_SCROLLY, &scroll_y);
bounds.Offset(-scroll_x, -scroll_y);
return bounds;
}
BrowserAccessibility* BrowserAccessibility::BrowserAccessibilityForPoint(
const gfx::Point& point) {
// Walk the children recursively looking for the BrowserAccessibility that
// most tightly encloses the specified point.
for (int i = children_.size() - 1; i >= 0; --i) {
BrowserAccessibility* child = children_[i];
if (child->GetBoundsRect().Contains(point))
return child->BrowserAccessibilityForPoint(point);
}
return this;
}
void BrowserAccessibility::InternalAddReference() {
ref_count_++;
}
void BrowserAccessibility::InternalReleaseReference(bool recursive) {
DCHECK_GT(ref_count_, 0);
if (recursive || ref_count_ == 1) {
for (std::vector<BrowserAccessibility*>::iterator iter = children_.begin();
iter != children_.end();
++iter) {
(*iter)->InternalReleaseReference(true);
}
}
ref_count_--;
if (ref_count_ == 0) {
instance_active_ = false;
children_.clear();
manager_->Remove(child_id_, renderer_id_);
NativeReleaseReference();
}
}
void BrowserAccessibility::NativeReleaseReference() {
delete this;
}
bool BrowserAccessibility::HasAttribute(
WebAccessibility::Attribute attribute) {
return (attributes_.find(attribute) != attributes_.end());
}
bool BrowserAccessibility::GetAttribute(
WebAccessibility::Attribute attribute, string16* value) {
std::map<int32, string16>::iterator iter = attributes_.find(attribute);
if (iter != attributes_.end()) {
*value = iter->second;
return true;
}
return false;
}
bool BrowserAccessibility::GetAttributeAsInt(
WebAccessibility::Attribute attribute, int* value_int) {
string16 value_str;
if (!GetAttribute(attribute, &value_str))
return false;
if (!base::StringToInt(value_str, value_int))
return false;
return true;
}
|
