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
|
// Copyright (c) 2012 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 "content/browser/accessibility/accessibility_tree_formatter.h"
#include <stddef.h>
#include "base/logging.h"
#include "base/memory/scoped_ptr.h"
#include "base/strings/pattern.h"
#include "base/strings/string_number_conversions.h"
#include "base/strings/string_util.h"
#include "base/strings/stringprintf.h"
#include "base/strings/utf_string_conversions.h"
#include "content/browser/accessibility/browser_accessibility_manager.h"
#include "content/browser/renderer_host/render_widget_host_view_base.h"
#include "content/browser/web_contents/web_contents_impl.h"
#include "content/public/browser/web_contents.h"
namespace content {
namespace {
const char kIndentSymbol = '+';
const int kIndentSymbolCount = 2;
const char* kSkipString = "@NO_DUMP";
const char* kSkipChildren = "@NO_CHILDREN_DUMP";
const char* kChildrenDictAttr = "children";
}
AccessibilityTreeFormatter::AccessibilityTreeFormatter()
: show_ids_(false) {
}
AccessibilityTreeFormatter::~AccessibilityTreeFormatter() {
}
scoped_ptr<base::DictionaryValue>
AccessibilityTreeFormatter::BuildAccessibilityTree(
BrowserAccessibility* root) {
CHECK(root);
scoped_ptr<base::DictionaryValue> dict(new base::DictionaryValue);
RecursiveBuildAccessibilityTree(*root, dict.get());
return dict.Pass();
}
void AccessibilityTreeFormatter::FormatAccessibilityTree(
BrowserAccessibility* root, base::string16* contents) {
scoped_ptr<base::DictionaryValue> dict = BuildAccessibilityTree(root);
RecursiveFormatAccessibilityTree(*(dict.get()), contents);
}
void AccessibilityTreeFormatter::RecursiveBuildAccessibilityTree(
const BrowserAccessibility& node, base::DictionaryValue* dict) {
AddProperties(node, dict);
base::ListValue* children = new base::ListValue;
dict->Set(kChildrenDictAttr, children);
for (size_t i = 0; i < ChildCount(node); ++i) {
BrowserAccessibility* child_node = GetChild(node, i);
base::DictionaryValue* child_dict = new base::DictionaryValue;
children->Append(child_dict);
RecursiveBuildAccessibilityTree(*child_node, child_dict);
}
}
void AccessibilityTreeFormatter::RecursiveFormatAccessibilityTree(
const base::DictionaryValue& dict, base::string16* contents, int depth) {
base::string16 indent = base::string16(depth * kIndentSymbolCount,
kIndentSymbol);
base::string16 line = indent + ToString(dict);
if (line.find(base::ASCIIToUTF16(kSkipString)) != base::string16::npos)
return;
*contents += line + base::ASCIIToUTF16("\n");
if (line.find(base::ASCIIToUTF16(kSkipChildren)) != base::string16::npos)
return;
const base::ListValue* children;
dict.GetList(kChildrenDictAttr, &children);
const base::DictionaryValue* child_dict;
for (size_t i = 0; i < children->GetSize(); i++) {
children->GetDictionary(i, &child_dict);
RecursiveFormatAccessibilityTree(*child_dict, contents, depth + 1);
}
}
void AccessibilityTreeFormatter::SetFilters(
const std::vector<Filter>& filters) {
filters_ = filters;
}
uint32_t AccessibilityTreeFormatter::ChildCount(
const BrowserAccessibility& node) const {
return node.PlatformChildCount();
}
BrowserAccessibility* AccessibilityTreeFormatter::GetChild(
const BrowserAccessibility& node,
uint32_t i) const {
return node.PlatformGetChild(i);
}
// static
bool AccessibilityTreeFormatter::MatchesFilters(
const std::vector<Filter>& filters,
const base::string16& text,
bool default_result) {
std::vector<Filter>::const_iterator iter = filters.begin();
bool allow = default_result;
for (iter = filters.begin(); iter != filters.end(); ++iter) {
if (base::MatchPattern(text, iter->match_str)) {
if (iter->type == Filter::ALLOW_EMPTY)
allow = true;
else if (iter->type == Filter::ALLOW)
allow = (!base::MatchPattern(text, base::UTF8ToUTF16("*=''")));
else
allow = false;
}
}
return allow;
}
bool AccessibilityTreeFormatter::MatchesFilters(
const base::string16& text, bool default_result) const {
return MatchesFilters(filters_, text, default_result);
}
base::string16 AccessibilityTreeFormatter::FormatCoordinates(
const char* name, const char* x_name, const char* y_name,
const base::DictionaryValue& value) {
int x, y;
value.GetInteger(x_name, &x);
value.GetInteger(y_name, &y);
std::string xy_str(base::StringPrintf("%s=(%d, %d)", name, x, y));
return base::UTF8ToUTF16(xy_str);
}
void AccessibilityTreeFormatter::WriteAttribute(
bool include_by_default, const std::string& attr, base::string16* line) {
WriteAttribute(include_by_default, base::UTF8ToUTF16(attr), line);
}
void AccessibilityTreeFormatter::WriteAttribute(
bool include_by_default, const base::string16& attr, base::string16* line) {
if (attr.empty())
return;
if (!MatchesFilters(attr, include_by_default))
return;
if (!line->empty())
*line += base::ASCIIToUTF16(" ");
*line += attr;
}
} // namespace content
|
