1 use super::{LoweringContext, ParamMode, ParenthesizedGenericArgs, ImplTraitContext};
2 use crate::hir::{self, HirVec};
3 use crate::hir::ptr::P;
5 use rustc_data_structures::thin_vec::ThinVec;
8 use syntax::ptr::P as AstP;
10 use syntax::source_map::{respan, DesugaringKind, Span};
11 use syntax::symbol::{sym, Symbol};
13 impl LoweringContext<'_> {
14 fn lower_exprs(&mut self, exprs: &[AstP<Expr>]) -> HirVec<hir::Expr> {
15 exprs.iter().map(|x| self.lower_expr(x)).collect()
18 pub(super) fn lower_expr(&mut self, e: &Expr) -> hir::Expr {
19 let kind = match e.node {
20 ExprKind::Box(ref inner) => hir::ExprKind::Box(P(self.lower_expr(inner))),
21 ExprKind::Array(ref exprs) => hir::ExprKind::Array(self.lower_exprs(exprs)),
22 ExprKind::Repeat(ref expr, ref count) => {
23 let expr = P(self.lower_expr(expr));
24 let count = self.lower_anon_const(count);
25 hir::ExprKind::Repeat(expr, count)
27 ExprKind::Tup(ref elts) => hir::ExprKind::Tup(self.lower_exprs(elts)),
28 ExprKind::Call(ref f, ref args) => {
29 let f = P(self.lower_expr(f));
30 hir::ExprKind::Call(f, self.lower_exprs(args))
32 ExprKind::MethodCall(ref seg, ref args) => {
33 let hir_seg = P(self.lower_path_segment(
38 ParenthesizedGenericArgs::Err,
39 ImplTraitContext::disallowed(),
42 let args = self.lower_exprs(args);
43 hir::ExprKind::MethodCall(hir_seg, seg.ident.span, args)
45 ExprKind::Binary(binop, ref lhs, ref rhs) => {
46 let binop = self.lower_binop(binop);
47 let lhs = P(self.lower_expr(lhs));
48 let rhs = P(self.lower_expr(rhs));
49 hir::ExprKind::Binary(binop, lhs, rhs)
51 ExprKind::Unary(op, ref ohs) => {
52 let op = self.lower_unop(op);
53 let ohs = P(self.lower_expr(ohs));
54 hir::ExprKind::Unary(op, ohs)
56 ExprKind::Lit(ref l) => hir::ExprKind::Lit(respan(l.span, l.node.clone())),
57 ExprKind::Cast(ref expr, ref ty) => {
58 let expr = P(self.lower_expr(expr));
59 hir::ExprKind::Cast(expr, self.lower_ty(ty, ImplTraitContext::disallowed()))
61 ExprKind::Type(ref expr, ref ty) => {
62 let expr = P(self.lower_expr(expr));
63 hir::ExprKind::Type(expr, self.lower_ty(ty, ImplTraitContext::disallowed()))
65 ExprKind::AddrOf(m, ref ohs) => {
66 let m = self.lower_mutability(m);
67 let ohs = P(self.lower_expr(ohs));
68 hir::ExprKind::AddrOf(m, ohs)
70 ExprKind::Let(ref pats, ref scrutinee) => {
71 // If we got here, the `let` expression is not allowed.
73 .struct_span_err(e.span, "`let` expressions are not supported here")
74 .note("only supported directly in conditions of `if`- and `while`-expressions")
75 .note("as well as when nested within `&&` and parenthesis in those conditions")
78 // For better recovery, we emit:
80 // match scrutinee { pats => true, _ => false }
82 // While this doesn't fully match the user's intent, it has key advantages:
83 // 1. We can avoid using `abort_if_errors`.
84 // 2. We can typeck both `pats` and `scrutinee`.
85 // 3. `pats` is allowed to be refutable.
86 // 4. The return type of the block is `bool` which seems like what the user wanted.
87 let scrutinee = self.lower_expr(scrutinee);
89 let pats = pats.iter().map(|pat| self.lower_pat(pat)).collect();
90 let expr = self.expr_bool(e.span, true);
91 self.arm(pats, P(expr))
94 let pats = hir_vec![self.pat_wild(e.span)];
95 let expr = self.expr_bool(e.span, false);
96 self.arm(pats, P(expr))
100 vec![then_arm, else_arm].into(),
101 hir::MatchSource::Normal,
104 ExprKind::If(ref cond, ref then, ref else_opt) => {
105 self.lower_expr_if(e.span, cond, then, else_opt.as_deref())
107 ExprKind::While(ref cond, ref body, opt_label) => self.with_loop_scope(e.id, |this| {
108 this.lower_expr_while_in_loop_scope(e.span, cond, body, opt_label)
110 ExprKind::Loop(ref body, opt_label) => self.with_loop_scope(e.id, |this| {
112 this.lower_block(body, false),
113 this.lower_label(opt_label),
114 hir::LoopSource::Loop,
117 ExprKind::TryBlock(ref body) => self.lower_expr_try_block(body),
118 ExprKind::Match(ref expr, ref arms) => hir::ExprKind::Match(
119 P(self.lower_expr(expr)),
120 arms.iter().map(|x| self.lower_arm(x)).collect(),
121 hir::MatchSource::Normal,
123 ExprKind::Async(capture_clause, closure_node_id, ref block) => {
124 self.make_async_expr(capture_clause, closure_node_id, None, block.span, |this| {
125 this.with_new_scopes(|this| {
126 let block = this.lower_block(block, false);
127 this.expr_block(block, ThinVec::new())
131 ExprKind::Await(ref expr) => self.lower_expr_await(e.span, expr),
133 capture_clause, asyncness, movability, ref decl, ref body, fn_decl_span
134 ) => if let IsAsync::Async { closure_id, .. } = asyncness {
135 self.lower_expr_async_closure(capture_clause, closure_id, decl, body, fn_decl_span)
137 self.lower_expr_closure(capture_clause, movability, decl, body, fn_decl_span)
139 ExprKind::Block(ref blk, opt_label) => {
140 hir::ExprKind::Block(self.lower_block(blk,
141 opt_label.is_some()),
142 self.lower_label(opt_label))
144 ExprKind::Assign(ref el, ref er) => {
145 hir::ExprKind::Assign(P(self.lower_expr(el)), P(self.lower_expr(er)))
147 ExprKind::AssignOp(op, ref el, ref er) => hir::ExprKind::AssignOp(
148 self.lower_binop(op),
149 P(self.lower_expr(el)),
150 P(self.lower_expr(er)),
152 ExprKind::Field(ref el, ident) => hir::ExprKind::Field(P(self.lower_expr(el)), ident),
153 ExprKind::Index(ref el, ref er) => {
154 hir::ExprKind::Index(P(self.lower_expr(el)), P(self.lower_expr(er)))
156 ExprKind::Range(Some(ref e1), Some(ref e2), RangeLimits::Closed) => {
157 self.lower_expr_range_closed(e.span, e1, e2)
159 ExprKind::Range(ref e1, ref e2, lims) => {
160 self.lower_expr_range(e.span, e1.as_deref(), e2.as_deref(), lims)
162 ExprKind::Path(ref qself, ref path) => {
163 let qpath = self.lower_qpath(
168 ImplTraitContext::disallowed(),
170 hir::ExprKind::Path(qpath)
172 ExprKind::Break(opt_label, ref opt_expr) => {
173 let destination = if self.is_in_loop_condition && opt_label.is_none() {
176 target_id: Err(hir::LoopIdError::UnlabeledCfInWhileCondition).into(),
179 self.lower_loop_destination(opt_label.map(|label| (e.id, label)))
181 hir::ExprKind::Break(
183 opt_expr.as_ref().map(|x| P(self.lower_expr(x))),
186 ExprKind::Continue(opt_label) => {
187 hir::ExprKind::Continue(if self.is_in_loop_condition && opt_label.is_none() {
190 target_id: Err(hir::LoopIdError::UnlabeledCfInWhileCondition).into(),
193 self.lower_loop_destination(opt_label.map(|label| (e.id, label)))
196 ExprKind::Ret(ref e) => hir::ExprKind::Ret(e.as_ref().map(|x| P(self.lower_expr(x)))),
197 ExprKind::InlineAsm(ref asm) => self.lower_expr_asm(asm),
198 ExprKind::Struct(ref path, ref fields, ref maybe_expr) => hir::ExprKind::Struct(
204 ImplTraitContext::disallowed(),
206 fields.iter().map(|x| self.lower_field(x)).collect(),
207 maybe_expr.as_ref().map(|x| P(self.lower_expr(x))),
209 ExprKind::Paren(ref ex) => {
210 let mut ex = self.lower_expr(ex);
211 // Include parens in span, but only if it is a super-span.
212 if e.span.contains(ex.span) {
215 // Merge attributes into the inner expression.
216 let mut attrs = e.attrs.clone();
217 attrs.extend::<Vec<_>>(ex.attrs.into());
222 ExprKind::Yield(ref opt_expr) => self.lower_expr_yield(e.span, opt_expr.as_deref()),
224 ExprKind::Err => hir::ExprKind::Err,
226 // Desugar `ExprForLoop`
227 // from: `[opt_ident]: for <pat> in <head> <body>`
228 ExprKind::ForLoop(ref pat, ref head, ref body, opt_label) => {
229 return self.lower_expr_for(e, pat, head, body, opt_label);
231 ExprKind::Try(ref sub_expr) => self.lower_expr_try(e.span, sub_expr),
232 ExprKind::Mac(_) => panic!("Shouldn't exist here"),
236 hir_id: self.lower_node_id(e.id),
239 attrs: e.attrs.clone(),
248 else_opt: Option<&Expr>,
250 // FIXME(#53667): handle lowering of && and parens.
252 // `_ => else_block` where `else_block` is `{}` if there's `None`:
253 let else_pat = self.pat_wild(span);
254 let (else_expr, contains_else_clause) = match else_opt {
255 None => (self.expr_block_empty(span), false),
256 Some(els) => (self.lower_expr(els), true),
258 let else_arm = self.arm(hir_vec![else_pat], P(else_expr));
260 // Handle then + scrutinee:
261 let then_blk = self.lower_block(then, false);
262 let then_expr = self.expr_block(then_blk, ThinVec::new());
263 let (then_pats, scrutinee, desugar) = match cond.node {
264 // `<pat> => <then>`:
265 ExprKind::Let(ref pats, ref scrutinee) => {
266 let scrutinee = self.lower_expr(scrutinee);
267 let pats = pats.iter().map(|pat| self.lower_pat(pat)).collect();
268 let desugar = hir::MatchSource::IfLetDesugar { contains_else_clause };
269 (pats, scrutinee, desugar)
274 let cond = self.lower_expr(cond);
275 let span_block = self.mark_span_with_reason(
276 DesugaringKind::CondTemporary,
280 // Wrap in a construct equivalent to `{ let _t = $cond; _t }`
281 // to preserve drop semantics since `if cond { ... }` does not
282 // let temporaries live outside of `cond`.
283 let cond = self.expr_drop_temps(span_block, P(cond), ThinVec::new());
285 let desugar = hir::MatchSource::IfDesugar { contains_else_clause };
286 let pats = hir_vec![self.pat_bool(span, true)];
287 (pats, cond, desugar)
290 let then_arm = self.arm(then_pats, P(then_expr));
292 hir::ExprKind::Match(P(scrutinee), vec![then_arm, else_arm].into(), desugar)
295 fn lower_expr_while_in_loop_scope(
300 opt_label: Option<Label>
302 // FIXME(#53667): handle lowering of && and parens.
304 // Note that the block AND the condition are evaluated in the loop scope.
305 // This is done to allow `break` from inside the condition of the loop.
309 let else_pat = self.pat_wild(span);
310 let else_expr = self.expr_break(span, ThinVec::new());
311 self.arm(hir_vec![else_pat], else_expr)
314 // Handle then + scrutinee:
315 let then_blk = self.lower_block(body, false);
316 let then_expr = self.expr_block(then_blk, ThinVec::new());
317 let (then_pats, scrutinee, desugar, source) = match cond.node {
318 ExprKind::Let(ref pats, ref scrutinee) => {
321 // [opt_ident]: loop {
322 // match <sub_expr> {
327 let scrutinee = self.with_loop_condition_scope(|t| t.lower_expr(scrutinee));
328 let pats = pats.iter().map(|pat| self.lower_pat(pat)).collect();
329 let desugar = hir::MatchSource::WhileLetDesugar;
330 (pats, scrutinee, desugar, hir::LoopSource::WhileLet)
333 // We desugar: `'label: while $cond $body` into:
337 // match DropTemps($cond) {
345 let cond = self.with_loop_condition_scope(|this| this.lower_expr(cond));
346 let span_block = self.mark_span_with_reason(
347 DesugaringKind::CondTemporary,
351 // Wrap in a construct equivalent to `{ let _t = $cond; _t }`
352 // to preserve drop semantics since `while cond { ... }` does not
353 // let temporaries live outside of `cond`.
354 let cond = self.expr_drop_temps(span_block, P(cond), ThinVec::new());
356 let desugar = hir::MatchSource::WhileDesugar;
358 let pats = hir_vec![self.pat_bool(span, true)];
359 (pats, cond, desugar, hir::LoopSource::While)
362 let then_arm = self.arm(then_pats, P(then_expr));
364 // `match <scrutinee> { ... }`
365 let match_expr = self.expr_match(
368 hir_vec![then_arm, else_arm],
372 // `[opt_ident]: loop { ... }`
374 P(self.block_expr(P(match_expr))),
375 self.lower_label(opt_label),
380 fn lower_expr_try_block(&mut self, body: &Block) -> hir::ExprKind {
381 self.with_catch_scope(body.id, |this| {
382 let unstable_span = this.mark_span_with_reason(
383 DesugaringKind::TryBlock,
385 this.allow_try_trait.clone(),
387 let mut block = this.lower_block(body, true).into_inner();
388 let tail = block.expr.take().map_or_else(
389 || this.expr_unit(this.sess.source_map().end_point(unstable_span)),
390 |x: P<hir::Expr>| x.into_inner(),
392 block.expr = Some(this.wrap_in_try_constructor(sym::from_ok, tail, unstable_span));
393 hir::ExprKind::Block(P(block), None)
397 fn wrap_in_try_constructor(
403 let path = &[sym::ops, sym::Try, method];
404 let from_err = P(self.expr_std_path(unstable_span, path, None, ThinVec::new()));
405 P(self.expr_call(e.span, from_err, hir_vec![e]))
408 /// Desugar `<expr>.await` into:
411 /// let mut pinned = <expr>;
413 /// match ::std::future::poll_with_tls_context(unsafe {
414 /// ::std::pin::Pin::new_unchecked(&mut pinned)
416 /// ::std::task::Poll::Ready(result) => break result,
417 /// ::std::task::Poll::Pending => {},
423 fn lower_expr_await(&mut self, await_span: Span, expr: &Expr) -> hir::ExprKind {
424 match self.generator_kind {
425 Some(hir::GeneratorKind::Async) => {},
426 Some(hir::GeneratorKind::Gen) |
428 let mut err = struct_span_err!(
432 "`await` is only allowed inside `async` functions and blocks"
434 err.span_label(await_span, "only allowed inside `async` functions and blocks");
435 if let Some(item_sp) = self.current_item {
436 err.span_label(item_sp, "this is not `async`");
441 let span = self.mark_span_with_reason(
442 DesugaringKind::Await,
446 let gen_future_span = self.mark_span_with_reason(
447 DesugaringKind::Await,
449 self.allow_gen_future.clone(),
452 // let mut pinned = <expr>;
453 let expr = P(self.lower_expr(expr));
454 let pinned_ident = Ident::with_empty_ctxt(sym::pinned);
455 let (pinned_pat, pinned_pat_hid) = self.pat_ident_binding_mode(
458 hir::BindingAnnotation::Mutable,
460 let pinned_let = self.stmt_let_pat(
465 hir::LocalSource::AwaitDesugar,
468 // ::std::future::poll_with_tls_context(unsafe {
469 // ::std::pin::Pin::new_unchecked(&mut pinned)
472 let pinned = P(self.expr_ident(span, pinned_ident, pinned_pat_hid));
473 let ref_mut_pinned = self.expr_mut_addr_of(span, pinned);
474 let pin_ty_id = self.next_id();
475 let new_unchecked_expr_kind = self.expr_call_std_assoc_fn(
478 &[sym::pin, sym::Pin],
480 hir_vec![ref_mut_pinned],
482 let new_unchecked = P(self.expr(span, new_unchecked_expr_kind, ThinVec::new()));
483 let unsafe_expr = self.expr_unsafe(new_unchecked);
484 P(self.expr_call_std_path(
486 &[sym::future, sym::poll_with_tls_context],
487 hir_vec![unsafe_expr],
491 // `::std::task::Poll::Ready(result) => break result`
492 let loop_node_id = self.sess.next_node_id();
493 let loop_hir_id = self.lower_node_id(loop_node_id);
495 let x_ident = Ident::with_empty_ctxt(sym::result);
496 let (x_pat, x_pat_hid) = self.pat_ident(span, x_ident);
497 let x_expr = P(self.expr_ident(span, x_ident, x_pat_hid));
498 let ready_pat = self.pat_std_enum(
500 &[sym::task, sym::Poll, sym::Ready],
503 let break_x = self.with_loop_scope(loop_node_id, |this| {
504 let expr_break = hir::ExprKind::Break(
505 this.lower_loop_destination(None),
508 P(this.expr(await_span, expr_break, ThinVec::new()))
510 self.arm(hir_vec![ready_pat], break_x)
513 // `::std::task::Poll::Pending => {}`
515 let pending_pat = self.pat_std_enum(
517 &[sym::task, sym::Poll, sym::Pending],
520 let empty_block = P(self.expr_block_empty(span));
521 self.arm(hir_vec![pending_pat], empty_block)
525 let match_expr = self.expr_match(
528 hir_vec![ready_arm, pending_arm],
529 hir::MatchSource::AwaitDesugar,
531 self.stmt_expr(span, match_expr)
535 let unit = self.expr_unit(span);
536 let yield_expr = self.expr(
538 hir::ExprKind::Yield(P(unit), hir::YieldSource::Await),
541 self.stmt_expr(span, yield_expr)
544 let loop_block = P(self.block_all(
546 hir_vec![match_stmt, yield_stmt],
550 let loop_expr = P(hir::Expr {
552 node: hir::ExprKind::Loop(
555 hir::LoopSource::Loop,
558 attrs: ThinVec::new(),
561 hir::ExprKind::Block(
562 P(self.block_all(span, hir_vec![pinned_let], Some(loop_expr))),
567 fn lower_expr_closure(
569 capture_clause: CaptureBy,
570 movability: Movability,
575 // Lower outside new scope to preserve `is_in_loop_condition`.
576 let fn_decl = self.lower_fn_decl(decl, None, false, None);
578 self.with_new_scopes(|this| {
579 this.current_item = Some(fn_decl_span);
580 let mut generator_kind = None;
581 let body_id = this.lower_fn_body(decl, |this| {
582 let e = this.lower_expr(body);
583 generator_kind = this.generator_kind;
586 let generator_option = this.generator_movability_for_fn(
592 hir::ExprKind::Closure(
593 this.lower_capture_clause(capture_clause),
602 fn lower_expr_async_closure(
604 capture_clause: CaptureBy,
610 let outer_decl = FnDecl {
611 inputs: decl.inputs.clone(),
612 output: FunctionRetTy::Default(fn_decl_span),
615 // We need to lower the declaration outside the new scope, because we
616 // have to conserve the state of being inside a loop condition for the
617 // closure argument types.
618 let fn_decl = self.lower_fn_decl(&outer_decl, None, false, None);
620 self.with_new_scopes(|this| {
621 // FIXME(cramertj): allow `async` non-`move` closures with arguments.
622 if capture_clause == CaptureBy::Ref && !decl.inputs.is_empty() {
627 "`async` non-`move` closures with arguments are not currently supported",
630 "consider using `let` statements to manually capture \
631 variables by reference before entering an `async move` closure"
636 // Transform `async |x: u8| -> X { ... }` into
637 // `|x: u8| future_from_generator(|| -> X { ... })`.
638 let body_id = this.lower_fn_body(&outer_decl, |this| {
639 let async_ret_ty = if let FunctionRetTy::Ty(ty) = &decl.output {
644 let async_body = this.make_async_expr(
645 capture_clause, closure_id, async_ret_ty, body.span,
647 this.with_new_scopes(|this| this.lower_expr(body))
650 this.expr(fn_decl_span, async_body, ThinVec::new())
652 hir::ExprKind::Closure(
653 this.lower_capture_clause(capture_clause),
662 /// Desugar `<start>..=<end>` into `std::ops::RangeInclusive::new(<start>, <end>)`.
663 fn lower_expr_range_closed(&mut self, span: Span, e1: &Expr, e2: &Expr) -> hir::ExprKind {
664 let id = self.next_id();
665 let e1 = self.lower_expr(e1);
666 let e2 = self.lower_expr(e2);
667 self.expr_call_std_assoc_fn(
670 &[sym::ops, sym::RangeInclusive],
683 use syntax::ast::RangeLimits::*;
685 let path = match (e1, e2, lims) {
686 (None, None, HalfOpen) => sym::RangeFull,
687 (Some(..), None, HalfOpen) => sym::RangeFrom,
688 (None, Some(..), HalfOpen) => sym::RangeTo,
689 (Some(..), Some(..), HalfOpen) => sym::Range,
690 (None, Some(..), Closed) => sym::RangeToInclusive,
691 (Some(..), Some(..), Closed) => unreachable!(),
692 (_, None, Closed) => self.diagnostic()
693 .span_fatal(span, "inclusive range with no end")
697 let fields = e1.iter()
698 .map(|e| ("start", e))
699 .chain(e2.iter().map(|e| ("end", e)))
701 let expr = P(self.lower_expr(&e));
702 let ident = Ident::new(Symbol::intern(s), e.span);
703 self.field(ident, expr, e.span)
705 .collect::<P<[hir::Field]>>();
707 let is_unit = fields.is_empty();
708 let struct_path = [sym::ops, path];
709 let struct_path = self.std_path(span, &struct_path, None, is_unit);
710 let struct_path = hir::QPath::Resolved(None, P(struct_path));
713 hir::ExprKind::Path(struct_path)
715 hir::ExprKind::Struct(P(struct_path), fields, None)
719 fn lower_expr_asm(&mut self, asm: &InlineAsm) -> hir::ExprKind {
720 let hir_asm = hir::InlineAsm {
721 inputs: asm.inputs.iter().map(|&(ref c, _)| c.clone()).collect(),
724 .map(|out| hir::InlineAsmOutput {
725 constraint: out.constraint.clone(),
727 is_indirect: out.is_indirect,
731 asm: asm.asm.clone(),
732 asm_str_style: asm.asm_str_style,
733 clobbers: asm.clobbers.clone().into(),
734 volatile: asm.volatile,
735 alignstack: asm.alignstack,
736 dialect: asm.dialect,
740 let outputs = asm.outputs
742 .map(|out| self.lower_expr(&out.expr))
745 let inputs = asm.inputs
747 .map(|&(_, ref input)| self.lower_expr(input))
750 hir::ExprKind::InlineAsm(P(hir_asm), outputs, inputs)
753 fn lower_expr_yield(&mut self, span: Span, opt_expr: Option<&Expr>) -> hir::ExprKind {
754 match self.generator_kind {
755 Some(hir::GeneratorKind::Gen) => {},
756 Some(hir::GeneratorKind::Async) => {
761 "`async` generators are not yet supported",
763 self.sess.abort_if_errors();
765 None => self.generator_kind = Some(hir::GeneratorKind::Gen),
770 .map(|x| self.lower_expr(x))
771 .unwrap_or_else(|| self.expr_unit(span));
773 hir::ExprKind::Yield(P(expr), hir::YieldSource::Yield)
776 /// Desugar `ExprForLoop` from: `[opt_ident]: for <pat> in <head> <body>` into:
779 /// let result = match ::std::iter::IntoIterator::into_iter(<head>) {
781 /// [opt_ident]: loop {
783 /// match ::std::iter::Iterator::next(&mut iter) {
784 /// ::std::option::Option::Some(val) => __next = val,
785 /// ::std::option::Option::None => break
787 /// let <pat> = __next;
788 /// StmtKind::Expr(<body>);
801 opt_label: Option<Label>,
804 let mut head = self.lower_expr(head);
805 let head_sp = head.span;
806 let desugared_span = self.mark_span_with_reason(
807 DesugaringKind::ForLoop,
811 head.span = desugared_span;
813 let iter = Ident::with_empty_ctxt(sym::iter);
815 let next_ident = Ident::with_empty_ctxt(sym::__next);
816 let (next_pat, next_pat_hid) = self.pat_ident_binding_mode(
819 hir::BindingAnnotation::Mutable,
822 // `::std::option::Option::Some(val) => __next = val`
824 let val_ident = Ident::with_empty_ctxt(sym::val);
825 let (val_pat, val_pat_hid) = self.pat_ident(pat.span, val_ident);
826 let val_expr = P(self.expr_ident(pat.span, val_ident, val_pat_hid));
827 let next_expr = P(self.expr_ident(pat.span, next_ident, next_pat_hid));
828 let assign = P(self.expr(
830 hir::ExprKind::Assign(next_expr, val_expr),
833 let some_pat = self.pat_some(pat.span, val_pat);
834 self.arm(hir_vec![some_pat], assign)
837 // `::std::option::Option::None => break`
840 self.with_loop_scope(e.id, |this| this.expr_break(e.span, ThinVec::new()));
841 let pat = self.pat_none(e.span);
842 self.arm(hir_vec![pat], break_expr)
846 let (iter_pat, iter_pat_nid) = self.pat_ident_binding_mode(
849 hir::BindingAnnotation::Mutable
852 // `match ::std::iter::Iterator::next(&mut iter) { ... }`
854 let iter = P(self.expr_ident(head_sp, iter, iter_pat_nid));
855 let ref_mut_iter = self.expr_mut_addr_of(head_sp, iter);
856 let next_path = &[sym::iter, sym::Iterator, sym::next];
857 let next_expr = P(self.expr_call_std_path(
860 hir_vec![ref_mut_iter],
862 let arms = hir_vec![pat_arm, break_arm];
864 self.expr_match(head_sp, next_expr, arms, hir::MatchSource::ForLoopDesugar)
866 let match_stmt = self.stmt_expr(head_sp, match_expr);
868 let next_expr = P(self.expr_ident(head_sp, next_ident, next_pat_hid));
871 let next_let = self.stmt_let_pat(
876 hir::LocalSource::ForLoopDesugar,
879 // `let <pat> = __next`
880 let pat = self.lower_pat(pat);
881 let pat_let = self.stmt_let_pat(
886 hir::LocalSource::ForLoopDesugar,
889 let body_block = self.with_loop_scope(e.id, |this| this.lower_block(body, false));
890 let body_expr = self.expr_block(body_block, ThinVec::new());
891 let body_stmt = self.stmt_expr(body.span, body_expr);
893 let loop_block = P(self.block_all(
895 hir_vec![next_let, match_stmt, pat_let, body_stmt],
899 // `[opt_ident]: loop { ... }`
900 let loop_expr = hir::ExprKind::Loop(
902 self.lower_label(opt_label),
903 hir::LoopSource::ForLoop,
905 let loop_expr = P(hir::Expr {
906 hir_id: self.lower_node_id(e.id),
909 attrs: ThinVec::new(),
912 // `mut iter => { ... }`
913 let iter_arm = self.arm(hir_vec![iter_pat], loop_expr);
915 // `match ::std::iter::IntoIterator::into_iter(<head>) { ... }`
916 let into_iter_expr = {
918 &[sym::iter, sym::IntoIterator, sym::into_iter];
919 P(self.expr_call_std_path(
926 let match_expr = P(self.expr_match(
930 hir::MatchSource::ForLoopDesugar,
933 // This is effectively `{ let _result = ...; _result }`.
934 // The construct was introduced in #21984 and is necessary to make sure that
935 // temporaries in the `head` expression are dropped and do not leak to the
936 // surrounding scope of the `match` since the `match` is not a terminating scope.
938 // Also, add the attributes to the outer returned expr node.
939 self.expr_drop_temps(head_sp, match_expr, e.attrs.clone())
942 /// Desugar `ExprKind::Try` from: `<expr>?` into:
944 /// match Try::into_result(<expr>) {
945 /// Ok(val) => #[allow(unreachable_code)] val,
946 /// Err(err) => #[allow(unreachable_code)]
947 /// // If there is an enclosing `try {...}`:
948 /// break 'catch_target Try::from_error(From::from(err)),
950 /// return Try::from_error(From::from(err)),
953 fn lower_expr_try(&mut self, span: Span, sub_expr: &Expr) -> hir::ExprKind {
954 let unstable_span = self.mark_span_with_reason(
955 DesugaringKind::QuestionMark,
957 self.allow_try_trait.clone(),
959 let try_span = self.sess.source_map().end_point(span);
960 let try_span = self.mark_span_with_reason(
961 DesugaringKind::QuestionMark,
963 self.allow_try_trait.clone(),
966 // `Try::into_result(<expr>)`
969 let sub_expr = self.lower_expr(sub_expr);
971 let path = &[sym::ops, sym::Try, sym::into_result];
972 P(self.expr_call_std_path(unstable_span, path, hir_vec![sub_expr]))
975 // `#[allow(unreachable_code)]`
977 // `allow(unreachable_code)`
979 let allow_ident = Ident::new(sym::allow, span);
980 let uc_ident = Ident::new(sym::unreachable_code, span);
981 let uc_nested = attr::mk_nested_word_item(uc_ident);
982 attr::mk_list_item(allow_ident, vec![uc_nested])
984 attr::mk_attr_outer(allow)
986 let attrs = vec![attr];
988 // `Ok(val) => #[allow(unreachable_code)] val,`
990 let val_ident = Ident::with_empty_ctxt(sym::val);
991 let (val_pat, val_pat_nid) = self.pat_ident(span, val_ident);
992 let val_expr = P(self.expr_ident_with_attrs(
996 ThinVec::from(attrs.clone()),
998 let ok_pat = self.pat_ok(span, val_pat);
1000 self.arm(hir_vec![ok_pat], val_expr)
1003 // `Err(err) => #[allow(unreachable_code)]
1004 // return Try::from_error(From::from(err)),`
1006 let err_ident = Ident::with_empty_ctxt(sym::err);
1007 let (err_local, err_local_nid) = self.pat_ident(try_span, err_ident);
1009 let from_path = &[sym::convert, sym::From, sym::from];
1010 let err_expr = self.expr_ident(try_span, err_ident, err_local_nid);
1011 self.expr_call_std_path(try_span, from_path, hir_vec![err_expr])
1014 self.wrap_in_try_constructor(sym::from_error, from_expr, unstable_span);
1015 let thin_attrs = ThinVec::from(attrs);
1016 let catch_scope = self.catch_scopes.last().map(|x| *x);
1017 let ret_expr = if let Some(catch_node) = catch_scope {
1018 let target_id = Ok(self.lower_node_id(catch_node));
1021 hir::ExprKind::Break(
1026 Some(from_err_expr),
1031 P(self.expr(try_span, hir::ExprKind::Ret(Some(from_err_expr)), thin_attrs))
1034 let err_pat = self.pat_err(try_span, err_local);
1035 self.arm(hir_vec![err_pat], ret_expr)
1038 hir::ExprKind::Match(
1040 hir_vec![err_arm, ok_arm],
1041 hir::MatchSource::TryDesugar,