semantics_parse_tree_handler.cpp 43 KB

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