semantics_parse_tree_handler.cpp 36 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083
  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 <functional>
  6. #include <utility>
  7. #include "common/vlog.h"
  8. #include "llvm/Support/PrettyStackTrace.h"
  9. #include "toolchain/diagnostics/diagnostic_kind.h"
  10. #include "toolchain/lexer/token_kind.h"
  11. #include "toolchain/lexer/tokenized_buffer.h"
  12. #include "toolchain/parser/parse_node_kind.h"
  13. #include "toolchain/semantics/semantics_ir.h"
  14. #include "toolchain/semantics/semantics_node.h"
  15. #include "toolchain/semantics/semantics_node_block_stack.h"
  16. namespace Carbon {
  17. CARBON_DIAGNOSTIC(SemanticsTodo, Error, "Semantics TODO: {0}", std::string);
  18. class PrettyStackTraceFunction : public llvm::PrettyStackTraceEntry {
  19. public:
  20. explicit PrettyStackTraceFunction(std::function<void(llvm::raw_ostream&)> fn)
  21. : fn_(std::move(fn)) {}
  22. ~PrettyStackTraceFunction() override = default;
  23. auto print(llvm::raw_ostream& output) const -> void override { fn_(output); }
  24. private:
  25. const std::function<void(llvm::raw_ostream&)> fn_;
  26. };
  27. auto SemanticsParseTreeHandler::Build() -> void {
  28. PrettyStackTraceFunction pretty_node_stack([&](llvm::raw_ostream& output) {
  29. node_stack_.PrintForStackDump(output);
  30. });
  31. PrettyStackTraceFunction pretty_node_block_stack(
  32. [&](llvm::raw_ostream& output) {
  33. node_block_stack_.PrintForStackDump(output);
  34. });
  35. // Add a block for the ParseTree.
  36. node_block_stack_.Push();
  37. PushScope();
  38. // Loops over all nodes in the tree. On some errors, this may return early,
  39. // for example if an unrecoverable state is encountered.
  40. for (auto parse_node : parse_tree_->postorder()) {
  41. switch (auto parse_kind = parse_tree_->node_kind(parse_node)) {
  42. #define CARBON_PARSE_NODE_KIND(Name) \
  43. case ParseNodeKind::Name: { \
  44. if (!Handle##Name(parse_node)) { \
  45. return; \
  46. } \
  47. break; \
  48. }
  49. #include "toolchain/parser/parse_node_kind.def"
  50. }
  51. }
  52. // Pop information for the file-level scope.
  53. semantics_->top_node_block_id_ = node_block_stack_.Pop();
  54. PopScope();
  55. // Information in all the various context objects should be cleaned up as
  56. // various pieces of context go out of scope. At this point, nothing should
  57. // remain.
  58. // node_stack_ will still contain top-level entities.
  59. CARBON_CHECK(name_lookup_.empty()) << name_lookup_.size();
  60. CARBON_CHECK(scope_stack_.empty()) << scope_stack_.size();
  61. CARBON_CHECK(node_block_stack_.empty()) << node_block_stack_.size();
  62. CARBON_CHECK(params_or_args_stack_.empty()) << params_or_args_stack_.size();
  63. }
  64. auto SemanticsParseTreeHandler::AddNode(SemanticsNode node) -> SemanticsNodeId {
  65. auto block = node_block_stack_.PeekForAdd();
  66. CARBON_VLOG() << "AddNode " << block << ": " << node << "\n";
  67. return semantics_->AddNode(block, node);
  68. }
  69. auto SemanticsParseTreeHandler::AddNodeAndPush(ParseTree::Node parse_node,
  70. SemanticsNode node) -> void {
  71. auto node_id = AddNode(node);
  72. node_stack_.Push(parse_node, node_id);
  73. }
  74. auto SemanticsParseTreeHandler::AddNameToLookup(ParseTree::Node name_node,
  75. SemanticsStringId name_id,
  76. SemanticsNodeId target_id)
  77. -> void {
  78. auto [it, inserted] = current_scope().names.insert(name_id);
  79. if (inserted) {
  80. name_lookup_[name_id].push_back(target_id);
  81. } else {
  82. CARBON_DIAGNOSTIC(NameRedefined, Error, "Redefining {0} in the same scope.",
  83. llvm::StringRef);
  84. CARBON_DIAGNOSTIC(PreviousDefinition, Note, "Previous definition is here.");
  85. auto prev_def_id = name_lookup_[name_id].back();
  86. auto prev_def = semantics_->GetNode(prev_def_id);
  87. emitter_->Build(name_node, NameRedefined, semantics_->GetString(name_id))
  88. .Note(prev_def.parse_node(), PreviousDefinition)
  89. .Emit();
  90. }
  91. }
  92. auto SemanticsParseTreeHandler::BindName(ParseTree::Node name_node,
  93. SemanticsNodeId type_id,
  94. SemanticsNodeId target_id)
  95. -> SemanticsStringId {
  96. CARBON_CHECK(parse_tree_->node_kind(name_node) == ParseNodeKind::DeclaredName)
  97. << parse_tree_->node_kind(name_node);
  98. auto name_str = parse_tree_->GetNodeText(name_node);
  99. auto name_id = semantics_->AddString(name_str);
  100. AddNode(SemanticsNode::MakeBindName(name_node, type_id, name_id, target_id));
  101. AddNameToLookup(name_node, name_id, target_id);
  102. return name_id;
  103. }
  104. auto SemanticsParseTreeHandler::PushScope() -> void {
  105. scope_stack_.push_back({});
  106. }
  107. auto SemanticsParseTreeHandler::PopScope() -> void {
  108. auto scope = scope_stack_.pop_back_val();
  109. for (const auto& str_id : scope.names) {
  110. auto it = name_lookup_.find(str_id);
  111. if (it->second.size() == 1) {
  112. // Erase names that no longer resolve.
  113. name_lookup_.erase(it);
  114. } else {
  115. it->second.pop_back();
  116. }
  117. }
  118. }
  119. auto SemanticsParseTreeHandler::CanTypeConvert(SemanticsNodeId from_type,
  120. SemanticsNodeId to_type)
  121. -> SemanticsNodeId {
  122. // TODO: This should attempt implicit conversions, but there's not enough
  123. // implemented to do that right now.
  124. if (from_type == SemanticsNodeId::BuiltinInvalidType ||
  125. to_type == SemanticsNodeId::BuiltinInvalidType) {
  126. return SemanticsNodeId::BuiltinInvalidType;
  127. }
  128. if (from_type == to_type) {
  129. return from_type;
  130. }
  131. return SemanticsNodeId::Invalid;
  132. }
  133. auto SemanticsParseTreeHandler::TryTypeConversion(ParseTree::Node parse_node,
  134. SemanticsNodeId lhs_id,
  135. SemanticsNodeId rhs_id,
  136. bool /*can_convert_lhs*/)
  137. -> SemanticsNodeId {
  138. auto lhs_type = semantics_->GetType(lhs_id);
  139. auto rhs_type = semantics_->GetType(rhs_id);
  140. // TODO: CanTypeConvert can be assumed to handle rhs conversions, and we'll
  141. // either want to call it twice or refactor it to be aware of lhs conversions.
  142. auto type = CanTypeConvert(rhs_type, lhs_type);
  143. if (type.is_valid()) {
  144. return type;
  145. }
  146. // TODO: This should use type names instead of nodes.
  147. CARBON_DIAGNOSTIC(TypeMismatch, Error,
  148. "Type mismatch: lhs is {0}, rhs is {1}", std::string,
  149. std::string);
  150. emitter_->Emit(parse_node, TypeMismatch, semantics_->StringifyNode(lhs_type),
  151. semantics_->StringifyNode(rhs_type));
  152. return SemanticsNodeId::BuiltinInvalidType;
  153. }
  154. auto SemanticsParseTreeHandler::TryTypeConversionOnArgs(
  155. ParseTree::Node arg_parse_node, SemanticsNodeBlockId /*arg_ir_id*/,
  156. SemanticsNodeBlockId arg_refs_id, ParseTree::Node param_parse_node,
  157. SemanticsNodeBlockId param_refs_id) -> bool {
  158. CARBON_DIAGNOSTIC(NoMatchingCall, Error, "No matching callable was found.");
  159. // If both arguments and parameters are empty, return quickly. Otherwise,
  160. // we'll fetch both so that errors are consistent.
  161. if (arg_refs_id == SemanticsNodeBlockId::Empty &&
  162. param_refs_id == SemanticsNodeBlockId::Empty) {
  163. return true;
  164. }
  165. auto arg_refs = semantics_->GetNodeBlock(arg_refs_id);
  166. auto param_refs = semantics_->GetNodeBlock(param_refs_id);
  167. // If sizes mismatch, fail early.
  168. if (arg_refs.size() != param_refs.size()) {
  169. CARBON_DIAGNOSTIC(CallArgCountMismatch, Note,
  170. "Received {0} argument(s), but require {1} argument(s).",
  171. int, int);
  172. emitter_->Build(arg_parse_node, NoMatchingCall)
  173. .Note(param_parse_node, CallArgCountMismatch, arg_refs.size(),
  174. param_refs.size())
  175. .Emit();
  176. return false;
  177. }
  178. // Check type conversions per-element.
  179. // TODO: arg_ir_id is passed so that implicit conversions can be inserted.
  180. // It's currently not supported, but will be needed.
  181. for (size_t i = 0; i < arg_refs.size(); ++i) {
  182. const auto& arg_ref = arg_refs[i];
  183. auto arg_ref_type = semantics_->GetType(arg_ref);
  184. const auto& param_ref = param_refs[i];
  185. auto param_ref_type = semantics_->GetType(param_ref);
  186. auto result_type = CanTypeConvert(arg_ref_type, param_ref_type);
  187. if (!result_type.is_valid()) {
  188. // TODO: This should use type names instead of nodes.
  189. CARBON_DIAGNOSTIC(
  190. CallArgTypeMismatch, Note,
  191. "Type mismatch: cannot convert argument {0} from {1} to {2}.", size_t,
  192. std::string, std::string);
  193. emitter_->Build(arg_parse_node, NoMatchingCall)
  194. .Note(param_parse_node, CallArgTypeMismatch, i,
  195. semantics_->StringifyNode(arg_ref_type),
  196. semantics_->StringifyNode(param_ref_type))
  197. .Emit();
  198. return false;
  199. }
  200. }
  201. return true;
  202. }
  203. auto SemanticsParseTreeHandler::ParamOrArgStart() -> void {
  204. params_or_args_stack_.Push();
  205. node_block_stack_.Push();
  206. }
  207. auto SemanticsParseTreeHandler::ParamOrArgComma(ParseTree::Node parse_node)
  208. -> bool {
  209. node_stack_.Push(parse_node);
  210. // Copy the last node added to the IR block into the params block.
  211. if (!ParamOrArgSave()) {
  212. emitter_->Emit(
  213. parse_node, SemanticsTodo,
  214. "Should have a param before comma, will need error recovery");
  215. return false;
  216. }
  217. return true;
  218. }
  219. auto SemanticsParseTreeHandler::ParamOrArgEnd(
  220. ParseNodeKind start_kind, ParseNodeKind comma_kind,
  221. std::function<bool(SemanticsNodeBlockId, SemanticsNodeBlockId)> on_start)
  222. -> bool {
  223. // If there's a node in the IR block that has yet to be added to the params
  224. // block, add it now.
  225. ParamOrArgSave();
  226. while (true) {
  227. auto parse_kind = parse_tree_->node_kind(node_stack_.PeekParseNode());
  228. if (parse_kind == start_kind) {
  229. return on_start(node_block_stack_.Pop(), params_or_args_stack_.Pop());
  230. } else if (parse_kind == comma_kind) {
  231. node_stack_.PopAndDiscardSoloParseNode(comma_kind);
  232. } else {
  233. node_stack_.PopAndIgnore();
  234. }
  235. }
  236. }
  237. auto SemanticsParseTreeHandler::ParamOrArgSave() -> bool {
  238. // Copy the last node added to the IR block into the params block.
  239. auto ir_id = node_block_stack_.Peek();
  240. if (!ir_id.is_valid()) {
  241. return false;
  242. }
  243. // We get params before ir because it may add a node block, which can
  244. // invalidate the ir reference.
  245. auto& params = semantics_->GetNodeBlock(params_or_args_stack_.PeekForAdd());
  246. auto& ir = semantics_->GetNodeBlock(ir_id);
  247. CARBON_CHECK(!ir.empty())
  248. << "Should only have a valid ID if a node was added";
  249. auto& param = ir.back();
  250. if (!params.empty() && param == params.back()) {
  251. // The param was already added after a comma.
  252. return false;
  253. }
  254. params.push_back(ir.back());
  255. return true;
  256. }
  257. auto SemanticsParseTreeHandler::HandleAddress(ParseTree::Node parse_node)
  258. -> bool {
  259. emitter_->Emit(parse_node, SemanticsTodo, "HandleAddress");
  260. return false;
  261. }
  262. auto SemanticsParseTreeHandler::HandleBreakStatement(ParseTree::Node parse_node)
  263. -> bool {
  264. emitter_->Emit(parse_node, SemanticsTodo, "HandleBreakStatement");
  265. return false;
  266. }
  267. auto SemanticsParseTreeHandler::HandleBreakStatementStart(
  268. ParseTree::Node parse_node) -> bool {
  269. emitter_->Emit(parse_node, SemanticsTodo, "HandleBreakStatementStart");
  270. return false;
  271. }
  272. auto SemanticsParseTreeHandler::HandleCallExpression(ParseTree::Node parse_node)
  273. -> bool {
  274. auto on_start = [&](SemanticsNodeBlockId ir_id,
  275. SemanticsNodeBlockId refs_id) -> bool {
  276. // TODO: Convert to call expression.
  277. auto [call_expr_parse_node, name_id] = node_stack_.PopForParseNodeAndNodeId(
  278. ParseNodeKind::CallExpressionStart);
  279. auto name_node = semantics_->GetNode(name_id);
  280. if (name_node.kind() != SemanticsNodeKind::FunctionDeclaration) {
  281. // TODO: Work on error.
  282. emitter_->Emit(parse_node, SemanticsTodo, "Not a callable name");
  283. node_stack_.Push(parse_node, name_id);
  284. return true;
  285. }
  286. auto [_, callable_id] = name_node.GetAsFunctionDeclaration();
  287. auto callable = semantics_->GetCallable(callable_id);
  288. if (!TryTypeConversionOnArgs(call_expr_parse_node, ir_id, refs_id,
  289. name_node.parse_node(),
  290. callable.param_refs_id)) {
  291. node_stack_.Push(parse_node, SemanticsNodeId::BuiltinInvalidType);
  292. return true;
  293. }
  294. auto call_id = semantics_->AddCall({ir_id, refs_id});
  295. // TODO: Propagate return types from callable.
  296. auto call_node_id = AddNode(SemanticsNode::MakeCall(
  297. call_expr_parse_node, SemanticsNodeId::BuiltinEmptyTuple, call_id,
  298. callable_id));
  299. node_stack_.Push(parse_node, call_node_id);
  300. return true;
  301. };
  302. return ParamOrArgEnd(ParseNodeKind::CallExpressionStart,
  303. ParseNodeKind::CallExpressionComma, on_start);
  304. }
  305. auto SemanticsParseTreeHandler::HandleCallExpressionComma(
  306. ParseTree::Node parse_node) -> bool {
  307. return ParamOrArgComma(parse_node);
  308. }
  309. auto SemanticsParseTreeHandler::HandleCallExpressionStart(
  310. ParseTree::Node parse_node) -> bool {
  311. auto name_id = node_stack_.PopForNodeId(ParseNodeKind::NameReference);
  312. node_stack_.Push(parse_node, name_id);
  313. ParamOrArgStart();
  314. return true;
  315. }
  316. auto SemanticsParseTreeHandler::HandleClassDeclaration(
  317. ParseTree::Node parse_node) -> bool {
  318. emitter_->Emit(parse_node, SemanticsTodo, "HandleClassDeclaration");
  319. return false;
  320. }
  321. auto SemanticsParseTreeHandler::HandleClassDefinition(
  322. ParseTree::Node parse_node) -> bool {
  323. emitter_->Emit(parse_node, SemanticsTodo, "HandleClassDefinition");
  324. return false;
  325. }
  326. auto SemanticsParseTreeHandler::HandleClassDefinitionStart(
  327. ParseTree::Node parse_node) -> bool {
  328. emitter_->Emit(parse_node, SemanticsTodo, "HandleClassDefinitionStart");
  329. return false;
  330. }
  331. auto SemanticsParseTreeHandler::HandleClassIntroducer(
  332. ParseTree::Node parse_node) -> bool {
  333. emitter_->Emit(parse_node, SemanticsTodo, "HandleClassIntroducer");
  334. return false;
  335. }
  336. auto SemanticsParseTreeHandler::HandleCodeBlock(ParseTree::Node parse_node)
  337. -> bool {
  338. emitter_->Emit(parse_node, SemanticsTodo, "HandleCodeBlock");
  339. return false;
  340. }
  341. auto SemanticsParseTreeHandler::HandleCodeBlockStart(ParseTree::Node parse_node)
  342. -> bool {
  343. emitter_->Emit(parse_node, SemanticsTodo, "HandleCodeBlockStart");
  344. return false;
  345. }
  346. auto SemanticsParseTreeHandler::HandleContinueStatement(
  347. ParseTree::Node parse_node) -> bool {
  348. emitter_->Emit(parse_node, SemanticsTodo, "HandleContinueStatement");
  349. return false;
  350. }
  351. auto SemanticsParseTreeHandler::HandleContinueStatementStart(
  352. ParseTree::Node parse_node) -> bool {
  353. emitter_->Emit(parse_node, SemanticsTodo, "HandleContinueStatementStart");
  354. return false;
  355. }
  356. auto SemanticsParseTreeHandler::HandleDeclaredName(ParseTree::Node parse_node)
  357. -> bool {
  358. // The parent is responsible for binding the name.
  359. node_stack_.Push(parse_node);
  360. return true;
  361. }
  362. auto SemanticsParseTreeHandler::HandleDeducedParameterList(
  363. ParseTree::Node parse_node) -> bool {
  364. emitter_->Emit(parse_node, SemanticsTodo, "HandleDeducedParameterList");
  365. return false;
  366. }
  367. auto SemanticsParseTreeHandler::HandleDeducedParameterListStart(
  368. ParseTree::Node parse_node) -> bool {
  369. emitter_->Emit(parse_node, SemanticsTodo, "HandleDeducedParameterListStart");
  370. return false;
  371. }
  372. auto SemanticsParseTreeHandler::HandleDesignatedName(ParseTree::Node parse_node)
  373. -> bool {
  374. emitter_->Emit(parse_node, SemanticsTodo, "HandleDesignatedName");
  375. return false;
  376. }
  377. auto SemanticsParseTreeHandler::HandleDesignatorExpression(
  378. ParseTree::Node parse_node) -> bool {
  379. emitter_->Emit(parse_node, SemanticsTodo, "HandleDesignatorExpression");
  380. return false;
  381. }
  382. auto SemanticsParseTreeHandler::HandleEmptyDeclaration(
  383. ParseTree::Node parse_node) -> bool {
  384. // Empty declarations have no actions associated, but we still balance the
  385. // tree.
  386. node_stack_.Push(parse_node);
  387. return true;
  388. }
  389. auto SemanticsParseTreeHandler::HandleExpressionStatement(
  390. ParseTree::Node parse_node) -> bool {
  391. // Pop the expression without investigating its contents.
  392. // TODO: This will probably eventually need to do some "do not discard"
  393. // analysis.
  394. node_stack_.PopAndDiscardId();
  395. node_stack_.Push(parse_node);
  396. return true;
  397. }
  398. auto SemanticsParseTreeHandler::HandleFileEnd(ParseTree::Node /*parse_node*/)
  399. -> bool {
  400. // Do nothing, no need to balance this node.
  401. return true;
  402. }
  403. auto SemanticsParseTreeHandler::HandleForHeader(ParseTree::Node parse_node)
  404. -> bool {
  405. emitter_->Emit(parse_node, SemanticsTodo, "HandleForHeader");
  406. return false;
  407. }
  408. auto SemanticsParseTreeHandler::HandleForHeaderStart(ParseTree::Node parse_node)
  409. -> bool {
  410. emitter_->Emit(parse_node, SemanticsTodo, "HandleForHeaderStart");
  411. return false;
  412. }
  413. auto SemanticsParseTreeHandler::HandleForIn(ParseTree::Node parse_node)
  414. -> bool {
  415. emitter_->Emit(parse_node, SemanticsTodo, "HandleForIn");
  416. return false;
  417. }
  418. auto SemanticsParseTreeHandler::HandleForStatement(ParseTree::Node parse_node)
  419. -> bool {
  420. emitter_->Emit(parse_node, SemanticsTodo, "HandleForStatement");
  421. return false;
  422. }
  423. auto SemanticsParseTreeHandler::HandleFunctionDeclaration(
  424. ParseTree::Node parse_node) -> bool {
  425. emitter_->Emit(parse_node, SemanticsTodo, "HandleFunctionDeclaration");
  426. return false;
  427. }
  428. auto SemanticsParseTreeHandler::HandleFunctionDefinition(
  429. ParseTree::Node parse_node) -> bool {
  430. // Merges code block children up under the FunctionDefinitionStart.
  431. while (parse_tree_->node_kind(node_stack_.PeekParseNode()) !=
  432. ParseNodeKind::FunctionDefinitionStart) {
  433. node_stack_.PopAndIgnore();
  434. }
  435. auto decl_id =
  436. node_stack_.PopForNodeId(ParseNodeKind::FunctionDefinitionStart);
  437. return_scope_stack_.pop_back();
  438. PopScope();
  439. auto block_id = node_block_stack_.Pop();
  440. AddNode(SemanticsNode::MakeFunctionDefinition(parse_node, decl_id, block_id));
  441. node_stack_.Push(parse_node);
  442. return true;
  443. }
  444. auto SemanticsParseTreeHandler::HandleFunctionDefinitionStart(
  445. ParseTree::Node parse_node) -> bool {
  446. SemanticsNodeId return_type_id = SemanticsNodeId::Invalid;
  447. if (parse_tree_->node_kind(node_stack_.PeekParseNode()) ==
  448. ParseNodeKind::ReturnType) {
  449. return_type_id = node_stack_.PopForNodeId(ParseNodeKind::ReturnType);
  450. }
  451. node_stack_.PopForSoloParseNode(ParseNodeKind::ParameterList);
  452. auto [param_ir_id, param_refs_id] = finished_params_stack_.pop_back_val();
  453. auto name_node = node_stack_.PopForSoloParseNode(ParseNodeKind::DeclaredName);
  454. auto fn_node =
  455. node_stack_.PopForSoloParseNode(ParseNodeKind::FunctionIntroducer);
  456. auto name_str = parse_tree_->GetNodeText(name_node);
  457. auto name_id = semantics_->AddString(name_str);
  458. auto callable_id =
  459. semantics_->AddCallable({.param_ir_id = param_ir_id,
  460. .param_refs_id = param_refs_id,
  461. .return_type_id = return_type_id});
  462. auto decl_id = AddNode(
  463. SemanticsNode::MakeFunctionDeclaration(fn_node, name_id, callable_id));
  464. AddNameToLookup(name_node, name_id, decl_id);
  465. node_block_stack_.Push();
  466. PushScope();
  467. return_scope_stack_.push_back(decl_id);
  468. node_stack_.Push(parse_node, decl_id);
  469. return true;
  470. }
  471. auto SemanticsParseTreeHandler::HandleFunctionIntroducer(
  472. ParseTree::Node parse_node) -> bool {
  473. // No action, just a bracketing node.
  474. node_stack_.Push(parse_node);
  475. return true;
  476. }
  477. auto SemanticsParseTreeHandler::HandleGenericPatternBinding(
  478. ParseTree::Node parse_node) -> bool {
  479. emitter_->Emit(parse_node, SemanticsTodo, "GenericPatternBinding");
  480. return false;
  481. }
  482. auto SemanticsParseTreeHandler::HandleIfCondition(ParseTree::Node parse_node)
  483. -> bool {
  484. emitter_->Emit(parse_node, SemanticsTodo, "HandleIfCondition");
  485. return false;
  486. }
  487. auto SemanticsParseTreeHandler::HandleIfConditionStart(
  488. ParseTree::Node parse_node) -> bool {
  489. emitter_->Emit(parse_node, SemanticsTodo, "HandleIfConditionStart");
  490. return false;
  491. }
  492. auto SemanticsParseTreeHandler::HandleIfStatement(ParseTree::Node parse_node)
  493. -> bool {
  494. emitter_->Emit(parse_node, SemanticsTodo, "HandleIfStatement");
  495. return false;
  496. }
  497. auto SemanticsParseTreeHandler::HandleIfStatementElse(
  498. ParseTree::Node parse_node) -> bool {
  499. emitter_->Emit(parse_node, SemanticsTodo, "HandleIfStatementElse");
  500. return false;
  501. }
  502. auto SemanticsParseTreeHandler::HandleInfixOperator(ParseTree::Node parse_node)
  503. -> bool {
  504. auto rhs_id = node_stack_.PopForNodeId();
  505. auto lhs_id = node_stack_.PopForNodeId();
  506. SemanticsNodeId result_type =
  507. TryTypeConversion(parse_node, lhs_id, rhs_id, /*can_convert_lhs=*/true);
  508. // Figure out the operator for the token.
  509. auto token = parse_tree_->node_token(parse_node);
  510. switch (auto token_kind = tokens_->GetKind(token)) {
  511. case TokenKind::Plus:
  512. AddNodeAndPush(parse_node, SemanticsNode::MakeBinaryOperatorAdd(
  513. parse_node, result_type, lhs_id, rhs_id));
  514. break;
  515. default:
  516. emitter_->Emit(parse_node, SemanticsTodo,
  517. llvm::formatv("Handle {0}", token_kind));
  518. return false;
  519. }
  520. return true;
  521. }
  522. auto SemanticsParseTreeHandler::HandleInterfaceDeclaration(
  523. ParseTree::Node parse_node) -> bool {
  524. emitter_->Emit(parse_node, SemanticsTodo, "HandleInterfaceDeclaration");
  525. return false;
  526. }
  527. auto SemanticsParseTreeHandler::HandleInterfaceDefinition(
  528. ParseTree::Node parse_node) -> bool {
  529. emitter_->Emit(parse_node, SemanticsTodo, "HandleInterfaceDefinition");
  530. return false;
  531. }
  532. auto SemanticsParseTreeHandler::HandleInterfaceDefinitionStart(
  533. ParseTree::Node parse_node) -> bool {
  534. emitter_->Emit(parse_node, SemanticsTodo, "HandleInterfaceDefinitionStart");
  535. return false;
  536. }
  537. auto SemanticsParseTreeHandler::HandleInterfaceIntroducer(
  538. ParseTree::Node parse_node) -> bool {
  539. emitter_->Emit(parse_node, SemanticsTodo, "HandleInterfaceIntroducer");
  540. return false;
  541. }
  542. auto SemanticsParseTreeHandler::HandleLiteral(ParseTree::Node parse_node)
  543. -> bool {
  544. auto token = parse_tree_->node_token(parse_node);
  545. switch (auto token_kind = tokens_->GetKind(token)) {
  546. case TokenKind::IntegerLiteral: {
  547. auto id =
  548. semantics_->AddIntegerLiteral(tokens_->GetIntegerLiteral(token));
  549. AddNodeAndPush(parse_node,
  550. SemanticsNode::MakeIntegerLiteral(parse_node, id));
  551. break;
  552. }
  553. case TokenKind::RealLiteral: {
  554. auto token_value = tokens_->GetRealLiteral(token);
  555. auto id =
  556. semantics_->AddRealLiteral({.mantissa = token_value.Mantissa(),
  557. .exponent = token_value.Exponent(),
  558. .is_decimal = token_value.IsDecimal()});
  559. AddNodeAndPush(parse_node,
  560. SemanticsNode::MakeRealLiteral(parse_node, id));
  561. break;
  562. }
  563. case TokenKind::StringLiteral: {
  564. auto id = semantics_->AddString(tokens_->GetStringLiteral(token));
  565. AddNodeAndPush(parse_node,
  566. SemanticsNode::MakeStringLiteral(parse_node, id));
  567. break;
  568. }
  569. case TokenKind::IntegerTypeLiteral: {
  570. auto text = tokens_->GetTokenText(token);
  571. if (text != "i32") {
  572. emitter_->Emit(parse_node, SemanticsTodo,
  573. "Currently only i32 is allowed");
  574. return false;
  575. }
  576. node_stack_.Push(parse_node, SemanticsNodeId::BuiltinIntegerType);
  577. break;
  578. }
  579. case TokenKind::FloatingPointTypeLiteral: {
  580. auto text = tokens_->GetTokenText(token);
  581. if (text != "f64") {
  582. emitter_->Emit(parse_node, SemanticsTodo,
  583. "Currently only f64 is allowed");
  584. return false;
  585. }
  586. node_stack_.Push(parse_node, SemanticsNodeId::BuiltinFloatingPointType);
  587. break;
  588. }
  589. case TokenKind::StringTypeLiteral: {
  590. node_stack_.Push(parse_node, SemanticsNodeId::BuiltinStringType);
  591. break;
  592. }
  593. default: {
  594. emitter_->Emit(parse_node, SemanticsTodo,
  595. llvm::formatv("Handle {0}", token_kind));
  596. return false;
  597. }
  598. }
  599. return true;
  600. }
  601. auto SemanticsParseTreeHandler::HandleNameReference(ParseTree::Node parse_node)
  602. -> bool {
  603. auto name_str = parse_tree_->GetNodeText(parse_node);
  604. auto name_not_found = [&] {
  605. CARBON_DIAGNOSTIC(NameNotFound, Error, "Name {0} not found",
  606. llvm::StringRef);
  607. emitter_->Emit(parse_node, NameNotFound, name_str);
  608. node_stack_.Push(parse_node, SemanticsNodeId::BuiltinInvalidType);
  609. };
  610. auto name_id = semantics_->GetStringID(name_str);
  611. if (!name_id) {
  612. name_not_found();
  613. return true;
  614. }
  615. auto it = name_lookup_.find(*name_id);
  616. if (it == name_lookup_.end()) {
  617. name_not_found();
  618. return true;
  619. }
  620. CARBON_CHECK(!it->second.empty()) << "Should have been erased: " << name_str;
  621. // TODO: Check for ambiguous lookups.
  622. node_stack_.Push(parse_node, it->second.back());
  623. return true;
  624. }
  625. auto SemanticsParseTreeHandler::HandleNamedConstraintDeclaration(
  626. ParseTree::Node parse_node) -> bool {
  627. emitter_->Emit(parse_node, SemanticsTodo, "HandleNamedConstraintDeclaration");
  628. return false;
  629. }
  630. auto SemanticsParseTreeHandler::HandleNamedConstraintDefinition(
  631. ParseTree::Node parse_node) -> bool {
  632. emitter_->Emit(parse_node, SemanticsTodo, "HandleNamedConstraintDefinition");
  633. return false;
  634. }
  635. auto SemanticsParseTreeHandler::HandleNamedConstraintDefinitionStart(
  636. ParseTree::Node parse_node) -> bool {
  637. emitter_->Emit(parse_node, SemanticsTodo,
  638. "HandleNamedConstraintDefinitionStart");
  639. return false;
  640. }
  641. auto SemanticsParseTreeHandler::HandleNamedConstraintIntroducer(
  642. ParseTree::Node parse_node) -> bool {
  643. emitter_->Emit(parse_node, SemanticsTodo, "HandleNamedConstraintIntroducer");
  644. return false;
  645. }
  646. auto SemanticsParseTreeHandler::HandlePackageApi(ParseTree::Node parse_node)
  647. -> bool {
  648. emitter_->Emit(parse_node, SemanticsTodo, "HandlePackageApi");
  649. return false;
  650. }
  651. auto SemanticsParseTreeHandler::HandlePackageDirective(
  652. ParseTree::Node parse_node) -> bool {
  653. emitter_->Emit(parse_node, SemanticsTodo, "HandlePackageDirective");
  654. return false;
  655. }
  656. auto SemanticsParseTreeHandler::HandlePackageImpl(ParseTree::Node parse_node)
  657. -> bool {
  658. emitter_->Emit(parse_node, SemanticsTodo, "HandlePackageImpl");
  659. return false;
  660. }
  661. auto SemanticsParseTreeHandler::HandlePackageIntroducer(
  662. ParseTree::Node parse_node) -> bool {
  663. emitter_->Emit(parse_node, SemanticsTodo, "HandlePackageIntroducer");
  664. return false;
  665. }
  666. auto SemanticsParseTreeHandler::HandlePackageLibrary(ParseTree::Node parse_node)
  667. -> bool {
  668. emitter_->Emit(parse_node, SemanticsTodo, "HandlePackageLibrary");
  669. return false;
  670. }
  671. auto SemanticsParseTreeHandler::HandleParameterList(ParseTree::Node parse_node)
  672. -> bool {
  673. auto on_start = [&](SemanticsNodeBlockId ir_id,
  674. SemanticsNodeBlockId refs_id) -> bool {
  675. PopScope();
  676. node_stack_.PopAndDiscardSoloParseNode(ParseNodeKind::ParameterListStart);
  677. finished_params_stack_.push_back({ir_id, refs_id});
  678. node_stack_.Push(parse_node);
  679. return true;
  680. };
  681. return ParamOrArgEnd(ParseNodeKind::ParameterListStart,
  682. ParseNodeKind::ParameterListComma, on_start);
  683. }
  684. auto SemanticsParseTreeHandler::HandleParameterListComma(
  685. ParseTree::Node parse_node) -> bool {
  686. return ParamOrArgComma(parse_node);
  687. }
  688. auto SemanticsParseTreeHandler::HandleParameterListStart(
  689. ParseTree::Node parse_node) -> bool {
  690. PushScope();
  691. node_stack_.Push(parse_node);
  692. ParamOrArgStart();
  693. return true;
  694. }
  695. auto SemanticsParseTreeHandler::HandleParenExpression(
  696. ParseTree::Node parse_node) -> bool {
  697. emitter_->Emit(parse_node, SemanticsTodo, "HandleParenExpression");
  698. return false;
  699. }
  700. auto SemanticsParseTreeHandler::HandleParenExpressionOrTupleLiteralStart(
  701. ParseTree::Node parse_node) -> bool {
  702. emitter_->Emit(parse_node, SemanticsTodo,
  703. "HandleParenExpressionOrTupleLiteralStart");
  704. return false;
  705. }
  706. auto SemanticsParseTreeHandler::HandlePatternBinding(ParseTree::Node parse_node)
  707. -> bool {
  708. auto type = node_stack_.PopForNodeId();
  709. // Get the name.
  710. auto name_node = node_stack_.PopForSoloParseNode();
  711. // Allocate storage, linked to the name for error locations.
  712. auto storage_id = AddNode(SemanticsNode::MakeVarStorage(name_node, type));
  713. // Bind the name to storage.
  714. auto name_id = BindName(name_node, type, storage_id);
  715. // If this node's result is used, it'll be for either the name or the storage
  716. // address. The storage address can be found through the name, so we push the
  717. // name.
  718. node_stack_.Push(parse_node, name_id);
  719. return true;
  720. }
  721. auto SemanticsParseTreeHandler::HandlePostfixOperator(
  722. ParseTree::Node parse_node) -> bool {
  723. emitter_->Emit(parse_node, SemanticsTodo, "HandlePostfixOperator");
  724. return false;
  725. }
  726. auto SemanticsParseTreeHandler::HandlePrefixOperator(ParseTree::Node parse_node)
  727. -> bool {
  728. emitter_->Emit(parse_node, SemanticsTodo, "HandlePrefixOperator");
  729. return false;
  730. }
  731. auto SemanticsParseTreeHandler::HandleReturnStatement(
  732. ParseTree::Node parse_node) -> bool {
  733. CARBON_CHECK(!return_scope_stack_.empty());
  734. const auto& fn_node = semantics_->GetNode(return_scope_stack_.back());
  735. const auto callable =
  736. semantics_->GetCallable(fn_node.GetAsFunctionDeclaration().second);
  737. if (parse_tree_->node_kind(node_stack_.PeekParseNode()) ==
  738. ParseNodeKind::ReturnStatementStart) {
  739. node_stack_.PopAndDiscardSoloParseNode(ParseNodeKind::ReturnStatementStart);
  740. if (callable.return_type_id.is_valid()) {
  741. // TODO: Stringify types, add a note pointing at the return
  742. // type's parse node.
  743. CARBON_DIAGNOSTIC(ReturnStatementMissingExpression, Error,
  744. "Must return a {0}.", SemanticsNodeId);
  745. emitter_
  746. ->Build(parse_node, ReturnStatementMissingExpression,
  747. callable.return_type_id)
  748. .Emit();
  749. }
  750. AddNodeAndPush(parse_node, SemanticsNode::MakeReturn(parse_node));
  751. } else {
  752. const auto arg = node_stack_.PopForNodeId();
  753. auto arg_type = semantics_->GetType(arg);
  754. node_stack_.PopAndDiscardSoloParseNode(ParseNodeKind::ReturnStatementStart);
  755. if (!callable.return_type_id.is_valid()) {
  756. CARBON_DIAGNOSTIC(
  757. ReturnStatementDisallowExpression, Error,
  758. "No return expression should be provided in this context.");
  759. CARBON_DIAGNOSTIC(ReturnStatementImplicitNote, Note,
  760. "There was no return type provided.");
  761. emitter_->Build(parse_node, ReturnStatementDisallowExpression)
  762. .Note(fn_node.parse_node(), ReturnStatementImplicitNote)
  763. .Emit();
  764. } else {
  765. const auto new_type = CanTypeConvert(arg_type, callable.return_type_id);
  766. if (!new_type.is_valid()) {
  767. // TODO: Stringify types, add a note pointing at the return
  768. // type's parse node.
  769. CARBON_DIAGNOSTIC(ReturnStatementTypeMismatch, Error,
  770. "Cannot convert {0} to {1}.", std::string,
  771. std::string);
  772. emitter_
  773. ->Build(parse_node, ReturnStatementTypeMismatch,
  774. semantics_->StringifyNode(arg_type),
  775. semantics_->StringifyNode(callable.return_type_id))
  776. .Emit();
  777. }
  778. arg_type = new_type;
  779. }
  780. AddNodeAndPush(parse_node, SemanticsNode::MakeReturnExpression(
  781. parse_node, arg_type, arg));
  782. }
  783. return true;
  784. }
  785. auto SemanticsParseTreeHandler::HandleReturnStatementStart(
  786. ParseTree::Node parse_node) -> bool {
  787. // No action, just a bracketing node.
  788. node_stack_.Push(parse_node);
  789. return true;
  790. }
  791. auto SemanticsParseTreeHandler::HandleReturnType(ParseTree::Node parse_node)
  792. -> bool {
  793. // Propagate the type expression.
  794. node_stack_.Push(parse_node, node_stack_.PopForNodeId());
  795. return true;
  796. }
  797. auto SemanticsParseTreeHandler::HandleSelfTypeIdentifier(
  798. ParseTree::Node parse_node) -> bool {
  799. emitter_->Emit(parse_node, SemanticsTodo, "HandleSelfTypeIdentifier");
  800. return false;
  801. }
  802. auto SemanticsParseTreeHandler::HandleSelfValueIdentifier(
  803. ParseTree::Node parse_node) -> bool {
  804. emitter_->Emit(parse_node, SemanticsTodo, "HandleSelfValueIdentifier");
  805. return false;
  806. }
  807. auto SemanticsParseTreeHandler::HandleStructComma(ParseTree::Node parse_node)
  808. -> bool {
  809. emitter_->Emit(parse_node, SemanticsTodo, "HandleStructComma");
  810. return false;
  811. }
  812. auto SemanticsParseTreeHandler::HandleStructFieldDesignator(
  813. ParseTree::Node parse_node) -> bool {
  814. emitter_->Emit(parse_node, SemanticsTodo, "HandleStructFieldDesignator");
  815. return false;
  816. }
  817. auto SemanticsParseTreeHandler::HandleStructFieldType(
  818. ParseTree::Node parse_node) -> bool {
  819. emitter_->Emit(parse_node, SemanticsTodo, "HandleStructFieldType");
  820. return false;
  821. }
  822. auto SemanticsParseTreeHandler::HandleStructFieldUnknown(
  823. ParseTree::Node parse_node) -> bool {
  824. emitter_->Emit(parse_node, SemanticsTodo, "HandleStructFieldUnknown");
  825. return false;
  826. }
  827. auto SemanticsParseTreeHandler::HandleStructFieldValue(
  828. ParseTree::Node parse_node) -> bool {
  829. emitter_->Emit(parse_node, SemanticsTodo, "HandleStructFieldValue");
  830. return false;
  831. }
  832. auto SemanticsParseTreeHandler::HandleStructLiteral(ParseTree::Node parse_node)
  833. -> bool {
  834. emitter_->Emit(parse_node, SemanticsTodo, "HandleStructLiteral");
  835. return false;
  836. }
  837. auto SemanticsParseTreeHandler::HandleStructLiteralOrStructTypeLiteralStart(
  838. ParseTree::Node parse_node) -> bool {
  839. emitter_->Emit(parse_node, SemanticsTodo,
  840. "HandleStructLiteralOrStructTypeLiteralStart");
  841. return false;
  842. }
  843. auto SemanticsParseTreeHandler::HandleStructTypeLiteral(
  844. ParseTree::Node parse_node) -> bool {
  845. emitter_->Emit(parse_node, SemanticsTodo, "HandleStructTypeLiteral");
  846. return false;
  847. }
  848. auto SemanticsParseTreeHandler::HandleTemplate(ParseTree::Node parse_node)
  849. -> bool {
  850. emitter_->Emit(parse_node, SemanticsTodo, "HandleTemplate");
  851. return false;
  852. }
  853. auto SemanticsParseTreeHandler::HandleTupleLiteral(ParseTree::Node parse_node)
  854. -> bool {
  855. emitter_->Emit(parse_node, SemanticsTodo, "HandleTupleLiteral");
  856. return false;
  857. }
  858. auto SemanticsParseTreeHandler::HandleTupleLiteralComma(
  859. ParseTree::Node parse_node) -> bool {
  860. emitter_->Emit(parse_node, SemanticsTodo, "HandleTupleLiteralComma");
  861. return false;
  862. }
  863. auto SemanticsParseTreeHandler::HandleVariableDeclaration(
  864. ParseTree::Node parse_node) -> bool {
  865. auto last_child = node_stack_.PopForParseNodeAndNodeId();
  866. if (parse_tree_->node_kind(last_child.first) !=
  867. ParseNodeKind::PatternBinding) {
  868. auto storage_id =
  869. node_stack_.PopForNodeId(ParseNodeKind::VariableInitializer);
  870. auto binding = node_stack_.PopForParseNodeAndNameId();
  871. // Restore the name now that the initializer is complete.
  872. ReaddNameToLookup(binding.second, storage_id);
  873. auto storage_type =
  874. TryTypeConversion(parse_node, storage_id, last_child.second,
  875. /*can_convert_lhs=*/false);
  876. AddNode(SemanticsNode::MakeAssign(parse_node, storage_type, storage_id,
  877. last_child.second));
  878. }
  879. node_stack_.PopAndDiscardSoloParseNode(ParseNodeKind::VariableIntroducer);
  880. node_stack_.Push(parse_node);
  881. return true;
  882. }
  883. auto SemanticsParseTreeHandler::HandleVariableIntroducer(
  884. ParseTree::Node parse_node) -> bool {
  885. // No action, just a bracketing node.
  886. node_stack_.Push(parse_node);
  887. return true;
  888. }
  889. auto SemanticsParseTreeHandler::HandleVariableInitializer(
  890. ParseTree::Node parse_node) -> bool {
  891. // Temporarily remove name lookup entries added by the `var`. These will be
  892. // restored by `VariableDeclaration`.
  893. // Save the storage ID.
  894. auto it = name_lookup_.find(node_stack_.PeekForNameId());
  895. CARBON_CHECK(it != name_lookup_.end());
  896. CARBON_CHECK(!it->second.empty());
  897. auto storage_id = it->second.back();
  898. // Pop the name from lookup.
  899. if (it->second.size() == 1) {
  900. // Erase names that no longer resolve.
  901. name_lookup_.erase(it);
  902. } else {
  903. it->second.pop_back();
  904. }
  905. node_stack_.Push(parse_node, storage_id);
  906. return true;
  907. }
  908. auto SemanticsParseTreeHandler::HandleWhileCondition(ParseTree::Node parse_node)
  909. -> bool {
  910. emitter_->Emit(parse_node, SemanticsTodo, "HandleWhileCondition");
  911. return false;
  912. }
  913. auto SemanticsParseTreeHandler::HandleWhileConditionStart(
  914. ParseTree::Node parse_node) -> bool {
  915. emitter_->Emit(parse_node, SemanticsTodo, "HandleWhileConditionStart");
  916. return false;
  917. }
  918. auto SemanticsParseTreeHandler::HandleWhileStatement(ParseTree::Node parse_node)
  919. -> bool {
  920. emitter_->Emit(parse_node, SemanticsTodo, "HandleWhileStatement");
  921. return false;
  922. }
  923. } // namespace Carbon