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
|
// Copyright 2018 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include <string>
#include <utility>
#include "base/test/gtest_util.h"
#include "base/values.h"
#include "mojo/public/cpp/base/values_mojom_traits.h"
#include "mojo/public/cpp/bindings/lib/validation_context.h"
#include "mojo/public/cpp/bindings/lib/validation_errors.h"
#include "mojo/public/cpp/test_support/test_utils.h"
#include "mojo/public/mojom/base/values.mojom.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace mojo_base {
TEST(ValuesStructTraitsTest, NullValue) {
base::Value in;
base::Value out;
ASSERT_TRUE(mojo::test::SerializeAndDeserialize<mojom::Value>(in, out));
EXPECT_EQ(in, out);
}
TEST(ValuesStructTraitsTest, BoolValue) {
static constexpr bool kTestCases[] = {true, false};
for (auto& test_case : kTestCases) {
base::Value in(test_case);
base::Value out;
ASSERT_TRUE(mojo::test::SerializeAndDeserialize<mojom::Value>(in, out));
EXPECT_EQ(in, out);
}
}
TEST(ValuesStructTraitsTest, IntValue) {
static constexpr int kTestCases[] = {0, -1, 1,
std::numeric_limits<int>::min(),
std::numeric_limits<int>::max()};
for (auto& test_case : kTestCases) {
base::Value in(test_case);
base::Value out;
ASSERT_TRUE(mojo::test::SerializeAndDeserialize<mojom::Value>(in, out));
EXPECT_EQ(in, out);
}
}
TEST(ValuesStructTraitsTest, DoubleValue) {
static constexpr double kTestCases[] = {-0.0,
+0.0,
-1.0,
+1.0,
std::numeric_limits<double>::min(),
std::numeric_limits<double>::max()};
for (auto& test_case : kTestCases) {
base::Value in(test_case);
base::Value out;
ASSERT_TRUE(mojo::test::SerializeAndDeserialize<mojom::Value>(in, out));
EXPECT_EQ(in, out);
}
}
TEST(ValuesStructTraitsTest, StringValue) {
static constexpr const char* kTestCases[] = {
"", "ascii",
// 🎆: Unicode FIREWORKS
"\xf0\x9f\x8e\x86",
};
for (auto* test_case : kTestCases) {
base::Value in(test_case);
base::Value out;
ASSERT_TRUE(mojo::test::SerializeAndDeserialize<mojom::Value>(in, out));
EXPECT_EQ(in, out);
}
}
TEST(ValuesStructTraitsTest, BinaryValue) {
std::vector<char> kBinaryData = {'\x00', '\x80', '\xff', '\x7f', '\x01'};
base::Value in(std::move(kBinaryData));
base::Value out;
ASSERT_TRUE(mojo::test::SerializeAndDeserialize<mojom::Value>(in, out));
EXPECT_EQ(in, out);
}
TEST(ValuesStructTraitsTest, DictionaryValue) {
// Note: here and below, it would be nice to use an initializer list, but
// move-only types and initializer lists don't mix. Initializer lists can't be
// modified: thus it's not possible to move.
base::Value::Dict dict;
dict.Set("null", base::Value());
dict.Set("bool", false);
dict.Set("int", 0);
dict.Set("double", 0.0);
dict.Set("string", "0");
dict.Set("binary", base::Value::BlobStorage({0}));
dict.Set("dictionary", base::Value::Dict());
dict.Set("list", base::Value::List());
base::Value in(std::move(dict));
base::Value out;
ASSERT_TRUE(mojo::test::SerializeAndDeserialize<mojom::Value>(in, out));
EXPECT_EQ(in, out);
base::Value::Dict in_dict = in.GetDict().Clone();
base::Value::Dict out_dict;
ASSERT_TRUE(mojo::test::SerializeAndDeserialize<mojom::DictionaryValue>(
in_dict, out_dict));
EXPECT_EQ(in_dict, out_dict);
}
TEST(ValuesStructTraitsTest, ListValue) {
base::Value::List list;
list.Append(base::Value());
list.Append(false);
list.Append(0);
list.Append(0.0);
list.Append("0");
list.Append(base::Value::BlobStorage({0}));
list.Append(base::Value::Dict());
list.Append(base::Value::List());
base::Value in(std::move(list));
base::Value out;
ASSERT_TRUE(mojo::test::SerializeAndDeserialize<mojom::Value>(in, out));
EXPECT_EQ(in, out);
base::Value::List in_list = in.GetList().Clone();
base::Value::List out_list;
ASSERT_TRUE(
mojo::test::SerializeAndDeserialize<mojom::ListValue>(in_list, out_list));
EXPECT_EQ(in_list, out_list);
}
// A deeply nested base::Value should trigger a deserialization error.
TEST(ValuesStructTraitsTest, DeeplyNestedValue) {
base::Value in;
for (int i = 0; i < kMaxRecursionDepth; ++i) {
base::Value::List list;
list.Append(std::move(in));
in = base::Value(std::move(list));
}
// It should work if the depth is less than kMaxRecursionDepth.
{
mojo::internal::ValidationErrorObserverForTesting warning_observer{
base::DoNothing()};
base::Value out;
ASSERT_TRUE(mojo::test::SerializeAndDeserialize<mojom::Value>(in, out));
EXPECT_EQ(mojo::internal::VALIDATION_ERROR_NONE,
warning_observer.last_error());
}
// Add one more depth.
base::Value::List list;
list.Append(std::move(in));
in = base::Value(std::move(list));
// It gets VALIDATION_ERROR_MAX_RECURSION_DEPTH error.
{
mojo::internal::ValidationErrorObserverForTesting warning_observer{
base::DoNothing()};
base::Value out;
ASSERT_FALSE(mojo::test::SerializeAndDeserialize<mojom::Value>(in, out));
EXPECT_EQ(mojo::internal::VALIDATION_ERROR_MAX_RECURSION_DEPTH,
warning_observer.last_error());
}
}
} // namespace mojo_base
|