1 //! HIR for references to types. Paths in these are not yet resolved. They can
2 //! be directly created from an ast::TypeRef, without further queries.
4 use hir_expand::{name::Name, AstId, InFile};
5 use std::convert::TryInto;
8 use crate::{body::LowerCtx, intern::Interned, path::Path};
10 #[derive(Copy, Clone, PartialEq, Eq, Hash, Debug)]
17 pub fn from_mutable(mutable: bool) -> Mutability {
25 pub fn as_keyword_for_ref(self) -> &'static str {
27 Mutability::Shared => "",
28 Mutability::Mut => "mut ",
32 pub fn as_keyword_for_ptr(self) -> &'static str {
34 Mutability::Shared => "const ",
35 Mutability::Mut => "mut ",
40 #[derive(Copy, Clone, PartialEq, Eq, Hash, Debug)]
47 pub fn from_raw(is_raw: bool) -> Rawness {
56 #[derive(Clone, PartialEq, Eq, Hash, Debug)]
62 /// Converts an `ast::PathType` to a `hir::TraitRef`.
63 pub(crate) fn from_ast(ctx: &LowerCtx, node: ast::Type) -> Option<Self> {
64 // FIXME: Use `Path::from_src`
66 ast::Type::PathType(path) => {
67 path.path().and_then(|it| ctx.lower_path(it)).map(|path| TraitRef { path })
76 /// Note: Most users of `TypeRef` that end up in the salsa database intern it using
77 /// `Interned<TypeRef>` to save space. But notably, nested `TypeRef`s are not interned, since that
78 /// does not seem to save any noticeable amount of memory.
79 #[derive(Clone, PartialEq, Eq, Hash, Debug)]
85 RawPtr(Box<TypeRef>, Mutability),
86 Reference(Box<TypeRef>, Option<LifetimeRef>, Mutability),
87 // FIXME: for full const generics, the latter element (length) here is going to have to be an
88 // expression that is further lowered later in hir_ty.
89 Array(Box<TypeRef>, ConstScalar),
91 /// A fn pointer. Last element of the vector is the return type.
92 Fn(Vec<TypeRef>, bool /*varargs*/),
94 ImplTrait(Vec<Interned<TypeBound>>),
95 DynTrait(Vec<Interned<TypeBound>>),
96 Macro(AstId<ast::MacroCall>),
100 #[derive(Clone, PartialEq, Eq, Hash, Debug)]
101 pub struct LifetimeRef {
106 pub(crate) fn new_name(name: Name) -> Self {
110 pub(crate) fn new(lifetime: &ast::Lifetime) -> Self {
111 LifetimeRef { name: Name::new_lifetime(lifetime) }
114 pub fn missing() -> LifetimeRef {
115 LifetimeRef { name: Name::missing() }
119 #[derive(Clone, PartialEq, Eq, Hash, Debug)]
122 ForLifetime(Box<[Name]>, Path),
123 Lifetime(LifetimeRef),
128 /// Converts an `ast::TypeRef` to a `hir::TypeRef`.
129 pub fn from_ast(ctx: &LowerCtx, node: ast::Type) -> Self {
131 ast::Type::ParenType(inner) => TypeRef::from_ast_opt(ctx, inner.ty()),
132 ast::Type::TupleType(inner) => {
133 TypeRef::Tuple(inner.fields().map(|it| TypeRef::from_ast(ctx, it)).collect())
135 ast::Type::NeverType(..) => TypeRef::Never,
136 ast::Type::PathType(inner) => {
137 // FIXME: Use `Path::from_src`
140 .and_then(|it| ctx.lower_path(it))
142 .unwrap_or(TypeRef::Error)
144 ast::Type::PtrType(inner) => {
145 let inner_ty = TypeRef::from_ast_opt(ctx, inner.ty());
146 let mutability = Mutability::from_mutable(inner.mut_token().is_some());
147 TypeRef::RawPtr(Box::new(inner_ty), mutability)
149 ast::Type::ArrayType(inner) => {
150 // FIXME: This is a hack. We should probably reuse the machinery of
151 // `hir_def::body::lower` to lower this into an `Expr` and then evaluate it at the
152 // `hir_ty` level, which would allow knowing the type of:
153 // let v: [u8; 2 + 2] = [0u8; 4];
156 .map(ConstScalar::usize_from_literal_expr)
157 .unwrap_or(ConstScalar::Unknown);
159 TypeRef::Array(Box::new(TypeRef::from_ast_opt(ctx, inner.ty())), len)
161 ast::Type::SliceType(inner) => {
162 TypeRef::Slice(Box::new(TypeRef::from_ast_opt(ctx, inner.ty())))
164 ast::Type::RefType(inner) => {
165 let inner_ty = TypeRef::from_ast_opt(ctx, inner.ty());
166 let lifetime = inner.lifetime().map(|lt| LifetimeRef::new(<));
167 let mutability = Mutability::from_mutable(inner.mut_token().is_some());
168 TypeRef::Reference(Box::new(inner_ty), lifetime, mutability)
170 ast::Type::InferType(_inner) => TypeRef::Placeholder,
171 ast::Type::FnPtrType(inner) => {
174 .and_then(|rt| rt.ty())
175 .map(|it| TypeRef::from_ast(ctx, it))
176 .unwrap_or_else(|| TypeRef::Tuple(Vec::new()));
177 let mut is_varargs = false;
178 let mut params = if let Some(pl) = inner.param_list() {
179 if let Some(param) = pl.params().last() {
180 is_varargs = param.dotdotdot_token().is_some();
183 pl.params().map(|p| p.ty()).map(|it| TypeRef::from_ast_opt(ctx, it)).collect()
188 TypeRef::Fn(params, is_varargs)
190 // for types are close enough for our purposes to the inner type for now...
191 ast::Type::ForType(inner) => TypeRef::from_ast_opt(ctx, inner.ty()),
192 ast::Type::ImplTraitType(inner) => {
193 TypeRef::ImplTrait(type_bounds_from_ast(ctx, inner.type_bound_list()))
195 ast::Type::DynTraitType(inner) => {
196 TypeRef::DynTrait(type_bounds_from_ast(ctx, inner.type_bound_list()))
198 ast::Type::MacroType(mt) => match mt.macro_call() {
201 .map(|mc| TypeRef::Macro(InFile::new(ctx.file_id(), mc)))
202 .unwrap_or(TypeRef::Error),
203 None => TypeRef::Error,
208 pub(crate) fn from_ast_opt(ctx: &LowerCtx, node: Option<ast::Type>) -> Self {
209 if let Some(node) = node {
210 TypeRef::from_ast(ctx, node)
216 pub(crate) fn unit() -> TypeRef {
217 TypeRef::Tuple(Vec::new())
220 pub fn walk(&self, f: &mut impl FnMut(&TypeRef)) {
223 fn go(type_ref: &TypeRef, f: &mut impl FnMut(&TypeRef)) {
226 TypeRef::Fn(types, _) | TypeRef::Tuple(types) => {
227 types.iter().for_each(|t| go(t, f))
229 TypeRef::RawPtr(type_ref, _)
230 | TypeRef::Reference(type_ref, ..)
231 | TypeRef::Array(type_ref, _)
232 | TypeRef::Slice(type_ref) => go(type_ref, f),
233 TypeRef::ImplTrait(bounds) | TypeRef::DynTrait(bounds) => {
234 for bound in bounds {
235 match bound.as_ref() {
236 TypeBound::Path(path) | TypeBound::ForLifetime(_, path) => {
239 TypeBound::Lifetime(_) | TypeBound::Error => (),
243 TypeRef::Path(path) => go_path(path, f),
244 TypeRef::Never | TypeRef::Placeholder | TypeRef::Macro(_) | TypeRef::Error => {}
248 fn go_path(path: &Path, f: &mut impl FnMut(&TypeRef)) {
249 if let Some(type_ref) = path.type_anchor() {
252 for segment in path.segments().iter() {
253 if let Some(args_and_bindings) = segment.args_and_bindings {
254 for arg in &args_and_bindings.args {
256 crate::path::GenericArg::Type(type_ref) => {
259 crate::path::GenericArg::Lifetime(_) => {}
262 for binding in &args_and_bindings.bindings {
263 if let Some(type_ref) = &binding.type_ref {
266 for bound in &binding.bounds {
267 match bound.as_ref() {
268 TypeBound::Path(path) | TypeBound::ForLifetime(_, path) => {
271 TypeBound::Lifetime(_) | TypeBound::Error => (),
281 pub(crate) fn type_bounds_from_ast(
282 lower_ctx: &LowerCtx,
283 type_bounds_opt: Option<ast::TypeBoundList>,
284 ) -> Vec<Interned<TypeBound>> {
285 if let Some(type_bounds) = type_bounds_opt {
286 type_bounds.bounds().map(|it| Interned::new(TypeBound::from_ast(lower_ctx, it))).collect()
293 pub(crate) fn from_ast(ctx: &LowerCtx, node: ast::TypeBound) -> Self {
294 let lower_path_type = |path_type: ast::PathType| ctx.lower_path(path_type.path()?);
297 ast::TypeBoundKind::PathType(path_type) => {
298 lower_path_type(path_type).map(TypeBound::Path).unwrap_or(TypeBound::Error)
300 ast::TypeBoundKind::ForType(for_type) => {
301 let lt_refs = match for_type.generic_param_list() {
304 .flat_map(|lp| lp.lifetime().map(|lt| Name::new_lifetime(<)))
306 None => Box::default(),
308 let path = for_type.ty().and_then(|ty| match ty {
309 ast::Type::PathType(path_type) => lower_path_type(path_type),
313 Some(p) => TypeBound::ForLifetime(lt_refs, p),
314 None => TypeBound::Error,
317 ast::TypeBoundKind::Lifetime(lifetime) => {
318 TypeBound::Lifetime(LifetimeRef::new(&lifetime))
323 pub fn as_path(&self) -> Option<&Path> {
325 TypeBound::Path(p) | TypeBound::ForLifetime(_, p) => Some(p),
326 TypeBound::Lifetime(_) | TypeBound::Error => None,
331 /// A concrete constant value
332 #[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
333 pub enum ConstScalar {
334 // for now, we only support the trivial case of constant evaluating the length of an array
335 // Note that this is u64 because the target usize may be bigger than our usize
338 /// Case of an unknown value that rustc might know but we don't
339 // FIXME: this is a hack to get around chalk not being able to represent unevaluatable
341 // https://github.com/rust-analyzer/rust-analyzer/pull/8813#issuecomment-840679177
342 // https://rust-lang.zulipchat.com/#narrow/stream/144729-wg-traits/topic/Handling.20non.20evaluatable.20constants'.20equality/near/238386348
346 impl std::fmt::Display for ConstScalar {
347 fn fmt(&self, fmt: &mut std::fmt::Formatter<'_>) -> Result<(), std::fmt::Error> {
349 ConstScalar::Usize(us) => write!(fmt, "{}", us),
350 ConstScalar::Unknown => write!(fmt, "_"),
356 /// Gets a target usize out of the ConstScalar
357 pub fn as_usize(&self) -> Option<u64> {
359 &ConstScalar::Usize(us) => Some(us),
364 // FIXME: as per the comments on `TypeRef::Array`, this evaluation should not happen at this
366 fn usize_from_literal_expr(expr: ast::Expr) -> ConstScalar {
368 ast::Expr::Literal(lit) => {
369 let lkind = lit.kind();
371 ast::LiteralKind::IntNumber(num)
372 if num.suffix() == None || num.suffix() == Some("usize") =>
374 num.value().and_then(|v| v.try_into().ok())
381 .map(ConstScalar::Usize)
382 .unwrap_or(ConstScalar::Unknown)