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 // FIXME(#53667): handle lowering of && and parens.
105 ExprKind::If(ref cond, ref then, ref else_opt) => {
106 // `_ => else_block` where `else_block` is `{}` if there's `None`:
107 let else_pat = self.pat_wild(e.span);
108 let (else_expr, contains_else_clause) = match else_opt {
109 None => (self.expr_block_empty(e.span), false),
110 Some(els) => (self.lower_expr(els), true),
112 let else_arm = self.arm(hir_vec![else_pat], P(else_expr));
114 // Handle then + scrutinee:
115 let then_blk = self.lower_block(then, false);
116 let then_expr = self.expr_block(then_blk, ThinVec::new());
117 let (then_pats, scrutinee, desugar) = match cond.node {
118 // `<pat> => <then>`:
119 ExprKind::Let(ref pats, ref scrutinee) => {
120 let scrutinee = self.lower_expr(scrutinee);
121 let pats = pats.iter().map(|pat| self.lower_pat(pat)).collect();
122 let desugar = hir::MatchSource::IfLetDesugar { contains_else_clause };
123 (pats, scrutinee, desugar)
128 let cond = self.lower_expr(cond);
129 let span_block = self.mark_span_with_reason(
130 DesugaringKind::CondTemporary, cond.span, None
132 // Wrap in a construct equivalent to `{ let _t = $cond; _t }`
133 // to preserve drop semantics since `if cond { ... }` does not
134 // let temporaries live outside of `cond`.
135 let cond = self.expr_drop_temps(span_block, P(cond), ThinVec::new());
137 let desugar = hir::MatchSource::IfDesugar { contains_else_clause };
138 let pats = hir_vec![self.pat_bool(e.span, true)];
139 (pats, cond, desugar)
142 let then_arm = self.arm(then_pats, P(then_expr));
144 hir::ExprKind::Match(P(scrutinee), vec![then_arm, else_arm].into(), desugar)
146 // FIXME(#53667): handle lowering of && and parens.
147 ExprKind::While(ref cond, ref body, opt_label) => self.with_loop_scope(e.id, |this| {
148 // Note that the block AND the condition are evaluated in the loop scope.
149 // This is done to allow `break` from inside the condition of the loop.
153 let else_pat = this.pat_wild(e.span);
154 let else_expr = this.expr_break(e.span, ThinVec::new());
155 this.arm(hir_vec![else_pat], else_expr)
158 // Handle then + scrutinee:
159 let then_blk = this.lower_block(body, false);
160 let then_expr = this.expr_block(then_blk, ThinVec::new());
161 let (then_pats, scrutinee, desugar, source) = match cond.node {
162 ExprKind::Let(ref pats, ref scrutinee) => {
165 // [opt_ident]: loop {
166 // match <sub_expr> {
171 let scrutinee = this.with_loop_condition_scope(|t| t.lower_expr(scrutinee));
172 let pats = pats.iter().map(|pat| this.lower_pat(pat)).collect();
173 let desugar = hir::MatchSource::WhileLetDesugar;
174 (pats, scrutinee, desugar, hir::LoopSource::WhileLet)
177 // We desugar: `'label: while $cond $body` into:
181 // match DropTemps($cond) {
189 let cond = this.with_loop_condition_scope(|this| this.lower_expr(cond));
190 let span_block = this.mark_span_with_reason(
191 DesugaringKind::CondTemporary, cond.span, None
193 // Wrap in a construct equivalent to `{ let _t = $cond; _t }`
194 // to preserve drop semantics since `while cond { ... }` does not
195 // let temporaries live outside of `cond`.
196 let cond = this.expr_drop_temps(span_block, P(cond), ThinVec::new());
198 let desugar = hir::MatchSource::WhileDesugar;
200 let pats = hir_vec![this.pat_bool(e.span, true)];
201 (pats, cond, desugar, hir::LoopSource::While)
204 let then_arm = this.arm(then_pats, P(then_expr));
206 // `match <scrutinee> { ... }`
207 let match_expr = this.expr_match(
210 hir_vec![then_arm, else_arm],
214 // `[opt_ident]: loop { ... }`
216 P(this.block_expr(P(match_expr))),
217 this.lower_label(opt_label),
221 ExprKind::Loop(ref body, opt_label) => self.with_loop_scope(e.id, |this| {
223 this.lower_block(body, false),
224 this.lower_label(opt_label),
225 hir::LoopSource::Loop,
228 ExprKind::TryBlock(ref body) => self.lower_expr_try_block(body),
229 ExprKind::Match(ref expr, ref arms) => hir::ExprKind::Match(
230 P(self.lower_expr(expr)),
231 arms.iter().map(|x| self.lower_arm(x)).collect(),
232 hir::MatchSource::Normal,
234 ExprKind::Async(capture_clause, closure_node_id, ref block) => {
235 self.make_async_expr(capture_clause, closure_node_id, None, block.span, |this| {
236 this.with_new_scopes(|this| {
237 let block = this.lower_block(block, false);
238 this.expr_block(block, ThinVec::new())
242 ExprKind::Await(ref expr) => self.lower_expr_await(e.span, expr),
244 capture_clause, asyncness, movability, ref decl, ref body, fn_decl_span
245 ) => if let IsAsync::Async { closure_id, .. } = asyncness {
246 self.lower_expr_async_closure(capture_clause, closure_id, decl, body, fn_decl_span)
248 self.lower_expr_closure(capture_clause, movability, decl, body, fn_decl_span)
250 ExprKind::Block(ref blk, opt_label) => {
251 hir::ExprKind::Block(self.lower_block(blk,
252 opt_label.is_some()),
253 self.lower_label(opt_label))
255 ExprKind::Assign(ref el, ref er) => {
256 hir::ExprKind::Assign(P(self.lower_expr(el)), P(self.lower_expr(er)))
258 ExprKind::AssignOp(op, ref el, ref er) => hir::ExprKind::AssignOp(
259 self.lower_binop(op),
260 P(self.lower_expr(el)),
261 P(self.lower_expr(er)),
263 ExprKind::Field(ref el, ident) => hir::ExprKind::Field(P(self.lower_expr(el)), ident),
264 ExprKind::Index(ref el, ref er) => {
265 hir::ExprKind::Index(P(self.lower_expr(el)), P(self.lower_expr(er)))
267 ExprKind::Range(Some(ref e1), Some(ref e2), RangeLimits::Closed) => {
268 self.lower_expr_range_closed(e.span, e1, e2)
270 ExprKind::Range(ref e1, ref e2, lims) => {
271 self.lower_expr_range(e.span, e1.as_deref(), e2.as_deref(), lims)
273 ExprKind::Path(ref qself, ref path) => {
274 let qpath = self.lower_qpath(
279 ImplTraitContext::disallowed(),
281 hir::ExprKind::Path(qpath)
283 ExprKind::Break(opt_label, ref opt_expr) => {
284 let destination = if self.is_in_loop_condition && opt_label.is_none() {
287 target_id: Err(hir::LoopIdError::UnlabeledCfInWhileCondition).into(),
290 self.lower_loop_destination(opt_label.map(|label| (e.id, label)))
292 hir::ExprKind::Break(
294 opt_expr.as_ref().map(|x| P(self.lower_expr(x))),
297 ExprKind::Continue(opt_label) => {
298 hir::ExprKind::Continue(if self.is_in_loop_condition && opt_label.is_none() {
301 target_id: Err(hir::LoopIdError::UnlabeledCfInWhileCondition).into(),
304 self.lower_loop_destination(opt_label.map(|label| (e.id, label)))
307 ExprKind::Ret(ref e) => hir::ExprKind::Ret(e.as_ref().map(|x| P(self.lower_expr(x)))),
308 ExprKind::InlineAsm(ref asm) => self.lower_expr_asm(asm),
309 ExprKind::Struct(ref path, ref fields, ref maybe_expr) => hir::ExprKind::Struct(
315 ImplTraitContext::disallowed(),
317 fields.iter().map(|x| self.lower_field(x)).collect(),
318 maybe_expr.as_ref().map(|x| P(self.lower_expr(x))),
320 ExprKind::Paren(ref ex) => {
321 let mut ex = self.lower_expr(ex);
322 // Include parens in span, but only if it is a super-span.
323 if e.span.contains(ex.span) {
326 // Merge attributes into the inner expression.
327 let mut attrs = e.attrs.clone();
328 attrs.extend::<Vec<_>>(ex.attrs.into());
333 ExprKind::Yield(ref opt_expr) => self.lower_expr_yield(e.span, opt_expr.as_deref()),
335 ExprKind::Err => hir::ExprKind::Err,
337 // Desugar `ExprForLoop`
338 // from: `[opt_ident]: for <pat> in <head> <body>`
339 ExprKind::ForLoop(ref pat, ref head, ref body, opt_label) => {
340 return self.lower_expr_for(e, pat, head, body, opt_label);
342 ExprKind::Try(ref sub_expr) => self.lower_expr_try(e.span, sub_expr),
343 ExprKind::Mac(_) => panic!("Shouldn't exist here"),
347 hir_id: self.lower_node_id(e.id),
350 attrs: e.attrs.clone(),
354 fn lower_expr_try_block(&mut self, body: &Block) -> hir::ExprKind {
355 self.with_catch_scope(body.id, |this| {
356 let unstable_span = this.mark_span_with_reason(
357 DesugaringKind::TryBlock,
359 this.allow_try_trait.clone(),
361 let mut block = this.lower_block(body, true).into_inner();
362 let tail = block.expr.take().map_or_else(
363 || this.expr_unit(this.sess.source_map().end_point(unstable_span)),
364 |x: P<hir::Expr>| x.into_inner(),
366 block.expr = Some(this.wrap_in_try_constructor(sym::from_ok, tail, unstable_span));
367 hir::ExprKind::Block(P(block), None)
371 /// Desugar `<expr>.await` into:
374 /// let mut pinned = <expr>;
376 /// match ::std::future::poll_with_tls_context(unsafe {
377 /// ::std::pin::Pin::new_unchecked(&mut pinned)
379 /// ::std::task::Poll::Ready(result) => break result,
380 /// ::std::task::Poll::Pending => {},
386 fn lower_expr_await(&mut self, await_span: Span, expr: &Expr) -> hir::ExprKind {
387 match self.generator_kind {
388 Some(hir::GeneratorKind::Async) => {},
389 Some(hir::GeneratorKind::Gen) |
391 let mut err = struct_span_err!(
395 "`await` is only allowed inside `async` functions and blocks"
397 err.span_label(await_span, "only allowed inside `async` functions and blocks");
398 if let Some(item_sp) = self.current_item {
399 err.span_label(item_sp, "this is not `async`");
404 let span = self.mark_span_with_reason(
405 DesugaringKind::Await,
409 let gen_future_span = self.mark_span_with_reason(
410 DesugaringKind::Await,
412 self.allow_gen_future.clone(),
415 // let mut pinned = <expr>;
416 let expr = P(self.lower_expr(expr));
417 let pinned_ident = Ident::with_empty_ctxt(sym::pinned);
418 let (pinned_pat, pinned_pat_hid) = self.pat_ident_binding_mode(
421 hir::BindingAnnotation::Mutable,
423 let pinned_let = self.stmt_let_pat(
428 hir::LocalSource::AwaitDesugar,
431 // ::std::future::poll_with_tls_context(unsafe {
432 // ::std::pin::Pin::new_unchecked(&mut pinned)
435 let pinned = P(self.expr_ident(span, pinned_ident, pinned_pat_hid));
436 let ref_mut_pinned = self.expr_mut_addr_of(span, pinned);
437 let pin_ty_id = self.next_id();
438 let new_unchecked_expr_kind = self.expr_call_std_assoc_fn(
441 &[sym::pin, sym::Pin],
443 hir_vec![ref_mut_pinned],
445 let new_unchecked = P(self.expr(span, new_unchecked_expr_kind, ThinVec::new()));
446 let unsafe_expr = self.expr_unsafe(new_unchecked);
447 P(self.expr_call_std_path(
449 &[sym::future, sym::poll_with_tls_context],
450 hir_vec![unsafe_expr],
454 // `::std::task::Poll::Ready(result) => break result`
455 let loop_node_id = self.sess.next_node_id();
456 let loop_hir_id = self.lower_node_id(loop_node_id);
458 let x_ident = Ident::with_empty_ctxt(sym::result);
459 let (x_pat, x_pat_hid) = self.pat_ident(span, x_ident);
460 let x_expr = P(self.expr_ident(span, x_ident, x_pat_hid));
461 let ready_pat = self.pat_std_enum(
463 &[sym::task, sym::Poll, sym::Ready],
466 let break_x = self.with_loop_scope(loop_node_id, |this| {
467 let expr_break = hir::ExprKind::Break(
468 this.lower_loop_destination(None),
471 P(this.expr(await_span, expr_break, ThinVec::new()))
473 self.arm(hir_vec![ready_pat], break_x)
476 // `::std::task::Poll::Pending => {}`
478 let pending_pat = self.pat_std_enum(
480 &[sym::task, sym::Poll, sym::Pending],
483 let empty_block = P(self.expr_block_empty(span));
484 self.arm(hir_vec![pending_pat], empty_block)
488 let match_expr = self.expr_match(
491 hir_vec![ready_arm, pending_arm],
492 hir::MatchSource::AwaitDesugar,
494 self.stmt_expr(span, match_expr)
498 let unit = self.expr_unit(span);
499 let yield_expr = self.expr(
501 hir::ExprKind::Yield(P(unit), hir::YieldSource::Await),
504 self.stmt_expr(span, yield_expr)
507 let loop_block = P(self.block_all(
509 hir_vec![match_stmt, yield_stmt],
513 let loop_expr = P(hir::Expr {
515 node: hir::ExprKind::Loop(
518 hir::LoopSource::Loop,
521 attrs: ThinVec::new(),
524 hir::ExprKind::Block(
525 P(self.block_all(span, hir_vec![pinned_let], Some(loop_expr))),
530 fn lower_expr_closure(
532 capture_clause: CaptureBy,
533 movability: Movability,
538 // Lower outside new scope to preserve `is_in_loop_condition`.
539 let fn_decl = self.lower_fn_decl(decl, None, false, None);
541 self.with_new_scopes(|this| {
542 this.current_item = Some(fn_decl_span);
543 let mut generator_kind = None;
544 let body_id = this.lower_fn_body(decl, |this| {
545 let e = this.lower_expr(body);
546 generator_kind = this.generator_kind;
549 let generator_option = this.generator_movability_for_fn(
555 hir::ExprKind::Closure(
556 this.lower_capture_clause(capture_clause),
565 fn lower_expr_async_closure(
567 capture_clause: CaptureBy,
573 let outer_decl = FnDecl {
574 inputs: decl.inputs.clone(),
575 output: FunctionRetTy::Default(fn_decl_span),
578 // We need to lower the declaration outside the new scope, because we
579 // have to conserve the state of being inside a loop condition for the
580 // closure argument types.
581 let fn_decl = self.lower_fn_decl(&outer_decl, None, false, None);
583 self.with_new_scopes(|this| {
584 // FIXME(cramertj): allow `async` non-`move` closures with arguments.
585 if capture_clause == CaptureBy::Ref && !decl.inputs.is_empty() {
590 "`async` non-`move` closures with arguments are not currently supported",
593 "consider using `let` statements to manually capture \
594 variables by reference before entering an `async move` closure"
599 // Transform `async |x: u8| -> X { ... }` into
600 // `|x: u8| future_from_generator(|| -> X { ... })`.
601 let body_id = this.lower_fn_body(&outer_decl, |this| {
602 let async_ret_ty = if let FunctionRetTy::Ty(ty) = &decl.output {
607 let async_body = this.make_async_expr(
608 capture_clause, closure_id, async_ret_ty, body.span,
610 this.with_new_scopes(|this| this.lower_expr(body))
613 this.expr(fn_decl_span, async_body, ThinVec::new())
615 hir::ExprKind::Closure(
616 this.lower_capture_clause(capture_clause),
625 /// Desugar `<start>..=<end>` into `std::ops::RangeInclusive::new(<start>, <end>)`.
626 fn lower_expr_range_closed(&mut self, span: Span, e1: &Expr, e2: &Expr) -> hir::ExprKind {
627 let id = self.next_id();
628 let e1 = self.lower_expr(e1);
629 let e2 = self.lower_expr(e2);
630 self.expr_call_std_assoc_fn(
633 &[sym::ops, sym::RangeInclusive],
646 use syntax::ast::RangeLimits::*;
648 let path = match (e1, e2, lims) {
649 (None, None, HalfOpen) => sym::RangeFull,
650 (Some(..), None, HalfOpen) => sym::RangeFrom,
651 (None, Some(..), HalfOpen) => sym::RangeTo,
652 (Some(..), Some(..), HalfOpen) => sym::Range,
653 (None, Some(..), Closed) => sym::RangeToInclusive,
654 (Some(..), Some(..), Closed) => unreachable!(),
655 (_, None, Closed) => self.diagnostic()
656 .span_fatal(span, "inclusive range with no end")
660 let fields = e1.iter()
661 .map(|e| ("start", e))
662 .chain(e2.iter().map(|e| ("end", e)))
664 let expr = P(self.lower_expr(&e));
665 let ident = Ident::new(Symbol::intern(s), e.span);
666 self.field(ident, expr, e.span)
668 .collect::<P<[hir::Field]>>();
670 let is_unit = fields.is_empty();
671 let struct_path = [sym::ops, path];
672 let struct_path = self.std_path(span, &struct_path, None, is_unit);
673 let struct_path = hir::QPath::Resolved(None, P(struct_path));
676 hir::ExprKind::Path(struct_path)
678 hir::ExprKind::Struct(P(struct_path), fields, None)
682 fn lower_expr_asm(&mut self, asm: &InlineAsm) -> hir::ExprKind {
683 let hir_asm = hir::InlineAsm {
684 inputs: asm.inputs.iter().map(|&(ref c, _)| c.clone()).collect(),
687 .map(|out| hir::InlineAsmOutput {
688 constraint: out.constraint.clone(),
690 is_indirect: out.is_indirect,
694 asm: asm.asm.clone(),
695 asm_str_style: asm.asm_str_style,
696 clobbers: asm.clobbers.clone().into(),
697 volatile: asm.volatile,
698 alignstack: asm.alignstack,
699 dialect: asm.dialect,
703 let outputs = asm.outputs
705 .map(|out| self.lower_expr(&out.expr))
708 let inputs = asm.inputs
710 .map(|&(_, ref input)| self.lower_expr(input))
713 hir::ExprKind::InlineAsm(P(hir_asm), outputs, inputs)
716 fn lower_expr_yield(&mut self, span: Span, opt_expr: Option<&Expr>) -> hir::ExprKind {
717 match self.generator_kind {
718 Some(hir::GeneratorKind::Gen) => {},
719 Some(hir::GeneratorKind::Async) => {
724 "`async` generators are not yet supported",
726 self.sess.abort_if_errors();
728 None => self.generator_kind = Some(hir::GeneratorKind::Gen),
733 .map(|x| self.lower_expr(x))
734 .unwrap_or_else(|| self.expr_unit(span));
736 hir::ExprKind::Yield(P(expr), hir::YieldSource::Yield)
739 /// Desugar `ExprForLoop` from: `[opt_ident]: for <pat> in <head> <body>` into:
742 /// let result = match ::std::iter::IntoIterator::into_iter(<head>) {
744 /// [opt_ident]: loop {
746 /// match ::std::iter::Iterator::next(&mut iter) {
747 /// ::std::option::Option::Some(val) => __next = val,
748 /// ::std::option::Option::None => break
750 /// let <pat> = __next;
751 /// StmtKind::Expr(<body>);
764 opt_label: Option<Label>,
767 let mut head = self.lower_expr(head);
768 let head_sp = head.span;
769 let desugared_span = self.mark_span_with_reason(
770 DesugaringKind::ForLoop,
774 head.span = desugared_span;
776 let iter = Ident::with_empty_ctxt(sym::iter);
778 let next_ident = Ident::with_empty_ctxt(sym::__next);
779 let (next_pat, next_pat_hid) = self.pat_ident_binding_mode(
782 hir::BindingAnnotation::Mutable,
785 // `::std::option::Option::Some(val) => __next = val`
787 let val_ident = Ident::with_empty_ctxt(sym::val);
788 let (val_pat, val_pat_hid) = self.pat_ident(pat.span, val_ident);
789 let val_expr = P(self.expr_ident(pat.span, val_ident, val_pat_hid));
790 let next_expr = P(self.expr_ident(pat.span, next_ident, next_pat_hid));
791 let assign = P(self.expr(
793 hir::ExprKind::Assign(next_expr, val_expr),
796 let some_pat = self.pat_some(pat.span, val_pat);
797 self.arm(hir_vec![some_pat], assign)
800 // `::std::option::Option::None => break`
803 self.with_loop_scope(e.id, |this| this.expr_break(e.span, ThinVec::new()));
804 let pat = self.pat_none(e.span);
805 self.arm(hir_vec![pat], break_expr)
809 let (iter_pat, iter_pat_nid) = self.pat_ident_binding_mode(
812 hir::BindingAnnotation::Mutable
815 // `match ::std::iter::Iterator::next(&mut iter) { ... }`
817 let iter = P(self.expr_ident(head_sp, iter, iter_pat_nid));
818 let ref_mut_iter = self.expr_mut_addr_of(head_sp, iter);
819 let next_path = &[sym::iter, sym::Iterator, sym::next];
820 let next_expr = P(self.expr_call_std_path(
823 hir_vec![ref_mut_iter],
825 let arms = hir_vec![pat_arm, break_arm];
827 self.expr_match(head_sp, next_expr, arms, hir::MatchSource::ForLoopDesugar)
829 let match_stmt = self.stmt_expr(head_sp, match_expr);
831 let next_expr = P(self.expr_ident(head_sp, next_ident, next_pat_hid));
834 let next_let = self.stmt_let_pat(
839 hir::LocalSource::ForLoopDesugar,
842 // `let <pat> = __next`
843 let pat = self.lower_pat(pat);
844 let pat_let = self.stmt_let_pat(
849 hir::LocalSource::ForLoopDesugar,
852 let body_block = self.with_loop_scope(e.id, |this| this.lower_block(body, false));
853 let body_expr = self.expr_block(body_block, ThinVec::new());
854 let body_stmt = self.stmt_expr(body.span, body_expr);
856 let loop_block = P(self.block_all(
858 hir_vec![next_let, match_stmt, pat_let, body_stmt],
862 // `[opt_ident]: loop { ... }`
863 let loop_expr = hir::ExprKind::Loop(
865 self.lower_label(opt_label),
866 hir::LoopSource::ForLoop,
868 let loop_expr = P(hir::Expr {
869 hir_id: self.lower_node_id(e.id),
872 attrs: ThinVec::new(),
875 // `mut iter => { ... }`
876 let iter_arm = self.arm(hir_vec![iter_pat], loop_expr);
878 // `match ::std::iter::IntoIterator::into_iter(<head>) { ... }`
879 let into_iter_expr = {
881 &[sym::iter, sym::IntoIterator, sym::into_iter];
882 P(self.expr_call_std_path(
889 let match_expr = P(self.expr_match(
893 hir::MatchSource::ForLoopDesugar,
896 // This is effectively `{ let _result = ...; _result }`.
897 // The construct was introduced in #21984 and is necessary to make sure that
898 // temporaries in the `head` expression are dropped and do not leak to the
899 // surrounding scope of the `match` since the `match` is not a terminating scope.
901 // Also, add the attributes to the outer returned expr node.
902 self.expr_drop_temps(head_sp, match_expr, e.attrs.clone())
905 /// Desugar `ExprKind::Try` from: `<expr>?` into:
907 /// match Try::into_result(<expr>) {
908 /// Ok(val) => #[allow(unreachable_code)] val,
909 /// Err(err) => #[allow(unreachable_code)]
910 /// // If there is an enclosing `try {...}`:
911 /// break 'catch_target Try::from_error(From::from(err)),
913 /// return Try::from_error(From::from(err)),
916 fn lower_expr_try(&mut self, span: Span, sub_expr: &Expr) -> hir::ExprKind {
917 let unstable_span = self.mark_span_with_reason(
918 DesugaringKind::QuestionMark,
920 self.allow_try_trait.clone(),
922 let try_span = self.sess.source_map().end_point(span);
923 let try_span = self.mark_span_with_reason(
924 DesugaringKind::QuestionMark,
926 self.allow_try_trait.clone(),
929 // `Try::into_result(<expr>)`
932 let sub_expr = self.lower_expr(sub_expr);
934 let path = &[sym::ops, sym::Try, sym::into_result];
935 P(self.expr_call_std_path(unstable_span, path, hir_vec![sub_expr]))
938 // `#[allow(unreachable_code)]`
940 // `allow(unreachable_code)`
942 let allow_ident = Ident::new(sym::allow, span);
943 let uc_ident = Ident::new(sym::unreachable_code, span);
944 let uc_nested = attr::mk_nested_word_item(uc_ident);
945 attr::mk_list_item(allow_ident, vec![uc_nested])
947 attr::mk_attr_outer(allow)
949 let attrs = vec![attr];
951 // `Ok(val) => #[allow(unreachable_code)] val,`
953 let val_ident = Ident::with_empty_ctxt(sym::val);
954 let (val_pat, val_pat_nid) = self.pat_ident(span, val_ident);
955 let val_expr = P(self.expr_ident_with_attrs(
959 ThinVec::from(attrs.clone()),
961 let ok_pat = self.pat_ok(span, val_pat);
963 self.arm(hir_vec![ok_pat], val_expr)
966 // `Err(err) => #[allow(unreachable_code)]
967 // return Try::from_error(From::from(err)),`
969 let err_ident = Ident::with_empty_ctxt(sym::err);
970 let (err_local, err_local_nid) = self.pat_ident(try_span, err_ident);
972 let from_path = &[sym::convert, sym::From, sym::from];
973 let err_expr = self.expr_ident(try_span, err_ident, err_local_nid);
974 self.expr_call_std_path(try_span, from_path, hir_vec![err_expr])
977 self.wrap_in_try_constructor(sym::from_error, from_expr, unstable_span);
978 let thin_attrs = ThinVec::from(attrs);
979 let catch_scope = self.catch_scopes.last().map(|x| *x);
980 let ret_expr = if let Some(catch_node) = catch_scope {
981 let target_id = Ok(self.lower_node_id(catch_node));
984 hir::ExprKind::Break(
994 P(self.expr(try_span, hir::ExprKind::Ret(Some(from_err_expr)), thin_attrs))
997 let err_pat = self.pat_err(try_span, err_local);
998 self.arm(hir_vec![err_pat], ret_expr)
1001 hir::ExprKind::Match(
1003 hir_vec![err_arm, ok_arm],
1004 hir::MatchSource::TryDesugar,