Revert of simplify bitlocker, stop calling deprecated accessBitmap() (patchset #1...
[chromium-blink-merge.git] / tools / gn / parse_tree_unittest.cc
blob29a0faf36f951890f5475f1416908c3d3e5deceb
1 // Copyright 2014 The Chromium Authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file.
5 #include "testing/gtest/include/gtest/gtest.h"
6 #include "tools/gn/input_file.h"
7 #include "tools/gn/parse_tree.h"
8 #include "tools/gn/scope.h"
9 #include "tools/gn/test_with_scope.h"
11 TEST(ParseTree, Accessor) {
12 TestWithScope setup;
14 // Make a pretend parse node with proper tracking that we can blame for the
15 // given value.
16 InputFile input_file(SourceFile("//foo"));
17 Token base_token(Location(&input_file, 1, 1, 1), Token::IDENTIFIER, "a");
18 Token member_token(Location(&input_file, 1, 1, 1), Token::IDENTIFIER, "b");
20 AccessorNode accessor;
21 accessor.set_base(base_token);
23 scoped_ptr<IdentifierNode> member_identifier(
24 new IdentifierNode(member_token));
25 accessor.set_member(member_identifier.Pass());
27 // The access should fail because a is not defined.
28 Err err;
29 Value result = accessor.Execute(setup.scope(), &err);
30 EXPECT_TRUE(err.has_error());
31 EXPECT_EQ(Value::NONE, result.type());
33 // Define a as a Scope. It should still fail because b isn't defined.
34 err = Err();
35 setup.scope()->SetValue(
36 "a", Value(nullptr, scoped_ptr<Scope>(new Scope(setup.scope()))),
37 nullptr);
38 result = accessor.Execute(setup.scope(), &err);
39 EXPECT_TRUE(err.has_error());
40 EXPECT_EQ(Value::NONE, result.type());
42 // Define b, accessor should succeed now.
43 const int64 kBValue = 42;
44 err = Err();
45 setup.scope()
46 ->GetMutableValue("a", false)
47 ->scope_value()
48 ->SetValue("b", Value(nullptr, kBValue), nullptr);
49 result = accessor.Execute(setup.scope(), &err);
50 EXPECT_FALSE(err.has_error());
51 ASSERT_EQ(Value::INTEGER, result.type());
52 EXPECT_EQ(kBValue, result.int_value());
55 TEST(ParseTree, BlockUnusedVars) {
56 TestWithScope setup;
58 // Printing both values should be OK.
60 // The crazy template definition here is a way to execute a block without
61 // defining a target. Templates require that both the target_name and the
62 // invoker be used, which is what the assertion statement inside the template
63 // does.
64 TestParseInput input_all_used(
65 "template(\"foo\") { assert(target_name != 0 && invoker != 0) }\n"
66 "foo(\"a\") {\n"
67 " a = 12\n"
68 " b = 13\n"
69 " print(\"$a $b\")\n"
70 "}");
71 EXPECT_FALSE(input_all_used.has_error());
73 Err err;
74 input_all_used.parsed()->Execute(setup.scope(), &err);
75 EXPECT_FALSE(err.has_error());
77 // Skipping one should throw an unused var error.
78 TestParseInput input_unused(
79 "foo(\"a\") {\n"
80 " a = 12\n"
81 " b = 13\n"
82 " print(\"$a\")\n"
83 "}");
84 EXPECT_FALSE(input_unused.has_error());
86 input_unused.parsed()->Execute(setup.scope(), &err);
87 EXPECT_TRUE(err.has_error());
89 // Also verify that the unused variable has the correct origin set. The
90 // origin will point to the value assigned to the variable (in this case, the
91 // "13" assigned to "b".
92 EXPECT_EQ(3, err.location().line_number());
93 EXPECT_EQ(7, err.location().char_offset());
96 TEST(ParseTree, OriginForDereference) {
97 TestWithScope setup;
98 TestParseInput input(
99 "a = 6\n"
100 "get_target_outputs(a)");
101 EXPECT_FALSE(input.has_error());
103 Err err;
104 input.parsed()->Execute(setup.scope(), &err);
105 EXPECT_TRUE(err.has_error());
107 // The origin for the "not a string" error message should be where the value
108 // was dereferenced (the "a" on the second line).
109 EXPECT_EQ(2, err.location().line_number());
110 EXPECT_EQ(20, err.location().char_offset());
113 TEST(ParseTree, SortRangeExtraction) {
114 TestWithScope setup;
116 // Ranges are [begin, end).
119 TestParseInput input(
120 "sources = [\n"
121 " \"a\",\n"
122 " \"b\",\n"
123 " \n"
124 " #\n"
125 " # Block\n"
126 " #\n"
127 " \n"
128 " \"c\","
129 " \"d\","
130 "]\n");
131 EXPECT_FALSE(input.has_error());
132 ASSERT_TRUE(input.parsed()->AsBlock());
133 ASSERT_TRUE(input.parsed()->AsBlock()->statements()[0]->AsBinaryOp());
134 const BinaryOpNode* binop =
135 input.parsed()->AsBlock()->statements()[0]->AsBinaryOp();
136 ASSERT_TRUE(binop->right()->AsList());
137 const ListNode* list = binop->right()->AsList();
138 EXPECT_EQ(5u, list->contents().size());
139 auto ranges = list->GetSortRanges();
140 ASSERT_EQ(2u, ranges.size());
141 EXPECT_EQ(0u, ranges[0].begin);
142 EXPECT_EQ(2u, ranges[0].end);
143 EXPECT_EQ(3u, ranges[1].begin);
144 EXPECT_EQ(5u, ranges[1].end);
148 TestParseInput input(
149 "sources = [\n"
150 " \"a\",\n"
151 " \"b\",\n"
152 " \n"
153 " # Attached comment.\n"
154 " \"c\","
155 " \"d\","
156 "]\n");
157 EXPECT_FALSE(input.has_error());
158 ASSERT_TRUE(input.parsed()->AsBlock());
159 ASSERT_TRUE(input.parsed()->AsBlock()->statements()[0]->AsBinaryOp());
160 const BinaryOpNode* binop =
161 input.parsed()->AsBlock()->statements()[0]->AsBinaryOp();
162 ASSERT_TRUE(binop->right()->AsList());
163 const ListNode* list = binop->right()->AsList();
164 EXPECT_EQ(4u, list->contents().size());
165 auto ranges = list->GetSortRanges();
166 ASSERT_EQ(2u, ranges.size());
167 EXPECT_EQ(0u, ranges[0].begin);
168 EXPECT_EQ(2u, ranges[0].end);
169 EXPECT_EQ(2u, ranges[1].begin);
170 EXPECT_EQ(4u, ranges[1].end);
174 TestParseInput input(
175 "sources = [\n"
176 " # At end of list.\n"
177 " \"zzzzzzzzzzz.cc\","
178 "]\n");
179 EXPECT_FALSE(input.has_error());
180 ASSERT_TRUE(input.parsed()->AsBlock());
181 ASSERT_TRUE(input.parsed()->AsBlock()->statements()[0]->AsBinaryOp());
182 const BinaryOpNode* binop =
183 input.parsed()->AsBlock()->statements()[0]->AsBinaryOp();
184 ASSERT_TRUE(binop->right()->AsList());
185 const ListNode* list = binop->right()->AsList();
186 EXPECT_EQ(1u, list->contents().size());
187 auto ranges = list->GetSortRanges();
188 ASSERT_EQ(1u, ranges.size());
189 EXPECT_EQ(0u, ranges[0].begin);
190 EXPECT_EQ(1u, ranges[0].end);
194 TestParseInput input(
195 "sources = [\n"
196 " # Block at start.\n"
197 " \n"
198 " \"z.cc\","
199 " \"y.cc\","
200 "]\n");
201 EXPECT_FALSE(input.has_error());
202 ASSERT_TRUE(input.parsed()->AsBlock());
203 ASSERT_TRUE(input.parsed()->AsBlock()->statements()[0]->AsBinaryOp());
204 const BinaryOpNode* binop =
205 input.parsed()->AsBlock()->statements()[0]->AsBinaryOp();
206 ASSERT_TRUE(binop->right()->AsList());
207 const ListNode* list = binop->right()->AsList();
208 EXPECT_EQ(3u, list->contents().size());
209 auto ranges = list->GetSortRanges();
210 ASSERT_EQ(1u, ranges.size());
211 EXPECT_EQ(1u, ranges[0].begin);
212 EXPECT_EQ(3u, ranges[0].end);
216 TEST(ParseTree, Integers) {
217 static const char* const kGood[] = {
218 "0",
219 "10",
220 "-54321",
221 "9223372036854775807", // INT64_MAX
222 "-9223372036854775808", // INT64_MIN
224 for (auto s : kGood) {
225 TestParseInput input(std::string("x = ") + s);
226 EXPECT_FALSE(input.has_error());
228 TestWithScope setup;
229 Err err;
230 input.parsed()->Execute(setup.scope(), &err);
231 EXPECT_FALSE(err.has_error());
234 static const char* const kBad[] = {
235 "-0",
236 "010",
237 "-010",
238 "9223372036854775808", // INT64_MAX + 1
239 "-9223372036854775809", // INT64_MIN - 1
241 for (auto s : kBad) {
242 TestParseInput input(std::string("x = ") + s);
243 EXPECT_FALSE(input.has_error());
245 TestWithScope setup;
246 Err err;
247 input.parsed()->Execute(setup.scope(), &err);
248 EXPECT_TRUE(err.has_error());