rust-analyzer/crates/ra_hir/src/ids.rs

394 lines
13 KiB
Rust
Raw Normal View History

2019-01-24 21:02:18 +00:00
use std::{
2019-01-24 22:05:50 +00:00
hash::{Hash, Hasher},
2019-02-11 14:44:54 +00:00
sync::Arc,
2019-01-24 21:02:18 +00:00
};
2019-01-24 12:28:50 +00:00
2019-04-09 19:51:22 +00:00
use ra_db::{FileId, salsa};
2019-05-13 22:42:59 +00:00
use ra_syntax::{TreeArc, AstNode, ast, SyntaxNode};
use ra_prof::profile;
use mbe::MacroRules;
2019-01-01 20:21:16 +00:00
2019-01-08 12:57:45 +00:00
use crate::{
2019-06-11 15:07:42 +00:00
Module, DefDatabase, AstId, FileAstId, AstDatabase, Source,
2019-01-08 12:57:45 +00:00
};
2019-01-06 12:16:21 +00:00
/// hir makes heavy use of ids: integer (u32) handlers to various things. You
2019-01-01 19:47:10 +00:00
/// can think of id as a pointer (but without a lifetime) or a file descriptor
/// (but for hir objects).
///
/// This module defines a bunch of ids we are using. The most important ones are
/// probably `HirFileId` and `DefId`.
2019-02-11 16:18:27 +00:00
/// Input to the analyzer is a set of files, where each file is identified by
2019-01-01 19:47:10 +00:00
/// `FileId` and contains source code. However, another source of source code in
/// Rust are macros: each macro can be thought of as producing a "temporary
/// file". To assign an id to such a file, we use the id of the macro call that
2019-01-01 19:47:10 +00:00
/// produced the file. So, a `HirFileId` is either a `FileId` (source code
/// written by user), or a `MacroCallId` (source code produced by macro).
///
2019-02-11 16:18:27 +00:00
/// What is a `MacroCallId`? Simplifying, it's a `HirFileId` of a file
/// containing the call plus the offset of the macro call in the file. Note that
/// this is a recursive definition! However, the size_of of `HirFileId` is
/// finite (because everything bottoms out at the real `FileId`) and small
/// (`MacroCallId` uses the location interner).
2019-01-01 19:47:10 +00:00
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
2019-01-01 20:21:16 +00:00
pub struct HirFileId(HirFileIdRepr);
impl HirFileId {
2019-01-02 13:00:01 +00:00
/// For macro-expansion files, returns the file original source file the
2019-02-11 16:18:27 +00:00
/// expansion originated from.
2019-06-01 18:17:57 +00:00
pub fn original_file(self, db: &impl AstDatabase) -> FileId {
2019-01-01 20:21:16 +00:00
match self.0 {
HirFileIdRepr::File(file_id) => file_id,
2019-05-13 22:12:07 +00:00
HirFileIdRepr::Macro(macro_file) => {
let loc = macro_file.macro_call_id.loc(db);
2019-03-26 15:03:17 +00:00
loc.ast_id.file_id().original_file(db)
2019-01-01 20:21:16 +00:00
}
}
}
/// XXX: this is a temporary function, which should go away when we implement the
/// nameresolution+macro expansion combo. Prefer using `original_file` if
/// possible.
pub fn as_original_file(self) -> FileId {
2019-01-01 20:21:16 +00:00
match self.0 {
HirFileIdRepr::File(file_id) => file_id,
HirFileIdRepr::Macro(_r) => panic!("macro generated file: {:?}", self),
}
}
2019-01-02 13:00:01 +00:00
2019-05-13 22:42:59 +00:00
pub(crate) fn parse_or_expand_query(
2019-06-01 18:17:57 +00:00
db: &impl AstDatabase,
2019-03-26 15:57:57 +00:00
file_id: HirFileId,
2019-05-13 22:42:59 +00:00
) -> Option<TreeArc<SyntaxNode>> {
2019-01-01 20:21:16 +00:00
match file_id.0 {
2019-05-28 15:07:39 +00:00
HirFileIdRepr::File(file_id) => Some(db.parse(file_id).tree.syntax().to_owned()),
HirFileIdRepr::Macro(macro_file) => db.parse_macro(macro_file),
}
}
pub(crate) fn parse_macro_query(
db: &impl AstDatabase,
macro_file: MacroFile,
) -> Option<TreeArc<SyntaxNode>> {
let _p = profile("parse_macro_query");
let macro_call_id = macro_file.macro_call_id;
let tt = db
.macro_expand(macro_call_id)
.map_err(|err| {
// Note:
// The final goal we would like to make all parse_macro success,
// such that the following log will not call anyway.
log::warn!(
"fail on macro_parse: (reason: {}) {}",
err,
macro_call_id.debug_dump(db)
);
})
.ok()?;
match macro_file.macro_file_kind {
MacroFileKind::Items => Some(mbe::token_tree_to_ast_item_list(&tt).syntax().to_owned()),
MacroFileKind::Expr => {
mbe::token_tree_to_expr(&tt).ok().map(|it| it.syntax().to_owned())
2019-01-01 20:21:16 +00:00
}
}
}
}
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
enum HirFileIdRepr {
2019-01-01 19:47:10 +00:00
File(FileId),
2019-05-13 22:12:07 +00:00
Macro(MacroFile),
}
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
pub struct MacroFile {
2019-05-13 22:12:07 +00:00
macro_call_id: MacroCallId,
macro_file_kind: MacroFileKind,
}
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
pub(crate) enum MacroFileKind {
Items,
2019-05-13 22:52:31 +00:00
Expr,
2019-01-01 19:47:10 +00:00
}
2019-01-01 20:21:16 +00:00
impl From<FileId> for HirFileId {
fn from(file_id: FileId) -> HirFileId {
HirFileId(HirFileIdRepr::File(file_id))
}
}
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
2019-03-26 15:03:17 +00:00
pub struct MacroDefId(pub(crate) AstId<ast::MacroCall>);
2019-06-01 18:17:57 +00:00
pub(crate) fn macro_def_query(db: &impl AstDatabase, id: MacroDefId) -> Option<Arc<MacroRules>> {
2019-03-26 15:03:17 +00:00
let macro_call = id.0.to_node(db);
let arg = macro_call.token_tree()?;
let (tt, _) = mbe::ast_to_token_tree(arg).or_else(|| {
log::warn!("fail on macro_def to token tree: {:#?}", arg);
None
})?;
let rules = MacroRules::parse(&tt).ok().or_else(|| {
log::warn!("fail on macro_def parse: {:#?}", tt);
None
})?;
Some(Arc::new(rules))
}
2019-06-01 18:17:57 +00:00
pub(crate) fn macro_arg_query(db: &impl AstDatabase, id: MacroCallId) -> Option<Arc<tt::Subtree>> {
let loc = id.loc(db);
let macro_call = loc.ast_id.to_node(db);
let arg = macro_call.token_tree()?;
let (tt, _) = mbe::ast_to_token_tree(arg)?;
Some(Arc::new(tt))
}
pub(crate) fn macro_expand_query(
2019-06-01 18:17:57 +00:00
db: &impl AstDatabase,
id: MacroCallId,
) -> Result<Arc<tt::Subtree>, String> {
let loc = id.loc(db);
let macro_arg = db.macro_arg(id).ok_or("Fail to args in to tt::TokenTree")?;
2019-05-04 14:42:24 +00:00
let macro_rules = db.macro_def(loc.def).ok_or("Fail to find macro definition")?;
let tt = macro_rules.expand(&macro_arg).map_err(|err| format!("{:?}", err))?;
// Set a hard limit for the expanded tt
let count = tt.count();
if count > 65536 {
return Err(format!("Total tokens count exceed limit : count = {}", count));
}
Ok(Arc::new(tt))
2019-05-04 14:42:24 +00:00
}
2019-04-09 19:51:22 +00:00
macro_rules! impl_intern_key {
($name:ident) => {
impl salsa::InternKey for $name {
fn from_intern_id(v: salsa::InternId) -> Self {
$name(v)
}
fn as_intern_id(&self) -> salsa::InternId {
self.0
}
}
};
}
2019-01-01 21:37:36 +00:00
/// `MacroCallId` identifies a particular macro invocation, like
/// `println!("Hello, {}", world)`.
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
2019-04-09 19:51:22 +00:00
pub struct MacroCallId(salsa::InternId);
impl_intern_key!(MacroCallId);
2019-01-01 21:37:36 +00:00
#[derive(Debug, Clone, PartialEq, Eq, Hash)]
2019-01-01 21:37:36 +00:00
pub struct MacroCallLoc {
pub(crate) def: MacroDefId,
2019-03-26 15:03:17 +00:00
pub(crate) ast_id: AstId<ast::MacroCall>,
2019-01-01 21:37:36 +00:00
}
impl MacroCallId {
2019-06-01 18:17:57 +00:00
pub(crate) fn loc(self, db: &impl AstDatabase) -> MacroCallLoc {
2019-04-09 19:51:22 +00:00
db.lookup_intern_macro(self)
2019-01-01 21:37:36 +00:00
}
2019-05-13 22:12:07 +00:00
pub(crate) fn as_file(self, kind: MacroFileKind) -> HirFileId {
let macro_file = MacroFile { macro_call_id: self, macro_file_kind: kind };
HirFileId(HirFileIdRepr::Macro(macro_file))
}
2019-01-01 21:37:36 +00:00
}
impl MacroCallLoc {
2019-06-01 18:17:57 +00:00
pub(crate) fn id(self, db: &impl AstDatabase) -> MacroCallId {
2019-04-09 19:51:22 +00:00
db.intern_macro(self)
2019-01-01 21:37:36 +00:00
}
}
2019-01-24 22:05:50 +00:00
#[derive(Debug)]
2019-01-24 12:28:50 +00:00
pub struct ItemLoc<N: AstNode> {
pub(crate) module: Module,
2019-03-26 15:27:22 +00:00
ast_id: AstId<N>,
2019-01-24 12:28:50 +00:00
}
2019-01-24 22:05:50 +00:00
impl<N: AstNode> PartialEq for ItemLoc<N> {
fn eq(&self, other: &Self) -> bool {
2019-03-26 15:27:22 +00:00
self.module == other.module && self.ast_id == other.ast_id
2019-01-24 22:05:50 +00:00
}
}
impl<N: AstNode> Eq for ItemLoc<N> {}
impl<N: AstNode> Hash for ItemLoc<N> {
fn hash<H: Hasher>(&self, hasher: &mut H) {
self.module.hash(hasher);
2019-03-26 15:27:22 +00:00
self.ast_id.hash(hasher);
2019-01-24 22:05:50 +00:00
}
}
2019-01-24 21:26:54 +00:00
impl<N: AstNode> Clone for ItemLoc<N> {
fn clone(&self) -> ItemLoc<N> {
2019-03-26 15:27:22 +00:00
ItemLoc { module: self.module, ast_id: self.ast_id }
2019-01-24 12:28:50 +00:00
}
2019-01-24 21:26:54 +00:00
}
2019-01-24 12:28:50 +00:00
2019-01-24 21:26:54 +00:00
#[derive(Clone, Copy)]
pub(crate) struct LocationCtx<DB> {
db: DB,
module: Module,
file_id: HirFileId,
2019-01-24 12:28:50 +00:00
}
2019-06-01 18:17:57 +00:00
impl<'a, DB: DefDatabase + AstDatabase> LocationCtx<&'a DB> {
2019-01-24 21:26:54 +00:00
pub(crate) fn new(db: &'a DB, module: Module, file_id: HirFileId) -> LocationCtx<&'a DB> {
2019-02-08 11:49:43 +00:00
LocationCtx { db, module, file_id }
2019-01-24 12:28:50 +00:00
}
2019-01-24 21:26:54 +00:00
pub(crate) fn to_def<N, DEF>(self, ast: &N) -> DEF
where
2019-01-24 22:05:50 +00:00
N: AstNode,
2019-01-24 21:26:54 +00:00
DEF: AstItemDef<N>,
{
DEF::from_ast(self, ast)
}
2019-01-24 12:28:50 +00:00
}
2019-04-09 19:51:22 +00:00
pub(crate) trait AstItemDef<N: AstNode>: salsa::InternKey + Clone {
fn intern(db: &impl DefDatabase, loc: ItemLoc<N>) -> Self;
fn lookup_intern(self, db: &impl DefDatabase) -> ItemLoc<N>;
2019-06-01 18:17:57 +00:00
fn from_ast(ctx: LocationCtx<&(impl AstDatabase + DefDatabase)>, ast: &N) -> Self {
2019-03-26 16:00:11 +00:00
let items = ctx.db.ast_id_map(ctx.file_id);
2019-03-26 15:27:22 +00:00
let item_id = items.ast_id(ast);
Self::from_ast_id(ctx, item_id)
}
2019-06-01 18:17:57 +00:00
fn from_ast_id(
ctx: LocationCtx<&(impl AstDatabase + DefDatabase)>,
ast_id: FileAstId<N>,
) -> Self {
2019-03-26 15:27:22 +00:00
let loc = ItemLoc { module: ctx.module, ast_id: ast_id.with_file_id(ctx.file_id) };
2019-04-09 19:51:22 +00:00
Self::intern(ctx.db, loc)
2019-01-24 21:26:54 +00:00
}
2019-06-11 15:07:42 +00:00
fn source(self, db: &(impl AstDatabase + DefDatabase)) -> Source<TreeArc<N>> {
2019-04-09 19:51:22 +00:00
let loc = self.lookup_intern(db);
2019-03-26 15:27:22 +00:00
let ast = loc.ast_id.to_node(db);
2019-06-11 15:07:42 +00:00
Source { file_id: loc.ast_id.file_id(), ast }
2019-01-24 21:02:18 +00:00
}
fn module(self, db: &impl DefDatabase) -> Module {
2019-04-09 19:51:22 +00:00
let loc = self.lookup_intern(db);
2019-01-24 21:02:18 +00:00
loc.module
}
}
2019-01-24 10:34:41 +00:00
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
2019-04-09 19:51:22 +00:00
pub struct FunctionId(salsa::InternId);
impl_intern_key!(FunctionId);
2019-01-24 21:02:18 +00:00
impl AstItemDef<ast::FnDef> for FunctionId {
2019-04-09 19:51:22 +00:00
fn intern(db: &impl DefDatabase, loc: ItemLoc<ast::FnDef>) -> Self {
db.intern_function(loc)
}
fn lookup_intern(self, db: &impl DefDatabase) -> ItemLoc<ast::FnDef> {
db.lookup_intern_function(self)
2019-01-24 10:34:41 +00:00
}
}
2019-01-24 13:18:20 +00:00
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
2019-04-09 19:51:22 +00:00
pub struct StructId(salsa::InternId);
impl_intern_key!(StructId);
2019-01-24 21:02:18 +00:00
impl AstItemDef<ast::StructDef> for StructId {
2019-04-09 19:51:22 +00:00
fn intern(db: &impl DefDatabase, loc: ItemLoc<ast::StructDef>) -> Self {
db.intern_struct(loc)
}
fn lookup_intern(self, db: &impl DefDatabase) -> ItemLoc<ast::StructDef> {
db.lookup_intern_struct(self)
2019-01-24 13:18:20 +00:00
}
}
2019-01-24 14:56:00 +00:00
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
2019-04-09 19:51:22 +00:00
pub struct EnumId(salsa::InternId);
impl_intern_key!(EnumId);
2019-01-24 21:02:18 +00:00
impl AstItemDef<ast::EnumDef> for EnumId {
2019-04-09 19:51:22 +00:00
fn intern(db: &impl DefDatabase, loc: ItemLoc<ast::EnumDef>) -> Self {
db.intern_enum(loc)
}
fn lookup_intern(self, db: &impl DefDatabase) -> ItemLoc<ast::EnumDef> {
db.lookup_intern_enum(self)
2019-01-24 14:56:00 +00:00
}
}
2019-01-24 21:50:08 +00:00
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
2019-04-09 19:51:22 +00:00
pub struct ConstId(salsa::InternId);
impl_intern_key!(ConstId);
2019-01-24 21:50:08 +00:00
impl AstItemDef<ast::ConstDef> for ConstId {
2019-04-09 19:51:22 +00:00
fn intern(db: &impl DefDatabase, loc: ItemLoc<ast::ConstDef>) -> Self {
db.intern_const(loc)
}
fn lookup_intern(self, db: &impl DefDatabase) -> ItemLoc<ast::ConstDef> {
db.lookup_intern_const(self)
2019-01-24 21:50:08 +00:00
}
}
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
2019-04-09 19:51:22 +00:00
pub struct StaticId(salsa::InternId);
impl_intern_key!(StaticId);
2019-01-24 21:50:08 +00:00
impl AstItemDef<ast::StaticDef> for StaticId {
2019-04-09 19:51:22 +00:00
fn intern(db: &impl DefDatabase, loc: ItemLoc<ast::StaticDef>) -> Self {
db.intern_static(loc)
}
fn lookup_intern(self, db: &impl DefDatabase) -> ItemLoc<ast::StaticDef> {
db.lookup_intern_static(self)
2019-01-24 21:50:08 +00:00
}
}
2019-01-24 22:31:32 +00:00
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
2019-04-09 19:51:22 +00:00
pub struct TraitId(salsa::InternId);
impl_intern_key!(TraitId);
2019-01-24 22:31:32 +00:00
impl AstItemDef<ast::TraitDef> for TraitId {
2019-04-09 19:51:22 +00:00
fn intern(db: &impl DefDatabase, loc: ItemLoc<ast::TraitDef>) -> Self {
db.intern_trait(loc)
}
fn lookup_intern(self, db: &impl DefDatabase) -> ItemLoc<ast::TraitDef> {
db.lookup_intern_trait(self)
2019-01-24 22:31:32 +00:00
}
}
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
2019-04-09 19:51:22 +00:00
pub struct TypeAliasId(salsa::InternId);
impl_intern_key!(TypeAliasId);
2019-03-26 16:15:39 +00:00
impl AstItemDef<ast::TypeAliasDef> for TypeAliasId {
2019-04-09 19:51:22 +00:00
fn intern(db: &impl DefDatabase, loc: ItemLoc<ast::TypeAliasDef>) -> Self {
db.intern_type_alias(loc)
}
fn lookup_intern(self, db: &impl DefDatabase) -> ItemLoc<ast::TypeAliasDef> {
db.lookup_intern_type_alias(self)
2019-01-24 22:31:32 +00:00
}
}
2019-04-20 15:05:25 +00:00
impl MacroCallId {
2019-06-01 18:17:57 +00:00
pub fn debug_dump(&self, db: &impl AstDatabase) -> String {
2019-04-20 15:05:25 +00:00
let loc = self.clone().loc(db);
let node = loc.ast_id.to_node(db);
let syntax_str = node.syntax().text().chunks().collect::<Vec<_>>().join(" ");
2019-04-20 15:05:25 +00:00
// dump the file name
2019-05-13 22:12:07 +00:00
let file_id: HirFileId = self.loc(db).ast_id.file_id();
2019-04-20 15:05:25 +00:00
let original = file_id.original_file(db);
let macro_rules = db.macro_def(loc.def);
format!(
2019-06-01 18:17:57 +00:00
"macro call [file: {:?}] : {}\nhas rules: {}",
db.file_relative_path(original),
syntax_str,
macro_rules.is_some()
)
2019-04-20 15:05:25 +00:00
}
}
/// This exists just for Chalk, because Chalk just has a single `StructId` where
/// we have different kinds of ADTs, primitive types and special type
/// constructors like tuples and function pointers.
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
pub struct TypeCtorId(salsa::InternId);
impl_intern_key!(TypeCtorId);
/// This exists just for Chalk, because our ImplIds are only unique per module.
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
pub struct GlobalImplId(salsa::InternId);
impl_intern_key!(GlobalImplId);