1 //! This module contains the "cleaned" pieces of the AST, and the functions
8 mod render_macro_matchers;
14 use rustc_attr as attr;
15 use rustc_data_structures::fx::{FxHashMap, FxHashSet, FxIndexMap, FxIndexSet, IndexEntry};
17 use rustc_hir::def::{CtorKind, DefKind, Res};
18 use rustc_hir::def_id::{DefId, DefIdMap, DefIdSet, LocalDefId, LOCAL_CRATE};
19 use rustc_hir::PredicateOrigin;
20 use rustc_hir_analysis::hir_ty_to_ty;
21 use rustc_infer::infer::region_constraints::{Constraint, RegionConstraintData};
22 use rustc_middle::middle::resolve_lifetime as rl;
23 use rustc_middle::ty::fold::TypeFolder;
24 use rustc_middle::ty::InternalSubsts;
25 use rustc_middle::ty::TypeVisitable;
26 use rustc_middle::ty::{self, AdtKind, DefIdTree, EarlyBinder, Ty, TyCtxt};
27 use rustc_middle::{bug, span_bug};
28 use rustc_span::hygiene::{AstPass, MacroKind};
29 use rustc_span::symbol::{kw, sym, Ident, Symbol};
30 use rustc_span::{self, ExpnKind};
32 use std::assert_matches::assert_matches;
33 use std::collections::hash_map::Entry;
34 use std::collections::BTreeMap;
35 use std::default::Default;
38 use thin_vec::ThinVec;
40 use crate::core::{self, DocContext, ImplTraitParam};
41 use crate::formats::item_type::ItemType;
42 use crate::visit_ast::Module as DocModule;
46 pub(crate) use self::types::*;
47 pub(crate) use self::utils::{get_auto_trait_and_blanket_impls, krate, register_res};
49 pub(crate) fn clean_doc_module<'tcx>(doc: &DocModule<'tcx>, cx: &mut DocContext<'tcx>) -> Item {
50 let mut items: Vec<Item> = vec![];
51 let mut inserted = FxHashSet::default();
52 items.extend(doc.foreigns.iter().map(|(item, renamed)| {
53 let item = clean_maybe_renamed_foreign_item(cx, item, *renamed);
54 if let Some(name) = item.name && !item.attrs.lists(sym::doc).has_word(sym::hidden) {
55 inserted.insert((item.type_(), name));
59 items.extend(doc.mods.iter().filter_map(|x| {
60 if !inserted.insert((ItemType::Module, x.name)) {
63 let item = clean_doc_module(x, cx);
64 if item.attrs.lists(sym::doc).has_word(sym::hidden) {
65 // Hidden modules are stripped at a later stage.
66 // If a hidden module has the same name as a visible one, we want
67 // to keep both of them around.
68 inserted.remove(&(ItemType::Module, x.name));
73 // Split up imports from all other items.
75 // This covers the case where somebody does an import which should pull in an item,
76 // but there's already an item with the same namespace and same name. Rust gives
77 // priority to the not-imported one, so we should, too.
78 items.extend(doc.items.iter().flat_map(|(item, renamed, import_id)| {
79 // First, lower everything other than imports.
80 if matches!(item.kind, hir::ItemKind::Use(_, hir::UseKind::Glob)) {
83 let v = clean_maybe_renamed_item(cx, item, *renamed, *import_id);
85 if let Some(name) = item.name && !item.attrs.lists(sym::doc).has_word(sym::hidden) {
86 inserted.insert((item.type_(), name));
91 items.extend(doc.items.iter().flat_map(|(item, renamed, _)| {
92 // Now we actually lower the imports, skipping everything else.
93 if let hir::ItemKind::Use(path, hir::UseKind::Glob) = item.kind {
94 let name = renamed.unwrap_or_else(|| cx.tcx.hir().name(item.hir_id()));
95 clean_use_statement(item, name, path, hir::UseKind::Glob, cx, &mut inserted)
97 // skip everything else
102 // determine if we should display the inner contents or
103 // the outer `mod` item for the source code.
105 let span = Span::new({
106 let where_outer = doc.where_outer(cx.tcx);
107 let sm = cx.sess().source_map();
108 let outer = sm.lookup_char_pos(where_outer.lo());
109 let inner = sm.lookup_char_pos(doc.where_inner.lo());
110 if outer.file.start_pos == inner.file.start_pos {
114 // mod foo; (and a separate SourceFile for the contents)
119 let kind = ModuleItem(Module { items, span });
120 Item::from_def_id_and_parts(doc.def_id.to_def_id(), Some(doc.name), kind, cx)
123 fn clean_generic_bound<'tcx>(
124 bound: &hir::GenericBound<'tcx>,
125 cx: &mut DocContext<'tcx>,
126 ) -> Option<GenericBound> {
128 hir::GenericBound::Outlives(lt) => GenericBound::Outlives(clean_lifetime(lt, cx)),
129 hir::GenericBound::LangItemTrait(lang_item, span, _, generic_args) => {
130 let def_id = cx.tcx.require_lang_item(lang_item, Some(span));
132 let trait_ref = ty::TraitRef::identity(cx.tcx, def_id);
134 let generic_args = clean_generic_args(generic_args, cx);
135 let GenericArgs::AngleBracketed { bindings, .. } = generic_args
137 bug!("clean: parenthesized `GenericBound::LangItemTrait`");
140 let trait_ = clean_trait_ref_with_bindings(cx, trait_ref, bindings);
141 GenericBound::TraitBound(
142 PolyTrait { trait_, generic_params: vec![] },
143 hir::TraitBoundModifier::None,
146 hir::GenericBound::Trait(ref t, modifier) => {
147 // `T: ~const Destruct` is hidden because `T: Destruct` is a no-op.
148 if modifier == hir::TraitBoundModifier::MaybeConst
149 && cx.tcx.lang_items().destruct_trait() == Some(t.trait_ref.trait_def_id().unwrap())
154 GenericBound::TraitBound(clean_poly_trait_ref(t, cx), modifier)
159 pub(crate) fn clean_trait_ref_with_bindings<'tcx>(
160 cx: &mut DocContext<'tcx>,
161 trait_ref: ty::PolyTraitRef<'tcx>,
162 bindings: ThinVec<TypeBinding>,
164 let kind = cx.tcx.def_kind(trait_ref.def_id()).into();
165 if !matches!(kind, ItemType::Trait | ItemType::TraitAlias) {
166 span_bug!(cx.tcx.def_span(trait_ref.def_id()), "`TraitRef` had unexpected kind {:?}", kind);
168 inline::record_extern_fqn(cx, trait_ref.def_id(), kind);
170 external_path(cx, trait_ref.def_id(), true, bindings, trait_ref.map_bound(|tr| tr.substs));
177 fn clean_poly_trait_ref_with_bindings<'tcx>(
178 cx: &mut DocContext<'tcx>,
179 poly_trait_ref: ty::PolyTraitRef<'tcx>,
180 bindings: ThinVec<TypeBinding>,
182 // collect any late bound regions
183 let late_bound_regions: Vec<_> = cx
185 .collect_referenced_late_bound_regions(&poly_trait_ref)
187 .filter_map(|br| match br {
188 ty::BrNamed(_, name) if br.is_named() => Some(GenericParamDef::lifetime(name)),
193 let trait_ = clean_trait_ref_with_bindings(cx, poly_trait_ref, bindings);
194 GenericBound::TraitBound(
195 PolyTrait { trait_, generic_params: late_bound_regions },
196 hir::TraitBoundModifier::None,
200 fn clean_lifetime<'tcx>(lifetime: &hir::Lifetime, cx: &mut DocContext<'tcx>) -> Lifetime {
201 let def = cx.tcx.named_region(lifetime.hir_id);
203 rl::Region::EarlyBound(node_id)
204 | rl::Region::LateBound(_, _, node_id)
205 | rl::Region::Free(_, node_id),
208 if let Some(lt) = cx.substs.get(&node_id).and_then(|p| p.as_lt()).cloned() {
212 Lifetime(lifetime.ident.name)
215 pub(crate) fn clean_const<'tcx>(constant: &hir::ConstArg, cx: &mut DocContext<'tcx>) -> Constant {
216 let def_id = cx.tcx.hir().body_owner_def_id(constant.value.body).to_def_id();
218 type_: clean_middle_ty(ty::Binder::dummy(cx.tcx.type_of(def_id)), cx, Some(def_id)),
219 kind: ConstantKind::Anonymous { body: constant.value.body },
223 pub(crate) fn clean_middle_const<'tcx>(
224 constant: ty::Binder<'tcx, ty::Const<'tcx>>,
225 cx: &mut DocContext<'tcx>,
227 // FIXME: instead of storing the stringified expression, store `self` directly instead.
229 type_: clean_middle_ty(constant.map_bound(|c| c.ty()), cx, None),
230 kind: ConstantKind::TyConst { expr: constant.skip_binder().to_string().into() },
234 pub(crate) fn clean_middle_region<'tcx>(region: ty::Region<'tcx>) -> Option<Lifetime> {
236 ty::ReStatic => Some(Lifetime::statik()),
237 _ if !region.has_name() => None,
238 ty::ReLateBound(_, ty::BoundRegion { kind: ty::BrNamed(_, name), .. }) => {
241 ty::ReEarlyBound(ref data) => Some(Lifetime(data.name)),
245 | ty::RePlaceholder(..)
247 debug!("cannot clean region {:?}", region);
253 fn clean_where_predicate<'tcx>(
254 predicate: &hir::WherePredicate<'tcx>,
255 cx: &mut DocContext<'tcx>,
256 ) -> Option<WherePredicate> {
257 if !predicate.in_where_clause() {
260 Some(match *predicate {
261 hir::WherePredicate::BoundPredicate(ref wbp) => {
262 let bound_params = wbp
263 .bound_generic_params
266 // Higher-ranked params must be lifetimes.
267 // Higher-ranked lifetimes can't have bounds.
270 hir::GenericParam { kind: hir::GenericParamKind::Lifetime { .. }, .. }
272 Lifetime(param.name.ident().name)
275 WherePredicate::BoundPredicate {
276 ty: clean_ty(wbp.bounded_ty, cx),
277 bounds: wbp.bounds.iter().filter_map(|x| clean_generic_bound(x, cx)).collect(),
282 hir::WherePredicate::RegionPredicate(ref wrp) => WherePredicate::RegionPredicate {
283 lifetime: clean_lifetime(wrp.lifetime, cx),
284 bounds: wrp.bounds.iter().filter_map(|x| clean_generic_bound(x, cx)).collect(),
287 hir::WherePredicate::EqPredicate(ref wrp) => WherePredicate::EqPredicate {
288 lhs: Box::new(clean_ty(wrp.lhs_ty, cx)),
289 rhs: Box::new(clean_ty(wrp.rhs_ty, cx).into()),
290 bound_params: Vec::new(),
295 pub(crate) fn clean_predicate<'tcx>(
296 predicate: ty::Predicate<'tcx>,
297 cx: &mut DocContext<'tcx>,
298 ) -> Option<WherePredicate> {
299 let bound_predicate = predicate.kind();
300 match bound_predicate.skip_binder() {
301 ty::PredicateKind::Clause(ty::Clause::Trait(pred)) => {
302 clean_poly_trait_predicate(bound_predicate.rebind(pred), cx)
304 ty::PredicateKind::Clause(ty::Clause::RegionOutlives(pred)) => {
305 clean_region_outlives_predicate(pred)
307 ty::PredicateKind::Clause(ty::Clause::TypeOutlives(pred)) => {
308 clean_type_outlives_predicate(pred, cx)
310 ty::PredicateKind::Clause(ty::Clause::Projection(pred)) => {
311 Some(clean_projection_predicate(bound_predicate.rebind(pred), cx))
313 ty::PredicateKind::ConstEvaluatable(..) => None,
314 ty::PredicateKind::WellFormed(..) => None,
316 ty::PredicateKind::Subtype(..)
317 | ty::PredicateKind::Coerce(..)
318 | ty::PredicateKind::ObjectSafe(..)
319 | ty::PredicateKind::ClosureKind(..)
320 | ty::PredicateKind::ConstEquate(..)
321 | ty::PredicateKind::Ambiguous
322 | ty::PredicateKind::TypeWellFormedFromEnv(..) => panic!("not user writable"),
326 fn clean_poly_trait_predicate<'tcx>(
327 pred: ty::PolyTraitPredicate<'tcx>,
328 cx: &mut DocContext<'tcx>,
329 ) -> Option<WherePredicate> {
330 // `T: ~const Destruct` is hidden because `T: Destruct` is a no-op.
331 if pred.skip_binder().constness == ty::BoundConstness::ConstIfConst
332 && Some(pred.skip_binder().def_id()) == cx.tcx.lang_items().destruct_trait()
337 let poly_trait_ref = pred.map_bound(|pred| pred.trait_ref);
338 Some(WherePredicate::BoundPredicate {
339 ty: clean_middle_ty(poly_trait_ref.self_ty(), cx, None),
340 bounds: vec![clean_poly_trait_ref_with_bindings(cx, poly_trait_ref, ThinVec::new())],
341 bound_params: Vec::new(),
345 fn clean_region_outlives_predicate<'tcx>(
346 pred: ty::OutlivesPredicate<ty::Region<'tcx>, ty::Region<'tcx>>,
347 ) -> Option<WherePredicate> {
348 let ty::OutlivesPredicate(a, b) = pred;
350 Some(WherePredicate::RegionPredicate {
351 lifetime: clean_middle_region(a).expect("failed to clean lifetime"),
352 bounds: vec![GenericBound::Outlives(
353 clean_middle_region(b).expect("failed to clean bounds"),
358 fn clean_type_outlives_predicate<'tcx>(
359 pred: ty::OutlivesPredicate<Ty<'tcx>, ty::Region<'tcx>>,
360 cx: &mut DocContext<'tcx>,
361 ) -> Option<WherePredicate> {
362 let ty::OutlivesPredicate(ty, lt) = pred;
364 Some(WherePredicate::BoundPredicate {
365 ty: clean_middle_ty(ty::Binder::dummy(ty), cx, None),
366 bounds: vec![GenericBound::Outlives(
367 clean_middle_region(lt).expect("failed to clean lifetimes"),
369 bound_params: Vec::new(),
373 fn clean_middle_term<'tcx>(
374 term: ty::Binder<'tcx, ty::Term<'tcx>>,
375 cx: &mut DocContext<'tcx>,
377 match term.skip_binder().unpack() {
378 ty::TermKind::Ty(ty) => Term::Type(clean_middle_ty(term.rebind(ty), cx, None)),
379 ty::TermKind::Const(c) => Term::Constant(clean_middle_const(term.rebind(c), cx)),
383 fn clean_hir_term<'tcx>(term: &hir::Term<'tcx>, cx: &mut DocContext<'tcx>) -> Term {
385 hir::Term::Ty(ty) => Term::Type(clean_ty(ty, cx)),
386 hir::Term::Const(c) => Term::Constant(clean_middle_const(
387 ty::Binder::dummy(ty::Const::from_anon_const(cx.tcx, c.def_id)),
393 fn clean_projection_predicate<'tcx>(
394 pred: ty::Binder<'tcx, ty::ProjectionPredicate<'tcx>>,
395 cx: &mut DocContext<'tcx>,
396 ) -> WherePredicate {
397 let late_bound_regions = cx
399 .collect_referenced_late_bound_regions(&pred)
401 .filter_map(|br| match br {
402 ty::BrNamed(_, name) if br.is_named() => Some(Lifetime(name)),
407 WherePredicate::EqPredicate {
408 lhs: Box::new(clean_projection(pred.map_bound(|p| p.projection_ty), cx, None)),
409 rhs: Box::new(clean_middle_term(pred.map_bound(|p| p.term), cx)),
410 bound_params: late_bound_regions,
414 fn clean_projection<'tcx>(
415 ty: ty::Binder<'tcx, ty::AliasTy<'tcx>>,
416 cx: &mut DocContext<'tcx>,
417 def_id: Option<DefId>,
419 if cx.tcx.def_kind(ty.skip_binder().def_id) == DefKind::ImplTraitPlaceholder {
422 .explicit_item_bounds(ty.skip_binder().def_id)
424 .map(|(bound, _)| EarlyBinder(*bound).subst(cx.tcx, ty.skip_binder().substs))
425 .collect::<Vec<_>>();
426 return clean_middle_opaque_bounds(cx, bounds);
430 clean_trait_ref_with_bindings(cx, ty.map_bound(|ty| ty.trait_ref(cx.tcx)), ThinVec::new());
431 let self_type = clean_middle_ty(ty.map_bound(|ty| ty.self_ty()), cx, None);
432 let self_def_id = if let Some(def_id) = def_id {
433 cx.tcx.opt_parent(def_id).or(Some(def_id))
435 self_type.def_id(&cx.cache)
437 let should_show_cast = compute_should_show_cast(self_def_id, &trait_, &self_type);
438 Type::QPath(Box::new(QPathData {
439 assoc: projection_to_path_segment(ty, cx),
446 fn compute_should_show_cast(self_def_id: Option<DefId>, trait_: &Path, self_type: &Type) -> bool {
447 !trait_.segments.is_empty()
449 .zip(Some(trait_.def_id()))
450 .map_or(!self_type.is_self_type(), |(id, trait_)| id != trait_)
453 fn projection_to_path_segment<'tcx>(
454 ty: ty::Binder<'tcx, ty::AliasTy<'tcx>>,
455 cx: &mut DocContext<'tcx>,
457 let item = cx.tcx.associated_item(ty.skip_binder().def_id);
458 let generics = cx.tcx.generics_of(ty.skip_binder().def_id);
461 args: GenericArgs::AngleBracketed {
462 args: substs_to_args(cx, ty.map_bound(|ty| &ty.substs[generics.parent_count..]), false)
464 bindings: Default::default(),
469 fn clean_generic_param_def<'tcx>(
470 def: &ty::GenericParamDef,
471 cx: &mut DocContext<'tcx>,
472 ) -> GenericParamDef {
473 let (name, kind) = match def.kind {
474 ty::GenericParamDefKind::Lifetime => {
475 (def.name, GenericParamDefKind::Lifetime { outlives: vec![] })
477 ty::GenericParamDefKind::Type { has_default, synthetic, .. } => {
478 let default = if has_default {
479 Some(clean_middle_ty(
480 ty::Binder::dummy(cx.tcx.type_of(def.def_id)),
489 GenericParamDefKind::Type {
491 bounds: vec![], // These are filled in from the where-clauses.
492 default: default.map(Box::new),
497 ty::GenericParamDefKind::Const { has_default } => (
499 GenericParamDefKind::Const {
501 ty: Box::new(clean_middle_ty(
502 ty::Binder::dummy(cx.tcx.type_of(def.def_id)),
506 default: match has_default {
507 true => Some(Box::new(
508 cx.tcx.const_param_default(def.def_id).subst_identity().to_string(),
516 GenericParamDef { name, kind }
519 fn clean_generic_param<'tcx>(
520 cx: &mut DocContext<'tcx>,
521 generics: Option<&hir::Generics<'tcx>>,
522 param: &hir::GenericParam<'tcx>,
523 ) -> GenericParamDef {
524 let (name, kind) = match param.kind {
525 hir::GenericParamKind::Lifetime { .. } => {
526 let outlives = if let Some(generics) = generics {
528 .outlives_for_param(param.def_id)
529 .filter(|bp| !bp.in_where_clause)
530 .flat_map(|bp| bp.bounds)
531 .map(|bound| match bound {
532 hir::GenericBound::Outlives(lt) => clean_lifetime(lt, cx),
539 (param.name.ident().name, GenericParamDefKind::Lifetime { outlives })
541 hir::GenericParamKind::Type { ref default, synthetic } => {
542 let bounds = if let Some(generics) = generics {
544 .bounds_for_param(param.def_id)
545 .filter(|bp| bp.origin != PredicateOrigin::WhereClause)
546 .flat_map(|bp| bp.bounds)
547 .filter_map(|x| clean_generic_bound(x, cx))
553 param.name.ident().name,
554 GenericParamDefKind::Type {
555 did: param.def_id.to_def_id(),
557 default: default.map(|t| clean_ty(t, cx)).map(Box::new),
562 hir::GenericParamKind::Const { ty, default } => (
563 param.name.ident().name,
564 GenericParamDefKind::Const {
565 did: param.def_id.to_def_id(),
566 ty: Box::new(clean_ty(ty, cx)),
568 .map(|ct| Box::new(ty::Const::from_anon_const(cx.tcx, ct.def_id).to_string())),
573 GenericParamDef { name, kind }
576 /// Synthetic type-parameters are inserted after normal ones.
577 /// In order for normal parameters to be able to refer to synthetic ones,
578 /// scans them first.
579 fn is_impl_trait(param: &hir::GenericParam<'_>) -> bool {
581 hir::GenericParamKind::Type { synthetic, .. } => synthetic,
586 /// This can happen for `async fn`, e.g. `async fn f<'_>(&'_ self)`.
588 /// See `lifetime_to_generic_param` in `rustc_ast_lowering` for more information.
589 fn is_elided_lifetime(param: &hir::GenericParam<'_>) -> bool {
590 matches!(param.kind, hir::GenericParamKind::Lifetime { kind: hir::LifetimeParamKind::Elided })
593 pub(crate) fn clean_generics<'tcx>(
594 gens: &hir::Generics<'tcx>,
595 cx: &mut DocContext<'tcx>,
597 let impl_trait_params = gens
600 .filter(|param| is_impl_trait(param))
602 let param = clean_generic_param(cx, Some(gens), param);
604 GenericParamDefKind::Lifetime { .. } => unreachable!(),
605 GenericParamDefKind::Type { did, ref bounds, .. } => {
606 cx.impl_trait_bounds.insert(did.into(), bounds.clone());
608 GenericParamDefKind::Const { .. } => unreachable!(),
612 .collect::<Vec<_>>();
614 let mut bound_predicates = FxIndexMap::default();
615 let mut region_predicates = FxIndexMap::default();
616 let mut eq_predicates = ThinVec::default();
617 for pred in gens.predicates.iter().filter_map(|x| clean_where_predicate(x, cx)) {
619 WherePredicate::BoundPredicate { ty, bounds, bound_params } => {
620 match bound_predicates.entry(ty) {
621 IndexEntry::Vacant(v) => {
622 v.insert((bounds, bound_params));
624 IndexEntry::Occupied(mut o) => {
625 // we merge both bounds.
626 for bound in bounds {
627 if !o.get().0.contains(&bound) {
628 o.get_mut().0.push(bound);
631 for bound_param in bound_params {
632 if !o.get().1.contains(&bound_param) {
633 o.get_mut().1.push(bound_param);
639 WherePredicate::RegionPredicate { lifetime, bounds } => {
640 match region_predicates.entry(lifetime) {
641 IndexEntry::Vacant(v) => {
644 IndexEntry::Occupied(mut o) => {
645 // we merge both bounds.
646 for bound in bounds {
647 if !o.get().contains(&bound) {
648 o.get_mut().push(bound);
654 WherePredicate::EqPredicate { lhs, rhs, bound_params } => {
655 eq_predicates.push(WherePredicate::EqPredicate { lhs, rhs, bound_params });
660 let mut params = ThinVec::with_capacity(gens.params.len());
661 // In this loop, we gather the generic parameters (`<'a, B: 'a>`) and check if they have
662 // bounds in the where predicates. If so, we move their bounds into the where predicates
663 // while also preventing duplicates.
664 for p in gens.params.iter().filter(|p| !is_impl_trait(p) && !is_elided_lifetime(p)) {
665 let mut p = clean_generic_param(cx, Some(gens), p);
667 GenericParamDefKind::Lifetime { ref mut outlives } => {
668 if let Some(region_pred) = region_predicates.get_mut(&Lifetime(p.name)) {
669 // We merge bounds in the `where` clause.
670 for outlive in outlives.drain(..) {
671 let outlive = GenericBound::Outlives(outlive);
672 if !region_pred.contains(&outlive) {
673 region_pred.push(outlive);
678 GenericParamDefKind::Type { bounds, synthetic: false, .. } => {
679 if let Some(bound_pred) = bound_predicates.get_mut(&Type::Generic(p.name)) {
680 // We merge bounds in the `where` clause.
681 for bound in bounds.drain(..) {
682 if !bound_pred.0.contains(&bound) {
683 bound_pred.0.push(bound);
688 GenericParamDefKind::Type { .. } | GenericParamDefKind::Const { .. } => {
689 // nothing to do here.
694 params.extend(impl_trait_params);
698 where_predicates: bound_predicates
700 .map(|(ty, (bounds, bound_params))| WherePredicate::BoundPredicate {
708 .map(|(lifetime, bounds)| WherePredicate::RegionPredicate { lifetime, bounds }),
710 .chain(eq_predicates.into_iter())
715 fn clean_ty_generics<'tcx>(
716 cx: &mut DocContext<'tcx>,
718 preds: ty::GenericPredicates<'tcx>,
720 // Don't populate `cx.impl_trait_bounds` before `clean`ning `where` clauses,
721 // since `Clean for ty::Predicate` would consume them.
722 let mut impl_trait = BTreeMap::<ImplTraitParam, Vec<GenericBound>>::default();
724 // Bounds in the type_params and lifetimes fields are repeated in the
725 // predicates field (see rustc_hir_analysis::collect::ty_generics), so remove
727 let stripped_params = gens
730 .filter_map(|param| match param.kind {
731 ty::GenericParamDefKind::Lifetime if param.is_anonymous_lifetime() => None,
732 ty::GenericParamDefKind::Lifetime => Some(clean_generic_param_def(param, cx)),
733 ty::GenericParamDefKind::Type { synthetic, .. } => {
734 if param.name == kw::SelfUpper {
735 assert_eq!(param.index, 0);
739 impl_trait.insert(param.index.into(), vec![]);
742 Some(clean_generic_param_def(param, cx))
744 ty::GenericParamDefKind::Const { .. } => Some(clean_generic_param_def(param, cx)),
746 .collect::<ThinVec<GenericParamDef>>();
748 // param index -> [(trait DefId, associated type name & generics, type, higher-ranked params)]
749 let mut impl_trait_proj = FxHashMap::<
751 Vec<(DefId, PathSegment, ty::Binder<'_, Ty<'_>>, Vec<GenericParamDef>)>,
754 let where_predicates = preds
758 let mut projection = None;
759 let param_idx = (|| {
760 let bound_p = p.kind();
761 match bound_p.skip_binder() {
762 ty::PredicateKind::Clause(ty::Clause::Trait(pred)) => {
763 if let ty::Param(param) = pred.self_ty().kind() {
764 return Some(param.index);
767 ty::PredicateKind::Clause(ty::Clause::TypeOutlives(ty::OutlivesPredicate(
771 if let ty::Param(param) = ty.kind() {
772 return Some(param.index);
775 ty::PredicateKind::Clause(ty::Clause::Projection(p)) => {
776 if let ty::Param(param) = p.projection_ty.self_ty().kind() {
777 projection = Some(bound_p.rebind(p));
778 return Some(param.index);
787 if let Some(param_idx) = param_idx {
788 if let Some(b) = impl_trait.get_mut(¶m_idx.into()) {
789 let p: WherePredicate = clean_predicate(*p, cx)?;
796 .filter(|b| !b.is_sized_bound(cx)),
799 let proj = projection.map(|p| {
801 clean_projection(p.map_bound(|p| p.projection_ty), cx, None),
802 p.map_bound(|p| p.term),
805 if let Some(((_, trait_did, name), rhs)) = proj
807 .and_then(|(lhs, rhs): &(Type, _)| Some((lhs.projection()?, rhs)))
809 // FIXME(...): Remove this unwrap()
810 impl_trait_proj.entry(param_idx).or_default().push((
813 rhs.map_bound(|rhs| rhs.ty().unwrap()),
817 .map(|param| GenericParamDef::lifetime(param.0))
828 .collect::<Vec<_>>();
830 for (param, mut bounds) in impl_trait {
831 // Move trait bounds to the front.
832 bounds.sort_by_key(|b| !matches!(b, GenericBound::TraitBound(..)));
834 let crate::core::ImplTraitParam::ParamIndex(idx) = param else { unreachable!() };
835 if let Some(proj) = impl_trait_proj.remove(&idx) {
836 for (trait_did, name, rhs, bound_params) in proj {
837 let rhs = clean_middle_ty(rhs, cx, None);
838 simplify::merge_bounds(
849 cx.impl_trait_bounds.insert(param, bounds);
852 // Now that `cx.impl_trait_bounds` is populated, we can process
853 // remaining predicates which could contain `impl Trait`.
854 let mut where_predicates =
855 where_predicates.into_iter().flat_map(|p| clean_predicate(*p, cx)).collect::<Vec<_>>();
857 // In the surface language, all type parameters except `Self` have an
858 // implicit `Sized` bound unless removed with `?Sized`.
859 // However, in the list of where-predicates below, `Sized` appears like a
860 // normal bound: It's either present (the type is sized) or
861 // absent (the type is unsized) but never *maybe* (i.e. `?Sized`).
863 // This is unsuitable for rendering.
864 // Thus, as a first step remove all `Sized` bounds that should be implicit.
866 // Note that associated types also have an implicit `Sized` bound but we
867 // don't actually know the set of associated types right here so that's
868 // handled when cleaning associated types.
869 let mut sized_params = FxHashSet::default();
870 where_predicates.retain(|pred| {
871 if let WherePredicate::BoundPredicate { ty: Generic(g), bounds, .. } = pred
872 && *g != kw::SelfUpper
873 && bounds.iter().any(|b| b.is_sized_bound(cx))
875 sized_params.insert(*g);
882 // As a final step, go through the type parameters again and insert a
883 // `?Sized` bound for each one we didn't find to be `Sized`.
884 for tp in &stripped_params {
885 if let types::GenericParamDefKind::Type { .. } = tp.kind
886 && !sized_params.contains(&tp.name)
888 where_predicates.push(WherePredicate::BoundPredicate {
889 ty: Type::Generic(tp.name),
890 bounds: vec![GenericBound::maybe_sized(cx)],
891 bound_params: Vec::new(),
896 // It would be nice to collect all of the bounds on a type and recombine
897 // them if possible, to avoid e.g., `where T: Foo, T: Bar, T: Sized, T: 'a`
898 // and instead see `where T: Foo + Bar + Sized + 'a`
901 params: stripped_params,
902 where_predicates: simplify::where_clauses(cx, where_predicates),
906 fn clean_fn_or_proc_macro<'tcx>(
907 item: &hir::Item<'tcx>,
908 sig: &hir::FnSig<'tcx>,
909 generics: &hir::Generics<'tcx>,
910 body_id: hir::BodyId,
912 cx: &mut DocContext<'tcx>,
914 let attrs = cx.tcx.hir().attrs(item.hir_id());
915 let macro_kind = attrs.iter().find_map(|a| {
916 if a.has_name(sym::proc_macro) {
917 Some(MacroKind::Bang)
918 } else if a.has_name(sym::proc_macro_derive) {
919 Some(MacroKind::Derive)
920 } else if a.has_name(sym::proc_macro_attribute) {
921 Some(MacroKind::Attr)
928 if kind == MacroKind::Derive {
930 .lists(sym::proc_macro_derive)
931 .find_map(|mi| mi.ident())
932 .expect("proc-macro derives require a name")
936 let mut helpers = Vec::new();
937 for mi in attrs.lists(sym::proc_macro_derive) {
938 if !mi.has_name(sym::attributes) {
942 if let Some(list) = mi.meta_item_list() {
943 for inner_mi in list {
944 if let Some(ident) = inner_mi.ident() {
945 helpers.push(ident.name);
950 ProcMacroItem(ProcMacro { kind, helpers })
953 let mut func = clean_function(cx, sig, generics, FunctionArgs::Body(body_id));
954 clean_fn_decl_legacy_const_generics(&mut func, attrs);
960 /// This is needed to make it more "readable" when documenting functions using
961 /// `rustc_legacy_const_generics`. More information in
962 /// <https://github.com/rust-lang/rust/issues/83167>.
963 fn clean_fn_decl_legacy_const_generics(func: &mut Function, attrs: &[ast::Attribute]) {
964 for meta_item_list in attrs
966 .filter(|a| a.has_name(sym::rustc_legacy_const_generics))
967 .filter_map(|a| a.meta_item_list())
969 for (pos, literal) in meta_item_list.iter().filter_map(|meta| meta.lit()).enumerate() {
971 ast::LitKind::Int(a, _) => {
972 let gen = func.generics.params.remove(0);
973 if let GenericParamDef { name, kind: GenericParamDefKind::Const { ty, .. } } =
979 .insert(a as _, Argument { name, type_: *ty, is_const: true });
981 panic!("unexpected non const in position {pos}");
984 _ => panic!("invalid arg index"),
990 enum FunctionArgs<'tcx> {
992 Names(&'tcx [Ident]),
995 fn clean_function<'tcx>(
996 cx: &mut DocContext<'tcx>,
997 sig: &hir::FnSig<'tcx>,
998 generics: &hir::Generics<'tcx>,
999 args: FunctionArgs<'tcx>,
1000 ) -> Box<Function> {
1001 let (generics, decl) = enter_impl_trait(cx, |cx| {
1002 // NOTE: generics must be cleaned before args
1003 let generics = clean_generics(generics, cx);
1004 let args = match args {
1005 FunctionArgs::Body(body_id) => {
1006 clean_args_from_types_and_body_id(cx, sig.decl.inputs, body_id)
1008 FunctionArgs::Names(names) => {
1009 clean_args_from_types_and_names(cx, sig.decl.inputs, names)
1012 let mut decl = clean_fn_decl_with_args(cx, sig.decl, args);
1013 if sig.header.is_async() {
1014 decl.output = decl.sugared_async_return_type();
1018 Box::new(Function { decl, generics })
1021 fn clean_args_from_types_and_names<'tcx>(
1022 cx: &mut DocContext<'tcx>,
1023 types: &[hir::Ty<'tcx>],
1030 .map(|(i, ty)| Argument {
1031 type_: clean_ty(ty, cx),
1034 .map(|ident| ident.name)
1035 .filter(|ident| !ident.is_empty())
1036 .unwrap_or(kw::Underscore),
1043 fn clean_args_from_types_and_body_id<'tcx>(
1044 cx: &mut DocContext<'tcx>,
1045 types: &[hir::Ty<'tcx>],
1046 body_id: hir::BodyId,
1048 let body = cx.tcx.hir().body(body_id);
1054 .map(|(i, ty)| Argument {
1055 name: name_from_pat(body.params[i].pat),
1056 type_: clean_ty(ty, cx),
1063 fn clean_fn_decl_with_args<'tcx>(
1064 cx: &mut DocContext<'tcx>,
1065 decl: &hir::FnDecl<'tcx>,
1068 let output = match decl.output {
1069 hir::FnRetTy::Return(typ) => Return(clean_ty(typ, cx)),
1070 hir::FnRetTy::DefaultReturn(..) => DefaultReturn,
1072 FnDecl { inputs: args, output, c_variadic: decl.c_variadic }
1075 fn clean_fn_decl_from_did_and_sig<'tcx>(
1076 cx: &mut DocContext<'tcx>,
1078 sig: ty::PolyFnSig<'tcx>,
1080 let mut names = did.map_or(&[] as &[_], |did| cx.tcx.fn_arg_names(did)).iter();
1082 // We assume all empty tuples are default return type. This theoretically can discard `-> ()`,
1083 // but shouldn't change any code meaning.
1084 let output = match clean_middle_ty(sig.output(), cx, None) {
1085 Type::Tuple(inner) if inner.is_empty() => DefaultReturn,
1091 c_variadic: sig.skip_binder().c_variadic,
1097 type_: clean_middle_ty(t.map_bound(|t| *t), cx, None),
1101 .filter(|i| !i.is_empty())
1102 .unwrap_or(kw::Underscore),
1110 fn clean_trait_ref<'tcx>(trait_ref: &hir::TraitRef<'tcx>, cx: &mut DocContext<'tcx>) -> Path {
1111 let path = clean_path(trait_ref.path, cx);
1112 register_res(cx, path.res);
1116 fn clean_poly_trait_ref<'tcx>(
1117 poly_trait_ref: &hir::PolyTraitRef<'tcx>,
1118 cx: &mut DocContext<'tcx>,
1121 trait_: clean_trait_ref(&poly_trait_ref.trait_ref, cx),
1122 generic_params: poly_trait_ref
1123 .bound_generic_params
1125 .filter(|p| !is_elided_lifetime(p))
1126 .map(|x| clean_generic_param(cx, None, x))
1131 fn clean_trait_item<'tcx>(trait_item: &hir::TraitItem<'tcx>, cx: &mut DocContext<'tcx>) -> Item {
1132 let local_did = trait_item.owner_id.to_def_id();
1133 cx.with_param_env(local_did, |cx| {
1134 let inner = match trait_item.kind {
1135 hir::TraitItemKind::Const(ty, Some(default)) => AssocConstItem(
1137 ConstantKind::Local { def_id: local_did, body: default },
1139 hir::TraitItemKind::Const(ty, None) => TyAssocConstItem(clean_ty(ty, cx)),
1140 hir::TraitItemKind::Fn(ref sig, hir::TraitFn::Provided(body)) => {
1141 let m = clean_function(cx, sig, trait_item.generics, FunctionArgs::Body(body));
1144 hir::TraitItemKind::Fn(ref sig, hir::TraitFn::Required(names)) => {
1145 let m = clean_function(cx, sig, trait_item.generics, FunctionArgs::Names(names));
1148 hir::TraitItemKind::Type(bounds, Some(default)) => {
1149 let generics = enter_impl_trait(cx, |cx| clean_generics(trait_item.generics, cx));
1150 let bounds = bounds.iter().filter_map(|x| clean_generic_bound(x, cx)).collect();
1152 clean_middle_ty(ty::Binder::dummy(hir_ty_to_ty(cx.tcx, default)), cx, None);
1155 type_: clean_ty(default, cx),
1157 item_type: Some(item_type),
1162 hir::TraitItemKind::Type(bounds, None) => {
1163 let generics = enter_impl_trait(cx, |cx| clean_generics(trait_item.generics, cx));
1164 let bounds = bounds.iter().filter_map(|x| clean_generic_bound(x, cx)).collect();
1165 TyAssocTypeItem(generics, bounds)
1168 Item::from_def_id_and_parts(local_did, Some(trait_item.ident.name), inner, cx)
1172 pub(crate) fn clean_impl_item<'tcx>(
1173 impl_: &hir::ImplItem<'tcx>,
1174 cx: &mut DocContext<'tcx>,
1176 let local_did = impl_.owner_id.to_def_id();
1177 cx.with_param_env(local_did, |cx| {
1178 let inner = match impl_.kind {
1179 hir::ImplItemKind::Const(ty, expr) => {
1180 let default = ConstantKind::Local { def_id: local_did, body: expr };
1181 AssocConstItem(clean_ty(ty, cx), default)
1183 hir::ImplItemKind::Fn(ref sig, body) => {
1184 let m = clean_function(cx, sig, impl_.generics, FunctionArgs::Body(body));
1185 let defaultness = cx.tcx.impl_defaultness(impl_.owner_id);
1186 MethodItem(m, Some(defaultness))
1188 hir::ImplItemKind::Type(hir_ty) => {
1189 let type_ = clean_ty(hir_ty, cx);
1190 let generics = clean_generics(impl_.generics, cx);
1192 clean_middle_ty(ty::Binder::dummy(hir_ty_to_ty(cx.tcx, hir_ty)), cx, None);
1194 Box::new(Typedef { type_, generics, item_type: Some(item_type) }),
1200 Item::from_def_id_and_parts(local_did, Some(impl_.ident.name), inner, cx)
1204 pub(crate) fn clean_middle_assoc_item<'tcx>(
1205 assoc_item: &ty::AssocItem,
1206 cx: &mut DocContext<'tcx>,
1209 let kind = match assoc_item.kind {
1210 ty::AssocKind::Const => {
1211 let ty = clean_middle_ty(
1212 ty::Binder::dummy(tcx.type_of(assoc_item.def_id)),
1214 Some(assoc_item.def_id),
1217 let provided = match assoc_item.container {
1218 ty::ImplContainer => true,
1219 ty::TraitContainer => tcx.impl_defaultness(assoc_item.def_id).has_value(),
1222 AssocConstItem(ty, ConstantKind::Extern { def_id: assoc_item.def_id })
1224 TyAssocConstItem(ty)
1227 ty::AssocKind::Fn => {
1228 let sig = tcx.fn_sig(assoc_item.def_id).subst_identity();
1230 let late_bound_regions = sig.bound_vars().into_iter().filter_map(|var| match var {
1231 ty::BoundVariableKind::Region(ty::BrNamed(_, name))
1232 if name != kw::UnderscoreLifetime =>
1234 Some(GenericParamDef::lifetime(name))
1239 let mut generics = clean_ty_generics(
1241 tcx.generics_of(assoc_item.def_id),
1242 tcx.explicit_predicates_of(assoc_item.def_id),
1244 // FIXME: This does not place parameters in source order (late-bound ones come last)
1245 generics.params.extend(late_bound_regions);
1247 let mut decl = clean_fn_decl_from_did_and_sig(cx, Some(assoc_item.def_id), sig);
1249 if assoc_item.fn_has_self_parameter {
1250 let self_ty = match assoc_item.container {
1251 ty::ImplContainer => tcx.type_of(assoc_item.container_id(tcx)),
1252 ty::TraitContainer => tcx.types.self_param,
1254 let self_arg_ty = sig.input(0).skip_binder();
1255 if self_arg_ty == self_ty {
1256 decl.inputs.values[0].type_ = Generic(kw::SelfUpper);
1257 } else if let ty::Ref(_, ty, _) = *self_arg_ty.kind() {
1259 match decl.inputs.values[0].type_ {
1260 BorrowedRef { ref mut type_, .. } => **type_ = Generic(kw::SelfUpper),
1261 _ => unreachable!(),
1267 let provided = match assoc_item.container {
1268 ty::ImplContainer => true,
1269 ty::TraitContainer => assoc_item.defaultness(tcx).has_value(),
1272 let defaultness = match assoc_item.container {
1273 ty::ImplContainer => Some(assoc_item.defaultness(tcx)),
1274 ty::TraitContainer => None,
1276 MethodItem(Box::new(Function { generics, decl }), defaultness)
1278 TyMethodItem(Box::new(Function { generics, decl }))
1281 ty::AssocKind::Type => {
1282 let my_name = assoc_item.name;
1284 fn param_eq_arg(param: &GenericParamDef, arg: &GenericArg) -> bool {
1285 match (¶m.kind, arg) {
1286 (GenericParamDefKind::Type { .. }, GenericArg::Type(Type::Generic(ty)))
1287 if *ty == param.name =>
1291 (GenericParamDefKind::Lifetime { .. }, GenericArg::Lifetime(Lifetime(lt)))
1292 if *lt == param.name =>
1296 (GenericParamDefKind::Const { .. }, GenericArg::Const(c)) => match &c.kind {
1297 ConstantKind::TyConst { expr } => **expr == *param.name.as_str(),
1304 if let ty::TraitContainer = assoc_item.container {
1305 let bounds = tcx.explicit_item_bounds(assoc_item.def_id);
1306 let predicates = tcx.explicit_predicates_of(assoc_item.def_id).predicates;
1308 tcx.arena.alloc_from_iter(bounds.into_iter().chain(predicates).copied());
1309 let mut generics = clean_ty_generics(
1311 tcx.generics_of(assoc_item.def_id),
1312 ty::GenericPredicates { parent: None, predicates },
1314 // Filter out the bounds that are (likely?) directly attached to the associated type,
1315 // as opposed to being located in the where clause.
1316 let mut bounds: Vec<GenericBound> = Vec::new();
1317 generics.where_predicates.retain_mut(|pred| match *pred {
1318 WherePredicate::BoundPredicate {
1319 ty: QPath(box QPathData { ref assoc, ref self_type, ref trait_, .. }),
1320 bounds: ref mut pred_bounds,
1323 if assoc.name != my_name {
1326 if trait_.def_id() != assoc_item.container_id(tcx) {
1330 Generic(ref s) if *s == kw::SelfUpper => {}
1334 GenericArgs::AngleBracketed { args, bindings } => {
1335 if !bindings.is_empty()
1340 .any(|(param, arg)| !param_eq_arg(param, arg))
1345 GenericArgs::Parenthesized { .. } => {
1346 // The only time this happens is if we're inside the rustdoc for Fn(),
1347 // which only has one associated type, which is not a GAT, so whatever.
1350 bounds.extend(mem::replace(pred_bounds, Vec::new()));
1355 // Our Sized/?Sized bound didn't get handled when creating the generics
1356 // because we didn't actually get our whole set of bounds until just now
1357 // (some of them may have come from the trait). If we do have a sized
1358 // bound, we remove it, and if we don't then we add the `?Sized` bound
1360 match bounds.iter().position(|b| b.is_sized_bound(cx)) {
1364 None => bounds.push(GenericBound::maybe_sized(cx)),
1366 // Move bounds that are (likely) directly attached to the parameters of the
1367 // (generic) associated type from the where clause to the respective parameter.
1368 // There is no guarantee that this is what the user actually wrote but we have
1369 // no way of knowing.
1370 let mut where_predicates = ThinVec::new();
1371 for mut pred in generics.where_predicates {
1372 if let WherePredicate::BoundPredicate { ty: Generic(arg), bounds, .. } = &mut pred
1373 && let Some(GenericParamDef {
1374 kind: GenericParamDefKind::Type { bounds: param_bounds, .. },
1376 }) = generics.params.iter_mut().find(|param| ¶m.name == arg)
1378 param_bounds.append(bounds);
1379 } else if let WherePredicate::RegionPredicate { lifetime: Lifetime(arg), bounds } = &mut pred
1380 && let Some(GenericParamDef {
1381 kind: GenericParamDefKind::Lifetime { outlives: param_bounds },
1383 }) = generics.params.iter_mut().find(|param| ¶m.name == arg) {
1384 param_bounds.extend(bounds.drain(..).map(|bound| match bound {
1385 GenericBound::Outlives(lifetime) => lifetime,
1386 _ => unreachable!(),
1389 where_predicates.push(pred);
1392 generics.where_predicates = where_predicates;
1394 if tcx.impl_defaultness(assoc_item.def_id).has_value() {
1397 type_: clean_middle_ty(
1398 ty::Binder::dummy(tcx.type_of(assoc_item.def_id)),
1400 Some(assoc_item.def_id),
1403 // FIXME: should we obtain the Type from HIR and pass it on here?
1409 TyAssocTypeItem(generics, bounds)
1412 // FIXME: when could this happen? Associated items in inherent impls?
1415 type_: clean_middle_ty(
1416 ty::Binder::dummy(tcx.type_of(assoc_item.def_id)),
1418 Some(assoc_item.def_id),
1420 generics: Generics {
1421 params: ThinVec::new(),
1422 where_predicates: ThinVec::new(),
1432 Item::from_def_id_and_parts(assoc_item.def_id, Some(assoc_item.name), kind, cx)
1435 fn clean_qpath<'tcx>(hir_ty: &hir::Ty<'tcx>, cx: &mut DocContext<'tcx>) -> Type {
1436 let hir::Ty { hir_id: _, span, ref kind } = *hir_ty;
1437 let hir::TyKind::Path(qpath) = kind else { unreachable!() };
1440 hir::QPath::Resolved(None, path) => {
1441 if let Res::Def(DefKind::TyParam, did) = path.res {
1442 if let Some(new_ty) = cx.substs.get(&did).and_then(|p| p.as_ty()).cloned() {
1445 if let Some(bounds) = cx.impl_trait_bounds.remove(&did.into()) {
1446 return ImplTrait(bounds);
1450 if let Some(expanded) = maybe_expand_private_type_alias(cx, path) {
1453 let path = clean_path(path, cx);
1454 resolve_type(cx, path)
1457 hir::QPath::Resolved(Some(qself), p) => {
1458 // Try to normalize `<X as Y>::T` to a type
1459 let ty = hir_ty_to_ty(cx.tcx, hir_ty);
1460 // `hir_to_ty` can return projection types with escaping vars for GATs, e.g. `<() as Trait>::Gat<'_>`
1461 if !ty.has_escaping_bound_vars() {
1462 if let Some(normalized_value) = normalize(cx, ty::Binder::dummy(ty)) {
1463 return clean_middle_ty(normalized_value, cx, None);
1467 let trait_segments = &p.segments[..p.segments.len() - 1];
1468 let trait_def = cx.tcx.associated_item(p.res.def_id()).container_id(cx.tcx);
1469 let trait_ = self::Path {
1470 res: Res::Def(DefKind::Trait, trait_def),
1471 segments: trait_segments.iter().map(|x| clean_path_segment(x, cx)).collect(),
1473 register_res(cx, trait_.res);
1474 let self_def_id = DefId::local(qself.hir_id.owner.def_id.local_def_index);
1475 let self_type = clean_ty(qself, cx);
1476 let should_show_cast = compute_should_show_cast(Some(self_def_id), &trait_, &self_type);
1477 Type::QPath(Box::new(QPathData {
1478 assoc: clean_path_segment(p.segments.last().expect("segments were empty"), cx),
1484 hir::QPath::TypeRelative(qself, segment) => {
1485 let ty = hir_ty_to_ty(cx.tcx, hir_ty);
1486 let res = match ty.kind() {
1487 ty::Alias(ty::Projection, proj) => {
1488 Res::Def(DefKind::Trait, proj.trait_ref(cx.tcx).def_id)
1490 // Rustdoc handles `ty::Error`s by turning them into `Type::Infer`s.
1491 ty::Error(_) => return Type::Infer,
1492 // Otherwise, this is an inherent associated type.
1493 _ => return clean_middle_ty(ty::Binder::dummy(ty), cx, None),
1495 let trait_ = clean_path(&hir::Path { span, res, segments: &[] }, cx);
1496 register_res(cx, trait_.res);
1497 let self_def_id = res.opt_def_id();
1498 let self_type = clean_ty(qself, cx);
1499 let should_show_cast = compute_should_show_cast(self_def_id, &trait_, &self_type);
1500 Type::QPath(Box::new(QPathData {
1501 assoc: clean_path_segment(segment, cx),
1507 hir::QPath::LangItem(..) => bug!("clean: requiring documentation of lang item"),
1511 fn maybe_expand_private_type_alias<'tcx>(
1512 cx: &mut DocContext<'tcx>,
1513 path: &hir::Path<'tcx>,
1515 let Res::Def(DefKind::TyAlias, def_id) = path.res else { return None };
1516 // Substitute private type aliases
1517 let def_id = def_id.as_local()?;
1518 let alias = if !cx.cache.effective_visibilities.is_exported(cx.tcx, def_id.to_def_id()) {
1519 &cx.tcx.hir().expect_item(def_id).kind
1523 let hir::ItemKind::TyAlias(ty, generics) = alias else { return None };
1525 let provided_params = &path.segments.last().expect("segments were empty");
1526 let mut substs = DefIdMap::default();
1527 let generic_args = provided_params.args();
1529 let mut indices: hir::GenericParamCount = Default::default();
1530 for param in generics.params.iter() {
1532 hir::GenericParamKind::Lifetime { .. } => {
1534 let lifetime = generic_args.args.iter().find_map(|arg| match arg {
1535 hir::GenericArg::Lifetime(lt) => {
1536 if indices.lifetimes == j {
1544 if let Some(lt) = lifetime {
1545 let cleaned = if !lt.is_anonymous() {
1546 clean_lifetime(lt, cx)
1550 substs.insert(param.def_id.to_def_id(), SubstParam::Lifetime(cleaned));
1552 indices.lifetimes += 1;
1554 hir::GenericParamKind::Type { ref default, .. } => {
1556 let type_ = generic_args.args.iter().find_map(|arg| match arg {
1557 hir::GenericArg::Type(ty) => {
1558 if indices.types == j {
1566 if let Some(ty) = type_ {
1567 substs.insert(param.def_id.to_def_id(), SubstParam::Type(clean_ty(ty, cx)));
1568 } else if let Some(default) = *default {
1570 .insert(param.def_id.to_def_id(), SubstParam::Type(clean_ty(default, cx)));
1574 hir::GenericParamKind::Const { .. } => {
1576 let const_ = generic_args.args.iter().find_map(|arg| match arg {
1577 hir::GenericArg::Const(ct) => {
1578 if indices.consts == j {
1586 if let Some(ct) = const_ {
1588 param.def_id.to_def_id(),
1589 SubstParam::Constant(clean_const(ct, cx)),
1592 // FIXME(const_generics_defaults)
1593 indices.consts += 1;
1598 Some(cx.enter_alias(substs, |cx| clean_ty(ty, cx)))
1601 pub(crate) fn clean_ty<'tcx>(ty: &hir::Ty<'tcx>, cx: &mut DocContext<'tcx>) -> Type {
1605 TyKind::Never => Primitive(PrimitiveType::Never),
1606 TyKind::Ptr(ref m) => RawPointer(m.mutbl, Box::new(clean_ty(m.ty, cx))),
1607 TyKind::Ref(ref l, ref m) => {
1608 let lifetime = if l.is_anonymous() { None } else { Some(clean_lifetime(*l, cx)) };
1609 BorrowedRef { lifetime, mutability: m.mutbl, type_: Box::new(clean_ty(m.ty, cx)) }
1611 TyKind::Slice(ty) => Slice(Box::new(clean_ty(ty, cx))),
1612 TyKind::Array(ty, ref length) => {
1613 let length = match length {
1614 hir::ArrayLen::Infer(_, _) => "_".to_string(),
1615 hir::ArrayLen::Body(anon_const) => {
1616 // NOTE(min_const_generics): We can't use `const_eval_poly` for constants
1617 // as we currently do not supply the parent generics to anonymous constants
1618 // but do allow `ConstKind::Param`.
1620 // `const_eval_poly` tries to first substitute generic parameters which
1621 // results in an ICE while manually constructing the constant and using `eval`
1622 // does nothing for `ConstKind::Param`.
1623 let ct = ty::Const::from_anon_const(cx.tcx, anon_const.def_id);
1624 let param_env = cx.tcx.param_env(anon_const.def_id);
1625 print_const(cx, ct.eval(cx.tcx, param_env))
1629 Array(Box::new(clean_ty(ty, cx)), length.into())
1631 TyKind::Tup(tys) => Tuple(tys.iter().map(|ty| clean_ty(ty, cx)).collect()),
1632 TyKind::OpaqueDef(item_id, _, _) => {
1633 let item = cx.tcx.hir().item(item_id);
1634 if let hir::ItemKind::OpaqueTy(ref ty) = item.kind {
1635 ImplTrait(ty.bounds.iter().filter_map(|x| clean_generic_bound(x, cx)).collect())
1640 TyKind::Path(_) => clean_qpath(ty, cx),
1641 TyKind::TraitObject(bounds, ref lifetime, _) => {
1642 let bounds = bounds.iter().map(|bound| clean_poly_trait_ref(bound, cx)).collect();
1644 if !lifetime.is_elided() { Some(clean_lifetime(*lifetime, cx)) } else { None };
1645 DynTrait(bounds, lifetime)
1647 TyKind::BareFn(barefn) => BareFunction(Box::new(clean_bare_fn_ty(barefn, cx))),
1648 // Rustdoc handles `TyKind::Err`s by turning them into `Type::Infer`s.
1649 TyKind::Infer | TyKind::Err | TyKind::Typeof(..) => Infer,
1653 /// Returns `None` if the type could not be normalized
1655 cx: &mut DocContext<'tcx>,
1656 ty: ty::Binder<'tcx, Ty<'tcx>>,
1657 ) -> Option<ty::Binder<'tcx, Ty<'tcx>>> {
1658 // HACK: low-churn fix for #79459 while we wait for a trait normalization fix
1659 if !cx.tcx.sess.opts.unstable_opts.normalize_docs {
1663 use crate::rustc_trait_selection::infer::TyCtxtInferExt;
1664 use crate::rustc_trait_selection::traits::query::normalize::QueryNormalizeExt;
1665 use rustc_middle::traits::ObligationCause;
1667 // Try to normalize `<X as Y>::T` to a type
1668 let infcx = cx.tcx.infer_ctxt().build();
1669 let normalized = infcx
1670 .at(&ObligationCause::dummy(), cx.param_env)
1671 .query_normalize(ty)
1672 .map(|resolved| infcx.resolve_vars_if_possible(resolved.value));
1674 Ok(normalized_value) => {
1675 debug!("normalized {:?} to {:?}", ty, normalized_value);
1676 Some(normalized_value)
1679 debug!("failed to normalize {:?}: {:?}", ty, err);
1685 #[instrument(level = "trace", skip(cx), ret)]
1686 pub(crate) fn clean_middle_ty<'tcx>(
1687 bound_ty: ty::Binder<'tcx, Ty<'tcx>>,
1688 cx: &mut DocContext<'tcx>,
1689 def_id: Option<DefId>,
1691 let bound_ty = normalize(cx, bound_ty).unwrap_or(bound_ty);
1692 match *bound_ty.skip_binder().kind() {
1693 ty::Never => Primitive(PrimitiveType::Never),
1694 ty::Bool => Primitive(PrimitiveType::Bool),
1695 ty::Char => Primitive(PrimitiveType::Char),
1696 ty::Int(int_ty) => Primitive(int_ty.into()),
1697 ty::Uint(uint_ty) => Primitive(uint_ty.into()),
1698 ty::Float(float_ty) => Primitive(float_ty.into()),
1699 ty::Str => Primitive(PrimitiveType::Str),
1700 ty::Slice(ty) => Slice(Box::new(clean_middle_ty(bound_ty.rebind(ty), cx, None))),
1701 ty::Array(ty, mut n) => {
1702 n = n.eval(cx.tcx, ty::ParamEnv::reveal_all());
1703 let n = print_const(cx, n);
1704 Array(Box::new(clean_middle_ty(bound_ty.rebind(ty), cx, None)), n.into())
1707 RawPointer(mt.mutbl, Box::new(clean_middle_ty(bound_ty.rebind(mt.ty), cx, None)))
1709 ty::Ref(r, ty, mutbl) => BorrowedRef {
1710 lifetime: clean_middle_region(r),
1712 type_: Box::new(clean_middle_ty(bound_ty.rebind(ty), cx, None)),
1714 ty::FnDef(..) | ty::FnPtr(_) => {
1715 // FIXME: should we merge the outer and inner binders somehow?
1716 let sig = bound_ty.skip_binder().fn_sig(cx.tcx);
1717 let decl = clean_fn_decl_from_did_and_sig(cx, None, sig);
1718 BareFunction(Box::new(BareFunctionDecl {
1719 unsafety: sig.unsafety(),
1720 generic_params: Vec::new(),
1725 ty::Adt(def, substs) => {
1726 let did = def.did();
1727 let kind = match def.adt_kind() {
1728 AdtKind::Struct => ItemType::Struct,
1729 AdtKind::Union => ItemType::Union,
1730 AdtKind::Enum => ItemType::Enum,
1732 inline::record_extern_fqn(cx, did, kind);
1733 let path = external_path(cx, did, false, ThinVec::new(), bound_ty.rebind(substs));
1736 ty::Foreign(did) => {
1737 inline::record_extern_fqn(cx, did, ItemType::ForeignType);
1738 let path = external_path(
1743 ty::Binder::dummy(InternalSubsts::empty()),
1747 ty::Dynamic(obj, ref reg, _) => {
1748 // HACK: pick the first `did` as the `did` of the trait object. Someone
1749 // might want to implement "native" support for marker-trait-only
1751 let mut dids = obj.auto_traits();
1754 .or_else(|| dids.next())
1755 .unwrap_or_else(|| panic!("found trait object `{bound_ty:?}` with no traits?"));
1756 let substs = match obj.principal() {
1757 Some(principal) => principal.map_bound(|p| p.substs),
1758 // marker traits have no substs.
1759 _ => ty::Binder::dummy(InternalSubsts::empty()),
1762 inline::record_extern_fqn(cx, did, ItemType::Trait);
1764 // FIXME(fmease): Hide the trait-object lifetime bound if it coincides with its default
1765 // to partially address #44306. Follow the rules outlined at
1766 // https://doc.rust-lang.org/reference/lifetime-elision.html#default-trait-object-lifetimes
1767 let lifetime = clean_middle_region(*reg);
1768 let mut bounds = dids
1770 let empty = ty::Binder::dummy(InternalSubsts::empty());
1771 let path = external_path(cx, did, false, ThinVec::new(), empty);
1772 inline::record_extern_fqn(cx, did, ItemType::Trait);
1773 PolyTrait { trait_: path, generic_params: Vec::new() }
1775 .collect::<Vec<_>>();
1778 .projection_bounds()
1779 .map(|pb| TypeBinding {
1780 assoc: projection_to_path_segment(
1783 // HACK(compiler-errors): Doesn't actually matter what self
1784 // type we put here, because we're only using the GAT's substs.
1785 .with_self_ty(cx.tcx, cx.tcx.types.self_param)
1790 kind: TypeBindingKind::Equality {
1791 term: clean_middle_term(pb.map_bound(|pb| pb.term), cx),
1796 let late_bound_regions: FxIndexSet<_> = obj
1798 .flat_map(|pb| pb.bound_vars())
1799 .filter_map(|br| match br {
1800 ty::BoundVariableKind::Region(ty::BrNamed(_, name))
1801 if name != kw::UnderscoreLifetime =>
1803 Some(GenericParamDef::lifetime(name))
1808 let late_bound_regions = late_bound_regions.into_iter().collect();
1810 let path = external_path(cx, did, false, bindings, substs);
1811 bounds.insert(0, PolyTrait { trait_: path, generic_params: late_bound_regions });
1813 DynTrait(bounds, lifetime)
1816 Tuple(t.iter().map(|t| clean_middle_ty(bound_ty.rebind(t), cx, None)).collect())
1819 ty::Alias(ty::Projection, ref data) => clean_projection(bound_ty.rebind(*data), cx, def_id),
1821 ty::Param(ref p) => {
1822 if let Some(bounds) = cx.impl_trait_bounds.remove(&p.index.into()) {
1829 ty::Alias(ty::Opaque, ty::AliasTy { def_id, substs, .. }) => {
1830 // Grab the "TraitA + TraitB" from `impl TraitA + TraitB`,
1831 // by looking up the bounds associated with the def_id.
1834 .explicit_item_bounds(def_id)
1836 .map(|(bound, _)| EarlyBinder(*bound).subst(cx.tcx, substs))
1837 .collect::<Vec<_>>();
1838 clean_middle_opaque_bounds(cx, bounds)
1841 ty::Closure(..) => panic!("Closure"),
1842 ty::Generator(..) => panic!("Generator"),
1843 ty::Bound(..) => panic!("Bound"),
1844 ty::Placeholder(..) => panic!("Placeholder"),
1845 ty::GeneratorWitness(..) => panic!("GeneratorWitness"),
1846 ty::GeneratorWitnessMIR(..) => panic!("GeneratorWitnessMIR"),
1847 ty::Infer(..) => panic!("Infer"),
1848 ty::Error(_) => rustc_errors::FatalError.raise(),
1852 fn clean_middle_opaque_bounds<'tcx>(
1853 cx: &mut DocContext<'tcx>,
1854 bounds: Vec<ty::Predicate<'tcx>>,
1856 let mut regions = vec![];
1857 let mut has_sized = false;
1858 let mut bounds = bounds
1860 .filter_map(|bound| {
1861 let bound_predicate = bound.kind();
1862 let trait_ref = match bound_predicate.skip_binder() {
1863 ty::PredicateKind::Clause(ty::Clause::Trait(tr)) => {
1864 bound_predicate.rebind(tr.trait_ref)
1866 ty::PredicateKind::Clause(ty::Clause::TypeOutlives(ty::OutlivesPredicate(
1870 if let Some(r) = clean_middle_region(reg) {
1871 regions.push(GenericBound::Outlives(r));
1878 if let Some(sized) = cx.tcx.lang_items().sized_trait() {
1879 if trait_ref.def_id() == sized {
1885 let bindings: ThinVec<_> = bounds
1887 .filter_map(|bound| {
1888 if let ty::PredicateKind::Clause(ty::Clause::Projection(proj)) =
1889 bound.kind().skip_binder()
1891 if proj.projection_ty.trait_ref(cx.tcx) == trait_ref.skip_binder() {
1893 assoc: projection_to_path_segment(
1894 bound.kind().rebind(proj.projection_ty),
1897 kind: TypeBindingKind::Equality {
1898 term: clean_middle_term(bound.kind().rebind(proj.term), cx),
1910 Some(clean_poly_trait_ref_with_bindings(cx, trait_ref, bindings))
1912 .collect::<Vec<_>>();
1913 bounds.extend(regions);
1914 if !has_sized && !bounds.is_empty() {
1915 bounds.insert(0, GenericBound::maybe_sized(cx));
1920 pub(crate) fn clean_field<'tcx>(field: &hir::FieldDef<'tcx>, cx: &mut DocContext<'tcx>) -> Item {
1921 clean_field_with_def_id(field.def_id.to_def_id(), field.ident.name, clean_ty(field.ty, cx), cx)
1924 pub(crate) fn clean_middle_field<'tcx>(field: &ty::FieldDef, cx: &mut DocContext<'tcx>) -> Item {
1925 clean_field_with_def_id(
1928 clean_middle_ty(ty::Binder::dummy(cx.tcx.type_of(field.did)), cx, Some(field.did)),
1933 pub(crate) fn clean_field_with_def_id(
1937 cx: &mut DocContext<'_>,
1939 Item::from_def_id_and_parts(def_id, Some(name), StructFieldItem(ty), cx)
1942 pub(crate) fn clean_variant_def<'tcx>(variant: &ty::VariantDef, cx: &mut DocContext<'tcx>) -> Item {
1943 let discriminant = match variant.discr {
1944 ty::VariantDiscr::Explicit(def_id) => Some(Discriminant { expr: None, value: def_id }),
1945 ty::VariantDiscr::Relative(_) => None,
1948 let kind = match variant.ctor_kind() {
1949 Some(CtorKind::Const) => VariantKind::CLike,
1950 Some(CtorKind::Fn) => VariantKind::Tuple(
1951 variant.fields.iter().map(|field| clean_middle_field(field, cx)).collect(),
1953 None => VariantKind::Struct(VariantStruct {
1954 fields: variant.fields.iter().map(|field| clean_middle_field(field, cx)).collect(),
1958 Item::from_def_id_and_parts(
1961 VariantItem(Variant { kind, discriminant }),
1966 fn clean_variant_data<'tcx>(
1967 variant: &hir::VariantData<'tcx>,
1968 disr_expr: &Option<hir::AnonConst>,
1969 cx: &mut DocContext<'tcx>,
1971 let discriminant = disr_expr
1972 .map(|disr| Discriminant { expr: Some(disr.body), value: disr.def_id.to_def_id() });
1974 let kind = match variant {
1975 hir::VariantData::Struct(..) => VariantKind::Struct(VariantStruct {
1976 fields: variant.fields().iter().map(|x| clean_field(x, cx)).collect(),
1978 hir::VariantData::Tuple(..) => {
1979 VariantKind::Tuple(variant.fields().iter().map(|x| clean_field(x, cx)).collect())
1981 hir::VariantData::Unit(..) => VariantKind::CLike,
1984 Variant { discriminant, kind }
1987 fn clean_path<'tcx>(path: &hir::Path<'tcx>, cx: &mut DocContext<'tcx>) -> Path {
1990 segments: path.segments.iter().map(|x| clean_path_segment(x, cx)).collect(),
1994 fn clean_generic_args<'tcx>(
1995 generic_args: &hir::GenericArgs<'tcx>,
1996 cx: &mut DocContext<'tcx>,
1998 if generic_args.parenthesized {
1999 let output = clean_ty(generic_args.bindings[0].ty(), cx);
2000 let output = if output != Type::Tuple(Vec::new()) { Some(Box::new(output)) } else { None };
2002 generic_args.inputs().iter().map(|x| clean_ty(x, cx)).collect::<Vec<_>>().into();
2003 GenericArgs::Parenthesized { inputs, output }
2005 let args = generic_args
2008 .map(|arg| match arg {
2009 hir::GenericArg::Lifetime(lt) if !lt.is_anonymous() => {
2010 GenericArg::Lifetime(clean_lifetime(*lt, cx))
2012 hir::GenericArg::Lifetime(_) => GenericArg::Lifetime(Lifetime::elided()),
2013 hir::GenericArg::Type(ty) => GenericArg::Type(clean_ty(ty, cx)),
2014 hir::GenericArg::Const(ct) => GenericArg::Const(Box::new(clean_const(ct, cx))),
2015 hir::GenericArg::Infer(_inf) => GenericArg::Infer,
2017 .collect::<Vec<_>>()
2020 generic_args.bindings.iter().map(|x| clean_type_binding(x, cx)).collect::<ThinVec<_>>();
2021 GenericArgs::AngleBracketed { args, bindings }
2025 fn clean_path_segment<'tcx>(
2026 path: &hir::PathSegment<'tcx>,
2027 cx: &mut DocContext<'tcx>,
2029 PathSegment { name: path.ident.name, args: clean_generic_args(path.args(), cx) }
2032 fn clean_bare_fn_ty<'tcx>(
2033 bare_fn: &hir::BareFnTy<'tcx>,
2034 cx: &mut DocContext<'tcx>,
2035 ) -> BareFunctionDecl {
2036 let (generic_params, decl) = enter_impl_trait(cx, |cx| {
2037 // NOTE: generics must be cleaned before args
2038 let generic_params = bare_fn
2041 .filter(|p| !is_elided_lifetime(p))
2042 .map(|x| clean_generic_param(cx, None, x))
2044 let args = clean_args_from_types_and_names(cx, bare_fn.decl.inputs, bare_fn.param_names);
2045 let decl = clean_fn_decl_with_args(cx, bare_fn.decl, args);
2046 (generic_params, decl)
2048 BareFunctionDecl { unsafety: bare_fn.unsafety, abi: bare_fn.abi, decl, generic_params }
2051 /// This visitor is used to go through only the "top level" of a item and not enter any sub
2052 /// item while looking for a given `Ident` which is stored into `item` if found.
2053 struct OneLevelVisitor<'hir> {
2054 map: rustc_middle::hir::map::Map<'hir>,
2055 item: Option<&'hir hir::Item<'hir>>,
2057 target_def_id: LocalDefId,
2060 impl<'hir> OneLevelVisitor<'hir> {
2061 fn new(map: rustc_middle::hir::map::Map<'hir>, target_def_id: LocalDefId) -> Self {
2062 Self { map, item: None, looking_for: Ident::empty(), target_def_id }
2065 fn reset(&mut self, looking_for: Ident) {
2066 self.looking_for = looking_for;
2071 impl<'hir> hir::intravisit::Visitor<'hir> for OneLevelVisitor<'hir> {
2072 type NestedFilter = rustc_middle::hir::nested_filter::All;
2074 fn nested_visit_map(&mut self) -> Self::Map {
2078 fn visit_item(&mut self, item: &'hir hir::Item<'hir>) {
2079 if self.item.is_none()
2080 && item.ident == self.looking_for
2081 && matches!(item.kind, hir::ItemKind::Use(_, _))
2082 || item.owner_id.def_id == self.target_def_id
2084 self.item = Some(item);
2089 /// Because a `Use` item directly links to the imported item, we need to manually go through each
2090 /// import one by one. To do so, we go to the parent item and look for the `Ident` into it. Then,
2091 /// if we found the "end item" (the imported one), we stop there because we don't need its
2092 /// documentation. Otherwise, we repeat the same operation until we find the "end item".
2093 fn get_all_import_attributes<'hir>(
2094 mut item: &hir::Item<'hir>,
2096 target_def_id: LocalDefId,
2097 attributes: &mut Vec<ast::Attribute>,
2099 let hir_map = tcx.hir();
2100 let mut visitor = OneLevelVisitor::new(hir_map, target_def_id);
2101 let mut visited = FxHashSet::default();
2102 // If the item is an import and has at least a path with two parts, we go into it.
2103 while let hir::ItemKind::Use(path, _) = item.kind &&
2104 path.segments.len() > 1 &&
2105 let hir::def::Res::Def(_, def_id) = path.segments[path.segments.len() - 2].res &&
2106 visited.insert(def_id)
2108 if let Some(hir::Node::Item(parent_item)) = hir_map.get_if_local(def_id) {
2109 // We add the attributes from this import into the list.
2110 attributes.extend_from_slice(hir_map.attrs(item.hir_id()));
2111 // We get the `Ident` we will be looking for into `item`.
2112 let looking_for = path.segments[path.segments.len() - 1].ident;
2113 visitor.reset(looking_for);
2114 hir::intravisit::walk_item(&mut visitor, parent_item);
2115 if let Some(i) = visitor.item {
2126 fn clean_maybe_renamed_item<'tcx>(
2127 cx: &mut DocContext<'tcx>,
2128 item: &hir::Item<'tcx>,
2129 renamed: Option<Symbol>,
2130 import_id: Option<LocalDefId>,
2134 let def_id = item.owner_id.to_def_id();
2135 let mut name = renamed.unwrap_or_else(|| cx.tcx.hir().name(item.hir_id()));
2136 cx.with_param_env(def_id, |cx| {
2137 let kind = match item.kind {
2138 ItemKind::Static(ty, mutability, body_id) => {
2139 StaticItem(Static { type_: clean_ty(ty, cx), mutability, expr: Some(body_id) })
2141 ItemKind::Const(ty, body_id) => ConstantItem(Constant {
2142 type_: clean_ty(ty, cx),
2143 kind: ConstantKind::Local { body: body_id, def_id },
2145 ItemKind::OpaqueTy(ref ty) => OpaqueTyItem(OpaqueTy {
2146 bounds: ty.bounds.iter().filter_map(|x| clean_generic_bound(x, cx)).collect(),
2147 generics: clean_generics(ty.generics, cx),
2149 ItemKind::TyAlias(hir_ty, generics) => {
2150 let rustdoc_ty = clean_ty(hir_ty, cx);
2151 let ty = clean_middle_ty(ty::Binder::dummy(hir_ty_to_ty(cx.tcx, hir_ty)), cx, None);
2152 TypedefItem(Box::new(Typedef {
2154 generics: clean_generics(generics, cx),
2155 item_type: Some(ty),
2158 ItemKind::Enum(ref def, generics) => EnumItem(Enum {
2159 variants: def.variants.iter().map(|v| clean_variant(v, cx)).collect(),
2160 generics: clean_generics(generics, cx),
2162 ItemKind::TraitAlias(generics, bounds) => TraitAliasItem(TraitAlias {
2163 generics: clean_generics(generics, cx),
2164 bounds: bounds.iter().filter_map(|x| clean_generic_bound(x, cx)).collect(),
2166 ItemKind::Union(ref variant_data, generics) => UnionItem(Union {
2167 generics: clean_generics(generics, cx),
2168 fields: variant_data.fields().iter().map(|x| clean_field(x, cx)).collect(),
2170 ItemKind::Struct(ref variant_data, generics) => StructItem(Struct {
2171 ctor_kind: variant_data.ctor_kind(),
2172 generics: clean_generics(generics, cx),
2173 fields: variant_data.fields().iter().map(|x| clean_field(x, cx)).collect(),
2175 ItemKind::Impl(impl_) => return clean_impl(impl_, item.owner_id.def_id, cx),
2176 // proc macros can have a name set by attributes
2177 ItemKind::Fn(ref sig, generics, body_id) => {
2178 clean_fn_or_proc_macro(item, sig, generics, body_id, &mut name, cx)
2180 ItemKind::Macro(ref macro_def, _) => {
2181 let ty_vis = cx.tcx.visibility(def_id);
2183 source: display_macro_source(cx, name, macro_def, def_id, ty_vis),
2186 ItemKind::Trait(_, _, generics, bounds, item_ids) => {
2187 let items = item_ids
2189 .map(|ti| clean_trait_item(cx.tcx.hir().trait_item(ti.id), cx))
2192 TraitItem(Box::new(Trait {
2195 generics: clean_generics(generics, cx),
2196 bounds: bounds.iter().filter_map(|x| clean_generic_bound(x, cx)).collect(),
2199 ItemKind::ExternCrate(orig_name) => {
2200 return clean_extern_crate(item, name, orig_name, cx);
2202 ItemKind::Use(path, kind) => {
2203 return clean_use_statement(item, name, path, kind, cx, &mut FxHashSet::default());
2205 _ => unreachable!("not yet converted"),
2208 let mut extra_attrs = Vec::new();
2209 if let Some(hir::Node::Item(use_node)) =
2210 import_id.and_then(|def_id| cx.tcx.hir().find_by_def_id(def_id))
2212 // We get all the various imports' attributes.
2213 get_all_import_attributes(use_node, cx.tcx, item.owner_id.def_id, &mut extra_attrs);
2216 if !extra_attrs.is_empty() {
2217 extra_attrs.extend_from_slice(inline::load_attrs(cx, def_id));
2218 let attrs = Attributes::from_ast(&extra_attrs);
2219 let cfg = extra_attrs.cfg(cx.tcx, &cx.cache.hidden_cfg);
2221 vec![Item::from_def_id_and_attrs_and_parts(
2229 vec![Item::from_def_id_and_parts(def_id, Some(name), kind, cx)]
2234 fn clean_variant<'tcx>(variant: &hir::Variant<'tcx>, cx: &mut DocContext<'tcx>) -> Item {
2235 let kind = VariantItem(clean_variant_data(&variant.data, &variant.disr_expr, cx));
2236 Item::from_def_id_and_parts(variant.def_id.to_def_id(), Some(variant.ident.name), kind, cx)
2239 fn clean_impl<'tcx>(
2240 impl_: &hir::Impl<'tcx>,
2242 cx: &mut DocContext<'tcx>,
2245 let mut ret = Vec::new();
2246 let trait_ = impl_.of_trait.as_ref().map(|t| clean_trait_ref(t, cx));
2250 .map(|ii| clean_impl_item(tcx.hir().impl_item(ii.id), cx))
2251 .collect::<Vec<_>>();
2253 // If this impl block is an implementation of the Deref trait, then we
2254 // need to try inlining the target's inherent impl blocks as well.
2255 if trait_.as_ref().map(|t| t.def_id()) == tcx.lang_items().deref_trait() {
2256 build_deref_target_impls(cx, &items, &mut ret);
2259 let for_ = clean_ty(impl_.self_ty, cx);
2260 let type_alias = for_.def_id(&cx.cache).and_then(|did| match tcx.def_kind(did) {
2261 DefKind::TyAlias => {
2262 Some(clean_middle_ty(ty::Binder::dummy(tcx.type_of(did)), cx, Some(did)))
2266 let mut make_item = |trait_: Option<Path>, for_: Type, items: Vec<Item>| {
2267 let kind = ImplItem(Box::new(Impl {
2268 unsafety: impl_.unsafety,
2269 generics: clean_generics(impl_.generics, cx),
2273 polarity: tcx.impl_polarity(def_id),
2274 kind: if utils::has_doc_flag(tcx, def_id.to_def_id(), sym::fake_variadic) {
2275 ImplKind::FakeVaradic
2280 Item::from_def_id_and_parts(def_id.to_def_id(), None, kind, cx)
2282 if let Some(type_alias) = type_alias {
2283 ret.push(make_item(trait_.clone(), type_alias, items.clone()));
2285 ret.push(make_item(trait_, for_, items));
2289 fn clean_extern_crate<'tcx>(
2290 krate: &hir::Item<'tcx>,
2292 orig_name: Option<Symbol>,
2293 cx: &mut DocContext<'tcx>,
2295 // this is the ID of the `extern crate` statement
2296 let cnum = cx.tcx.extern_mod_stmt_cnum(krate.owner_id.def_id).unwrap_or(LOCAL_CRATE);
2297 // this is the ID of the crate itself
2298 let crate_def_id = cnum.as_def_id();
2299 let attrs = cx.tcx.hir().attrs(krate.hir_id());
2300 let ty_vis = cx.tcx.visibility(krate.owner_id);
2301 let please_inline = ty_vis.is_public()
2302 && attrs.iter().any(|a| {
2303 a.has_name(sym::doc)
2304 && match a.meta_item_list() {
2305 Some(l) => attr::list_contains_name(&l, sym::inline),
2310 let krate_owner_def_id = krate.owner_id.to_def_id();
2312 let mut visited = DefIdSet::default();
2314 let res = Res::Def(DefKind::Mod, crate_def_id);
2316 if let Some(items) = inline::try_inline(
2318 cx.tcx.parent_module(krate.hir_id()).to_def_id(),
2319 Some(krate_owner_def_id),
2329 // FIXME: using `from_def_id_and_kind` breaks `rustdoc/masked` for some reason
2332 attrs: Box::new(Attributes::from_ast(attrs)),
2333 item_id: crate_def_id.into(),
2334 kind: Box::new(ExternCrateItem { src: orig_name }),
2335 cfg: attrs.cfg(cx.tcx, &cx.cache.hidden_cfg),
2336 inline_stmt_id: Some(krate_owner_def_id),
2340 fn clean_use_statement<'tcx>(
2341 import: &hir::Item<'tcx>,
2343 path: &hir::UsePath<'tcx>,
2345 cx: &mut DocContext<'tcx>,
2346 inlined_names: &mut FxHashSet<(ItemType, Symbol)>,
2348 let mut items = Vec::new();
2349 let hir::UsePath { segments, ref res, span } = *path;
2351 if let Res::Def(DefKind::Ctor(..), _) | Res::SelfCtor(..) = res {
2354 let path = hir::Path { segments, res, span };
2355 items.append(&mut clean_use_statement_inner(import, name, &path, kind, cx, inlined_names));
2360 fn clean_use_statement_inner<'tcx>(
2361 import: &hir::Item<'tcx>,
2363 path: &hir::Path<'tcx>,
2365 cx: &mut DocContext<'tcx>,
2366 inlined_names: &mut FxHashSet<(ItemType, Symbol)>,
2368 // We need this comparison because some imports (for std types for example)
2369 // are "inserted" as well but directly by the compiler and they should not be
2370 // taken into account.
2371 if import.span.ctxt().outer_expn_data().kind == ExpnKind::AstPass(AstPass::StdImports) {
2375 let visibility = cx.tcx.visibility(import.owner_id);
2376 let attrs = cx.tcx.hir().attrs(import.hir_id());
2377 let inline_attr = attrs.lists(sym::doc).get_word_attr(sym::inline);
2378 let pub_underscore = visibility.is_public() && name == kw::Underscore;
2379 let current_mod = cx.tcx.parent_module_from_def_id(import.owner_id.def_id);
2381 // The parent of the module in which this import resides. This
2382 // is the same as `current_mod` if that's already the top
2384 let parent_mod = cx.tcx.parent_module_from_def_id(current_mod);
2386 // This checks if the import can be seen from a higher level module.
2387 // In other words, it checks if the visibility is the equivalent of
2388 // `pub(super)` or higher. If the current module is the top level
2389 // module, there isn't really a parent module, which makes the results
2390 // meaningless. In this case, we make sure the answer is `false`.
2391 let is_visible_from_parent_mod =
2392 visibility.is_accessible_from(parent_mod, cx.tcx) && !current_mod.is_top_level_module();
2395 if let Some(ref inline) = inline_attr {
2396 rustc_errors::struct_span_err!(
2400 "anonymous imports cannot be inlined"
2402 .span_label(import.span, "anonymous import")
2407 // We consider inlining the documentation of `pub use` statements, but we
2408 // forcefully don't inline if this is not public or if the
2409 // #[doc(no_inline)] attribute is present.
2410 // Don't inline doc(hidden) imports so they can be stripped at a later stage.
2411 let mut denied = cx.output_format.is_json()
2412 || !(visibility.is_public()
2413 || (cx.render_options.document_private && is_visible_from_parent_mod))
2415 || attrs.iter().any(|a| {
2416 a.has_name(sym::doc)
2417 && match a.meta_item_list() {
2419 attr::list_contains_name(&l, sym::no_inline)
2420 || attr::list_contains_name(&l, sym::hidden)
2426 // Also check whether imports were asked to be inlined, in case we're trying to re-export a
2427 // crate in Rust 2018+
2428 let path = clean_path(path, cx);
2429 let inner = if kind == hir::UseKind::Glob {
2431 let mut visited = DefIdSet::default();
2432 if let Some(items) =
2433 inline::try_inline_glob(cx, path.res, current_mod, &mut visited, inlined_names)
2438 Import::new_glob(resolve_use_source(cx, path), true)
2440 if inline_attr.is_none() {
2441 if let Res::Def(DefKind::Mod, did) = path.res {
2442 if !did.is_local() && did.is_crate_root() {
2443 // if we're `pub use`ing an extern crate root, don't inline it unless we
2444 // were specifically asked for it
2450 let mut visited = DefIdSet::default();
2451 let import_def_id = import.owner_id.to_def_id();
2453 if let Some(mut items) = inline::try_inline(
2455 cx.tcx.parent_module(import.hir_id()).to_def_id(),
2456 Some(import_def_id),
2462 items.push(Item::from_def_id_and_parts(
2465 ImportItem(Import::new_simple(name, resolve_use_source(cx, path), false)),
2471 Import::new_simple(name, resolve_use_source(cx, path), true)
2474 vec![Item::from_def_id_and_parts(import.owner_id.to_def_id(), None, ImportItem(inner), cx)]
2477 fn clean_maybe_renamed_foreign_item<'tcx>(
2478 cx: &mut DocContext<'tcx>,
2479 item: &hir::ForeignItem<'tcx>,
2480 renamed: Option<Symbol>,
2482 let def_id = item.owner_id.to_def_id();
2483 cx.with_param_env(def_id, |cx| {
2484 let kind = match item.kind {
2485 hir::ForeignItemKind::Fn(decl, names, generics) => {
2486 let (generics, decl) = enter_impl_trait(cx, |cx| {
2487 // NOTE: generics must be cleaned before args
2488 let generics = clean_generics(generics, cx);
2489 let args = clean_args_from_types_and_names(cx, decl.inputs, names);
2490 let decl = clean_fn_decl_with_args(cx, decl, args);
2493 ForeignFunctionItem(Box::new(Function { decl, generics }))
2495 hir::ForeignItemKind::Static(ty, mutability) => {
2496 ForeignStaticItem(Static { type_: clean_ty(ty, cx), mutability, expr: None })
2498 hir::ForeignItemKind::Type => ForeignTypeItem,
2501 Item::from_def_id_and_parts(
2502 item.owner_id.def_id.to_def_id(),
2503 Some(renamed.unwrap_or(item.ident.name)),
2510 fn clean_type_binding<'tcx>(
2511 type_binding: &hir::TypeBinding<'tcx>,
2512 cx: &mut DocContext<'tcx>,
2515 assoc: PathSegment {
2516 name: type_binding.ident.name,
2517 args: clean_generic_args(type_binding.gen_args, cx),
2519 kind: match type_binding.kind {
2520 hir::TypeBindingKind::Equality { ref term } => {
2521 TypeBindingKind::Equality { term: clean_hir_term(term, cx) }
2523 hir::TypeBindingKind::Constraint { bounds } => TypeBindingKind::Constraint {
2524 bounds: bounds.iter().filter_map(|b| clean_generic_bound(b, cx)).collect(),