1 //! Constant evaluation details
8 use chalk_ir::{BoundVar, DebruijnIndex, GenericArgData, IntTy, Scalar};
10 expr::{ArithOp, BinaryOp, Expr, ExprId, Literal, Pat, PatId},
12 resolver::{resolver_for_expr, ResolveValueResult, Resolver, ValueNs},
13 type_ref::ConstScalar,
14 ConstId, DefWithBodyId,
16 use la_arena::{Arena, Idx};
20 db::HirDatabase, infer::InferenceContext, lower::ParamLoweringMode, to_placeholder_idx,
21 utils::Generics, Const, ConstData, ConstValue, GenericArg, InferenceResult, Interner, Ty,
25 /// Extension trait for [`Const`]
27 /// Is a [`Const`] unknown?
28 fn is_unknown(&self) -> bool;
31 impl ConstExt for Const {
32 fn is_unknown(&self) -> bool {
33 match self.data(Interner).value {
35 chalk_ir::ConstValue::Concrete(chalk_ir::ConcreteConst {
36 interned: ConstScalar::Unknown,
39 // interned concrete anything else
40 chalk_ir::ConstValue::Concrete(..) => false,
44 "is_unknown was called on a non-concrete constant value! {:?}",
53 pub struct ConstEvalCtx<'a> {
54 pub db: &'a dyn HirDatabase,
55 pub owner: DefWithBodyId,
56 pub exprs: &'a Arena<Expr>,
57 pub pats: &'a Arena<Pat>,
58 pub local_data: HashMap<PatId, ComputedExpr>,
59 infer: &'a InferenceResult,
62 impl ConstEvalCtx<'_> {
63 fn expr_ty(&mut self, expr: ExprId) -> Ty {
64 self.infer[expr].clone()
68 #[derive(Debug, Clone, PartialEq, Eq)]
69 pub enum ConstEvalError {
70 NotSupported(&'static str),
71 SemanticError(&'static str),
77 #[derive(Debug, Clone, PartialEq, Eq)]
78 pub enum ComputedExpr {
80 Tuple(Box<[ComputedExpr]>),
83 impl Display for ComputedExpr {
84 fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
86 ComputedExpr::Literal(l) => match l {
87 Literal::Int(x, _) => {
89 write!(f, "{} ({:#X})", x, x)
94 Literal::Uint(x, _) => {
96 write!(f, "{} ({:#X})", x, x)
101 Literal::Float(x, _) => x.fmt(f),
102 Literal::Bool(x) => x.fmt(f),
103 Literal::Char(x) => std::fmt::Debug::fmt(x, f),
104 Literal::String(x) => std::fmt::Debug::fmt(x, f),
105 Literal::ByteString(x) => std::fmt::Debug::fmt(x, f),
107 ComputedExpr::Tuple(t) => {
119 fn scalar_max(scalar: &Scalar) -> i128 {
122 Scalar::Char => u32::MAX as i128,
123 Scalar::Int(x) => match x {
124 IntTy::Isize => isize::MAX as i128,
125 IntTy::I8 => i8::MAX as i128,
126 IntTy::I16 => i16::MAX as i128,
127 IntTy::I32 => i32::MAX as i128,
128 IntTy::I64 => i64::MAX as i128,
129 IntTy::I128 => i128::MAX as i128,
131 Scalar::Uint(x) => match x {
132 chalk_ir::UintTy::Usize => usize::MAX as i128,
133 chalk_ir::UintTy::U8 => u8::MAX as i128,
134 chalk_ir::UintTy::U16 => u16::MAX as i128,
135 chalk_ir::UintTy::U32 => u32::MAX as i128,
136 chalk_ir::UintTy::U64 => u64::MAX as i128,
137 chalk_ir::UintTy::U128 => i128::MAX as i128, // ignore too big u128 for now
139 Scalar::Float(_) => 0,
143 fn is_valid(scalar: &Scalar, value: i128) -> bool {
145 !matches!(scalar, Scalar::Uint(_)) && -scalar_max(scalar) - 1 <= value
147 value <= scalar_max(scalar)
153 ctx: &mut ConstEvalCtx<'_>,
154 ) -> Result<ComputedExpr, ConstEvalError> {
155 let expr = &ctx.exprs[expr_id];
157 Expr::Missing => Err(ConstEvalError::IncompleteExpr),
158 Expr::Literal(l) => Ok(ComputedExpr::Literal(l.clone())),
159 &Expr::UnaryOp { expr, op } => {
160 let ty = &ctx.expr_ty(expr);
161 let ev = eval_const(expr, ctx)?;
163 hir_def::expr::UnaryOp::Deref => Err(ConstEvalError::NotSupported("deref")),
164 hir_def::expr::UnaryOp::Not => {
166 ComputedExpr::Literal(Literal::Bool(b)) => {
167 return Ok(ComputedExpr::Literal(Literal::Bool(!b)))
169 ComputedExpr::Literal(Literal::Int(v, _)) => v,
170 ComputedExpr::Literal(Literal::Uint(v, _)) => v
172 .map_err(|_| ConstEvalError::NotSupported("too big u128"))?,
173 _ => return Err(ConstEvalError::NotSupported("this kind of operator")),
175 let r = match ty.kind(Interner) {
176 TyKind::Scalar(Scalar::Uint(x)) => match x {
177 chalk_ir::UintTy::U8 => !(v as u8) as i128,
178 chalk_ir::UintTy::U16 => !(v as u16) as i128,
179 chalk_ir::UintTy::U32 => !(v as u32) as i128,
180 chalk_ir::UintTy::U64 => !(v as u64) as i128,
181 chalk_ir::UintTy::U128 => {
182 return Err(ConstEvalError::NotSupported("negation of u128"))
184 chalk_ir::UintTy::Usize => !(v as usize) as i128,
186 TyKind::Scalar(Scalar::Int(x)) => match x {
187 chalk_ir::IntTy::I8 => !(v as i8) as i128,
188 chalk_ir::IntTy::I16 => !(v as i16) as i128,
189 chalk_ir::IntTy::I32 => !(v as i32) as i128,
190 chalk_ir::IntTy::I64 => !(v as i64) as i128,
191 chalk_ir::IntTy::I128 => !v,
192 chalk_ir::IntTy::Isize => !(v as isize) as i128,
194 _ => return Err(ConstEvalError::NotSupported("unreachable?")),
196 Ok(ComputedExpr::Literal(Literal::Int(r, None)))
198 hir_def::expr::UnaryOp::Neg => {
200 ComputedExpr::Literal(Literal::Int(v, _)) => v,
201 ComputedExpr::Literal(Literal::Uint(v, _)) => v
203 .map_err(|_| ConstEvalError::NotSupported("too big u128"))?,
204 _ => return Err(ConstEvalError::NotSupported("this kind of operator")),
206 Ok(ComputedExpr::Literal(Literal::Int(
207 v.checked_neg().ok_or_else(|| {
208 ConstEvalError::Panic("overflow in negation".to_string())
215 &Expr::BinaryOp { lhs, rhs, op } => {
216 let ty = &ctx.expr_ty(lhs);
217 let lhs = eval_const(lhs, ctx)?;
218 let rhs = eval_const(rhs, ctx)?;
219 let op = op.ok_or(ConstEvalError::IncompleteExpr)?;
221 ComputedExpr::Literal(Literal::Int(v, _)) => v,
222 ComputedExpr::Literal(Literal::Uint(v, _)) => {
223 v.try_into().map_err(|_| ConstEvalError::NotSupported("too big u128"))?
225 _ => return Err(ConstEvalError::NotSupported("this kind of operator")),
228 ComputedExpr::Literal(Literal::Int(v, _)) => v,
229 ComputedExpr::Literal(Literal::Uint(v, _)) => {
230 v.try_into().map_err(|_| ConstEvalError::NotSupported("too big u128"))?
232 _ => return Err(ConstEvalError::NotSupported("this kind of operator")),
235 BinaryOp::ArithOp(b) => {
236 let panic_arith = ConstEvalError::Panic(
237 "attempt to run invalid arithmetic operation".to_string(),
240 ArithOp::Add => v1.checked_add(v2).ok_or_else(|| panic_arith.clone())?,
241 ArithOp::Mul => v1.checked_mul(v2).ok_or_else(|| panic_arith.clone())?,
242 ArithOp::Sub => v1.checked_sub(v2).ok_or_else(|| panic_arith.clone())?,
243 ArithOp::Div => v1.checked_div(v2).ok_or_else(|| panic_arith.clone())?,
244 ArithOp::Rem => v1.checked_rem(v2).ok_or_else(|| panic_arith.clone())?,
246 .checked_shl(v2.try_into().map_err(|_| panic_arith.clone())?)
247 .ok_or_else(|| panic_arith.clone())?,
249 .checked_shr(v2.try_into().map_err(|_| panic_arith.clone())?)
250 .ok_or_else(|| panic_arith.clone())?,
251 ArithOp::BitXor => v1 ^ v2,
252 ArithOp::BitOr => v1 | v2,
253 ArithOp::BitAnd => v1 & v2,
255 if let TyKind::Scalar(s) = ty.kind(Interner) {
257 return Err(panic_arith);
260 Ok(ComputedExpr::Literal(Literal::Int(r, None)))
262 BinaryOp::LogicOp(_) => Err(ConstEvalError::SemanticError("logic op on numbers")),
263 _ => Err(ConstEvalError::NotSupported("bin op on this operators")),
266 Expr::Block { statements, tail, .. } => {
267 let mut prev_values = HashMap::<PatId, Option<ComputedExpr>>::default();
268 for statement in &**statements {
270 hir_def::expr::Statement::Let { pat: pat_id, initializer, .. } => {
271 let pat = &ctx.pats[pat_id];
273 Pat::Bind { subpat, .. } if subpat.is_none() => (),
275 return Err(ConstEvalError::NotSupported("complex patterns in let"))
278 let value = match initializer {
279 Some(x) => eval_const(x, ctx)?,
282 if !prev_values.contains_key(&pat_id) {
283 let prev = ctx.local_data.insert(pat_id, value);
284 prev_values.insert(pat_id, prev);
286 ctx.local_data.insert(pat_id, value);
289 hir_def::expr::Statement::Expr { .. } => {
290 return Err(ConstEvalError::NotSupported("this kind of statement"))
295 &Some(x) => eval_const(x, ctx),
296 None => Ok(ComputedExpr::Tuple(Box::new([]))),
298 // clean up local data, so caller will receive the exact map that passed to us
299 for (name, val) in prev_values {
301 Some(x) => ctx.local_data.insert(name, x),
302 None => ctx.local_data.remove(&name),
308 let resolver = resolver_for_expr(ctx.db.upcast(), ctx.owner, expr_id);
310 .resolve_path_in_value_ns(ctx.db.upcast(), p.mod_path())
311 .ok_or(ConstEvalError::SemanticError("unresolved path"))?;
313 ResolveValueResult::ValueNs(v) => v,
314 ResolveValueResult::Partial(..) => {
317 .assoc_resolutions_for_expr(expr_id)
318 .ok_or(ConstEvalError::SemanticError("unresolved assoc item"))?
320 hir_def::AssocItemId::FunctionId(_) => {
321 Err(ConstEvalError::NotSupported("assoc function"))
323 hir_def::AssocItemId::ConstId(c) => ctx.db.const_eval(c),
324 hir_def::AssocItemId::TypeAliasId(_) => {
325 Err(ConstEvalError::NotSupported("assoc type alias"))
331 ValueNs::LocalBinding(pat_id) => {
335 .ok_or(ConstEvalError::NotSupported("Unexpected missing local"))?;
338 ValueNs::ConstId(id) => ctx.db.const_eval(id),
339 ValueNs::GenericParam(_) => {
340 Err(ConstEvalError::NotSupported("const generic without substitution"))
342 _ => Err(ConstEvalError::NotSupported("path that are not const or local")),
345 _ => Err(ConstEvalError::NotSupported("This kind of expression")),
349 pub(crate) fn path_to_const(
350 db: &dyn HirDatabase,
353 mode: ParamLoweringMode,
354 args_lazy: impl FnOnce() -> Generics,
355 debruijn: DebruijnIndex,
357 match resolver.resolve_path_in_value_ns_fully(db.upcast(), &path) {
358 Some(ValueNs::GenericParam(p)) => {
359 let ty = db.const_param_ty(p);
360 let args = args_lazy();
361 let value = match mode {
362 ParamLoweringMode::Placeholder => {
363 ConstValue::Placeholder(to_placeholder_idx(db, p.into()))
365 ParamLoweringMode::Variable => match args.param_idx(p.into()) {
366 Some(x) => ConstValue::BoundVar(BoundVar::new(debruijn, x)),
369 "Generic list doesn't contain this param: {:?}, {}, {:?}",
378 Some(ConstData { ty, value }.intern(Interner))
384 pub fn unknown_const(ty: Ty) -> Const {
387 value: ConstValue::Concrete(chalk_ir::ConcreteConst { interned: ConstScalar::Unknown }),
392 pub fn unknown_const_as_generic(ty: Ty) -> GenericArg {
393 GenericArgData::Const(unknown_const(ty)).intern(Interner)
396 /// Interns a constant scalar with the given type
397 pub fn intern_const_scalar(value: ConstScalar, ty: Ty) -> Const {
398 ConstData { ty, value: ConstValue::Concrete(chalk_ir::ConcreteConst { interned: value }) }
402 /// Interns a possibly-unknown target usize
403 pub fn usize_const(value: Option<u128>) -> Const {
404 intern_const_scalar(value.map_or(ConstScalar::Unknown, ConstScalar::UInt), TyBuilder::usize())
407 pub(crate) fn const_eval_recover(
411 ) -> Result<ComputedExpr, ConstEvalError> {
412 Err(ConstEvalError::Loop)
415 pub(crate) fn const_eval_query(
416 db: &dyn HirDatabase,
418 ) -> Result<ComputedExpr, ConstEvalError> {
419 let def = const_id.into();
420 let body = db.body(def);
421 let infer = &db.infer(def);
422 let result = eval_const(
426 owner: const_id.into(),
429 local_data: HashMap::default(),
436 pub(crate) fn eval_to_const<'a>(
438 mode: ParamLoweringMode,
439 ctx: &mut InferenceContext<'a>,
440 args: impl FnOnce() -> Generics,
441 debruijn: DebruijnIndex,
443 if let Expr::Path(p) = &ctx.body.exprs[expr] {
445 let resolver = &ctx.resolver;
446 if let Some(c) = path_to_const(db, resolver, p.mod_path(), mode, args, debruijn) {
450 let body = ctx.body.clone();
451 let mut ctx = ConstEvalCtx {
456 local_data: HashMap::default(),
459 let computed_expr = eval_const(expr, &mut ctx);
460 let const_scalar = match computed_expr {
461 Ok(ComputedExpr::Literal(literal)) => literal.into(),
462 _ => ConstScalar::Unknown,
464 intern_const_scalar(const_scalar, TyBuilder::usize())