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},
47 AdtId, AssocContainerId, AssocItemId, AssocItemLoc, AttrDefId, ConstId, ConstParamId,
48 DefWithBodyId, EnumId, FunctionId, GenericDefId, HasModule, ImplId, LifetimeParamId,
49 LocalEnumVariantId, LocalFieldId, Lookup, ModuleId, StaticId, StructId, TraitId, TypeAliasId,
52 use hir_expand::{diagnostics::DiagnosticSink, name::name, MacroDefKind};
55 method_resolution::{self, TyFingerprint},
57 traits::{FnTrait, Solution, SolutionVariables},
58 AliasTy, BoundVar, CallableDefId, CallableSig, Canonical, DebruijnIndex, GenericPredicate,
59 InEnvironment, Interner, Obligation, ProjectionPredicate, ProjectionTy, Scalar, Substs, Ty,
60 TyDefId, TyKind, TyVariableKind,
62 use rustc_hash::FxHashSet;
63 use stdx::{format_to, impl_from};
65 ast::{self, AttrsOwner, NameOwner},
68 use tt::{Ident, Leaf, Literal, TokenTree};
70 use crate::db::{DefDatabase, HirDatabase};
73 attrs::{HasAttrs, Namespace},
74 has_source::HasSource,
75 semantics::{PathResolution, Semantics, SemanticsScope},
78 // Be careful with these re-exports.
80 // `hir` is the boundary between the compiler and the IDE. It should try hard to
81 // isolate the compiler from the ide, to allow the two to be refactored
82 // independently. Re-exporting something from the compiler is the sure way to
83 // breach the boundary.
85 // Generally, a refactoring which *removes* a name from this list is a good
90 attr::{Attrs, Documentation},
91 body::scope::ExprScopes,
92 find_path::PrefixKind,
95 nameres::ModuleSource,
96 path::{ModPath, PathKind},
97 type_ref::{Mutability, TypeRef},
98 visibility::Visibility,
102 ExpandResult, HirFileId, InFile, MacroCallId, MacroCallLoc, /* FIXME */ MacroDefId,
105 hir_ty::display::HirDisplay,
108 // These are negative re-exports: pub using these names is forbidden, they
109 // should remain private to hir internals.
113 hir_expand::{hygiene::Hygiene, name::AsName},
116 /// hir::Crate describes a single crate. It's the main interface with which
117 /// a crate's dependencies interact. Mostly, it should be just a proxy for the
119 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
121 pub(crate) id: CrateId,
125 pub struct CrateDependency {
131 pub fn dependencies(self, db: &dyn HirDatabase) -> Vec<CrateDependency> {
132 db.crate_graph()[self.id]
136 let krate = Crate { id: dep.crate_id };
137 let name = dep.as_name();
138 CrateDependency { krate, name }
143 // FIXME: add `transitive_reverse_dependencies`.
144 pub fn reverse_dependencies(self, db: &dyn HirDatabase) -> Vec<Crate> {
145 let crate_graph = db.crate_graph();
149 crate_graph[krate].dependencies.iter().any(|it| it.crate_id == self.id)
151 .map(|id| Crate { id })
155 pub fn root_module(self, db: &dyn HirDatabase) -> Module {
156 let def_map = db.crate_def_map(self.id);
157 Module { id: def_map.module_id(def_map.root()) }
160 pub fn root_file(self, db: &dyn HirDatabase) -> FileId {
161 db.crate_graph()[self.id].root_file_id
164 pub fn edition(self, db: &dyn HirDatabase) -> Edition {
165 db.crate_graph()[self.id].edition
168 pub fn display_name(self, db: &dyn HirDatabase) -> Option<CrateDisplayName> {
169 db.crate_graph()[self.id].display_name.clone()
172 pub fn query_external_importables(
174 db: &dyn DefDatabase,
175 query: import_map::Query,
176 ) -> impl Iterator<Item = Either<ModuleDef, MacroDef>> {
177 import_map::search_dependencies(db, self.into(), query).into_iter().map(|item| match item {
178 ItemInNs::Types(mod_id) | ItemInNs::Values(mod_id) => Either::Left(mod_id.into()),
179 ItemInNs::Macros(mac_id) => Either::Right(mac_id.into()),
183 pub fn all(db: &dyn HirDatabase) -> Vec<Crate> {
184 db.crate_graph().iter().map(|id| Crate { id }).collect()
187 /// Try to get the root URL of the documentation of a crate.
188 pub fn get_html_root_url(self: &Crate, db: &dyn HirDatabase) -> Option<String> {
189 // Look for #![doc(html_root_url = "...")]
190 let attrs = db.attrs(AttrDefId::ModuleId(self.root_module(db).into()));
191 let doc_attr_q = attrs.by_key("doc");
193 if !doc_attr_q.exists() {
197 let doc_url = doc_attr_q.tt_values().map(|tt| {
198 let name = tt.token_trees.iter()
199 .skip_while(|tt| !matches!(tt, TokenTree::Leaf(Leaf::Ident(Ident{text: ref ident, ..})) if ident == "html_root_url"))
204 Some(TokenTree::Leaf(Leaf::Literal(Literal{ref text, ..}))) => Some(text),
207 }).flat_map(|t| t).next();
209 doc_url.map(|s| s.trim_matches('"').trim_end_matches('/').to_owned() + "/")
213 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
215 pub(crate) id: ModuleId,
218 /// The defs which can be visible in the module.
219 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
224 // Can't be directly declared, but can be imported.
229 TypeAlias(TypeAlias),
230 BuiltinType(BuiltinType),
235 Adt(Struct, Enum, Union),
245 impl From<VariantDef> for ModuleDef {
246 fn from(var: VariantDef) -> Self {
248 VariantDef::Struct(t) => Adt::from(t).into(),
249 VariantDef::Union(t) => Adt::from(t).into(),
250 VariantDef::Variant(t) => t.into(),
256 pub fn module(self, db: &dyn HirDatabase) -> Option<Module> {
258 ModuleDef::Module(it) => it.parent(db),
259 ModuleDef::Function(it) => Some(it.module(db)),
260 ModuleDef::Adt(it) => Some(it.module(db)),
261 ModuleDef::Variant(it) => Some(it.module(db)),
262 ModuleDef::Const(it) => Some(it.module(db)),
263 ModuleDef::Static(it) => Some(it.module(db)),
264 ModuleDef::Trait(it) => Some(it.module(db)),
265 ModuleDef::TypeAlias(it) => Some(it.module(db)),
266 ModuleDef::BuiltinType(_) => None,
270 pub fn canonical_path(&self, db: &dyn HirDatabase) -> Option<String> {
271 let mut segments = vec![self.name(db)?.to_string()];
272 for m in self.module(db)?.path_to_root(db) {
273 segments.extend(m.name(db).map(|it| it.to_string()))
276 Some(segments.join("::"))
279 pub fn definition_visibility(&self, db: &dyn HirDatabase) -> Option<Visibility> {
280 let module = match self {
281 ModuleDef::Module(it) => it.parent(db)?,
282 ModuleDef::Function(it) => return Some(it.visibility(db)),
283 ModuleDef::Adt(it) => it.module(db),
284 ModuleDef::Variant(it) => {
285 let parent = it.parent_enum(db);
286 let module = it.module(db);
287 return module.visibility_of(db, &ModuleDef::Adt(Adt::Enum(parent)));
289 ModuleDef::Const(it) => return Some(it.visibility(db)),
290 ModuleDef::Static(it) => it.module(db),
291 ModuleDef::Trait(it) => it.module(db),
292 ModuleDef::TypeAlias(it) => return Some(it.visibility(db)),
293 ModuleDef::BuiltinType(_) => return None,
296 module.visibility_of(db, self)
299 pub fn name(self, db: &dyn HirDatabase) -> Option<Name> {
301 ModuleDef::Adt(it) => Some(it.name(db)),
302 ModuleDef::Trait(it) => Some(it.name(db)),
303 ModuleDef::Function(it) => Some(it.name(db)),
304 ModuleDef::Variant(it) => Some(it.name(db)),
305 ModuleDef::TypeAlias(it) => Some(it.name(db)),
306 ModuleDef::Module(it) => it.name(db),
307 ModuleDef::Const(it) => it.name(db),
308 ModuleDef::Static(it) => it.name(db),
309 ModuleDef::BuiltinType(it) => Some(it.name()),
313 pub fn diagnostics(self, db: &dyn HirDatabase, sink: &mut DiagnosticSink) {
314 let id = match self {
315 ModuleDef::Adt(it) => match it {
316 Adt::Struct(it) => it.id.into(),
317 Adt::Enum(it) => it.id.into(),
318 Adt::Union(it) => it.id.into(),
320 ModuleDef::Trait(it) => it.id.into(),
321 ModuleDef::Function(it) => it.id.into(),
322 ModuleDef::TypeAlias(it) => it.id.into(),
323 ModuleDef::Module(it) => it.id.into(),
324 ModuleDef::Const(it) => it.id.into(),
325 ModuleDef::Static(it) => it.id.into(),
329 let module = match self.module(db) {
334 hir_ty::diagnostics::validate_module_item(db, module.id.krate(), id, sink)
339 /// Name of this module.
340 pub fn name(self, db: &dyn HirDatabase) -> Option<Name> {
341 let def_map = self.id.def_map(db.upcast());
342 let parent = def_map[self.id.local_id].parent?;
343 def_map[parent].children.iter().find_map(|(name, module_id)| {
344 if *module_id == self.id.local_id {
352 /// Returns the crate this module is part of.
353 pub fn krate(self) -> Crate {
354 Crate { id: self.id.krate() }
357 /// Topmost parent of this module. Every module has a `crate_root`, but some
358 /// might be missing `krate`. This can happen if a module's file is not included
359 /// in the module tree of any target in `Cargo.toml`.
360 pub fn crate_root(self, db: &dyn HirDatabase) -> Module {
361 let def_map = db.crate_def_map(self.id.krate());
362 Module { id: def_map.module_id(def_map.root()) }
365 /// Iterates over all child modules.
366 pub fn children(self, db: &dyn HirDatabase) -> impl Iterator<Item = Module> {
367 let def_map = self.id.def_map(db.upcast());
368 let children = def_map[self.id.local_id]
371 .map(|(_, module_id)| Module { id: def_map.module_id(*module_id) })
372 .collect::<Vec<_>>();
376 /// Finds a parent module.
377 pub fn parent(self, db: &dyn HirDatabase) -> Option<Module> {
378 // FIXME: handle block expressions as modules (their parent is in a different DefMap)
379 let def_map = self.id.def_map(db.upcast());
380 let parent_id = def_map[self.id.local_id].parent?;
381 Some(Module { id: def_map.module_id(parent_id) })
384 pub fn path_to_root(self, db: &dyn HirDatabase) -> Vec<Module> {
385 let mut res = vec![self];
387 while let Some(next) = curr.parent(db) {
394 /// Returns a `ModuleScope`: a set of items, visible in this module.
397 db: &dyn HirDatabase,
398 visible_from: Option<Module>,
399 ) -> Vec<(Name, ScopeDef)> {
400 self.id.def_map(db.upcast())[self.id.local_id]
403 .filter_map(|(name, def)| {
404 if let Some(m) = visible_from {
406 def.filter_visibility(|vis| vis.is_visible_from(db.upcast(), m.id));
407 if filtered.is_none() && !def.is_none() {
410 Some((name, filtered))
416 .flat_map(|(name, def)| {
417 ScopeDef::all_items(def).into_iter().map(move |item| (name.clone(), item))
422 pub fn visibility_of(self, db: &dyn HirDatabase, def: &ModuleDef) -> Option<Visibility> {
423 self.id.def_map(db.upcast())[self.id.local_id].scope.visibility_of(def.clone().into())
426 pub fn diagnostics(self, db: &dyn HirDatabase, sink: &mut DiagnosticSink) {
427 let _p = profile::span("Module::diagnostics").detail(|| {
428 format!("{:?}", self.name(db).map_or("<unknown>".into(), |name| name.to_string()))
430 let def_map = self.id.def_map(db.upcast());
431 def_map.add_diagnostics(db.upcast(), self.id.local_id, sink);
432 for decl in self.declarations(db) {
434 crate::ModuleDef::Function(f) => f.diagnostics(db, sink),
435 crate::ModuleDef::Module(m) => {
436 // Only add diagnostics from inline modules
437 if def_map[m.id.local_id].origin.is_inline() {
438 m.diagnostics(db, sink)
442 decl.diagnostics(db, sink);
447 for impl_def in self.impl_defs(db) {
448 for item in impl_def.items(db) {
449 if let AssocItem::Function(f) = item {
450 f.diagnostics(db, sink);
456 pub fn declarations(self, db: &dyn HirDatabase) -> Vec<ModuleDef> {
457 let def_map = self.id.def_map(db.upcast());
458 def_map[self.id.local_id].scope.declarations().map(ModuleDef::from).collect()
461 pub fn impl_defs(self, db: &dyn HirDatabase) -> Vec<Impl> {
462 let def_map = self.id.def_map(db.upcast());
463 def_map[self.id.local_id].scope.impls().map(Impl::from).collect()
466 /// Finds a path that can be used to refer to the given item from within
467 /// this module, if possible.
468 pub fn find_use_path(self, db: &dyn DefDatabase, item: impl Into<ItemInNs>) -> Option<ModPath> {
469 hir_def::find_path::find_path(db, item.into(), self.into())
472 /// Finds a path that can be used to refer to the given item from within
473 /// this module, if possible. This is used for returning import paths for use-statements.
474 pub fn find_use_path_prefixed(
476 db: &dyn DefDatabase,
477 item: impl Into<ItemInNs>,
478 prefix_kind: PrefixKind,
479 ) -> Option<ModPath> {
480 hir_def::find_path::find_path_prefixed(db, item.into(), self.into(), prefix_kind)
484 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
486 pub(crate) parent: VariantDef,
487 pub(crate) id: LocalFieldId,
490 #[derive(Debug, PartialEq, Eq)]
491 pub enum FieldSource {
492 Named(ast::RecordField),
493 Pos(ast::TupleField),
497 pub fn name(&self, db: &dyn HirDatabase) -> Name {
498 self.parent.variant_data(db).fields()[self.id].name.clone()
501 /// Returns the type as in the signature of the struct (i.e., with
502 /// placeholder types for type parameters). This is good for showing
503 /// signature help, but not so good to actually get the type of the field
504 /// when you actually have a variable of the struct.
505 pub fn signature_ty(&self, db: &dyn HirDatabase) -> Type {
506 let var_id = self.parent.into();
507 let generic_def_id: GenericDefId = match self.parent {
508 VariantDef::Struct(it) => it.id.into(),
509 VariantDef::Union(it) => it.id.into(),
510 VariantDef::Variant(it) => it.parent.id.into(),
512 let substs = Substs::type_params(db, generic_def_id);
513 let ty = db.field_types(var_id)[self.id].clone().subst(&substs);
514 Type::new(db, self.parent.module(db).id.krate(), var_id, ty)
517 pub fn parent_def(&self, _db: &dyn HirDatabase) -> VariantDef {
522 impl HasVisibility for Field {
523 fn visibility(&self, db: &dyn HirDatabase) -> Visibility {
524 let variant_data = self.parent.variant_data(db);
525 let visibility = &variant_data.fields()[self.id].visibility;
526 let parent_id: hir_def::VariantId = self.parent.into();
527 visibility.resolve(db.upcast(), &parent_id.resolver(db.upcast()))
531 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
533 pub(crate) id: StructId,
537 pub fn module(self, db: &dyn HirDatabase) -> Module {
538 Module { id: self.id.lookup(db.upcast()).container }
541 pub fn krate(self, db: &dyn HirDatabase) -> Option<Crate> {
542 Some(self.module(db).krate())
545 pub fn name(self, db: &dyn HirDatabase) -> Name {
546 db.struct_data(self.id).name.clone()
549 pub fn fields(self, db: &dyn HirDatabase) -> Vec<Field> {
550 db.struct_data(self.id)
554 .map(|(id, _)| Field { parent: self.into(), id })
558 pub fn ty(self, db: &dyn HirDatabase) -> Type {
559 Type::from_def(db, self.id.lookup(db.upcast()).container.krate(), self.id)
562 pub fn repr(self, db: &dyn HirDatabase) -> Option<ReprKind> {
563 db.struct_data(self.id).repr.clone()
566 pub fn kind(self, db: &dyn HirDatabase) -> StructKind {
567 self.variant_data(db).kind()
570 fn variant_data(self, db: &dyn HirDatabase) -> Arc<VariantData> {
571 db.struct_data(self.id).variant_data.clone()
575 impl HasVisibility for Struct {
576 fn visibility(&self, db: &dyn HirDatabase) -> Visibility {
577 db.struct_data(self.id).visibility.resolve(db.upcast(), &self.id.resolver(db.upcast()))
581 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
583 pub(crate) id: UnionId,
587 pub fn name(self, db: &dyn HirDatabase) -> Name {
588 db.union_data(self.id).name.clone()
591 pub fn module(self, db: &dyn HirDatabase) -> Module {
592 Module { id: self.id.lookup(db.upcast()).container }
595 pub fn ty(self, db: &dyn HirDatabase) -> Type {
596 Type::from_def(db, self.id.lookup(db.upcast()).container.krate(), self.id)
599 pub fn fields(self, db: &dyn HirDatabase) -> Vec<Field> {
600 db.union_data(self.id)
604 .map(|(id, _)| Field { parent: self.into(), id })
608 fn variant_data(self, db: &dyn HirDatabase) -> Arc<VariantData> {
609 db.union_data(self.id).variant_data.clone()
613 impl HasVisibility for Union {
614 fn visibility(&self, db: &dyn HirDatabase) -> Visibility {
615 db.union_data(self.id).visibility.resolve(db.upcast(), &self.id.resolver(db.upcast()))
619 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
621 pub(crate) id: EnumId,
625 pub fn module(self, db: &dyn HirDatabase) -> Module {
626 Module { id: self.id.lookup(db.upcast()).container }
629 pub fn krate(self, db: &dyn HirDatabase) -> Option<Crate> {
630 Some(self.module(db).krate())
633 pub fn name(self, db: &dyn HirDatabase) -> Name {
634 db.enum_data(self.id).name.clone()
637 pub fn variants(self, db: &dyn HirDatabase) -> Vec<Variant> {
638 db.enum_data(self.id).variants.iter().map(|(id, _)| Variant { parent: self, id }).collect()
641 pub fn ty(self, db: &dyn HirDatabase) -> Type {
642 Type::from_def(db, self.id.lookup(db.upcast()).container.krate(), self.id)
646 impl HasVisibility for Enum {
647 fn visibility(&self, db: &dyn HirDatabase) -> Visibility {
648 db.enum_data(self.id).visibility.resolve(db.upcast(), &self.id.resolver(db.upcast()))
652 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
654 pub(crate) parent: Enum,
655 pub(crate) id: LocalEnumVariantId,
659 pub fn module(self, db: &dyn HirDatabase) -> Module {
660 self.parent.module(db)
662 pub fn parent_enum(self, _db: &dyn HirDatabase) -> Enum {
666 pub fn name(self, db: &dyn HirDatabase) -> Name {
667 db.enum_data(self.parent.id).variants[self.id].name.clone()
670 pub fn fields(self, db: &dyn HirDatabase) -> Vec<Field> {
671 self.variant_data(db)
674 .map(|(id, _)| Field { parent: self.into(), id })
678 pub fn kind(self, db: &dyn HirDatabase) -> StructKind {
679 self.variant_data(db).kind()
682 pub(crate) fn variant_data(self, db: &dyn HirDatabase) -> Arc<VariantData> {
683 db.enum_data(self.parent.id).variants[self.id].variant_data.clone()
688 #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
694 impl_from!(Struct, Union, Enum for Adt);
697 pub fn has_non_default_type_params(self, db: &dyn HirDatabase) -> bool {
698 let subst = db.generic_defaults(self.into());
699 subst.iter().any(|ty| ty.value.is_unknown())
702 /// Turns this ADT into a type. Any type parameters of the ADT will be
703 /// turned into unknown types, which is good for e.g. finding the most
704 /// general set of completions, but will not look very nice when printed.
705 pub fn ty(self, db: &dyn HirDatabase) -> Type {
706 let id = AdtId::from(self);
707 Type::from_def(db, id.module(db.upcast()).krate(), id)
710 pub fn module(self, db: &dyn HirDatabase) -> Module {
712 Adt::Struct(s) => s.module(db),
713 Adt::Union(s) => s.module(db),
714 Adt::Enum(e) => e.module(db),
718 pub fn krate(self, db: &dyn HirDatabase) -> Crate {
719 self.module(db).krate()
722 pub fn name(self, db: &dyn HirDatabase) -> Name {
724 Adt::Struct(s) => s.name(db),
725 Adt::Union(u) => u.name(db),
726 Adt::Enum(e) => e.name(db),
731 #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
732 pub enum VariantDef {
737 impl_from!(Struct, Union, Variant for VariantDef);
740 pub fn fields(self, db: &dyn HirDatabase) -> Vec<Field> {
742 VariantDef::Struct(it) => it.fields(db),
743 VariantDef::Union(it) => it.fields(db),
744 VariantDef::Variant(it) => it.fields(db),
748 pub fn module(self, db: &dyn HirDatabase) -> Module {
750 VariantDef::Struct(it) => it.module(db),
751 VariantDef::Union(it) => it.module(db),
752 VariantDef::Variant(it) => it.module(db),
756 pub fn name(&self, db: &dyn HirDatabase) -> Name {
758 VariantDef::Struct(s) => s.name(db),
759 VariantDef::Union(u) => u.name(db),
760 VariantDef::Variant(e) => e.name(db),
764 pub(crate) fn variant_data(self, db: &dyn HirDatabase) -> Arc<VariantData> {
766 VariantDef::Struct(it) => it.variant_data(db),
767 VariantDef::Union(it) => it.variant_data(db),
768 VariantDef::Variant(it) => it.variant_data(db),
773 /// The defs which have a body.
774 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
775 pub enum DefWithBody {
780 impl_from!(Function, Const, Static for DefWithBody);
783 pub fn module(self, db: &dyn HirDatabase) -> Module {
785 DefWithBody::Const(c) => c.module(db),
786 DefWithBody::Function(f) => f.module(db),
787 DefWithBody::Static(s) => s.module(db),
791 pub fn name(self, db: &dyn HirDatabase) -> Option<Name> {
793 DefWithBody::Function(f) => Some(f.name(db)),
794 DefWithBody::Static(s) => s.name(db),
795 DefWithBody::Const(c) => c.name(db),
800 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
801 pub struct Function {
802 pub(crate) id: FunctionId,
806 pub fn module(self, db: &dyn HirDatabase) -> Module {
807 self.id.lookup(db.upcast()).module(db.upcast()).into()
810 pub fn krate(self, db: &dyn HirDatabase) -> Option<Crate> {
811 Some(self.module(db).krate())
814 pub fn name(self, db: &dyn HirDatabase) -> Name {
815 db.function_data(self.id).name.clone()
818 /// Get this function's return type
819 pub fn ret_type(self, db: &dyn HirDatabase) -> Type {
820 let resolver = self.id.resolver(db.upcast());
821 let krate = self.id.lookup(db.upcast()).container.module(db.upcast()).krate();
822 let ret_type = &db.function_data(self.id).ret_type;
823 let ctx = hir_ty::TyLoweringContext::new(db, &resolver);
824 let ty = ctx.lower_ty(ret_type);
825 Type::new_with_resolver_inner(db, krate, &resolver, ty)
828 pub fn self_param(self, db: &dyn HirDatabase) -> Option<SelfParam> {
829 if !db.function_data(self.id).has_self_param {
832 Some(SelfParam { func: self.id })
835 pub fn assoc_fn_params(self, db: &dyn HirDatabase) -> Vec<Param> {
836 let resolver = self.id.resolver(db.upcast());
837 let krate = self.id.lookup(db.upcast()).container.module(db.upcast()).krate();
838 let ctx = hir_ty::TyLoweringContext::new(db, &resolver);
839 let environment = db.trait_environment(self.id.into());
840 db.function_data(self.id)
844 .map(|(idx, type_ref)| {
848 value: ctx.lower_ty(type_ref),
849 environment: environment.clone(),
852 Param { func: self, ty, idx }
856 pub fn method_params(self, db: &dyn HirDatabase) -> Option<Vec<Param>> {
857 if self.self_param(db).is_none() {
860 let mut res = self.assoc_fn_params(db);
865 pub fn is_unsafe(self, db: &dyn HirDatabase) -> bool {
866 db.function_data(self.id).qualifier.is_unsafe
869 pub fn diagnostics(self, db: &dyn HirDatabase, sink: &mut DiagnosticSink) {
870 let krate = self.module(db).id.krate();
871 hir_def::diagnostics::validate_body(db.upcast(), self.id.into(), sink);
872 hir_ty::diagnostics::validate_module_item(db, krate, self.id.into(), sink);
873 hir_ty::diagnostics::validate_body(db, self.id.into(), sink);
876 /// Whether this function declaration has a definition.
878 /// This is false in the case of required (not provided) trait methods.
879 pub fn has_body(self, db: &dyn HirDatabase) -> bool {
880 db.function_data(self.id).has_body
883 /// A textual representation of the HIR of this function for debugging purposes.
884 pub fn debug_hir(self, db: &dyn HirDatabase) -> String {
885 let body = db.body(self.id.into());
887 let mut result = String::new();
888 format_to!(result, "HIR expressions in the body of `{}`:\n", self.name(db));
889 for (id, expr) in body.exprs.iter() {
890 format_to!(result, "{:?}: {:?}\n", id, expr);
897 // Note: logically, this belongs to `hir_ty`, but we are not using it there yet.
904 impl From<hir_ty::Mutability> for Access {
905 fn from(mutability: hir_ty::Mutability) -> Access {
907 hir_ty::Mutability::Not => Access::Shared,
908 hir_ty::Mutability::Mut => Access::Exclusive,
916 /// The index in parameter list, including self parameter.
922 pub fn ty(&self) -> &Type {
926 pub fn pattern_source(&self, db: &dyn HirDatabase) -> Option<ast::Pat> {
927 let params = self.func.source(db)?.value.param_list()?;
928 if params.self_param().is_some() {
929 params.params().nth(self.idx.checked_sub(1)?)?.pat()
931 params.params().nth(self.idx)?.pat()
936 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
937 pub struct SelfParam {
942 pub fn access(self, db: &dyn HirDatabase) -> Access {
943 let func_data = db.function_data(self.func);
947 .map(|param| match *param {
948 TypeRef::Reference(.., mutability) => match mutability {
949 hir_def::type_ref::Mutability::Shared => Access::Shared,
950 hir_def::type_ref::Mutability::Mut => Access::Exclusive,
954 .unwrap_or(Access::Owned)
958 impl HasVisibility for Function {
959 fn visibility(&self, db: &dyn HirDatabase) -> Visibility {
960 let function_data = db.function_data(self.id);
961 let visibility = &function_data.visibility;
962 visibility.resolve(db.upcast(), &self.id.resolver(db.upcast()))
966 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
968 pub(crate) id: ConstId,
972 pub fn module(self, db: &dyn HirDatabase) -> Module {
973 Module { id: self.id.lookup(db.upcast()).module(db.upcast()) }
976 pub fn krate(self, db: &dyn HirDatabase) -> Option<Crate> {
977 Some(self.module(db).krate())
980 pub fn name(self, db: &dyn HirDatabase) -> Option<Name> {
981 db.const_data(self.id).name.clone()
984 pub fn type_ref(self, db: &dyn HirDatabase) -> TypeRef {
985 db.const_data(self.id).type_ref.clone()
989 impl HasVisibility for Const {
990 fn visibility(&self, db: &dyn HirDatabase) -> Visibility {
991 let function_data = db.const_data(self.id);
992 let visibility = &function_data.visibility;
993 visibility.resolve(db.upcast(), &self.id.resolver(db.upcast()))
997 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
999 pub(crate) id: StaticId,
1003 pub fn module(self, db: &dyn HirDatabase) -> Module {
1004 Module { id: self.id.lookup(db.upcast()).module(db.upcast()) }
1007 pub fn krate(self, db: &dyn HirDatabase) -> Option<Crate> {
1008 Some(self.module(db).krate())
1011 pub fn name(self, db: &dyn HirDatabase) -> Option<Name> {
1012 db.static_data(self.id).name.clone()
1015 pub fn is_mut(self, db: &dyn HirDatabase) -> bool {
1016 db.static_data(self.id).mutable
1020 impl HasVisibility for Static {
1021 fn visibility(&self, db: &dyn HirDatabase) -> Visibility {
1022 db.static_data(self.id).visibility.resolve(db.upcast(), &self.id.resolver(db.upcast()))
1026 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
1028 pub(crate) id: TraitId,
1032 pub fn module(self, db: &dyn HirDatabase) -> Module {
1033 Module { id: self.id.lookup(db.upcast()).container }
1036 pub fn name(self, db: &dyn HirDatabase) -> Name {
1037 db.trait_data(self.id).name.clone()
1040 pub fn items(self, db: &dyn HirDatabase) -> Vec<AssocItem> {
1041 db.trait_data(self.id).items.iter().map(|(_name, it)| (*it).into()).collect()
1044 pub fn is_auto(self, db: &dyn HirDatabase) -> bool {
1045 db.trait_data(self.id).is_auto
1049 impl HasVisibility for Trait {
1050 fn visibility(&self, db: &dyn HirDatabase) -> Visibility {
1051 db.trait_data(self.id).visibility.resolve(db.upcast(), &self.id.resolver(db.upcast()))
1055 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
1056 pub struct TypeAlias {
1057 pub(crate) id: TypeAliasId,
1061 pub fn has_non_default_type_params(self, db: &dyn HirDatabase) -> bool {
1062 let subst = db.generic_defaults(self.id.into());
1063 subst.iter().any(|ty| ty.value.is_unknown())
1066 pub fn module(self, db: &dyn HirDatabase) -> Module {
1067 Module { id: self.id.lookup(db.upcast()).module(db.upcast()) }
1070 pub fn krate(self, db: &dyn HirDatabase) -> Crate {
1071 self.module(db).krate()
1074 pub fn type_ref(self, db: &dyn HirDatabase) -> Option<TypeRef> {
1075 db.type_alias_data(self.id).type_ref.clone()
1078 pub fn ty(self, db: &dyn HirDatabase) -> Type {
1079 Type::from_def(db, self.id.lookup(db.upcast()).module(db.upcast()).krate(), self.id)
1082 pub fn name(self, db: &dyn HirDatabase) -> Name {
1083 db.type_alias_data(self.id).name.clone()
1087 impl HasVisibility for TypeAlias {
1088 fn visibility(&self, db: &dyn HirDatabase) -> Visibility {
1089 let function_data = db.type_alias_data(self.id);
1090 let visibility = &function_data.visibility;
1091 visibility.resolve(db.upcast(), &self.id.resolver(db.upcast()))
1095 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
1096 pub struct BuiltinType {
1097 pub(crate) inner: hir_def::builtin_type::BuiltinType,
1101 pub fn ty(self, db: &dyn HirDatabase, module: Module) -> Type {
1102 let resolver = module.id.resolver(db.upcast());
1103 Type::new_with_resolver(db, &resolver, Ty::builtin(self.inner))
1104 .expect("crate not present in resolver")
1107 pub fn name(self) -> Name {
1108 self.inner.as_name()
1112 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
1113 pub struct MacroDef {
1114 pub(crate) id: MacroDefId,
1118 /// FIXME: right now, this just returns the root module of the crate that
1119 /// defines this macro. The reasons for this is that macros are expanded
1120 /// early, in `hir_expand`, where modules simply do not exist yet.
1121 pub fn module(self, db: &dyn HirDatabase) -> Option<Module> {
1122 let krate = self.id.krate;
1123 let def_map = db.crate_def_map(krate);
1124 let module_id = def_map.root();
1125 Some(Module { id: def_map.module_id(module_id) })
1128 /// XXX: this parses the file
1129 pub fn name(self, db: &dyn HirDatabase) -> Option<Name> {
1130 self.source(db)?.value.name().map(|it| it.as_name())
1133 /// Indicate it is a proc-macro
1134 pub fn is_proc_macro(&self) -> bool {
1135 matches!(self.id.kind, MacroDefKind::ProcMacro(_))
1138 /// Indicate it is a derive macro
1139 pub fn is_derive_macro(&self) -> bool {
1140 matches!(self.id.kind, MacroDefKind::ProcMacro(_) | MacroDefKind::BuiltInDerive(_))
1144 /// Invariant: `inner.as_assoc_item(db).is_some()`
1145 /// We do not actively enforce this invariant.
1146 #[derive(Debug, Copy, Clone, PartialEq, Eq, Hash)]
1147 pub enum AssocItem {
1150 TypeAlias(TypeAlias),
1153 pub enum AssocItemContainer {
1157 pub trait AsAssocItem {
1158 fn as_assoc_item(self, db: &dyn HirDatabase) -> Option<AssocItem>;
1161 impl AsAssocItem for Function {
1162 fn as_assoc_item(self, db: &dyn HirDatabase) -> Option<AssocItem> {
1163 as_assoc_item(db, AssocItem::Function, self.id)
1166 impl AsAssocItem for Const {
1167 fn as_assoc_item(self, db: &dyn HirDatabase) -> Option<AssocItem> {
1168 as_assoc_item(db, AssocItem::Const, self.id)
1171 impl AsAssocItem for TypeAlias {
1172 fn as_assoc_item(self, db: &dyn HirDatabase) -> Option<AssocItem> {
1173 as_assoc_item(db, AssocItem::TypeAlias, self.id)
1176 impl AsAssocItem for ModuleDef {
1177 fn as_assoc_item(self, db: &dyn HirDatabase) -> Option<AssocItem> {
1179 ModuleDef::Function(it) => it.as_assoc_item(db),
1180 ModuleDef::Const(it) => it.as_assoc_item(db),
1181 ModuleDef::TypeAlias(it) => it.as_assoc_item(db),
1186 fn as_assoc_item<ID, DEF, CTOR, AST>(db: &dyn HirDatabase, ctor: CTOR, id: ID) -> Option<AssocItem>
1188 ID: Lookup<Data = AssocItemLoc<AST>>,
1190 CTOR: FnOnce(DEF) -> AssocItem,
1193 match id.lookup(db.upcast()).container {
1194 AssocContainerId::TraitId(_) | AssocContainerId::ImplId(_) => Some(ctor(DEF::from(id))),
1195 AssocContainerId::ModuleId(_) => None,
1200 pub fn name(self, db: &dyn HirDatabase) -> Option<Name> {
1202 AssocItem::Function(it) => Some(it.name(db)),
1203 AssocItem::Const(it) => it.name(db),
1204 AssocItem::TypeAlias(it) => Some(it.name(db)),
1207 pub fn module(self, db: &dyn HirDatabase) -> Module {
1209 AssocItem::Function(f) => f.module(db),
1210 AssocItem::Const(c) => c.module(db),
1211 AssocItem::TypeAlias(t) => t.module(db),
1214 pub fn container(self, db: &dyn HirDatabase) -> AssocItemContainer {
1215 let container = match self {
1216 AssocItem::Function(it) => it.id.lookup(db.upcast()).container,
1217 AssocItem::Const(it) => it.id.lookup(db.upcast()).container,
1218 AssocItem::TypeAlias(it) => it.id.lookup(db.upcast()).container,
1221 AssocContainerId::TraitId(id) => AssocItemContainer::Trait(id.into()),
1222 AssocContainerId::ImplId(id) => AssocItemContainer::Impl(id.into()),
1223 AssocContainerId::ModuleId(_) => panic!("invalid AssocItem"),
1227 pub fn containing_trait(self, db: &dyn HirDatabase) -> Option<Trait> {
1228 match self.container(db) {
1229 AssocItemContainer::Trait(t) => Some(t),
1235 impl HasVisibility for AssocItem {
1236 fn visibility(&self, db: &dyn HirDatabase) -> Visibility {
1238 AssocItem::Function(f) => f.visibility(db),
1239 AssocItem::Const(c) => c.visibility(db),
1240 AssocItem::TypeAlias(t) => t.visibility(db),
1245 #[derive(Clone, Copy, PartialEq, Eq, Debug, Hash)]
1246 pub enum GenericDef {
1250 TypeAlias(TypeAlias),
1252 // enum variants cannot have generics themselves, but their parent enums
1253 // can, and this makes some code easier to write
1255 // consts can have type parameters from their parents (i.e. associated consts of traits)
1260 Adt(Struct, Enum, Union),
1270 pub fn params(self, db: &dyn HirDatabase) -> Vec<GenericParam> {
1271 let generics = db.generic_params(self.into());
1272 let ty_params = generics
1275 .map(|(local_id, _)| TypeParam { id: TypeParamId { parent: self.into(), local_id } })
1276 .map(GenericParam::TypeParam);
1277 let lt_params = generics
1280 .map(|(local_id, _)| LifetimeParam {
1281 id: LifetimeParamId { parent: self.into(), local_id },
1283 .map(GenericParam::LifetimeParam);
1284 let const_params = generics
1287 .map(|(local_id, _)| ConstParam { id: ConstParamId { parent: self.into(), local_id } })
1288 .map(GenericParam::ConstParam);
1289 ty_params.chain(lt_params).chain(const_params).collect()
1292 pub fn type_params(self, db: &dyn HirDatabase) -> Vec<TypeParam> {
1293 let generics = db.generic_params(self.into());
1297 .map(|(local_id, _)| TypeParam { id: TypeParamId { parent: self.into(), local_id } })
1302 #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
1304 pub(crate) parent: DefWithBodyId,
1305 pub(crate) pat_id: PatId,
1309 pub fn is_param(self, db: &dyn HirDatabase) -> bool {
1310 let src = self.source(db);
1312 Either::Left(bind_pat) => {
1313 bind_pat.syntax().ancestors().any(|it| ast::Param::can_cast(it.kind()))
1315 Either::Right(_self_param) => true,
1319 // FIXME: why is this an option? It shouldn't be?
1320 pub fn name(self, db: &dyn HirDatabase) -> Option<Name> {
1321 let body = db.body(self.parent.into());
1322 match &body[self.pat_id] {
1323 Pat::Bind { name, .. } => Some(name.clone()),
1328 pub fn is_self(self, db: &dyn HirDatabase) -> bool {
1329 self.name(db) == Some(name![self])
1332 pub fn is_mut(self, db: &dyn HirDatabase) -> bool {
1333 let body = db.body(self.parent.into());
1334 matches!(&body[self.pat_id], Pat::Bind { mode: BindingAnnotation::Mutable, .. })
1337 pub fn parent(self, _db: &dyn HirDatabase) -> DefWithBody {
1341 pub fn module(self, db: &dyn HirDatabase) -> Module {
1342 self.parent(db).module(db)
1345 pub fn ty(self, db: &dyn HirDatabase) -> Type {
1346 let def = DefWithBodyId::from(self.parent);
1347 let infer = db.infer(def);
1348 let ty = infer[self.pat_id].clone();
1349 let krate = def.module(db.upcast()).krate();
1350 Type::new(db, krate, def, ty)
1353 pub fn source(self, db: &dyn HirDatabase) -> InFile<Either<ast::IdentPat, ast::SelfParam>> {
1354 let (_body, source_map) = db.body_with_source_map(self.parent.into());
1355 let src = source_map.pat_syntax(self.pat_id).unwrap(); // Hmm...
1356 let root = src.file_syntax(db.upcast());
1358 ast.map_left(|it| it.cast().unwrap().to_node(&root)).map_right(|it| it.to_node(&root))
1363 #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
1365 pub(crate) parent: DefWithBodyId,
1366 pub(crate) label_id: LabelId,
1370 pub fn module(self, db: &dyn HirDatabase) -> Module {
1371 self.parent(db).module(db)
1374 pub fn parent(self, _db: &dyn HirDatabase) -> DefWithBody {
1378 pub fn name(self, db: &dyn HirDatabase) -> Name {
1379 let body = db.body(self.parent.into());
1380 body[self.label_id].name.clone()
1383 pub fn source(self, db: &dyn HirDatabase) -> InFile<ast::Label> {
1384 let (_body, source_map) = db.body_with_source_map(self.parent.into());
1385 let src = source_map.label_syntax(self.label_id);
1386 let root = src.file_syntax(db.upcast());
1387 src.map(|ast| ast.to_node(&root))
1391 #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
1392 pub enum GenericParam {
1393 TypeParam(TypeParam),
1394 LifetimeParam(LifetimeParam),
1395 ConstParam(ConstParam),
1397 impl_from!(TypeParam, LifetimeParam, ConstParam for GenericParam);
1400 pub fn module(self, db: &dyn HirDatabase) -> Module {
1402 GenericParam::TypeParam(it) => it.module(db),
1403 GenericParam::LifetimeParam(it) => it.module(db),
1404 GenericParam::ConstParam(it) => it.module(db),
1408 pub fn name(self, db: &dyn HirDatabase) -> Name {
1410 GenericParam::TypeParam(it) => it.name(db),
1411 GenericParam::LifetimeParam(it) => it.name(db),
1412 GenericParam::ConstParam(it) => it.name(db),
1417 #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
1418 pub struct TypeParam {
1419 pub(crate) id: TypeParamId,
1423 pub fn name(self, db: &dyn HirDatabase) -> Name {
1424 let params = db.generic_params(self.id.parent);
1425 params.types[self.id.local_id].name.clone().unwrap_or_else(Name::missing)
1428 pub fn module(self, db: &dyn HirDatabase) -> Module {
1429 self.id.parent.module(db.upcast()).into()
1432 pub fn ty(self, db: &dyn HirDatabase) -> Type {
1433 let resolver = self.id.parent.resolver(db.upcast());
1434 let krate = self.id.parent.module(db.upcast()).krate();
1435 let ty = TyKind::Placeholder(hir_ty::to_placeholder_idx(db, self.id)).intern(&Interner);
1436 Type::new_with_resolver_inner(db, krate, &resolver, ty)
1439 pub fn trait_bounds(self, db: &dyn HirDatabase) -> Vec<Trait> {
1440 db.generic_predicates_for_param(self.id)
1442 .filter_map(|pred| match &pred.value {
1443 hir_ty::GenericPredicate::Implemented(trait_ref) => {
1444 Some(Trait::from(trait_ref.trait_))
1451 pub fn default(self, db: &dyn HirDatabase) -> Option<Type> {
1452 let params = db.generic_defaults(self.id.parent);
1453 let local_idx = hir_ty::param_idx(db, self.id)?;
1454 let resolver = self.id.parent.resolver(db.upcast());
1455 let krate = self.id.parent.module(db.upcast()).krate();
1456 let ty = params.get(local_idx)?.clone();
1457 let subst = Substs::type_params(db, self.id.parent);
1458 let ty = ty.subst(&subst.prefix(local_idx));
1459 Some(Type::new_with_resolver_inner(db, krate, &resolver, ty))
1463 #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
1464 pub struct LifetimeParam {
1465 pub(crate) id: LifetimeParamId,
1468 impl LifetimeParam {
1469 pub fn name(self, db: &dyn HirDatabase) -> Name {
1470 let params = db.generic_params(self.id.parent);
1471 params.lifetimes[self.id.local_id].name.clone()
1474 pub fn module(self, db: &dyn HirDatabase) -> Module {
1475 self.id.parent.module(db.upcast()).into()
1478 pub fn parent(self, _db: &dyn HirDatabase) -> GenericDef {
1479 self.id.parent.into()
1483 #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
1484 pub struct ConstParam {
1485 pub(crate) id: ConstParamId,
1489 pub fn name(self, db: &dyn HirDatabase) -> Name {
1490 let params = db.generic_params(self.id.parent);
1491 params.consts[self.id.local_id].name.clone()
1494 pub fn module(self, db: &dyn HirDatabase) -> Module {
1495 self.id.parent.module(db.upcast()).into()
1498 pub fn parent(self, _db: &dyn HirDatabase) -> GenericDef {
1499 self.id.parent.into()
1502 pub fn ty(self, db: &dyn HirDatabase) -> Type {
1503 let def = self.id.parent;
1504 let krate = def.module(db.upcast()).krate();
1505 Type::new(db, krate, def, db.const_param_ty(self.id))
1509 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
1511 pub(crate) id: ImplId,
1515 pub fn all_in_crate(db: &dyn HirDatabase, krate: Crate) -> Vec<Impl> {
1516 let inherent = db.inherent_impls_in_crate(krate.id);
1517 let trait_ = db.trait_impls_in_crate(krate.id);
1519 inherent.all_impls().chain(trait_.all_impls()).map(Self::from).collect()
1522 pub fn all_for_type(db: &dyn HirDatabase, Type { krate, ty }: Type) -> Vec<Impl> {
1523 let def_crates = match ty.value.def_crates(db, krate) {
1524 Some(def_crates) => def_crates,
1525 None => return Vec::new(),
1528 let filter = |impl_def: &Impl| {
1529 let target_ty = impl_def.target_ty(db);
1530 let rref = target_ty.remove_ref();
1531 ty.value.equals_ctor(rref.as_ref().map_or(&target_ty.ty.value, |it| &it.ty.value))
1534 let mut all = Vec::new();
1535 def_crates.into_iter().for_each(|id| {
1536 all.extend(db.inherent_impls_in_crate(id).all_impls().map(Self::from).filter(filter))
1538 let fp = TyFingerprint::for_impl(&ty.value);
1539 for id in db.crate_graph().iter() {
1541 Some(fp) => all.extend(
1542 db.trait_impls_in_crate(id).for_self_ty(fp).map(Self::from).filter(filter),
1545 .extend(db.trait_impls_in_crate(id).all_impls().map(Self::from).filter(filter)),
1551 pub fn all_for_trait(db: &dyn HirDatabase, trait_: Trait) -> Vec<Impl> {
1552 let krate = trait_.module(db).krate();
1553 let mut all = Vec::new();
1554 for Crate { id } in krate.reverse_dependencies(db).into_iter().chain(Some(krate)) {
1555 let impls = db.trait_impls_in_crate(id);
1556 all.extend(impls.for_trait(trait_.id).map(Self::from))
1561 // FIXME: the return type is wrong. This should be a hir version of
1562 // `TraitRef` (ie, resolved `TypeRef`).
1563 pub fn target_trait(self, db: &dyn HirDatabase) -> Option<TypeRef> {
1564 db.impl_data(self.id).target_trait.clone()
1567 pub fn target_ty(self, db: &dyn HirDatabase) -> Type {
1568 let impl_data = db.impl_data(self.id);
1569 let resolver = self.id.resolver(db.upcast());
1570 let krate = self.id.lookup(db.upcast()).container.krate();
1571 let ctx = hir_ty::TyLoweringContext::new(db, &resolver);
1572 let ty = ctx.lower_ty(&impl_data.target_type);
1573 Type::new_with_resolver_inner(db, krate, &resolver, ty)
1576 pub fn items(self, db: &dyn HirDatabase) -> Vec<AssocItem> {
1577 db.impl_data(self.id).items.iter().map(|it| (*it).into()).collect()
1580 pub fn is_negative(self, db: &dyn HirDatabase) -> bool {
1581 db.impl_data(self.id).is_negative
1584 pub fn module(self, db: &dyn HirDatabase) -> Module {
1585 self.id.lookup(db.upcast()).container.into()
1588 pub fn krate(self, db: &dyn HirDatabase) -> Crate {
1589 Crate { id: self.module(db).id.krate() }
1592 pub fn is_builtin_derive(self, db: &dyn HirDatabase) -> Option<InFile<ast::Attr>> {
1593 let src = self.source(db)?;
1594 let item = src.file_id.is_builtin_derive(db.upcast())?;
1595 let hygenic = hir_expand::hygiene::Hygiene::new(db.upcast(), item.file_id);
1597 // FIXME: handle `cfg_attr`
1602 let path = ModPath::from_src(it.path()?, &hygenic)?;
1603 if path.as_ident()?.to_string() == "derive" {
1611 Some(item.with_value(attr))
1615 #[derive(Clone, PartialEq, Eq, Debug)]
1618 ty: InEnvironment<Ty>,
1622 pub(crate) fn new_with_resolver(
1623 db: &dyn HirDatabase,
1624 resolver: &Resolver,
1627 let krate = resolver.krate()?;
1628 Some(Type::new_with_resolver_inner(db, krate, resolver, ty))
1630 pub(crate) fn new_with_resolver_inner(
1631 db: &dyn HirDatabase,
1633 resolver: &Resolver,
1637 resolver.generic_def().map_or_else(Default::default, |d| db.trait_environment(d));
1638 Type { krate, ty: InEnvironment { value: ty, environment } }
1641 fn new(db: &dyn HirDatabase, krate: CrateId, lexical_env: impl HasResolver, ty: Ty) -> Type {
1642 let resolver = lexical_env.resolver(db.upcast());
1644 resolver.generic_def().map_or_else(Default::default, |d| db.trait_environment(d));
1645 Type { krate, ty: InEnvironment { value: ty, environment } }
1649 db: &dyn HirDatabase,
1651 def: impl HasResolver + Into<TyDefId> + Into<GenericDefId>,
1653 let substs = Substs::build_for_def(db, def).fill_with_unknown().build();
1654 let ty = db.ty(def.into()).subst(&substs);
1655 Type::new(db, krate, def, ty)
1658 pub fn is_unit(&self) -> bool {
1659 matches!(self.ty.value.interned(&Interner), TyKind::Tuple(0, ..))
1661 pub fn is_bool(&self) -> bool {
1662 matches!(self.ty.value.interned(&Interner), TyKind::Scalar(Scalar::Bool))
1665 pub fn is_mutable_reference(&self) -> bool {
1666 matches!(self.ty.value.interned(&Interner), TyKind::Ref(hir_ty::Mutability::Mut, ..))
1669 pub fn remove_ref(&self) -> Option<Type> {
1670 match &self.ty.value.interned(&Interner) {
1671 TyKind::Ref(.., ty) => Some(self.derived(ty.clone())),
1676 pub fn is_unknown(&self) -> bool {
1677 self.ty.value.is_unknown()
1680 /// Checks that particular type `ty` implements `std::future::Future`.
1681 /// This function is used in `.await` syntax completion.
1682 pub fn impls_future(&self, db: &dyn HirDatabase) -> bool {
1683 // No special case for the type of async block, since Chalk can figure it out.
1685 let krate = self.krate;
1687 let std_future_trait =
1688 db.lang_item(krate, "future_trait".into()).and_then(|it| it.as_trait());
1689 let std_future_trait = match std_future_trait {
1691 None => return false,
1694 let canonical_ty = Canonical { value: self.ty.value.clone(), kinds: Arc::new([]) };
1695 method_resolution::implements_trait(
1698 self.ty.environment.clone(),
1704 /// Checks that particular type `ty` implements `std::ops::FnOnce`.
1706 /// This function can be used to check if a particular type is callable, since FnOnce is a
1707 /// supertrait of Fn and FnMut, so all callable types implements at least FnOnce.
1708 pub fn impls_fnonce(&self, db: &dyn HirDatabase) -> bool {
1709 let krate = self.krate;
1711 let fnonce_trait = match FnTrait::FnOnce.get_id(db, krate) {
1713 None => return false,
1716 let canonical_ty = Canonical { value: self.ty.value.clone(), kinds: Arc::new([]) };
1717 method_resolution::implements_trait_unique(
1720 self.ty.environment.clone(),
1726 pub fn impls_trait(&self, db: &dyn HirDatabase, trait_: Trait, args: &[Type]) -> bool {
1727 let trait_ref = hir_ty::TraitRef {
1729 substs: Substs::build_for_def(db, trait_.id)
1730 .push(self.ty.value.clone())
1731 .fill(args.iter().map(|t| t.ty.value.clone()))
1735 let goal = Canonical {
1736 value: hir_ty::InEnvironment::new(
1737 self.ty.environment.clone(),
1738 hir_ty::Obligation::Trait(trait_ref),
1740 kinds: Arc::new([]),
1743 db.trait_solve(self.krate, goal).is_some()
1746 pub fn normalize_trait_assoc_type(
1748 db: &dyn HirDatabase,
1753 let subst = Substs::build_for_def(db, trait_.id)
1754 .push(self.ty.value.clone())
1755 .fill(args.iter().map(|t| t.ty.value.clone()))
1757 let predicate = ProjectionPredicate {
1758 projection_ty: ProjectionTy {
1759 associated_ty_id: to_assoc_type_id(alias.id),
1760 substitution: subst,
1762 ty: TyKind::BoundVar(BoundVar::new(DebruijnIndex::INNERMOST, 0)).intern(&Interner),
1764 let goal = Canonical {
1765 value: InEnvironment::new(
1766 self.ty.environment.clone(),
1767 Obligation::Projection(predicate),
1769 kinds: Arc::new([TyVariableKind::General]),
1772 match db.trait_solve(self.krate, goal)? {
1773 Solution::Unique(SolutionVariables(subst)) => {
1774 subst.value.first().map(|ty| self.derived(ty.clone()))
1776 Solution::Ambig(_) => None,
1780 pub fn is_copy(&self, db: &dyn HirDatabase) -> bool {
1781 let lang_item = db.lang_item(self.krate, SmolStr::new("copy"));
1782 let copy_trait = match lang_item {
1783 Some(LangItemTarget::TraitId(it)) => it,
1786 self.impls_trait(db, copy_trait.into(), &[])
1789 pub fn as_callable(&self, db: &dyn HirDatabase) -> Option<Callable> {
1790 let def = self.ty.value.callable_def(db);
1792 let sig = self.ty.value.callable_sig(db)?;
1793 Some(Callable { ty: self.clone(), sig, def, is_bound_method: false })
1796 pub fn is_closure(&self) -> bool {
1797 matches!(&self.ty.value.interned(&Interner), TyKind::Closure { .. })
1800 pub fn is_fn(&self) -> bool {
1801 matches!(&self.ty.value.interned(&Interner), TyKind::FnDef(..) | TyKind::Function { .. })
1804 pub fn is_packed(&self, db: &dyn HirDatabase) -> bool {
1805 let adt_id = match self.ty.value.interned(&Interner) {
1806 &TyKind::Adt(hir_ty::AdtId(adt_id), ..) => adt_id,
1810 let adt = adt_id.into();
1812 Adt::Struct(s) => matches!(s.repr(db), Some(ReprKind::Packed)),
1817 pub fn is_raw_ptr(&self) -> bool {
1818 matches!(&self.ty.value.interned(&Interner), TyKind::Raw(..))
1821 pub fn contains_unknown(&self) -> bool {
1822 return go(&self.ty.value);
1824 fn go(ty: &Ty) -> bool {
1825 match ty.interned(&Interner) {
1826 TyKind::Unknown => true,
1828 TyKind::Adt(_, substs)
1829 | TyKind::AssociatedType(_, substs)
1830 | TyKind::Tuple(_, substs)
1831 | TyKind::OpaqueType(_, substs)
1832 | TyKind::FnDef(_, substs)
1833 | TyKind::Closure(_, substs) => substs.iter().any(go),
1835 TyKind::Array(ty) | TyKind::Slice(ty) | TyKind::Raw(_, ty) | TyKind::Ref(_, ty) => {
1842 | TyKind::Placeholder(_)
1843 | TyKind::BoundVar(_)
1844 | TyKind::InferenceVar(_, _)
1846 | TyKind::Function(_)
1848 | TyKind::ForeignType(_) => false,
1853 pub fn fields(&self, db: &dyn HirDatabase) -> Vec<(Field, Type)> {
1854 let (variant_id, substs) = match self.ty.value.interned(&Interner) {
1855 &TyKind::Adt(hir_ty::AdtId(AdtId::StructId(s)), ref substs) => (s.into(), substs),
1856 &TyKind::Adt(hir_ty::AdtId(AdtId::UnionId(u)), ref substs) => (u.into(), substs),
1857 _ => return Vec::new(),
1860 db.field_types(variant_id)
1862 .map(|(local_id, ty)| {
1863 let def = Field { parent: variant_id.into(), id: local_id };
1864 let ty = ty.clone().subst(substs);
1865 (def, self.derived(ty))
1870 pub fn tuple_fields(&self, _db: &dyn HirDatabase) -> Vec<Type> {
1871 if let TyKind::Tuple(_, substs) = &self.ty.value.interned(&Interner) {
1872 substs.iter().map(|ty| self.derived(ty.clone())).collect()
1878 pub fn autoderef<'a>(&'a self, db: &'a dyn HirDatabase) -> impl Iterator<Item = Type> + 'a {
1879 // There should be no inference vars in types passed here
1880 // FIXME check that?
1881 let canonical = Canonical { value: self.ty.value.clone(), kinds: Arc::new([]) };
1882 let environment = self.ty.environment.clone();
1883 let ty = InEnvironment { value: canonical, environment };
1884 autoderef(db, Some(self.krate), ty)
1885 .map(|canonical| canonical.value)
1886 .map(move |ty| self.derived(ty))
1889 // This would be nicer if it just returned an iterator, but that runs into
1890 // lifetime problems, because we need to borrow temp `CrateImplDefs`.
1891 pub fn iterate_assoc_items<T>(
1893 db: &dyn HirDatabase,
1895 mut callback: impl FnMut(AssocItem) -> Option<T>,
1897 for krate in self.ty.value.def_crates(db, krate.id)? {
1898 let impls = db.inherent_impls_in_crate(krate);
1900 for impl_def in impls.for_self_ty(&self.ty.value) {
1901 for &item in db.impl_data(*impl_def).items.iter() {
1902 if let Some(result) = callback(item.into()) {
1903 return Some(result);
1911 pub fn type_parameters(&self) -> impl Iterator<Item = Type> + '_ {
1917 .flat_map(|substs| substs.iter())
1918 .map(move |ty| self.derived(ty.clone()))
1921 pub fn iterate_method_candidates<T>(
1923 db: &dyn HirDatabase,
1925 traits_in_scope: &FxHashSet<TraitId>,
1926 name: Option<&Name>,
1927 mut callback: impl FnMut(&Ty, Function) -> Option<T>,
1929 // There should be no inference vars in types passed here
1930 // FIXME check that?
1931 // FIXME replace Unknown by bound vars here
1932 let canonical = Canonical { value: self.ty.value.clone(), kinds: Arc::new([]) };
1934 let env = self.ty.environment.clone();
1935 let krate = krate.id;
1937 method_resolution::iterate_method_candidates(
1944 method_resolution::LookupMode::MethodCall,
1946 AssocItemId::FunctionId(f) => callback(ty, f.into()),
1952 pub fn iterate_path_candidates<T>(
1954 db: &dyn HirDatabase,
1956 traits_in_scope: &FxHashSet<TraitId>,
1957 name: Option<&Name>,
1958 mut callback: impl FnMut(&Ty, AssocItem) -> Option<T>,
1960 // There should be no inference vars in types passed here
1961 // FIXME check that?
1962 // FIXME replace Unknown by bound vars here
1963 let canonical = Canonical { value: self.ty.value.clone(), kinds: Arc::new([]) };
1965 let env = self.ty.environment.clone();
1966 let krate = krate.id;
1968 method_resolution::iterate_method_candidates(
1975 method_resolution::LookupMode::Path,
1976 |ty, it| callback(ty, it.into()),
1980 pub fn as_adt(&self) -> Option<Adt> {
1981 let (adt, _subst) = self.ty.value.as_adt()?;
1985 pub fn as_dyn_trait(&self) -> Option<Trait> {
1986 self.ty.value.dyn_trait().map(Into::into)
1989 pub fn as_impl_traits(&self, db: &dyn HirDatabase) -> Option<Vec<Trait>> {
1990 self.ty.value.impl_trait_bounds(db).map(|it| {
1992 .filter_map(|pred| match pred {
1993 hir_ty::GenericPredicate::Implemented(trait_ref) => {
1994 Some(Trait::from(trait_ref.trait_))
2002 pub fn as_associated_type_parent_trait(&self, db: &dyn HirDatabase) -> Option<Trait> {
2003 self.ty.value.associated_type_parent_trait(db).map(Into::into)
2006 fn derived(&self, ty: Ty) -> Type {
2009 ty: InEnvironment { value: ty, environment: self.ty.environment.clone() },
2013 pub fn walk(&self, db: &dyn HirDatabase, mut cb: impl FnMut(Type)) {
2014 // TypeWalk::walk for a Ty at first visits parameters and only after that the Ty itself.
2015 // We need a different order here.
2018 db: &dyn HirDatabase,
2021 cb: &mut impl FnMut(Type),
2023 for ty in substs.iter() {
2024 walk_type(db, &type_.derived(ty.clone()), cb);
2029 db: &dyn HirDatabase,
2031 bounds: &[GenericPredicate],
2032 cb: &mut impl FnMut(Type),
2034 for pred in bounds {
2036 GenericPredicate::Implemented(trait_ref) => {
2038 walk_substs(db, type_, &trait_ref.substs, cb);
2045 fn walk_type(db: &dyn HirDatabase, type_: &Type, cb: &mut impl FnMut(Type)) {
2046 let ty = type_.ty.value.strip_references();
2047 match ty.interned(&Interner) {
2048 TyKind::Adt(..) => {
2049 cb(type_.derived(ty.clone()));
2051 TyKind::AssociatedType(..) => {
2052 if let Some(_) = ty.associated_type_parent_trait(db) {
2053 cb(type_.derived(ty.clone()));
2056 TyKind::OpaqueType(..) => {
2057 if let Some(bounds) = ty.impl_trait_bounds(db) {
2058 walk_bounds(db, &type_.derived(ty.clone()), &bounds, cb);
2061 TyKind::Alias(AliasTy::Opaque(opaque_ty)) => {
2062 if let Some(bounds) = ty.impl_trait_bounds(db) {
2063 walk_bounds(db, &type_.derived(ty.clone()), &bounds, cb);
2066 walk_substs(db, type_, &opaque_ty.substitution, cb);
2068 TyKind::Placeholder(_) => {
2069 if let Some(bounds) = ty.impl_trait_bounds(db) {
2070 walk_bounds(db, &type_.derived(ty.clone()), &bounds, cb);
2073 TyKind::Dyn(bounds) => {
2074 walk_bounds(db, &type_.derived(ty.clone()), bounds.as_ref(), cb);
2077 TyKind::Ref(_, ty) | TyKind::Raw(_, ty) | TyKind::Array(ty) | TyKind::Slice(ty) => {
2078 walk_type(db, &type_.derived(ty.clone()), cb);
2083 if let Some(substs) = ty.substs() {
2084 walk_substs(db, type_, &substs, cb);
2088 walk_type(db, self, &mut cb);
2094 pub struct Callable {
2097 def: Option<CallableDefId>,
2098 pub(crate) is_bound_method: bool,
2101 pub enum CallableKind {
2103 TupleStruct(Struct),
2104 TupleEnumVariant(Variant),
2109 pub fn kind(&self) -> CallableKind {
2111 Some(CallableDefId::FunctionId(it)) => CallableKind::Function(it.into()),
2112 Some(CallableDefId::StructId(it)) => CallableKind::TupleStruct(it.into()),
2113 Some(CallableDefId::EnumVariantId(it)) => CallableKind::TupleEnumVariant(it.into()),
2114 None => CallableKind::Closure,
2117 pub fn receiver_param(&self, db: &dyn HirDatabase) -> Option<ast::SelfParam> {
2118 let func = match self.def {
2119 Some(CallableDefId::FunctionId(it)) if self.is_bound_method => it,
2122 let src = func.lookup(db.upcast()).source(db.upcast());
2123 let param_list = src.value.param_list()?;
2124 param_list.self_param()
2126 pub fn n_params(&self) -> usize {
2127 self.sig.params().len() - if self.is_bound_method { 1 } else { 0 }
2131 db: &dyn HirDatabase,
2132 ) -> Vec<(Option<Either<ast::SelfParam, ast::Pat>>, Type)> {
2137 .skip(if self.is_bound_method { 1 } else { 0 })
2138 .map(|ty| self.ty.derived(ty.clone()));
2139 let patterns = match self.def {
2140 Some(CallableDefId::FunctionId(func)) => {
2141 let src = func.lookup(db.upcast()).source(db.upcast());
2142 src.value.param_list().map(|param_list| {
2145 .map(|it| Some(Either::Left(it)))
2146 .filter(|_| !self.is_bound_method)
2148 .chain(param_list.params().map(|it| it.pat().map(Either::Right)))
2153 patterns.into_iter().flatten().chain(iter::repeat(None)).zip(types).collect()
2155 pub fn return_type(&self) -> Type {
2156 self.ty.derived(self.sig.ret().clone())
2161 #[derive(Debug, PartialEq, Eq, Hash)]
2163 ModuleDef(ModuleDef),
2165 GenericParam(GenericParam),
2173 pub fn all_items(def: PerNs) -> ArrayVec<[Self; 3]> {
2174 let mut items = ArrayVec::new();
2176 match (def.take_types(), def.take_values()) {
2177 (Some(m1), None) => items.push(ScopeDef::ModuleDef(m1.into())),
2178 (None, Some(m2)) => items.push(ScopeDef::ModuleDef(m2.into())),
2179 (Some(m1), Some(m2)) => {
2180 // Some items, like unit structs and enum variants, are
2181 // returned as both a type and a value. Here we want
2182 // to de-duplicate them.
2184 items.push(ScopeDef::ModuleDef(m1.into()));
2185 items.push(ScopeDef::ModuleDef(m2.into()));
2187 items.push(ScopeDef::ModuleDef(m1.into()));
2193 if let Some(macro_def_id) = def.take_macros() {
2194 items.push(ScopeDef::MacroDef(macro_def_id.into()));
2197 if items.is_empty() {
2198 items.push(ScopeDef::Unknown);
2205 impl From<ItemInNs> for ScopeDef {
2206 fn from(item: ItemInNs) -> Self {
2208 ItemInNs::Types(id) => ScopeDef::ModuleDef(id.into()),
2209 ItemInNs::Values(id) => ScopeDef::ModuleDef(id.into()),
2210 ItemInNs::Macros(id) => ScopeDef::MacroDef(id.into()),
2215 pub trait HasVisibility {
2216 fn visibility(&self, db: &dyn HirDatabase) -> Visibility;
2217 fn is_visible_from(&self, db: &dyn HirDatabase, module: Module) -> bool {
2218 let vis = self.visibility(db);
2219 vis.is_visible_from(db.upcast(), module.id)