1 use super::{LoweringContext, ParamMode, ParenthesizedGenericArgs, ImplTraitContext};
2 use crate::hir::{self, HirVec};
3 use crate::hir::def::Res;
4 use crate::hir::ptr::P;
6 use rustc_data_structures::thin_vec::ThinVec;
9 use syntax::ptr::P as AstP;
11 use syntax::source_map::{respan, DesugaringKind, Span, Spanned};
12 use syntax::symbol::{sym, Symbol};
14 impl LoweringContext<'_> {
15 fn lower_exprs(&mut self, exprs: &[AstP<Expr>]) -> HirVec<hir::Expr> {
16 exprs.iter().map(|x| self.lower_expr(x)).collect()
19 pub(super) fn lower_expr(&mut self, e: &Expr) -> hir::Expr {
20 let kind = match e.node {
21 ExprKind::Box(ref inner) => hir::ExprKind::Box(P(self.lower_expr(inner))),
22 ExprKind::Array(ref exprs) => hir::ExprKind::Array(self.lower_exprs(exprs)),
23 ExprKind::Repeat(ref expr, ref count) => {
24 let expr = P(self.lower_expr(expr));
25 let count = self.lower_anon_const(count);
26 hir::ExprKind::Repeat(expr, count)
28 ExprKind::Tup(ref elts) => hir::ExprKind::Tup(self.lower_exprs(elts)),
29 ExprKind::Call(ref f, ref args) => {
30 let f = P(self.lower_expr(f));
31 hir::ExprKind::Call(f, self.lower_exprs(args))
33 ExprKind::MethodCall(ref seg, ref args) => {
34 let hir_seg = P(self.lower_path_segment(
39 ParenthesizedGenericArgs::Err,
40 ImplTraitContext::disallowed(),
43 let args = self.lower_exprs(args);
44 hir::ExprKind::MethodCall(hir_seg, seg.ident.span, args)
46 ExprKind::Binary(binop, ref lhs, ref rhs) => {
47 let binop = self.lower_binop(binop);
48 let lhs = P(self.lower_expr(lhs));
49 let rhs = P(self.lower_expr(rhs));
50 hir::ExprKind::Binary(binop, lhs, rhs)
52 ExprKind::Unary(op, ref ohs) => {
53 let op = self.lower_unop(op);
54 let ohs = P(self.lower_expr(ohs));
55 hir::ExprKind::Unary(op, ohs)
57 ExprKind::Lit(ref l) => hir::ExprKind::Lit(respan(l.span, l.node.clone())),
58 ExprKind::Cast(ref expr, ref ty) => {
59 let expr = P(self.lower_expr(expr));
60 hir::ExprKind::Cast(expr, self.lower_ty(ty, ImplTraitContext::disallowed()))
62 ExprKind::Type(ref expr, ref ty) => {
63 let expr = P(self.lower_expr(expr));
64 hir::ExprKind::Type(expr, self.lower_ty(ty, ImplTraitContext::disallowed()))
66 ExprKind::AddrOf(m, ref ohs) => {
67 let m = self.lower_mutability(m);
68 let ohs = P(self.lower_expr(ohs));
69 hir::ExprKind::AddrOf(m, ohs)
71 ExprKind::Let(ref pats, ref scrutinee) => self.lower_expr_let(e.span, pats, scrutinee),
72 ExprKind::If(ref cond, ref then, ref else_opt) => {
73 self.lower_expr_if(e.span, cond, then, else_opt.as_deref())
75 ExprKind::While(ref cond, ref body, opt_label) => self.with_loop_scope(e.id, |this| {
76 this.lower_expr_while_in_loop_scope(e.span, cond, body, opt_label)
78 ExprKind::Loop(ref body, opt_label) => self.with_loop_scope(e.id, |this| {
80 this.lower_block(body, false),
81 this.lower_label(opt_label),
82 hir::LoopSource::Loop,
85 ExprKind::TryBlock(ref body) => self.lower_expr_try_block(body),
86 ExprKind::Match(ref expr, ref arms) => hir::ExprKind::Match(
87 P(self.lower_expr(expr)),
88 arms.iter().map(|x| self.lower_arm(x)).collect(),
89 hir::MatchSource::Normal,
91 ExprKind::Async(capture_clause, closure_node_id, ref block) => {
92 self.make_async_expr(capture_clause, closure_node_id, None, block.span, |this| {
93 this.with_new_scopes(|this| {
94 let block = this.lower_block(block, false);
95 this.expr_block(block, ThinVec::new())
99 ExprKind::Await(ref expr) => self.lower_expr_await(e.span, expr),
101 capture_clause, asyncness, movability, ref decl, ref body, fn_decl_span
102 ) => if let IsAsync::Async { closure_id, .. } = asyncness {
103 self.lower_expr_async_closure(capture_clause, closure_id, decl, body, fn_decl_span)
105 self.lower_expr_closure(capture_clause, movability, decl, body, fn_decl_span)
107 ExprKind::Block(ref blk, opt_label) => {
108 hir::ExprKind::Block(self.lower_block(blk,
109 opt_label.is_some()),
110 self.lower_label(opt_label))
112 ExprKind::Assign(ref el, ref er) => {
113 hir::ExprKind::Assign(P(self.lower_expr(el)), P(self.lower_expr(er)))
115 ExprKind::AssignOp(op, ref el, ref er) => hir::ExprKind::AssignOp(
116 self.lower_binop(op),
117 P(self.lower_expr(el)),
118 P(self.lower_expr(er)),
120 ExprKind::Field(ref el, ident) => hir::ExprKind::Field(P(self.lower_expr(el)), ident),
121 ExprKind::Index(ref el, ref er) => {
122 hir::ExprKind::Index(P(self.lower_expr(el)), P(self.lower_expr(er)))
124 ExprKind::Range(Some(ref e1), Some(ref e2), RangeLimits::Closed) => {
125 self.lower_expr_range_closed(e.span, e1, e2)
127 ExprKind::Range(ref e1, ref e2, lims) => {
128 self.lower_expr_range(e.span, e1.as_deref(), e2.as_deref(), lims)
130 ExprKind::Path(ref qself, ref path) => {
131 let qpath = self.lower_qpath(
136 ImplTraitContext::disallowed(),
138 hir::ExprKind::Path(qpath)
140 ExprKind::Break(opt_label, ref opt_expr) => {
141 let destination = if self.is_in_loop_condition && opt_label.is_none() {
144 target_id: Err(hir::LoopIdError::UnlabeledCfInWhileCondition).into(),
147 self.lower_loop_destination(opt_label.map(|label| (e.id, label)))
149 hir::ExprKind::Break(
151 opt_expr.as_ref().map(|x| P(self.lower_expr(x))),
154 ExprKind::Continue(opt_label) => {
155 hir::ExprKind::Continue(if self.is_in_loop_condition && opt_label.is_none() {
158 target_id: Err(hir::LoopIdError::UnlabeledCfInWhileCondition).into(),
161 self.lower_loop_destination(opt_label.map(|label| (e.id, label)))
164 ExprKind::Ret(ref e) => hir::ExprKind::Ret(e.as_ref().map(|x| P(self.lower_expr(x)))),
165 ExprKind::InlineAsm(ref asm) => self.lower_expr_asm(asm),
166 ExprKind::Struct(ref path, ref fields, ref maybe_expr) => hir::ExprKind::Struct(
172 ImplTraitContext::disallowed(),
174 fields.iter().map(|x| self.lower_field(x)).collect(),
175 maybe_expr.as_ref().map(|x| P(self.lower_expr(x))),
177 ExprKind::Paren(ref ex) => {
178 let mut ex = self.lower_expr(ex);
179 // Include parens in span, but only if it is a super-span.
180 if e.span.contains(ex.span) {
183 // Merge attributes into the inner expression.
184 let mut attrs = e.attrs.clone();
185 attrs.extend::<Vec<_>>(ex.attrs.into());
190 ExprKind::Yield(ref opt_expr) => self.lower_expr_yield(e.span, opt_expr.as_deref()),
192 ExprKind::Err => hir::ExprKind::Err,
194 // Desugar `ExprForLoop`
195 // from: `[opt_ident]: for <pat> in <head> <body>`
196 ExprKind::ForLoop(ref pat, ref head, ref body, opt_label) => {
197 return self.lower_expr_for(e, pat, head, body, opt_label);
199 ExprKind::Try(ref sub_expr) => self.lower_expr_try(e.span, sub_expr),
200 ExprKind::Mac(_) => panic!("Shouldn't exist here"),
204 hir_id: self.lower_node_id(e.id),
207 attrs: e.attrs.clone(),
211 /// Emit an error and lower `ast::ExprKind::Let(pats, scrutinee)` into:
213 /// match scrutinee { pats => true, _ => false }
221 // If we got here, the `let` expression is not allowed.
223 .struct_span_err(span, "`let` expressions are not supported here")
224 .note("only supported directly in conditions of `if`- and `while`-expressions")
225 .note("as well as when nested within `&&` and parenthesis in those conditions")
228 // For better recovery, we emit:
230 // match scrutinee { pats => true, _ => false }
232 // While this doesn't fully match the user's intent, it has key advantages:
233 // 1. We can avoid using `abort_if_errors`.
234 // 2. We can typeck both `pats` and `scrutinee`.
235 // 3. `pats` is allowed to be refutable.
236 // 4. The return type of the block is `bool` which seems like what the user wanted.
237 let scrutinee = self.lower_expr(scrutinee);
239 let pats = pats.iter().map(|pat| self.lower_pat(pat)).collect();
240 let expr = self.expr_bool(span, true);
241 self.arm(pats, P(expr))
244 let pats = hir_vec![self.pat_wild(span)];
245 let expr = self.expr_bool(span, false);
246 self.arm(pats, P(expr))
248 hir::ExprKind::Match(
250 vec![then_arm, else_arm].into(),
251 hir::MatchSource::Normal,
260 else_opt: Option<&Expr>,
262 // FIXME(#53667): handle lowering of && and parens.
264 // `_ => else_block` where `else_block` is `{}` if there's `None`:
265 let else_pat = self.pat_wild(span);
266 let (else_expr, contains_else_clause) = match else_opt {
267 None => (self.expr_block_empty(span), false),
268 Some(els) => (self.lower_expr(els), true),
270 let else_arm = self.arm(hir_vec![else_pat], P(else_expr));
272 // Handle then + scrutinee:
273 let then_blk = self.lower_block(then, false);
274 let then_expr = self.expr_block(then_blk, ThinVec::new());
275 let (then_pats, scrutinee, desugar) = match cond.node {
276 // `<pat> => <then>`:
277 ExprKind::Let(ref pats, ref scrutinee) => {
278 let scrutinee = self.lower_expr(scrutinee);
279 let pats = pats.iter().map(|pat| self.lower_pat(pat)).collect();
280 let desugar = hir::MatchSource::IfLetDesugar { contains_else_clause };
281 (pats, scrutinee, desugar)
286 let cond = self.lower_expr(cond);
287 let span_block = self.mark_span_with_reason(
288 DesugaringKind::CondTemporary,
292 // Wrap in a construct equivalent to `{ let _t = $cond; _t }`
293 // to preserve drop semantics since `if cond { ... }` does not
294 // let temporaries live outside of `cond`.
295 let cond = self.expr_drop_temps(span_block, P(cond), ThinVec::new());
297 let desugar = hir::MatchSource::IfDesugar { contains_else_clause };
298 let pats = hir_vec![self.pat_bool(span, true)];
299 (pats, cond, desugar)
302 let then_arm = self.arm(then_pats, P(then_expr));
304 hir::ExprKind::Match(P(scrutinee), vec![then_arm, else_arm].into(), desugar)
307 fn lower_expr_while_in_loop_scope(
312 opt_label: Option<Label>
314 // FIXME(#53667): handle lowering of && and parens.
316 // Note that the block AND the condition are evaluated in the loop scope.
317 // This is done to allow `break` from inside the condition of the loop.
321 let else_pat = self.pat_wild(span);
322 let else_expr = self.expr_break(span, ThinVec::new());
323 self.arm(hir_vec![else_pat], else_expr)
326 // Handle then + scrutinee:
327 let then_blk = self.lower_block(body, false);
328 let then_expr = self.expr_block(then_blk, ThinVec::new());
329 let (then_pats, scrutinee, desugar, source) = match cond.node {
330 ExprKind::Let(ref pats, ref scrutinee) => {
333 // [opt_ident]: loop {
334 // match <sub_expr> {
339 let scrutinee = self.with_loop_condition_scope(|t| t.lower_expr(scrutinee));
340 let pats = pats.iter().map(|pat| self.lower_pat(pat)).collect();
341 let desugar = hir::MatchSource::WhileLetDesugar;
342 (pats, scrutinee, desugar, hir::LoopSource::WhileLet)
345 // We desugar: `'label: while $cond $body` into:
349 // match DropTemps($cond) {
357 let cond = self.with_loop_condition_scope(|this| this.lower_expr(cond));
358 let span_block = self.mark_span_with_reason(
359 DesugaringKind::CondTemporary,
363 // Wrap in a construct equivalent to `{ let _t = $cond; _t }`
364 // to preserve drop semantics since `while cond { ... }` does not
365 // let temporaries live outside of `cond`.
366 let cond = self.expr_drop_temps(span_block, P(cond), ThinVec::new());
368 let desugar = hir::MatchSource::WhileDesugar;
370 let pats = hir_vec![self.pat_bool(span, true)];
371 (pats, cond, desugar, hir::LoopSource::While)
374 let then_arm = self.arm(then_pats, P(then_expr));
376 // `match <scrutinee> { ... }`
377 let match_expr = self.expr_match(
380 hir_vec![then_arm, else_arm],
384 // `[opt_ident]: loop { ... }`
386 P(self.block_expr(P(match_expr))),
387 self.lower_label(opt_label),
392 fn lower_expr_try_block(&mut self, body: &Block) -> hir::ExprKind {
393 self.with_catch_scope(body.id, |this| {
394 let unstable_span = this.mark_span_with_reason(
395 DesugaringKind::TryBlock,
397 this.allow_try_trait.clone(),
399 let mut block = this.lower_block(body, true).into_inner();
400 let tail = block.expr.take().map_or_else(
401 || this.expr_unit(this.sess.source_map().end_point(unstable_span)),
402 |x: P<hir::Expr>| x.into_inner(),
404 block.expr = Some(this.wrap_in_try_constructor(sym::from_ok, tail, unstable_span));
405 hir::ExprKind::Block(P(block), None)
409 fn wrap_in_try_constructor(
415 let path = &[sym::ops, sym::Try, method];
416 let from_err = P(self.expr_std_path(unstable_span, path, None, ThinVec::new()));
417 P(self.expr_call(e.span, from_err, hir_vec![e]))
420 pub(super) fn make_async_expr(
422 capture_clause: CaptureBy,
423 closure_node_id: NodeId,
424 ret_ty: Option<AstP<Ty>>,
426 body: impl FnOnce(&mut LoweringContext<'_>) -> hir::Expr,
428 let capture_clause = self.lower_capture_clause(capture_clause);
429 let output = match ret_ty {
430 Some(ty) => FunctionRetTy::Ty(ty),
431 None => FunctionRetTy::Default(span),
433 let ast_decl = FnDecl {
438 let decl = self.lower_fn_decl(&ast_decl, None, /* impl trait allowed */ false, None);
439 let body_id = self.lower_fn_body(&ast_decl, |this| {
440 this.generator_kind = Some(hir::GeneratorKind::Async);
444 // `static || -> <ret_ty> { body }`:
445 let generator_node = hir::ExprKind::Closure(
450 Some(hir::GeneratorMovability::Static)
452 let generator = hir::Expr {
453 hir_id: self.lower_node_id(closure_node_id),
454 node: generator_node,
456 attrs: ThinVec::new(),
459 // `future::from_generator`:
460 let unstable_span = self.mark_span_with_reason(
461 DesugaringKind::Async,
463 self.allow_gen_future.clone(),
465 let gen_future = self.expr_std_path(
467 &[sym::future, sym::from_generator],
472 // `future::from_generator(generator)`:
473 hir::ExprKind::Call(P(gen_future), hir_vec![generator])
476 /// Desugar `<expr>.await` into:
479 /// let mut pinned = <expr>;
481 /// match ::std::future::poll_with_tls_context(unsafe {
482 /// ::std::pin::Pin::new_unchecked(&mut pinned)
484 /// ::std::task::Poll::Ready(result) => break result,
485 /// ::std::task::Poll::Pending => {},
491 fn lower_expr_await(&mut self, await_span: Span, expr: &Expr) -> hir::ExprKind {
492 match self.generator_kind {
493 Some(hir::GeneratorKind::Async) => {},
494 Some(hir::GeneratorKind::Gen) |
496 let mut err = struct_span_err!(
500 "`await` is only allowed inside `async` functions and blocks"
502 err.span_label(await_span, "only allowed inside `async` functions and blocks");
503 if let Some(item_sp) = self.current_item {
504 err.span_label(item_sp, "this is not `async`");
509 let span = self.mark_span_with_reason(
510 DesugaringKind::Await,
514 let gen_future_span = self.mark_span_with_reason(
515 DesugaringKind::Await,
517 self.allow_gen_future.clone(),
520 // let mut pinned = <expr>;
521 let expr = P(self.lower_expr(expr));
522 let pinned_ident = Ident::with_empty_ctxt(sym::pinned);
523 let (pinned_pat, pinned_pat_hid) = self.pat_ident_binding_mode(
526 hir::BindingAnnotation::Mutable,
528 let pinned_let = self.stmt_let_pat(
533 hir::LocalSource::AwaitDesugar,
536 // ::std::future::poll_with_tls_context(unsafe {
537 // ::std::pin::Pin::new_unchecked(&mut pinned)
540 let pinned = P(self.expr_ident(span, pinned_ident, pinned_pat_hid));
541 let ref_mut_pinned = self.expr_mut_addr_of(span, pinned);
542 let pin_ty_id = self.next_id();
543 let new_unchecked_expr_kind = self.expr_call_std_assoc_fn(
546 &[sym::pin, sym::Pin],
548 hir_vec![ref_mut_pinned],
550 let new_unchecked = P(self.expr(span, new_unchecked_expr_kind, ThinVec::new()));
551 let unsafe_expr = self.expr_unsafe(new_unchecked);
552 P(self.expr_call_std_path(
554 &[sym::future, sym::poll_with_tls_context],
555 hir_vec![unsafe_expr],
559 // `::std::task::Poll::Ready(result) => break result`
560 let loop_node_id = self.sess.next_node_id();
561 let loop_hir_id = self.lower_node_id(loop_node_id);
563 let x_ident = Ident::with_empty_ctxt(sym::result);
564 let (x_pat, x_pat_hid) = self.pat_ident(span, x_ident);
565 let x_expr = P(self.expr_ident(span, x_ident, x_pat_hid));
566 let ready_pat = self.pat_std_enum(
568 &[sym::task, sym::Poll, sym::Ready],
571 let break_x = self.with_loop_scope(loop_node_id, |this| {
572 let expr_break = hir::ExprKind::Break(
573 this.lower_loop_destination(None),
576 P(this.expr(await_span, expr_break, ThinVec::new()))
578 self.arm(hir_vec![ready_pat], break_x)
581 // `::std::task::Poll::Pending => {}`
583 let pending_pat = self.pat_std_enum(
585 &[sym::task, sym::Poll, sym::Pending],
588 let empty_block = P(self.expr_block_empty(span));
589 self.arm(hir_vec![pending_pat], empty_block)
593 let match_expr = self.expr_match(
596 hir_vec![ready_arm, pending_arm],
597 hir::MatchSource::AwaitDesugar,
599 self.stmt_expr(span, match_expr)
603 let unit = self.expr_unit(span);
604 let yield_expr = self.expr(
606 hir::ExprKind::Yield(P(unit), hir::YieldSource::Await),
609 self.stmt_expr(span, yield_expr)
612 let loop_block = P(self.block_all(
614 hir_vec![match_stmt, yield_stmt],
618 let loop_expr = P(hir::Expr {
620 node: hir::ExprKind::Loop(
623 hir::LoopSource::Loop,
626 attrs: ThinVec::new(),
629 hir::ExprKind::Block(
630 P(self.block_all(span, hir_vec![pinned_let], Some(loop_expr))),
635 fn lower_expr_closure(
637 capture_clause: CaptureBy,
638 movability: Movability,
643 // Lower outside new scope to preserve `is_in_loop_condition`.
644 let fn_decl = self.lower_fn_decl(decl, None, false, None);
646 self.with_new_scopes(|this| {
647 this.current_item = Some(fn_decl_span);
648 let mut generator_kind = None;
649 let body_id = this.lower_fn_body(decl, |this| {
650 let e = this.lower_expr(body);
651 generator_kind = this.generator_kind;
654 let generator_option = this.generator_movability_for_fn(
660 hir::ExprKind::Closure(
661 this.lower_capture_clause(capture_clause),
670 fn lower_expr_async_closure(
672 capture_clause: CaptureBy,
678 let outer_decl = FnDecl {
679 inputs: decl.inputs.clone(),
680 output: FunctionRetTy::Default(fn_decl_span),
683 // We need to lower the declaration outside the new scope, because we
684 // have to conserve the state of being inside a loop condition for the
685 // closure argument types.
686 let fn_decl = self.lower_fn_decl(&outer_decl, None, false, None);
688 self.with_new_scopes(|this| {
689 // FIXME(cramertj): allow `async` non-`move` closures with arguments.
690 if capture_clause == CaptureBy::Ref && !decl.inputs.is_empty() {
695 "`async` non-`move` closures with arguments are not currently supported",
698 "consider using `let` statements to manually capture \
699 variables by reference before entering an `async move` closure"
704 // Transform `async |x: u8| -> X { ... }` into
705 // `|x: u8| future_from_generator(|| -> X { ... })`.
706 let body_id = this.lower_fn_body(&outer_decl, |this| {
707 let async_ret_ty = if let FunctionRetTy::Ty(ty) = &decl.output {
712 let async_body = this.make_async_expr(
713 capture_clause, closure_id, async_ret_ty, body.span,
715 this.with_new_scopes(|this| this.lower_expr(body))
718 this.expr(fn_decl_span, async_body, ThinVec::new())
720 hir::ExprKind::Closure(
721 this.lower_capture_clause(capture_clause),
730 /// Desugar `<start>..=<end>` into `std::ops::RangeInclusive::new(<start>, <end>)`.
731 fn lower_expr_range_closed(&mut self, span: Span, e1: &Expr, e2: &Expr) -> hir::ExprKind {
732 let id = self.next_id();
733 let e1 = self.lower_expr(e1);
734 let e2 = self.lower_expr(e2);
735 self.expr_call_std_assoc_fn(
738 &[sym::ops, sym::RangeInclusive],
751 use syntax::ast::RangeLimits::*;
753 let path = match (e1, e2, lims) {
754 (None, None, HalfOpen) => sym::RangeFull,
755 (Some(..), None, HalfOpen) => sym::RangeFrom,
756 (None, Some(..), HalfOpen) => sym::RangeTo,
757 (Some(..), Some(..), HalfOpen) => sym::Range,
758 (None, Some(..), Closed) => sym::RangeToInclusive,
759 (Some(..), Some(..), Closed) => unreachable!(),
760 (_, None, Closed) => self.diagnostic()
761 .span_fatal(span, "inclusive range with no end")
765 let fields = e1.iter()
766 .map(|e| ("start", e))
767 .chain(e2.iter().map(|e| ("end", e)))
769 let expr = P(self.lower_expr(&e));
770 let ident = Ident::new(Symbol::intern(s), e.span);
771 self.field(ident, expr, e.span)
773 .collect::<P<[hir::Field]>>();
775 let is_unit = fields.is_empty();
776 let struct_path = [sym::ops, path];
777 let struct_path = self.std_path(span, &struct_path, None, is_unit);
778 let struct_path = hir::QPath::Resolved(None, P(struct_path));
781 hir::ExprKind::Path(struct_path)
783 hir::ExprKind::Struct(P(struct_path), fields, None)
787 fn lower_expr_asm(&mut self, asm: &InlineAsm) -> hir::ExprKind {
788 let hir_asm = hir::InlineAsm {
789 inputs: asm.inputs.iter().map(|&(ref c, _)| c.clone()).collect(),
792 .map(|out| hir::InlineAsmOutput {
793 constraint: out.constraint.clone(),
795 is_indirect: out.is_indirect,
799 asm: asm.asm.clone(),
800 asm_str_style: asm.asm_str_style,
801 clobbers: asm.clobbers.clone().into(),
802 volatile: asm.volatile,
803 alignstack: asm.alignstack,
804 dialect: asm.dialect,
808 let outputs = asm.outputs
810 .map(|out| self.lower_expr(&out.expr))
813 let inputs = asm.inputs
815 .map(|&(_, ref input)| self.lower_expr(input))
818 hir::ExprKind::InlineAsm(P(hir_asm), outputs, inputs)
821 fn lower_field(&mut self, f: &Field) -> hir::Field {
823 hir_id: self.next_id(),
825 expr: P(self.lower_expr(&f.expr)),
827 is_shorthand: f.is_shorthand,
831 fn lower_expr_yield(&mut self, span: Span, opt_expr: Option<&Expr>) -> hir::ExprKind {
832 match self.generator_kind {
833 Some(hir::GeneratorKind::Gen) => {},
834 Some(hir::GeneratorKind::Async) => {
839 "`async` generators are not yet supported",
841 self.sess.abort_if_errors();
843 None => self.generator_kind = Some(hir::GeneratorKind::Gen),
848 .map(|x| self.lower_expr(x))
849 .unwrap_or_else(|| self.expr_unit(span));
851 hir::ExprKind::Yield(P(expr), hir::YieldSource::Yield)
854 /// Desugar `ExprForLoop` from: `[opt_ident]: for <pat> in <head> <body>` into:
857 /// let result = match ::std::iter::IntoIterator::into_iter(<head>) {
859 /// [opt_ident]: loop {
861 /// match ::std::iter::Iterator::next(&mut iter) {
862 /// ::std::option::Option::Some(val) => __next = val,
863 /// ::std::option::Option::None => break
865 /// let <pat> = __next;
866 /// StmtKind::Expr(<body>);
879 opt_label: Option<Label>,
882 let mut head = self.lower_expr(head);
883 let head_sp = head.span;
884 let desugared_span = self.mark_span_with_reason(
885 DesugaringKind::ForLoop,
889 head.span = desugared_span;
891 let iter = Ident::with_empty_ctxt(sym::iter);
893 let next_ident = Ident::with_empty_ctxt(sym::__next);
894 let (next_pat, next_pat_hid) = self.pat_ident_binding_mode(
897 hir::BindingAnnotation::Mutable,
900 // `::std::option::Option::Some(val) => __next = val`
902 let val_ident = Ident::with_empty_ctxt(sym::val);
903 let (val_pat, val_pat_hid) = self.pat_ident(pat.span, val_ident);
904 let val_expr = P(self.expr_ident(pat.span, val_ident, val_pat_hid));
905 let next_expr = P(self.expr_ident(pat.span, next_ident, next_pat_hid));
906 let assign = P(self.expr(
908 hir::ExprKind::Assign(next_expr, val_expr),
911 let some_pat = self.pat_some(pat.span, val_pat);
912 self.arm(hir_vec![some_pat], assign)
915 // `::std::option::Option::None => break`
918 self.with_loop_scope(e.id, |this| this.expr_break(e.span, ThinVec::new()));
919 let pat = self.pat_none(e.span);
920 self.arm(hir_vec![pat], break_expr)
924 let (iter_pat, iter_pat_nid) = self.pat_ident_binding_mode(
927 hir::BindingAnnotation::Mutable
930 // `match ::std::iter::Iterator::next(&mut iter) { ... }`
932 let iter = P(self.expr_ident(head_sp, iter, iter_pat_nid));
933 let ref_mut_iter = self.expr_mut_addr_of(head_sp, iter);
934 let next_path = &[sym::iter, sym::Iterator, sym::next];
935 let next_expr = P(self.expr_call_std_path(
938 hir_vec![ref_mut_iter],
940 let arms = hir_vec![pat_arm, break_arm];
942 self.expr_match(head_sp, next_expr, arms, hir::MatchSource::ForLoopDesugar)
944 let match_stmt = self.stmt_expr(head_sp, match_expr);
946 let next_expr = P(self.expr_ident(head_sp, next_ident, next_pat_hid));
949 let next_let = self.stmt_let_pat(
954 hir::LocalSource::ForLoopDesugar,
957 // `let <pat> = __next`
958 let pat = self.lower_pat(pat);
959 let pat_let = self.stmt_let_pat(
964 hir::LocalSource::ForLoopDesugar,
967 let body_block = self.with_loop_scope(e.id, |this| this.lower_block(body, false));
968 let body_expr = self.expr_block(body_block, ThinVec::new());
969 let body_stmt = self.stmt_expr(body.span, body_expr);
971 let loop_block = P(self.block_all(
973 hir_vec![next_let, match_stmt, pat_let, body_stmt],
977 // `[opt_ident]: loop { ... }`
978 let loop_expr = hir::ExprKind::Loop(
980 self.lower_label(opt_label),
981 hir::LoopSource::ForLoop,
983 let loop_expr = P(hir::Expr {
984 hir_id: self.lower_node_id(e.id),
987 attrs: ThinVec::new(),
990 // `mut iter => { ... }`
991 let iter_arm = self.arm(hir_vec![iter_pat], loop_expr);
993 // `match ::std::iter::IntoIterator::into_iter(<head>) { ... }`
994 let into_iter_expr = {
996 &[sym::iter, sym::IntoIterator, sym::into_iter];
997 P(self.expr_call_std_path(
1004 let match_expr = P(self.expr_match(
1008 hir::MatchSource::ForLoopDesugar,
1011 // This is effectively `{ let _result = ...; _result }`.
1012 // The construct was introduced in #21984 and is necessary to make sure that
1013 // temporaries in the `head` expression are dropped and do not leak to the
1014 // surrounding scope of the `match` since the `match` is not a terminating scope.
1016 // Also, add the attributes to the outer returned expr node.
1017 self.expr_drop_temps(head_sp, match_expr, e.attrs.clone())
1020 /// Desugar `ExprKind::Try` from: `<expr>?` into:
1022 /// match Try::into_result(<expr>) {
1023 /// Ok(val) => #[allow(unreachable_code)] val,
1024 /// Err(err) => #[allow(unreachable_code)]
1025 /// // If there is an enclosing `try {...}`:
1026 /// break 'catch_target Try::from_error(From::from(err)),
1028 /// return Try::from_error(From::from(err)),
1031 fn lower_expr_try(&mut self, span: Span, sub_expr: &Expr) -> hir::ExprKind {
1032 let unstable_span = self.mark_span_with_reason(
1033 DesugaringKind::QuestionMark,
1035 self.allow_try_trait.clone(),
1037 let try_span = self.sess.source_map().end_point(span);
1038 let try_span = self.mark_span_with_reason(
1039 DesugaringKind::QuestionMark,
1041 self.allow_try_trait.clone(),
1044 // `Try::into_result(<expr>)`
1047 let sub_expr = self.lower_expr(sub_expr);
1049 let path = &[sym::ops, sym::Try, sym::into_result];
1050 P(self.expr_call_std_path(unstable_span, path, hir_vec![sub_expr]))
1053 // `#[allow(unreachable_code)]`
1055 // `allow(unreachable_code)`
1057 let allow_ident = Ident::new(sym::allow, span);
1058 let uc_ident = Ident::new(sym::unreachable_code, span);
1059 let uc_nested = attr::mk_nested_word_item(uc_ident);
1060 attr::mk_list_item(allow_ident, vec![uc_nested])
1062 attr::mk_attr_outer(allow)
1064 let attrs = vec![attr];
1066 // `Ok(val) => #[allow(unreachable_code)] val,`
1068 let val_ident = Ident::with_empty_ctxt(sym::val);
1069 let (val_pat, val_pat_nid) = self.pat_ident(span, val_ident);
1070 let val_expr = P(self.expr_ident_with_attrs(
1074 ThinVec::from(attrs.clone()),
1076 let ok_pat = self.pat_ok(span, val_pat);
1078 self.arm(hir_vec![ok_pat], val_expr)
1081 // `Err(err) => #[allow(unreachable_code)]
1082 // return Try::from_error(From::from(err)),`
1084 let err_ident = Ident::with_empty_ctxt(sym::err);
1085 let (err_local, err_local_nid) = self.pat_ident(try_span, err_ident);
1087 let from_path = &[sym::convert, sym::From, sym::from];
1088 let err_expr = self.expr_ident(try_span, err_ident, err_local_nid);
1089 self.expr_call_std_path(try_span, from_path, hir_vec![err_expr])
1092 self.wrap_in_try_constructor(sym::from_error, from_expr, unstable_span);
1093 let thin_attrs = ThinVec::from(attrs);
1094 let catch_scope = self.catch_scopes.last().map(|x| *x);
1095 let ret_expr = if let Some(catch_node) = catch_scope {
1096 let target_id = Ok(self.lower_node_id(catch_node));
1099 hir::ExprKind::Break(
1104 Some(from_err_expr),
1109 P(self.expr(try_span, hir::ExprKind::Ret(Some(from_err_expr)), thin_attrs))
1112 let err_pat = self.pat_err(try_span, err_local);
1113 self.arm(hir_vec![err_pat], ret_expr)
1116 hir::ExprKind::Match(
1118 hir_vec![err_arm, ok_arm],
1119 hir::MatchSource::TryDesugar,
1123 /// Constructs a `true` or `false` literal expression.
1124 pub(super) fn expr_bool(&mut self, span: Span, val: bool) -> hir::Expr {
1125 let lit = Spanned { span, node: LitKind::Bool(val) };
1126 self.expr(span, hir::ExprKind::Lit(lit), ThinVec::new())
1129 /// Wrap the given `expr` in a terminating scope using `hir::ExprKind::DropTemps`.
1131 /// In terms of drop order, it has the same effect as wrapping `expr` in
1132 /// `{ let _t = $expr; _t }` but should provide better compile-time performance.
1134 /// The drop order can be important in e.g. `if expr { .. }`.
1139 attrs: ThinVec<Attribute>
1141 self.expr(span, hir::ExprKind::DropTemps(expr), attrs)
1148 arms: hir::HirVec<hir::Arm>,
1149 source: hir::MatchSource,
1151 self.expr(span, hir::ExprKind::Match(arg, arms, source), ThinVec::new())
1154 fn expr_break(&mut self, span: Span, attrs: ThinVec<Attribute>) -> P<hir::Expr> {
1155 let expr_break = hir::ExprKind::Break(self.lower_loop_destination(None), None);
1156 P(self.expr(span, expr_break, attrs))
1159 fn expr_mut_addr_of(&mut self, span: Span, e: P<hir::Expr>) -> hir::Expr {
1160 self.expr(span, hir::ExprKind::AddrOf(hir::MutMutable, e), ThinVec::new())
1163 fn expr_unit(&mut self, sp: Span) -> hir::Expr {
1164 self.expr_tuple(sp, hir_vec![])
1167 fn expr_tuple(&mut self, sp: Span, exprs: hir::HirVec<hir::Expr>) -> hir::Expr {
1168 self.expr(sp, hir::ExprKind::Tup(exprs), ThinVec::new())
1175 args: hir::HirVec<hir::Expr>,
1177 self.expr(span, hir::ExprKind::Call(e, args), ThinVec::new())
1180 // Note: associated functions must use `expr_call_std_path`.
1181 fn expr_call_std_path(
1184 path_components: &[Symbol],
1185 args: hir::HirVec<hir::Expr>,
1187 let path = P(self.expr_std_path(span, path_components, None, ThinVec::new()));
1188 self.expr_call(span, path, args)
1191 // Create an expression calling an associated function of an std type.
1193 // Associated functions cannot be resolved through the normal `std_path` function,
1194 // as they are resolved differently and so cannot use `expr_call_std_path`.
1196 // This function accepts the path component (`ty_path_components`) separately from
1197 // the name of the associated function (`assoc_fn_name`) in order to facilitate
1198 // separate resolution of the type and creation of a path referring to its associated
1200 fn expr_call_std_assoc_fn(
1202 ty_path_id: hir::HirId,
1204 ty_path_components: &[Symbol],
1205 assoc_fn_name: &str,
1206 args: hir::HirVec<hir::Expr>,
1207 ) -> hir::ExprKind {
1208 let ty_path = P(self.std_path(span, ty_path_components, None, false));
1209 let ty = P(self.ty_path(ty_path_id, span, hir::QPath::Resolved(None, ty_path)));
1210 let fn_seg = P(hir::PathSegment::from_ident(Ident::from_str(assoc_fn_name)));
1211 let fn_path = hir::QPath::TypeRelative(ty, fn_seg);
1212 let fn_expr = P(self.expr(span, hir::ExprKind::Path(fn_path), ThinVec::new()));
1213 hir::ExprKind::Call(fn_expr, args)
1219 components: &[Symbol],
1220 params: Option<P<hir::GenericArgs>>,
1221 attrs: ThinVec<Attribute>,
1223 let path = self.std_path(span, components, params, true);
1226 hir::ExprKind::Path(hir::QPath::Resolved(None, P(path))),
1231 pub(super) fn expr_ident(&mut self, sp: Span, ident: Ident, binding: hir::HirId) -> hir::Expr {
1232 self.expr_ident_with_attrs(sp, ident, binding, ThinVec::new())
1235 fn expr_ident_with_attrs(
1239 binding: hir::HirId,
1240 attrs: ThinVec<Attribute>,
1242 let expr_path = hir::ExprKind::Path(hir::QPath::Resolved(
1246 res: Res::Local(binding),
1247 segments: hir_vec![hir::PathSegment::from_ident(ident)],
1251 self.expr(span, expr_path, attrs)
1254 fn expr_unsafe(&mut self, expr: P<hir::Expr>) -> hir::Expr {
1255 let hir_id = self.next_id();
1256 let span = expr.span;
1259 hir::ExprKind::Block(P(hir::Block {
1263 rules: hir::UnsafeBlock(hir::CompilerGenerated),
1265 targeted_by_break: false,
1271 fn expr_block_empty(&mut self, span: Span) -> hir::Expr {
1272 let blk = self.block_all(span, hir_vec![], None);
1273 self.expr_block(P(blk), ThinVec::new())
1276 pub(super) fn expr_block(&mut self, b: P<hir::Block>, attrs: ThinVec<Attribute>) -> hir::Expr {
1277 self.expr(b.span, hir::ExprKind::Block(b, None), attrs)
1283 node: hir::ExprKind,
1284 attrs: ThinVec<Attribute>
1287 hir_id: self.next_id(),