1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330
use std::{collections::HashMap, fmt::Display, rc::Rc};
use rustdoc_types::{Crate, Id, Impl, Import, Item, ItemEnum, Module, Path, Type};
use super::intermediate_public_item::IntermediatePublicItem;
use crate::{tokens::Token, Options, PublicApi};
type Impls<'a> = HashMap<&'a Id, Vec<&'a Impl>>;
/// Each public item has a path that is displayed like `first::second::third`.
/// Internally we represent that with a `vec!["first", "second", "third"]`. This
/// is a type alias for that internal representation to make the code easier to
/// read.
pub(crate) type PublicItemPath = Vec<String>;
/// Iterates over all items in a crate. Iterating over items has the benefit of
/// behaving properly when:
/// 1. A single item is imported several times.
/// 2. An item is (publicly) imported from another crate
///
/// Note that this implementation iterates over everything (with the exception
/// of `impl`s, see relevant code for more details), so if the rustdoc JSON is
/// generated with `--document-private-items`, then private items will also be
/// included in the output.
pub struct ItemIterator<'a> {
/// The entire rustdoc JSON data
crate_: &'a Crate,
/// What items left to visit (and possibly add more items from)
items_left: Vec<Rc<IntermediatePublicItem<'a>>>,
/// Normally, an item referenced by item Id is present in the rustdoc JSON.
/// If [`Self::crate_.index`] is missing an Id, then we add it here, to aid
/// with debugging. It will typically be missing because of bugs (or
/// borderline bug such as re-exports of foreign items like discussed in
/// <https://github.com/rust-lang/rust/pull/99287#issuecomment-1186586518>)
/// We do not report it to users, because they can't do anything about it.
missing_ids: Vec<&'a Id>,
/// `impl`s are a bit special. They do not need to be reachable by the crate
/// root in order to matter. All that matters is that the trait and type
/// involved are both public. Since the rustdoc JSON by definition only
/// includes public items, all `impl`s we see are relevant. Whenever we
/// encounter a type that has an `impl`, we inject the associated items of
/// the `impl` as children of the type.
impls: Impls<'a>,
}
impl<'a> ItemIterator<'a> {
pub fn new(crate_: &'a Crate, options: Options) -> Self {
let mut s = ItemIterator {
crate_,
items_left: vec![],
missing_ids: vec![],
impls: find_all_impls(crate_, options),
};
// Bootstrap with the root item
s.try_add_item_to_visit(&crate_.root, None);
s
}
fn add_children_for_item(&mut self, public_item: &Rc<IntermediatePublicItem<'a>>) {
// Handle any impls. See [`ItemIterator::impls`] docs for more info.
let mut add_after_borrow = vec![];
if let Some(impls) = self.impls.get(&public_item.item.id) {
for impl_ in impls {
for id in &impl_.items {
add_after_borrow.push(id);
}
}
}
for id in add_after_borrow {
self.try_add_item_to_visit(id, Some(public_item.clone()));
}
// Handle regular children of the item
for child in items_in_container(public_item.item).into_iter().flatten() {
self.try_add_item_to_visit(child, Some(public_item.clone()));
}
}
fn try_add_item_to_visit(
&mut self,
id: &'a Id,
parent: Option<Rc<IntermediatePublicItem<'a>>>,
) {
match self.crate_.index.get(id) {
Some(item) => self.maybe_add_item_to_visit(item, parent),
None => self.add_missing_id(id),
}
}
fn maybe_add_item_to_visit(
&mut self,
item: &'a Item,
parent: Option<Rc<IntermediatePublicItem<'a>>>,
) {
// We try to inline glob imports, but that might fail, and we want to
// keep track of when that happens.
let mut glob_import_inlined = false;
// We need to handle `pub use foo::*` specially. In case of such
// wildcard imports, `glob` will be `true` and `id` will be the
// module we should import all items from, but we should NOT add
// the module itself.
if let ItemEnum::Import(Import {
id: Some(mod_id),
glob: true,
..
}) = &item.inner
{
// Before we inline this wildcard import, make sure that the module
// is not indirectly trying to import itself. If we allow that,
// we'll get a stack overflow. Note that `glob_import_inlined`
// remains `false` in that case, which means that the output will
// use a special syntax to indicate that we broke recursion.
if !parent.clone().map_or(false, |p| p.path_contains_id(mod_id)) {
if let Some(Item {
inner: ItemEnum::Module(Module { items, .. }),
..
}) = self.crate_.index.get(mod_id)
{
for item in items {
self.try_add_item_to_visit(item, parent.clone());
}
glob_import_inlined = true;
}
}
}
// We handle `impl`s specially, and we don't want to process `impl`
// items directly. See [`ItemIterator::impls`] docs for more info. And
// if we inlined a glob import earlier, we should not add the import
// item itself. All other items we can go ahead and add.
if !glob_import_inlined && !matches!(item.inner, ItemEnum::Impl { .. }) {
self.add_item_to_visit(item, parent);
}
}
fn add_item_to_visit(
&mut self,
mut item: &'a Item,
parent: Option<Rc<IntermediatePublicItem<'a>>>,
) {
let mut name = item.name.clone();
// Since public imports are part of the public API, we inline them, i.e.
// replace the item corresponding to an import with the item that is
// imported. If we didn't do this, publicly imported items would show up
// as just e.g. `pub use some::function`, which is not sufficient for
// the use cases of this tool. We want to show the actual API, and thus
// also show type information! There is one exception; for re-exports of
// primitive types, there is no item Id to inline with, so they remain
// as e.g. `pub use my_i32` in the output.
if let ItemEnum::Import(import) = &item.inner {
name = if import.glob {
// Items should have been inlined in maybe_add_item_to_visit(),
// but since we got here that must have failed, typically
// because the built rustdoc JSON omitted some items from the
// output, or to break import recursion.
Some(format!("<<{}::*>>", import.source))
} else {
if let Some(imported_id) = &import.id {
if !parent
.clone()
.map_or(false, |p| p.path_contains_id(imported_id))
{
match self.crate_.index.get(imported_id) {
Some(imported_item) => item = imported_item,
None => self.add_missing_id(imported_id),
}
}
}
Some(import.name.clone())
};
}
let public_item = Rc::new(IntermediatePublicItem::new(
item,
name.unwrap_or_else(|| String::from("<<no_name>>")),
parent,
));
self.items_left.push(public_item);
}
fn add_missing_id(&mut self, id: &'a Id) {
self.missing_ids.push(id);
}
}
impl<'a> Iterator for ItemIterator<'a> {
type Item = Rc<IntermediatePublicItem<'a>>;
fn next(&mut self) -> Option<Self::Item> {
let mut result = None;
if let Some(public_item) = self.items_left.pop() {
self.add_children_for_item(&public_item.clone());
result = Some(public_item);
}
result
}
}
/// `impl`s are special. This helper finds all `impl`s. See
/// [`ItemIterator::impls`] docs for more info.
fn find_all_impls(crate_: &Crate, options: Options) -> Impls {
let mut impls = HashMap::new();
for item in crate_.index.values() {
if let ItemEnum::Impl(impl_) = &item.inner {
if let Impl {
for_: Type::ResolvedPath(Path { id, .. }),
blanket_impl,
..
} = impl_
{
let omit = !options.with_blanket_implementations && matches!(blanket_impl, Some(_));
if !omit {
impls.entry(id).or_insert_with(Vec::new).push(impl_);
}
}
}
}
impls
}
/// Some items contain other items, which is relevant for analysis. Keep track
/// of such relationships.
fn items_in_container(item: &Item) -> Option<&Vec<Id>> {
match &item.inner {
ItemEnum::Module(m) => Some(&m.items),
ItemEnum::Union(u) => Some(&u.fields),
ItemEnum::Struct(s) => Some(&s.fields),
ItemEnum::Enum(e) => Some(&e.variants),
ItemEnum::Trait(t) => Some(&t.items),
ItemEnum::Impl(i) => Some(&i.items),
ItemEnum::Variant(rustdoc_types::Variant::Struct(ids)) => Some(ids),
// TODO: `ItemEnum::Variant(rustdoc_types::Variant::Tuple(ids)) => Some(ids),` when https://github.com/rust-lang/rust/issues/92945 is fixed
_ => None,
}
}
pub fn public_api_in_crate(crate_: &Crate, options: Options) -> super::PublicApi {
let mut item_iterator = ItemIterator::new(crate_, options);
let items = item_iterator
.by_ref()
.map(|p| intermediate_public_item_to_public_item(&p))
.collect();
PublicApi {
items,
missing_item_ids: item_iterator
.missing_ids
.iter()
.map(|m| m.0.clone())
.collect(),
}
}
fn intermediate_public_item_to_public_item(
public_item: &Rc<IntermediatePublicItem<'_>>,
) -> PublicItem {
PublicItem {
path: public_item
.path()
.iter()
.map(|i| i.name.clone())
.collect::<PublicItemPath>(),
tokens: public_item.render_token_stream(),
}
}
/// Represent a public item of an analyzed crate, i.e. an item that forms part
/// of the public API of a crate. Implements [`Display`] so it can be printed. It
/// also implements [`Ord`], but how items are ordered are not stable yet, and
/// will change in later versions.
#[derive(Clone, Eq, PartialEq, Hash)]
pub struct PublicItem {
/// The "your_crate::mod_a::mod_b" part of an item. Split by "::"
pub(crate) path: PublicItemPath,
/// The rendered item as a stream of [`Token`]s
pub(crate) tokens: Vec<Token>,
}
impl PublicItem {
/// The rendered item as a stream of [`Token`]s
pub fn tokens(&self) -> impl Iterator<Item = &Token> {
self.tokens.iter()
}
}
/// We want pretty-printing (`"{:#?}"`) of [`crate::diff::PublicItemsDiff`] to print
/// each public item as `Display`, so implement `Debug` with `Display`.
impl std::fmt::Debug for PublicItem {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
std::fmt::Display::fmt(self, f)
}
}
/// One of the basic uses cases is printing a sorted `Vec` of `PublicItem`s. So
/// we implement `Display` for it.
impl Display for PublicItem {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
write!(f, "{}", tokens_to_string(&self.tokens))
}
}
pub(crate) fn tokens_to_string(tokens: &[Token]) -> String {
tokens.iter().map(Token::text).collect()
}
impl PartialOrd for PublicItem {
fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {
Some(self.cmp(other))
}
}
impl Ord for PublicItem {
fn cmp(&self, other: &Self) -> std::cmp::Ordering {
self.to_string().cmp(&other.to_string())
}
}