clippy_lints/src/consts.rs

   1 #![allow(clippy::float_cmp)]
   2
   3 use crate::utils::{clip, higher, sext, unsext};
   4 use if_chain::if_chain;
   5 use rustc::hir::def::{DefKind, Res};
   6 use rustc::hir::*;
   7 use rustc::lint::LateContext;
   8 use rustc::ty::subst::{Subst, SubstsRef};
   9 use rustc::ty::{self, Instance, Ty, TyCtxt};
  10 use rustc::{bug, span_bug};
  11 use rustc_data_structures::sync::Lrc;
  12 use std::cmp::Ordering::{self, Equal};
  13 use std::cmp::PartialOrd;
  14 use std::convert::TryInto;
  15 use std::hash::{Hash, Hasher};
  16 use syntax::ast::{FloatTy, LitKind};
  17 use syntax_pos::symbol::Symbol;
  18
  19 /// A `LitKind`-like enum to fold constant `Expr`s into.
  20 #[derive(Debug, Clone)]
  21 pub enum Constant {
  22     /// A `String` (e.g., "abc").
  23     Str(String),
  24     /// A binary string (e.g., `b"abc"`).
  25     Binary(Lrc<Vec<u8>>),
  26     /// A single `char` (e.g., `'a'`).
  27     Char(char),
  28     /// An integer's bit representation.
  29     Int(u128),
  30     /// An `f32`.
  31     F32(f32),
  32     /// An `f64`.
  33     F64(f64),
  34     /// `true` or `false`.
  35     Bool(bool),
  36     /// An array of constants.
  37     Vec(Vec<Constant>),
  38     /// Also an array, but with only one constant, repeated N times.
  39     Repeat(Box<Constant>, u64),
  40     /// A tuple of constants.
  41     Tuple(Vec<Constant>),
  42     /// A raw pointer.
  43     RawPtr(u128),
  44     /// A literal with syntax error.
  45     Err(Symbol),
  46 }
  47
  48 impl PartialEq for Constant {
  49     fn eq(&self, other: &Self) -> bool {
  50         match (self, other) {
  51             (&Self::Str(ref ls), &Self::Str(ref rs)) => ls == rs,
  52             (&Self::Binary(ref l), &Self::Binary(ref r)) => l == r,
  53             (&Self::Char(l), &Self::Char(r)) => l == r,
  54             (&Self::Int(l), &Self::Int(r)) => l == r,
  55             (&Self::F64(l), &Self::F64(r)) => {
  56                 // We want `Fw32 == FwAny` and `FwAny == Fw64`, and by transitivity we must have
  57                 // `Fw32 == Fw64`, so don’t compare them.
  58                 // `to_bits` is required to catch non-matching 0.0, -0.0, and NaNs.
  59                 l.to_bits() == r.to_bits()
  60             },
  61             (&Self::F32(l), &Self::F32(r)) => {
  62                 // We want `Fw32 == FwAny` and `FwAny == Fw64`, and by transitivity we must have
  63                 // `Fw32 == Fw64`, so don’t compare them.
  64                 // `to_bits` is required to catch non-matching 0.0, -0.0, and NaNs.
  65                 f64::from(l).to_bits() == f64::from(r).to_bits()
  66             },
  67             (&Self::Bool(l), &Self::Bool(r)) => l == r,
  68             (&Self::Vec(ref l), &Self::Vec(ref r)) | (&Self::Tuple(ref l), &Self::Tuple(ref r)) => l == r,
  69             (&Self::Repeat(ref lv, ref ls), &Self::Repeat(ref rv, ref rs)) => ls == rs && lv == rv,
  70             // TODO: are there inter-type equalities?
  71             _ => false,
  72         }
  73     }
  74 }
  75
  76 impl Hash for Constant {
  77     fn hash<H>(&self, state: &mut H)
  78     where
  79         H: Hasher,
  80     {
  81         std::mem::discriminant(self).hash(state);
  82         match *self {
  83             Self::Str(ref s) => {
  84                 s.hash(state);
  85             },
  86             Self::Binary(ref b) => {
  87                 b.hash(state);
  88             },
  89             Self::Char(c) => {
  90                 c.hash(state);
  91             },
  92             Self::Int(i) => {
  93                 i.hash(state);
  94             },
  95             Self::F32(f) => {
  96                 f64::from(f).to_bits().hash(state);
  97             },
  98             Self::F64(f) => {
  99                 f.to_bits().hash(state);
 100             },
 101             Self::Bool(b) => {
 102                 b.hash(state);
 103             },
 104             Self::Vec(ref v) | Self::Tuple(ref v) => {
 105                 v.hash(state);
 106             },
 107             Self::Repeat(ref c, l) => {
 108                 c.hash(state);
 109                 l.hash(state);
 110             },
 111             Self::RawPtr(u) => {
 112                 u.hash(state);
 113             },
 114             Self::Err(ref s) => {
 115                 s.hash(state);
 116             },
 117         }
 118     }
 119 }
 120
 121 impl Constant {
 122     pub fn partial_cmp(tcx: TyCtxt<'_>, cmp_type: Ty<'_>, left: &Self, right: &Self) -> Option<Ordering> {
 123         match (left, right) {
 124             (&Self::Str(ref ls), &Self::Str(ref rs)) => Some(ls.cmp(rs)),
 125             (&Self::Char(ref l), &Self::Char(ref r)) => Some(l.cmp(r)),
 126             (&Self::Int(l), &Self::Int(r)) => {
 127                 if let ty::Int(int_ty) = cmp_type.kind {
 128                     Some(sext(tcx, l, int_ty).cmp(&sext(tcx, r, int_ty)))
 129                 } else {
 130                     Some(l.cmp(&r))
 131                 }
 132             },
 133             (&Self::F64(l), &Self::F64(r)) => l.partial_cmp(&r),
 134             (&Self::F32(l), &Self::F32(r)) => l.partial_cmp(&r),
 135             (&Self::Bool(ref l), &Self::Bool(ref r)) => Some(l.cmp(r)),
 136             (&Self::Tuple(ref l), &Self::Tuple(ref r)) | (&Self::Vec(ref l), &Self::Vec(ref r)) => l
 137                 .iter()
 138                 .zip(r.iter())
 139                 .map(|(li, ri)| Self::partial_cmp(tcx, cmp_type, li, ri))
 140                 .find(|r| r.map_or(true, |o| o != Ordering::Equal))
 141                 .unwrap_or_else(|| Some(l.len().cmp(&r.len()))),
 142             (&Self::Repeat(ref lv, ref ls), &Self::Repeat(ref rv, ref rs)) => {
 143                 match Self::partial_cmp(tcx, cmp_type, lv, rv) {
 144                     Some(Equal) => Some(ls.cmp(rs)),
 145                     x => x,
 146                 }
 147             },
 148             // TODO: are there any useful inter-type orderings?
 149             _ => None,
 150         }
 151     }
 152 }
 153
 154 /// Parses a `LitKind` to a `Constant`.
 155 pub fn lit_to_constant(lit: &LitKind, ty: Option<Ty<'_>>) -> Constant {
 156     use syntax::ast::*;
 157
 158     match *lit {
 159         LitKind::Str(ref is, _) => Constant::Str(is.to_string()),
 160         LitKind::Byte(b) => Constant::Int(u128::from(b)),
 161         LitKind::ByteStr(ref s) => Constant::Binary(Lrc::clone(s)),
 162         LitKind::Char(c) => Constant::Char(c),
 163         LitKind::Int(n, _) => Constant::Int(n),
 164         LitKind::Float(ref is, FloatTy::F32) => Constant::F32(is.as_str().parse().unwrap()),
 165         LitKind::Float(ref is, FloatTy::F64) => Constant::F64(is.as_str().parse().unwrap()),
 166         LitKind::FloatUnsuffixed(ref is) => match ty.expect("type of float is known").kind {
 167             ty::Float(FloatTy::F32) => Constant::F32(is.as_str().parse().unwrap()),
 168             ty::Float(FloatTy::F64) => Constant::F64(is.as_str().parse().unwrap()),
 169             _ => bug!(),
 170         },
 171         LitKind::Bool(b) => Constant::Bool(b),
 172         LitKind::Err(s) => Constant::Err(s),
 173     }
 174 }
 175
 176 pub fn constant<'c, 'cc>(
 177     lcx: &LateContext<'c, 'cc>,
 178     tables: &'c ty::TypeckTables<'cc>,
 179     e: &Expr,
 180 ) -> Option<(Constant, bool)> {
 181     let mut cx = ConstEvalLateContext {
 182         lcx,
 183         tables,
 184         param_env: lcx.param_env,
 185         needed_resolution: false,
 186         substs: lcx.tcx.intern_substs(&[]),
 187     };
 188     cx.expr(e).map(|cst| (cst, cx.needed_resolution))
 189 }
 190
 191 pub fn constant_simple<'c, 'cc>(
 192     lcx: &LateContext<'c, 'cc>,
 193     tables: &'c ty::TypeckTables<'cc>,
 194     e: &Expr,
 195 ) -> Option<Constant> {
 196     constant(lcx, tables, e).and_then(|(cst, res)| if res { None } else { Some(cst) })
 197 }
 198
 199 /// Creates a `ConstEvalLateContext` from the given `LateContext` and `TypeckTables`.
 200 pub fn constant_context<'c, 'cc>(
 201     lcx: &'c LateContext<'c, 'cc>,
 202     tables: &'c ty::TypeckTables<'cc>,
 203 ) -> ConstEvalLateContext<'c, 'cc> {
 204     ConstEvalLateContext {
 205         lcx,
 206         tables,
 207         param_env: lcx.param_env,
 208         needed_resolution: false,
 209         substs: lcx.tcx.intern_substs(&[]),
 210     }
 211 }
 212
 213 pub struct ConstEvalLateContext<'a, 'tcx> {
 214     lcx: &'a LateContext<'a, 'tcx>,
 215     tables: &'a ty::TypeckTables<'tcx>,
 216     param_env: ty::ParamEnv<'tcx>,
 217     needed_resolution: bool,
 218     substs: SubstsRef<'tcx>,
 219 }
 220
 221 impl<'c, 'cc> ConstEvalLateContext<'c, 'cc> {
 222     /// Simple constant folding: Insert an expression, get a constant or none.
 223     pub fn expr(&mut self, e: &Expr) -> Option<Constant> {
 224         if let Some((ref cond, ref then, otherwise)) = higher::if_block(&e) {
 225             return self.ifthenelse(cond, then, otherwise);
 226         }
 227         match e.kind {
 228             ExprKind::Path(ref qpath) => self.fetch_path(qpath, e.hir_id),
 229             ExprKind::Block(ref block, _) => self.block(block),
 230             ExprKind::Lit(ref lit) => Some(lit_to_constant(&lit.node, self.tables.expr_ty_opt(e))),
 231             ExprKind::Array(ref vec) => self.multi(vec).map(Constant::Vec),
 232             ExprKind::Tup(ref tup) => self.multi(tup).map(Constant::Tuple),
 233             ExprKind::Repeat(ref value, _) => {
 234                 let n = match self.tables.expr_ty(e).kind {
 235                     ty::Array(_, n) => n.eval_usize(self.lcx.tcx, self.lcx.param_env),
 236                     _ => span_bug!(e.span, "typeck error"),
 237                 };
 238                 self.expr(value).map(|v| Constant::Repeat(Box::new(v), n))
 239             },
 240             ExprKind::Unary(op, ref operand) => self.expr(operand).and_then(|o| match op {
 241                 UnNot => self.constant_not(&o, self.tables.expr_ty(e)),
 242                 UnNeg => self.constant_negate(&o, self.tables.expr_ty(e)),
 243                 UnDeref => Some(o),
 244             }),
 245             ExprKind::Binary(op, ref left, ref right) => self.binop(op, left, right),
 246             ExprKind::Call(ref callee, ref args) => {
 247                 // We only handle a few const functions for now.
 248                 if_chain! {
 249                     if args.is_empty();
 250                     if let ExprKind::Path(qpath) = &callee.kind;
 251                     let res = self.tables.qpath_res(qpath, callee.hir_id);
 252                     if let Some(def_id) = res.opt_def_id();
 253                     let get_def_path = self.lcx.get_def_path(def_id, );
 254                     let def_path = get_def_path
 255                         .iter()
 256                         .copied()
 257                         .map(Symbol::as_str)
 258                         .collect::<Vec<_>>();
 259                     if def_path[0] == "core";
 260                     if def_path[1] == "num";
 261                     if def_path[3] == "max_value";
 262                     if def_path.len() == 4;
 263                     then {
 264                        let value = match &*def_path[2] {
 265                            "<impl i8>" => i8::max_value() as u128,
 266                            "<impl i16>" => i16::max_value() as u128,
 267                            "<impl i32>" => i32::max_value() as u128,
 268                            "<impl i64>" => i64::max_value() as u128,
 269                            "<impl i128>" => i128::max_value() as u128,
 270                            _ => return None,
 271                        };
 272                        Some(Constant::Int(value))
 273                     }
 274                     else {
 275                         None
 276                     }
 277                 }
 278             },
 279             // TODO: add other expressions.
 280             _ => None,
 281         }
 282     }
 283
 284     #[allow(clippy::cast_possible_wrap)]
 285     fn constant_not(&self, o: &Constant, ty: Ty<'_>) -> Option<Constant> {
 286         use self::Constant::*;
 287         match *o {
 288             Bool(b) => Some(Bool(!b)),
 289             Int(value) => {
 290                 let value = !value;
 291                 match ty.kind {
 292                     ty::Int(ity) => Some(Int(unsext(self.lcx.tcx, value as i128, ity))),
 293                     ty::Uint(ity) => Some(Int(clip(self.lcx.tcx, value, ity))),
 294                     _ => None,
 295                 }
 296             },
 297             _ => None,
 298         }
 299     }
 300
 301     fn constant_negate(&self, o: &Constant, ty: Ty<'_>) -> Option<Constant> {
 302         use self::Constant::*;
 303         match *o {
 304             Int(value) => {
 305                 let ity = match ty.kind {
 306                     ty::Int(ity) => ity,
 307                     _ => return None,
 308                 };
 309                 // sign extend
 310                 let value = sext(self.lcx.tcx, value, ity);
 311                 let value = value.checked_neg()?;
 312                 // clear unused bits
 313                 Some(Int(unsext(self.lcx.tcx, value, ity)))
 314             },
 315             F32(f) => Some(F32(-f)),
 316             F64(f) => Some(F64(-f)),
 317             _ => None,
 318         }
 319     }
 320
 321     /// Create `Some(Vec![..])` of all constants, unless there is any
 322     /// non-constant part.
 323     fn multi(&mut self, vec: &[Expr]) -> Option<Vec<Constant>> {
 324         vec.iter().map(|elem| self.expr(elem)).collect::<Option<_>>()
 325     }
 326
 327     /// Lookup a possibly constant expression from a ExprKind::Path.
 328     fn fetch_path(&mut self, qpath: &QPath, id: HirId) -> Option<Constant> {
 329         use rustc::mir::interpret::GlobalId;
 330
 331         let res = self.tables.qpath_res(qpath, id);
 332         match res {
 333             Res::Def(DefKind::Const, def_id) | Res::Def(DefKind::AssocConst, def_id) => {
 334                 let substs = self.tables.node_substs(id);
 335                 let substs = if self.substs.is_empty() {
 336                     substs
 337                 } else {
 338                     substs.subst(self.lcx.tcx, self.substs)
 339                 };
 340                 let instance = Instance::resolve(self.lcx.tcx, self.param_env, def_id, substs)?;
 341                 let gid = GlobalId {
 342                     instance,
 343                     promoted: None,
 344                 };
 345
 346                 let result = self.lcx.tcx.const_eval(self.param_env.and(gid)).ok()?;
 347                 let result = miri_to_const(&result);
 348                 if result.is_some() {
 349                     self.needed_resolution = true;
 350                 }
 351                 result
 352             },
 353             // FIXME: cover all usable cases.
 354             _ => None,
 355         }
 356     }
 357
 358     /// A block can only yield a constant if it only has one constant expression.
 359     fn block(&mut self, block: &Block) -> Option<Constant> {
 360         if block.stmts.is_empty() {
 361             block.expr.as_ref().and_then(|b| self.expr(b))
 362         } else {
 363             None
 364         }
 365     }
 366
 367     fn ifthenelse(&mut self, cond: &Expr, then: &Expr, otherwise: Option<&Expr>) -> Option<Constant> {
 368         if let Some(Constant::Bool(b)) = self.expr(cond) {
 369             if b {
 370                 self.expr(&*then)
 371             } else {
 372                 otherwise.as_ref().and_then(|expr| self.expr(expr))
 373             }
 374         } else {
 375             None
 376         }
 377     }
 378
 379     fn binop(&mut self, op: BinOp, left: &Expr, right: &Expr) -> Option<Constant> {
 380         let l = self.expr(left)?;
 381         let r = self.expr(right);
 382         match (l, r) {
 383             (Constant::Int(l), Some(Constant::Int(r))) => match self.tables.expr_ty(left).kind {
 384                 ty::Int(ity) => {
 385                     let l = sext(self.lcx.tcx, l, ity);
 386                     let r = sext(self.lcx.tcx, r, ity);
 387                     let zext = |n: i128| Constant::Int(unsext(self.lcx.tcx, n, ity));
 388                     match op.node {
 389                         BinOpKind::Add => l.checked_add(r).map(zext),
 390                         BinOpKind::Sub => l.checked_sub(r).map(zext),
 391                         BinOpKind::Mul => l.checked_mul(r).map(zext),
 392                         BinOpKind::Div if r != 0 => l.checked_div(r).map(zext),
 393                         BinOpKind::Rem if r != 0 => l.checked_rem(r).map(zext),
 394                         BinOpKind::Shr => l.checked_shr(r.try_into().expect("invalid shift")).map(zext),
 395                         BinOpKind::Shl => l.checked_shl(r.try_into().expect("invalid shift")).map(zext),
 396                         BinOpKind::BitXor => Some(zext(l ^ r)),
 397                         BinOpKind::BitOr => Some(zext(l | r)),
 398                         BinOpKind::BitAnd => Some(zext(l & r)),
 399                         BinOpKind::Eq => Some(Constant::Bool(l == r)),
 400                         BinOpKind::Ne => Some(Constant::Bool(l != r)),
 401                         BinOpKind::Lt => Some(Constant::Bool(l < r)),
 402                         BinOpKind::Le => Some(Constant::Bool(l <= r)),
 403                         BinOpKind::Ge => Some(Constant::Bool(l >= r)),
 404                         BinOpKind::Gt => Some(Constant::Bool(l > r)),
 405                         _ => None,
 406                     }
 407                 },
 408                 ty::Uint(_) => match op.node {
 409                     BinOpKind::Add => l.checked_add(r).map(Constant::Int),
 410                     BinOpKind::Sub => l.checked_sub(r).map(Constant::Int),
 411                     BinOpKind::Mul => l.checked_mul(r).map(Constant::Int),
 412                     BinOpKind::Div => l.checked_div(r).map(Constant::Int),
 413                     BinOpKind::Rem => l.checked_rem(r).map(Constant::Int),
 414                     BinOpKind::Shr => l.checked_shr(r.try_into().expect("shift too large")).map(Constant::Int),
 415                     BinOpKind::Shl => l.checked_shl(r.try_into().expect("shift too large")).map(Constant::Int),
 416                     BinOpKind::BitXor => Some(Constant::Int(l ^ r)),
 417                     BinOpKind::BitOr => Some(Constant::Int(l | r)),
 418                     BinOpKind::BitAnd => Some(Constant::Int(l & r)),
 419                     BinOpKind::Eq => Some(Constant::Bool(l == r)),
 420                     BinOpKind::Ne => Some(Constant::Bool(l != r)),
 421                     BinOpKind::Lt => Some(Constant::Bool(l < r)),
 422                     BinOpKind::Le => Some(Constant::Bool(l <= r)),
 423                     BinOpKind::Ge => Some(Constant::Bool(l >= r)),
 424                     BinOpKind::Gt => Some(Constant::Bool(l > r)),
 425                     _ => None,
 426                 },
 427                 _ => None,
 428             },
 429             (Constant::F32(l), Some(Constant::F32(r))) => match op.node {
 430                 BinOpKind::Add => Some(Constant::F32(l + r)),
 431                 BinOpKind::Sub => Some(Constant::F32(l - r)),
 432                 BinOpKind::Mul => Some(Constant::F32(l * r)),
 433                 BinOpKind::Div => Some(Constant::F32(l / r)),
 434                 BinOpKind::Rem => Some(Constant::F32(l % r)),
 435                 BinOpKind::Eq => Some(Constant::Bool(l == r)),
 436                 BinOpKind::Ne => Some(Constant::Bool(l != r)),
 437                 BinOpKind::Lt => Some(Constant::Bool(l < r)),
 438                 BinOpKind::Le => Some(Constant::Bool(l <= r)),
 439                 BinOpKind::Ge => Some(Constant::Bool(l >= r)),
 440                 BinOpKind::Gt => Some(Constant::Bool(l > r)),
 441                 _ => None,
 442             },
 443             (Constant::F64(l), Some(Constant::F64(r))) => match op.node {
 444                 BinOpKind::Add => Some(Constant::F64(l + r)),
 445                 BinOpKind::Sub => Some(Constant::F64(l - r)),
 446                 BinOpKind::Mul => Some(Constant::F64(l * r)),
 447                 BinOpKind::Div => Some(Constant::F64(l / r)),
 448                 BinOpKind::Rem => Some(Constant::F64(l % r)),
 449                 BinOpKind::Eq => Some(Constant::Bool(l == r)),
 450                 BinOpKind::Ne => Some(Constant::Bool(l != r)),
 451                 BinOpKind::Lt => Some(Constant::Bool(l < r)),
 452                 BinOpKind::Le => Some(Constant::Bool(l <= r)),
 453                 BinOpKind::Ge => Some(Constant::Bool(l >= r)),
 454                 BinOpKind::Gt => Some(Constant::Bool(l > r)),
 455                 _ => None,
 456             },
 457             (l, r) => match (op.node, l, r) {
 458                 (BinOpKind::And, Constant::Bool(false), _) => Some(Constant::Bool(false)),
 459                 (BinOpKind::Or, Constant::Bool(true), _) => Some(Constant::Bool(true)),
 460                 (BinOpKind::And, Constant::Bool(true), Some(r)) | (BinOpKind::Or, Constant::Bool(false), Some(r)) => {
 461                     Some(r)
 462                 },
 463                 (BinOpKind::BitXor, Constant::Bool(l), Some(Constant::Bool(r))) => Some(Constant::Bool(l ^ r)),
 464                 (BinOpKind::BitAnd, Constant::Bool(l), Some(Constant::Bool(r))) => Some(Constant::Bool(l & r)),
 465                 (BinOpKind::BitOr, Constant::Bool(l), Some(Constant::Bool(r))) => Some(Constant::Bool(l | r)),
 466                 _ => None,
 467             },
 468         }
 469     }
 470 }
 471
 472 pub fn miri_to_const(result: &ty::Const<'_>) -> Option<Constant> {
 473     use rustc::mir::interpret::{ConstValue, Scalar};
 474     match result.val {
 475         ConstValue::Scalar(Scalar::Raw { data: d, .. }) => match result.ty.kind {
 476             ty::Bool => Some(Constant::Bool(d == 1)),
 477             ty::Uint(_) | ty::Int(_) => Some(Constant::Int(d)),
 478             ty::Float(FloatTy::F32) => Some(Constant::F32(f32::from_bits(
 479                 d.try_into().expect("invalid f32 bit representation"),
 480             ))),
 481             ty::Float(FloatTy::F64) => Some(Constant::F64(f64::from_bits(
 482                 d.try_into().expect("invalid f64 bit representation"),
 483             ))),
 484             ty::RawPtr(type_and_mut) => {
 485                 if let ty::Uint(_) = type_and_mut.ty.kind {
 486                     return Some(Constant::RawPtr(d));
 487                 }
 488                 None
 489             },
 490             // FIXME: implement other conversions.
 491             _ => None,
 492         },
 493         ConstValue::Slice { data, start, end } => match result.ty.kind {
 494             ty::Ref(_, tam, _) => match tam.kind {
 495                 ty::Str => String::from_utf8(
 496                     data.inspect_with_undef_and_ptr_outside_interpreter(start..end)
 497                         .to_owned(),
 498                 )
 499                 .ok()
 500                 .map(Constant::Str),
 501                 _ => None,
 502             },
 503             _ => None,
 504         },
 505         // FIXME: implement other conversions.
 506         _ => None,
 507     }
 508 }