1 use super::{AnonymousLifetimeMode, LoweringContext, ParamMode};
2 use super::{ImplTraitContext, ImplTraitPosition};
5 use rustc_ast::node_id::NodeMap;
7 use rustc_ast::visit::{self, AssocCtxt, FnCtxt, FnKind, Visitor};
9 use rustc_data_structures::fx::FxHashSet;
10 use rustc_errors::struct_span_err;
12 use rustc_hir::def::{DefKind, Res};
13 use rustc_hir::def_id::LocalDefId;
14 use rustc_span::source_map::{respan, DesugaringKind};
15 use rustc_span::symbol::{kw, sym, Ident};
17 use rustc_target::spec::abi;
19 use smallvec::{smallvec, SmallVec};
20 use std::collections::BTreeSet;
23 pub(super) struct ItemLowerer<'a, 'lowering, 'hir> {
24 pub(super) lctx: &'a mut LoweringContext<'lowering, 'hir>,
27 impl ItemLowerer<'_, '_, '_> {
28 fn with_trait_impl_ref(&mut self, impl_ref: &Option<TraitRef>, f: impl FnOnce(&mut Self)) {
29 let old = self.lctx.is_in_trait_impl;
30 self.lctx.is_in_trait_impl = impl_ref.is_some();
32 self.lctx.is_in_trait_impl = old;
36 impl<'a> Visitor<'a> for ItemLowerer<'a, '_, '_> {
37 fn visit_mod(&mut self, m: &'a Mod, _s: Span, _attrs: &[Attribute], n: NodeId) {
38 let hir_id = self.lctx.lower_node_id(n);
40 self.lctx.modules.insert(
43 items: BTreeSet::new(),
44 trait_items: BTreeSet::new(),
45 impl_items: BTreeSet::new(),
49 let old = self.lctx.current_module;
50 self.lctx.current_module = hir_id;
51 visit::walk_mod(self, m);
52 self.lctx.current_module = old;
55 fn visit_item(&mut self, item: &'a Item) {
56 let mut item_hir_id = None;
57 self.lctx.with_hir_id_owner(item.id, |lctx| {
58 lctx.without_in_scope_lifetime_defs(|lctx| {
59 if let Some(hir_item) = lctx.lower_item(item) {
60 item_hir_id = Some(hir_item.hir_id);
61 lctx.insert_item(hir_item);
66 if let Some(hir_id) = item_hir_id {
67 self.lctx.with_parent_item_lifetime_defs(hir_id, |this| {
68 let this = &mut ItemLowerer { lctx: this };
69 if let ItemKind::Impl { ref of_trait, .. } = item.kind {
70 this.with_trait_impl_ref(of_trait, |this| visit::walk_item(this, item));
72 visit::walk_item(this, item);
78 fn visit_fn(&mut self, fk: FnKind<'a>, sp: Span, _: NodeId) {
80 FnKind::Fn(FnCtxt::Foreign, _, sig, _, _) => {
81 self.visit_fn_header(&sig.header);
82 visit::walk_fn_decl(self, &sig.decl);
83 // Don't visit the foreign function body even if it has one, since lowering the
84 // body would have no meaning and will have already been caught as a parse error.
86 _ => visit::walk_fn(self, fk, sp),
90 fn visit_assoc_item(&mut self, item: &'a AssocItem, ctxt: AssocCtxt) {
91 self.lctx.with_hir_id_owner(item.id, |lctx| match ctxt {
93 let hir_item = lctx.lower_trait_item(item);
94 let id = hir::TraitItemId { hir_id: hir_item.hir_id };
95 lctx.trait_items.insert(id, hir_item);
96 lctx.modules.get_mut(&lctx.current_module).unwrap().trait_items.insert(id);
99 let hir_item = lctx.lower_impl_item(item);
100 let id = hir::ImplItemId { hir_id: hir_item.hir_id };
101 lctx.impl_items.insert(id, hir_item);
102 lctx.modules.get_mut(&lctx.current_module).unwrap().impl_items.insert(id);
106 visit::walk_assoc_item(self, item, ctxt);
110 impl<'hir> LoweringContext<'_, 'hir> {
111 // Same as the method above, but accepts `hir::GenericParam`s
112 // instead of `ast::GenericParam`s.
113 // This should only be used with generics that have already had their
114 // in-band lifetimes added. In practice, this means that this function is
115 // only used when lowering a child item of a trait or impl.
116 fn with_parent_item_lifetime_defs<T>(
118 parent_hir_id: hir::HirId,
119 f: impl FnOnce(&mut LoweringContext<'_, '_>) -> T,
121 let old_len = self.in_scope_lifetimes.len();
123 let parent_generics = match self.items.get(&parent_hir_id).unwrap().kind {
124 hir::ItemKind::Impl { ref generics, .. }
125 | hir::ItemKind::Trait(_, _, ref generics, ..) => &generics.params[..],
128 let lt_def_names = parent_generics.iter().filter_map(|param| match param.kind {
129 hir::GenericParamKind::Lifetime { .. } => Some(param.name.normalize_to_macros_2_0()),
132 self.in_scope_lifetimes.extend(lt_def_names);
136 self.in_scope_lifetimes.truncate(old_len);
140 // Clears (and restores) the `in_scope_lifetimes` field. Used when
141 // visiting nested items, which never inherit in-scope lifetimes
142 // from their surrounding environment.
143 fn without_in_scope_lifetime_defs<T>(
145 f: impl FnOnce(&mut LoweringContext<'_, '_>) -> T,
147 let old_in_scope_lifetimes = std::mem::replace(&mut self.in_scope_lifetimes, vec![]);
149 // this vector is only used when walking over impl headers,
150 // input types, and the like, and should not be non-empty in
152 assert!(self.lifetimes_to_define.is_empty());
156 assert!(self.in_scope_lifetimes.is_empty());
157 self.in_scope_lifetimes = old_in_scope_lifetimes;
162 pub(super) fn lower_mod(&mut self, m: &Mod) -> hir::Mod<'hir> {
167 .alloc_from_iter(m.items.iter().flat_map(|x| self.lower_item_id(x))),
171 pub(super) fn lower_item_id(&mut self, i: &Item) -> SmallVec<[hir::ItemId; 1]> {
172 let node_ids = match i.kind {
173 ItemKind::Use(ref use_tree) => {
174 let mut vec = smallvec![i.id];
175 self.lower_item_id_use_tree(use_tree, i.id, &mut vec);
178 ItemKind::MacroDef(..) => SmallVec::new(),
179 ItemKind::Fn(..) | ItemKind::Impl { of_trait: None, .. } => smallvec![i.id],
180 _ => smallvec![i.id],
185 .map(|node_id| hir::ItemId { id: self.allocate_hir_id_counter(node_id) })
189 fn lower_item_id_use_tree(
193 vec: &mut SmallVec<[NodeId; 1]>,
196 UseTreeKind::Nested(ref nested_vec) => {
197 for &(ref nested, id) in nested_vec {
199 self.lower_item_id_use_tree(nested, id, vec);
202 UseTreeKind::Glob => {}
203 UseTreeKind::Simple(_, id1, id2) => {
205 self.expect_full_res_from_use(base_id).skip(1).zip([id1, id2].iter())
213 pub fn lower_item(&mut self, i: &Item) -> Option<hir::Item<'hir>> {
214 let mut ident = i.ident;
215 let mut vis = self.lower_visibility(&i.vis, None);
216 let attrs = self.lower_attrs(&i.attrs);
218 if let ItemKind::MacroDef(MacroDef { ref body, macro_rules }) = i.kind {
219 if !macro_rules || self.sess.contains_name(&i.attrs, sym::macro_export) {
220 let hir_id = self.lower_node_id(i.id);
221 let body = P(self.lower_mac_args(body));
222 self.exported_macros.push(hir::MacroDef {
228 ast: MacroDef { body, macro_rules },
231 self.non_exported_macro_attrs.extend(attrs.iter().cloned());
236 let kind = self.lower_item_kind(i.span, i.id, &mut ident, attrs, &mut vis, &i.kind);
238 Some(hir::Item { hir_id: self.lower_node_id(i.id), ident, attrs, kind, vis, span: i.span })
246 attrs: &'hir [Attribute],
247 vis: &mut hir::Visibility<'hir>,
249 ) -> hir::ItemKind<'hir> {
251 ItemKind::ExternCrate(orig_name) => hir::ItemKind::ExternCrate(orig_name),
252 ItemKind::Use(ref use_tree) => {
253 // Start with an empty prefix.
254 let prefix = Path { segments: vec![], span: use_tree.span, tokens: None };
256 self.lower_use_tree(use_tree, &prefix, id, vis, ident, attrs)
258 ItemKind::Static(ref t, m, ref e) => {
259 let (ty, body_id) = self.lower_const_item(t, span, e.as_deref());
260 hir::ItemKind::Static(ty, m, body_id)
262 ItemKind::Const(_, ref t, ref e) => {
263 let (ty, body_id) = self.lower_const_item(t, span, e.as_deref());
264 hir::ItemKind::Const(ty, body_id)
268 FnSig { ref decl, header, span: fn_sig_span },
272 let fn_def_id = self.resolver.local_def_id(id);
273 self.with_new_scopes(|this| {
274 this.current_item = Some(ident.span);
276 // Note: we don't need to change the return type from `T` to
277 // `impl Future<Output = T>` here because lower_body
278 // only cares about the input argument patterns in the function
279 // declaration (decl), not the return types.
280 let asyncness = header.asyncness;
282 this.lower_maybe_async_body(span, &decl, asyncness, body.as_deref());
284 let (generics, decl) = this.add_in_band_defs(
287 AnonymousLifetimeMode::PassThrough,
289 let ret_id = asyncness.opt_return_id();
292 Some((fn_def_id.to_def_id(), idty)),
298 let sig = hir::FnSig {
300 header: this.lower_fn_header(header),
303 hir::ItemKind::Fn(sig, generics, body_id)
306 ItemKind::Mod(ref m) => hir::ItemKind::Mod(self.lower_mod(m)),
307 ItemKind::ForeignMod(ref nm) => hir::ItemKind::ForeignMod(self.lower_foreign_mod(nm)),
308 ItemKind::GlobalAsm(ref ga) => hir::ItemKind::GlobalAsm(self.lower_global_asm(ga)),
309 ItemKind::TyAlias(_, ref gen, _, Some(ref ty)) => {
312 // type Foo = impl Trait
317 // opaque type Foo1: Trait
318 let ty = self.lower_ty(
320 ImplTraitContext::OtherOpaqueTy {
321 capturable_lifetimes: &mut FxHashSet::default(),
322 origin: hir::OpaqueTyOrigin::Misc,
325 let generics = self.lower_generics(gen, ImplTraitContext::disallowed());
326 hir::ItemKind::TyAlias(ty, generics)
328 ItemKind::TyAlias(_, ref generics, _, None) => {
329 let ty = self.arena.alloc(self.ty(span, hir::TyKind::Err));
330 let generics = self.lower_generics(generics, ImplTraitContext::disallowed());
331 hir::ItemKind::TyAlias(ty, generics)
333 ItemKind::Enum(ref enum_definition, ref generics) => hir::ItemKind::Enum(
335 variants: self.arena.alloc_from_iter(
336 enum_definition.variants.iter().map(|x| self.lower_variant(x)),
339 self.lower_generics(generics, ImplTraitContext::disallowed()),
341 ItemKind::Struct(ref struct_def, ref generics) => {
342 let struct_def = self.lower_variant_data(struct_def);
343 hir::ItemKind::Struct(
345 self.lower_generics(generics, ImplTraitContext::disallowed()),
348 ItemKind::Union(ref vdata, ref generics) => {
349 let vdata = self.lower_variant_data(vdata);
350 hir::ItemKind::Union(
352 self.lower_generics(generics, ImplTraitContext::disallowed()),
360 generics: ref ast_generics,
361 of_trait: ref trait_ref,
363 items: ref impl_items,
365 let def_id = self.resolver.local_def_id(id);
367 // Lower the "impl header" first. This ordering is important
368 // for in-band lifetimes! Consider `'a` here:
370 // impl Foo<'a> for u32 {
371 // fn method(&'a self) { .. }
374 // Because we start by lowering the `Foo<'a> for u32`
375 // part, we will add `'a` to the list of generics on
376 // the impl. When we then encounter it later in the
377 // method, it will not be considered an in-band
378 // lifetime to be added, but rather a reference to a
380 let lowered_trait_impl_id = self.lower_node_id(id);
381 let (generics, (trait_ref, lowered_ty)) = self.add_in_band_defs(
384 AnonymousLifetimeMode::CreateParameter,
386 let trait_ref = trait_ref.as_ref().map(|trait_ref| {
387 this.lower_trait_ref(trait_ref, ImplTraitContext::disallowed())
390 if let Some(ref trait_ref) = trait_ref {
391 if let Res::Def(DefKind::Trait, def_id) = trait_ref.path.res {
395 .push(lowered_trait_impl_id);
399 let lowered_ty = this.lower_ty(ty, ImplTraitContext::disallowed());
401 (trait_ref, lowered_ty)
406 self.with_in_scope_lifetime_defs(&ast_generics.params, |this| {
407 this.arena.alloc_from_iter(
408 impl_items.iter().map(|item| this.lower_impl_item_ref(item)),
412 // `defaultness.has_value()` is never called for an `impl`, always `true` in order
413 // to not cause an assertion failure inside the `lower_defaultness` function.
415 let (defaultness, defaultness_span) = self.lower_defaultness(defaultness, has_val);
416 hir::ItemKind::Impl {
417 unsafety: self.lower_unsafety(unsafety),
421 constness: self.lower_constness(constness),
425 items: new_impl_items,
428 ItemKind::Trait(is_auto, unsafety, ref generics, ref bounds, ref items) => {
429 let bounds = self.lower_param_bounds(bounds, ImplTraitContext::disallowed());
432 .alloc_from_iter(items.iter().map(|item| self.lower_trait_item_ref(item)));
433 hir::ItemKind::Trait(
435 self.lower_unsafety(unsafety),
436 self.lower_generics(generics, ImplTraitContext::disallowed()),
441 ItemKind::TraitAlias(ref generics, ref bounds) => hir::ItemKind::TraitAlias(
442 self.lower_generics(generics, ImplTraitContext::disallowed()),
443 self.lower_param_bounds(bounds, ImplTraitContext::disallowed()),
445 ItemKind::MacroDef(..) | ItemKind::MacCall(..) => {
446 panic!("`TyMac` should have been expanded by now")
456 ) -> (&'hir hir::Ty<'hir>, hir::BodyId) {
457 let mut capturable_lifetimes;
458 let itctx = if self.sess.features_untracked().impl_trait_in_bindings {
459 capturable_lifetimes = FxHashSet::default();
460 ImplTraitContext::OtherOpaqueTy {
461 capturable_lifetimes: &mut capturable_lifetimes,
462 origin: hir::OpaqueTyOrigin::Misc,
465 ImplTraitContext::Disallowed(ImplTraitPosition::Binding)
467 let ty = self.lower_ty(ty, itctx);
468 (ty, self.lower_const_body(span, body))
476 vis: &mut hir::Visibility<'hir>,
478 attrs: &'hir [Attribute],
479 ) -> hir::ItemKind<'hir> {
480 debug!("lower_use_tree(tree={:?})", tree);
481 debug!("lower_use_tree: vis = {:?}", vis);
483 let path = &tree.prefix;
484 let segments = prefix.segments.iter().chain(path.segments.iter()).cloned().collect();
487 UseTreeKind::Simple(rename, id1, id2) => {
488 *ident = tree.ident();
490 // First, apply the prefix to the path.
491 let mut path = Path { segments, span: path.span, tokens: None };
493 // Correctly resolve `self` imports.
494 if path.segments.len() > 1
495 && path.segments.last().unwrap().ident.name == kw::SelfLower
497 let _ = path.segments.pop();
498 if rename.is_none() {
499 *ident = path.segments.last().unwrap().ident;
503 let mut resolutions = self.expect_full_res_from_use(id);
504 // We want to return *something* from this function, so hold onto the first item
506 let ret_res = self.lower_res(resolutions.next().unwrap_or(Res::Err));
508 // Here, we are looping over namespaces, if they exist for the definition
509 // being imported. We only handle type and value namespaces because we
510 // won't be dealing with macros in the rest of the compiler.
511 // Essentially a single `use` which imports two names is desugared into
513 for (res, &new_node_id) in resolutions.zip([id1, id2].iter()) {
515 let mut path = path.clone();
516 for seg in &mut path.segments {
517 seg.id = self.resolver.next_node_id();
519 let span = path.span;
521 self.with_hir_id_owner(new_node_id, |this| {
522 let new_id = this.lower_node_id(new_node_id);
523 let res = this.lower_res(res);
524 let path = this.lower_path_extra(res, &path, ParamMode::Explicit, None);
525 let kind = hir::ItemKind::Use(path, hir::UseKind::Single);
526 let vis = this.rebuild_vis(&vis);
528 this.insert_item(hir::Item {
539 let path = self.lower_path_extra(ret_res, &path, ParamMode::Explicit, None);
540 hir::ItemKind::Use(path, hir::UseKind::Single)
542 UseTreeKind::Glob => {
543 let path = self.lower_path(
545 &Path { segments, span: path.span, tokens: None },
548 hir::ItemKind::Use(path, hir::UseKind::Glob)
550 UseTreeKind::Nested(ref trees) => {
551 // Nested imports are desugared into simple imports.
552 // So, if we start with
555 // pub(x) use foo::{a, b};
558 // we will create three items:
561 // pub(x) use foo::a;
562 // pub(x) use foo::b;
563 // pub(x) use foo::{}; // <-- this is called the `ListStem`
566 // The first two are produced by recursively invoking
567 // `lower_use_tree` (and indeed there may be things
568 // like `use foo::{a::{b, c}}` and so forth). They
569 // wind up being directly added to
570 // `self.items`. However, the structure of this
571 // function also requires us to return one item, and
572 // for that we return the `{}` import (called the
575 let prefix = Path { segments, span: prefix.span.to(path.span), tokens: None };
577 // Add all the nested `PathListItem`s to the HIR.
578 for &(ref use_tree, id) in trees {
579 let new_hir_id = self.lower_node_id(id);
581 let mut prefix = prefix.clone();
583 // Give the segments new node-ids since they are being cloned.
584 for seg in &mut prefix.segments {
585 seg.id = self.resolver.next_node_id();
588 // Each `use` import is an item and thus are owners of the
589 // names in the path. Up to this point the nested import is
590 // the current owner, since we want each desugared import to
591 // own its own names, we have to adjust the owner before
592 // lowering the rest of the import.
593 self.with_hir_id_owner(id, |this| {
594 let mut vis = this.rebuild_vis(&vis);
595 let mut ident = *ident;
598 this.lower_use_tree(use_tree, &prefix, id, &mut vis, &mut ident, attrs);
600 this.insert_item(hir::Item {
611 // Subtle and a bit hacky: we lower the privacy level
612 // of the list stem to "private" most of the time, but
613 // not for "restricted" paths. The key thing is that
614 // we don't want it to stay as `pub` (with no caveats)
615 // because that affects rustdoc and also the lints
616 // about `pub` items. But we can't *always* make it
617 // private -- particularly not for restricted paths --
618 // because it contains node-ids that would then be
619 // unused, failing the check that HirIds are "densely
622 hir::VisibilityKind::Public
623 | hir::VisibilityKind::Crate(_)
624 | hir::VisibilityKind::Inherited => {
625 *vis = respan(prefix.span.shrink_to_lo(), hir::VisibilityKind::Inherited);
627 hir::VisibilityKind::Restricted { .. } => {
628 // Do nothing here, as described in the comment on the match.
632 let res = self.expect_full_res_from_use(id).next().unwrap_or(Res::Err);
633 let res = self.lower_res(res);
634 let path = self.lower_path_extra(res, &prefix, ParamMode::Explicit, None);
635 hir::ItemKind::Use(path, hir::UseKind::ListStem)
640 /// Paths like the visibility path in `pub(super) use foo::{bar, baz}` are repeated
641 /// many times in the HIR tree; for each occurrence, we need to assign distinct
642 /// `NodeId`s. (See, e.g., #56128.)
643 fn rebuild_use_path(&mut self, path: &hir::Path<'hir>) -> &'hir hir::Path<'hir> {
644 debug!("rebuild_use_path(path = {:?})", path);
646 self.arena.alloc_from_iter(path.segments.iter().map(|seg| hir::PathSegment {
648 hir_id: seg.hir_id.map(|_| self.next_id()),
651 infer_args: seg.infer_args,
653 self.arena.alloc(hir::Path { span: path.span, res: path.res, segments })
656 fn rebuild_vis(&mut self, vis: &hir::Visibility<'hir>) -> hir::Visibility<'hir> {
657 let vis_kind = match vis.node {
658 hir::VisibilityKind::Public => hir::VisibilityKind::Public,
659 hir::VisibilityKind::Crate(sugar) => hir::VisibilityKind::Crate(sugar),
660 hir::VisibilityKind::Inherited => hir::VisibilityKind::Inherited,
661 hir::VisibilityKind::Restricted { ref path, hir_id: _ } => {
662 hir::VisibilityKind::Restricted {
663 path: self.rebuild_use_path(path),
664 hir_id: self.next_id(),
668 respan(vis.span, vis_kind)
671 fn lower_foreign_item(&mut self, i: &ForeignItem) -> hir::ForeignItem<'hir> {
672 let def_id = self.resolver.local_def_id(i.id);
674 hir_id: self.lower_node_id(i.id),
676 attrs: self.lower_attrs(&i.attrs),
678 ForeignItemKind::Fn(_, ref sig, ref generics, _) => {
679 let fdec = &sig.decl;
680 let (generics, (fn_dec, fn_args)) = self.add_in_band_defs(
683 AnonymousLifetimeMode::PassThrough,
686 // Disallow `impl Trait` in foreign items.
687 this.lower_fn_decl(fdec, None, false, None),
688 this.lower_fn_params_to_names(fdec),
693 hir::ForeignItemKind::Fn(fn_dec, fn_args, generics)
695 ForeignItemKind::Static(ref t, m, _) => {
696 let ty = self.lower_ty(t, ImplTraitContext::disallowed());
697 hir::ForeignItemKind::Static(ty, m)
699 ForeignItemKind::TyAlias(..) => hir::ForeignItemKind::Type,
700 ForeignItemKind::MacCall(_) => panic!("macro shouldn't exist here"),
702 vis: self.lower_visibility(&i.vis, None),
707 fn lower_foreign_mod(&mut self, fm: &ForeignMod) -> hir::ForeignMod<'hir> {
709 abi: fm.abi.map_or(abi::Abi::C, |abi| self.lower_abi(abi)),
710 items: self.arena.alloc_from_iter(fm.items.iter().map(|x| self.lower_foreign_item(x))),
714 fn lower_global_asm(&mut self, ga: &GlobalAsm) -> &'hir hir::GlobalAsm {
715 self.arena.alloc(hir::GlobalAsm { asm: ga.asm })
718 fn lower_variant(&mut self, v: &Variant) -> hir::Variant<'hir> {
720 attrs: self.lower_attrs(&v.attrs),
721 data: self.lower_variant_data(&v.data),
722 disr_expr: v.disr_expr.as_ref().map(|e| self.lower_anon_const(e)),
723 id: self.lower_node_id(v.id),
729 fn lower_variant_data(&mut self, vdata: &VariantData) -> hir::VariantData<'hir> {
731 VariantData::Struct(ref fields, recovered) => hir::VariantData::Struct(
733 .alloc_from_iter(fields.iter().enumerate().map(|f| self.lower_struct_field(f))),
736 VariantData::Tuple(ref fields, id) => hir::VariantData::Tuple(
738 .alloc_from_iter(fields.iter().enumerate().map(|f| self.lower_struct_field(f))),
739 self.lower_node_id(id),
741 VariantData::Unit(id) => hir::VariantData::Unit(self.lower_node_id(id)),
745 fn lower_struct_field(&mut self, (index, f): (usize, &StructField)) -> hir::StructField<'hir> {
746 let ty = if let TyKind::Path(ref qself, ref path) = f.ty.kind {
747 let t = self.lower_path_ty(
751 ParamMode::ExplicitNamed, // no `'_` in declarations (Issue #61124)
752 ImplTraitContext::disallowed(),
756 self.lower_ty(&f.ty, ImplTraitContext::disallowed())
760 hir_id: self.lower_node_id(f.id),
761 ident: match f.ident {
762 Some(ident) => ident,
763 // FIXME(jseyfried): positional field hygiene.
764 None => Ident::new(sym::integer(index), f.span),
766 vis: self.lower_visibility(&f.vis, None),
768 attrs: self.lower_attrs(&f.attrs),
772 fn lower_trait_item(&mut self, i: &AssocItem) -> hir::TraitItem<'hir> {
773 let trait_item_def_id = self.resolver.local_def_id(i.id);
775 let (generics, kind) = match i.kind {
776 AssocItemKind::Const(_, ref ty, ref default) => {
777 let ty = self.lower_ty(ty, ImplTraitContext::disallowed());
778 let body = default.as_ref().map(|x| self.lower_const_body(i.span, Some(x)));
779 (hir::Generics::empty(), hir::TraitItemKind::Const(ty, body))
781 AssocItemKind::Fn(_, ref sig, ref generics, None) => {
782 let names = self.lower_fn_params_to_names(&sig.decl);
783 let (generics, sig) =
784 self.lower_method_sig(generics, sig, trait_item_def_id, false, None);
785 (generics, hir::TraitItemKind::Fn(sig, hir::TraitFn::Required(names)))
787 AssocItemKind::Fn(_, ref sig, ref generics, Some(ref body)) => {
788 let body_id = self.lower_fn_body_block(i.span, &sig.decl, Some(body));
789 let (generics, sig) =
790 self.lower_method_sig(generics, sig, trait_item_def_id, false, None);
791 (generics, hir::TraitItemKind::Fn(sig, hir::TraitFn::Provided(body_id)))
793 AssocItemKind::TyAlias(_, ref generics, ref bounds, ref default) => {
794 let ty = default.as_ref().map(|x| self.lower_ty(x, ImplTraitContext::disallowed()));
795 let generics = self.lower_generics(generics, ImplTraitContext::disallowed());
796 let kind = hir::TraitItemKind::Type(
797 self.lower_param_bounds(bounds, ImplTraitContext::disallowed()),
803 AssocItemKind::MacCall(..) => panic!("macro item shouldn't exist at this point"),
807 hir_id: self.lower_node_id(i.id),
809 attrs: self.lower_attrs(&i.attrs),
816 fn lower_trait_item_ref(&mut self, i: &AssocItem) -> hir::TraitItemRef {
817 let (kind, has_default) = match &i.kind {
818 AssocItemKind::Const(_, _, default) => (hir::AssocItemKind::Const, default.is_some()),
819 AssocItemKind::TyAlias(_, _, _, default) => {
820 (hir::AssocItemKind::Type, default.is_some())
822 AssocItemKind::Fn(_, sig, _, default) => {
823 (hir::AssocItemKind::Fn { has_self: sig.decl.has_self() }, default.is_some())
825 AssocItemKind::MacCall(..) => unimplemented!(),
827 let id = hir::TraitItemId { hir_id: self.lower_node_id(i.id) };
828 let defaultness = hir::Defaultness::Default { has_value: has_default };
829 hir::TraitItemRef { id, ident: i.ident, span: i.span, defaultness, kind }
832 /// Construct `ExprKind::Err` for the given `span`.
833 crate fn expr_err(&mut self, span: Span) -> hir::Expr<'hir> {
834 self.expr(span, hir::ExprKind::Err, AttrVec::new())
837 fn lower_impl_item(&mut self, i: &AssocItem) -> hir::ImplItem<'hir> {
838 let impl_item_def_id = self.resolver.local_def_id(i.id);
840 let (generics, kind) = match &i.kind {
841 AssocItemKind::Const(_, ty, expr) => {
842 let ty = self.lower_ty(ty, ImplTraitContext::disallowed());
844 hir::Generics::empty(),
845 hir::ImplItemKind::Const(ty, self.lower_const_body(i.span, expr.as_deref())),
848 AssocItemKind::Fn(_, sig, generics, body) => {
849 self.current_item = Some(i.span);
850 let asyncness = sig.header.asyncness;
852 self.lower_maybe_async_body(i.span, &sig.decl, asyncness, body.as_deref());
853 let impl_trait_return_allow = !self.is_in_trait_impl;
854 let (generics, sig) = self.lower_method_sig(
858 impl_trait_return_allow,
859 asyncness.opt_return_id(),
862 (generics, hir::ImplItemKind::Fn(sig, body_id))
864 AssocItemKind::TyAlias(_, generics, _, ty) => {
865 let generics = self.lower_generics(generics, ImplTraitContext::disallowed());
866 let kind = match ty {
868 let ty = self.arena.alloc(self.ty(i.span, hir::TyKind::Err));
869 hir::ImplItemKind::TyAlias(ty)
872 let ty = self.lower_ty(
874 ImplTraitContext::OtherOpaqueTy {
875 capturable_lifetimes: &mut FxHashSet::default(),
876 origin: hir::OpaqueTyOrigin::Misc,
879 hir::ImplItemKind::TyAlias(ty)
884 AssocItemKind::MacCall(..) => panic!("`TyMac` should have been expanded by now"),
887 // Since `default impl` is not yet implemented, this is always true in impls.
888 let has_value = true;
889 let (defaultness, _) = self.lower_defaultness(i.kind.defaultness(), has_value);
891 hir_id: self.lower_node_id(i.id),
893 attrs: self.lower_attrs(&i.attrs),
895 vis: self.lower_visibility(&i.vis, None),
902 fn lower_impl_item_ref(&mut self, i: &AssocItem) -> hir::ImplItemRef<'hir> {
903 // Since `default impl` is not yet implemented, this is always true in impls.
904 let has_value = true;
905 let (defaultness, _) = self.lower_defaultness(i.kind.defaultness(), has_value);
907 id: hir::ImplItemId { hir_id: self.lower_node_id(i.id) },
910 vis: self.lower_visibility(&i.vis, Some(i.id)),
912 kind: match &i.kind {
913 AssocItemKind::Const(..) => hir::AssocItemKind::Const,
914 AssocItemKind::TyAlias(..) => hir::AssocItemKind::Type,
915 AssocItemKind::Fn(_, sig, ..) => {
916 hir::AssocItemKind::Fn { has_self: sig.decl.has_self() }
918 AssocItemKind::MacCall(..) => unimplemented!(),
923 /// If an `explicit_owner` is given, this method allocates the `HirId` in
924 /// the address space of that item instead of the item currently being
925 /// lowered. This can happen during `lower_impl_item_ref()` where we need to
926 /// lower a `Visibility` value although we haven't lowered the owning
927 /// `ImplItem` in question yet.
931 explicit_owner: Option<NodeId>,
932 ) -> hir::Visibility<'hir> {
933 let node = match v.kind {
934 VisibilityKind::Public => hir::VisibilityKind::Public,
935 VisibilityKind::Crate(sugar) => hir::VisibilityKind::Crate(sugar),
936 VisibilityKind::Restricted { ref path, id } => {
937 debug!("lower_visibility: restricted path id = {:?}", id);
938 let lowered_id = if let Some(owner) = explicit_owner {
939 self.lower_node_id_with_owner(id, owner)
941 self.lower_node_id(id)
943 let res = self.expect_full_res(id);
944 let res = self.lower_res(res);
945 hir::VisibilityKind::Restricted {
946 path: self.lower_path_extra(res, path, ParamMode::Explicit, explicit_owner),
950 VisibilityKind::Inherited => hir::VisibilityKind::Inherited,
955 fn lower_defaultness(
959 ) -> (hir::Defaultness, Option<Span>) {
961 Defaultness::Default(sp) => (hir::Defaultness::Default { has_value }, Some(sp)),
962 Defaultness::Final => {
964 (hir::Defaultness::Final, None)
971 params: &'hir [hir::Param<'hir>],
972 value: hir::Expr<'hir>,
974 let body = hir::Body { generator_kind: self.generator_kind, params, value };
976 self.bodies.insert(id, body);
980 pub(super) fn lower_body(
982 f: impl FnOnce(&mut Self) -> (&'hir [hir::Param<'hir>], hir::Expr<'hir>),
984 let prev_gen_kind = self.generator_kind.take();
985 let task_context = self.task_context.take();
986 let (parameters, result) = f(self);
987 let body_id = self.record_body(parameters, result);
988 self.task_context = task_context;
989 self.generator_kind = prev_gen_kind;
993 fn lower_param(&mut self, param: &Param) -> hir::Param<'hir> {
995 attrs: self.lower_attrs(¶m.attrs),
996 hir_id: self.lower_node_id(param.id),
997 pat: self.lower_pat(¶m.pat),
998 ty_span: param.ty.span,
1003 pub(super) fn lower_fn_body(
1006 body: impl FnOnce(&mut Self) -> hir::Expr<'hir>,
1008 self.lower_body(|this| {
1010 this.arena.alloc_from_iter(decl.inputs.iter().map(|x| this.lower_param(x))),
1016 fn lower_fn_body_block(
1020 body: Option<&Block>,
1022 self.lower_fn_body(decl, |this| this.lower_block_expr_opt(span, body))
1025 fn lower_block_expr_opt(&mut self, span: Span, block: Option<&Block>) -> hir::Expr<'hir> {
1027 Some(block) => self.lower_block_expr(block),
1028 None => self.expr_err(span),
1032 pub(super) fn lower_const_body(&mut self, span: Span, expr: Option<&Expr>) -> hir::BodyId {
1033 self.lower_body(|this| {
1037 Some(expr) => this.lower_expr_mut(expr),
1038 None => this.expr_err(span),
1044 fn lower_maybe_async_body(
1049 body: Option<&Block>,
1051 let closure_id = match asyncness {
1052 Async::Yes { closure_id, .. } => closure_id,
1053 Async::No => return self.lower_fn_body_block(span, decl, body),
1056 self.lower_body(|this| {
1057 let mut parameters: Vec<hir::Param<'_>> = Vec::new();
1058 let mut statements: Vec<hir::Stmt<'_>> = Vec::new();
1060 // Async function parameters are lowered into the closure body so that they are
1061 // captured and so that the drop order matches the equivalent non-async functions.
1065 // async fn foo(<pattern>: <ty>, <pattern>: <ty>, <pattern>: <ty>) {
1071 // fn foo(__arg0: <ty>, __arg1: <ty>, __arg2: <ty>) {
1073 // let __arg2 = __arg2;
1074 // let <pattern> = __arg2;
1075 // let __arg1 = __arg1;
1076 // let <pattern> = __arg1;
1077 // let __arg0 = __arg0;
1078 // let <pattern> = __arg0;
1079 // drop-temps { <body> } // see comments later in fn for details
1083 // If `<pattern>` is a simple ident, then it is lowered to a single
1084 // `let <pattern> = <pattern>;` statement as an optimization.
1086 // Note that the body is embedded in `drop-temps`; an
1087 // equivalent desugaring would be `return { <body>
1088 // };`. The key point is that we wish to drop all the
1089 // let-bound variables and temporaries created in the body
1090 // (and its tail expression!) before we drop the
1091 // parameters (c.f. rust-lang/rust#64512).
1092 for (index, parameter) in decl.inputs.iter().enumerate() {
1093 let parameter = this.lower_param(parameter);
1094 let span = parameter.pat.span;
1096 // Check if this is a binding pattern, if so, we can optimize and avoid adding a
1097 // `let <pat> = __argN;` statement. In this case, we do not rename the parameter.
1098 let (ident, is_simple_parameter) = match parameter.pat.kind {
1099 hir::PatKind::Binding(
1100 hir::BindingAnnotation::Unannotated | hir::BindingAnnotation::Mutable,
1106 // Replace the ident for bindings that aren't simple.
1107 let name = format!("__arg{}", index);
1108 let ident = Ident::from_str(&name);
1114 let desugared_span = this.mark_span_with_reason(DesugaringKind::Async, span, None);
1116 // Construct a parameter representing `__argN: <ty>` to replace the parameter of the
1119 // If this is the simple case, this parameter will end up being the same as the
1120 // original parameter, but with a different pattern id.
1121 let mut stmt_attrs = AttrVec::new();
1122 stmt_attrs.extend(parameter.attrs.iter().cloned());
1123 let (new_parameter_pat, new_parameter_id) = this.pat_ident(desugared_span, ident);
1124 let new_parameter = hir::Param {
1125 attrs: parameter.attrs,
1126 hir_id: parameter.hir_id,
1127 pat: new_parameter_pat,
1128 ty_span: parameter.ty_span,
1129 span: parameter.span,
1132 if is_simple_parameter {
1133 // If this is the simple case, then we only insert one statement that is
1134 // `let <pat> = <pat>;`. We re-use the original argument's pattern so that
1135 // `HirId`s are densely assigned.
1136 let expr = this.expr_ident(desugared_span, ident, new_parameter_id);
1137 let stmt = this.stmt_let_pat(
1142 hir::LocalSource::AsyncFn,
1144 statements.push(stmt);
1146 // If this is not the simple case, then we construct two statements:
1149 // let __argN = __argN;
1150 // let <pat> = __argN;
1153 // The first statement moves the parameter into the closure and thus ensures
1154 // that the drop order is correct.
1156 // The second statement creates the bindings that the user wrote.
1158 // Construct the `let mut __argN = __argN;` statement. It must be a mut binding
1159 // because the user may have specified a `ref mut` binding in the next
1161 let (move_pat, move_id) = this.pat_ident_binding_mode(
1164 hir::BindingAnnotation::Mutable,
1166 let move_expr = this.expr_ident(desugared_span, ident, new_parameter_id);
1167 let move_stmt = this.stmt_let_pat(
1172 hir::LocalSource::AsyncFn,
1175 // Construct the `let <pat> = __argN;` statement. We re-use the original
1176 // parameter's pattern so that `HirId`s are densely assigned.
1177 let pattern_expr = this.expr_ident(desugared_span, ident, move_id);
1178 let pattern_stmt = this.stmt_let_pat(
1183 hir::LocalSource::AsyncFn,
1186 statements.push(move_stmt);
1187 statements.push(pattern_stmt);
1190 parameters.push(new_parameter);
1193 let body_span = body.map_or(span, |b| b.span);
1194 let async_expr = this.make_async_expr(
1199 hir::AsyncGeneratorKind::Fn,
1201 // Create a block from the user's function body:
1202 let user_body = this.lower_block_expr_opt(body_span, body);
1204 // Transform into `drop-temps { <user-body> }`, an expression:
1205 let desugared_span =
1206 this.mark_span_with_reason(DesugaringKind::Async, user_body.span, None);
1207 let user_body = this.expr_drop_temps(
1209 this.arena.alloc(user_body),
1213 // As noted above, create the final block like
1217 // let $param_pattern = $raw_param;
1219 // drop-temps { <user-body> }
1222 let body = this.block_all(
1224 this.arena.alloc_from_iter(statements),
1228 this.expr_block(body, AttrVec::new())
1233 this.arena.alloc_from_iter(parameters),
1234 this.expr(body_span, async_expr, AttrVec::new()),
1239 fn lower_method_sig(
1241 generics: &Generics,
1243 fn_def_id: LocalDefId,
1244 impl_trait_return_allow: bool,
1245 is_async: Option<NodeId>,
1246 ) -> (hir::Generics<'hir>, hir::FnSig<'hir>) {
1247 let header = self.lower_fn_header(sig.header);
1248 let (generics, decl) = self.add_in_band_defs(
1251 AnonymousLifetimeMode::PassThrough,
1255 Some((fn_def_id.to_def_id(), idty)),
1256 impl_trait_return_allow,
1261 (generics, hir::FnSig { header, decl, span: sig.span })
1264 fn lower_fn_header(&mut self, h: FnHeader) -> hir::FnHeader {
1266 unsafety: self.lower_unsafety(h.unsafety),
1267 asyncness: self.lower_asyncness(h.asyncness),
1268 constness: self.lower_constness(h.constness),
1269 abi: self.lower_extern(h.ext),
1273 pub(super) fn lower_abi(&mut self, abi: StrLit) -> abi::Abi {
1274 abi::lookup(&abi.symbol_unescaped.as_str()).unwrap_or_else(|| {
1275 self.error_on_invalid_abi(abi);
1280 pub(super) fn lower_extern(&mut self, ext: Extern) -> abi::Abi {
1282 Extern::None => abi::Abi::Rust,
1283 Extern::Implicit => abi::Abi::C,
1284 Extern::Explicit(abi) => self.lower_abi(abi),
1288 fn error_on_invalid_abi(&self, abi: StrLit) {
1289 struct_span_err!(self.sess, abi.span, E0703, "invalid ABI: found `{}`", abi.symbol)
1290 .span_label(abi.span, "invalid ABI")
1291 .help(&format!("valid ABIs: {}", abi::all_names().join(", ")))
1295 fn lower_asyncness(&mut self, a: Async) -> hir::IsAsync {
1297 Async::Yes { .. } => hir::IsAsync::Async,
1298 Async::No => hir::IsAsync::NotAsync,
1302 fn lower_constness(&mut self, c: Const) -> hir::Constness {
1304 Const::Yes(_) => hir::Constness::Const,
1305 Const::No => hir::Constness::NotConst,
1309 pub(super) fn lower_unsafety(&mut self, u: Unsafe) -> hir::Unsafety {
1311 Unsafe::Yes(_) => hir::Unsafety::Unsafe,
1312 Unsafe::No => hir::Unsafety::Normal,
1316 pub(super) fn lower_generics_mut(
1318 generics: &Generics,
1319 itctx: ImplTraitContext<'_, 'hir>,
1320 ) -> GenericsCtor<'hir> {
1321 // Collect `?Trait` bounds in where clause and move them to parameter definitions.
1322 // FIXME: this could probably be done with less rightward drift. It also looks like two
1323 // control paths where `report_error` is called are the only paths that advance to after the
1324 // match statement, so the error reporting could probably just be moved there.
1325 let mut add_bounds: NodeMap<Vec<_>> = Default::default();
1326 for pred in &generics.where_clause.predicates {
1327 if let WherePredicate::BoundPredicate(ref bound_pred) = *pred {
1328 'next_bound: for bound in &bound_pred.bounds {
1329 if let GenericBound::Trait(_, TraitBoundModifier::Maybe) = *bound {
1330 let report_error = |this: &mut Self| {
1331 this.diagnostic().span_err(
1332 bound_pred.bounded_ty.span,
1333 "`?Trait` bounds are only permitted at the \
1334 point where a type parameter is declared",
1337 // Check if the where clause type is a plain type parameter.
1338 match bound_pred.bounded_ty.kind {
1339 TyKind::Path(None, ref path)
1340 if path.segments.len() == 1
1341 && bound_pred.bound_generic_params.is_empty() =>
1343 if let Some(Res::Def(DefKind::TyParam, def_id)) = self
1345 .get_partial_res(bound_pred.bounded_ty.id)
1346 .map(|d| d.base_res())
1348 if let Some(def_id) = def_id.as_local() {
1349 for param in &generics.params {
1350 if let GenericParamKind::Type { .. } = param.kind {
1351 if def_id == self.resolver.local_def_id(param.id) {
1355 .push(bound.clone());
1356 continue 'next_bound;
1364 _ => report_error(self),
1372 params: self.lower_generic_params_mut(&generics.params, &add_bounds, itctx).collect(),
1373 where_clause: self.lower_where_clause(&generics.where_clause),
1374 span: generics.span,
1378 pub(super) fn lower_generics(
1380 generics: &Generics,
1381 itctx: ImplTraitContext<'_, 'hir>,
1382 ) -> hir::Generics<'hir> {
1383 let generics_ctor = self.lower_generics_mut(generics, itctx);
1384 generics_ctor.into_generics(self.arena)
1387 fn lower_where_clause(&mut self, wc: &WhereClause) -> hir::WhereClause<'hir> {
1388 self.with_anonymous_lifetime_mode(AnonymousLifetimeMode::ReportError, |this| {
1390 predicates: this.arena.alloc_from_iter(
1391 wc.predicates.iter().map(|predicate| this.lower_where_predicate(predicate)),
1398 fn lower_where_predicate(&mut self, pred: &WherePredicate) -> hir::WherePredicate<'hir> {
1400 WherePredicate::BoundPredicate(WhereBoundPredicate {
1401 ref bound_generic_params,
1406 self.with_in_scope_lifetime_defs(&bound_generic_params, |this| {
1407 hir::WherePredicate::BoundPredicate(hir::WhereBoundPredicate {
1408 bound_generic_params: this.lower_generic_params(
1409 bound_generic_params,
1410 &NodeMap::default(),
1411 ImplTraitContext::disallowed(),
1413 bounded_ty: this.lower_ty(bounded_ty, ImplTraitContext::disallowed()),
1414 bounds: this.arena.alloc_from_iter(bounds.iter().filter_map(|bound| {
1416 // Ignore `?Trait` bounds.
1417 // They were copied into type parameters already.
1418 GenericBound::Trait(_, TraitBoundModifier::Maybe) => None,
1420 this.lower_param_bound(bound, ImplTraitContext::disallowed()),
1428 WherePredicate::RegionPredicate(WhereRegionPredicate {
1432 }) => hir::WherePredicate::RegionPredicate(hir::WhereRegionPredicate {
1434 lifetime: self.lower_lifetime(lifetime),
1435 bounds: self.lower_param_bounds(bounds, ImplTraitContext::disallowed()),
1437 WherePredicate::EqPredicate(WhereEqPredicate { id, ref lhs_ty, ref rhs_ty, span }) => {
1438 hir::WherePredicate::EqPredicate(hir::WhereEqPredicate {
1439 hir_id: self.lower_node_id(id),
1440 lhs_ty: self.lower_ty(lhs_ty, ImplTraitContext::disallowed()),
1441 rhs_ty: self.lower_ty(rhs_ty, ImplTraitContext::disallowed()),
1449 /// Helper struct for delayed construction of Generics.
1450 pub(super) struct GenericsCtor<'hir> {
1451 pub(super) params: SmallVec<[hir::GenericParam<'hir>; 4]>,
1452 where_clause: hir::WhereClause<'hir>,
1456 impl<'hir> GenericsCtor<'hir> {
1457 pub(super) fn into_generics(self, arena: &'hir Arena<'hir>) -> hir::Generics<'hir> {
1459 params: arena.alloc_from_iter(self.params),
1460 where_clause: self.where_clause,