1 //! HIR (previously known as descriptors) provides a high-level object oriented
2 //! access to Rust code.
4 //! The principal difference between HIR and syntax trees is that HIR is bound
5 //! to a particular crate instance. That is, it has cfg flags and features
6 //! applied. So, the relation between syntax and HIR is many-to-one.
8 //! HIR is the public API of the all of the compiler logic above syntax trees.
9 //! It is written in "OO" style. Each type is self contained (as in, it knows it's
10 //! parents and full context). It should be "clean code".
12 //! `hir_*` crates are the implementation of the compiler logic.
13 //! They are written in "ECS" style, with relatively little abstractions.
14 //! Many types are not self-contained, and explicitly use local indexes, arenas, etc.
16 //! `hir` is what insulates the "we don't know how to actually write an incremental compiler"
17 //! from the ide with completions, hovers, etc. It is a (soft, internal) boundary:
18 //! https://www.tedinski.com/2018/02/06/system-boundaries.html.
20 #![recursion_limit = "512"]
34 use std::{iter, sync::Arc};
36 use arrayvec::ArrayVec;
37 use base_db::{CrateDisplayName, CrateId, Edition, FileId};
40 adt::{ReprKind, VariantData},
41 expr::{BindingAnnotation, LabelId, Pat, PatId},
42 item_tree::ItemTreeNode,
43 lang_item::LangItemTarget,
45 resolver::{HasResolver, Resolver},
48 AdtId, AssocContainerId, AssocItemId, AssocItemLoc, AttrDefId, ConstId, ConstParamId,
49 DefWithBodyId, EnumId, FunctionId, GenericDefId, HasModule, ImplId, LifetimeParamId,
50 LocalEnumVariantId, LocalFieldId, Lookup, ModuleId, StaticId, StructId, TraitId, TypeAliasId,
53 use hir_expand::{diagnostics::DiagnosticSink, name::name, MacroDefKind};
58 method_resolution::{self, def_crates, TyFingerprint},
62 AliasEq, AliasTy, BoundVar, CallableDefId, CallableSig, Canonical, CanonicalVarKinds, Cast,
63 DebruijnIndex, InEnvironment, Interner, QuantifiedWhereClause, Scalar, Solution, Substitution,
64 TraitEnvironment, TraitRefExt, Ty, TyBuilder, TyDefId, TyExt, TyKind, TyVariableKind,
67 use itertools::Itertools;
68 use rustc_hash::FxHashSet;
69 use stdx::{format_to, impl_from};
71 ast::{self, AttrsOwner, NameOwner},
74 use tt::{Ident, Leaf, Literal, TokenTree};
76 use crate::db::{DefDatabase, HirDatabase};
79 attrs::{HasAttrs, Namespace},
80 has_source::HasSource,
81 semantics::{PathResolution, Semantics, SemanticsScope},
84 // Be careful with these re-exports.
86 // `hir` is the boundary between the compiler and the IDE. It should try hard to
87 // isolate the compiler from the ide, to allow the two to be refactored
88 // independently. Re-exporting something from the compiler is the sure way to
89 // breach the boundary.
91 // Generally, a refactoring which *removes* a name from this list is a good
94 cfg::{CfgAtom, CfgExpr, CfgOptions},
97 attr::{Attr, Attrs, AttrsWithOwner, Documentation},
98 body::scope::ExprScopes,
99 find_path::PrefixKind,
101 item_scope::ItemInNs,
102 nameres::ModuleSource,
103 path::{ModPath, PathKind},
104 type_ref::{Mutability, TypeRef},
105 visibility::Visibility,
109 ExpandResult, HirFileId, InFile, MacroCallId, MacroCallLoc, /* FIXME */ MacroDefId,
112 hir_ty::display::HirDisplay,
115 // These are negative re-exports: pub using these names is forbidden, they
116 // should remain private to hir internals.
120 hir_expand::{hygiene::Hygiene, name::AsName},
123 /// hir::Crate describes a single crate. It's the main interface with which
124 /// a crate's dependencies interact. Mostly, it should be just a proxy for the
126 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
128 pub(crate) id: CrateId,
132 pub struct CrateDependency {
138 pub fn dependencies(self, db: &dyn HirDatabase) -> Vec<CrateDependency> {
139 db.crate_graph()[self.id]
143 let krate = Crate { id: dep.crate_id };
144 let name = dep.as_name();
145 CrateDependency { krate, name }
150 pub fn reverse_dependencies(self, db: &dyn HirDatabase) -> Vec<Crate> {
151 let crate_graph = db.crate_graph();
155 crate_graph[krate].dependencies.iter().any(|it| it.crate_id == self.id)
157 .map(|id| Crate { id })
161 pub fn transitive_reverse_dependencies(self, db: &dyn HirDatabase) -> Vec<Crate> {
162 db.crate_graph().transitive_rev_deps(self.id).into_iter().map(|id| Crate { id }).collect()
165 pub fn root_module(self, db: &dyn HirDatabase) -> Module {
166 let def_map = db.crate_def_map(self.id);
167 Module { id: def_map.module_id(def_map.root()) }
170 pub fn root_file(self, db: &dyn HirDatabase) -> FileId {
171 db.crate_graph()[self.id].root_file_id
174 pub fn edition(self, db: &dyn HirDatabase) -> Edition {
175 db.crate_graph()[self.id].edition
178 pub fn display_name(self, db: &dyn HirDatabase) -> Option<CrateDisplayName> {
179 db.crate_graph()[self.id].display_name.clone()
182 pub fn query_external_importables(
184 db: &dyn DefDatabase,
185 query: import_map::Query,
186 ) -> impl Iterator<Item = Either<ModuleDef, MacroDef>> {
187 import_map::search_dependencies(db, self.into(), query).into_iter().map(|item| match item {
188 ItemInNs::Types(mod_id) | ItemInNs::Values(mod_id) => Either::Left(mod_id.into()),
189 ItemInNs::Macros(mac_id) => Either::Right(mac_id.into()),
193 pub fn all(db: &dyn HirDatabase) -> Vec<Crate> {
194 db.crate_graph().iter().map(|id| Crate { id }).collect()
197 /// Try to get the root URL of the documentation of a crate.
198 pub fn get_html_root_url(self: &Crate, db: &dyn HirDatabase) -> Option<String> {
199 // Look for #![doc(html_root_url = "...")]
200 let attrs = db.attrs(AttrDefId::ModuleId(self.root_module(db).into()));
201 let doc_attr_q = attrs.by_key("doc");
203 if !doc_attr_q.exists() {
207 let doc_url = doc_attr_q.tt_values().map(|tt| {
208 let name = tt.token_trees.iter()
209 .skip_while(|tt| !matches!(tt, TokenTree::Leaf(Leaf::Ident(Ident{text: ref ident, ..})) if ident == "html_root_url"))
214 Some(TokenTree::Leaf(Leaf::Literal(Literal{ref text, ..}))) => Some(text),
219 doc_url.map(|s| s.trim_matches('"').trim_end_matches('/').to_owned() + "/")
222 pub fn cfg(&self, db: &dyn HirDatabase) -> CfgOptions {
223 db.crate_graph()[self.id].cfg_options.clone()
227 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
229 pub(crate) id: ModuleId,
232 /// The defs which can be visible in the module.
233 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
238 // Can't be directly declared, but can be imported.
243 TypeAlias(TypeAlias),
244 BuiltinType(BuiltinType),
249 Adt(Struct, Enum, Union),
259 impl From<VariantDef> for ModuleDef {
260 fn from(var: VariantDef) -> Self {
262 VariantDef::Struct(t) => Adt::from(t).into(),
263 VariantDef::Union(t) => Adt::from(t).into(),
264 VariantDef::Variant(t) => t.into(),
270 pub fn module(self, db: &dyn HirDatabase) -> Option<Module> {
272 ModuleDef::Module(it) => it.parent(db),
273 ModuleDef::Function(it) => Some(it.module(db)),
274 ModuleDef::Adt(it) => Some(it.module(db)),
275 ModuleDef::Variant(it) => Some(it.module(db)),
276 ModuleDef::Const(it) => Some(it.module(db)),
277 ModuleDef::Static(it) => Some(it.module(db)),
278 ModuleDef::Trait(it) => Some(it.module(db)),
279 ModuleDef::TypeAlias(it) => Some(it.module(db)),
280 ModuleDef::BuiltinType(_) => None,
284 pub fn canonical_path(&self, db: &dyn HirDatabase) -> Option<String> {
285 let mut segments = vec![self.name(db)?.to_string()];
286 for m in self.module(db)?.path_to_root(db) {
287 segments.extend(m.name(db).map(|it| it.to_string()))
290 Some(segments.join("::"))
293 pub fn definition_visibility(&self, db: &dyn HirDatabase) -> Option<Visibility> {
294 let module = match self {
295 ModuleDef::Module(it) => it.parent(db)?,
296 ModuleDef::Function(it) => return Some(it.visibility(db)),
297 ModuleDef::Adt(it) => it.module(db),
298 ModuleDef::Variant(it) => {
299 let parent = it.parent_enum(db);
300 let module = it.module(db);
301 return module.visibility_of(db, &ModuleDef::Adt(Adt::Enum(parent)));
303 ModuleDef::Const(it) => return Some(it.visibility(db)),
304 ModuleDef::Static(it) => it.module(db),
305 ModuleDef::Trait(it) => it.module(db),
306 ModuleDef::TypeAlias(it) => return Some(it.visibility(db)),
307 ModuleDef::BuiltinType(_) => return None,
310 module.visibility_of(db, self)
313 pub fn name(self, db: &dyn HirDatabase) -> Option<Name> {
315 ModuleDef::Adt(it) => Some(it.name(db)),
316 ModuleDef::Trait(it) => Some(it.name(db)),
317 ModuleDef::Function(it) => Some(it.name(db)),
318 ModuleDef::Variant(it) => Some(it.name(db)),
319 ModuleDef::TypeAlias(it) => Some(it.name(db)),
320 ModuleDef::Module(it) => it.name(db),
321 ModuleDef::Const(it) => it.name(db),
322 ModuleDef::Static(it) => it.name(db),
323 ModuleDef::BuiltinType(it) => Some(it.name()),
327 pub fn diagnostics(self, db: &dyn HirDatabase, sink: &mut DiagnosticSink) {
328 let id = match self {
329 ModuleDef::Adt(it) => match it {
330 Adt::Struct(it) => it.id.into(),
331 Adt::Enum(it) => it.id.into(),
332 Adt::Union(it) => it.id.into(),
334 ModuleDef::Trait(it) => it.id.into(),
335 ModuleDef::Function(it) => it.id.into(),
336 ModuleDef::TypeAlias(it) => it.id.into(),
337 ModuleDef::Module(it) => it.id.into(),
338 ModuleDef::Const(it) => it.id.into(),
339 ModuleDef::Static(it) => it.id.into(),
343 let module = match self.module(db) {
348 hir_ty::diagnostics::validate_module_item(db, module.id.krate(), id, sink)
353 /// Name of this module.
354 pub fn name(self, db: &dyn HirDatabase) -> Option<Name> {
355 let def_map = self.id.def_map(db.upcast());
356 let parent = def_map[self.id.local_id].parent?;
357 def_map[parent].children.iter().find_map(|(name, module_id)| {
358 if *module_id == self.id.local_id {
366 /// Returns the crate this module is part of.
367 pub fn krate(self) -> Crate {
368 Crate { id: self.id.krate() }
371 /// Topmost parent of this module. Every module has a `crate_root`, but some
372 /// might be missing `krate`. This can happen if a module's file is not included
373 /// in the module tree of any target in `Cargo.toml`.
374 pub fn crate_root(self, db: &dyn HirDatabase) -> Module {
375 let def_map = db.crate_def_map(self.id.krate());
376 Module { id: def_map.module_id(def_map.root()) }
379 /// Iterates over all child modules.
380 pub fn children(self, db: &dyn HirDatabase) -> impl Iterator<Item = Module> {
381 let def_map = self.id.def_map(db.upcast());
382 let children = def_map[self.id.local_id]
385 .map(|(_, module_id)| Module { id: def_map.module_id(*module_id) })
386 .collect::<Vec<_>>();
390 /// Finds a parent module.
391 pub fn parent(self, db: &dyn HirDatabase) -> Option<Module> {
392 // FIXME: handle block expressions as modules (their parent is in a different DefMap)
393 let def_map = self.id.def_map(db.upcast());
394 let parent_id = def_map[self.id.local_id].parent?;
395 Some(Module { id: def_map.module_id(parent_id) })
398 pub fn path_to_root(self, db: &dyn HirDatabase) -> Vec<Module> {
399 let mut res = vec![self];
401 while let Some(next) = curr.parent(db) {
408 /// Returns a `ModuleScope`: a set of items, visible in this module.
411 db: &dyn HirDatabase,
412 visible_from: Option<Module>,
413 ) -> Vec<(Name, ScopeDef)> {
414 self.id.def_map(db.upcast())[self.id.local_id]
417 .filter_map(|(name, def)| {
418 if let Some(m) = visible_from {
420 def.filter_visibility(|vis| vis.is_visible_from(db.upcast(), m.id));
421 if filtered.is_none() && !def.is_none() {
424 Some((name, filtered))
430 .flat_map(|(name, def)| {
431 ScopeDef::all_items(def).into_iter().map(move |item| (name.clone(), item))
436 pub fn visibility_of(self, db: &dyn HirDatabase, def: &ModuleDef) -> Option<Visibility> {
437 self.id.def_map(db.upcast())[self.id.local_id].scope.visibility_of(def.clone().into())
440 pub fn diagnostics(self, db: &dyn HirDatabase, sink: &mut DiagnosticSink) {
441 let _p = profile::span("Module::diagnostics").detail(|| {
442 format!("{:?}", self.name(db).map_or("<unknown>".into(), |name| name.to_string()))
444 let def_map = self.id.def_map(db.upcast());
445 def_map.add_diagnostics(db.upcast(), self.id.local_id, sink);
446 for decl in self.declarations(db) {
448 crate::ModuleDef::Function(f) => f.diagnostics(db, sink),
449 crate::ModuleDef::Module(m) => {
450 // Only add diagnostics from inline modules
451 if def_map[m.id.local_id].origin.is_inline() {
452 m.diagnostics(db, sink)
456 decl.diagnostics(db, sink);
461 for impl_def in self.impl_defs(db) {
462 for item in impl_def.items(db) {
463 if let AssocItem::Function(f) = item {
464 f.diagnostics(db, sink);
470 pub fn declarations(self, db: &dyn HirDatabase) -> Vec<ModuleDef> {
471 let def_map = self.id.def_map(db.upcast());
472 def_map[self.id.local_id].scope.declarations().map(ModuleDef::from).collect()
475 pub fn impl_defs(self, db: &dyn HirDatabase) -> Vec<Impl> {
476 let def_map = self.id.def_map(db.upcast());
477 def_map[self.id.local_id].scope.impls().map(Impl::from).collect()
480 /// Finds a path that can be used to refer to the given item from within
481 /// this module, if possible.
482 pub fn find_use_path(self, db: &dyn DefDatabase, item: impl Into<ItemInNs>) -> Option<ModPath> {
483 hir_def::find_path::find_path(db, item.into(), self.into())
486 /// Finds a path that can be used to refer to the given item from within
487 /// this module, if possible. This is used for returning import paths for use-statements.
488 pub fn find_use_path_prefixed(
490 db: &dyn DefDatabase,
491 item: impl Into<ItemInNs>,
492 prefix_kind: PrefixKind,
493 ) -> Option<ModPath> {
494 hir_def::find_path::find_path_prefixed(db, item.into(), self.into(), prefix_kind)
498 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
500 pub(crate) parent: VariantDef,
501 pub(crate) id: LocalFieldId,
504 #[derive(Debug, PartialEq, Eq)]
505 pub enum FieldSource {
506 Named(ast::RecordField),
507 Pos(ast::TupleField),
511 pub fn name(&self, db: &dyn HirDatabase) -> Name {
512 self.parent.variant_data(db).fields()[self.id].name.clone()
515 /// Returns the type as in the signature of the struct (i.e., with
516 /// placeholder types for type parameters). This is good for showing
517 /// signature help, but not so good to actually get the type of the field
518 /// when you actually have a variable of the struct.
519 pub fn ty(&self, db: &dyn HirDatabase) -> Type {
520 let var_id = self.parent.into();
521 let generic_def_id: GenericDefId = match self.parent {
522 VariantDef::Struct(it) => it.id.into(),
523 VariantDef::Union(it) => it.id.into(),
524 VariantDef::Variant(it) => it.parent.id.into(),
526 let substs = TyBuilder::type_params_subst(db, generic_def_id);
527 let ty = db.field_types(var_id)[self.id].clone().substitute(&Interner, &substs);
528 Type::new(db, self.parent.module(db).id.krate(), var_id, ty)
531 pub fn parent_def(&self, _db: &dyn HirDatabase) -> VariantDef {
536 impl HasVisibility for Field {
537 fn visibility(&self, db: &dyn HirDatabase) -> Visibility {
538 let variant_data = self.parent.variant_data(db);
539 let visibility = &variant_data.fields()[self.id].visibility;
540 let parent_id: hir_def::VariantId = self.parent.into();
541 visibility.resolve(db.upcast(), &parent_id.resolver(db.upcast()))
545 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
547 pub(crate) id: StructId,
551 pub fn module(self, db: &dyn HirDatabase) -> Module {
552 Module { id: self.id.lookup(db.upcast()).container }
555 pub fn krate(self, db: &dyn HirDatabase) -> Option<Crate> {
556 Some(self.module(db).krate())
559 pub fn name(self, db: &dyn HirDatabase) -> Name {
560 db.struct_data(self.id).name.clone()
563 pub fn fields(self, db: &dyn HirDatabase) -> Vec<Field> {
564 db.struct_data(self.id)
568 .map(|(id, _)| Field { parent: self.into(), id })
572 pub fn ty(self, db: &dyn HirDatabase) -> Type {
573 Type::from_def(db, self.id.lookup(db.upcast()).container.krate(), self.id)
576 pub fn repr(self, db: &dyn HirDatabase) -> Option<ReprKind> {
577 db.struct_data(self.id).repr.clone()
580 pub fn kind(self, db: &dyn HirDatabase) -> StructKind {
581 self.variant_data(db).kind()
584 fn variant_data(self, db: &dyn HirDatabase) -> Arc<VariantData> {
585 db.struct_data(self.id).variant_data.clone()
589 impl HasVisibility for Struct {
590 fn visibility(&self, db: &dyn HirDatabase) -> Visibility {
591 db.struct_data(self.id).visibility.resolve(db.upcast(), &self.id.resolver(db.upcast()))
595 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
597 pub(crate) id: UnionId,
601 pub fn name(self, db: &dyn HirDatabase) -> Name {
602 db.union_data(self.id).name.clone()
605 pub fn module(self, db: &dyn HirDatabase) -> Module {
606 Module { id: self.id.lookup(db.upcast()).container }
609 pub fn ty(self, db: &dyn HirDatabase) -> Type {
610 Type::from_def(db, self.id.lookup(db.upcast()).container.krate(), self.id)
613 pub fn fields(self, db: &dyn HirDatabase) -> Vec<Field> {
614 db.union_data(self.id)
618 .map(|(id, _)| Field { parent: self.into(), id })
622 fn variant_data(self, db: &dyn HirDatabase) -> Arc<VariantData> {
623 db.union_data(self.id).variant_data.clone()
627 impl HasVisibility for Union {
628 fn visibility(&self, db: &dyn HirDatabase) -> Visibility {
629 db.union_data(self.id).visibility.resolve(db.upcast(), &self.id.resolver(db.upcast()))
633 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
635 pub(crate) id: EnumId,
639 pub fn module(self, db: &dyn HirDatabase) -> Module {
640 Module { id: self.id.lookup(db.upcast()).container }
643 pub fn krate(self, db: &dyn HirDatabase) -> Option<Crate> {
644 Some(self.module(db).krate())
647 pub fn name(self, db: &dyn HirDatabase) -> Name {
648 db.enum_data(self.id).name.clone()
651 pub fn variants(self, db: &dyn HirDatabase) -> Vec<Variant> {
652 db.enum_data(self.id).variants.iter().map(|(id, _)| Variant { parent: self, id }).collect()
655 pub fn ty(self, db: &dyn HirDatabase) -> Type {
656 Type::from_def(db, self.id.lookup(db.upcast()).container.krate(), self.id)
660 impl HasVisibility for Enum {
661 fn visibility(&self, db: &dyn HirDatabase) -> Visibility {
662 db.enum_data(self.id).visibility.resolve(db.upcast(), &self.id.resolver(db.upcast()))
666 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
668 pub(crate) parent: Enum,
669 pub(crate) id: LocalEnumVariantId,
673 pub fn module(self, db: &dyn HirDatabase) -> Module {
674 self.parent.module(db)
676 pub fn parent_enum(self, _db: &dyn HirDatabase) -> Enum {
680 pub fn name(self, db: &dyn HirDatabase) -> Name {
681 db.enum_data(self.parent.id).variants[self.id].name.clone()
684 pub fn fields(self, db: &dyn HirDatabase) -> Vec<Field> {
685 self.variant_data(db)
688 .map(|(id, _)| Field { parent: self.into(), id })
692 pub fn kind(self, db: &dyn HirDatabase) -> StructKind {
693 self.variant_data(db).kind()
696 pub(crate) fn variant_data(self, db: &dyn HirDatabase) -> Arc<VariantData> {
697 db.enum_data(self.parent.id).variants[self.id].variant_data.clone()
702 #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
708 impl_from!(Struct, Union, Enum for Adt);
711 pub fn has_non_default_type_params(self, db: &dyn HirDatabase) -> bool {
712 let subst = db.generic_defaults(self.into());
713 subst.iter().any(|ty| ty.skip_binders().is_unknown())
716 /// Turns this ADT into a type. Any type parameters of the ADT will be
717 /// turned into unknown types, which is good for e.g. finding the most
718 /// general set of completions, but will not look very nice when printed.
719 pub fn ty(self, db: &dyn HirDatabase) -> Type {
720 let id = AdtId::from(self);
721 Type::from_def(db, id.module(db.upcast()).krate(), id)
724 pub fn module(self, db: &dyn HirDatabase) -> Module {
726 Adt::Struct(s) => s.module(db),
727 Adt::Union(s) => s.module(db),
728 Adt::Enum(e) => e.module(db),
732 pub fn krate(self, db: &dyn HirDatabase) -> Crate {
733 self.module(db).krate()
736 pub fn name(self, db: &dyn HirDatabase) -> Name {
738 Adt::Struct(s) => s.name(db),
739 Adt::Union(u) => u.name(db),
740 Adt::Enum(e) => e.name(db),
745 #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
746 pub enum VariantDef {
751 impl_from!(Struct, Union, Variant for VariantDef);
754 pub fn fields(self, db: &dyn HirDatabase) -> Vec<Field> {
756 VariantDef::Struct(it) => it.fields(db),
757 VariantDef::Union(it) => it.fields(db),
758 VariantDef::Variant(it) => it.fields(db),
762 pub fn module(self, db: &dyn HirDatabase) -> Module {
764 VariantDef::Struct(it) => it.module(db),
765 VariantDef::Union(it) => it.module(db),
766 VariantDef::Variant(it) => it.module(db),
770 pub fn name(&self, db: &dyn HirDatabase) -> Name {
772 VariantDef::Struct(s) => s.name(db),
773 VariantDef::Union(u) => u.name(db),
774 VariantDef::Variant(e) => e.name(db),
778 pub(crate) fn variant_data(self, db: &dyn HirDatabase) -> Arc<VariantData> {
780 VariantDef::Struct(it) => it.variant_data(db),
781 VariantDef::Union(it) => it.variant_data(db),
782 VariantDef::Variant(it) => it.variant_data(db),
787 /// The defs which have a body.
788 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
789 pub enum DefWithBody {
794 impl_from!(Function, Const, Static for DefWithBody);
797 pub fn module(self, db: &dyn HirDatabase) -> Module {
799 DefWithBody::Const(c) => c.module(db),
800 DefWithBody::Function(f) => f.module(db),
801 DefWithBody::Static(s) => s.module(db),
805 pub fn name(self, db: &dyn HirDatabase) -> Option<Name> {
807 DefWithBody::Function(f) => Some(f.name(db)),
808 DefWithBody::Static(s) => s.name(db),
809 DefWithBody::Const(c) => c.name(db),
814 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
815 pub struct Function {
816 pub(crate) id: FunctionId,
820 pub fn module(self, db: &dyn HirDatabase) -> Module {
821 self.id.lookup(db.upcast()).module(db.upcast()).into()
824 pub fn krate(self, db: &dyn HirDatabase) -> Option<Crate> {
825 Some(self.module(db).krate())
828 pub fn name(self, db: &dyn HirDatabase) -> Name {
829 db.function_data(self.id).name.clone()
832 /// Get this function's return type
833 pub fn ret_type(self, db: &dyn HirDatabase) -> Type {
834 let resolver = self.id.resolver(db.upcast());
835 let krate = self.id.lookup(db.upcast()).container.module(db.upcast()).krate();
836 let ret_type = &db.function_data(self.id).ret_type;
837 let ctx = hir_ty::TyLoweringContext::new(db, &resolver);
838 let ty = ctx.lower_ty(ret_type);
839 Type::new_with_resolver_inner(db, krate, &resolver, ty)
842 pub fn self_param(self, db: &dyn HirDatabase) -> Option<SelfParam> {
843 if !db.function_data(self.id).has_self_param() {
846 Some(SelfParam { func: self.id })
849 pub fn assoc_fn_params(self, db: &dyn HirDatabase) -> Vec<Param> {
850 let resolver = self.id.resolver(db.upcast());
851 let krate = self.id.lookup(db.upcast()).container.module(db.upcast()).krate();
852 let ctx = hir_ty::TyLoweringContext::new(db, &resolver);
853 let environment = db.trait_environment(self.id.into());
854 db.function_data(self.id)
858 .map(|(idx, type_ref)| {
859 let ty = Type { krate, env: environment.clone(), ty: ctx.lower_ty(type_ref) };
860 Param { func: self, ty, idx }
865 pub fn method_params(self, db: &dyn HirDatabase) -> Option<Vec<Param>> {
866 if self.self_param(db).is_none() {
869 let mut res = self.assoc_fn_params(db);
874 pub fn is_unsafe(self, db: &dyn HirDatabase) -> bool {
875 db.function_data(self.id).is_unsafe()
878 pub fn is_async(self, db: &dyn HirDatabase) -> bool {
879 db.function_data(self.id).is_async()
882 pub fn diagnostics(self, db: &dyn HirDatabase, sink: &mut DiagnosticSink) {
883 let krate = self.module(db).id.krate();
884 hir_def::diagnostics::validate_body(db.upcast(), self.id.into(), sink);
885 hir_ty::diagnostics::validate_module_item(db, krate, self.id.into(), sink);
886 hir_ty::diagnostics::validate_body(db, self.id.into(), sink);
889 /// Whether this function declaration has a definition.
891 /// This is false in the case of required (not provided) trait methods.
892 pub fn has_body(self, db: &dyn HirDatabase) -> bool {
893 db.function_data(self.id).has_body()
896 /// A textual representation of the HIR of this function for debugging purposes.
897 pub fn debug_hir(self, db: &dyn HirDatabase) -> String {
898 let body = db.body(self.id.into());
900 let mut result = String::new();
901 format_to!(result, "HIR expressions in the body of `{}`:\n", self.name(db));
902 for (id, expr) in body.exprs.iter() {
903 format_to!(result, "{:?}: {:?}\n", id, expr);
910 // Note: logically, this belongs to `hir_ty`, but we are not using it there yet.
917 impl From<hir_ty::Mutability> for Access {
918 fn from(mutability: hir_ty::Mutability) -> Access {
920 hir_ty::Mutability::Not => Access::Shared,
921 hir_ty::Mutability::Mut => Access::Exclusive,
926 #[derive(Clone, Debug)]
929 /// The index in parameter list, including self parameter.
935 pub fn ty(&self) -> &Type {
939 pub fn as_local(&self, db: &dyn HirDatabase) -> Local {
940 let parent = DefWithBodyId::FunctionId(self.func.into());
941 let body = db.body(parent);
942 Local { parent, pat_id: body.params[self.idx] }
945 pub fn pattern_source(&self, db: &dyn HirDatabase) -> Option<ast::Pat> {
946 self.source(db).and_then(|p| p.value.pat())
949 pub fn source(&self, db: &dyn HirDatabase) -> Option<InFile<ast::Param>> {
950 let InFile { file_id, value } = self.func.source(db)?;
951 let params = value.param_list()?;
952 if params.self_param().is_some() {
953 params.params().nth(self.idx.checked_sub(1)?)
955 params.params().nth(self.idx)
957 .map(|value| InFile { file_id, value })
961 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
962 pub struct SelfParam {
967 pub fn access(self, db: &dyn HirDatabase) -> Access {
968 let func_data = db.function_data(self.func);
972 .map(|param| match &**param {
973 TypeRef::Reference(.., mutability) => match mutability {
974 hir_def::type_ref::Mutability::Shared => Access::Shared,
975 hir_def::type_ref::Mutability::Mut => Access::Exclusive,
979 .unwrap_or(Access::Owned)
982 pub fn display(self, db: &dyn HirDatabase) -> &'static str {
983 match self.access(db) {
984 Access::Shared => "&self",
985 Access::Exclusive => "&mut self",
986 Access::Owned => "self",
990 pub fn source(&self, db: &dyn HirDatabase) -> Option<InFile<ast::SelfParam>> {
991 let InFile { file_id, value } = Function::from(self.func).source(db)?;
994 .and_then(|params| params.self_param())
995 .map(|value| InFile { file_id, value })
999 impl HasVisibility for Function {
1000 fn visibility(&self, db: &dyn HirDatabase) -> Visibility {
1001 let function_data = db.function_data(self.id);
1002 let visibility = &function_data.visibility;
1003 visibility.resolve(db.upcast(), &self.id.resolver(db.upcast()))
1007 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
1009 pub(crate) id: ConstId,
1013 pub fn module(self, db: &dyn HirDatabase) -> Module {
1014 Module { id: self.id.lookup(db.upcast()).module(db.upcast()) }
1017 pub fn krate(self, db: &dyn HirDatabase) -> Option<Crate> {
1018 Some(self.module(db).krate())
1021 pub fn name(self, db: &dyn HirDatabase) -> Option<Name> {
1022 db.const_data(self.id).name.clone()
1025 pub fn type_ref(self, db: &dyn HirDatabase) -> TypeRef {
1026 db.const_data(self.id).type_ref.as_ref().clone()
1030 impl HasVisibility for Const {
1031 fn visibility(&self, db: &dyn HirDatabase) -> Visibility {
1032 let function_data = db.const_data(self.id);
1033 let visibility = &function_data.visibility;
1034 visibility.resolve(db.upcast(), &self.id.resolver(db.upcast()))
1038 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
1040 pub(crate) id: StaticId,
1044 pub fn module(self, db: &dyn HirDatabase) -> Module {
1045 Module { id: self.id.lookup(db.upcast()).module(db.upcast()) }
1048 pub fn krate(self, db: &dyn HirDatabase) -> Option<Crate> {
1049 Some(self.module(db).krate())
1052 pub fn name(self, db: &dyn HirDatabase) -> Option<Name> {
1053 db.static_data(self.id).name.clone()
1056 pub fn is_mut(self, db: &dyn HirDatabase) -> bool {
1057 db.static_data(self.id).mutable
1061 impl HasVisibility for Static {
1062 fn visibility(&self, db: &dyn HirDatabase) -> Visibility {
1063 db.static_data(self.id).visibility.resolve(db.upcast(), &self.id.resolver(db.upcast()))
1067 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
1069 pub(crate) id: TraitId,
1073 pub fn module(self, db: &dyn HirDatabase) -> Module {
1074 Module { id: self.id.lookup(db.upcast()).container }
1077 pub fn name(self, db: &dyn HirDatabase) -> Name {
1078 db.trait_data(self.id).name.clone()
1081 pub fn items(self, db: &dyn HirDatabase) -> Vec<AssocItem> {
1082 db.trait_data(self.id).items.iter().map(|(_name, it)| (*it).into()).collect()
1085 pub fn is_auto(self, db: &dyn HirDatabase) -> bool {
1086 db.trait_data(self.id).is_auto
1090 impl HasVisibility for Trait {
1091 fn visibility(&self, db: &dyn HirDatabase) -> Visibility {
1092 db.trait_data(self.id).visibility.resolve(db.upcast(), &self.id.resolver(db.upcast()))
1096 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
1097 pub struct TypeAlias {
1098 pub(crate) id: TypeAliasId,
1102 pub fn has_non_default_type_params(self, db: &dyn HirDatabase) -> bool {
1103 let subst = db.generic_defaults(self.id.into());
1104 subst.iter().any(|ty| ty.skip_binders().is_unknown())
1107 pub fn module(self, db: &dyn HirDatabase) -> Module {
1108 Module { id: self.id.lookup(db.upcast()).module(db.upcast()) }
1111 pub fn krate(self, db: &dyn HirDatabase) -> Crate {
1112 self.module(db).krate()
1115 pub fn type_ref(self, db: &dyn HirDatabase) -> Option<TypeRef> {
1116 db.type_alias_data(self.id).type_ref.as_deref().cloned()
1119 pub fn ty(self, db: &dyn HirDatabase) -> Type {
1120 Type::from_def(db, self.id.lookup(db.upcast()).module(db.upcast()).krate(), self.id)
1123 pub fn name(self, db: &dyn HirDatabase) -> Name {
1124 db.type_alias_data(self.id).name.clone()
1128 impl HasVisibility for TypeAlias {
1129 fn visibility(&self, db: &dyn HirDatabase) -> Visibility {
1130 let function_data = db.type_alias_data(self.id);
1131 let visibility = &function_data.visibility;
1132 visibility.resolve(db.upcast(), &self.id.resolver(db.upcast()))
1136 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
1137 pub struct BuiltinType {
1138 pub(crate) inner: hir_def::builtin_type::BuiltinType,
1142 pub fn ty(self, db: &dyn HirDatabase, module: Module) -> Type {
1143 let resolver = module.id.resolver(db.upcast());
1144 Type::new_with_resolver(db, &resolver, TyBuilder::builtin(self.inner))
1145 .expect("crate not present in resolver")
1148 pub fn name(self) -> Name {
1149 self.inner.as_name()
1153 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
1154 pub enum MacroKind {
1161 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
1162 pub struct MacroDef {
1163 pub(crate) id: MacroDefId,
1167 /// FIXME: right now, this just returns the root module of the crate that
1168 /// defines this macro. The reasons for this is that macros are expanded
1169 /// early, in `hir_expand`, where modules simply do not exist yet.
1170 pub fn module(self, db: &dyn HirDatabase) -> Option<Module> {
1171 let krate = self.id.krate;
1172 let def_map = db.crate_def_map(krate);
1173 let module_id = def_map.root();
1174 Some(Module { id: def_map.module_id(module_id) })
1177 /// XXX: this parses the file
1178 pub fn name(self, db: &dyn HirDatabase) -> Option<Name> {
1179 match self.source(db)?.value {
1180 Either::Left(it) => it.name().map(|it| it.as_name()),
1181 Either::Right(it) => it.name().map(|it| it.as_name()),
1185 pub fn kind(&self) -> MacroKind {
1186 match self.id.kind {
1187 MacroDefKind::Declarative(_) => MacroKind::Declarative,
1188 MacroDefKind::BuiltIn(_, _) => MacroKind::BuiltIn,
1189 MacroDefKind::BuiltInDerive(_, _) => MacroKind::Derive,
1190 MacroDefKind::BuiltInEager(_, _) => MacroKind::BuiltIn,
1191 // FIXME might be a derive
1192 MacroDefKind::ProcMacro(_, _) => MacroKind::ProcMacro,
1197 /// Invariant: `inner.as_assoc_item(db).is_some()`
1198 /// We do not actively enforce this invariant.
1199 #[derive(Debug, Copy, Clone, PartialEq, Eq, Hash)]
1200 pub enum AssocItem {
1203 TypeAlias(TypeAlias),
1206 pub enum AssocItemContainer {
1210 pub trait AsAssocItem {
1211 fn as_assoc_item(self, db: &dyn HirDatabase) -> Option<AssocItem>;
1214 impl AsAssocItem for Function {
1215 fn as_assoc_item(self, db: &dyn HirDatabase) -> Option<AssocItem> {
1216 as_assoc_item(db, AssocItem::Function, self.id)
1219 impl AsAssocItem for Const {
1220 fn as_assoc_item(self, db: &dyn HirDatabase) -> Option<AssocItem> {
1221 as_assoc_item(db, AssocItem::Const, self.id)
1224 impl AsAssocItem for TypeAlias {
1225 fn as_assoc_item(self, db: &dyn HirDatabase) -> Option<AssocItem> {
1226 as_assoc_item(db, AssocItem::TypeAlias, self.id)
1229 impl AsAssocItem for ModuleDef {
1230 fn as_assoc_item(self, db: &dyn HirDatabase) -> Option<AssocItem> {
1232 ModuleDef::Function(it) => it.as_assoc_item(db),
1233 ModuleDef::Const(it) => it.as_assoc_item(db),
1234 ModuleDef::TypeAlias(it) => it.as_assoc_item(db),
1239 fn as_assoc_item<ID, DEF, CTOR, AST>(db: &dyn HirDatabase, ctor: CTOR, id: ID) -> Option<AssocItem>
1241 ID: Lookup<Data = AssocItemLoc<AST>>,
1243 CTOR: FnOnce(DEF) -> AssocItem,
1246 match id.lookup(db.upcast()).container {
1247 AssocContainerId::TraitId(_) | AssocContainerId::ImplId(_) => Some(ctor(DEF::from(id))),
1248 AssocContainerId::ModuleId(_) => None,
1253 pub fn name(self, db: &dyn HirDatabase) -> Option<Name> {
1255 AssocItem::Function(it) => Some(it.name(db)),
1256 AssocItem::Const(it) => it.name(db),
1257 AssocItem::TypeAlias(it) => Some(it.name(db)),
1260 pub fn module(self, db: &dyn HirDatabase) -> Module {
1262 AssocItem::Function(f) => f.module(db),
1263 AssocItem::Const(c) => c.module(db),
1264 AssocItem::TypeAlias(t) => t.module(db),
1267 pub fn container(self, db: &dyn HirDatabase) -> AssocItemContainer {
1268 let container = match self {
1269 AssocItem::Function(it) => it.id.lookup(db.upcast()).container,
1270 AssocItem::Const(it) => it.id.lookup(db.upcast()).container,
1271 AssocItem::TypeAlias(it) => it.id.lookup(db.upcast()).container,
1274 AssocContainerId::TraitId(id) => AssocItemContainer::Trait(id.into()),
1275 AssocContainerId::ImplId(id) => AssocItemContainer::Impl(id.into()),
1276 AssocContainerId::ModuleId(_) => panic!("invalid AssocItem"),
1280 pub fn containing_trait(self, db: &dyn HirDatabase) -> Option<Trait> {
1281 match self.container(db) {
1282 AssocItemContainer::Trait(t) => Some(t),
1288 impl HasVisibility for AssocItem {
1289 fn visibility(&self, db: &dyn HirDatabase) -> Visibility {
1291 AssocItem::Function(f) => f.visibility(db),
1292 AssocItem::Const(c) => c.visibility(db),
1293 AssocItem::TypeAlias(t) => t.visibility(db),
1298 #[derive(Clone, Copy, PartialEq, Eq, Debug, Hash)]
1299 pub enum GenericDef {
1303 TypeAlias(TypeAlias),
1305 // enum variants cannot have generics themselves, but their parent enums
1306 // can, and this makes some code easier to write
1308 // consts can have type parameters from their parents (i.e. associated consts of traits)
1313 Adt(Struct, Enum, Union),
1323 pub fn params(self, db: &dyn HirDatabase) -> Vec<GenericParam> {
1324 let generics = db.generic_params(self.into());
1325 let ty_params = generics
1328 .map(|(local_id, _)| TypeParam { id: TypeParamId { parent: self.into(), local_id } })
1329 .map(GenericParam::TypeParam);
1330 let lt_params = generics
1333 .map(|(local_id, _)| LifetimeParam {
1334 id: LifetimeParamId { parent: self.into(), local_id },
1336 .map(GenericParam::LifetimeParam);
1337 let const_params = generics
1340 .map(|(local_id, _)| ConstParam { id: ConstParamId { parent: self.into(), local_id } })
1341 .map(GenericParam::ConstParam);
1342 ty_params.chain(lt_params).chain(const_params).collect()
1345 pub fn type_params(self, db: &dyn HirDatabase) -> Vec<TypeParam> {
1346 let generics = db.generic_params(self.into());
1350 .map(|(local_id, _)| TypeParam { id: TypeParamId { parent: self.into(), local_id } })
1355 #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
1357 pub(crate) parent: DefWithBodyId,
1358 pub(crate) pat_id: PatId,
1362 pub fn is_param(self, db: &dyn HirDatabase) -> bool {
1363 let src = self.source(db);
1365 Either::Left(bind_pat) => {
1366 bind_pat.syntax().ancestors().any(|it| ast::Param::can_cast(it.kind()))
1368 Either::Right(_self_param) => true,
1372 pub fn as_self_param(self, db: &dyn HirDatabase) -> Option<SelfParam> {
1374 DefWithBodyId::FunctionId(func) if self.is_self(db) => Some(SelfParam { func }),
1379 // FIXME: why is this an option? It shouldn't be?
1380 pub fn name(self, db: &dyn HirDatabase) -> Option<Name> {
1381 let body = db.body(self.parent);
1382 match &body[self.pat_id] {
1383 Pat::Bind { name, .. } => Some(name.clone()),
1388 pub fn is_self(self, db: &dyn HirDatabase) -> bool {
1389 self.name(db) == Some(name![self])
1392 pub fn is_mut(self, db: &dyn HirDatabase) -> bool {
1393 let body = db.body(self.parent);
1394 matches!(&body[self.pat_id], Pat::Bind { mode: BindingAnnotation::Mutable, .. })
1397 pub fn parent(self, _db: &dyn HirDatabase) -> DefWithBody {
1401 pub fn module(self, db: &dyn HirDatabase) -> Module {
1402 self.parent(db).module(db)
1405 pub fn ty(self, db: &dyn HirDatabase) -> Type {
1406 let def = self.parent;
1407 let infer = db.infer(def);
1408 let ty = infer[self.pat_id].clone();
1409 let krate = def.module(db.upcast()).krate();
1410 Type::new(db, krate, def, ty)
1413 pub fn source(self, db: &dyn HirDatabase) -> InFile<Either<ast::IdentPat, ast::SelfParam>> {
1414 let (_body, source_map) = db.body_with_source_map(self.parent);
1415 let src = source_map.pat_syntax(self.pat_id).unwrap(); // Hmm...
1416 let root = src.file_syntax(db.upcast());
1418 ast.map_left(|it| it.cast().unwrap().to_node(&root)).map_right(|it| it.to_node(&root))
1423 #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
1425 pub(crate) parent: DefWithBodyId,
1426 pub(crate) label_id: LabelId,
1430 pub fn module(self, db: &dyn HirDatabase) -> Module {
1431 self.parent(db).module(db)
1434 pub fn parent(self, _db: &dyn HirDatabase) -> DefWithBody {
1438 pub fn name(self, db: &dyn HirDatabase) -> Name {
1439 let body = db.body(self.parent);
1440 body[self.label_id].name.clone()
1443 pub fn source(self, db: &dyn HirDatabase) -> InFile<ast::Label> {
1444 let (_body, source_map) = db.body_with_source_map(self.parent);
1445 let src = source_map.label_syntax(self.label_id);
1446 let root = src.file_syntax(db.upcast());
1447 src.map(|ast| ast.to_node(&root))
1451 #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
1452 pub enum GenericParam {
1453 TypeParam(TypeParam),
1454 LifetimeParam(LifetimeParam),
1455 ConstParam(ConstParam),
1457 impl_from!(TypeParam, LifetimeParam, ConstParam for GenericParam);
1460 pub fn module(self, db: &dyn HirDatabase) -> Module {
1462 GenericParam::TypeParam(it) => it.module(db),
1463 GenericParam::LifetimeParam(it) => it.module(db),
1464 GenericParam::ConstParam(it) => it.module(db),
1468 pub fn name(self, db: &dyn HirDatabase) -> Name {
1470 GenericParam::TypeParam(it) => it.name(db),
1471 GenericParam::LifetimeParam(it) => it.name(db),
1472 GenericParam::ConstParam(it) => it.name(db),
1477 #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
1478 pub struct TypeParam {
1479 pub(crate) id: TypeParamId,
1483 pub fn name(self, db: &dyn HirDatabase) -> Name {
1484 let params = db.generic_params(self.id.parent);
1485 params.types[self.id.local_id].name.clone().unwrap_or_else(Name::missing)
1488 pub fn module(self, db: &dyn HirDatabase) -> Module {
1489 self.id.parent.module(db.upcast()).into()
1492 pub fn ty(self, db: &dyn HirDatabase) -> Type {
1493 let resolver = self.id.parent.resolver(db.upcast());
1494 let krate = self.id.parent.module(db.upcast()).krate();
1495 let ty = TyKind::Placeholder(hir_ty::to_placeholder_idx(db, self.id)).intern(&Interner);
1496 Type::new_with_resolver_inner(db, krate, &resolver, ty)
1499 pub fn trait_bounds(self, db: &dyn HirDatabase) -> Vec<Trait> {
1500 db.generic_predicates_for_param(self.id)
1502 .filter_map(|pred| match &pred.skip_binders().skip_binders() {
1503 hir_ty::WhereClause::Implemented(trait_ref) => {
1504 Some(Trait::from(trait_ref.hir_trait_id()))
1511 pub fn default(self, db: &dyn HirDatabase) -> Option<Type> {
1512 let params = db.generic_defaults(self.id.parent);
1513 let local_idx = hir_ty::param_idx(db, self.id)?;
1514 let resolver = self.id.parent.resolver(db.upcast());
1515 let krate = self.id.parent.module(db.upcast()).krate();
1516 let ty = params.get(local_idx)?.clone();
1517 let subst = TyBuilder::type_params_subst(db, self.id.parent);
1518 let ty = ty.substitute(&Interner, &subst_prefix(&subst, local_idx));
1519 Some(Type::new_with_resolver_inner(db, krate, &resolver, ty))
1523 #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
1524 pub struct LifetimeParam {
1525 pub(crate) id: LifetimeParamId,
1528 impl LifetimeParam {
1529 pub fn name(self, db: &dyn HirDatabase) -> Name {
1530 let params = db.generic_params(self.id.parent);
1531 params.lifetimes[self.id.local_id].name.clone()
1534 pub fn module(self, db: &dyn HirDatabase) -> Module {
1535 self.id.parent.module(db.upcast()).into()
1538 pub fn parent(self, _db: &dyn HirDatabase) -> GenericDef {
1539 self.id.parent.into()
1543 #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
1544 pub struct ConstParam {
1545 pub(crate) id: ConstParamId,
1549 pub fn name(self, db: &dyn HirDatabase) -> Name {
1550 let params = db.generic_params(self.id.parent);
1551 params.consts[self.id.local_id].name.clone()
1554 pub fn module(self, db: &dyn HirDatabase) -> Module {
1555 self.id.parent.module(db.upcast()).into()
1558 pub fn parent(self, _db: &dyn HirDatabase) -> GenericDef {
1559 self.id.parent.into()
1562 pub fn ty(self, db: &dyn HirDatabase) -> Type {
1563 let def = self.id.parent;
1564 let krate = def.module(db.upcast()).krate();
1565 Type::new(db, krate, def, db.const_param_ty(self.id))
1569 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
1571 pub(crate) id: ImplId,
1575 pub fn all_in_crate(db: &dyn HirDatabase, krate: Crate) -> Vec<Impl> {
1576 let inherent = db.inherent_impls_in_crate(krate.id);
1577 let trait_ = db.trait_impls_in_crate(krate.id);
1579 inherent.all_impls().chain(trait_.all_impls()).map(Self::from).collect()
1582 pub fn all_for_type(db: &dyn HirDatabase, Type { krate, ty, .. }: Type) -> Vec<Impl> {
1583 let def_crates = match def_crates(db, &ty, krate) {
1584 Some(def_crates) => def_crates,
1585 None => return Vec::new(),
1588 let filter = |impl_def: &Impl| {
1589 let self_ty = impl_def.self_ty(db);
1590 let rref = self_ty.remove_ref();
1591 ty.equals_ctor(rref.as_ref().map_or(&self_ty.ty, |it| &it.ty))
1594 let fp = TyFingerprint::for_inherent_impl(&ty);
1595 let fp = if let Some(fp) = fp {
1601 let mut all = Vec::new();
1602 def_crates.iter().for_each(|&id| {
1604 db.inherent_impls_in_crate(id)
1612 for id in def_crates
1614 .flat_map(|&id| Crate { id }.transitive_reverse_dependencies(db))
1615 .map(|Crate { id }| id)
1616 .chain(def_crates.iter().copied())
1620 db.trait_impls_in_crate(id)
1621 .for_self_ty_without_blanket_impls(fp)
1629 pub fn all_for_trait(db: &dyn HirDatabase, trait_: Trait) -> Vec<Impl> {
1630 let krate = trait_.module(db).krate();
1631 let mut all = Vec::new();
1632 for Crate { id } in krate.transitive_reverse_dependencies(db).into_iter() {
1633 let impls = db.trait_impls_in_crate(id);
1634 all.extend(impls.for_trait(trait_.id).map(Self::from))
1639 // FIXME: the return type is wrong. This should be a hir version of
1640 // `TraitRef` (ie, resolved `TypeRef`).
1641 pub fn trait_(self, db: &dyn HirDatabase) -> Option<TraitRef> {
1642 db.impl_data(self.id).target_trait.as_deref().cloned()
1645 pub fn self_ty(self, db: &dyn HirDatabase) -> Type {
1646 let impl_data = db.impl_data(self.id);
1647 let resolver = self.id.resolver(db.upcast());
1648 let krate = self.id.lookup(db.upcast()).container.krate();
1649 let ctx = hir_ty::TyLoweringContext::new(db, &resolver);
1650 let ty = ctx.lower_ty(&impl_data.self_ty);
1651 Type::new_with_resolver_inner(db, krate, &resolver, ty)
1654 pub fn items(self, db: &dyn HirDatabase) -> Vec<AssocItem> {
1655 db.impl_data(self.id).items.iter().map(|it| (*it).into()).collect()
1658 pub fn is_negative(self, db: &dyn HirDatabase) -> bool {
1659 db.impl_data(self.id).is_negative
1662 pub fn module(self, db: &dyn HirDatabase) -> Module {
1663 self.id.lookup(db.upcast()).container.into()
1666 pub fn krate(self, db: &dyn HirDatabase) -> Crate {
1667 Crate { id: self.module(db).id.krate() }
1670 pub fn is_builtin_derive(self, db: &dyn HirDatabase) -> Option<InFile<ast::Attr>> {
1671 let src = self.source(db)?;
1672 let item = src.file_id.is_builtin_derive(db.upcast())?;
1673 let hygenic = hir_expand::hygiene::Hygiene::new(db.upcast(), item.file_id);
1675 // FIXME: handle `cfg_attr`
1680 let path = ModPath::from_src(db.upcast(), it.path()?, &hygenic)?;
1681 if path.as_ident()?.to_string() == "derive" {
1689 Some(item.with_value(attr))
1693 #[derive(Clone, PartialEq, Eq, Debug)]
1696 env: Arc<TraitEnvironment>,
1701 pub(crate) fn new_with_resolver(
1702 db: &dyn HirDatabase,
1703 resolver: &Resolver,
1706 let krate = resolver.krate()?;
1707 Some(Type::new_with_resolver_inner(db, krate, resolver, ty))
1709 pub(crate) fn new_with_resolver_inner(
1710 db: &dyn HirDatabase,
1712 resolver: &Resolver,
1715 let environment = resolver
1717 .map_or_else(|| Arc::new(TraitEnvironment::empty(krate)), |d| db.trait_environment(d));
1718 Type { krate, env: environment, ty }
1721 fn new(db: &dyn HirDatabase, krate: CrateId, lexical_env: impl HasResolver, ty: Ty) -> Type {
1722 let resolver = lexical_env.resolver(db.upcast());
1723 let environment = resolver
1725 .map_or_else(|| Arc::new(TraitEnvironment::empty(krate)), |d| db.trait_environment(d));
1726 Type { krate, env: environment, ty }
1730 db: &dyn HirDatabase,
1732 def: impl HasResolver + Into<TyDefId>,
1734 let ty = TyBuilder::def_ty(db, def.into()).fill_with_unknown().build();
1735 Type::new(db, krate, def, ty)
1738 pub fn is_unit(&self) -> bool {
1739 matches!(self.ty.kind(&Interner), TyKind::Tuple(0, ..))
1741 pub fn is_bool(&self) -> bool {
1742 matches!(self.ty.kind(&Interner), TyKind::Scalar(Scalar::Bool))
1745 pub fn is_mutable_reference(&self) -> bool {
1746 matches!(self.ty.kind(&Interner), TyKind::Ref(hir_ty::Mutability::Mut, ..))
1749 pub fn is_usize(&self) -> bool {
1750 matches!(self.ty.kind(&Interner), TyKind::Scalar(Scalar::Uint(UintTy::Usize)))
1753 pub fn remove_ref(&self) -> Option<Type> {
1754 match &self.ty.kind(&Interner) {
1755 TyKind::Ref(.., ty) => Some(self.derived(ty.clone())),
1760 pub fn strip_references(&self) -> Type {
1761 self.derived(self.ty.strip_references().clone())
1764 pub fn is_unknown(&self) -> bool {
1765 self.ty.is_unknown()
1768 /// Checks that particular type `ty` implements `std::future::Future`.
1769 /// This function is used in `.await` syntax completion.
1770 pub fn impls_future(&self, db: &dyn HirDatabase) -> bool {
1771 // No special case for the type of async block, since Chalk can figure it out.
1773 let krate = self.krate;
1775 let std_future_trait =
1776 db.lang_item(krate, "future_trait".into()).and_then(|it| it.as_trait());
1777 let std_future_trait = match std_future_trait {
1779 None => return false,
1783 Canonical { value: self.ty.clone(), binders: CanonicalVarKinds::empty(&Interner) };
1784 method_resolution::implements_trait(
1793 /// Checks that particular type `ty` implements `std::ops::FnOnce`.
1795 /// This function can be used to check if a particular type is callable, since FnOnce is a
1796 /// supertrait of Fn and FnMut, so all callable types implements at least FnOnce.
1797 pub fn impls_fnonce(&self, db: &dyn HirDatabase) -> bool {
1798 let krate = self.krate;
1800 let fnonce_trait = match FnTrait::FnOnce.get_id(db, krate) {
1802 None => return false,
1806 Canonical { value: self.ty.clone(), binders: CanonicalVarKinds::empty(&Interner) };
1807 method_resolution::implements_trait_unique(
1816 pub fn impls_trait(&self, db: &dyn HirDatabase, trait_: Trait, args: &[Type]) -> bool {
1817 let trait_ref = TyBuilder::trait_ref(db, trait_.id)
1818 .push(self.ty.clone())
1819 .fill(args.iter().map(|t| t.ty.clone()))
1822 let goal = Canonical {
1823 value: hir_ty::InEnvironment::new(&self.env.env, trait_ref.cast(&Interner)),
1824 binders: CanonicalVarKinds::empty(&Interner),
1827 db.trait_solve(self.krate, goal).is_some()
1830 pub fn normalize_trait_assoc_type(
1832 db: &dyn HirDatabase,
1836 let projection = TyBuilder::assoc_type_projection(db, alias.id)
1837 .push(self.ty.clone())
1838 .fill(args.iter().map(|t| t.ty.clone()))
1840 let goal = hir_ty::make_canonical(
1844 alias: AliasTy::Projection(projection),
1845 ty: TyKind::BoundVar(BoundVar::new(DebruijnIndex::INNERMOST, 0))
1850 [TyVariableKind::General].iter().copied(),
1853 match db.trait_solve(self.krate, goal)? {
1854 Solution::Unique(s) => s
1857 .as_slice(&Interner)
1859 .map(|ty| self.derived(ty.assert_ty_ref(&Interner).clone())),
1860 Solution::Ambig(_) => None,
1864 pub fn is_copy(&self, db: &dyn HirDatabase) -> bool {
1865 let lang_item = db.lang_item(self.krate, SmolStr::new("copy"));
1866 let copy_trait = match lang_item {
1867 Some(LangItemTarget::TraitId(it)) => it,
1870 self.impls_trait(db, copy_trait.into(), &[])
1873 pub fn as_callable(&self, db: &dyn HirDatabase) -> Option<Callable> {
1874 let def = self.ty.callable_def(db);
1876 let sig = self.ty.callable_sig(db)?;
1877 Some(Callable { ty: self.clone(), sig, def, is_bound_method: false })
1880 pub fn is_closure(&self) -> bool {
1881 matches!(&self.ty.kind(&Interner), TyKind::Closure { .. })
1884 pub fn is_fn(&self) -> bool {
1885 matches!(&self.ty.kind(&Interner), TyKind::FnDef(..) | TyKind::Function { .. })
1888 pub fn is_packed(&self, db: &dyn HirDatabase) -> bool {
1889 let adt_id = match self.ty.kind(&Interner) {
1890 &TyKind::Adt(hir_ty::AdtId(adt_id), ..) => adt_id,
1894 let adt = adt_id.into();
1896 Adt::Struct(s) => matches!(s.repr(db), Some(ReprKind::Packed)),
1901 pub fn is_raw_ptr(&self) -> bool {
1902 matches!(&self.ty.kind(&Interner), TyKind::Raw(..))
1905 pub fn contains_unknown(&self) -> bool {
1906 return go(&self.ty);
1908 fn go(ty: &Ty) -> bool {
1909 match ty.kind(&Interner) {
1910 TyKind::Error => true,
1912 TyKind::Adt(_, substs)
1913 | TyKind::AssociatedType(_, substs)
1914 | TyKind::Tuple(_, substs)
1915 | TyKind::OpaqueType(_, substs)
1916 | TyKind::FnDef(_, substs)
1917 | TyKind::Closure(_, substs) => {
1918 substs.iter(&Interner).filter_map(|a| a.ty(&Interner)).any(go)
1921 TyKind::Array(_ty, len) if len.is_unknown() => true,
1922 TyKind::Array(ty, _)
1924 | TyKind::Raw(_, ty)
1925 | TyKind::Ref(_, _, ty) => go(ty),
1930 | TyKind::Placeholder(_)
1931 | TyKind::BoundVar(_)
1932 | TyKind::InferenceVar(_, _)
1934 | TyKind::Function(_)
1936 | TyKind::Foreign(_)
1937 | TyKind::Generator(..)
1938 | TyKind::GeneratorWitness(..) => false,
1943 pub fn fields(&self, db: &dyn HirDatabase) -> Vec<(Field, Type)> {
1944 let (variant_id, substs) = match self.ty.kind(&Interner) {
1945 &TyKind::Adt(hir_ty::AdtId(AdtId::StructId(s)), ref substs) => (s.into(), substs),
1946 &TyKind::Adt(hir_ty::AdtId(AdtId::UnionId(u)), ref substs) => (u.into(), substs),
1947 _ => return Vec::new(),
1950 db.field_types(variant_id)
1952 .map(|(local_id, ty)| {
1953 let def = Field { parent: variant_id.into(), id: local_id };
1954 let ty = ty.clone().substitute(&Interner, substs);
1955 (def, self.derived(ty))
1960 pub fn tuple_fields(&self, _db: &dyn HirDatabase) -> Vec<Type> {
1961 if let TyKind::Tuple(_, substs) = &self.ty.kind(&Interner) {
1964 .map(|ty| self.derived(ty.assert_ty_ref(&Interner).clone()))
1971 pub fn autoderef<'a>(&'a self, db: &'a dyn HirDatabase) -> impl Iterator<Item = Type> + 'a {
1972 // There should be no inference vars in types passed here
1973 // FIXME check that?
1975 Canonical { value: self.ty.clone(), binders: CanonicalVarKinds::empty(&Interner) };
1976 let environment = self.env.env.clone();
1977 let ty = InEnvironment { goal: canonical, environment };
1978 autoderef(db, Some(self.krate), ty)
1979 .map(|canonical| canonical.value)
1980 .map(move |ty| self.derived(ty))
1983 // This would be nicer if it just returned an iterator, but that runs into
1984 // lifetime problems, because we need to borrow temp `CrateImplDefs`.
1985 pub fn iterate_assoc_items<T>(
1987 db: &dyn HirDatabase,
1989 mut callback: impl FnMut(AssocItem) -> Option<T>,
1991 for krate in def_crates(db, &self.ty, krate.id)? {
1992 let impls = db.inherent_impls_in_crate(krate);
1994 for impl_def in impls.for_self_ty(&self.ty) {
1995 for &item in db.impl_data(*impl_def).items.iter() {
1996 if let Some(result) = callback(item.into()) {
1997 return Some(result);
2005 pub fn type_arguments(&self) -> impl Iterator<Item = Type> + '_ {
2010 .flat_map(|(_, substs)| substs.iter(&Interner))
2011 .filter_map(|arg| arg.ty(&Interner).cloned())
2012 .map(move |ty| self.derived(ty))
2015 pub fn iterate_method_candidates<T>(
2017 db: &dyn HirDatabase,
2019 traits_in_scope: &FxHashSet<TraitId>,
2020 name: Option<&Name>,
2021 mut callback: impl FnMut(&Ty, Function) -> Option<T>,
2023 // There should be no inference vars in types passed here
2024 // FIXME check that?
2025 // FIXME replace Unknown by bound vars here
2027 Canonical { value: self.ty.clone(), binders: CanonicalVarKinds::empty(&Interner) };
2029 let env = self.env.clone();
2030 let krate = krate.id;
2032 method_resolution::iterate_method_candidates(
2040 method_resolution::LookupMode::MethodCall,
2042 AssocItemId::FunctionId(f) => callback(ty, f.into()),
2048 pub fn iterate_path_candidates<T>(
2050 db: &dyn HirDatabase,
2052 traits_in_scope: &FxHashSet<TraitId>,
2053 name: Option<&Name>,
2054 mut callback: impl FnMut(&Ty, AssocItem) -> Option<T>,
2056 let canonical = hir_ty::replace_errors_with_variables(self.ty.clone());
2058 let env = self.env.clone();
2059 let krate = krate.id;
2061 method_resolution::iterate_method_candidates(
2069 method_resolution::LookupMode::Path,
2070 |ty, it| callback(ty, it.into()),
2074 pub fn as_adt(&self) -> Option<Adt> {
2075 let (adt, _subst) = self.ty.as_adt()?;
2079 pub fn as_builtin(&self) -> Option<BuiltinType> {
2080 self.ty.as_builtin().map(|inner| BuiltinType { inner })
2083 pub fn as_dyn_trait(&self) -> Option<Trait> {
2084 self.ty.dyn_trait().map(Into::into)
2087 /// If a type can be represented as `dyn Trait`, returns all traits accessible via this type,
2088 /// or an empty iterator otherwise.
2089 pub fn applicable_inherent_traits<'a>(
2091 db: &'a dyn HirDatabase,
2092 ) -> impl Iterator<Item = Trait> + 'a {
2094 .filter_map(|derefed_type| derefed_type.ty.dyn_trait())
2095 .flat_map(move |dyn_trait_id| hir_ty::all_super_traits(db.upcast(), dyn_trait_id))
2099 pub fn as_impl_traits(&self, db: &dyn HirDatabase) -> Option<Vec<Trait>> {
2100 self.ty.impl_trait_bounds(db).map(|it| {
2102 .filter_map(|pred| match pred.skip_binders() {
2103 hir_ty::WhereClause::Implemented(trait_ref) => {
2104 Some(Trait::from(trait_ref.hir_trait_id()))
2112 pub fn as_associated_type_parent_trait(&self, db: &dyn HirDatabase) -> Option<Trait> {
2113 self.ty.associated_type_parent_trait(db).map(Into::into)
2116 fn derived(&self, ty: Ty) -> Type {
2117 Type { krate: self.krate, env: self.env.clone(), ty }
2120 pub fn walk(&self, db: &dyn HirDatabase, mut cb: impl FnMut(Type)) {
2121 // TypeWalk::walk for a Ty at first visits parameters and only after that the Ty itself.
2122 // We need a different order here.
2125 db: &dyn HirDatabase,
2127 substs: &Substitution,
2128 cb: &mut impl FnMut(Type),
2130 for ty in substs.iter(&Interner).filter_map(|a| a.ty(&Interner)) {
2131 walk_type(db, &type_.derived(ty.clone()), cb);
2136 db: &dyn HirDatabase,
2138 bounds: &[QuantifiedWhereClause],
2139 cb: &mut impl FnMut(Type),
2141 for pred in bounds {
2142 match pred.skip_binders() {
2143 WhereClause::Implemented(trait_ref) => {
2145 // skip the self type. it's likely the type we just got the bounds from
2150 .filter_map(|a| a.ty(&Interner))
2152 walk_type(db, &type_.derived(ty.clone()), cb);
2160 fn walk_type(db: &dyn HirDatabase, type_: &Type, cb: &mut impl FnMut(Type)) {
2161 let ty = type_.ty.strip_references();
2162 match ty.kind(&Interner) {
2163 TyKind::Adt(_, substs) => {
2164 cb(type_.derived(ty.clone()));
2165 walk_substs(db, type_, &substs, cb);
2167 TyKind::AssociatedType(_, substs) => {
2168 if let Some(_) = ty.associated_type_parent_trait(db) {
2169 cb(type_.derived(ty.clone()));
2171 walk_substs(db, type_, &substs, cb);
2173 TyKind::OpaqueType(_, subst) => {
2174 if let Some(bounds) = ty.impl_trait_bounds(db) {
2175 walk_bounds(db, &type_.derived(ty.clone()), &bounds, cb);
2178 walk_substs(db, type_, subst, cb);
2180 TyKind::Alias(AliasTy::Opaque(opaque_ty)) => {
2181 if let Some(bounds) = ty.impl_trait_bounds(db) {
2182 walk_bounds(db, &type_.derived(ty.clone()), &bounds, cb);
2185 walk_substs(db, type_, &opaque_ty.substitution, cb);
2187 TyKind::Placeholder(_) => {
2188 if let Some(bounds) = ty.impl_trait_bounds(db) {
2189 walk_bounds(db, &type_.derived(ty.clone()), &bounds, cb);
2192 TyKind::Dyn(bounds) => {
2195 &type_.derived(ty.clone()),
2196 bounds.bounds.skip_binders().interned(),
2201 TyKind::Ref(_, _, ty)
2202 | TyKind::Raw(_, ty)
2203 | TyKind::Array(ty, _)
2204 | TyKind::Slice(ty) => {
2205 walk_type(db, &type_.derived(ty.clone()), cb);
2208 TyKind::FnDef(_, substs)
2209 | TyKind::Tuple(_, substs)
2210 | TyKind::Closure(.., substs) => {
2211 walk_substs(db, type_, &substs, cb);
2213 TyKind::Function(hir_ty::FnPointer { substitution, .. }) => {
2214 walk_substs(db, type_, &substitution.0, cb);
2221 walk_type(db, self, &mut cb);
2224 pub fn could_unify_with(&self, db: &dyn HirDatabase, other: &Type) -> bool {
2225 let tys = hir_ty::replace_errors_with_variables((self.ty.clone(), other.ty.clone()));
2226 could_unify(db, self.env.clone(), &tys)
2232 pub struct Callable {
2235 def: Option<CallableDefId>,
2236 pub(crate) is_bound_method: bool,
2239 pub enum CallableKind {
2241 TupleStruct(Struct),
2242 TupleEnumVariant(Variant),
2247 pub fn kind(&self) -> CallableKind {
2249 Some(CallableDefId::FunctionId(it)) => CallableKind::Function(it.into()),
2250 Some(CallableDefId::StructId(it)) => CallableKind::TupleStruct(it.into()),
2251 Some(CallableDefId::EnumVariantId(it)) => CallableKind::TupleEnumVariant(it.into()),
2252 None => CallableKind::Closure,
2255 pub fn receiver_param(&self, db: &dyn HirDatabase) -> Option<ast::SelfParam> {
2256 let func = match self.def {
2257 Some(CallableDefId::FunctionId(it)) if self.is_bound_method => it,
2260 let src = func.lookup(db.upcast()).source(db.upcast());
2261 let param_list = src.value.param_list()?;
2262 param_list.self_param()
2264 pub fn n_params(&self) -> usize {
2265 self.sig.params().len() - if self.is_bound_method { 1 } else { 0 }
2269 db: &dyn HirDatabase,
2270 ) -> Vec<(Option<Either<ast::SelfParam, ast::Pat>>, Type)> {
2275 .skip(if self.is_bound_method { 1 } else { 0 })
2276 .map(|ty| self.ty.derived(ty.clone()));
2277 let patterns = match self.def {
2278 Some(CallableDefId::FunctionId(func)) => {
2279 let src = func.lookup(db.upcast()).source(db.upcast());
2280 src.value.param_list().map(|param_list| {
2283 .map(|it| Some(Either::Left(it)))
2284 .filter(|_| !self.is_bound_method)
2286 .chain(param_list.params().map(|it| it.pat().map(Either::Right)))
2291 patterns.into_iter().flatten().chain(iter::repeat(None)).zip(types).collect()
2293 pub fn return_type(&self) -> Type {
2294 self.ty.derived(self.sig.ret().clone())
2299 #[derive(Debug, PartialEq, Eq, Hash)]
2301 ModuleDef(ModuleDef),
2303 GenericParam(GenericParam),
2312 pub fn all_items(def: PerNs) -> ArrayVec<Self, 3> {
2313 let mut items = ArrayVec::new();
2315 match (def.take_types(), def.take_values()) {
2316 (Some(m1), None) => items.push(ScopeDef::ModuleDef(m1.into())),
2317 (None, Some(m2)) => items.push(ScopeDef::ModuleDef(m2.into())),
2318 (Some(m1), Some(m2)) => {
2319 // Some items, like unit structs and enum variants, are
2320 // returned as both a type and a value. Here we want
2321 // to de-duplicate them.
2323 items.push(ScopeDef::ModuleDef(m1.into()));
2324 items.push(ScopeDef::ModuleDef(m2.into()));
2326 items.push(ScopeDef::ModuleDef(m1.into()));
2332 if let Some(macro_def_id) = def.take_macros() {
2333 items.push(ScopeDef::MacroDef(macro_def_id.into()));
2336 if items.is_empty() {
2337 items.push(ScopeDef::Unknown);
2344 impl From<ItemInNs> for ScopeDef {
2345 fn from(item: ItemInNs) -> Self {
2347 ItemInNs::Types(id) => ScopeDef::ModuleDef(id.into()),
2348 ItemInNs::Values(id) => ScopeDef::ModuleDef(id.into()),
2349 ItemInNs::Macros(id) => ScopeDef::MacroDef(id.into()),
2354 pub trait HasVisibility {
2355 fn visibility(&self, db: &dyn HirDatabase) -> Visibility;
2356 fn is_visible_from(&self, db: &dyn HirDatabase, module: Module) -> bool {
2357 let vis = self.visibility(db);
2358 vis.is_visible_from(db.upcast(), module.id)