tree_test.cpp 7.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189
  1. // Part of the Carbon Language project, under the Apache License v2.0 with LLVM
  2. // Exceptions. See /LICENSE for license information.
  3. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  4. #include "toolchain/parse/tree.h"
  5. #include <gmock/gmock.h>
  6. #include <gtest/gtest.h>
  7. #include <forward_list>
  8. #include "testing/base/test_raw_ostream.h"
  9. #include "toolchain/base/value_store.h"
  10. #include "toolchain/diagnostics/diagnostic_emitter.h"
  11. #include "toolchain/diagnostics/mocks.h"
  12. #include "toolchain/lex/lex.h"
  13. #include "toolchain/lex/tokenized_buffer.h"
  14. #include "toolchain/parse/parse.h"
  15. #include "toolchain/parse/tree_and_subtrees.h"
  16. #include "toolchain/testing/yaml_test_helpers.h"
  17. namespace Carbon::Parse {
  18. namespace {
  19. using ::Carbon::Testing::TestRawOstream;
  20. using ::testing::ElementsAre;
  21. using ::testing::Pair;
  22. namespace Yaml = ::Carbon::Testing::Yaml;
  23. class TreeTest : public ::testing::Test {
  24. protected:
  25. auto GetSourceBuffer(llvm::StringRef t) -> SourceBuffer& {
  26. CARBON_CHECK(fs_.addFile("test.carbon", /*ModificationTime=*/0,
  27. llvm::MemoryBuffer::getMemBuffer(t)));
  28. source_storage_.push_front(
  29. std::move(*SourceBuffer::MakeFromFile(fs_, "test.carbon", consumer_)));
  30. return source_storage_.front();
  31. }
  32. auto GetTokenizedBuffer(llvm::StringRef t) -> Lex::TokenizedBuffer& {
  33. token_storage_.push_front(
  34. Lex::Lex(value_stores_, GetSourceBuffer(t), consumer_));
  35. return token_storage_.front();
  36. }
  37. SharedValueStores value_stores_;
  38. llvm::vfs::InMemoryFileSystem fs_;
  39. std::forward_list<SourceBuffer> source_storage_;
  40. std::forward_list<Lex::TokenizedBuffer> token_storage_;
  41. DiagnosticConsumer& consumer_ = ConsoleDiagnosticConsumer();
  42. };
  43. TEST_F(TreeTest, IsValid) {
  44. Lex::TokenizedBuffer& tokens = GetTokenizedBuffer("");
  45. Tree tree = Parse(tokens, consumer_, /*vlog_stream=*/nullptr);
  46. EXPECT_TRUE((*tree.postorder().begin()).is_valid());
  47. }
  48. TEST_F(TreeTest, AsAndTryAs) {
  49. Lex::TokenizedBuffer& tokens = GetTokenizedBuffer("fn F();");
  50. Tree tree = Parse(tokens, consumer_, /*vlog_stream=*/nullptr);
  51. ASSERT_FALSE(tree.has_errors());
  52. TreeAndSubtrees tree_and_subtrees(tokens, tree);
  53. auto it = tree_and_subtrees.roots().begin();
  54. // A FileEnd node, so won't match.
  55. NodeId n = *it;
  56. // NodeIdForKind
  57. std::optional<FunctionDeclId> fn_decl_id = tree.TryAs<FunctionDeclId>(n);
  58. EXPECT_FALSE(fn_decl_id.has_value());
  59. // NodeIdOneOf
  60. std::optional<AnyFunctionDeclId> any_fn_decl_id =
  61. tree.TryAs<AnyFunctionDeclId>(n);
  62. EXPECT_FALSE(any_fn_decl_id.has_value());
  63. // NodeIdInCategory
  64. std::optional<AnyDeclId> any_decl_id = tree.TryAs<AnyDeclId>(n);
  65. EXPECT_FALSE(any_decl_id.has_value());
  66. ++it;
  67. n = *it;
  68. // A FunctionDecl node, so will match.
  69. fn_decl_id = tree.TryAs<FunctionDeclId>(n);
  70. ASSERT_TRUE(fn_decl_id.has_value());
  71. EXPECT_TRUE(*fn_decl_id == n);
  72. // Under normal usage, this function should be used with `auto`, but for
  73. // a test it is nice to verify that it is returning the expected type.
  74. // NOLINTNEXTLINE(modernize-use-auto).
  75. FunctionDeclId fn_decl_id2 = tree.As<FunctionDeclId>(n);
  76. EXPECT_TRUE(*fn_decl_id == fn_decl_id2);
  77. any_fn_decl_id = tree.TryAs<AnyFunctionDeclId>(n);
  78. ASSERT_TRUE(any_fn_decl_id.has_value());
  79. EXPECT_TRUE(*any_fn_decl_id == n);
  80. // NOLINTNEXTLINE(modernize-use-auto).
  81. AnyFunctionDeclId any_fn_decl_id2 = tree.As<AnyFunctionDeclId>(n);
  82. EXPECT_TRUE(*any_fn_decl_id == any_fn_decl_id2);
  83. any_decl_id = tree.TryAs<AnyDeclId>(n);
  84. ASSERT_TRUE(any_decl_id.has_value());
  85. EXPECT_TRUE(*any_decl_id == n);
  86. // NOLINTNEXTLINE(modernize-use-auto).
  87. AnyDeclId any_decl_id2 = tree.As<AnyDeclId>(n);
  88. EXPECT_TRUE(*any_decl_id == any_decl_id2);
  89. }
  90. TEST_F(TreeTest, PrintPostorderAsYAML) {
  91. Lex::TokenizedBuffer& tokens = GetTokenizedBuffer("fn F();");
  92. Tree tree = Parse(tokens, consumer_, /*vlog_stream=*/nullptr);
  93. EXPECT_FALSE(tree.has_errors());
  94. TestRawOstream print_stream;
  95. tree.Print(print_stream);
  96. auto file = Yaml::Sequence(ElementsAre(
  97. Yaml::Mapping(ElementsAre(Pair("kind", "FileStart"), Pair("text", ""))),
  98. Yaml::Mapping(
  99. ElementsAre(Pair("kind", "FunctionIntroducer"), Pair("text", "fn"))),
  100. Yaml::Mapping(
  101. ElementsAre(Pair("kind", "IdentifierName"), Pair("text", "F"))),
  102. Yaml::Mapping(
  103. ElementsAre(Pair("kind", "TuplePatternStart"), Pair("text", "("))),
  104. Yaml::Mapping(ElementsAre(Pair("kind", "TuplePattern"), Pair("text", ")"),
  105. Pair("subtree_size", "2"))),
  106. Yaml::Mapping(ElementsAre(Pair("kind", "FunctionDecl"), Pair("text", ";"),
  107. Pair("subtree_size", "5"))),
  108. Yaml::Mapping(ElementsAre(Pair("kind", "FileEnd"), Pair("text", "")))));
  109. auto root = Yaml::Sequence(ElementsAre(Yaml::Mapping(
  110. ElementsAre(Pair("filename", "test.carbon"), Pair("parse_tree", file)))));
  111. EXPECT_THAT(Yaml::Value::FromText(print_stream.TakeStr()),
  112. IsYaml(ElementsAre(root)));
  113. }
  114. TEST_F(TreeTest, PrintPreorderAsYAML) {
  115. Lex::TokenizedBuffer& tokens = GetTokenizedBuffer("fn F();");
  116. Tree tree = Parse(tokens, consumer_, /*vlog_stream=*/nullptr);
  117. EXPECT_FALSE(tree.has_errors());
  118. TreeAndSubtrees tree_and_subtrees(tokens, tree);
  119. TestRawOstream print_stream;
  120. tree_and_subtrees.PrintPreorder(print_stream);
  121. auto param_list = Yaml::Sequence(ElementsAre(Yaml::Mapping(
  122. ElementsAre(Pair("node_index", "3"), Pair("kind", "TuplePatternStart"),
  123. Pair("text", "(")))));
  124. auto function_decl = Yaml::Sequence(ElementsAre(
  125. Yaml::Mapping(ElementsAre(Pair("node_index", "1"),
  126. Pair("kind", "FunctionIntroducer"),
  127. Pair("text", "fn"))),
  128. Yaml::Mapping(ElementsAre(Pair("node_index", "2"),
  129. Pair("kind", "IdentifierName"),
  130. Pair("text", "F"))),
  131. Yaml::Mapping(ElementsAre(Pair("node_index", "4"),
  132. Pair("kind", "TuplePattern"), Pair("text", ")"),
  133. Pair("subtree_size", "2"),
  134. Pair("children", param_list)))));
  135. auto file = Yaml::Sequence(ElementsAre(
  136. Yaml::Mapping(ElementsAre(Pair("node_index", "0"),
  137. Pair("kind", "FileStart"), Pair("text", ""))),
  138. Yaml::Mapping(ElementsAre(Pair("node_index", "5"),
  139. Pair("kind", "FunctionDecl"), Pair("text", ";"),
  140. Pair("subtree_size", "5"),
  141. Pair("children", function_decl))),
  142. Yaml::Mapping(ElementsAre(Pair("node_index", "6"),
  143. Pair("kind", "FileEnd"), Pair("text", "")))));
  144. auto root = Yaml::Sequence(ElementsAre(Yaml::Mapping(
  145. ElementsAre(Pair("filename", "test.carbon"), Pair("parse_tree", file)))));
  146. EXPECT_THAT(Yaml::Value::FromText(print_stream.TakeStr()),
  147. IsYaml(ElementsAre(root)));
  148. }
  149. TEST_F(TreeTest, HighRecursion) {
  150. std::string code = "fn Foo() { return ";
  151. code.append(10000, '(');
  152. code.append(10000, ')');
  153. code += "; }";
  154. Lex::TokenizedBuffer& tokens = GetTokenizedBuffer(code);
  155. ASSERT_FALSE(tokens.has_errors());
  156. Testing::MockDiagnosticConsumer consumer;
  157. Tree tree = Parse(tokens, consumer, /*vlog_stream=*/nullptr);
  158. EXPECT_FALSE(tree.has_errors());
  159. }
  160. } // namespace
  161. } // namespace Carbon::Parse