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
|
// Copyright (c) 2013 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 "ppapi/shared_impl/unittest_utils.h"
#include <cmath>
#include "base/containers/hash_tables.h"
#include "base/logging.h"
#include "ppapi/shared_impl/array_var.h"
#include "ppapi/shared_impl/dictionary_var.h"
#include "ppapi/shared_impl/var.h"
#include "ppapi/shared_impl/var_tracker.h"
namespace ppapi {
namespace {
// When two vars x and y are found to be equal, an entry is inserted into
// |visited_map| with (x.value.as_id, y.value.as_id). This allows reference
// cycles to be avoided. It also allows us to associate nodes in |expected| with
// nodes in |actual| and check whether the graphs have equivalent topology.
bool Equals(const PP_Var& expected,
const PP_Var& actual,
base::hash_map<int64_t, int64_t>* visited_map) {
if (expected.type != actual.type) {
LOG(ERROR) << "expected type: " << expected.type <<
" actual type: " << actual.type;
return false;
}
if (VarTracker::IsVarTypeRefcounted(expected.type)) {
base::hash_map<int64_t, int64_t>::iterator it =
visited_map->find(expected.value.as_id);
if (it != visited_map->end()) {
if (it->second != actual.value.as_id) {
LOG(ERROR) << "expected id: " << it->second << " actual id: " <<
actual.value.as_id;
return false;
} else {
return true;
}
} else {
(*visited_map)[expected.value.as_id] = actual.value.as_id;
}
}
switch (expected.type) {
case PP_VARTYPE_UNDEFINED:
return true;
case PP_VARTYPE_NULL:
return true;
case PP_VARTYPE_BOOL:
if (expected.value.as_bool != actual.value.as_bool) {
LOG(ERROR) << "expected: " << expected.value.as_bool << " actual: " <<
actual.value.as_bool;
return false;
}
return true;
case PP_VARTYPE_INT32:
if (expected.value.as_int != actual.value.as_int) {
LOG(ERROR) << "expected: " << expected.value.as_int << " actual: " <<
actual.value.as_int;
return false;
}
return true;
case PP_VARTYPE_DOUBLE:
if (fabs(expected.value.as_double - actual.value.as_double) > 1.0e-4) {
LOG(ERROR) << "expected: " << expected.value.as_double <<
" actual: " << actual.value.as_double;
return false;
}
return true;
case PP_VARTYPE_OBJECT:
if (expected.value.as_id != actual.value.as_id) {
LOG(ERROR) << "expected: " << expected.value.as_id << " actual: " <<
actual.value.as_id;
return false;
}
return true;
case PP_VARTYPE_STRING: {
StringVar* expected_var = StringVar::FromPPVar(expected);
StringVar* actual_var = StringVar::FromPPVar(actual);
DCHECK(expected_var && actual_var);
if (expected_var->value() != actual_var->value()) {
LOG(ERROR) << "expected: " << expected_var->value() << " actual: " <<
actual_var->value();
return false;
}
return true;
}
case PP_VARTYPE_ARRAY_BUFFER: {
ArrayBufferVar* expected_var = ArrayBufferVar::FromPPVar(expected);
ArrayBufferVar* actual_var = ArrayBufferVar::FromPPVar(actual);
DCHECK(expected_var && actual_var);
if (expected_var->ByteLength() != actual_var->ByteLength()) {
LOG(ERROR) << "expected: " << expected_var->ByteLength() <<
" actual: " << actual_var->ByteLength();
return false;
}
if (memcmp(expected_var->Map(), actual_var->Map(),
expected_var->ByteLength()) != 0) {
LOG(ERROR) << "expected array buffer does not match actual.";
return false;
}
return true;
}
case PP_VARTYPE_ARRAY: {
ArrayVar* expected_var = ArrayVar::FromPPVar(expected);
ArrayVar* actual_var = ArrayVar::FromPPVar(actual);
DCHECK(expected_var && actual_var);
if (expected_var->elements().size() != actual_var->elements().size()) {
LOG(ERROR) << "expected: " << expected_var->elements().size() <<
" actual: " << actual_var->elements().size();
return false;
}
for (size_t i = 0; i < expected_var->elements().size(); ++i) {
if (!Equals(expected_var->elements()[i].get(),
actual_var->elements()[i].get(),
visited_map)) {
return false;
}
}
return true;
}
case PP_VARTYPE_DICTIONARY: {
DictionaryVar* expected_var = DictionaryVar::FromPPVar(expected);
DictionaryVar* actual_var = DictionaryVar::FromPPVar(actual);
DCHECK(expected_var && actual_var);
if (expected_var->key_value_map().size() !=
actual_var->key_value_map().size()) {
LOG(ERROR) << "expected: " << expected_var->key_value_map().size() <<
" actual: " << actual_var->key_value_map().size();
return false;
}
DictionaryVar::KeyValueMap::const_iterator expected_iter =
expected_var->key_value_map().begin();
DictionaryVar::KeyValueMap::const_iterator actual_iter =
actual_var->key_value_map().begin();
for ( ; expected_iter != expected_var->key_value_map().end();
++expected_iter, ++actual_iter) {
if (expected_iter->first != actual_iter->first) {
LOG(ERROR) << "expected: " << expected_iter->first <<
" actual: " << actual_iter->first;
return false;
}
if (!Equals(expected_iter->second.get(),
actual_iter->second.get(),
visited_map)) {
return false;
}
}
return true;
}
}
NOTREACHED();
return false;
}
} // namespace
bool TestEqual(const PP_Var& expected, const PP_Var& actual) {
base::hash_map<int64_t, int64_t> visited_map;
return Equals(expected, actual, &visited_map);
}
} // namespace ppapi
|
