node_stack.h 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374
  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. #ifndef CARBON_TOOLCHAIN_CHECK_NODE_STACK_H_
  5. #define CARBON_TOOLCHAIN_CHECK_NODE_STACK_H_
  6. #include <type_traits>
  7. #include "common/vlog.h"
  8. #include "llvm/ADT/SmallVector.h"
  9. #include "toolchain/parse/node_kind.h"
  10. #include "toolchain/parse/tree.h"
  11. #include "toolchain/sem_ir/node.h"
  12. namespace Carbon::Check {
  13. // Wraps the stack of nodes for Context.
  14. //
  15. // All pushes and pops will be vlogged.
  16. //
  17. // Pop APIs will run basic verification:
  18. //
  19. // - If receiving a pop_parse_kind, verify that the parse_node being popped is
  20. // of pop_parse_kind.
  21. // - Validates presence of node_id based on whether it's a solo
  22. // parse_node.
  23. //
  24. // These should be assumed API constraints unless otherwise mentioned on a
  25. // method. The main exception is PopAndIgnore, which doesn't do verification.
  26. class NodeStack {
  27. public:
  28. explicit NodeStack(const Parse::Tree& parse_tree,
  29. llvm::raw_ostream* vlog_stream)
  30. : parse_tree_(&parse_tree), vlog_stream_(vlog_stream) {}
  31. // Pushes a solo parse tree node onto the stack. Used when there is no
  32. // IR generated by the node.
  33. auto Push(Parse::Node parse_node) -> void {
  34. CARBON_CHECK(ParseNodeKindToIdKind(parse_tree_->node_kind(parse_node)) ==
  35. IdKind::SoloParseNode)
  36. << "Parse kind expects an Id: " << parse_tree_->node_kind(parse_node);
  37. CARBON_VLOG() << "Node Push " << stack_.size() << ": "
  38. << parse_tree_->node_kind(parse_node) << " -> <none>\n";
  39. CARBON_CHECK(stack_.size() < (1 << 20))
  40. << "Excessive stack size: likely infinite loop";
  41. stack_.push_back(Entry(parse_node, SemIR::NodeId::Invalid));
  42. }
  43. // Pushes a parse tree node onto the stack with an ID.
  44. template <typename IdT>
  45. auto Push(Parse::Node parse_node, IdT id) -> void {
  46. CARBON_CHECK(ParseNodeKindToIdKind(parse_tree_->node_kind(parse_node)) ==
  47. IdTypeToIdKind<IdT>())
  48. << "Parse kind expected a different IdT: "
  49. << parse_tree_->node_kind(parse_node) << " -> " << id << "\n";
  50. CARBON_CHECK(id.is_valid()) << "Push called with invalid id: "
  51. << parse_tree_->node_kind(parse_node);
  52. CARBON_VLOG() << "Node Push " << stack_.size() << ": "
  53. << parse_tree_->node_kind(parse_node) << " -> " << id << "\n";
  54. CARBON_CHECK(stack_.size() < (1 << 20))
  55. << "Excessive stack size: likely infinite loop";
  56. stack_.push_back(Entry(parse_node, id));
  57. }
  58. // Pops the top of the stack without any verification.
  59. auto PopAndIgnore() -> void { PopEntry<SemIR::NodeId>(); }
  60. // Pops the top of the stack and returns the parse_node.
  61. template <Parse::NodeKind::RawEnumType RequiredParseKind>
  62. auto PopForSoloParseNode() -> Parse::Node {
  63. Entry back = PopEntry<SemIR::NodeId>();
  64. RequireIdKind(Parse::NodeKind::Create(RequiredParseKind),
  65. IdKind::SoloParseNode);
  66. RequireParseKind<RequiredParseKind>(back.parse_node);
  67. return back.parse_node;
  68. }
  69. // Pops the top of the stack.
  70. template <Parse::NodeKind::RawEnumType RequiredParseKind>
  71. auto PopAndDiscardSoloParseNode() -> void {
  72. PopForSoloParseNode<RequiredParseKind>();
  73. }
  74. // Pops an expression from the top of the stack and returns the parse_node and
  75. // the ID.
  76. auto PopExpressionWithParseNode() -> std::pair<Parse::Node, SemIR::NodeId> {
  77. return PopWithParseNode<SemIR::NodeId>();
  78. }
  79. // Pops the top of the stack and returns the parse_node and the ID.
  80. template <Parse::NodeKind::RawEnumType RequiredParseKind>
  81. auto PopWithParseNode() -> auto {
  82. constexpr IdKind RequiredIdKind =
  83. ParseNodeKindToIdKind(Parse::NodeKind::Create(RequiredParseKind));
  84. if constexpr (RequiredIdKind == IdKind::NodeId) {
  85. auto back = PopWithParseNode<SemIR::NodeId>();
  86. RequireParseKind<RequiredParseKind>(back.first);
  87. return back;
  88. }
  89. if constexpr (RequiredIdKind == IdKind::NodeBlockId) {
  90. auto back = PopWithParseNode<SemIR::NodeBlockId>();
  91. RequireParseKind<RequiredParseKind>(back.first);
  92. return back;
  93. }
  94. if constexpr (RequiredIdKind == IdKind::FunctionId) {
  95. auto back = PopWithParseNode<SemIR::FunctionId>();
  96. RequireParseKind<RequiredParseKind>(back.first);
  97. return back;
  98. }
  99. if constexpr (RequiredIdKind == IdKind::ClassId) {
  100. auto back = PopWithParseNode<SemIR::ClassId>();
  101. RequireParseKind<RequiredParseKind>(back.first);
  102. return back;
  103. }
  104. if constexpr (RequiredIdKind == IdKind::StringId) {
  105. auto back = PopWithParseNode<StringId>();
  106. RequireParseKind<RequiredParseKind>(back.first);
  107. return back;
  108. }
  109. if constexpr (RequiredIdKind == IdKind::TypeId) {
  110. auto back = PopWithParseNode<SemIR::TypeId>();
  111. RequireParseKind<RequiredParseKind>(back.first);
  112. return back;
  113. }
  114. CARBON_FATAL() << "Unpoppable IdKind for parse kind: "
  115. << Parse::NodeKind::Create(RequiredParseKind)
  116. << "; see value in ParseNodeKindToIdKind";
  117. }
  118. // Pops an expression from the top of the stack and returns the ID.
  119. // Expressions map multiple Parse::NodeKinds to SemIR::NodeId always.
  120. auto PopExpression() -> SemIR::NodeId {
  121. return PopExpressionWithParseNode().second;
  122. }
  123. // Pops the top of the stack and returns the ID.
  124. template <Parse::NodeKind::RawEnumType RequiredParseKind>
  125. auto Pop() -> auto {
  126. return PopWithParseNode<RequiredParseKind>().second;
  127. }
  128. // Peeks at the parse_node of the top of the stack.
  129. auto PeekParseNode() -> Parse::Node { return stack_.back().parse_node; }
  130. // Peeks at the ID of the top of the stack.
  131. template <Parse::NodeKind::RawEnumType RequiredParseKind>
  132. auto Peek() -> auto {
  133. Entry back = stack_.back();
  134. RequireParseKind<RequiredParseKind>(back.parse_node);
  135. constexpr IdKind RequiredIdKind =
  136. ParseNodeKindToIdKind(Parse::NodeKind::Create(RequiredParseKind));
  137. if constexpr (RequiredIdKind == IdKind::NodeId) {
  138. return back.id<SemIR::NodeId>();
  139. }
  140. if constexpr (RequiredIdKind == IdKind::NodeBlockId) {
  141. return back.id<SemIR::NodeBlockId>();
  142. }
  143. if constexpr (RequiredIdKind == IdKind::FunctionId) {
  144. return back.id<SemIR::FunctionId>();
  145. }
  146. if constexpr (RequiredIdKind == IdKind::ClassId) {
  147. return back.id<SemIR::ClassId>();
  148. }
  149. if constexpr (RequiredIdKind == IdKind::StringId) {
  150. return back.id<StringId>();
  151. }
  152. if constexpr (RequiredIdKind == IdKind::TypeId) {
  153. return back.id<SemIR::TypeId>();
  154. }
  155. CARBON_FATAL() << "Unpeekable IdKind for parse kind: "
  156. << Parse::NodeKind::Create(RequiredParseKind)
  157. << "; see value in ParseNodeKindToIdKind";
  158. }
  159. // Prints the stack for a stack dump.
  160. auto PrintForStackDump(llvm::raw_ostream& output) const -> void;
  161. auto empty() const -> bool { return stack_.empty(); }
  162. auto size() const -> size_t { return stack_.size(); }
  163. private:
  164. // Possible associated ID types.
  165. enum class IdKind : int8_t {
  166. NodeId,
  167. NodeBlockId,
  168. FunctionId,
  169. ClassId,
  170. StringId,
  171. TypeId,
  172. // No associated ID type.
  173. SoloParseNode,
  174. // Not expected in the node stack.
  175. Unused,
  176. };
  177. // An entry in stack_.
  178. struct Entry {
  179. explicit Entry(Parse::Node parse_node, SemIR::NodeId node_id)
  180. : parse_node(parse_node), node_id(node_id) {}
  181. explicit Entry(Parse::Node parse_node, SemIR::NodeBlockId node_block_id)
  182. : parse_node(parse_node), node_block_id(node_block_id) {}
  183. explicit Entry(Parse::Node parse_node, SemIR::FunctionId function_id)
  184. : parse_node(parse_node), function_id(function_id) {}
  185. explicit Entry(Parse::Node parse_node, StringId name_id)
  186. : parse_node(parse_node), name_id(name_id) {}
  187. explicit Entry(Parse::Node parse_node, SemIR::TypeId type_id)
  188. : parse_node(parse_node), type_id(type_id) {}
  189. // Returns the appropriate ID basaed on type.
  190. template <typename T>
  191. auto id() -> T& {
  192. if constexpr (std::is_same<T, SemIR::NodeId>()) {
  193. return node_id;
  194. }
  195. if constexpr (std::is_same<T, SemIR::NodeBlockId>()) {
  196. return node_block_id;
  197. }
  198. if constexpr (std::is_same<T, SemIR::FunctionId>()) {
  199. return function_id;
  200. }
  201. if constexpr (std::is_same<T, StringId>()) {
  202. return name_id;
  203. }
  204. if constexpr (std::is_same<T, SemIR::TypeId>()) {
  205. return type_id;
  206. }
  207. }
  208. // The node associated with the stack entry.
  209. Parse::Node parse_node;
  210. // The entries will evaluate as invalid if and only if they're a solo
  211. // parse_node. Invalid is used instead of optional to save space.
  212. //
  213. // A discriminator isn't needed because the caller can determine which field
  214. // is used based on the Parse::NodeKind.
  215. union {
  216. SemIR::NodeId node_id;
  217. SemIR::NodeBlockId node_block_id;
  218. SemIR::FunctionId function_id;
  219. StringId name_id;
  220. SemIR::TypeId type_id;
  221. };
  222. };
  223. static_assert(sizeof(Entry) == 8, "Unexpected Entry size");
  224. // Translate a parse node kind to the enum ID kind it should always provide.
  225. static constexpr auto ParseNodeKindToIdKind(Parse::NodeKind kind) -> IdKind {
  226. switch (kind) {
  227. case Parse::NodeKind::ArrayExpression:
  228. case Parse::NodeKind::CallExpression:
  229. case Parse::NodeKind::CallExpressionStart:
  230. case Parse::NodeKind::IfExpressionThen:
  231. case Parse::NodeKind::IfExpressionElse:
  232. case Parse::NodeKind::IndexExpression:
  233. case Parse::NodeKind::InfixOperator:
  234. case Parse::NodeKind::Literal:
  235. case Parse::NodeKind::MemberAccessExpression:
  236. case Parse::NodeKind::NameExpression:
  237. case Parse::NodeKind::ParenExpression:
  238. case Parse::NodeKind::PatternBinding:
  239. case Parse::NodeKind::PostfixOperator:
  240. case Parse::NodeKind::PrefixOperator:
  241. case Parse::NodeKind::ReturnType:
  242. case Parse::NodeKind::ShortCircuitOperand:
  243. case Parse::NodeKind::StructFieldValue:
  244. case Parse::NodeKind::StructLiteral:
  245. case Parse::NodeKind::StructFieldType:
  246. case Parse::NodeKind::StructTypeLiteral:
  247. case Parse::NodeKind::TupleLiteral:
  248. return IdKind::NodeId;
  249. case Parse::NodeKind::IfCondition:
  250. case Parse::NodeKind::IfExpressionIf:
  251. case Parse::NodeKind::ParameterList:
  252. case Parse::NodeKind::WhileCondition:
  253. case Parse::NodeKind::WhileConditionStart:
  254. return IdKind::NodeBlockId;
  255. case Parse::NodeKind::FunctionDefinitionStart:
  256. return IdKind::FunctionId;
  257. case Parse::NodeKind::Name:
  258. return IdKind::StringId;
  259. case Parse::NodeKind::ArrayExpressionSemi:
  260. case Parse::NodeKind::ClassIntroducer:
  261. case Parse::NodeKind::CodeBlockStart:
  262. case Parse::NodeKind::FunctionIntroducer:
  263. case Parse::NodeKind::IfStatementElse:
  264. case Parse::NodeKind::LetIntroducer:
  265. case Parse::NodeKind::ParameterListStart:
  266. case Parse::NodeKind::ParenExpressionOrTupleLiteralStart:
  267. case Parse::NodeKind::QualifiedDeclaration:
  268. case Parse::NodeKind::ReturnStatementStart:
  269. case Parse::NodeKind::StructLiteralOrStructTypeLiteralStart:
  270. case Parse::NodeKind::VariableInitializer:
  271. case Parse::NodeKind::VariableIntroducer:
  272. return IdKind::SoloParseNode;
  273. default:
  274. return IdKind::Unused;
  275. }
  276. }
  277. // Translates an ID type to the enum ID kind for comparison with
  278. // ParseNodeKindToIdKind.
  279. template <typename IdT>
  280. static constexpr auto IdTypeToIdKind() -> IdKind {
  281. if constexpr (std::is_same_v<IdT, SemIR::NodeId>) {
  282. return IdKind::NodeId;
  283. }
  284. if constexpr (std::is_same_v<IdT, SemIR::NodeBlockId>) {
  285. return IdKind::NodeBlockId;
  286. }
  287. if constexpr (std::is_same_v<IdT, SemIR::FunctionId>) {
  288. return IdKind::FunctionId;
  289. }
  290. if constexpr (std::is_same_v<IdT, SemIR::ClassId>) {
  291. return IdKind::ClassId;
  292. }
  293. if constexpr (std::is_same_v<IdT, StringId>) {
  294. return IdKind::StringId;
  295. }
  296. if constexpr (std::is_same_v<IdT, SemIR::TypeId>) {
  297. return IdKind::TypeId;
  298. }
  299. }
  300. // Pops an entry.
  301. template <typename IdT>
  302. auto PopEntry() -> Entry {
  303. Entry back = stack_.pop_back_val();
  304. CARBON_VLOG() << "Node Pop " << stack_.size() << ": "
  305. << parse_tree_->node_kind(back.parse_node) << " -> "
  306. << back.id<IdT>() << "\n";
  307. return back;
  308. }
  309. // Pops the top of the stack and returns the parse_node and the ID.
  310. template <typename IdT>
  311. auto PopWithParseNode() -> std::pair<Parse::Node, IdT> {
  312. Entry back = PopEntry<IdT>();
  313. RequireIdKind(parse_tree_->node_kind(back.parse_node),
  314. IdTypeToIdKind<IdT>());
  315. return {back.parse_node, back.id<IdT>()};
  316. }
  317. // Require a Parse::NodeKind be mapped to a particular IdKind.
  318. auto RequireIdKind(Parse::NodeKind parse_kind, IdKind id_kind) -> void {
  319. CARBON_CHECK(ParseNodeKindToIdKind(parse_kind) == id_kind)
  320. << "Unexpected IdKind mapping for " << parse_kind;
  321. }
  322. // Require an entry to have the given Parse::NodeKind.
  323. template <Parse::NodeKind::RawEnumType RequiredParseKind>
  324. auto RequireParseKind(Parse::Node parse_node) -> void {
  325. auto actual_kind = parse_tree_->node_kind(parse_node);
  326. CARBON_CHECK(RequiredParseKind == actual_kind)
  327. << "Expected " << Parse::NodeKind::Create(RequiredParseKind)
  328. << ", found " << actual_kind;
  329. }
  330. // The file's parse tree.
  331. const Parse::Tree* parse_tree_;
  332. // Whether to print verbose output.
  333. llvm::raw_ostream* vlog_stream_;
  334. // The actual stack.
  335. // PushEntry and PopEntry control modification in order to centralize
  336. // vlogging.
  337. llvm::SmallVector<Entry> stack_;
  338. };
  339. } // namespace Carbon::Check
  340. #endif // CARBON_TOOLCHAIN_CHECK_NODE_STACK_H_