semantics_parse_tree_handler.cpp 41 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209
  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(
  101. SemanticsNode::BindName::Make(name_node, type_id, name_id, target_id));
  102. AddNameToLookup(name_node, name_id, target_id);
  103. return name_id;
  104. }
  105. auto SemanticsParseTreeHandler::PushScope() -> void {
  106. scope_stack_.push_back({});
  107. }
  108. auto SemanticsParseTreeHandler::PopScope() -> void {
  109. auto scope = scope_stack_.pop_back_val();
  110. for (const auto& str_id : scope.names) {
  111. auto it = name_lookup_.find(str_id);
  112. if (it->second.size() == 1) {
  113. // Erase names that no longer resolve.
  114. name_lookup_.erase(it);
  115. } else {
  116. it->second.pop_back();
  117. }
  118. }
  119. }
  120. auto SemanticsParseTreeHandler::CanTypeConvert(SemanticsNodeId from_type,
  121. SemanticsNodeId to_type)
  122. -> SemanticsNodeId {
  123. // TODO: This should attempt implicit conversions, but there's not enough
  124. // implemented to do that right now.
  125. if (from_type == SemanticsNodeId::BuiltinInvalidType ||
  126. to_type == SemanticsNodeId::BuiltinInvalidType) {
  127. return SemanticsNodeId::BuiltinInvalidType;
  128. }
  129. if (from_type == to_type) {
  130. return from_type;
  131. }
  132. return SemanticsNodeId::Invalid;
  133. }
  134. auto SemanticsParseTreeHandler::TryTypeConversion(ParseTree::Node parse_node,
  135. SemanticsNodeId lhs_id,
  136. SemanticsNodeId rhs_id,
  137. bool /*can_convert_lhs*/)
  138. -> SemanticsNodeId {
  139. auto lhs_type = semantics_->GetType(lhs_id);
  140. auto rhs_type = semantics_->GetType(rhs_id);
  141. // TODO: CanTypeConvert can be assumed to handle rhs conversions, and we'll
  142. // either want to call it twice or refactor it to be aware of lhs conversions.
  143. auto type = CanTypeConvert(rhs_type, lhs_type);
  144. if (type.is_valid()) {
  145. return type;
  146. }
  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. CARBON_DIAGNOSTIC(
  189. CallArgTypeMismatch, Note,
  190. "Type mismatch: cannot convert argument {0} from {1} to {2}.", size_t,
  191. std::string, std::string);
  192. emitter_->Build(arg_parse_node, NoMatchingCall)
  193. .Note(param_parse_node, CallArgTypeMismatch, i,
  194. semantics_->StringifyNode(arg_ref_type),
  195. semantics_->StringifyNode(param_ref_type))
  196. .Emit();
  197. return false;
  198. }
  199. }
  200. return true;
  201. }
  202. auto SemanticsParseTreeHandler::ImplicitAs(ParseTree::Node parse_node,
  203. SemanticsNodeId value_id,
  204. SemanticsNodeId as_type_id)
  205. -> SemanticsNodeId {
  206. // Start by making sure both sides are valid. If any part is invalid, the
  207. // result is invalid and we shouldn't error.
  208. if (value_id == SemanticsNodeId::BuiltinInvalidType ||
  209. as_type_id == SemanticsNodeId::BuiltinInvalidType) {
  210. return SemanticsNodeId::BuiltinInvalidType;
  211. }
  212. auto value_type_id = semantics_->GetType(value_id);
  213. if (value_type_id == SemanticsNodeId::BuiltinInvalidType) {
  214. return SemanticsNodeId::BuiltinInvalidType;
  215. }
  216. // If the type doesn't need to change, we can return the value directly.
  217. if (value_type_id == as_type_id) {
  218. return value_id;
  219. }
  220. // When converting to a Type, there are some automatic conversions that can be
  221. // done.
  222. if (as_type_id == SemanticsNodeId::BuiltinTypeType) {
  223. if (value_id == SemanticsNodeId::BuiltinEmptyTuple) {
  224. return SemanticsNodeId::BuiltinEmptyTupleType;
  225. }
  226. if (value_id == SemanticsNodeId::BuiltinEmptyStruct) {
  227. return SemanticsNodeId::BuiltinEmptyStructType;
  228. }
  229. }
  230. auto value_type = semantics_->GetNode(value_type_id);
  231. auto as_type = semantics_->GetNode(as_type_id);
  232. if (CanImplicitAsStruct(value_type, as_type)) {
  233. return value_id;
  234. }
  235. CARBON_DIAGNOSTIC(ImplicitAsConversionFailure, Error,
  236. "Cannot implicitly convert from {0} to {1}.", std::string,
  237. std::string);
  238. emitter_
  239. ->Build(parse_node, ImplicitAsConversionFailure,
  240. semantics_->StringifyNode(value_type_id),
  241. semantics_->StringifyNode(as_type_id))
  242. .Emit();
  243. return SemanticsNodeId::BuiltinInvalidType;
  244. }
  245. auto SemanticsParseTreeHandler::CanImplicitAsStruct(SemanticsNode value_type,
  246. SemanticsNode as_type)
  247. -> bool {
  248. if (value_type.kind() != SemanticsNodeKind::StructType ||
  249. as_type.kind() != SemanticsNodeKind::StructType) {
  250. return false;
  251. }
  252. auto value_type_refs =
  253. semantics_->GetNodeBlock(value_type.GetAsStructType().second);
  254. auto as_type_refs =
  255. semantics_->GetNodeBlock(as_type.GetAsStructType().second);
  256. if (value_type_refs.size() != as_type_refs.size()) {
  257. return false;
  258. }
  259. for (int i = 0; i < static_cast<int>(value_type_refs.size()); ++i) {
  260. auto value_type_field = semantics_->GetNode(value_type_refs[i]);
  261. auto as_type_field = semantics_->GetNode(as_type_refs[i]);
  262. if (value_type_field.type_id() != as_type_field.type_id() ||
  263. value_type_field.GetAsStructTypeField() !=
  264. as_type_field.GetAsStructTypeField()) {
  265. return false;
  266. }
  267. }
  268. return true;
  269. }
  270. auto SemanticsParseTreeHandler::ParamOrArgStart() -> void {
  271. params_or_args_stack_.Push();
  272. node_block_stack_.Push();
  273. }
  274. auto SemanticsParseTreeHandler::ParamOrArgComma(bool for_args) -> void {
  275. ParamOrArgSave(for_args);
  276. }
  277. auto SemanticsParseTreeHandler::ParamOrArgEnd(bool for_args,
  278. ParseNodeKind start_kind)
  279. -> std::pair<SemanticsNodeBlockId, SemanticsNodeBlockId> {
  280. if (parse_tree_->node_kind(node_stack_.PeekParseNode()) != start_kind) {
  281. ParamOrArgSave(for_args);
  282. }
  283. return {node_block_stack_.Pop(), params_or_args_stack_.Pop()};
  284. }
  285. auto SemanticsParseTreeHandler::ParamOrArgSave(bool for_args) -> void {
  286. SemanticsNodeId param_or_arg_id = SemanticsNodeId::Invalid;
  287. if (for_args) {
  288. // For an argument, we add a stub reference to the expression on the top of
  289. // the stack. There may not be anything on the IR prior to this.
  290. auto [entry_parse_node, entry_node_id] =
  291. node_stack_.PopForParseNodeAndNodeId();
  292. param_or_arg_id = AddNode(SemanticsNode::StubReference::Make(
  293. entry_parse_node, semantics_->GetNode(entry_node_id).type_id(),
  294. entry_node_id));
  295. } else {
  296. // For a parameter, there should always be something in the IR.
  297. node_stack_.PopAndIgnore();
  298. auto ir_id = node_block_stack_.Peek();
  299. CARBON_CHECK(ir_id.is_valid());
  300. auto& ir = semantics_->GetNodeBlock(ir_id);
  301. CARBON_CHECK(!ir.empty()) << "Should have had a param";
  302. param_or_arg_id = ir.back();
  303. }
  304. // Save the param or arg ID.
  305. auto& params_or_args =
  306. semantics_->GetNodeBlock(params_or_args_stack_.PeekForAdd());
  307. params_or_args.push_back(param_or_arg_id);
  308. }
  309. auto SemanticsParseTreeHandler::HandleAddress(ParseTree::Node parse_node)
  310. -> bool {
  311. emitter_->Emit(parse_node, SemanticsTodo, "HandleAddress");
  312. return false;
  313. }
  314. auto SemanticsParseTreeHandler::HandleBreakStatement(ParseTree::Node parse_node)
  315. -> bool {
  316. emitter_->Emit(parse_node, SemanticsTodo, "HandleBreakStatement");
  317. return false;
  318. }
  319. auto SemanticsParseTreeHandler::HandleBreakStatementStart(
  320. ParseTree::Node parse_node) -> bool {
  321. emitter_->Emit(parse_node, SemanticsTodo, "HandleBreakStatementStart");
  322. return false;
  323. }
  324. auto SemanticsParseTreeHandler::HandleCallExpression(ParseTree::Node parse_node)
  325. -> bool {
  326. auto [ir_id, refs_id] =
  327. ParamOrArgEnd(/*for_args=*/true, ParseNodeKind::CallExpressionStart);
  328. // TODO: Convert to call expression.
  329. auto [call_expr_parse_node, name_id] =
  330. node_stack_.PopForParseNodeAndNodeId(ParseNodeKind::CallExpressionStart);
  331. auto name_node = semantics_->GetNode(name_id);
  332. if (name_node.kind() != SemanticsNodeKind::FunctionDeclaration) {
  333. // TODO: Work on error.
  334. emitter_->Emit(parse_node, SemanticsTodo, "Not a callable name");
  335. node_stack_.Push(parse_node, name_id);
  336. return true;
  337. }
  338. auto [_, callable_id] = name_node.GetAsFunctionDeclaration();
  339. auto callable = semantics_->GetCallable(callable_id);
  340. if (!TryTypeConversionOnArgs(call_expr_parse_node, ir_id, refs_id,
  341. name_node.parse_node(),
  342. callable.param_refs_id)) {
  343. node_stack_.Push(parse_node, SemanticsNodeId::BuiltinInvalidType);
  344. return true;
  345. }
  346. auto call_id = semantics_->AddCall({ir_id, refs_id});
  347. // TODO: Propagate return types from callable.
  348. auto call_node_id = AddNode(SemanticsNode::Call::Make(
  349. call_expr_parse_node, SemanticsNodeId::BuiltinEmptyTuple, call_id,
  350. callable_id));
  351. node_stack_.Push(parse_node, call_node_id);
  352. return true;
  353. }
  354. auto SemanticsParseTreeHandler::HandleCallExpressionComma(
  355. ParseTree::Node /*parse_node*/) -> bool {
  356. ParamOrArgComma(/*for_args=*/true);
  357. return true;
  358. }
  359. auto SemanticsParseTreeHandler::HandleCallExpressionStart(
  360. ParseTree::Node parse_node) -> bool {
  361. auto name_id = node_stack_.PopForNodeId(ParseNodeKind::NameReference);
  362. node_stack_.Push(parse_node, name_id);
  363. ParamOrArgStart();
  364. return true;
  365. }
  366. auto SemanticsParseTreeHandler::HandleClassDeclaration(
  367. ParseTree::Node parse_node) -> bool {
  368. emitter_->Emit(parse_node, SemanticsTodo, "HandleClassDeclaration");
  369. return false;
  370. }
  371. auto SemanticsParseTreeHandler::HandleClassDefinition(
  372. ParseTree::Node parse_node) -> bool {
  373. emitter_->Emit(parse_node, SemanticsTodo, "HandleClassDefinition");
  374. return false;
  375. }
  376. auto SemanticsParseTreeHandler::HandleClassDefinitionStart(
  377. ParseTree::Node parse_node) -> bool {
  378. emitter_->Emit(parse_node, SemanticsTodo, "HandleClassDefinitionStart");
  379. return false;
  380. }
  381. auto SemanticsParseTreeHandler::HandleClassIntroducer(
  382. ParseTree::Node parse_node) -> bool {
  383. emitter_->Emit(parse_node, SemanticsTodo, "HandleClassIntroducer");
  384. return false;
  385. }
  386. auto SemanticsParseTreeHandler::HandleCodeBlock(ParseTree::Node parse_node)
  387. -> bool {
  388. emitter_->Emit(parse_node, SemanticsTodo, "HandleCodeBlock");
  389. return false;
  390. }
  391. auto SemanticsParseTreeHandler::HandleCodeBlockStart(ParseTree::Node parse_node)
  392. -> bool {
  393. emitter_->Emit(parse_node, SemanticsTodo, "HandleCodeBlockStart");
  394. return false;
  395. }
  396. auto SemanticsParseTreeHandler::HandleContinueStatement(
  397. ParseTree::Node parse_node) -> bool {
  398. emitter_->Emit(parse_node, SemanticsTodo, "HandleContinueStatement");
  399. return false;
  400. }
  401. auto SemanticsParseTreeHandler::HandleContinueStatementStart(
  402. ParseTree::Node parse_node) -> bool {
  403. emitter_->Emit(parse_node, SemanticsTodo, "HandleContinueStatementStart");
  404. return false;
  405. }
  406. auto SemanticsParseTreeHandler::HandleDeclaredName(ParseTree::Node parse_node)
  407. -> bool {
  408. // The parent is responsible for binding the name.
  409. node_stack_.Push(parse_node);
  410. return true;
  411. }
  412. auto SemanticsParseTreeHandler::HandleDeducedParameterList(
  413. ParseTree::Node parse_node) -> bool {
  414. emitter_->Emit(parse_node, SemanticsTodo, "HandleDeducedParameterList");
  415. return false;
  416. }
  417. auto SemanticsParseTreeHandler::HandleDeducedParameterListStart(
  418. ParseTree::Node parse_node) -> bool {
  419. emitter_->Emit(parse_node, SemanticsTodo, "HandleDeducedParameterListStart");
  420. return false;
  421. }
  422. auto SemanticsParseTreeHandler::HandleDesignatedName(ParseTree::Node parse_node)
  423. -> bool {
  424. auto name_str = parse_tree_->GetNodeText(parse_node);
  425. auto name_id = semantics_->AddString(name_str);
  426. // The parent is responsible for binding the name.
  427. node_stack_.Push(parse_node, name_id);
  428. return true;
  429. }
  430. auto SemanticsParseTreeHandler::HandleDesignatorExpression(
  431. ParseTree::Node parse_node) -> bool {
  432. emitter_->Emit(parse_node, SemanticsTodo, "HandleDesignatorExpression");
  433. return false;
  434. }
  435. auto SemanticsParseTreeHandler::HandleEmptyDeclaration(
  436. ParseTree::Node parse_node) -> bool {
  437. // Empty declarations have no actions associated, but we still balance the
  438. // tree.
  439. node_stack_.Push(parse_node);
  440. return true;
  441. }
  442. auto SemanticsParseTreeHandler::HandleExpressionStatement(
  443. ParseTree::Node parse_node) -> bool {
  444. // Pop the expression without investigating its contents.
  445. // TODO: This will probably eventually need to do some "do not discard"
  446. // analysis.
  447. node_stack_.PopAndDiscardId();
  448. node_stack_.Push(parse_node);
  449. return true;
  450. }
  451. auto SemanticsParseTreeHandler::HandleFileEnd(ParseTree::Node /*parse_node*/)
  452. -> bool {
  453. // Do nothing, no need to balance this node.
  454. return true;
  455. }
  456. auto SemanticsParseTreeHandler::HandleForHeader(ParseTree::Node parse_node)
  457. -> bool {
  458. emitter_->Emit(parse_node, SemanticsTodo, "HandleForHeader");
  459. return false;
  460. }
  461. auto SemanticsParseTreeHandler::HandleForHeaderStart(ParseTree::Node parse_node)
  462. -> bool {
  463. emitter_->Emit(parse_node, SemanticsTodo, "HandleForHeaderStart");
  464. return false;
  465. }
  466. auto SemanticsParseTreeHandler::HandleForIn(ParseTree::Node parse_node)
  467. -> bool {
  468. emitter_->Emit(parse_node, SemanticsTodo, "HandleForIn");
  469. return false;
  470. }
  471. auto SemanticsParseTreeHandler::HandleForStatement(ParseTree::Node parse_node)
  472. -> bool {
  473. emitter_->Emit(parse_node, SemanticsTodo, "HandleForStatement");
  474. return false;
  475. }
  476. auto SemanticsParseTreeHandler::HandleFunctionDeclaration(
  477. ParseTree::Node parse_node) -> bool {
  478. emitter_->Emit(parse_node, SemanticsTodo, "HandleFunctionDeclaration");
  479. return false;
  480. }
  481. auto SemanticsParseTreeHandler::HandleFunctionDefinition(
  482. ParseTree::Node parse_node) -> bool {
  483. // Merges code block children up under the FunctionDefinitionStart.
  484. while (parse_tree_->node_kind(node_stack_.PeekParseNode()) !=
  485. ParseNodeKind::FunctionDefinitionStart) {
  486. node_stack_.PopAndIgnore();
  487. }
  488. auto decl_id =
  489. node_stack_.PopForNodeId(ParseNodeKind::FunctionDefinitionStart);
  490. return_scope_stack_.pop_back();
  491. PopScope();
  492. auto block_id = node_block_stack_.Pop();
  493. AddNode(
  494. SemanticsNode::FunctionDefinition::Make(parse_node, decl_id, block_id));
  495. node_stack_.Push(parse_node);
  496. return true;
  497. }
  498. auto SemanticsParseTreeHandler::HandleFunctionDefinitionStart(
  499. ParseTree::Node parse_node) -> bool {
  500. SemanticsNodeId return_type_id = SemanticsNodeId::Invalid;
  501. if (parse_tree_->node_kind(node_stack_.PeekParseNode()) ==
  502. ParseNodeKind::ReturnType) {
  503. return_type_id = node_stack_.PopForNodeId(ParseNodeKind::ReturnType);
  504. }
  505. node_stack_.PopForSoloParseNode(ParseNodeKind::ParameterList);
  506. auto [param_ir_id, param_refs_id] = finished_params_stack_.pop_back_val();
  507. auto name_node = node_stack_.PopForSoloParseNode(ParseNodeKind::DeclaredName);
  508. auto fn_node =
  509. node_stack_.PopForSoloParseNode(ParseNodeKind::FunctionIntroducer);
  510. auto name_str = parse_tree_->GetNodeText(name_node);
  511. auto name_id = semantics_->AddString(name_str);
  512. auto callable_id =
  513. semantics_->AddCallable({.param_ir_id = param_ir_id,
  514. .param_refs_id = param_refs_id,
  515. .return_type_id = return_type_id});
  516. auto decl_id = AddNode(
  517. SemanticsNode::FunctionDeclaration::Make(fn_node, name_id, callable_id));
  518. AddNameToLookup(name_node, name_id, decl_id);
  519. node_block_stack_.Push();
  520. PushScope();
  521. return_scope_stack_.push_back(decl_id);
  522. node_stack_.Push(parse_node, decl_id);
  523. return true;
  524. }
  525. auto SemanticsParseTreeHandler::HandleFunctionIntroducer(
  526. ParseTree::Node parse_node) -> bool {
  527. // No action, just a bracketing node.
  528. node_stack_.Push(parse_node);
  529. return true;
  530. }
  531. auto SemanticsParseTreeHandler::HandleGenericPatternBinding(
  532. ParseTree::Node parse_node) -> bool {
  533. emitter_->Emit(parse_node, SemanticsTodo, "GenericPatternBinding");
  534. return false;
  535. }
  536. auto SemanticsParseTreeHandler::HandleIfCondition(ParseTree::Node parse_node)
  537. -> bool {
  538. emitter_->Emit(parse_node, SemanticsTodo, "HandleIfCondition");
  539. return false;
  540. }
  541. auto SemanticsParseTreeHandler::HandleIfConditionStart(
  542. ParseTree::Node parse_node) -> bool {
  543. emitter_->Emit(parse_node, SemanticsTodo, "HandleIfConditionStart");
  544. return false;
  545. }
  546. auto SemanticsParseTreeHandler::HandleIfStatement(ParseTree::Node parse_node)
  547. -> bool {
  548. emitter_->Emit(parse_node, SemanticsTodo, "HandleIfStatement");
  549. return false;
  550. }
  551. auto SemanticsParseTreeHandler::HandleIfStatementElse(
  552. ParseTree::Node parse_node) -> bool {
  553. emitter_->Emit(parse_node, SemanticsTodo, "HandleIfStatementElse");
  554. return false;
  555. }
  556. auto SemanticsParseTreeHandler::HandleInfixOperator(ParseTree::Node parse_node)
  557. -> bool {
  558. auto rhs_id = node_stack_.PopForNodeId();
  559. auto lhs_id = node_stack_.PopForNodeId();
  560. SemanticsNodeId result_type =
  561. TryTypeConversion(parse_node, lhs_id, rhs_id, /*can_convert_lhs=*/true);
  562. // Figure out the operator for the token.
  563. auto token = parse_tree_->node_token(parse_node);
  564. switch (auto token_kind = tokens_->GetKind(token)) {
  565. case TokenKind::Plus:
  566. AddNodeAndPush(parse_node, SemanticsNode::BinaryOperatorAdd::Make(
  567. parse_node, result_type, lhs_id, rhs_id));
  568. break;
  569. default:
  570. emitter_->Emit(parse_node, SemanticsTodo,
  571. llvm::formatv("Handle {0}", token_kind));
  572. return false;
  573. }
  574. return true;
  575. }
  576. auto SemanticsParseTreeHandler::HandleInterfaceDeclaration(
  577. ParseTree::Node parse_node) -> bool {
  578. emitter_->Emit(parse_node, SemanticsTodo, "HandleInterfaceDeclaration");
  579. return false;
  580. }
  581. auto SemanticsParseTreeHandler::HandleInterfaceDefinition(
  582. ParseTree::Node parse_node) -> bool {
  583. emitter_->Emit(parse_node, SemanticsTodo, "HandleInterfaceDefinition");
  584. return false;
  585. }
  586. auto SemanticsParseTreeHandler::HandleInterfaceDefinitionStart(
  587. ParseTree::Node parse_node) -> bool {
  588. emitter_->Emit(parse_node, SemanticsTodo, "HandleInterfaceDefinitionStart");
  589. return false;
  590. }
  591. auto SemanticsParseTreeHandler::HandleInterfaceIntroducer(
  592. ParseTree::Node parse_node) -> bool {
  593. emitter_->Emit(parse_node, SemanticsTodo, "HandleInterfaceIntroducer");
  594. return false;
  595. }
  596. auto SemanticsParseTreeHandler::HandleLiteral(ParseTree::Node parse_node)
  597. -> bool {
  598. auto token = parse_tree_->node_token(parse_node);
  599. switch (auto token_kind = tokens_->GetKind(token)) {
  600. case TokenKind::IntegerLiteral: {
  601. auto id =
  602. semantics_->AddIntegerLiteral(tokens_->GetIntegerLiteral(token));
  603. AddNodeAndPush(parse_node,
  604. SemanticsNode::IntegerLiteral::Make(parse_node, id));
  605. break;
  606. }
  607. case TokenKind::RealLiteral: {
  608. auto token_value = tokens_->GetRealLiteral(token);
  609. auto id =
  610. semantics_->AddRealLiteral({.mantissa = token_value.Mantissa(),
  611. .exponent = token_value.Exponent(),
  612. .is_decimal = token_value.IsDecimal()});
  613. AddNodeAndPush(parse_node,
  614. SemanticsNode::RealLiteral::Make(parse_node, id));
  615. break;
  616. }
  617. case TokenKind::StringLiteral: {
  618. auto id = semantics_->AddString(tokens_->GetStringLiteral(token));
  619. AddNodeAndPush(parse_node,
  620. SemanticsNode::StringLiteral::Make(parse_node, id));
  621. break;
  622. }
  623. case TokenKind::IntegerTypeLiteral: {
  624. auto text = tokens_->GetTokenText(token);
  625. if (text != "i32") {
  626. emitter_->Emit(parse_node, SemanticsTodo,
  627. "Currently only i32 is allowed");
  628. return false;
  629. }
  630. node_stack_.Push(parse_node, SemanticsNodeId::BuiltinIntegerType);
  631. break;
  632. }
  633. case TokenKind::FloatingPointTypeLiteral: {
  634. auto text = tokens_->GetTokenText(token);
  635. if (text != "f64") {
  636. emitter_->Emit(parse_node, SemanticsTodo,
  637. "Currently only f64 is allowed");
  638. return false;
  639. }
  640. node_stack_.Push(parse_node, SemanticsNodeId::BuiltinFloatingPointType);
  641. break;
  642. }
  643. case TokenKind::StringTypeLiteral: {
  644. node_stack_.Push(parse_node, SemanticsNodeId::BuiltinStringType);
  645. break;
  646. }
  647. default: {
  648. emitter_->Emit(parse_node, SemanticsTodo,
  649. llvm::formatv("Handle {0}", token_kind));
  650. return false;
  651. }
  652. }
  653. return true;
  654. }
  655. auto SemanticsParseTreeHandler::HandleNameReference(ParseTree::Node parse_node)
  656. -> bool {
  657. auto name_str = parse_tree_->GetNodeText(parse_node);
  658. auto name_not_found = [&] {
  659. CARBON_DIAGNOSTIC(NameNotFound, Error, "Name {0} not found",
  660. llvm::StringRef);
  661. emitter_->Emit(parse_node, NameNotFound, name_str);
  662. node_stack_.Push(parse_node, SemanticsNodeId::BuiltinInvalidType);
  663. };
  664. auto name_id = semantics_->GetStringID(name_str);
  665. if (!name_id) {
  666. name_not_found();
  667. return true;
  668. }
  669. auto it = name_lookup_.find(*name_id);
  670. if (it == name_lookup_.end()) {
  671. name_not_found();
  672. return true;
  673. }
  674. CARBON_CHECK(!it->second.empty()) << "Should have been erased: " << name_str;
  675. // TODO: Check for ambiguous lookups.
  676. node_stack_.Push(parse_node, it->second.back());
  677. return true;
  678. }
  679. auto SemanticsParseTreeHandler::HandleNamedConstraintDeclaration(
  680. ParseTree::Node parse_node) -> bool {
  681. emitter_->Emit(parse_node, SemanticsTodo, "HandleNamedConstraintDeclaration");
  682. return false;
  683. }
  684. auto SemanticsParseTreeHandler::HandleNamedConstraintDefinition(
  685. ParseTree::Node parse_node) -> bool {
  686. emitter_->Emit(parse_node, SemanticsTodo, "HandleNamedConstraintDefinition");
  687. return false;
  688. }
  689. auto SemanticsParseTreeHandler::HandleNamedConstraintDefinitionStart(
  690. ParseTree::Node parse_node) -> bool {
  691. emitter_->Emit(parse_node, SemanticsTodo,
  692. "HandleNamedConstraintDefinitionStart");
  693. return false;
  694. }
  695. auto SemanticsParseTreeHandler::HandleNamedConstraintIntroducer(
  696. ParseTree::Node parse_node) -> bool {
  697. emitter_->Emit(parse_node, SemanticsTodo, "HandleNamedConstraintIntroducer");
  698. return false;
  699. }
  700. auto SemanticsParseTreeHandler::HandlePackageApi(ParseTree::Node parse_node)
  701. -> bool {
  702. emitter_->Emit(parse_node, SemanticsTodo, "HandlePackageApi");
  703. return false;
  704. }
  705. auto SemanticsParseTreeHandler::HandlePackageDirective(
  706. ParseTree::Node parse_node) -> bool {
  707. emitter_->Emit(parse_node, SemanticsTodo, "HandlePackageDirective");
  708. return false;
  709. }
  710. auto SemanticsParseTreeHandler::HandlePackageImpl(ParseTree::Node parse_node)
  711. -> bool {
  712. emitter_->Emit(parse_node, SemanticsTodo, "HandlePackageImpl");
  713. return false;
  714. }
  715. auto SemanticsParseTreeHandler::HandlePackageIntroducer(
  716. ParseTree::Node parse_node) -> bool {
  717. emitter_->Emit(parse_node, SemanticsTodo, "HandlePackageIntroducer");
  718. return false;
  719. }
  720. auto SemanticsParseTreeHandler::HandlePackageLibrary(ParseTree::Node parse_node)
  721. -> bool {
  722. emitter_->Emit(parse_node, SemanticsTodo, "HandlePackageLibrary");
  723. return false;
  724. }
  725. auto SemanticsParseTreeHandler::HandleParameterList(ParseTree::Node parse_node)
  726. -> bool {
  727. auto [ir_id, refs_id] =
  728. ParamOrArgEnd(/*for_args=*/false, ParseNodeKind::ParameterListStart);
  729. PopScope();
  730. node_stack_.PopAndDiscardSoloParseNode(ParseNodeKind::ParameterListStart);
  731. finished_params_stack_.push_back({ir_id, refs_id});
  732. node_stack_.Push(parse_node);
  733. return true;
  734. }
  735. auto SemanticsParseTreeHandler::HandleParameterListComma(
  736. ParseTree::Node /*parse_node*/) -> bool {
  737. ParamOrArgComma(/*for_args=*/false);
  738. return true;
  739. }
  740. auto SemanticsParseTreeHandler::HandleParameterListStart(
  741. ParseTree::Node parse_node) -> bool {
  742. PushScope();
  743. node_stack_.Push(parse_node);
  744. ParamOrArgStart();
  745. return true;
  746. }
  747. auto SemanticsParseTreeHandler::HandleParenExpression(
  748. ParseTree::Node parse_node) -> bool {
  749. emitter_->Emit(parse_node, SemanticsTodo, "HandleParenExpression");
  750. return false;
  751. }
  752. auto SemanticsParseTreeHandler::HandleParenExpressionOrTupleLiteralStart(
  753. ParseTree::Node parse_node) -> bool {
  754. emitter_->Emit(parse_node, SemanticsTodo,
  755. "HandleParenExpressionOrTupleLiteralStart");
  756. return false;
  757. }
  758. auto SemanticsParseTreeHandler::HandlePatternBinding(ParseTree::Node parse_node)
  759. -> bool {
  760. auto [type_node, parsed_type] = node_stack_.PopForParseNodeAndNodeId();
  761. auto cast_type_id =
  762. ImplicitAs(type_node, parsed_type, SemanticsNodeId::BuiltinTypeType);
  763. // Get the name.
  764. auto name_node = node_stack_.PopForSoloParseNode();
  765. // Allocate storage, linked to the name for error locations.
  766. auto storage_id =
  767. AddNode(SemanticsNode::VarStorage::Make(name_node, cast_type_id));
  768. // Bind the name to storage.
  769. auto name_id = BindName(name_node, cast_type_id, storage_id);
  770. // If this node's result is used, it'll be for either the name or the storage
  771. // address. The storage address can be found through the name, so we push the
  772. // name.
  773. node_stack_.Push(parse_node, name_id);
  774. return true;
  775. }
  776. auto SemanticsParseTreeHandler::HandlePostfixOperator(
  777. ParseTree::Node parse_node) -> bool {
  778. emitter_->Emit(parse_node, SemanticsTodo, "HandlePostfixOperator");
  779. return false;
  780. }
  781. auto SemanticsParseTreeHandler::HandlePrefixOperator(ParseTree::Node parse_node)
  782. -> bool {
  783. emitter_->Emit(parse_node, SemanticsTodo, "HandlePrefixOperator");
  784. return false;
  785. }
  786. auto SemanticsParseTreeHandler::HandleReturnStatement(
  787. ParseTree::Node parse_node) -> bool {
  788. CARBON_CHECK(!return_scope_stack_.empty());
  789. const auto& fn_node = semantics_->GetNode(return_scope_stack_.back());
  790. const auto callable =
  791. semantics_->GetCallable(fn_node.GetAsFunctionDeclaration().second);
  792. if (parse_tree_->node_kind(node_stack_.PeekParseNode()) ==
  793. ParseNodeKind::ReturnStatementStart) {
  794. node_stack_.PopAndDiscardSoloParseNode(ParseNodeKind::ReturnStatementStart);
  795. if (callable.return_type_id.is_valid()) {
  796. // TODO: Add a note pointing at the return type's parse node.
  797. CARBON_DIAGNOSTIC(ReturnStatementMissingExpression, Error,
  798. "Must return a {0}.", std::string);
  799. emitter_
  800. ->Build(parse_node, ReturnStatementMissingExpression,
  801. semantics_->StringifyNode(callable.return_type_id))
  802. .Emit();
  803. }
  804. AddNodeAndPush(parse_node, SemanticsNode::Return::Make(parse_node));
  805. } else {
  806. const auto arg = node_stack_.PopForNodeId();
  807. auto arg_type = semantics_->GetType(arg);
  808. node_stack_.PopAndDiscardSoloParseNode(ParseNodeKind::ReturnStatementStart);
  809. if (!callable.return_type_id.is_valid()) {
  810. CARBON_DIAGNOSTIC(
  811. ReturnStatementDisallowExpression, Error,
  812. "No return expression should be provided in this context.");
  813. CARBON_DIAGNOSTIC(ReturnStatementImplicitNote, Note,
  814. "There was no return type provided.");
  815. emitter_->Build(parse_node, ReturnStatementDisallowExpression)
  816. .Note(fn_node.parse_node(), ReturnStatementImplicitNote)
  817. .Emit();
  818. } else {
  819. const auto new_type = CanTypeConvert(arg_type, callable.return_type_id);
  820. if (!new_type.is_valid()) {
  821. // TODO: Add a note pointing at the return type's parse node.
  822. CARBON_DIAGNOSTIC(ReturnStatementTypeMismatch, Error,
  823. "Cannot convert {0} to {1}.", std::string,
  824. std::string);
  825. emitter_
  826. ->Build(parse_node, ReturnStatementTypeMismatch,
  827. semantics_->StringifyNode(arg_type),
  828. semantics_->StringifyNode(callable.return_type_id))
  829. .Emit();
  830. }
  831. arg_type = new_type;
  832. }
  833. AddNodeAndPush(parse_node, SemanticsNode::ReturnExpression::Make(
  834. parse_node, arg_type, arg));
  835. }
  836. return true;
  837. }
  838. auto SemanticsParseTreeHandler::HandleReturnStatementStart(
  839. ParseTree::Node parse_node) -> bool {
  840. // No action, just a bracketing node.
  841. node_stack_.Push(parse_node);
  842. return true;
  843. }
  844. auto SemanticsParseTreeHandler::HandleReturnType(ParseTree::Node parse_node)
  845. -> bool {
  846. // Propagate the type expression.
  847. node_stack_.Push(parse_node, node_stack_.PopForNodeId());
  848. return true;
  849. }
  850. auto SemanticsParseTreeHandler::HandleSelfTypeIdentifier(
  851. ParseTree::Node parse_node) -> bool {
  852. emitter_->Emit(parse_node, SemanticsTodo, "HandleSelfTypeIdentifier");
  853. return false;
  854. }
  855. auto SemanticsParseTreeHandler::HandleSelfValueIdentifier(
  856. ParseTree::Node parse_node) -> bool {
  857. emitter_->Emit(parse_node, SemanticsTodo, "HandleSelfValueIdentifier");
  858. return false;
  859. }
  860. auto SemanticsParseTreeHandler::HandleStructComma(
  861. ParseTree::Node /*parse_node*/) -> bool {
  862. ParamOrArgComma(
  863. /*for_args=*/parse_tree_->node_kind(node_stack_.PeekParseNode()) !=
  864. ParseNodeKind::StructFieldType);
  865. return true;
  866. }
  867. auto SemanticsParseTreeHandler::HandleStructFieldDesignator(
  868. ParseTree::Node /*parse_node*/) -> bool {
  869. // This leaves the designated name on top because the `.` isn't interesting.
  870. CARBON_CHECK(parse_tree_->node_kind(node_stack_.PeekParseNode()) ==
  871. ParseNodeKind::DesignatedName);
  872. return true;
  873. }
  874. auto SemanticsParseTreeHandler::HandleStructFieldType(
  875. ParseTree::Node parse_node) -> bool {
  876. auto [type_node, type_id] = node_stack_.PopForParseNodeAndNodeId();
  877. auto cast_type_id =
  878. ImplicitAs(type_node, type_id, SemanticsNodeId::BuiltinTypeType);
  879. auto [name_node, name_id] =
  880. node_stack_.PopForParseNodeAndNameId(ParseNodeKind::DesignatedName);
  881. AddNode(
  882. SemanticsNode::StructTypeField::Make(name_node, cast_type_id, name_id));
  883. node_stack_.Push(parse_node);
  884. return true;
  885. }
  886. auto SemanticsParseTreeHandler::HandleStructFieldUnknown(
  887. ParseTree::Node parse_node) -> bool {
  888. emitter_->Emit(parse_node, SemanticsTodo, "HandleStructFieldUnknown");
  889. return false;
  890. }
  891. auto SemanticsParseTreeHandler::HandleStructFieldValue(
  892. ParseTree::Node parse_node) -> bool {
  893. auto [value_parse_node, value_node_id] =
  894. node_stack_.PopForParseNodeAndNodeId();
  895. auto [_, name_id] =
  896. node_stack_.PopForParseNodeAndNameId(ParseNodeKind::DesignatedName);
  897. // Store the name for the type.
  898. auto type_block_id = args_type_info_stack_.PeekForAdd();
  899. semantics_->AddNode(
  900. type_block_id,
  901. SemanticsNode::StructTypeField::Make(
  902. parse_node, semantics_->GetNode(value_node_id).type_id(), name_id));
  903. // Push the value back on the stack as an argument.
  904. node_stack_.Push(parse_node, value_node_id);
  905. return true;
  906. }
  907. auto SemanticsParseTreeHandler::HandleStructLiteral(ParseTree::Node parse_node)
  908. -> bool {
  909. auto [ir_id, refs_id] = ParamOrArgEnd(
  910. /*for_args=*/true, ParseNodeKind::StructLiteralOrStructTypeLiteralStart);
  911. PopScope();
  912. node_stack_.PopAndDiscardSoloParseNode(
  913. ParseNodeKind::StructLiteralOrStructTypeLiteralStart);
  914. auto type_block_id = args_type_info_stack_.Pop();
  915. // Special-case `{}`.
  916. if (refs_id == SemanticsNodeBlockId::Empty) {
  917. node_stack_.Push(parse_node, SemanticsNodeId::BuiltinEmptyStruct);
  918. return true;
  919. }
  920. // Construct a type for the literal. Each field is one node, so ir_id and
  921. // refs_id match.
  922. auto refs = semantics_->GetNodeBlock(refs_id);
  923. auto type_id = AddNode(SemanticsNode::StructType::Make(
  924. parse_node, type_block_id, type_block_id));
  925. auto value_id = AddNode(
  926. SemanticsNode::StructValue::Make(parse_node, type_id, ir_id, refs_id));
  927. node_stack_.Push(parse_node, value_id);
  928. return true;
  929. }
  930. auto SemanticsParseTreeHandler::HandleStructLiteralOrStructTypeLiteralStart(
  931. ParseTree::Node parse_node) -> bool {
  932. PushScope();
  933. node_stack_.Push(parse_node);
  934. // At this point we aren't sure whether this will be a value or type literal,
  935. // so we push onto args irrespective. It just won't be used for a type
  936. // literal.
  937. args_type_info_stack_.Push();
  938. ParamOrArgStart();
  939. return true;
  940. }
  941. auto SemanticsParseTreeHandler::HandleStructTypeLiteral(
  942. ParseTree::Node parse_node) -> bool {
  943. auto [ir_id, refs_id] = ParamOrArgEnd(
  944. /*for_args=*/false, ParseNodeKind::StructLiteralOrStructTypeLiteralStart);
  945. PopScope();
  946. node_stack_.PopAndDiscardSoloParseNode(
  947. ParseNodeKind::StructLiteralOrStructTypeLiteralStart);
  948. // This is only used for value literals.
  949. args_type_info_stack_.Pop();
  950. CARBON_CHECK(refs_id != SemanticsNodeBlockId::Empty)
  951. << "{} is handled by StructLiteral.";
  952. auto type_id =
  953. AddNode(SemanticsNode::StructType::Make(parse_node, ir_id, refs_id));
  954. node_stack_.Push(parse_node, type_id);
  955. return true;
  956. }
  957. auto SemanticsParseTreeHandler::HandleTemplate(ParseTree::Node parse_node)
  958. -> bool {
  959. emitter_->Emit(parse_node, SemanticsTodo, "HandleTemplate");
  960. return false;
  961. }
  962. auto SemanticsParseTreeHandler::HandleTupleLiteral(ParseTree::Node parse_node)
  963. -> bool {
  964. emitter_->Emit(parse_node, SemanticsTodo, "HandleTupleLiteral");
  965. return false;
  966. }
  967. auto SemanticsParseTreeHandler::HandleTupleLiteralComma(
  968. ParseTree::Node parse_node) -> bool {
  969. emitter_->Emit(parse_node, SemanticsTodo, "HandleTupleLiteralComma");
  970. return false;
  971. }
  972. auto SemanticsParseTreeHandler::HandleVariableDeclaration(
  973. ParseTree::Node parse_node) -> bool {
  974. auto last_child = node_stack_.PopForParseNodeAndNodeId();
  975. if (parse_tree_->node_kind(last_child.first) !=
  976. ParseNodeKind::PatternBinding) {
  977. auto storage_id =
  978. node_stack_.PopForNodeId(ParseNodeKind::VariableInitializer);
  979. auto binding =
  980. node_stack_.PopForParseNodeAndNameId(ParseNodeKind::PatternBinding);
  981. // Restore the name now that the initializer is complete.
  982. ReaddNameToLookup(binding.second, storage_id);
  983. auto cast_value_id = ImplicitAs(parse_node, last_child.second,
  984. semantics_->GetType(storage_id));
  985. AddNode(SemanticsNode::Assign::Make(parse_node,
  986. semantics_->GetType(cast_value_id),
  987. storage_id, cast_value_id));
  988. }
  989. node_stack_.PopAndDiscardSoloParseNode(ParseNodeKind::VariableIntroducer);
  990. node_stack_.Push(parse_node);
  991. return true;
  992. }
  993. auto SemanticsParseTreeHandler::HandleVariableIntroducer(
  994. ParseTree::Node parse_node) -> bool {
  995. // No action, just a bracketing node.
  996. node_stack_.Push(parse_node);
  997. return true;
  998. }
  999. auto SemanticsParseTreeHandler::HandleVariableInitializer(
  1000. ParseTree::Node parse_node) -> bool {
  1001. // Temporarily remove name lookup entries added by the `var`. These will be
  1002. // restored by `VariableDeclaration`.
  1003. // Save the storage ID.
  1004. auto it = name_lookup_.find(
  1005. node_stack_.PeekForNameId(ParseNodeKind::PatternBinding));
  1006. CARBON_CHECK(it != name_lookup_.end());
  1007. CARBON_CHECK(!it->second.empty());
  1008. auto storage_id = it->second.back();
  1009. // Pop the name from lookup.
  1010. if (it->second.size() == 1) {
  1011. // Erase names that no longer resolve.
  1012. name_lookup_.erase(it);
  1013. } else {
  1014. it->second.pop_back();
  1015. }
  1016. node_stack_.Push(parse_node, storage_id);
  1017. return true;
  1018. }
  1019. auto SemanticsParseTreeHandler::HandleWhileCondition(ParseTree::Node parse_node)
  1020. -> bool {
  1021. emitter_->Emit(parse_node, SemanticsTodo, "HandleWhileCondition");
  1022. return false;
  1023. }
  1024. auto SemanticsParseTreeHandler::HandleWhileConditionStart(
  1025. ParseTree::Node parse_node) -> bool {
  1026. emitter_->Emit(parse_node, SemanticsTodo, "HandleWhileConditionStart");
  1027. return false;
  1028. }
  1029. auto SemanticsParseTreeHandler::HandleWhileStatement(ParseTree::Node parse_node)
  1030. -> bool {
  1031. emitter_->Emit(parse_node, SemanticsTodo, "HandleWhileStatement");
  1032. return false;
  1033. }
  1034. } // namespace Carbon