rust/crates/hir_def/src/item_tree.rs

948 lines
29 KiB
Rust
Raw Normal View History

2020-03-25 09:33:01 -05:00
//! A simplified AST that only contains items.
2021-05-23 16:09:38 -05:00
//!
//! This is the primary IR used throughout `hir_def`. It is the input to the name resolution
//! algorithm, as well as to the queries defined in `adt.rs`, `data.rs`, and most things in
//! `attr.rs`.
//!
//! `ItemTree`s are built per `HirFileId`, from the syntax tree of the parsed file. This means that
//! they are crate-independent: they don't know which `#[cfg]`s are active or which module they
//! belong to, since those concepts don't exist at this level (a single `ItemTree` might be part of
//! multiple crates, or might be included into the same crate twice via `#[path]`).
//!
//! One important purpose of this layer is to provide an "invalidation barrier" for incremental
//! computations: when typing inside an item body, the `ItemTree` of the modified file is typically
//! unaffected, so we don't have to recompute name resolution results or item data (see `data.rs`).
//!
//! The `ItemTree` for the currently open file can be displayed by using the VS Code command
//! "Rust Analyzer: Debug ItemTree".
//!
//! Compared to rustc's architecture, `ItemTree` has properties from both rustc's AST and HIR: many
//! syntax-level Rust features are already desugared to simpler forms in the `ItemTree`, but name
//! resolution has not yet been performed. `ItemTree`s are per-file, while rustc's AST and HIR are
//! per-crate, because we are interested in incrementally computing it.
//!
//! The representation of items in the `ItemTree` should generally mirror the surface syntax: it is
//! usually a bad idea to desugar a syntax-level construct to something that is structurally
//! different here. Name resolution needs to be able to process attributes and expand macros
//! (including attribute macros), and having a 1-to-1 mapping between syntax and the `ItemTree`
//! avoids introducing subtle bugs.
//!
//! In general, any item in the `ItemTree` stores its `AstId`, which allows mapping it back to its
//! surface syntax.
2020-03-25 09:33:01 -05:00
mod lower;
2021-05-21 16:45:27 -05:00
mod pretty;
#[cfg(test)]
mod tests;
use std::{
2020-06-16 12:20:29 -05:00
fmt::{self, Debug},
hash::{Hash, Hasher},
marker::PhantomData,
2021-10-04 22:10:25 -05:00
ops::Index,
sync::Arc,
};
2021-09-27 05:54:24 -05:00
use ast::{AstNode, HasName, StructKind};
use base_db::CrateId;
use either::Either;
2020-03-25 09:33:01 -05:00
use hir_expand::{
ast_id_map::FileAstId,
2020-03-25 09:33:01 -05:00
hygiene::Hygiene,
name::{name, AsName, Name},
ExpandTo, HirFileId, InFile,
2020-03-25 09:33:01 -05:00
};
2021-10-04 22:10:25 -05:00
use la_arena::{Arena, Idx, IdxRange, RawIdx};
use profile::Count;
use rustc_hash::FxHashMap;
2020-06-24 09:50:23 -05:00
use smallvec::SmallVec;
use syntax::{ast, match_ast, SyntaxKind};
2020-03-25 09:33:01 -05:00
use crate::{
attr::{Attrs, RawAttrs},
2020-06-11 12:46:56 -05:00
db::DefDatabase,
2020-06-17 05:24:05 -05:00
generics::GenericParams,
2021-04-01 12:46:43 -05:00
intern::Interned,
2020-06-24 08:36:18 -05:00
path::{path, AssociatedTypeBinding, GenericArgs, ImportAlias, ModPath, Path, PathKind},
type_ref::{Mutability, TraitRef, TypeBound, TypeRef},
2020-03-25 09:33:01 -05:00
visibility::RawVisibility,
BlockId,
2020-03-25 09:33:01 -05:00
};
2020-06-24 08:36:18 -05:00
#[derive(Copy, Clone, Eq, PartialEq)]
pub struct RawVisibilityId(u32);
impl RawVisibilityId {
pub const PUB: Self = RawVisibilityId(u32::max_value());
pub const PRIV: Self = RawVisibilityId(u32::max_value() - 1);
pub const PUB_CRATE: Self = RawVisibilityId(u32::max_value() - 2);
}
impl fmt::Debug for RawVisibilityId {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
let mut f = f.debug_tuple("RawVisibilityId");
match *self {
Self::PUB => f.field(&"pub"),
Self::PRIV => f.field(&"pub(self)"),
Self::PUB_CRATE => f.field(&"pub(crate)"),
_ => f.field(&self.0),
};
f.finish()
}
}
/// The item tree of a source file.
2021-01-25 06:12:53 -06:00
#[derive(Debug, Default, Eq, PartialEq)]
pub struct ItemTree {
_c: Count<Self>,
top_level: SmallVec<[ModItem; 1]>,
attrs: FxHashMap<AttrOwner, RawAttrs>,
data: Option<Box<ItemTreeData>>,
}
2020-03-25 09:33:01 -05:00
impl ItemTree {
pub(crate) fn file_item_tree_query(db: &dyn DefDatabase, file_id: HirFileId) -> Arc<ItemTree> {
2020-08-12 09:32:36 -05:00
let _p = profile::span("item_tree_query").detail(|| format!("{:?}", file_id));
2020-06-11 12:46:56 -05:00
let syntax = if let Some(node) = db.parse_or_expand(file_id) {
2021-02-01 06:19:55 -06:00
if node.kind() == SyntaxKind::ERROR {
// FIXME: not 100% sure why these crop up, but return an empty tree to avoid a panic
return Default::default();
}
2020-06-11 12:46:56 -05:00
node
} else {
2021-01-25 06:12:53 -06:00
return Default::default();
2020-06-11 12:46:56 -05:00
};
2020-06-15 12:16:02 -05:00
let hygiene = Hygiene::new(db.upcast(), file_id);
let ctx = lower::Ctx::new(db, hygiene.clone(), file_id);
2020-06-15 12:16:02 -05:00
let mut top_attrs = None;
let mut item_tree = match_ast! {
2020-06-11 12:46:56 -05:00
match syntax {
ast::SourceFile(file) => {
top_attrs = Some(RawAttrs::new(db, &file, &hygiene));
ctx.lower_module_items(&file)
},
ast::MacroItems(items) => {
ctx.lower_module_items(&items)
},
2020-12-15 00:39:15 -06:00
ast::MacroStmts(stmts) => {
// The produced statements can include items, which should be added as top-level
// items.
ctx.lower_macro_stmts(stmts)
2020-12-15 00:39:15 -06:00
},
_ => {
panic!("cannot create item tree from {:?} {}", syntax, syntax);
2020-06-11 12:46:56 -05:00
},
}
};
if let Some(attrs) = top_attrs {
item_tree.attrs.insert(AttrOwner::TopLevel, attrs);
}
2020-06-24 09:14:58 -05:00
item_tree.shrink_to_fit();
2020-06-22 08:07:06 -05:00
Arc::new(item_tree)
}
2021-11-25 17:17:20 -06:00
fn block_item_tree(db: &dyn DefDatabase, block: BlockId) -> Arc<ItemTree> {
let loc = db.lookup_intern_block(block);
let block = loc.ast_id.to_node(db.upcast());
let hygiene = Hygiene::new(db.upcast(), loc.ast_id.file_id);
let ctx = lower::Ctx::new(db, hygiene.clone(), loc.ast_id.file_id);
Arc::new(ctx.lower_block(&block))
}
2020-06-24 09:14:58 -05:00
fn shrink_to_fit(&mut self) {
if let Some(data) = &mut self.data {
let ItemTreeData {
imports,
extern_crates,
extern_blocks,
2020-06-24 09:14:58 -05:00
functions,
params,
2020-06-24 09:14:58 -05:00
structs,
fields,
unions,
enums,
variants,
consts,
statics,
traits,
impls,
type_aliases,
mods,
macro_calls,
2020-12-15 08:37:37 -06:00
macro_rules,
2020-12-15 11:43:19 -06:00
macro_defs,
2020-06-24 09:14:58 -05:00
vis,
} = &mut **data;
imports.shrink_to_fit();
extern_crates.shrink_to_fit();
extern_blocks.shrink_to_fit();
2020-06-24 09:14:58 -05:00
functions.shrink_to_fit();
params.shrink_to_fit();
2020-06-24 09:14:58 -05:00
structs.shrink_to_fit();
fields.shrink_to_fit();
unions.shrink_to_fit();
enums.shrink_to_fit();
variants.shrink_to_fit();
consts.shrink_to_fit();
statics.shrink_to_fit();
traits.shrink_to_fit();
impls.shrink_to_fit();
type_aliases.shrink_to_fit();
mods.shrink_to_fit();
macro_calls.shrink_to_fit();
2020-12-15 08:37:37 -06:00
macro_rules.shrink_to_fit();
2020-12-15 11:43:19 -06:00
macro_defs.shrink_to_fit();
2020-06-24 09:14:58 -05:00
vis.arena.shrink_to_fit();
}
}
2020-06-11 12:46:56 -05:00
/// Returns an iterator over all items located at the top level of the `HirFileId` this
/// `ItemTree` was created from.
2020-06-12 16:24:26 -05:00
pub fn top_level_items(&self) -> &[ModItem] {
&self.top_level
2020-03-25 09:33:01 -05:00
}
2020-06-15 12:16:02 -05:00
/// Returns the inner attributes of the source file.
pub fn top_level_attrs(&self, db: &dyn DefDatabase, krate: CrateId) -> Attrs {
self.attrs.get(&AttrOwner::TopLevel).unwrap_or(&RawAttrs::EMPTY).clone().filter(db, krate)
2020-06-15 12:16:02 -05:00
}
pub(crate) fn raw_attrs(&self, of: AttrOwner) -> &RawAttrs {
self.attrs.get(&of).unwrap_or(&RawAttrs::EMPTY)
}
pub fn attrs(&self, db: &dyn DefDatabase, krate: CrateId, of: AttrOwner) -> Attrs {
self.raw_attrs(of).clone().filter(db, krate)
2020-06-15 12:16:02 -05:00
}
2020-06-22 08:07:06 -05:00
2021-05-21 16:45:27 -05:00
pub fn pretty_print(&self) -> String {
pretty::print_item_tree(self)
}
fn data(&self) -> &ItemTreeData {
self.data.as_ref().expect("attempted to access data of empty ItemTree")
}
fn data_mut(&mut self) -> &mut ItemTreeData {
self.data.get_or_insert_with(Box::default)
}
2020-03-25 09:33:01 -05:00
}
2020-06-24 09:50:23 -05:00
#[derive(Default, Debug, Eq, PartialEq)]
struct ItemVisibilities {
arena: Arena<RawVisibility>,
}
impl ItemVisibilities {
fn alloc(&mut self, vis: RawVisibility) -> RawVisibilityId {
match &vis {
RawVisibility::Public => RawVisibilityId::PUB,
RawVisibility::Module(path) if path.segments().is_empty() => match &path.kind {
2020-06-24 09:50:23 -05:00
PathKind::Super(0) => RawVisibilityId::PRIV,
PathKind::Crate => RawVisibilityId::PUB_CRATE,
_ => RawVisibilityId(self.arena.alloc(vis).into_raw().into()),
},
_ => RawVisibilityId(self.arena.alloc(vis).into_raw().into()),
}
}
}
static VIS_PUB: RawVisibility = RawVisibility::Public;
static VIS_PRIV: RawVisibility = RawVisibility::Module(ModPath::from_kind(PathKind::Super(0)));
static VIS_PUB_CRATE: RawVisibility = RawVisibility::Module(ModPath::from_kind(PathKind::Crate));
2020-06-24 09:50:23 -05:00
#[derive(Default, Debug, Eq, PartialEq)]
struct ItemTreeData {
imports: Arena<Import>,
extern_crates: Arena<ExternCrate>,
extern_blocks: Arena<ExternBlock>,
2020-06-24 09:50:23 -05:00
functions: Arena<Function>,
params: Arena<Param>,
2020-06-24 09:50:23 -05:00
structs: Arena<Struct>,
fields: Arena<Field>,
unions: Arena<Union>,
enums: Arena<Enum>,
variants: Arena<Variant>,
consts: Arena<Const>,
statics: Arena<Static>,
traits: Arena<Trait>,
impls: Arena<Impl>,
type_aliases: Arena<TypeAlias>,
mods: Arena<Mod>,
macro_calls: Arena<MacroCall>,
2020-12-15 08:37:37 -06:00
macro_rules: Arena<MacroRules>,
2020-12-15 11:43:19 -06:00
macro_defs: Arena<MacroDef>,
2020-06-24 09:50:23 -05:00
vis: ItemVisibilities,
}
#[derive(Debug, Eq, PartialEq, Hash)]
pub enum AttrOwner {
2020-06-24 09:50:23 -05:00
/// Attributes on an item.
ModItem(ModItem),
/// Inner attributes of the source file.
TopLevel,
Variant(Idx<Variant>),
Field(Idx<Field>),
Param(Idx<Param>),
2020-06-24 09:50:23 -05:00
}
macro_rules! from_attrs {
( $( $var:ident($t:ty) ),+ ) => {
$(
impl From<$t> for AttrOwner {
fn from(t: $t) -> AttrOwner {
AttrOwner::$var(t)
}
}
)+
};
}
from_attrs!(ModItem(ModItem), Variant(Idx<Variant>), Field(Idx<Field>), Param(Idx<Param>));
/// Trait implemented by all item nodes in the item tree.
pub trait ItemTreeNode: Clone {
2020-07-29 17:23:03 -05:00
type Source: AstNode + Into<ast::Item>;
fn ast_id(&self) -> FileAstId<Self::Source>;
/// Looks up an instance of `Self` in an item tree.
2020-06-16 12:20:29 -05:00
fn lookup(tree: &ItemTree, index: Idx<Self>) -> &Self;
2020-06-22 08:07:06 -05:00
/// Downcasts a `ModItem` to a `FileItemTreeId` specific to this type.
fn id_from_mod_item(mod_item: ModItem) -> Option<FileItemTreeId<Self>>;
/// Upcasts a `FileItemTreeId` to a generic `ModItem`.
fn id_to_mod_item(id: FileItemTreeId<Self>) -> ModItem;
2020-06-16 12:20:29 -05:00
}
pub struct FileItemTreeId<N: ItemTreeNode> {
index: Idx<N>,
_p: PhantomData<N>,
}
impl<N: ItemTreeNode> Clone for FileItemTreeId<N> {
fn clone(&self) -> Self {
Self { index: self.index, _p: PhantomData }
}
}
impl<N: ItemTreeNode> Copy for FileItemTreeId<N> {}
impl<N: ItemTreeNode> PartialEq for FileItemTreeId<N> {
fn eq(&self, other: &FileItemTreeId<N>) -> bool {
self.index == other.index
}
}
impl<N: ItemTreeNode> Eq for FileItemTreeId<N> {}
impl<N: ItemTreeNode> Hash for FileItemTreeId<N> {
fn hash<H: Hasher>(&self, state: &mut H) {
self.index.hash(state)
}
}
impl<N: ItemTreeNode> fmt::Debug for FileItemTreeId<N> {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
self.index.fmt(f)
}
}
/// Identifies a particular [`ItemTree`].
#[derive(Debug, PartialEq, Eq, Clone, Copy, Hash)]
pub struct TreeId {
file: HirFileId,
block: Option<BlockId>,
}
impl TreeId {
pub(crate) fn new(file: HirFileId, block: Option<BlockId>) -> Self {
Self { file, block }
}
pub(crate) fn item_tree(&self, db: &dyn DefDatabase) -> Arc<ItemTree> {
match self.block {
2021-11-25 17:17:20 -06:00
Some(block) => ItemTree::block_item_tree(db, block),
None => db.file_item_tree(self.file),
}
}
pub(crate) fn file_id(self) -> HirFileId {
self.file
}
2021-11-25 17:17:20 -06:00
pub(crate) fn is_block(self) -> bool {
self.block.is_some()
}
}
2021-03-12 17:34:01 -06:00
#[derive(Debug)]
pub struct ItemTreeId<N: ItemTreeNode> {
tree: TreeId,
2021-03-12 17:34:01 -06:00
pub value: FileItemTreeId<N>,
}
impl<N: ItemTreeNode> ItemTreeId<N> {
pub fn new(tree: TreeId, idx: FileItemTreeId<N>) -> Self {
Self { tree, value: idx }
2021-03-12 17:34:01 -06:00
}
pub fn file_id(self) -> HirFileId {
self.tree.file
}
pub fn tree_id(self) -> TreeId {
self.tree
2021-03-12 17:34:01 -06:00
}
pub fn item_tree(self, db: &dyn DefDatabase) -> Arc<ItemTree> {
self.tree.item_tree(db)
2021-03-12 17:34:01 -06:00
}
}
impl<N: ItemTreeNode> Copy for ItemTreeId<N> {}
impl<N: ItemTreeNode> Clone for ItemTreeId<N> {
fn clone(&self) -> Self {
*self
}
}
impl<N: ItemTreeNode> PartialEq for ItemTreeId<N> {
fn eq(&self, other: &Self) -> bool {
self.tree == other.tree && self.value == other.value
2021-03-12 17:34:01 -06:00
}
}
impl<N: ItemTreeNode> Eq for ItemTreeId<N> {}
impl<N: ItemTreeNode> Hash for ItemTreeId<N> {
fn hash<H: Hasher>(&self, state: &mut H) {
self.tree.hash(state);
2021-03-12 17:34:01 -06:00
self.value.hash(state);
}
}
2020-06-16 12:20:29 -05:00
2020-06-23 11:41:32 -05:00
macro_rules! mod_items {
( $( $typ:ident in $fld:ident -> $ast:ty ),+ $(,)? ) => {
#[derive(Debug, Copy, Clone, Eq, PartialEq, Hash)]
pub enum ModItem {
$(
$typ(FileItemTreeId<$typ>),
)+
}
$(
impl From<FileItemTreeId<$typ>> for ModItem {
fn from(id: FileItemTreeId<$typ>) -> ModItem {
ModItem::$typ(id)
}
2020-06-16 12:20:29 -05:00
}
2020-06-23 11:41:32 -05:00
)+
2020-06-22 08:07:06 -05:00
2020-06-23 11:41:32 -05:00
$(
impl ItemTreeNode for $typ {
type Source = $ast;
fn ast_id(&self) -> FileAstId<Self::Source> {
self.ast_id
}
2020-06-23 11:41:32 -05:00
fn lookup(tree: &ItemTree, index: Idx<Self>) -> &Self {
&tree.data().$fld[index]
2020-06-23 11:41:32 -05:00
}
2020-06-22 08:07:06 -05:00
2020-06-23 11:41:32 -05:00
fn id_from_mod_item(mod_item: ModItem) -> Option<FileItemTreeId<Self>> {
match mod_item {
ModItem::$typ(id) => Some(id),
_ => None,
2020-06-23 11:41:32 -05:00
}
}
fn id_to_mod_item(id: FileItemTreeId<Self>) -> ModItem {
ModItem::$typ(id)
2020-06-22 08:07:06 -05:00
}
}
2020-06-23 11:41:32 -05:00
impl Index<Idx<$typ>> for ItemTree {
type Output = $typ;
fn index(&self, index: Idx<$typ>) -> &Self::Output {
&self.data().$fld[index]
2020-06-23 11:41:32 -05:00
}
}
2020-06-23 11:41:32 -05:00
)+
};
}
2020-06-23 11:41:32 -05:00
mod_items! {
2020-07-30 07:12:04 -05:00
Import in imports -> ast::Use,
2020-07-30 05:26:57 -05:00
ExternCrate in extern_crates -> ast::ExternCrate,
ExternBlock in extern_blocks -> ast::ExternBlock,
2020-07-30 07:51:08 -05:00
Function in functions -> ast::Fn,
2020-07-30 10:50:40 -05:00
Struct in structs -> ast::Struct,
2020-07-30 10:36:46 -05:00
Union in unions -> ast::Union,
2020-07-30 10:52:53 -05:00
Enum in enums -> ast::Enum,
2020-07-30 11:02:20 -05:00
Const in consts -> ast::Const,
Static in statics -> ast::Static,
2020-07-30 11:17:28 -05:00
Trait in traits -> ast::Trait,
2020-07-30 11:28:28 -05:00
Impl in impls -> ast::Impl,
2020-07-30 08:25:46 -05:00
TypeAlias in type_aliases -> ast::TypeAlias,
2020-06-23 11:41:32 -05:00
Mod in mods -> ast::Module,
MacroCall in macro_calls -> ast::MacroCall,
2020-12-15 08:37:37 -06:00
MacroRules in macro_rules -> ast::MacroRules,
2020-12-15 11:43:19 -06:00
MacroDef in macro_defs -> ast::MacroDef,
}
2020-03-25 09:33:01 -05:00
macro_rules! impl_index {
( $($fld:ident: $t:ty),+ $(,)? ) => {
$(
impl Index<Idx<$t>> for ItemTree {
type Output = $t;
fn index(&self, index: Idx<$t>) -> &Self::Output {
&self.data().$fld[index]
2020-03-25 09:33:01 -05:00
}
}
)+
};
}
impl_index!(fields: Field, variants: Variant, params: Param);
2020-03-25 09:33:01 -05:00
2020-06-24 08:36:18 -05:00
impl Index<RawVisibilityId> for ItemTree {
type Output = RawVisibility;
fn index(&self, index: RawVisibilityId) -> &Self::Output {
match index {
RawVisibilityId::PRIV => &VIS_PRIV,
RawVisibilityId::PUB => &VIS_PUB,
RawVisibilityId::PUB_CRATE => &VIS_PUB_CRATE,
_ => &self.data().vis.arena[Idx::from_raw(index.0.into())],
}
}
}
2020-06-16 12:20:29 -05:00
impl<N: ItemTreeNode> Index<FileItemTreeId<N>> for ItemTree {
type Output = N;
fn index(&self, id: FileItemTreeId<N>) -> &N {
N::lookup(self, id.index)
}
}
2020-06-12 16:24:26 -05:00
#[derive(Debug, Clone, Eq, PartialEq)]
2020-03-25 09:33:01 -05:00
pub struct Import {
2020-06-24 08:36:18 -05:00
pub visibility: RawVisibilityId,
2020-07-30 07:12:04 -05:00
pub ast_id: FileAstId<ast::Use>,
pub use_tree: UseTree,
}
#[derive(Debug, Clone, Eq, PartialEq)]
pub struct UseTree {
pub index: Idx<ast::UseTree>,
kind: UseTreeKind,
}
#[derive(Debug, Clone, Eq, PartialEq)]
pub enum UseTreeKind {
2021-05-27 06:55:31 -05:00
/// ```
/// use path::to::Item;
/// use path::to::Item as Renamed;
/// use path::to::Trait as _;
/// ```
2021-05-25 18:26:16 -05:00
Single { path: Interned<ModPath>, alias: Option<ImportAlias> },
2021-05-27 06:55:31 -05:00
/// ```
/// use *; // (invalid, but can occur in nested tree)
/// use path::*;
/// ```
2021-05-25 18:26:16 -05:00
Glob { path: Option<Interned<ModPath>> },
2021-05-27 06:55:31 -05:00
/// ```
/// use prefix::{self, Item, ...};
/// ```
2021-05-25 18:26:16 -05:00
Prefixed { prefix: Option<Interned<ModPath>>, list: Box<[UseTree]> },
2020-06-22 08:07:06 -05:00
}
#[derive(Debug, Clone, Eq, PartialEq)]
pub struct ExternCrate {
pub name: Name,
2020-06-22 08:07:06 -05:00
pub alias: Option<ImportAlias>,
2020-06-24 08:36:18 -05:00
pub visibility: RawVisibilityId,
2020-07-30 05:26:57 -05:00
pub ast_id: FileAstId<ast::ExternCrate>,
2020-03-25 09:33:01 -05:00
}
#[derive(Debug, Clone, Eq, PartialEq)]
pub struct ExternBlock {
pub abi: Option<Interned<str>>,
pub ast_id: FileAstId<ast::ExternBlock>,
pub children: Box<[ModItem]>,
}
#[derive(Debug, Clone, Eq, PartialEq)]
2020-03-25 09:33:01 -05:00
pub struct Function {
pub name: Name,
2020-06-24 08:36:18 -05:00
pub visibility: RawVisibilityId,
pub explicit_generic_params: Interned<GenericParams>,
pub abi: Option<Interned<str>>,
2021-10-04 22:10:25 -05:00
pub params: IdxRange<Param>,
2021-04-01 12:46:43 -05:00
pub ret_type: Interned<TypeRef>,
pub async_ret_type: Option<Interned<TypeRef>>,
2020-07-30 07:51:08 -05:00
pub ast_id: FileAstId<ast::Fn>,
pub(crate) flags: FnFlags,
2020-03-25 09:33:01 -05:00
}
#[derive(Debug, Clone, Eq, PartialEq)]
pub enum Param {
2021-04-01 12:46:43 -05:00
Normal(Interned<TypeRef>),
Varargs,
}
#[derive(Debug, Clone, Copy, Eq, PartialEq, Default)]
pub(crate) struct FnFlags {
pub(crate) bits: u8,
}
impl FnFlags {
pub(crate) const HAS_SELF_PARAM: u8 = 1 << 0;
pub(crate) const HAS_BODY: u8 = 1 << 1;
pub(crate) const IS_DEFAULT: u8 = 1 << 2;
pub(crate) const IS_CONST: u8 = 1 << 3;
pub(crate) const IS_ASYNC: u8 = 1 << 4;
pub(crate) const IS_UNSAFE: u8 = 1 << 5;
/// Whether the function is located in an `extern` block (*not* whether it is an
/// `extern "abi" fn`).
pub(crate) const IS_IN_EXTERN_BLOCK: u8 = 1 << 6;
pub(crate) const IS_VARARGS: u8 = 1 << 7;
}
#[derive(Debug, Clone, Eq, PartialEq)]
2020-03-25 09:33:01 -05:00
pub struct Struct {
pub name: Name,
2020-06-24 08:36:18 -05:00
pub visibility: RawVisibilityId,
pub generic_params: Interned<GenericParams>,
2020-03-25 09:33:01 -05:00
pub fields: Fields,
2020-07-30 10:50:40 -05:00
pub ast_id: FileAstId<ast::Struct>,
2020-03-25 09:33:01 -05:00
}
#[derive(Debug, Clone, Eq, PartialEq)]
2020-03-25 09:33:01 -05:00
pub struct Union {
pub name: Name,
2020-06-24 08:36:18 -05:00
pub visibility: RawVisibilityId,
pub generic_params: Interned<GenericParams>,
2020-03-25 09:33:01 -05:00
pub fields: Fields,
2020-07-30 10:36:46 -05:00
pub ast_id: FileAstId<ast::Union>,
2020-03-25 09:33:01 -05:00
}
#[derive(Debug, Clone, Eq, PartialEq)]
2020-03-25 09:33:01 -05:00
pub struct Enum {
pub name: Name,
2020-06-24 08:36:18 -05:00
pub visibility: RawVisibilityId,
pub generic_params: Interned<GenericParams>,
2021-10-04 22:10:25 -05:00
pub variants: IdxRange<Variant>,
2020-07-30 10:52:53 -05:00
pub ast_id: FileAstId<ast::Enum>,
2020-03-25 09:33:01 -05:00
}
#[derive(Debug, Clone, Eq, PartialEq)]
2020-03-25 09:33:01 -05:00
pub struct Const {
/// const _: () = ();
pub name: Option<Name>,
2020-06-24 08:36:18 -05:00
pub visibility: RawVisibilityId,
2021-04-01 12:46:43 -05:00
pub type_ref: Interned<TypeRef>,
2020-07-30 11:02:20 -05:00
pub ast_id: FileAstId<ast::Const>,
2020-03-25 09:33:01 -05:00
}
#[derive(Debug, Clone, Eq, PartialEq)]
2020-03-25 09:33:01 -05:00
pub struct Static {
pub name: Name,
2020-06-24 08:36:18 -05:00
pub visibility: RawVisibilityId,
pub mutable: bool,
/// Whether the static is in an `extern` block.
pub is_extern: bool,
2021-04-01 12:46:43 -05:00
pub type_ref: Interned<TypeRef>,
2020-07-30 11:02:20 -05:00
pub ast_id: FileAstId<ast::Static>,
2020-03-25 09:33:01 -05:00
}
#[derive(Debug, Clone, Eq, PartialEq)]
2020-03-25 09:33:01 -05:00
pub struct Trait {
pub name: Name,
2020-06-24 08:36:18 -05:00
pub visibility: RawVisibilityId,
pub generic_params: Interned<GenericParams>,
2021-03-15 11:05:03 -05:00
pub is_auto: bool,
pub is_unsafe: bool,
2020-06-24 09:07:02 -05:00
pub items: Box<[AssocItem]>,
2020-07-30 11:17:28 -05:00
pub ast_id: FileAstId<ast::Trait>,
2020-03-25 09:33:01 -05:00
}
#[derive(Debug, Clone, Eq, PartialEq)]
2020-03-25 09:33:01 -05:00
pub struct Impl {
pub generic_params: Interned<GenericParams>,
2021-04-01 12:46:43 -05:00
pub target_trait: Option<Interned<TraitRef>>,
pub self_ty: Interned<TypeRef>,
2020-03-25 09:33:01 -05:00
pub is_negative: bool,
2020-06-24 09:07:02 -05:00
pub items: Box<[AssocItem]>,
2020-07-30 11:28:28 -05:00
pub ast_id: FileAstId<ast::Impl>,
2020-03-25 09:33:01 -05:00
}
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct TypeAlias {
pub name: Name,
2020-06-24 08:36:18 -05:00
pub visibility: RawVisibilityId,
/// Bounds on the type alias itself. Only valid in trait declarations, eg. `type Assoc: Copy;`.
pub bounds: Box<[Interned<TypeBound>]>,
pub generic_params: Interned<GenericParams>,
2021-04-01 12:46:43 -05:00
pub type_ref: Option<Interned<TypeRef>>,
pub is_extern: bool,
2020-07-30 08:25:46 -05:00
pub ast_id: FileAstId<ast::TypeAlias>,
2020-03-25 09:33:01 -05:00
}
#[derive(Debug, Clone, Eq, PartialEq)]
2020-03-25 09:33:01 -05:00
pub struct Mod {
pub name: Name,
2020-06-24 08:36:18 -05:00
pub visibility: RawVisibilityId,
2020-06-15 12:16:02 -05:00
pub kind: ModKind,
pub ast_id: FileAstId<ast::Module>,
2020-03-25 09:33:01 -05:00
}
#[derive(Debug, Clone, Eq, PartialEq)]
2020-06-12 16:24:26 -05:00
pub enum ModKind {
2020-06-15 12:16:02 -05:00
/// `mod m { ... }`
2020-06-24 09:07:02 -05:00
Inline { items: Box<[ModItem]> },
2020-06-12 16:24:26 -05:00
2020-06-15 12:16:02 -05:00
/// `mod m;`
2020-06-12 16:24:26 -05:00
Outline {},
}
#[derive(Debug, Clone, Eq, PartialEq)]
2020-03-25 09:33:01 -05:00
pub struct MacroCall {
2020-06-15 12:16:02 -05:00
/// Path to the called macro.
pub path: Interned<ModPath>,
2020-12-15 08:37:37 -06:00
pub ast_id: FileAstId<ast::MacroCall>,
pub expand_to: ExpandTo,
2020-12-15 08:37:37 -06:00
}
#[derive(Debug, Clone, Eq, PartialEq)]
pub struct MacroRules {
2020-12-15 11:43:19 -06:00
/// The name of the declared macro.
2020-12-15 08:37:37 -06:00
pub name: Name,
pub ast_id: FileAstId<ast::MacroRules>,
2020-03-25 09:33:01 -05:00
}
2020-12-15 11:43:19 -06:00
/// "Macros 2.0" macro definition.
#[derive(Debug, Clone, Eq, PartialEq)]
pub struct MacroDef {
pub name: Name,
pub visibility: RawVisibilityId,
pub ast_id: FileAstId<ast::MacroDef>,
}
impl Import {
/// Maps a `UseTree` contained in this import back to its AST node.
pub fn use_tree_to_ast(
&self,
db: &dyn DefDatabase,
file_id: HirFileId,
index: Idx<ast::UseTree>,
) -> ast::UseTree {
// Re-lower the AST item and get the source map.
// Note: The AST unwraps are fine, since if they fail we should have never obtained `index`.
let ast = InFile::new(file_id, self.ast_id).to_node(db.upcast());
let ast_use_tree = ast.use_tree().expect("missing `use_tree`");
let hygiene = Hygiene::new(db.upcast(), file_id);
let (_, source_map) =
lower::lower_use_tree(db, &hygiene, ast_use_tree).expect("failed to lower use tree");
source_map[index].clone()
}
}
2021-06-28 13:11:58 -05:00
#[derive(Clone, Copy, Debug, Eq, PartialEq)]
pub enum ImportKind {
/// The `ModPath` is imported normally.
Plain,
/// This is a glob-import of all names in the `ModPath`.
Glob,
/// This is a `some::path::self` import, which imports `some::path` only in type namespace.
TypeOnly,
}
impl UseTree {
/// Expands the `UseTree` into individually imported `ModPath`s.
pub fn expand(
&self,
2021-06-28 13:11:58 -05:00
mut cb: impl FnMut(Idx<ast::UseTree>, ModPath, ImportKind, Option<ImportAlias>),
) {
self.expand_impl(None, &mut cb)
}
fn expand_impl(
&self,
prefix: Option<ModPath>,
2021-06-28 13:11:58 -05:00
cb: &mut dyn FnMut(Idx<ast::UseTree>, ModPath, ImportKind, Option<ImportAlias>),
) {
2021-06-28 13:11:58 -05:00
fn concat_mod_paths(
prefix: Option<ModPath>,
path: &ModPath,
) -> Option<(ModPath, ImportKind)> {
match (prefix, &path.kind) {
2021-06-28 13:11:58 -05:00
(None, _) => Some((path.clone(), ImportKind::Plain)),
(Some(mut prefix), PathKind::Plain) => {
for segment in path.segments() {
prefix.push_segment(segment.clone());
}
2021-06-28 13:11:58 -05:00
Some((prefix, ImportKind::Plain))
}
(Some(prefix), PathKind::Super(0)) => {
// `some::path::self` == `some::path`
if path.segments().is_empty() {
2021-06-28 13:11:58 -05:00
Some((prefix, ImportKind::TypeOnly))
} else {
None
}
}
(Some(_), _) => None,
}
}
match &self.kind {
UseTreeKind::Single { path, alias } => {
2021-06-28 13:11:58 -05:00
if let Some((path, kind)) = concat_mod_paths(prefix, path) {
cb(self.index, path, kind, alias.clone());
}
}
UseTreeKind::Glob { path: Some(path) } => {
2021-06-28 13:11:58 -05:00
if let Some((path, _)) = concat_mod_paths(prefix, path) {
cb(self.index, path, ImportKind::Glob, None);
}
}
UseTreeKind::Glob { path: None } => {
if let Some(prefix) = prefix {
2021-06-28 13:11:58 -05:00
cb(self.index, prefix, ImportKind::Glob, None);
}
}
UseTreeKind::Prefixed { prefix: additional_prefix, list } => {
let prefix = match additional_prefix {
Some(path) => match concat_mod_paths(prefix, path) {
2021-06-28 13:11:58 -05:00
Some((path, ImportKind::Plain)) => Some(path),
_ => return,
},
None => prefix,
};
2021-05-25 18:26:16 -05:00
for tree in &**list {
tree.expand_impl(prefix.clone(), cb);
}
}
}
}
}
2020-06-11 12:46:56 -05:00
macro_rules! impl_froms {
($e:ident { $($v:ident ($t:ty)),* $(,)? }) => {
$(
impl From<$t> for $e {
fn from(it: $t) -> $e {
$e::$v(it)
}
}
)*
}
}
impl ModItem {
pub fn as_assoc_item(&self) -> Option<AssocItem> {
match self {
ModItem::Import(_)
2020-06-22 08:07:06 -05:00
| ModItem::ExternCrate(_)
| ModItem::ExternBlock(_)
| ModItem::Struct(_)
| ModItem::Union(_)
| ModItem::Enum(_)
| ModItem::Static(_)
| ModItem::Trait(_)
| ModItem::Impl(_)
2020-12-15 08:37:37 -06:00
| ModItem::Mod(_)
2020-12-15 11:43:19 -06:00
| ModItem::MacroRules(_)
| ModItem::MacroDef(_) => None,
ModItem::MacroCall(call) => Some(AssocItem::MacroCall(*call)),
ModItem::Const(konst) => Some(AssocItem::Const(*konst)),
ModItem::TypeAlias(alias) => Some(AssocItem::TypeAlias(*alias)),
ModItem::Function(func) => Some(AssocItem::Function(*func)),
}
}
2020-06-22 08:07:06 -05:00
pub fn downcast<N: ItemTreeNode>(self) -> Option<FileItemTreeId<N>> {
N::id_from_mod_item(self)
}
pub fn ast_id(&self, tree: &ItemTree) -> FileAstId<ast::Item> {
match self {
ModItem::Import(it) => tree[it.index].ast_id().upcast(),
ModItem::ExternCrate(it) => tree[it.index].ast_id().upcast(),
ModItem::ExternBlock(it) => tree[it.index].ast_id().upcast(),
ModItem::Function(it) => tree[it.index].ast_id().upcast(),
ModItem::Struct(it) => tree[it.index].ast_id().upcast(),
ModItem::Union(it) => tree[it.index].ast_id().upcast(),
ModItem::Enum(it) => tree[it.index].ast_id().upcast(),
ModItem::Const(it) => tree[it.index].ast_id().upcast(),
ModItem::Static(it) => tree[it.index].ast_id().upcast(),
ModItem::Trait(it) => tree[it.index].ast_id().upcast(),
ModItem::Impl(it) => tree[it.index].ast_id().upcast(),
ModItem::TypeAlias(it) => tree[it.index].ast_id().upcast(),
ModItem::Mod(it) => tree[it.index].ast_id().upcast(),
ModItem::MacroCall(it) => tree[it.index].ast_id().upcast(),
2020-12-15 08:37:37 -06:00
ModItem::MacroRules(it) => tree[it.index].ast_id().upcast(),
2020-12-15 11:43:19 -06:00
ModItem::MacroDef(it) => tree[it.index].ast_id().upcast(),
}
}
}
#[derive(Debug, Copy, Clone, Eq, PartialEq)]
2020-03-25 09:33:01 -05:00
pub enum AssocItem {
2020-06-16 12:20:29 -05:00
Function(FileItemTreeId<Function>),
TypeAlias(FileItemTreeId<TypeAlias>),
Const(FileItemTreeId<Const>),
MacroCall(FileItemTreeId<MacroCall>),
2020-03-25 09:33:01 -05:00
}
2020-06-11 12:46:56 -05:00
impl_froms!(AssocItem {
2020-06-16 12:20:29 -05:00
Function(FileItemTreeId<Function>),
TypeAlias(FileItemTreeId<TypeAlias>),
Const(FileItemTreeId<Const>),
MacroCall(FileItemTreeId<MacroCall>),
2020-06-11 12:46:56 -05:00
});
2020-06-22 08:07:06 -05:00
impl From<AssocItem> for ModItem {
fn from(item: AssocItem) -> Self {
match item {
AssocItem::Function(it) => it.into(),
AssocItem::TypeAlias(it) => it.into(),
AssocItem::Const(it) => it.into(),
AssocItem::MacroCall(it) => it.into(),
}
}
}
2020-06-11 12:46:56 -05:00
#[derive(Debug, Eq, PartialEq)]
2020-03-25 09:33:01 -05:00
pub struct Variant {
pub name: Name,
pub fields: Fields,
}
#[derive(Debug, Clone, PartialEq, Eq)]
pub enum Fields {
2021-10-04 22:10:25 -05:00
Record(IdxRange<Field>),
Tuple(IdxRange<Field>),
2020-03-25 09:33:01 -05:00
Unit,
}
/// A single field of an enum variant or struct
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct Field {
pub name: Name,
2021-04-01 12:46:43 -05:00
pub type_ref: Interned<TypeRef>,
2020-06-24 08:36:18 -05:00
pub visibility: RawVisibilityId,
2020-03-25 09:33:01 -05:00
}