semantics_parse_tree_handler.cpp 41 KB

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