semantics_parse_tree_handler.cpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344
  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::PatternBinding(): {
  90. HandlePatternBinding(parse_node);
  91. break;
  92. }
  93. case ParseNodeKind::ReturnStatement(): {
  94. HandleReturnStatement(parse_node);
  95. break;
  96. }
  97. case ParseNodeKind::VariableDeclaration(): {
  98. HandleVariableDeclaration(parse_node);
  99. break;
  100. }
  101. case ParseNodeKind::DeclaredName():
  102. case ParseNodeKind::FunctionIntroducer():
  103. case ParseNodeKind::ParameterListStart():
  104. case ParseNodeKind::ReturnStatementStart():
  105. case ParseNodeKind::VariableIntroducer(): {
  106. // The token has no action, but we still track it for the stack.
  107. Push(parse_node);
  108. break;
  109. }
  110. default: {
  111. CARBON_FATAL() << "In ParseTree at index " << parse_node
  112. << ", unhandled NodeKind " << parse_kind;
  113. }
  114. }
  115. }
  116. llvm_unreachable("Should always end at FileEnd");
  117. }
  118. auto SemanticsParseTreeHandler::AddNode(SemanticsNode node) -> SemanticsNodeId {
  119. CARBON_VLOG() << "AddNode " << node_block_stack_.back() << ": " << node
  120. << "\n";
  121. return semantics_->AddNode(node_block_stack_.back(), node);
  122. }
  123. auto SemanticsParseTreeHandler::Push(ParseTree::Node parse_node) -> void {
  124. CARBON_VLOG() << "Push " << node_stack_.size() << ": "
  125. << parse_tree_->node_kind(parse_node) << "\n";
  126. CARBON_CHECK(node_stack_.size() < (1 << 20))
  127. << "Excessive stack size: likely infinite loop";
  128. node_stack_.push_back({parse_node, std::nullopt});
  129. }
  130. auto SemanticsParseTreeHandler::Push(ParseTree::Node parse_node,
  131. SemanticsNode node) -> void {
  132. CARBON_VLOG() << "Push " << node_stack_.size() << ": "
  133. << parse_tree_->node_kind(parse_node) << " -> " << node.kind()
  134. << "\n";
  135. CARBON_CHECK(node_stack_.size() < (1 << 20))
  136. << "Excessive stack size: likely infinite loop";
  137. auto node_id = AddNode(node);
  138. node_stack_.push_back({parse_node, node_id});
  139. }
  140. auto SemanticsParseTreeHandler::Push(ParseTree::Node parse_node,
  141. SemanticsNodeId node_id) -> void {
  142. CARBON_VLOG() << "Push " << node_stack_.size() << ": "
  143. << parse_tree_->node_kind(parse_node) << " -> " << node_id
  144. << "\n";
  145. CARBON_CHECK(node_stack_.size() < (1 << 20))
  146. << "Excessive stack size: likely infinite loop";
  147. node_stack_.push_back({parse_node, node_id});
  148. }
  149. auto SemanticsParseTreeHandler::Pop(ParseNodeKind pop_parse_kind) -> void {
  150. auto back = node_stack_.pop_back_val();
  151. auto parse_kind = parse_tree_->node_kind(back.parse_node);
  152. CARBON_VLOG() << "Pop " << node_stack_.size() << ": " << pop_parse_kind
  153. << "\n";
  154. CARBON_CHECK(parse_kind == pop_parse_kind)
  155. << "Expected " << pop_parse_kind << ", found " << parse_kind;
  156. CARBON_CHECK(!back.result_id) << "Expected no result ID on " << parse_kind;
  157. }
  158. auto SemanticsParseTreeHandler::PopWithResult() -> SemanticsNodeId {
  159. auto back = node_stack_.pop_back_val();
  160. auto node_id = *back.result_id;
  161. CARBON_VLOG() << "Pop " << node_stack_.size() << ": any ("
  162. << parse_tree_->node_kind(back.parse_node) << ") -> " << node_id
  163. << "\n";
  164. return node_id;
  165. }
  166. auto SemanticsParseTreeHandler::PopWithResult(ParseNodeKind pop_parse_kind)
  167. -> SemanticsNodeId {
  168. auto back = node_stack_.pop_back_val();
  169. auto parse_kind = parse_tree_->node_kind(back.parse_node);
  170. auto node_id = *back.result_id;
  171. CARBON_VLOG() << "Pop " << node_stack_.size() << ": " << pop_parse_kind
  172. << ") -> " << node_id << "\n";
  173. CARBON_CHECK(parse_kind == pop_parse_kind)
  174. << "Expected " << pop_parse_kind << ", found " << parse_kind;
  175. return node_id;
  176. }
  177. auto SemanticsParseTreeHandler::AddIdentifier(ParseTree::Node decl_node)
  178. -> SemanticsIdentifierId {
  179. CARBON_CHECK(parse_tree_->node_kind(decl_node) ==
  180. ParseNodeKind::DeclaredName())
  181. << parse_tree_->node_kind(decl_node);
  182. auto text = parse_tree_->GetNodeText(decl_node);
  183. return semantics_->AddIdentifier(text);
  184. }
  185. auto SemanticsParseTreeHandler::HandleFunctionDefinition(
  186. ParseTree::Node parse_node) -> void {
  187. // Merges code block children up under the FunctionDefinitionStart.
  188. while (parse_tree_->node_kind(node_stack_.back().parse_node) !=
  189. ParseNodeKind::FunctionDefinitionStart()) {
  190. node_stack_.pop_back();
  191. }
  192. Pop(ParseNodeKind::FunctionDefinitionStart());
  193. node_block_stack_.pop_back();
  194. Push(parse_node);
  195. }
  196. auto SemanticsParseTreeHandler::HandleFunctionDefinitionStart(
  197. ParseTree::Node parse_node) -> void {
  198. Pop(ParseNodeKind::ParameterList());
  199. auto name_node = node_stack_.back().parse_node;
  200. auto name = AddIdentifier(name_node);
  201. node_stack_.pop_back();
  202. auto fn_node = node_stack_.back().parse_node;
  203. Pop(ParseNodeKind::FunctionIntroducer());
  204. auto decl_id = AddNode(SemanticsNode::MakeFunctionDeclaration(fn_node));
  205. AddNode(SemanticsNode::MakeBindName(name_node, name, decl_id));
  206. auto block_id = semantics_->AddNodeBlock();
  207. AddNode(SemanticsNode::MakeFunctionDefinition(parse_node, decl_id, block_id));
  208. node_block_stack_.push_back(block_id);
  209. Push(parse_node);
  210. }
  211. auto SemanticsParseTreeHandler::HandleInfixOperator(ParseTree::Node parse_node)
  212. -> void {
  213. auto rhs_id = PopWithResult();
  214. auto lhs_id = PopWithResult();
  215. auto block = node_block_stack_.back();
  216. auto lhs_type = semantics_->GetType(block, lhs_id);
  217. auto rhs_type = semantics_->GetType(block, rhs_id);
  218. SemanticsNodeId result_type = lhs_type;
  219. // TODO: This should attempt a type conversion, but there's not enough
  220. // implemented to do that right now.
  221. if (lhs_type != rhs_type) {
  222. auto invalid_type = SemanticsNodeId::MakeBuiltinReference(
  223. SemanticsBuiltinKind::InvalidType());
  224. if (lhs_type != invalid_type && rhs_type != invalid_type) {
  225. // TODO: This is a poor diagnostic, and should be expanded.
  226. CARBON_DIAGNOSTIC(TypeMismatch, Error, "Type mismatch");
  227. emitter_->Emit(parse_tree_->node_token(parse_node), TypeMismatch);
  228. }
  229. result_type = invalid_type;
  230. }
  231. // Figure out the operator for the token.
  232. auto token = parse_tree_->node_token(parse_node);
  233. switch (auto token_kind = tokens_->GetKind(token)) {
  234. case TokenKind::Plus():
  235. Push(parse_node, SemanticsNode::MakeBinaryOperatorAdd(
  236. parse_node, result_type, lhs_id, rhs_id));
  237. break;
  238. default:
  239. CARBON_FATAL() << "Unrecognized token kind: " << token_kind.Name();
  240. }
  241. }
  242. auto SemanticsParseTreeHandler::HandleLiteral(ParseTree::Node parse_node)
  243. -> void {
  244. auto token = parse_tree_->node_token(parse_node);
  245. switch (auto token_kind = tokens_->GetKind(token)) {
  246. case TokenKind::IntegerLiteral(): {
  247. auto id =
  248. semantics_->AddIntegerLiteral(tokens_->GetIntegerLiteral(token));
  249. Push(parse_node, SemanticsNode::MakeIntegerLiteral(parse_node, id));
  250. break;
  251. }
  252. case TokenKind::RealLiteral(): {
  253. // TODO: Add storage of the Real literal.
  254. Push(parse_node, SemanticsNode::MakeRealLiteral(parse_node));
  255. break;
  256. }
  257. case TokenKind::IntegerTypeLiteral(): {
  258. auto text = tokens_->GetTokenText(token);
  259. CARBON_CHECK(text == "i32") << "Currently only i32 is allowed";
  260. Push(parse_node, SemanticsNodeId::MakeBuiltinReference(
  261. SemanticsBuiltinKind::IntegerType()));
  262. break;
  263. }
  264. default:
  265. CARBON_FATAL() << "Unhandled kind: " << token_kind.Name();
  266. }
  267. }
  268. auto SemanticsParseTreeHandler::HandleParameterList(ParseTree::Node parse_node)
  269. -> void {
  270. // TODO: This should transform into a usable parameter list. For now
  271. // it's unused and only stored so that node counts match.
  272. // TODO: Reorder with ParameterListStart so that we can traverse without
  273. // subtree_size.
  274. Pop(ParseNodeKind::ParameterListStart());
  275. Push(parse_node);
  276. }
  277. auto SemanticsParseTreeHandler::HandlePatternBinding(ParseTree::Node parse_node)
  278. -> void {
  279. // TODO: Create storage for the type, use that for the bind instead of the
  280. // type itself.
  281. auto type_id = PopWithResult();
  282. auto name_node = node_stack_.back().parse_node;
  283. auto name = AddIdentifier(name_node);
  284. node_stack_.pop_back();
  285. Push(parse_node,
  286. AddNode(SemanticsNode::MakeBindName(name_node, name, type_id)));
  287. }
  288. auto SemanticsParseTreeHandler::HandleReturnStatement(
  289. ParseTree::Node parse_node) -> void {
  290. if (parse_tree_->node_kind(node_stack_.back().parse_node) ==
  291. ParseNodeKind::ReturnStatementStart()) {
  292. Pop(ParseNodeKind::ReturnStatementStart());
  293. Push(parse_node, SemanticsNode::MakeReturn(parse_node));
  294. } else {
  295. auto arg = PopWithResult();
  296. auto arg_type = semantics_->GetType(node_block_stack_.back(), arg);
  297. Pop(ParseNodeKind::ReturnStatementStart());
  298. Push(parse_node,
  299. SemanticsNode::MakeReturnExpression(parse_node, arg_type, arg));
  300. }
  301. }
  302. auto SemanticsParseTreeHandler::HandleVariableDeclaration(
  303. ParseTree::Node parse_node) -> void {
  304. // TODO: Initializers would assign to the PatternBinding, but this code
  305. // doesn't handle it right now.
  306. PopWithResult();
  307. Pop(ParseNodeKind::VariableIntroducer());
  308. Push(parse_node);
  309. }
  310. } // namespace Carbon