semantics_node_stack.cpp 5.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166
  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_node_stack.h"
  5. #include "common/vlog.h"
  6. #include "toolchain/semantics/semantics_node.h"
  7. namespace Carbon {
  8. auto SemanticsNodeStack::PushEntry(Entry entry, DebugLog debug_log) -> void {
  9. CARBON_VLOG() << "Node Push " << stack_.size() << ": "
  10. << parse_tree_->node_kind(entry.parse_node) << " -> ";
  11. switch (debug_log) {
  12. case DebugLog::None:
  13. CARBON_VLOG() << "<none>";
  14. break;
  15. case DebugLog::NodeId:
  16. CARBON_VLOG() << entry.node_id;
  17. break;
  18. case DebugLog::NameId:
  19. CARBON_VLOG() << entry.name_id;
  20. break;
  21. }
  22. CARBON_VLOG() << "\n";
  23. CARBON_CHECK(stack_.size() < (1 << 20))
  24. << "Excessive stack size: likely infinite loop";
  25. stack_.push_back(entry);
  26. }
  27. auto SemanticsNodeStack::PopEntry() -> Entry {
  28. auto back = stack_.pop_back_val();
  29. CARBON_VLOG() << "Node Pop " << stack_.size() << ": any ("
  30. << parse_tree_->node_kind(back.parse_node) << ") -> "
  31. << back.node_id << "\n";
  32. return back;
  33. }
  34. auto SemanticsNodeStack::PopEntry(ParseNodeKind pop_parse_kind) -> Entry {
  35. auto back = stack_.pop_back_val();
  36. CARBON_VLOG() << "Node Pop " << stack_.size() << ": " << pop_parse_kind
  37. << " -> " << back.node_id << "\n";
  38. RequireParseKind(back, pop_parse_kind);
  39. return back;
  40. }
  41. auto SemanticsNodeStack::RequireParseKind(Entry entry,
  42. ParseNodeKind require_kind) -> void {
  43. auto actual_kind = parse_tree_->node_kind(entry.parse_node);
  44. CARBON_CHECK(require_kind == actual_kind)
  45. << "Expected " << require_kind << ", found " << actual_kind;
  46. }
  47. // RequireSoloParseNode and RequireValidId rely on type punning. They read
  48. // node_id.is_valid, even though that may not be the active union member.
  49. // These asserts enforce standard layout in order to help ensure that works.
  50. // TODO: Use is_layout_compatible in C++20.
  51. static_assert(std::is_standard_layout_v<SemanticsNodeId>,
  52. "Need standard layout for type punning");
  53. static_assert(std::is_standard_layout_v<SemanticsStringId>,
  54. "Need standard layout for type punning");
  55. auto SemanticsNodeStack::RequireSoloParseNode(Entry entry) -> void {
  56. // See above comment on type punning.
  57. CARBON_CHECK(!entry.node_id.is_valid())
  58. << "Expected invalid id on " << parse_tree_->node_kind(entry.parse_node)
  59. << ", was " << entry.node_id << " (may not be node)";
  60. }
  61. auto SemanticsNodeStack::RequireValidId(Entry entry) -> void {
  62. // See above comment on type punning.
  63. CARBON_CHECK(entry.node_id.is_valid())
  64. << "Expected valid id on " << parse_tree_->node_kind(entry.parse_node);
  65. }
  66. auto SemanticsNodeStack::PopAndDiscardId() -> void {
  67. auto back = PopEntry();
  68. RequireValidId(back);
  69. }
  70. auto SemanticsNodeStack::PopAndDiscardId(ParseNodeKind pop_parse_kind) -> void {
  71. auto back = PopEntry(pop_parse_kind);
  72. RequireValidId(back);
  73. }
  74. auto SemanticsNodeStack::PopAndDiscardSoloParseNode(
  75. ParseNodeKind pop_parse_kind) -> void {
  76. auto back = PopEntry(pop_parse_kind);
  77. RequireSoloParseNode(back);
  78. }
  79. auto SemanticsNodeStack::PopForSoloParseNode() -> ParseTree::Node {
  80. auto back = PopEntry();
  81. RequireSoloParseNode(back);
  82. return back.parse_node;
  83. }
  84. auto SemanticsNodeStack::PopForSoloParseNode(ParseNodeKind pop_parse_kind)
  85. -> ParseTree::Node {
  86. auto back = PopEntry(pop_parse_kind);
  87. RequireSoloParseNode(back);
  88. return back.parse_node;
  89. }
  90. auto SemanticsNodeStack::PopForNodeId() -> SemanticsNodeId {
  91. auto back = PopEntry();
  92. RequireValidId(back);
  93. return back.node_id;
  94. }
  95. auto SemanticsNodeStack::PopForNodeId(ParseNodeKind pop_parse_kind)
  96. -> SemanticsNodeId {
  97. auto back = PopEntry(pop_parse_kind);
  98. RequireValidId(back);
  99. return back.node_id;
  100. }
  101. auto SemanticsNodeStack::PopForParseNodeAndNodeId()
  102. -> std::pair<ParseTree::Node, SemanticsNodeId> {
  103. auto back = PopEntry();
  104. RequireValidId(back);
  105. return {back.parse_node, back.node_id};
  106. }
  107. auto SemanticsNodeStack::PopForParseNodeAndNodeId(ParseNodeKind pop_parse_kind)
  108. -> std::pair<ParseTree::Node, SemanticsNodeId> {
  109. auto back = PopEntry(pop_parse_kind);
  110. RequireValidId(back);
  111. return {back.parse_node, back.node_id};
  112. }
  113. auto SemanticsNodeStack::PopForParseNodeAndNameId(ParseNodeKind pop_parse_kind)
  114. -> std::pair<ParseTree::Node, SemanticsStringId> {
  115. auto back = PopEntry(pop_parse_kind);
  116. RequireValidId(back);
  117. return {back.parse_node, back.name_id};
  118. }
  119. auto SemanticsNodeStack::PeekForNameId(ParseNodeKind parse_kind)
  120. -> SemanticsStringId {
  121. auto back = stack_.back();
  122. RequireParseKind(back, parse_kind);
  123. RequireValidId(back);
  124. return back.name_id;
  125. }
  126. auto SemanticsNodeStack::PrintForStackDump(llvm::raw_ostream& output) const
  127. -> void {
  128. output << "SemanticsNodeStack:\n";
  129. for (int i = 0; i < static_cast<int>(stack_.size()); ++i) {
  130. const auto& entry = stack_[i];
  131. auto parse_node_kind = parse_tree_->node_kind(entry.parse_node);
  132. output << "\t" << i << ".\t" << parse_node_kind;
  133. if (parse_node_kind == ParseNodeKind::PatternBinding) {
  134. output << " -> " << entry.name_id;
  135. } else {
  136. if (entry.node_id.is_valid()) {
  137. output << " -> " << entry.node_id;
  138. }
  139. }
  140. output << "\n";
  141. }
  142. }
  143. } // namespace Carbon