semantics_parse_tree_handler.cpp 11 KB

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