3 use rustc_hir::def_id::DefId;
4 use rustc_middle::ty::query::Providers;
5 use rustc_middle::ty::subst::GenericArgKind;
6 use rustc_middle::ty::{self, CratePredicatesMap, ToPredicate, TyCtxt};
7 use rustc_span::symbol::sym;
12 crate mod outlives_bounds;
13 /// Code to write unit test for outlives.
17 pub fn provide(providers: &mut Providers) {
18 *providers = Providers { inferred_outlives_of, inferred_outlives_crate, ..*providers };
21 fn inferred_outlives_of(tcx: TyCtxt<'_>, item_def_id: DefId) -> &[(ty::Predicate<'_>, Span)] {
22 let id = tcx.hir().local_def_id_to_hir_id(item_def_id.expect_local());
24 if matches!(tcx.def_kind(item_def_id), hir::def::DefKind::AnonConst) && tcx.lazy_normalization()
26 if tcx.hir().opt_const_param_default_param_hir_id(id).is_some() {
27 // In `generics_of` we set the generics' parent to be our parent's parent which means that
28 // we lose out on the predicates of our actual parent if we dont return those predicates here.
29 // (See comment in `generics_of` for more information on why the parent shenanigans is necessary)
31 // struct Foo<'a, 'b, const N: usize = { ... }>(&'a &'b ());
32 // ^^^ ^^^^^^^ the def id we are calling
33 // ^^^ inferred_outlives_of on
34 // parent item we dont have set as the
35 // parent of generics returned by `generics_of`
37 // In the above code we want the anon const to have predicates in its param env for `'b: 'a`
38 let item_def_id = tcx.hir().get_parent_item(id);
39 // In the above code example we would be calling `inferred_outlives_of(Foo)` here
40 return tcx.inferred_outlives_of(item_def_id);
44 match tcx.hir().get(id) {
45 Node::Item(item) => match item.kind {
46 hir::ItemKind::Struct(..) | hir::ItemKind::Enum(..) | hir::ItemKind::Union(..) => {
47 let crate_map = tcx.inferred_outlives_crate(());
49 let predicates = crate_map.predicates.get(&item_def_id).copied().unwrap_or(&[]);
51 if tcx.has_attr(item_def_id, sym::rustc_outlives) {
52 let mut pred: Vec<String> = predicates
54 .map(|(out_pred, _)| match out_pred.kind().skip_binder() {
55 ty::PredicateKind::RegionOutlives(p) => p.to_string(),
56 ty::PredicateKind::TypeOutlives(p) => p.to_string(),
57 err => bug!("unexpected predicate {:?}", err),
62 let span = tcx.def_span(item_def_id);
63 let mut err = tcx.sess.struct_span_err(span, "rustc_outlives");
70 debug!("inferred_outlives_of({:?}) = {:?}", item_def_id, predicates);
82 fn inferred_outlives_crate(tcx: TyCtxt<'_>, (): ()) -> CratePredicatesMap<'_> {
83 // Compute a map from each struct/enum/union S to the **explicit**
84 // outlives predicates (`T: 'a`, `'a: 'b`) that the user wrote.
85 // Typically there won't be many of these, except in older code where
86 // they were mandatory. Nonetheless, we have to ensure that every such
87 // predicate is satisfied, so they form a kind of base set of requirements
90 // Compute the inferred predicates
91 let mut exp_map = explicit::ExplicitPredicatesMap::new();
93 let global_inferred_outlives = implicit_infer::infer_predicates(tcx, &mut exp_map);
95 // Convert the inferred predicates into the "collected" form the
96 // global data structure expects.
98 // FIXME -- consider correcting impedance mismatch in some way,
99 // probably by updating the global data structure.
100 let predicates = global_inferred_outlives
102 .map(|(&def_id, set)| {
103 let predicates = &*tcx.arena.alloc_from_iter(set.iter().filter_map(
104 |(ty::OutlivesPredicate(kind1, region2), &span)| {
105 match kind1.unpack() {
106 GenericArgKind::Type(ty1) => Some((
107 ty::Binder::dummy(ty::PredicateKind::TypeOutlives(
108 ty::OutlivesPredicate(ty1, *region2),
113 GenericArgKind::Lifetime(region1) => Some((
114 ty::Binder::dummy(ty::PredicateKind::RegionOutlives(
115 ty::OutlivesPredicate(region1, *region2),
120 GenericArgKind::Const(_) => {
121 // Generic consts don't impose any constraints.
131 ty::CratePredicatesMap { predicates }