rust/src/librustdoc/clean/inline.rs

556 lines
20 KiB
Rust
Raw Normal View History

// Copyright 2012-2013 The Rust Project Developers. See the COPYRIGHT
// file at the top-level directory of this distribution and at
// http://rust-lang.org/COPYRIGHT.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
//! Support for inlining external documentation into the current AST.
use std::collections::HashSet;
use syntax::ast;
use syntax::attr::AttrMetaMethods;
2016-03-29 08:50:44 +03:00
use rustc::hir;
2015-11-25 01:23:22 +02:00
use rustc::middle::cstore::{self, CrateStore};
use rustc::hir::def::Def;
use rustc::hir::def_id::DefId;
use rustc::ty::{self, TyCtxt};
use rustc::ty::subst;
use rustc::middle::stability;
use rustc_const_eval::lookup_const_by_id;
use core::DocContext;
use doctree;
use clean::{self, Attributes, GetDefId};
use super::{Clean, ToSource};
/// Attempt to inline the definition of a local node id into this AST.
///
/// This function will fetch the definition of the id specified, and if it is
/// from another crate it will attempt to inline the documentation from the
/// other crate into this crate.
///
/// This is primarily used for `pub use` statements which are, in general,
/// implementation details. Inlining the documentation should help provide a
/// better experience when reading the documentation in this use case.
///
/// The returned value is `None` if the `id` could not be inlined, and `Some`
/// of a vector of items if it was successfully expanded.
pub fn try_inline(cx: &DocContext, id: ast::NodeId, into: Option<ast::Name>)
-> Option<Vec<clean::Item>> {
let tcx = match cx.tcx_opt() {
Some(tcx) => tcx,
None => return None,
};
2014-11-06 12:25:16 -05:00
let def = match tcx.def_map.borrow().get(&id) {
Some(d) => d.full_def(),
None => return None,
};
let did = def.def_id();
2015-08-16 06:32:28 -04:00
if did.is_local() { return None }
try_inline_def(cx, tcx, def).map(|vec| {
2014-09-14 20:27:36 -07:00
vec.into_iter().map(|mut item| {
match into {
Some(into) if item.name.is_some() => {
item.name = Some(into.clean(cx));
}
_ => {}
}
item
}).collect()
})
}
2016-02-29 23:36:51 +00:00
fn try_inline_def(cx: &DocContext, tcx: &TyCtxt,
def: Def) -> Option<Vec<clean::Item>> {
let mut ret = Vec::new();
let did = def.def_id();
let inner = match def {
Def::Trait(did) => {
record_extern_fqn(cx, did, clean::TypeTrait);
clean::TraitItem(build_external_trait(cx, tcx, did))
}
Def::Fn(did) => {
record_extern_fqn(cx, did, clean::TypeFunction);
2014-10-31 15:00:35 +13:00
clean::FunctionItem(build_external_function(cx, tcx, did))
}
Def::Struct(did)
// If this is a struct constructor, we skip it
if tcx.sess.cstore.tuple_struct_definition_if_ctor(did).is_none() => {
record_extern_fqn(cx, did, clean::TypeStruct);
ret.extend(build_impls(cx, tcx, did));
clean::StructItem(build_struct(cx, tcx, did))
}
Def::TyAlias(did) => {
record_extern_fqn(cx, did, clean::TypeTypedef);
ret.extend(build_impls(cx, tcx, did));
build_type(cx, tcx, did)
}
Def::Enum(did) => {
record_extern_fqn(cx, did, clean::TypeEnum);
ret.extend(build_impls(cx, tcx, did));
build_type(cx, tcx, did)
}
// Assume that the enum type is reexported next to the variant, and
// variants don't show up in documentation specially.
Def::Variant(..) => return Some(Vec::new()),
Def::Mod(did) => {
record_extern_fqn(cx, did, clean::TypeModule);
clean::ModuleItem(build_module(cx, tcx, did))
}
Def::Static(did, mtbl) => {
record_extern_fqn(cx, did, clean::TypeStatic);
clean::StaticItem(build_static(cx, tcx, did, mtbl))
}
Def::Const(did) | Def::AssociatedConst(did) => {
record_extern_fqn(cx, did, clean::TypeConst);
clean::ConstantItem(build_const(cx, tcx, did))
}
_ => return None,
};
2014-08-18 17:52:38 -07:00
cx.inlined.borrow_mut().as_mut().unwrap().insert(did);
ret.push(clean::Item {
source: clean::Span::empty(),
name: Some(tcx.item_name(did).to_string()),
attrs: load_attrs(cx, tcx, did),
inner: inner,
2015-07-31 00:04:06 -07:00
visibility: Some(hir::Public),
stability: stability::lookup_stability(tcx, did).clean(cx),
2015-12-12 23:01:27 +03:00
deprecation: stability::lookup_deprecation(tcx, did).clean(cx),
def_id: did,
});
Some(ret)
}
2016-02-29 23:36:51 +00:00
pub fn load_attrs(cx: &DocContext, tcx: &TyCtxt,
2015-08-16 06:32:28 -04:00
did: DefId) -> Vec<clean::Attribute> {
2015-11-22 21:02:04 +02:00
tcx.get_attrs(did).iter().map(|a| a.clean(cx)).collect()
}
/// Record an external fully qualified name in the external_paths cache.
///
/// These names are used later on by HTML rendering to generate things like
/// source links back to the original item.
2015-08-16 06:32:28 -04:00
pub fn record_extern_fqn(cx: &DocContext, did: DefId, kind: clean::TypeKind) {
2016-02-28 12:11:13 +01:00
if let Some(tcx) = cx.tcx_opt() {
let fqn = tcx.sess.cstore.extern_item_path(did);
let fqn = fqn.into_iter().map(|i| i.to_string()).collect();
cx.external_paths.borrow_mut().as_mut().unwrap().insert(did, (fqn, kind));
}
}
2016-02-29 23:36:51 +00:00
pub fn build_external_trait(cx: &DocContext, tcx: &TyCtxt,
2015-08-16 06:32:28 -04:00
did: DefId) -> clean::Trait {
let def = tcx.lookup_trait_def(did);
let trait_items = tcx.trait_items(did).clean(cx);
let predicates = tcx.lookup_predicates(did);
let generics = (&def.generics, &predicates, subst::TypeSpace).clean(cx);
let generics = filter_non_trait_generics(did, generics);
let (generics, supertrait_bounds) = separate_supertrait_bounds(generics);
clean::Trait {
unsafety: def.unsafety,
generics: generics,
items: trait_items,
bounds: supertrait_bounds,
}
}
2016-02-29 23:36:51 +00:00
fn build_external_function(cx: &DocContext, tcx: &TyCtxt, did: DefId) -> clean::Function {
let t = tcx.lookup_item_type(did);
let (decl, style, abi) = match t.ty.sty {
ty::TyFnDef(_, _, ref f) => ((did, &f.sig).clean(cx), f.unsafety, f.abi),
2014-10-31 15:00:35 +13:00
_ => panic!("bad function"),
};
2015-11-25 17:02:59 +02:00
let constness = if tcx.sess.cstore.is_const_fn(did) {
hir::Constness::Const
} else {
hir::Constness::NotConst
};
let predicates = tcx.lookup_predicates(did);
clean::Function {
2014-10-31 15:00:35 +13:00
decl: decl,
generics: (&t.generics, &predicates, subst::FnSpace).clean(cx),
2014-12-09 10:36:46 -05:00
unsafety: style,
constness: constness,
abi: abi,
}
}
2016-02-29 23:36:51 +00:00
fn build_struct(cx: &DocContext, tcx: &TyCtxt, did: DefId) -> clean::Struct {
let t = tcx.lookup_item_type(did);
let predicates = tcx.lookup_predicates(did);
let variant = tcx.lookup_adt_def(did).struct_variant();
clean::Struct {
struct_type: match &*variant.fields {
[] => doctree::Unit,
[_] if variant.kind == ty::VariantKind::Tuple => doctree::Newtype,
[..] if variant.kind == ty::VariantKind::Tuple => doctree::Tuple,
_ => doctree::Plain,
},
generics: (&t.generics, &predicates, subst::TypeSpace).clean(cx),
fields: variant.fields.clean(cx),
fields_stripped: false,
}
}
2016-02-29 23:36:51 +00:00
fn build_type(cx: &DocContext, tcx: &TyCtxt, did: DefId) -> clean::ItemEnum {
let t = tcx.lookup_item_type(did);
let predicates = tcx.lookup_predicates(did);
match t.ty.sty {
2015-11-22 21:02:04 +02:00
ty::TyEnum(edef, _) if !tcx.sess.cstore.is_typedef(did) => {
return clean::EnumItem(clean::Enum {
generics: (&t.generics, &predicates, subst::TypeSpace).clean(cx),
variants_stripped: false,
variants: edef.variants.clean(cx),
})
}
_ => {}
}
clean::TypedefItem(clean::Typedef {
type_: t.ty.clean(cx),
generics: (&t.generics, &predicates, subst::TypeSpace).clean(cx),
}, false)
}
pub fn build_impls(cx: &DocContext,
tcx: &TyCtxt,
2015-08-16 06:32:28 -04:00
did: DefId) -> Vec<clean::Item> {
tcx.populate_inherent_implementations_for_type_if_necessary(did);
let mut impls = Vec::new();
2016-02-28 12:11:13 +01:00
if let Some(i) = tcx.inherent_impls.borrow().get(&did) {
for &did in i.iter() {
build_impl(cx, tcx, did, &mut impls);
}
}
// If this is the first time we've inlined something from this crate, then
// we inline *all* impls from the crate into this crate. Note that there's
// currently no way for us to filter this based on type, and we likely need
// many impls for a variety of reasons.
//
// Primarily, the impls will be used to populate the documentation for this
// type being inlined, but impls can also be used when generating
// documentation for primitives (no way to find those specifically).
if !cx.all_crate_impls.borrow_mut().contains_key(&did.krate) {
let mut impls = Vec::new();
2015-11-22 21:02:04 +02:00
for item in tcx.sess.cstore.crate_top_level_items(did.krate) {
populate_impls(cx, tcx, item.def, &mut impls);
}
cx.all_crate_impls.borrow_mut().insert(did.krate, impls);
2016-02-29 23:36:51 +00:00
fn populate_impls(cx: &DocContext, tcx: &TyCtxt,
2015-11-25 01:23:22 +02:00
def: cstore::DefLike,
impls: &mut Vec<clean::Item>) {
match def {
2015-11-25 01:23:22 +02:00
cstore::DlImpl(did) => build_impl(cx, tcx, did, impls),
cstore::DlDef(Def::Mod(did)) => {
// Don't recurse if this is a #[doc(hidden)] module
if load_attrs(cx, tcx, did).list("doc").has_word("hidden") {
return;
}
2015-11-22 21:02:04 +02:00
for item in tcx.sess.cstore.item_children(did) {
populate_impls(cx, tcx, item.def, impls)
}
}
_ => {}
}
}
}
let mut candidates = cx.all_crate_impls.borrow_mut();
let candidates = candidates.get_mut(&did.krate).unwrap();
for i in (0..candidates.len()).rev() {
let remove = match candidates[i].inner {
clean::ImplItem(ref i) => {
i.for_.def_id() == Some(did) || i.for_.primitive_type().is_some()
}
_ => continue,
};
if remove {
impls.push(candidates.swap_remove(i));
}
}
return impls;
}
pub fn build_impl(cx: &DocContext,
2016-02-29 23:36:51 +00:00
tcx: &TyCtxt,
2015-08-16 06:32:28 -04:00
did: DefId,
ret: &mut Vec<clean::Item>) {
2014-08-18 17:52:38 -07:00
if !cx.inlined.borrow_mut().as_mut().unwrap().insert(did) {
return
}
let attrs = load_attrs(cx, tcx, did);
2015-11-22 21:02:04 +02:00
let associated_trait = tcx.impl_trait_ref(did);
if let Some(ref t) = associated_trait {
// If this is an impl for a #[doc(hidden)] trait, be sure to not inline
let trait_attrs = load_attrs(cx, tcx, t.def_id);
if trait_attrs.list("doc").has_word("hidden") {
return
}
}
// If this is a defaulted impl, then bail out early here
2015-11-22 21:02:04 +02:00
if tcx.sess.cstore.is_default_impl(did) {
return ret.push(clean::Item {
inner: clean::DefaultImplItem(clean::DefaultImpl {
// FIXME: this should be decoded
2015-07-31 00:04:06 -07:00
unsafety: hir::Unsafety::Normal,
trait_: match associated_trait.as_ref().unwrap().clean(cx) {
clean::TraitBound(polyt, _) => polyt.trait_,
clean::RegionBound(..) => unreachable!(),
},
}),
source: clean::Span::empty(),
name: None,
attrs: attrs,
2015-07-31 00:04:06 -07:00
visibility: Some(hir::Inherited),
stability: stability::lookup_stability(tcx, did).clean(cx),
2015-12-12 23:01:27 +03:00
deprecation: stability::lookup_deprecation(tcx, did).clean(cx),
def_id: did,
});
}
let predicates = tcx.lookup_predicates(did);
2015-11-22 21:02:04 +02:00
let trait_items = tcx.sess.cstore.impl_items(did)
.iter()
.filter_map(|did| {
let did = did.def_id();
let impl_item = tcx.impl_or_trait_item(did);
match impl_item {
ty::ConstTraitItem(ref assoc_const) => {
let did = assoc_const.def_id;
let type_scheme = tcx.lookup_item_type(did);
let default = if assoc_const.has_value {
Some(lookup_const_by_id(tcx, did, None)
2016-03-04 12:33:23 +01:00
.unwrap().0.span.to_src(cx))
} else {
None
};
Some(clean::Item {
name: Some(assoc_const.name.clean(cx)),
inner: clean::AssociatedConstItem(
type_scheme.ty.clean(cx),
default,
),
source: clean::Span::empty(),
attrs: vec![],
visibility: None,
stability: stability::lookup_stability(tcx, did).clean(cx),
2015-12-12 23:01:27 +03:00
deprecation: stability::lookup_deprecation(tcx, did).clean(cx),
def_id: did
})
}
ty::MethodTraitItem(method) => {
2015-07-31 00:04:06 -07:00
if method.vis != hir::Public && associated_trait.is_none() {
return None
}
let mut item = method.clean(cx);
item.inner = match item.inner.clone() {
clean::TyMethodItem(clean::TyMethod {
unsafety, decl, self_, generics, abi
}) => {
2015-11-25 17:02:59 +02:00
let constness = if tcx.sess.cstore.is_const_fn(did) {
hir::Constness::Const
} else {
hir::Constness::NotConst
};
clean::MethodItem(clean::Method {
2014-12-09 10:36:46 -05:00
unsafety: unsafety,
constness: constness,
decl: decl,
self_: self_,
generics: generics,
abi: abi
})
}
_ => panic!("not a tymethod"),
};
Some(item)
}
ty::TypeTraitItem(ref assoc_ty) => {
let did = assoc_ty.def_id;
let type_scheme = ty::TypeScheme {
ty: assoc_ty.ty.unwrap(),
generics: ty::Generics::empty()
};
// Not sure the choice of ParamSpace actually matters here,
// because an associated type won't have generics on the LHS
let typedef = (type_scheme, ty::GenericPredicates::empty(),
subst::ParamSpace::TypeSpace).clean(cx);
Some(clean::Item {
name: Some(assoc_ty.name.clean(cx)),
inner: clean::TypedefItem(typedef, true),
source: clean::Span::empty(),
attrs: vec![],
visibility: None,
stability: stability::lookup_stability(tcx, did).clean(cx),
2015-12-12 23:01:27 +03:00
deprecation: stability::lookup_deprecation(tcx, did).clean(cx),
def_id: did
})
}
}
}).collect::<Vec<_>>();
2015-11-22 21:02:04 +02:00
let polarity = tcx.trait_impl_polarity(did);
let ty = tcx.lookup_item_type(did);
let trait_ = associated_trait.clean(cx).map(|bound| {
match bound {
clean::TraitBound(polyt, _) => polyt.trait_,
clean::RegionBound(..) => unreachable!(),
}
});
if trait_.def_id() == cx.deref_trait_did.get() {
super::build_deref_target_impls(cx, &trait_items, ret);
}
let provided = trait_.def_id().map(|did| {
cx.tcx().provided_trait_methods(did)
.into_iter()
.map(|meth| meth.name.to_string())
.collect()
}).unwrap_or(HashSet::new());
ret.push(clean::Item {
inner: clean::ImplItem(clean::Impl {
2015-07-31 00:04:06 -07:00
unsafety: hir::Unsafety::Normal, // FIXME: this should be decoded
derived: clean::detect_derived(&attrs),
provided_trait_methods: provided,
trait_: trait_,
for_: ty.ty.clean(cx),
generics: (&ty.generics, &predicates, subst::TypeSpace).clean(cx),
items: trait_items,
polarity: polarity.map(|p| { p.clean(cx) }),
}),
source: clean::Span::empty(),
name: None,
attrs: attrs,
2015-07-31 00:04:06 -07:00
visibility: Some(hir::Inherited),
stability: stability::lookup_stability(tcx, did).clean(cx),
2015-12-12 23:01:27 +03:00
deprecation: stability::lookup_deprecation(tcx, did).clean(cx),
def_id: did,
});
}
2016-02-29 23:36:51 +00:00
fn build_module(cx: &DocContext, tcx: &TyCtxt,
2015-08-16 06:32:28 -04:00
did: DefId) -> clean::Module {
let mut items = Vec::new();
fill_in(cx, tcx, did, &mut items);
return clean::Module {
items: items,
is_crate: false,
};
2016-02-29 23:36:51 +00:00
fn fill_in(cx: &DocContext, tcx: &TyCtxt, did: DefId,
items: &mut Vec<clean::Item>) {
// If we're reexporting a reexport it may actually reexport something in
// two namespaces, so the target may be listed twice. Make sure we only
// visit each node at most once.
let mut visited = HashSet::new();
2015-11-22 21:02:04 +02:00
for item in tcx.sess.cstore.item_children(did) {
match item.def {
cstore::DlDef(Def::ForeignMod(did)) => {
fill_in(cx, tcx, did, items);
}
2015-11-25 01:23:22 +02:00
cstore::DlDef(def) if item.vis == hir::Public => {
2016-01-13 13:01:14 +00:00
if !visited.insert(def) { continue }
2016-02-28 12:11:13 +01:00
if let Some(i) = try_inline_def(cx, tcx, def) {
items.extend(i)
}
}
2015-11-25 01:23:22 +02:00
cstore::DlDef(..) => {}
// All impls were inlined above
2015-11-25 01:23:22 +02:00
cstore::DlImpl(..) => {}
cstore::DlField => panic!("unimplemented field"),
}
2015-11-22 21:02:04 +02:00
}
}
}
2016-02-29 23:36:51 +00:00
fn build_const(cx: &DocContext, tcx: &TyCtxt,
2015-08-16 06:32:28 -04:00
did: DefId) -> clean::Constant {
2016-03-29 08:50:44 +03:00
use rustc::hir::print as pprust;
let (expr, ty) = lookup_const_by_id(tcx, did, None).unwrap_or_else(|| {
panic!("expected lookup_const_by_id to succeed for {:?}", did);
});
debug!("converting constant expr {:?} to snippet", expr);
let sn = pprust::expr_to_string(expr);
debug!("got snippet {}", sn);
clean::Constant {
2016-03-04 12:33:23 +01:00
type_: ty.map(|t| t.clean(cx)).unwrap_or_else(|| tcx.lookup_item_type(did).ty.clean(cx)),
expr: sn
}
}
2016-02-29 23:36:51 +00:00
fn build_static(cx: &DocContext, tcx: &TyCtxt,
2015-08-16 06:32:28 -04:00
did: DefId,
mutable: bool) -> clean::Static {
clean::Static {
type_: tcx.lookup_item_type(did).ty.clean(cx),
mutability: if mutable {clean::Mutable} else {clean::Immutable},
expr: "\n\n\n".to_string(), // trigger the "[definition]" links
}
}
/// A trait's generics clause actually contains all of the predicates for all of
/// its associated types as well. We specifically move these clauses to the
/// associated types instead when displaying, so when we're genering the
/// generics for the trait itself we need to be sure to remove them.
///
/// The inverse of this filtering logic can be found in the `Clean`
/// implementation for `AssociatedType`
2015-08-16 06:32:28 -04:00
fn filter_non_trait_generics(trait_did: DefId, mut g: clean::Generics)
-> clean::Generics {
g.where_predicates.retain(|pred| {
match *pred {
clean::WherePredicate::BoundPredicate {
ty: clean::QPath {
self_type: box clean::Generic(ref s),
trait_: box clean::ResolvedPath { did, .. },
name: ref _name,
}, ..
} => *s != "Self" || did != trait_did,
_ => true,
}
});
return g;
}
/// Supertrait bounds for a trait are also listed in the generics coming from
/// the metadata for a crate, so we want to separate those out and create a new
/// list of explicit supertrait bounds to render nicely.
fn separate_supertrait_bounds(mut g: clean::Generics)
-> (clean::Generics, Vec<clean::TyParamBound>) {
let mut ty_bounds = Vec::new();
g.where_predicates.retain(|pred| {
match *pred {
clean::WherePredicate::BoundPredicate {
ty: clean::Generic(ref s),
ref bounds
} if *s == "Self" => {
ty_bounds.extend(bounds.iter().cloned());
false
}
_ => true,
}
});
(g, ty_bounds)
}