1 #![allow(clippy::float_cmp)]
3 use crate::{clip, sext, unsext};
4 use if_chain::if_chain;
5 use rustc_ast::ast::{self, LitFloatType, LitKind};
6 use rustc_data_structures::sync::Lrc;
7 use rustc_hir::def::{DefKind, Res};
8 use rustc_hir::{BinOp, BinOpKind, Block, Expr, ExprKind, HirId, QPath, UnOp};
9 use rustc_lint::LateContext;
10 use rustc_middle::mir::interpret::Scalar;
11 use rustc_middle::ty::subst::{Subst, SubstsRef};
12 use rustc_middle::ty::{self, FloatTy, ScalarInt, Ty, TyCtxt};
13 use rustc_middle::{bug, span_bug};
14 use rustc_span::symbol::Symbol;
15 use std::cmp::Ordering::{self, Equal};
16 use std::convert::TryInto;
17 use std::hash::{Hash, Hasher};
20 /// A `LitKind`-like enum to fold constant `Expr`s into.
21 #[derive(Debug, Clone)]
23 /// A `String` (e.g., "abc").
25 /// A binary string (e.g., `b"abc"`).
27 /// A single `char` (e.g., `'a'`).
29 /// An integer's bit representation.
35 /// `true` or `false`.
37 /// An array of constants.
39 /// Also an array, but with only one constant, repeated N times.
40 Repeat(Box<Constant>, u64),
41 /// A tuple of constants.
47 /// A literal with syntax error.
51 impl PartialEq for Constant {
52 fn eq(&self, other: &Self) -> bool {
54 (&Self::Str(ref ls), &Self::Str(ref rs)) => ls == rs,
55 (&Self::Binary(ref l), &Self::Binary(ref r)) => l == r,
56 (&Self::Char(l), &Self::Char(r)) => l == r,
57 (&Self::Int(l), &Self::Int(r)) => l == r,
58 (&Self::F64(l), &Self::F64(r)) => {
59 // We want `Fw32 == FwAny` and `FwAny == Fw64`, and by transitivity we must have
60 // `Fw32 == Fw64`, so don’t compare them.
61 // `to_bits` is required to catch non-matching 0.0, -0.0, and NaNs.
62 l.to_bits() == r.to_bits()
64 (&Self::F32(l), &Self::F32(r)) => {
65 // We want `Fw32 == FwAny` and `FwAny == Fw64`, and by transitivity we must have
66 // `Fw32 == Fw64`, so don’t compare them.
67 // `to_bits` is required to catch non-matching 0.0, -0.0, and NaNs.
68 f64::from(l).to_bits() == f64::from(r).to_bits()
70 (&Self::Bool(l), &Self::Bool(r)) => l == r,
71 (&Self::Vec(ref l), &Self::Vec(ref r)) | (&Self::Tuple(ref l), &Self::Tuple(ref r)) => l == r,
72 (&Self::Repeat(ref lv, ref ls), &Self::Repeat(ref rv, ref rs)) => ls == rs && lv == rv,
73 (&Self::Ref(ref lb), &Self::Ref(ref rb)) => *lb == *rb,
74 // TODO: are there inter-type equalities?
80 impl Hash for Constant {
81 fn hash<H>(&self, state: &mut H)
85 std::mem::discriminant(self).hash(state);
90 Self::Binary(ref b) => {
100 f64::from(f).to_bits().hash(state);
103 f.to_bits().hash(state);
108 Self::Vec(ref v) | Self::Tuple(ref v) => {
111 Self::Repeat(ref c, l) => {
118 Self::Ref(ref r) => {
121 Self::Err(ref s) => {
129 pub fn partial_cmp(tcx: TyCtxt<'_>, cmp_type: Ty<'_>, left: &Self, right: &Self) -> Option<Ordering> {
130 match (left, right) {
131 (&Self::Str(ref ls), &Self::Str(ref rs)) => Some(ls.cmp(rs)),
132 (&Self::Char(ref l), &Self::Char(ref r)) => Some(l.cmp(r)),
133 (&Self::Int(l), &Self::Int(r)) => {
134 if let ty::Int(int_ty) = *cmp_type.kind() {
135 Some(sext(tcx, l, int_ty).cmp(&sext(tcx, r, int_ty)))
140 (&Self::F64(l), &Self::F64(r)) => l.partial_cmp(&r),
141 (&Self::F32(l), &Self::F32(r)) => l.partial_cmp(&r),
142 (&Self::Bool(ref l), &Self::Bool(ref r)) => Some(l.cmp(r)),
143 (&Self::Tuple(ref l), &Self::Tuple(ref r)) | (&Self::Vec(ref l), &Self::Vec(ref r)) => {
145 .map(|(li, ri)| Self::partial_cmp(tcx, cmp_type, li, ri))
146 .find(|r| r.map_or(true, |o| o != Ordering::Equal))
147 .unwrap_or_else(|| Some(l.len().cmp(&r.len())))
149 (&Self::Repeat(ref lv, ref ls), &Self::Repeat(ref rv, ref rs)) => {
150 match Self::partial_cmp(tcx, cmp_type, lv, rv) {
151 Some(Equal) => Some(ls.cmp(rs)),
155 (&Self::Ref(ref lb), &Self::Ref(ref rb)) => Self::partial_cmp(tcx, cmp_type, lb, rb),
156 // TODO: are there any useful inter-type orderings?
162 /// Parses a `LitKind` to a `Constant`.
163 pub fn lit_to_constant(lit: &LitKind, ty: Option<Ty<'_>>) -> Constant {
165 LitKind::Str(ref is, _) => Constant::Str(is.to_string()),
166 LitKind::Byte(b) => Constant::Int(u128::from(b)),
167 LitKind::ByteStr(ref s) => Constant::Binary(Lrc::clone(s)),
168 LitKind::Char(c) => Constant::Char(c),
169 LitKind::Int(n, _) => Constant::Int(n),
170 LitKind::Float(ref is, LitFloatType::Suffixed(fty)) => match fty {
171 ast::FloatTy::F32 => Constant::F32(is.as_str().parse().unwrap()),
172 ast::FloatTy::F64 => Constant::F64(is.as_str().parse().unwrap()),
174 LitKind::Float(ref is, LitFloatType::Unsuffixed) => match ty.expect("type of float is known").kind() {
175 ty::Float(FloatTy::F32) => Constant::F32(is.as_str().parse().unwrap()),
176 ty::Float(FloatTy::F64) => Constant::F64(is.as_str().parse().unwrap()),
179 LitKind::Bool(b) => Constant::Bool(b),
180 LitKind::Err(s) => Constant::Err(s),
184 pub fn constant<'tcx>(
185 lcx: &LateContext<'tcx>,
186 typeck_results: &ty::TypeckResults<'tcx>,
188 ) -> Option<(Constant, bool)> {
189 let mut cx = ConstEvalLateContext {
192 param_env: lcx.param_env,
193 needed_resolution: false,
194 substs: lcx.tcx.intern_substs(&[]),
196 cx.expr(e).map(|cst| (cst, cx.needed_resolution))
199 pub fn constant_simple<'tcx>(
200 lcx: &LateContext<'tcx>,
201 typeck_results: &ty::TypeckResults<'tcx>,
203 ) -> Option<Constant> {
204 constant(lcx, typeck_results, e).and_then(|(cst, res)| if res { None } else { Some(cst) })
207 /// Creates a `ConstEvalLateContext` from the given `LateContext` and `TypeckResults`.
208 pub fn constant_context<'a, 'tcx>(
209 lcx: &'a LateContext<'tcx>,
210 typeck_results: &'a ty::TypeckResults<'tcx>,
211 ) -> ConstEvalLateContext<'a, 'tcx> {
212 ConstEvalLateContext {
215 param_env: lcx.param_env,
216 needed_resolution: false,
217 substs: lcx.tcx.intern_substs(&[]),
221 pub struct ConstEvalLateContext<'a, 'tcx> {
222 lcx: &'a LateContext<'tcx>,
223 typeck_results: &'a ty::TypeckResults<'tcx>,
224 param_env: ty::ParamEnv<'tcx>,
225 needed_resolution: bool,
226 substs: SubstsRef<'tcx>,
229 impl<'a, 'tcx> ConstEvalLateContext<'a, 'tcx> {
230 /// Simple constant folding: Insert an expression, get a constant or none.
231 pub fn expr(&mut self, e: &Expr<'_>) -> Option<Constant> {
233 ExprKind::Path(ref qpath) => self.fetch_path(qpath, e.hir_id, self.typeck_results.expr_ty(e)),
234 ExprKind::Block(ref block, _) => self.block(block),
235 ExprKind::Lit(ref lit) => Some(lit_to_constant(&lit.node, self.typeck_results.expr_ty_opt(e))),
236 ExprKind::Array(ref vec) => self.multi(vec).map(Constant::Vec),
237 ExprKind::Tup(ref tup) => self.multi(tup).map(Constant::Tuple),
238 ExprKind::Repeat(ref value, _) => {
239 let n = match self.typeck_results.expr_ty(e).kind() {
240 ty::Array(_, n) => n.try_eval_usize(self.lcx.tcx, self.lcx.param_env)?,
241 _ => span_bug!(e.span, "typeck error"),
243 self.expr(value).map(|v| Constant::Repeat(Box::new(v), n))
245 ExprKind::Unary(op, ref operand) => self.expr(operand).and_then(|o| match op {
246 UnOp::Not => self.constant_not(&o, self.typeck_results.expr_ty(e)),
247 UnOp::Neg => self.constant_negate(&o, self.typeck_results.expr_ty(e)),
248 UnOp::Deref => Some(if let Constant::Ref(r) = o { *r } else { o }),
250 ExprKind::If(ref cond, ref then, ref otherwise) => self.ifthenelse(cond, then, *otherwise),
251 ExprKind::Binary(op, ref left, ref right) => self.binop(op, left, right),
252 ExprKind::Call(ref callee, ref args) => {
253 // We only handle a few const functions for now.
256 if let ExprKind::Path(qpath) = &callee.kind;
257 let res = self.typeck_results.qpath_res(qpath, callee.hir_id);
258 if let Some(def_id) = res.opt_def_id();
259 let def_path: Vec<_> = self.lcx.get_def_path(def_id).into_iter().map(Symbol::as_str).collect();
260 let def_path: Vec<&str> = def_path.iter().take(4).map(|s| &**s).collect();
261 if let ["core", "num", int_impl, "max_value"] = *def_path;
263 let value = match int_impl {
264 "<impl i8>" => i8::MAX as u128,
265 "<impl i16>" => i16::MAX as u128,
266 "<impl i32>" => i32::MAX as u128,
267 "<impl i64>" => i64::MAX as u128,
268 "<impl i128>" => i128::MAX as u128,
271 Some(Constant::Int(value))
278 ExprKind::Index(ref arr, ref index) => self.index(arr, index),
279 ExprKind::AddrOf(_, _, ref inner) => self.expr(inner).map(|r| Constant::Ref(Box::new(r))),
280 // TODO: add other expressions.
285 #[allow(clippy::cast_possible_wrap)]
286 fn constant_not(&self, o: &Constant, ty: Ty<'_>) -> Option<Constant> {
287 use self::Constant::{Bool, Int};
289 Bool(b) => Some(Bool(!b)),
293 ty::Int(ity) => Some(Int(unsext(self.lcx.tcx, value as i128, ity))),
294 ty::Uint(ity) => Some(Int(clip(self.lcx.tcx, value, ity))),
302 fn constant_negate(&self, o: &Constant, ty: Ty<'_>) -> Option<Constant> {
303 use self::Constant::{Int, F32, F64};
306 let ity = match *ty.kind() {
311 let value = sext(self.lcx.tcx, value, ity);
312 let value = value.checked_neg()?;
314 Some(Int(unsext(self.lcx.tcx, value, ity)))
316 F32(f) => Some(F32(-f)),
317 F64(f) => Some(F64(-f)),
322 /// Create `Some(Vec![..])` of all constants, unless there is any
323 /// non-constant part.
324 fn multi(&mut self, vec: &[Expr<'_>]) -> Option<Vec<Constant>> {
325 vec.iter().map(|elem| self.expr(elem)).collect::<Option<_>>()
328 /// Lookup a possibly constant expression from a `ExprKind::Path`.
329 fn fetch_path(&mut self, qpath: &QPath<'_>, id: HirId, ty: Ty<'tcx>) -> Option<Constant> {
330 let res = self.typeck_results.qpath_res(qpath, id);
332 Res::Def(DefKind::Const | DefKind::AssocConst, def_id) => {
333 let substs = self.typeck_results.node_substs(id);
334 let substs = if self.substs.is_empty() {
337 substs.subst(self.lcx.tcx, self.substs)
346 def: ty::WithOptConstParam::unknown(def_id),
353 .map(|val| rustc_middle::ty::Const::from_value(self.lcx.tcx, val, ty))?;
354 let result = miri_to_const(&result);
355 if result.is_some() {
356 self.needed_resolution = true;
360 // FIXME: cover all usable cases.
365 fn index(&mut self, lhs: &'_ Expr<'_>, index: &'_ Expr<'_>) -> Option<Constant> {
366 let lhs = self.expr(lhs);
367 let index = self.expr(index);
370 (Some(Constant::Vec(vec)), Some(Constant::Int(index))) => match vec.get(index as usize) {
371 Some(Constant::F32(x)) => Some(Constant::F32(*x)),
372 Some(Constant::F64(x)) => Some(Constant::F64(*x)),
375 (Some(Constant::Vec(vec)), _) => {
376 if !vec.is_empty() && vec.iter().all(|x| *x == vec[0]) {
378 Some(Constant::F32(x)) => Some(Constant::F32(*x)),
379 Some(Constant::F64(x)) => Some(Constant::F64(*x)),
390 /// A block can only yield a constant if it only has one constant expression.
391 fn block(&mut self, block: &Block<'_>) -> Option<Constant> {
392 if block.stmts.is_empty() {
393 block.expr.as_ref().and_then(|b| self.expr(b))
399 fn ifthenelse(&mut self, cond: &Expr<'_>, then: &Expr<'_>, otherwise: Option<&Expr<'_>>) -> Option<Constant> {
400 if let Some(Constant::Bool(b)) = self.expr(cond) {
404 otherwise.as_ref().and_then(|expr| self.expr(expr))
411 fn binop(&mut self, op: BinOp, left: &Expr<'_>, right: &Expr<'_>) -> Option<Constant> {
412 let l = self.expr(left)?;
413 let r = self.expr(right);
415 (Constant::Int(l), Some(Constant::Int(r))) => match *self.typeck_results.expr_ty_opt(left)?.kind() {
417 let l = sext(self.lcx.tcx, l, ity);
418 let r = sext(self.lcx.tcx, r, ity);
419 let zext = |n: i128| Constant::Int(unsext(self.lcx.tcx, n, ity));
421 BinOpKind::Add => l.checked_add(r).map(zext),
422 BinOpKind::Sub => l.checked_sub(r).map(zext),
423 BinOpKind::Mul => l.checked_mul(r).map(zext),
424 BinOpKind::Div if r != 0 => l.checked_div(r).map(zext),
425 BinOpKind::Rem if r != 0 => l.checked_rem(r).map(zext),
426 BinOpKind::Shr => l.checked_shr(r.try_into().expect("invalid shift")).map(zext),
427 BinOpKind::Shl => l.checked_shl(r.try_into().expect("invalid shift")).map(zext),
428 BinOpKind::BitXor => Some(zext(l ^ r)),
429 BinOpKind::BitOr => Some(zext(l | r)),
430 BinOpKind::BitAnd => Some(zext(l & r)),
431 BinOpKind::Eq => Some(Constant::Bool(l == r)),
432 BinOpKind::Ne => Some(Constant::Bool(l != r)),
433 BinOpKind::Lt => Some(Constant::Bool(l < r)),
434 BinOpKind::Le => Some(Constant::Bool(l <= r)),
435 BinOpKind::Ge => Some(Constant::Bool(l >= r)),
436 BinOpKind::Gt => Some(Constant::Bool(l > r)),
440 ty::Uint(_) => match op.node {
441 BinOpKind::Add => l.checked_add(r).map(Constant::Int),
442 BinOpKind::Sub => l.checked_sub(r).map(Constant::Int),
443 BinOpKind::Mul => l.checked_mul(r).map(Constant::Int),
444 BinOpKind::Div => l.checked_div(r).map(Constant::Int),
445 BinOpKind::Rem => l.checked_rem(r).map(Constant::Int),
446 BinOpKind::Shr => l.checked_shr(r.try_into().expect("shift too large")).map(Constant::Int),
447 BinOpKind::Shl => l.checked_shl(r.try_into().expect("shift too large")).map(Constant::Int),
448 BinOpKind::BitXor => Some(Constant::Int(l ^ r)),
449 BinOpKind::BitOr => Some(Constant::Int(l | r)),
450 BinOpKind::BitAnd => Some(Constant::Int(l & r)),
451 BinOpKind::Eq => Some(Constant::Bool(l == r)),
452 BinOpKind::Ne => Some(Constant::Bool(l != r)),
453 BinOpKind::Lt => Some(Constant::Bool(l < r)),
454 BinOpKind::Le => Some(Constant::Bool(l <= r)),
455 BinOpKind::Ge => Some(Constant::Bool(l >= r)),
456 BinOpKind::Gt => Some(Constant::Bool(l > r)),
461 (Constant::F32(l), Some(Constant::F32(r))) => match op.node {
462 BinOpKind::Add => Some(Constant::F32(l + r)),
463 BinOpKind::Sub => Some(Constant::F32(l - r)),
464 BinOpKind::Mul => Some(Constant::F32(l * r)),
465 BinOpKind::Div => Some(Constant::F32(l / r)),
466 BinOpKind::Rem => Some(Constant::F32(l % r)),
467 BinOpKind::Eq => Some(Constant::Bool(l == r)),
468 BinOpKind::Ne => Some(Constant::Bool(l != r)),
469 BinOpKind::Lt => Some(Constant::Bool(l < r)),
470 BinOpKind::Le => Some(Constant::Bool(l <= r)),
471 BinOpKind::Ge => Some(Constant::Bool(l >= r)),
472 BinOpKind::Gt => Some(Constant::Bool(l > r)),
475 (Constant::F64(l), Some(Constant::F64(r))) => match op.node {
476 BinOpKind::Add => Some(Constant::F64(l + r)),
477 BinOpKind::Sub => Some(Constant::F64(l - r)),
478 BinOpKind::Mul => Some(Constant::F64(l * r)),
479 BinOpKind::Div => Some(Constant::F64(l / r)),
480 BinOpKind::Rem => Some(Constant::F64(l % r)),
481 BinOpKind::Eq => Some(Constant::Bool(l == r)),
482 BinOpKind::Ne => Some(Constant::Bool(l != r)),
483 BinOpKind::Lt => Some(Constant::Bool(l < r)),
484 BinOpKind::Le => Some(Constant::Bool(l <= r)),
485 BinOpKind::Ge => Some(Constant::Bool(l >= r)),
486 BinOpKind::Gt => Some(Constant::Bool(l > r)),
489 (l, r) => match (op.node, l, r) {
490 (BinOpKind::And, Constant::Bool(false), _) => Some(Constant::Bool(false)),
491 (BinOpKind::Or, Constant::Bool(true), _) => Some(Constant::Bool(true)),
492 (BinOpKind::And, Constant::Bool(true), Some(r)) | (BinOpKind::Or, Constant::Bool(false), Some(r)) => {
495 (BinOpKind::BitXor, Constant::Bool(l), Some(Constant::Bool(r))) => Some(Constant::Bool(l ^ r)),
496 (BinOpKind::BitAnd, Constant::Bool(l), Some(Constant::Bool(r))) => Some(Constant::Bool(l & r)),
497 (BinOpKind::BitOr, Constant::Bool(l), Some(Constant::Bool(r))) => Some(Constant::Bool(l | r)),
504 pub fn miri_to_const(result: &ty::Const<'_>) -> Option<Constant> {
505 use rustc_middle::mir::interpret::ConstValue;
507 ty::ConstKind::Value(ConstValue::Scalar(Scalar::Int(int))) => {
508 match result.ty.kind() {
509 ty::Bool => Some(Constant::Bool(int == ScalarInt::TRUE)),
510 ty::Uint(_) | ty::Int(_) => Some(Constant::Int(int.assert_bits(int.size()))),
511 ty::Float(FloatTy::F32) => Some(Constant::F32(f32::from_bits(
512 int.try_into().expect("invalid f32 bit representation"),
514 ty::Float(FloatTy::F64) => Some(Constant::F64(f64::from_bits(
515 int.try_into().expect("invalid f64 bit representation"),
517 ty::RawPtr(type_and_mut) => {
518 if let ty::Uint(_) = type_and_mut.ty.kind() {
519 return Some(Constant::RawPtr(int.assert_bits(int.size())));
523 // FIXME: implement other conversions.
527 ty::ConstKind::Value(ConstValue::Slice { data, start, end }) => match result.ty.kind() {
528 ty::Ref(_, tam, _) => match tam.kind() {
529 ty::Str => String::from_utf8(
530 data.inspect_with_uninit_and_ptr_outside_interpreter(start..end)
539 ty::ConstKind::Value(ConstValue::ByRef { alloc, offset: _ }) => match result.ty.kind() {
540 ty::Array(sub_type, len) => match sub_type.kind() {
541 ty::Float(FloatTy::F32) => match miri_to_const(len) {
542 Some(Constant::Int(len)) => alloc
543 .inspect_with_uninit_and_ptr_outside_interpreter(0..(4 * len as usize))
547 Some(Constant::F32(f32::from_le_bytes(
548 chunk.try_into().expect("this shouldn't happen"),
551 .collect::<Option<Vec<Constant>>>()
555 ty::Float(FloatTy::F64) => match miri_to_const(len) {
556 Some(Constant::Int(len)) => alloc
557 .inspect_with_uninit_and_ptr_outside_interpreter(0..(8 * len as usize))
561 Some(Constant::F64(f64::from_le_bytes(
562 chunk.try_into().expect("this shouldn't happen"),
565 .collect::<Option<Vec<Constant>>>()
569 // FIXME: implement other array type conversions.
574 // FIXME: implement other conversions.