semantics_parse_tree_handler.cpp 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295
  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/semantics/semantics_parse_tree_handler.h"
  5. #include "common/vlog.h"
  6. #include "llvm/Support/PrettyStackTrace.h"
  7. #include "toolchain/lexer/token_kind.h"
  8. #include "toolchain/lexer/tokenized_buffer.h"
  9. #include "toolchain/parser/parse_node_kind.h"
  10. #include "toolchain/semantics/semantics_builtin_kind.h"
  11. #include "toolchain/semantics/semantics_node.h"
  12. namespace Carbon {
  13. class SemanticsParseTreeHandler::PrettyStackTraceNodeStack
  14. : public llvm::PrettyStackTraceEntry {
  15. public:
  16. explicit PrettyStackTraceNodeStack(const SemanticsParseTreeHandler* handler)
  17. : handler_(handler) {}
  18. ~PrettyStackTraceNodeStack() override = default;
  19. auto print(llvm::raw_ostream& output) const -> void override {
  20. output << "node_stack_:\n";
  21. for (int i = 0; i < static_cast<int>(handler_->node_stack_.size()); ++i) {
  22. const auto& entry = handler_->node_stack_[i];
  23. output << "\t" << i << ".\t"
  24. << handler_->parse_tree_->node_kind(entry.parse_node);
  25. if (entry.result_id) {
  26. output << " -> " << *entry.result_id;
  27. }
  28. output << "\n";
  29. }
  30. }
  31. private:
  32. const SemanticsParseTreeHandler* handler_;
  33. };
  34. class SemanticsParseTreeHandler::PrettyStackTraceNodeBlockStack
  35. : public llvm::PrettyStackTraceEntry {
  36. public:
  37. explicit PrettyStackTraceNodeBlockStack(
  38. const SemanticsParseTreeHandler* handler)
  39. : handler_(handler) {}
  40. ~PrettyStackTraceNodeBlockStack() override = default;
  41. auto print(llvm::raw_ostream& output) const -> void override {
  42. output << "node_block_stack_:\n";
  43. for (int i = 0; i < static_cast<int>(handler_->node_block_stack_.size());
  44. ++i) {
  45. const auto& entry = handler_->node_block_stack_[i];
  46. output << "\t" << i << ".\t" << entry << "\n";
  47. }
  48. }
  49. private:
  50. const SemanticsParseTreeHandler* handler_;
  51. };
  52. auto SemanticsParseTreeHandler::Build() -> void {
  53. PrettyStackTraceNodeStack pretty_node_stack(this);
  54. PrettyStackTraceNodeBlockStack pretty_node_block_stack(this);
  55. // Add a block for the ParseTree.
  56. node_block_stack_.push_back(semantics_->AddNodeBlock());
  57. auto range = parse_tree_->postorder();
  58. for (auto it = range.begin();; ++it) {
  59. auto parse_node = *it;
  60. switch (auto parse_kind = parse_tree_->node_kind(parse_node)) {
  61. case ParseNodeKind::FunctionDefinition(): {
  62. HandleFunctionDefinition(parse_node);
  63. break;
  64. }
  65. case ParseNodeKind::FunctionDefinitionStart(): {
  66. HandleFunctionDefinitionStart(parse_node);
  67. break;
  68. }
  69. case ParseNodeKind::FileEnd(): {
  70. ++it;
  71. CARBON_CHECK(node_block_stack_.size() == 1) << node_block_stack_.size();
  72. CARBON_CHECK(it == range.end())
  73. << "FileEnd should always be last, found "
  74. << parse_tree_->node_kind(*it);
  75. return;
  76. }
  77. case ParseNodeKind::InfixOperator(): {
  78. HandleInfixOperator(parse_node);
  79. break;
  80. }
  81. case ParseNodeKind::Literal(): {
  82. HandleLiteral(parse_node);
  83. break;
  84. }
  85. case ParseNodeKind::ParameterList(): {
  86. HandleParameterList(parse_node);
  87. break;
  88. }
  89. case ParseNodeKind::ReturnStatement(): {
  90. HandleReturnStatement(parse_node);
  91. break;
  92. }
  93. case ParseNodeKind::DeclaredName():
  94. case ParseNodeKind::FunctionIntroducer():
  95. case ParseNodeKind::ParameterListStart():
  96. case ParseNodeKind::ReturnStatementStart(): {
  97. // The token has no action, but we still track it for the stack.
  98. Push(parse_node);
  99. break;
  100. }
  101. default: {
  102. CARBON_FATAL() << "In ParseTree at index " << parse_node
  103. << ", unhandled NodeKind " << parse_kind;
  104. }
  105. }
  106. }
  107. llvm_unreachable("Should always end at FileEnd");
  108. }
  109. auto SemanticsParseTreeHandler::AddNode(SemanticsNode node) -> SemanticsNodeId {
  110. CARBON_VLOG() << "AddNode " << node_block_stack_.back() << ": " << node
  111. << "\n";
  112. return semantics_->AddNode(node_block_stack_.back(), node);
  113. }
  114. auto SemanticsParseTreeHandler::Push(ParseTree::Node parse_node) -> void {
  115. CARBON_VLOG() << "Push " << node_stack_.size() << ": "
  116. << parse_tree_->node_kind(parse_node) << "\n";
  117. CARBON_CHECK(node_stack_.size() < (1 << 20))
  118. << "Excessive stack size: likely infinite loop";
  119. node_stack_.push_back({parse_node, std::nullopt});
  120. }
  121. auto SemanticsParseTreeHandler::Push(ParseTree::Node parse_node,
  122. SemanticsNode node) -> void {
  123. CARBON_VLOG() << "Push " << node_stack_.size() << ": "
  124. << parse_tree_->node_kind(parse_node) << " -> " << node.kind()
  125. << "\n";
  126. CARBON_CHECK(node_stack_.size() < (1 << 20))
  127. << "Excessive stack size: likely infinite loop";
  128. auto node_id = AddNode(node);
  129. node_stack_.push_back({parse_node, node_id});
  130. }
  131. auto SemanticsParseTreeHandler::Pop(ParseNodeKind pop_parse_kind) -> void {
  132. auto back = node_stack_.pop_back_val();
  133. auto parse_kind = parse_tree_->node_kind(back.parse_node);
  134. CARBON_VLOG() << "Pop " << node_stack_.size() << ": " << pop_parse_kind
  135. << "\n";
  136. CARBON_CHECK(parse_kind == pop_parse_kind)
  137. << "Expected " << pop_parse_kind << ", found " << parse_kind;
  138. CARBON_CHECK(!back.result_id) << "Expected no result ID on " << parse_kind;
  139. }
  140. auto SemanticsParseTreeHandler::PopWithResult() -> SemanticsNodeId {
  141. auto back = node_stack_.pop_back_val();
  142. auto node_id = *back.result_id;
  143. CARBON_VLOG() << "Pop " << node_stack_.size() << ": any ("
  144. << parse_tree_->node_kind(back.parse_node) << ") -> " << node_id
  145. << "\n";
  146. return node_id;
  147. }
  148. auto SemanticsParseTreeHandler::PopWithResult(ParseNodeKind pop_parse_kind)
  149. -> SemanticsNodeId {
  150. auto back = node_stack_.pop_back_val();
  151. auto parse_kind = parse_tree_->node_kind(back.parse_node);
  152. auto node_id = *back.result_id;
  153. CARBON_VLOG() << "Pop " << node_stack_.size() << ": " << pop_parse_kind
  154. << ") -> " << node_id << "\n";
  155. CARBON_CHECK(parse_kind == pop_parse_kind)
  156. << "Expected " << pop_parse_kind << ", found " << parse_kind;
  157. return node_id;
  158. }
  159. auto SemanticsParseTreeHandler::AddIdentifier(ParseTree::Node decl_node)
  160. -> SemanticsIdentifierId {
  161. CARBON_CHECK(parse_tree_->node_kind(decl_node) ==
  162. ParseNodeKind::DeclaredName())
  163. << parse_tree_->node_kind(decl_node);
  164. auto text = parse_tree_->GetNodeText(decl_node);
  165. return semantics_->AddIdentifier(text);
  166. }
  167. auto SemanticsParseTreeHandler::HandleFunctionDefinition(
  168. ParseTree::Node parse_node) -> void {
  169. // Merges code block children up under the FunctionDefinitionStart.
  170. while (parse_tree_->node_kind(node_stack_.back().parse_node) !=
  171. ParseNodeKind::FunctionDefinitionStart()) {
  172. node_stack_.pop_back();
  173. }
  174. Pop(ParseNodeKind::FunctionDefinitionStart());
  175. node_block_stack_.pop_back();
  176. Push(parse_node);
  177. }
  178. auto SemanticsParseTreeHandler::HandleFunctionDefinitionStart(
  179. ParseTree::Node parse_node) -> void {
  180. Pop(ParseNodeKind::ParameterList());
  181. auto name_node = node_stack_.back().parse_node;
  182. auto name = AddIdentifier(name_node);
  183. node_stack_.pop_back();
  184. auto fn_node = node_stack_.back().parse_node;
  185. Pop(ParseNodeKind::FunctionIntroducer());
  186. auto decl_id = AddNode(SemanticsNode::MakeFunctionDeclaration(fn_node));
  187. AddNode(SemanticsNode::MakeBindName(name_node, name, decl_id));
  188. auto block_id = semantics_->AddNodeBlock();
  189. AddNode(SemanticsNode::MakeFunctionDefinition(parse_node, decl_id, block_id));
  190. node_block_stack_.push_back(block_id);
  191. Push(parse_node);
  192. }
  193. auto SemanticsParseTreeHandler::HandleInfixOperator(ParseTree::Node parse_node)
  194. -> void {
  195. auto rhs_id = PopWithResult();
  196. auto lhs_id = PopWithResult();
  197. auto block = node_block_stack_.back();
  198. auto lhs_type = semantics_->GetType(block, lhs_id);
  199. auto rhs_type = semantics_->GetType(block, rhs_id);
  200. SemanticsNodeId result_type = lhs_type;
  201. // TODO: This should attempt a type conversion, but there's not enough
  202. // implemented to do that right now.
  203. if (lhs_type != rhs_type) {
  204. auto invalid_type = SemanticsNodeId::MakeBuiltinReference(
  205. SemanticsBuiltinKind::InvalidType());
  206. if (lhs_type != invalid_type && rhs_type != invalid_type) {
  207. // TODO: This is a poor diagnostic, and should be expanded.
  208. CARBON_DIAGNOSTIC(TypeMismatch, Error, "Type mismatch");
  209. emitter_->Emit(parse_tree_->node_token(parse_node), TypeMismatch);
  210. }
  211. result_type = invalid_type;
  212. }
  213. // Figure out the operator for the token.
  214. auto token = parse_tree_->node_token(parse_node);
  215. switch (auto token_kind = tokens_->GetKind(token)) {
  216. case TokenKind::Plus():
  217. Push(parse_node, SemanticsNode::MakeBinaryOperatorAdd(
  218. parse_node, result_type, lhs_id, rhs_id));
  219. break;
  220. default:
  221. CARBON_FATAL() << "Unrecognized token kind: " << token_kind.Name();
  222. }
  223. }
  224. auto SemanticsParseTreeHandler::HandleLiteral(ParseTree::Node parse_node)
  225. -> void {
  226. auto token = parse_tree_->node_token(parse_node);
  227. switch (auto token_kind = tokens_->GetKind(token)) {
  228. case TokenKind::IntegerLiteral(): {
  229. auto id =
  230. semantics_->AddIntegerLiteral(tokens_->GetIntegerLiteral(token));
  231. Push(parse_node, SemanticsNode::MakeIntegerLiteral(parse_node, id));
  232. break;
  233. }
  234. case TokenKind::RealLiteral(): {
  235. // TODO: Add storage of the Real literal.
  236. Push(parse_node, SemanticsNode::MakeRealLiteral(parse_node));
  237. break;
  238. }
  239. default:
  240. CARBON_FATAL() << "Unhandled kind: " << token_kind.Name();
  241. }
  242. }
  243. auto SemanticsParseTreeHandler::HandleParameterList(ParseTree::Node parse_node)
  244. -> void {
  245. // TODO: This should transform into a usable parameter list. For now
  246. // it's unused and only stored so that node counts match.
  247. // TODO: Reorder with ParameterListStart so that we can traverse without
  248. // subtree_size.
  249. Pop(ParseNodeKind::ParameterListStart());
  250. Push(parse_node);
  251. }
  252. auto SemanticsParseTreeHandler::HandleReturnStatement(
  253. ParseTree::Node parse_node) -> void {
  254. if (parse_tree_->node_kind(node_stack_.back().parse_node) ==
  255. ParseNodeKind::ReturnStatementStart()) {
  256. Pop(ParseNodeKind::ReturnStatementStart());
  257. Push(parse_node, SemanticsNode::MakeReturn(parse_node));
  258. } else {
  259. auto arg = PopWithResult();
  260. auto arg_type = semantics_->GetType(node_block_stack_.back(), arg);
  261. Pop(ParseNodeKind::ReturnStatementStart());
  262. Push(parse_node,
  263. SemanticsNode::MakeReturnExpression(parse_node, arg_type, arg));
  264. }
  265. }
  266. } // namespace Carbon