handle_operator.cpp 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442
  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/check/context.h"
  5. #include "toolchain/check/control_flow.h"
  6. #include "toolchain/check/convert.h"
  7. #include "toolchain/check/handle.h"
  8. #include "toolchain/check/inst.h"
  9. #include "toolchain/check/operator.h"
  10. #include "toolchain/check/pointer_dereference.h"
  11. #include "toolchain/check/type.h"
  12. #include "toolchain/diagnostics/diagnostic_emitter.h"
  13. namespace Carbon::Check {
  14. // Common logic for unary operator handlers.
  15. static auto HandleUnaryOperator(Context& context, Parse::AnyExprId expr_node_id,
  16. Operator op) -> bool {
  17. auto operand_id = context.node_stack().PopExpr();
  18. auto result_id = BuildUnaryOperator(context, expr_node_id, op, operand_id);
  19. context.node_stack().Push(expr_node_id, result_id);
  20. return true;
  21. }
  22. // Common logic for binary operator handlers.
  23. static auto HandleBinaryOperator(Context& context,
  24. Parse::AnyExprId expr_node_id, Operator op)
  25. -> bool {
  26. auto rhs_id = context.node_stack().PopExpr();
  27. auto lhs_id = context.node_stack().PopExpr();
  28. auto result_id =
  29. BuildBinaryOperator(context, expr_node_id, op, lhs_id, rhs_id);
  30. context.node_stack().Push(expr_node_id, result_id);
  31. return true;
  32. }
  33. auto HandleParseNode(Context& context, Parse::InfixOperatorAmpId node_id)
  34. -> bool {
  35. // TODO: Facet type intersection may need to be handled directly.
  36. return HandleBinaryOperator(context, node_id, {"BitAnd"});
  37. }
  38. auto HandleParseNode(Context& context, Parse::InfixOperatorAmpEqualId node_id)
  39. -> bool {
  40. return HandleBinaryOperator(context, node_id, {"BitAndAssign"});
  41. }
  42. auto HandleParseNode(Context& context, Parse::InfixOperatorAsId node_id)
  43. -> bool {
  44. auto [rhs_node, rhs_id] = context.node_stack().PopExprWithNodeId();
  45. auto [lhs_node, lhs_id] = context.node_stack().PopExprWithNodeId();
  46. auto rhs_type_id = ExprAsType(context, rhs_node, rhs_id).type_id;
  47. context.node_stack().Push(
  48. node_id, ConvertForExplicitAs(context, node_id, lhs_id, rhs_type_id));
  49. return true;
  50. }
  51. auto HandleParseNode(Context& context, Parse::InfixOperatorCaretId node_id)
  52. -> bool {
  53. return HandleBinaryOperator(context, node_id, {"BitXor"});
  54. }
  55. auto HandleParseNode(Context& context, Parse::InfixOperatorCaretEqualId node_id)
  56. -> bool {
  57. return HandleBinaryOperator(context, node_id, {"BitXorAssign"});
  58. }
  59. auto HandleParseNode(Context& context, Parse::InfixOperatorEqualId node_id)
  60. -> bool {
  61. // TODO: Switch to using assignment interface for most assignment. Some cases
  62. // may need to be handled directly.
  63. //
  64. // return HandleBinaryOperator(context, node_id, {"Assign"});
  65. auto [rhs_node, rhs_id] = context.node_stack().PopExprWithNodeId();
  66. auto [lhs_node, lhs_id] = context.node_stack().PopExprWithNodeId();
  67. if (auto lhs_cat = SemIR::GetExprCategory(context.sem_ir(), lhs_id);
  68. lhs_cat != SemIR::ExprCategory::DurableRef &&
  69. lhs_cat != SemIR::ExprCategory::Error) {
  70. CARBON_DIAGNOSTIC(AssignmentToNonAssignable, Error,
  71. "expression is not assignable");
  72. context.emitter().Emit(lhs_node, AssignmentToNonAssignable);
  73. }
  74. // TODO: Destroy the old value before reinitializing. This will require
  75. // building the destruction code before we build the RHS subexpression.
  76. rhs_id = Initialize(context, node_id, lhs_id, rhs_id);
  77. AddInst<SemIR::Assign>(context, node_id,
  78. {.lhs_id = lhs_id, .rhs_id = rhs_id});
  79. // We model assignment as an expression, so we need to push a value for
  80. // it, even though it doesn't produce a value.
  81. // TODO: Consider changing our parse tree to model assignment as a
  82. // different kind of statement than an expression statement.
  83. context.node_stack().Push(node_id, lhs_id);
  84. return true;
  85. }
  86. auto HandleParseNode(Context& context, Parse::InfixOperatorEqualEqualId node_id)
  87. -> bool {
  88. return HandleBinaryOperator(context, node_id, {"Eq", {}, "Equal"});
  89. }
  90. auto HandleParseNode(Context& context,
  91. Parse::InfixOperatorExclaimEqualId node_id) -> bool {
  92. return HandleBinaryOperator(context, node_id, {"Eq", {}, "NotEqual"});
  93. }
  94. auto HandleParseNode(Context& context, Parse::InfixOperatorGreaterId node_id)
  95. -> bool {
  96. return HandleBinaryOperator(context, node_id, {"Ordered", {}, "Greater"});
  97. }
  98. auto HandleParseNode(Context& context,
  99. Parse::InfixOperatorGreaterEqualId node_id) -> bool {
  100. return HandleBinaryOperator(context, node_id,
  101. {"Ordered", {}, "GreaterOrEquivalent"});
  102. }
  103. auto HandleParseNode(Context& context,
  104. Parse::InfixOperatorGreaterGreaterId node_id) -> bool {
  105. return HandleBinaryOperator(context, node_id, {"RightShift"});
  106. }
  107. auto HandleParseNode(Context& context,
  108. Parse::InfixOperatorGreaterGreaterEqualId node_id)
  109. -> bool {
  110. return HandleBinaryOperator(context, node_id, {"RightShiftAssign"});
  111. }
  112. auto HandleParseNode(Context& context, Parse::InfixOperatorLessId node_id)
  113. -> bool {
  114. return HandleBinaryOperator(context, node_id, {"Ordered", {}, "Less"});
  115. }
  116. auto HandleParseNode(Context& context, Parse::InfixOperatorLessEqualId node_id)
  117. -> bool {
  118. return HandleBinaryOperator(context, node_id,
  119. {"Ordered", {}, "LessOrEquivalent"});
  120. }
  121. auto HandleParseNode(Context& context,
  122. Parse::InfixOperatorLessEqualGreaterId node_id) -> bool {
  123. return context.TODO(node_id, "remove <=> operator that is not in the design");
  124. }
  125. auto HandleParseNode(Context& context, Parse::InfixOperatorLessLessId node_id)
  126. -> bool {
  127. return HandleBinaryOperator(context, node_id, {"LeftShift"});
  128. }
  129. auto HandleParseNode(Context& context,
  130. Parse::InfixOperatorLessLessEqualId node_id) -> bool {
  131. return HandleBinaryOperator(context, node_id, {"LeftShiftAssign"});
  132. }
  133. auto HandleParseNode(Context& context, Parse::InfixOperatorMinusId node_id)
  134. -> bool {
  135. return HandleBinaryOperator(context, node_id, {"Sub"});
  136. }
  137. auto HandleParseNode(Context& context, Parse::InfixOperatorMinusEqualId node_id)
  138. -> bool {
  139. return HandleBinaryOperator(context, node_id, {"SubAssign"});
  140. }
  141. auto HandleParseNode(Context& context, Parse::InfixOperatorPercentId node_id)
  142. -> bool {
  143. return HandleBinaryOperator(context, node_id, {"Mod"});
  144. }
  145. auto HandleParseNode(Context& context,
  146. Parse::InfixOperatorPercentEqualId node_id) -> bool {
  147. return HandleBinaryOperator(context, node_id, {"ModAssign"});
  148. }
  149. auto HandleParseNode(Context& context, Parse::InfixOperatorPipeId node_id)
  150. -> bool {
  151. return HandleBinaryOperator(context, node_id, {"BitOr"});
  152. }
  153. auto HandleParseNode(Context& context, Parse::InfixOperatorPipeEqualId node_id)
  154. -> bool {
  155. return HandleBinaryOperator(context, node_id, {"BitOrAssign"});
  156. }
  157. auto HandleParseNode(Context& context, Parse::InfixOperatorPlusId node_id)
  158. -> bool {
  159. return HandleBinaryOperator(context, node_id, {"Add"});
  160. }
  161. auto HandleParseNode(Context& context, Parse::InfixOperatorPlusEqualId node_id)
  162. -> bool {
  163. return HandleBinaryOperator(context, node_id, {"AddAssign"});
  164. }
  165. auto HandleParseNode(Context& context, Parse::InfixOperatorSlashId node_id)
  166. -> bool {
  167. return HandleBinaryOperator(context, node_id, {"Div"});
  168. }
  169. auto HandleParseNode(Context& context, Parse::InfixOperatorSlashEqualId node_id)
  170. -> bool {
  171. return HandleBinaryOperator(context, node_id, {"DivAssign"});
  172. }
  173. auto HandleParseNode(Context& context, Parse::InfixOperatorStarId node_id)
  174. -> bool {
  175. return HandleBinaryOperator(context, node_id, {"Mul"});
  176. }
  177. auto HandleParseNode(Context& context, Parse::InfixOperatorStarEqualId node_id)
  178. -> bool {
  179. return HandleBinaryOperator(context, node_id, {"MulAssign"});
  180. }
  181. auto HandleParseNode(Context& context, Parse::PostfixOperatorStarId node_id)
  182. -> bool {
  183. auto value_id = context.node_stack().PopExpr();
  184. auto inner_type_id = ExprAsType(context, node_id, value_id).type_id;
  185. AddInstAndPush<SemIR::PointerType>(
  186. context, node_id,
  187. {.type_id = SemIR::TypeType::SingletonTypeId,
  188. .pointee_id = inner_type_id});
  189. return true;
  190. }
  191. auto HandleParseNode(Context& context, Parse::PrefixOperatorAmpId node_id)
  192. -> bool {
  193. auto value_id = context.node_stack().PopExpr();
  194. auto type_id = context.insts().Get(value_id).type_id();
  195. // Only durable reference expressions can have their address taken.
  196. switch (SemIR::GetExprCategory(context.sem_ir(), value_id)) {
  197. case SemIR::ExprCategory::DurableRef:
  198. case SemIR::ExprCategory::Error:
  199. break;
  200. case SemIR::ExprCategory::EphemeralRef:
  201. CARBON_DIAGNOSTIC(AddrOfEphemeralRef, Error,
  202. "cannot take the address of a temporary object");
  203. context.emitter().Emit(TokenOnly(node_id), AddrOfEphemeralRef);
  204. value_id = SemIR::ErrorInst::SingletonInstId;
  205. break;
  206. default:
  207. CARBON_DIAGNOSTIC(AddrOfNonRef, Error,
  208. "cannot take the address of non-reference expression");
  209. context.emitter().Emit(TokenOnly(node_id), AddrOfNonRef);
  210. value_id = SemIR::ErrorInst::SingletonInstId;
  211. break;
  212. }
  213. AddInstAndPush<SemIR::AddrOf>(
  214. context, node_id,
  215. SemIR::AddrOf{.type_id = GetPointerType(context, type_id),
  216. .lvalue_id = value_id});
  217. return true;
  218. }
  219. auto HandleParseNode(Context& context, Parse::PrefixOperatorCaretId node_id)
  220. -> bool {
  221. return HandleUnaryOperator(context, node_id, {"BitComplement"});
  222. }
  223. auto HandleParseNode(Context& context, Parse::PrefixOperatorConstId node_id)
  224. -> bool {
  225. auto value_id = context.node_stack().PopExpr();
  226. // `const (const T)` is probably not what the developer intended.
  227. // TODO: Detect `const (const T)*` and suggest moving the `*` inside the
  228. // parentheses.
  229. if (context.insts().Get(value_id).kind() == SemIR::ConstType::Kind) {
  230. CARBON_DIAGNOSTIC(RepeatedConst, Warning,
  231. "`const` applied repeatedly to the same type has no "
  232. "additional effect");
  233. context.emitter().Emit(node_id, RepeatedConst);
  234. }
  235. auto inner_type_id = ExprAsType(context, node_id, value_id).type_id;
  236. AddInstAndPush<SemIR::ConstType>(
  237. context, node_id,
  238. {.type_id = SemIR::TypeType::SingletonTypeId, .inner_id = inner_type_id});
  239. return true;
  240. }
  241. auto HandleParseNode(Context& context, Parse::PrefixOperatorMinusId node_id)
  242. -> bool {
  243. return HandleUnaryOperator(context, node_id, {"Negate"});
  244. }
  245. auto HandleParseNode(Context& context,
  246. Parse::PrefixOperatorMinusMinusId node_id) -> bool {
  247. return HandleUnaryOperator(context, node_id, {"Dec"});
  248. }
  249. auto HandleParseNode(Context& context, Parse::PrefixOperatorNotId node_id)
  250. -> bool {
  251. auto value_id = context.node_stack().PopExpr();
  252. value_id = ConvertToBoolValue(context, node_id, value_id);
  253. AddInstAndPush<SemIR::UnaryOperatorNot>(
  254. context, node_id,
  255. {.type_id = context.insts().Get(value_id).type_id(),
  256. .operand_id = value_id});
  257. return true;
  258. }
  259. auto HandleParseNode(Context& context, Parse::PrefixOperatorPartialId node_id)
  260. -> bool {
  261. return context.TODO(node_id, "partial operator");
  262. }
  263. auto HandleParseNode(Context& context, Parse::PrefixOperatorPlusPlusId node_id)
  264. -> bool {
  265. return HandleUnaryOperator(context, node_id, {"Inc"});
  266. }
  267. auto HandleParseNode(Context& context, Parse::PrefixOperatorStarId node_id)
  268. -> bool {
  269. auto base_id = context.node_stack().PopExpr();
  270. auto deref_base_id = PerformPointerDereference(
  271. context, node_id, base_id,
  272. [&context, &node_id](SemIR::TypeId not_pointer_type_id) {
  273. // TODO: Pass in the expression we're trying to dereference to produce a
  274. // better diagnostic.
  275. CARBON_DIAGNOSTIC(DerefOfNonPointer, Error,
  276. "cannot dereference operand of non-pointer type {0}",
  277. SemIR::TypeId);
  278. auto builder = context.emitter().Build(
  279. TokenOnly(node_id), DerefOfNonPointer, not_pointer_type_id);
  280. // TODO: Check for any facet here, rather than only a type.
  281. if (not_pointer_type_id == SemIR::TypeType::SingletonTypeId) {
  282. CARBON_DIAGNOSTIC(
  283. DerefOfType, Note,
  284. "to form a pointer type, write the `*` after the pointee type");
  285. builder.Note(TokenOnly(node_id), DerefOfType);
  286. }
  287. builder.Emit();
  288. });
  289. context.node_stack().Push(node_id, deref_base_id);
  290. return true;
  291. }
  292. // Adds the branch for a short circuit operand.
  293. static auto HandleShortCircuitOperand(Context& context, Parse::NodeId node_id,
  294. bool is_or) -> bool {
  295. // Convert the condition to `bool`.
  296. auto [cond_node, cond_value_id] = context.node_stack().PopExprWithNodeId();
  297. cond_value_id = ConvertToBoolValue(context, node_id, cond_value_id);
  298. auto bool_type_id = context.insts().Get(cond_value_id).type_id();
  299. // Compute the branch value: the condition for `and`, inverted for `or`.
  300. SemIR::InstId branch_value_id =
  301. is_or ? AddInst<SemIR::UnaryOperatorNot>(
  302. context, node_id,
  303. {.type_id = bool_type_id, .operand_id = cond_value_id})
  304. : cond_value_id;
  305. auto short_circuit_result_id = AddInst<SemIR::BoolLiteral>(
  306. context, node_id,
  307. {.type_id = bool_type_id, .value = SemIR::BoolValue::From(is_or)});
  308. // Create a block for the right-hand side and for the continuation.
  309. auto rhs_block_id =
  310. AddDominatedBlockAndBranchIf(context, node_id, branch_value_id);
  311. auto end_block_id = AddDominatedBlockAndBranchWithArg(
  312. context, node_id, short_circuit_result_id);
  313. // Push the branch condition and result for use when handling the complete
  314. // expression.
  315. context.node_stack().Push(cond_node, branch_value_id);
  316. context.node_stack().Push(cond_node, short_circuit_result_id);
  317. // Push the resumption and the right-hand side blocks, and start emitting the
  318. // right-hand operand.
  319. context.inst_block_stack().Pop();
  320. context.inst_block_stack().Push(end_block_id);
  321. context.inst_block_stack().Push(rhs_block_id);
  322. context.region_stack().AddToRegion(rhs_block_id, node_id);
  323. // HandleShortCircuitOperator will follow, and doesn't need the operand on the
  324. // node stack.
  325. return true;
  326. }
  327. auto HandleParseNode(Context& context, Parse::ShortCircuitOperandAndId node_id)
  328. -> bool {
  329. return HandleShortCircuitOperand(context, node_id, /*is_or=*/false);
  330. }
  331. auto HandleParseNode(Context& context, Parse::ShortCircuitOperandOrId node_id)
  332. -> bool {
  333. return HandleShortCircuitOperand(context, node_id, /*is_or=*/true);
  334. }
  335. // Short circuit operator handling is uniform because the branching logic
  336. // occurs during operand handling.
  337. static auto HandleShortCircuitOperator(Context& context, Parse::NodeId node_id)
  338. -> bool {
  339. if (context.return_scope_stack().empty()) {
  340. context.TODO(node_id,
  341. "Control flow expressions are currently only supported inside "
  342. "functions.");
  343. }
  344. auto [rhs_node, rhs_id] = context.node_stack().PopExprWithNodeId();
  345. auto short_circuit_result_id = context.node_stack().PopExpr();
  346. auto branch_value_id = context.node_stack().PopExpr();
  347. // The first operand is wrapped in a ShortCircuitOperand, which we
  348. // already handled by creating a RHS block and a resumption block, which
  349. // are the current block and its enclosing block.
  350. rhs_id = ConvertToBoolValue(context, node_id, rhs_id);
  351. // When the second operand is evaluated, the result of `and` and `or` is
  352. // its value.
  353. auto resume_block_id = context.inst_block_stack().PeekOrAdd(/*depth=*/1);
  354. AddInst<SemIR::BranchWithArg>(
  355. context, node_id, {.target_id = resume_block_id, .arg_id = rhs_id});
  356. context.inst_block_stack().Pop();
  357. context.region_stack().AddToRegion(resume_block_id, node_id);
  358. // Collect the result from either the first or second operand.
  359. auto result_id = AddInst<SemIR::BlockArg>(
  360. context, node_id,
  361. {.type_id = context.insts().Get(rhs_id).type_id(),
  362. .block_id = resume_block_id});
  363. SetBlockArgResultBeforeConstantUse(context, result_id, branch_value_id,
  364. rhs_id, short_circuit_result_id);
  365. context.node_stack().Push(node_id, result_id);
  366. return true;
  367. }
  368. auto HandleParseNode(Context& context, Parse::ShortCircuitOperatorAndId node_id)
  369. -> bool {
  370. return HandleShortCircuitOperator(context, node_id);
  371. }
  372. auto HandleParseNode(Context& context, Parse::ShortCircuitOperatorOrId node_id)
  373. -> bool {
  374. return HandleShortCircuitOperator(context, node_id);
  375. }
  376. } // namespace Carbon::Check