-#![allow(cast_possible_truncation)]
-#![allow(float_cmp)]
+// Copyright 2014-2018 The Rust Project Developers. See the COPYRIGHT
+// file at the top-level directory of this distribution.
+//
+// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
+// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
+// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
+// option. This file may not be copied, modified, or distributed
+// except according to those terms.
-use rustc::lint::LateContext;
-use rustc::hir::def::Def;
-use rustc::hir::*;
-use rustc::ty::{self, Ty, TyCtxt, Instance};
-use rustc::ty::subst::{Subst, Substs};
+
+#![allow(clippy::float_cmp)]
+
+use crate::rustc::lint::LateContext;
+use crate::rustc::{span_bug, bug};
+use crate::rustc::hir::def::Def;
+use crate::rustc::hir::*;
+use crate::rustc::ty::{self, Ty, TyCtxt, Instance};
+use crate::rustc::ty::subst::{Subst, Substs};
use std::cmp::Ordering::{self, Equal};
use std::cmp::PartialOrd;
+use std::convert::TryInto;
use std::hash::{Hash, Hasher};
use std::mem;
use std::rc::Rc;
-use syntax::ast::{FloatTy, LitKind};
-use syntax::ptr::P;
-use rustc::middle::const_val::ConstVal;
-use utils::{sext, unsext, clip};
-
-#[derive(Debug, Copy, Clone)]
-pub enum FloatWidth {
- F32,
- F64,
- Any,
-}
-
-impl From<FloatTy> for FloatWidth {
- fn from(ty: FloatTy) -> Self {
- match ty {
- FloatTy::F32 => FloatWidth::F32,
- FloatTy::F64 => FloatWidth::F64,
- }
- }
-}
+use crate::syntax::ast::{FloatTy, LitKind};
+use crate::syntax::ptr::P;
+use crate::utils::{sext, unsext, clip};
/// A `LitKind`-like enum to fold constant `Expr`s into.
#[derive(Debug, Clone)]
}
}
-impl PartialOrd for Constant {
- fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
- match (self, other) {
+impl Constant {
+ pub fn partial_cmp(tcx: TyCtxt<'_, '_, '_>, cmp_type: &ty::TyKind<'_>, left: &Self, right: &Self) -> Option<Ordering> {
+ match (left, right) {
(&Constant::Str(ref ls), &Constant::Str(ref rs)) => Some(ls.cmp(rs)),
(&Constant::Char(ref l), &Constant::Char(ref r)) => Some(l.cmp(r)),
- (&Constant::Int(l), &Constant::Int(r)) => Some(l.cmp(&r)),
+ (&Constant::Int(l), &Constant::Int(r)) => {
+ if let ty::Int(int_ty) = *cmp_type {
+ Some(sext(tcx, l, int_ty).cmp(&sext(tcx, r, int_ty)))
+ } else {
+ Some(l.cmp(&r))
+ }
+ },
(&Constant::F64(l), &Constant::F64(r)) => l.partial_cmp(&r),
(&Constant::F32(l), &Constant::F32(r)) => l.partial_cmp(&r),
(&Constant::Bool(ref l), &Constant::Bool(ref r)) => Some(l.cmp(r)),
- (&Constant::Tuple(ref l), &Constant::Tuple(ref r)) | (&Constant::Vec(ref l), &Constant::Vec(ref r)) => {
- l.partial_cmp(r)
- },
- (&Constant::Repeat(ref lv, ref ls), &Constant::Repeat(ref rv, ref rs)) => match lv.partial_cmp(rv) {
- Some(Equal) => Some(ls.cmp(rs)),
- x => x,
+ (&Constant::Tuple(ref l), &Constant::Tuple(ref r)) | (&Constant::Vec(ref l), &Constant::Vec(ref r)) => l
+ .iter()
+ .zip(r.iter())
+ .map(|(li, ri)| Self::partial_cmp(tcx, cmp_type, li, ri))
+ .find(|r| r.map_or(true, |o| o != Ordering::Equal))
+ .unwrap_or_else(|| Some(l.len().cmp(&r.len()))),
+ (&Constant::Repeat(ref lv, ref ls), &Constant::Repeat(ref rv, ref rs)) => {
+ match Self::partial_cmp(tcx, cmp_type, lv, rv) {
+ Some(Equal) => Some(ls.cmp(rs)),
+ x => x,
+ }
},
_ => None, // TODO: Are there any useful inter-type orderings?
}
/// parse a `LitKind` to a `Constant`
pub fn lit_to_constant<'tcx>(lit: &LitKind, ty: Ty<'tcx>) -> Constant {
- use syntax::ast::*;
+ use crate::syntax::ast::*;
match *lit {
LitKind::Str(ref is, _) => Constant::Str(is.to_string()),
LitKind::Int(n, _) => Constant::Int(n),
LitKind::Float(ref is, _) |
LitKind::FloatUnsuffixed(ref is) => match ty.sty {
- ty::TyFloat(FloatTy::F32) => Constant::F32(is.as_str().parse().unwrap()),
- ty::TyFloat(FloatTy::F64) => Constant::F64(is.as_str().parse().unwrap()),
+ ty::Float(FloatTy::F32) => Constant::F32(is.as_str().parse().unwrap()),
+ ty::Float(FloatTy::F64) => Constant::F64(is.as_str().parse().unwrap()),
_ => bug!(),
},
LitKind::Bool(b) => Constant::Bool(b),
}
}
-pub fn constant(lcx: &LateContext, e: &Expr) -> Option<(Constant, bool)> {
+pub fn constant<'c, 'cc>(lcx: &LateContext<'c, 'cc>, tables: &'c ty::TypeckTables<'cc>, e: &Expr) -> Option<(Constant, bool)> {
let mut cx = ConstEvalLateContext {
tcx: lcx.tcx,
- tables: lcx.tables,
+ tables,
param_env: lcx.param_env,
needed_resolution: false,
substs: lcx.tcx.intern_substs(&[]),
cx.expr(e).map(|cst| (cst, cx.needed_resolution))
}
-pub fn constant_simple(lcx: &LateContext, e: &Expr) -> Option<Constant> {
- constant(lcx, e).and_then(|(cst, res)| if res { None } else { Some(cst) })
+pub fn constant_simple<'c, 'cc>(lcx: &LateContext<'c, 'cc>, tables: &'c ty::TypeckTables<'cc>, e: &Expr) -> Option<Constant> {
+ constant(lcx, tables, e).and_then(|(cst, res)| if res { None } else { Some(cst) })
}
/// Creates a `ConstEvalLateContext` from the given `LateContext` and `TypeckTables`
-pub fn constant_context<'c, 'cc>(lcx: &LateContext<'c, 'cc>, tables: &'cc ty::TypeckTables<'cc>) -> ConstEvalLateContext<'c, 'cc> {
+pub fn constant_context<'c, 'cc>(lcx: &LateContext<'c, 'cc>, tables: &'c ty::TypeckTables<'cc>) -> ConstEvalLateContext<'c, 'cc> {
ConstEvalLateContext {
tcx: lcx.tcx,
tables,
/// simple constant folding: Insert an expression, get a constant or none.
pub fn expr(&mut self, e: &Expr) -> Option<Constant> {
match e.node {
- ExprPath(ref qpath) => self.fetch_path(qpath, e.hir_id),
- ExprBlock(ref block) => self.block(block),
- ExprIf(ref cond, ref then, ref otherwise) => self.ifthenelse(cond, then, otherwise),
- ExprLit(ref lit) => Some(lit_to_constant(&lit.node, self.tables.expr_ty(e))),
- ExprArray(ref vec) => self.multi(vec).map(Constant::Vec),
- ExprTup(ref tup) => self.multi(tup).map(Constant::Tuple),
- ExprRepeat(ref value, _) => {
+ ExprKind::Path(ref qpath) => self.fetch_path(qpath, e.hir_id),
+ ExprKind::Block(ref block, _) => self.block(block),
+ ExprKind::If(ref cond, ref then, ref otherwise) => self.ifthenelse(cond, then, otherwise),
+ ExprKind::Lit(ref lit) => Some(lit_to_constant(&lit.node, self.tables.expr_ty(e))),
+ ExprKind::Array(ref vec) => self.multi(vec).map(Constant::Vec),
+ ExprKind::Tup(ref tup) => self.multi(tup).map(Constant::Tuple),
+ ExprKind::Repeat(ref value, _) => {
let n = match self.tables.expr_ty(e).sty {
- ty::TyArray(_, n) => n.val.to_raw_bits().expect("array length"),
+ ty::Array(_, n) => n.assert_usize(self.tcx).expect("array length"),
_ => span_bug!(e.span, "typeck error"),
};
- self.expr(value).map(|v| Constant::Repeat(Box::new(v), n as u64))
+ self.expr(value).map(|v| Constant::Repeat(Box::new(v), n))
},
- ExprUnary(op, ref operand) => self.expr(operand).and_then(|o| match op {
+ ExprKind::Unary(op, ref operand) => self.expr(operand).and_then(|o| match op {
UnNot => self.constant_not(&o, self.tables.expr_ty(e)),
UnNeg => self.constant_negate(&o, self.tables.expr_ty(e)),
UnDeref => Some(o),
}),
- ExprBinary(op, ref left, ref right) => self.binop(op, left, right),
+ ExprKind::Binary(op, ref left, ref right) => self.binop(op, left, right),
// TODO: add other expressions
_ => None,
}
}
- fn constant_not(&self, o: &Constant, ty: ty::Ty) -> Option<Constant> {
+ #[allow(clippy::cast_possible_wrap)]
+ fn constant_not(&self, o: &Constant, ty: ty::Ty<'_>) -> Option<Constant> {
use self::Constant::*;
match *o {
Bool(b) => Some(Bool(!b)),
Int(value) => {
- let mut value = !value;
+ let value = !value;
match ty.sty {
- ty::TyInt(ity) => Some(Int(unsext(self.tcx, value as i128, ity))),
- ty::TyUint(ity) => Some(Int(clip(self.tcx, value, ity))),
+ ty::Int(ity) => Some(Int(unsext(self.tcx, value as i128, ity))),
+ ty::Uint(ity) => Some(Int(clip(self.tcx, value, ity))),
_ => None,
}
},
}
}
- fn constant_negate(&self, o: &Constant, ty: ty::Ty) -> Option<Constant> {
+ fn constant_negate(&self, o: &Constant, ty: ty::Ty<'_>) -> Option<Constant> {
use self::Constant::*;
match *o {
Int(value) => {
let ity = match ty.sty {
- ty::TyInt(ity) => ity,
+ ty::Int(ity) => ity,
_ => return None,
};
// sign extend
.collect::<Option<_>>()
}
- /// lookup a possibly constant expression from a ExprPath
+ /// lookup a possibly constant expression from a ExprKind::Path
fn fetch_path(&mut self, qpath: &QPath, id: HirId) -> Option<Constant> {
+ use crate::rustc::mir::interpret::GlobalId;
+
let def = self.tables.qpath_def(qpath, id);
match def {
Def::Const(def_id) | Def::AssociatedConst(def_id) => {
instance,
promoted: None,
};
- use rustc::mir::interpret::GlobalId;
+
let result = self.tcx.const_eval(self.param_env.and(gid)).ok()?;
let ret = miri_to_const(self.tcx, result);
if ret.is_some() {
match (l, r) {
(Constant::Int(l), Some(Constant::Int(r))) => {
match self.tables.expr_ty(left).sty {
- ty::TyInt(ity) => {
+ ty::Int(ity) => {
let l = sext(self.tcx, l, ity);
let r = sext(self.tcx, r, ity);
let zext = |n: i128| Constant::Int(unsext(self.tcx, n, ity));
match op.node {
- BiAdd => l.checked_add(r).map(zext),
- BiSub => l.checked_sub(r).map(zext),
- BiMul => l.checked_mul(r).map(zext),
- BiDiv if r != 0 => l.checked_div(r).map(zext),
- BiRem if r != 0 => l.checked_rem(r).map(zext),
- BiShr => l.checked_shr(r as u128 as u32).map(zext),
- BiShl => l.checked_shl(r as u128 as u32).map(zext),
- BiBitXor => Some(zext(l ^ r)),
- BiBitOr => Some(zext(l | r)),
- BiBitAnd => Some(zext(l & r)),
- BiEq => Some(Constant::Bool(l == r)),
- BiNe => Some(Constant::Bool(l != r)),
- BiLt => Some(Constant::Bool(l < r)),
- BiLe => Some(Constant::Bool(l <= r)),
- BiGe => Some(Constant::Bool(l >= r)),
- BiGt => Some(Constant::Bool(l > r)),
+ BinOpKind::Add => l.checked_add(r).map(zext),
+ BinOpKind::Sub => l.checked_sub(r).map(zext),
+ BinOpKind::Mul => l.checked_mul(r).map(zext),
+ BinOpKind::Div if r != 0 => l.checked_div(r).map(zext),
+ BinOpKind::Rem if r != 0 => l.checked_rem(r).map(zext),
+ BinOpKind::Shr => l.checked_shr(
+ r.try_into().expect("invalid shift")
+ ).map(zext),
+ BinOpKind::Shl => l.checked_shl(
+ r.try_into().expect("invalid shift")
+ ).map(zext),
+ BinOpKind::BitXor => Some(zext(l ^ r)),
+ BinOpKind::BitOr => Some(zext(l | r)),
+ BinOpKind::BitAnd => Some(zext(l & r)),
+ BinOpKind::Eq => Some(Constant::Bool(l == r)),
+ BinOpKind::Ne => Some(Constant::Bool(l != r)),
+ BinOpKind::Lt => Some(Constant::Bool(l < r)),
+ BinOpKind::Le => Some(Constant::Bool(l <= r)),
+ BinOpKind::Ge => Some(Constant::Bool(l >= r)),
+ BinOpKind::Gt => Some(Constant::Bool(l > r)),
_ => None,
}
}
- ty::TyUint(_) => {
+ ty::Uint(_) => {
match op.node {
- BiAdd => l.checked_add(r).map(Constant::Int),
- BiSub => l.checked_sub(r).map(Constant::Int),
- BiMul => l.checked_mul(r).map(Constant::Int),
- BiDiv => l.checked_div(r).map(Constant::Int),
- BiRem => l.checked_rem(r).map(Constant::Int),
- BiShr => l.checked_shr(r as u32).map(Constant::Int),
- BiShl => l.checked_shl(r as u32).map(Constant::Int),
- BiBitXor => Some(Constant::Int(l ^ r)),
- BiBitOr => Some(Constant::Int(l | r)),
- BiBitAnd => Some(Constant::Int(l & r)),
- BiEq => Some(Constant::Bool(l == r)),
- BiNe => Some(Constant::Bool(l != r)),
- BiLt => Some(Constant::Bool(l < r)),
- BiLe => Some(Constant::Bool(l <= r)),
- BiGe => Some(Constant::Bool(l >= r)),
- BiGt => Some(Constant::Bool(l > r)),
+ BinOpKind::Add => l.checked_add(r).map(Constant::Int),
+ BinOpKind::Sub => l.checked_sub(r).map(Constant::Int),
+ BinOpKind::Mul => l.checked_mul(r).map(Constant::Int),
+ BinOpKind::Div => l.checked_div(r).map(Constant::Int),
+ BinOpKind::Rem => l.checked_rem(r).map(Constant::Int),
+ BinOpKind::Shr => l.checked_shr(
+ r.try_into().expect("shift too large")
+ ).map(Constant::Int),
+ BinOpKind::Shl => l.checked_shl(
+ r.try_into().expect("shift too large")
+ ).map(Constant::Int),
+ BinOpKind::BitXor => Some(Constant::Int(l ^ r)),
+ BinOpKind::BitOr => Some(Constant::Int(l | r)),
+ BinOpKind::BitAnd => Some(Constant::Int(l & r)),
+ BinOpKind::Eq => Some(Constant::Bool(l == r)),
+ BinOpKind::Ne => Some(Constant::Bool(l != r)),
+ BinOpKind::Lt => Some(Constant::Bool(l < r)),
+ BinOpKind::Le => Some(Constant::Bool(l <= r)),
+ BinOpKind::Ge => Some(Constant::Bool(l >= r)),
+ BinOpKind::Gt => Some(Constant::Bool(l > r)),
_ => None,
}
},
}
},
(Constant::F32(l), Some(Constant::F32(r))) => match op.node {
- BiAdd => Some(Constant::F32(l + r)),
- BiSub => Some(Constant::F32(l - r)),
- BiMul => Some(Constant::F32(l * r)),
- BiDiv => Some(Constant::F32(l / r)),
- BiRem => Some(Constant::F32(l % r)),
- BiEq => Some(Constant::Bool(l == r)),
- BiNe => Some(Constant::Bool(l != r)),
- BiLt => Some(Constant::Bool(l < r)),
- BiLe => Some(Constant::Bool(l <= r)),
- BiGe => Some(Constant::Bool(l >= r)),
- BiGt => Some(Constant::Bool(l > r)),
+ BinOpKind::Add => Some(Constant::F32(l + r)),
+ BinOpKind::Sub => Some(Constant::F32(l - r)),
+ BinOpKind::Mul => Some(Constant::F32(l * r)),
+ BinOpKind::Div => Some(Constant::F32(l / r)),
+ BinOpKind::Rem => Some(Constant::F32(l % r)),
+ BinOpKind::Eq => Some(Constant::Bool(l == r)),
+ BinOpKind::Ne => Some(Constant::Bool(l != r)),
+ BinOpKind::Lt => Some(Constant::Bool(l < r)),
+ BinOpKind::Le => Some(Constant::Bool(l <= r)),
+ BinOpKind::Ge => Some(Constant::Bool(l >= r)),
+ BinOpKind::Gt => Some(Constant::Bool(l > r)),
_ => None,
},
(Constant::F64(l), Some(Constant::F64(r))) => match op.node {
- BiAdd => Some(Constant::F64(l + r)),
- BiSub => Some(Constant::F64(l - r)),
- BiMul => Some(Constant::F64(l * r)),
- BiDiv => Some(Constant::F64(l / r)),
- BiRem => Some(Constant::F64(l % r)),
- BiEq => Some(Constant::Bool(l == r)),
- BiNe => Some(Constant::Bool(l != r)),
- BiLt => Some(Constant::Bool(l < r)),
- BiLe => Some(Constant::Bool(l <= r)),
- BiGe => Some(Constant::Bool(l >= r)),
- BiGt => Some(Constant::Bool(l > r)),
+ BinOpKind::Add => Some(Constant::F64(l + r)),
+ BinOpKind::Sub => Some(Constant::F64(l - r)),
+ BinOpKind::Mul => Some(Constant::F64(l * r)),
+ BinOpKind::Div => Some(Constant::F64(l / r)),
+ BinOpKind::Rem => Some(Constant::F64(l % r)),
+ BinOpKind::Eq => Some(Constant::Bool(l == r)),
+ BinOpKind::Ne => Some(Constant::Bool(l != r)),
+ BinOpKind::Lt => Some(Constant::Bool(l < r)),
+ BinOpKind::Le => Some(Constant::Bool(l <= r)),
+ BinOpKind::Ge => Some(Constant::Bool(l >= r)),
+ BinOpKind::Gt => Some(Constant::Bool(l > r)),
_ => None,
},
(l, r) => match (op.node, l, r) {
- (BiAnd, Constant::Bool(false), _) => Some(Constant::Bool(false)),
- (BiOr, Constant::Bool(true), _) => Some(Constant::Bool(true)),
- (BiAnd, Constant::Bool(true), Some(r)) | (BiOr, Constant::Bool(false), Some(r)) => Some(r),
- (BiBitXor, Constant::Bool(l), Some(Constant::Bool(r))) => Some(Constant::Bool(l ^ r)),
- (BiBitAnd, Constant::Bool(l), Some(Constant::Bool(r))) => Some(Constant::Bool(l & r)),
- (BiBitOr, Constant::Bool(l), Some(Constant::Bool(r))) => Some(Constant::Bool(l | r)),
+ (BinOpKind::And, Constant::Bool(false), _) => Some(Constant::Bool(false)),
+ (BinOpKind::Or, Constant::Bool(true), _) => Some(Constant::Bool(true)),
+ (BinOpKind::And, Constant::Bool(true), Some(r)) | (BinOpKind::Or, Constant::Bool(false), Some(r)) => Some(r),
+ (BinOpKind::BitXor, Constant::Bool(l), Some(Constant::Bool(r))) => Some(Constant::Bool(l ^ r)),
+ (BinOpKind::BitAnd, Constant::Bool(l), Some(Constant::Bool(r))) => Some(Constant::Bool(l & r)),
+ (BinOpKind::BitOr, Constant::Bool(l), Some(Constant::Bool(r))) => Some(Constant::Bool(l | r)),
_ => None,
},
}
}
pub fn miri_to_const<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>, result: &ty::Const<'tcx>) -> Option<Constant> {
- use rustc::mir::interpret::{Value, PrimVal};
+ use crate::rustc::mir::interpret::{Scalar, ConstValue};
match result.val {
- ConstVal::Value(Value::ByVal(PrimVal::Bytes(b))) => match result.ty.sty {
- ty::TyBool => Some(Constant::Bool(b == 1)),
- ty::TyUint(_) | ty::TyInt(_) => Some(Constant::Int(b)),
- ty::TyFloat(FloatTy::F32) => Some(Constant::F32(f32::from_bits(b as u32))),
- ty::TyFloat(FloatTy::F64) => Some(Constant::F64(f64::from_bits(b as u64))),
+ ConstValue::Scalar(Scalar::Bits{ bits: b, ..}) => match result.ty.sty {
+ ty::Bool => Some(Constant::Bool(b == 1)),
+ ty::Uint(_) | ty::Int(_) => Some(Constant::Int(b)),
+ ty::Float(FloatTy::F32) => Some(Constant::F32(f32::from_bits(
+ b.try_into().expect("invalid f32 bit representation")
+ ))),
+ ty::Float(FloatTy::F64) => Some(Constant::F64(f64::from_bits(
+ b.try_into().expect("invalid f64 bit representation")
+ ))),
// FIXME: implement other conversion
_ => None,
},
- ConstVal::Value(Value::ByValPair(PrimVal::Ptr(ptr), PrimVal::Bytes(n))) => match result.ty.sty {
- ty::TyRef(_, tam) => match tam.ty.sty {
- ty::TyStr => {
+ ConstValue::ScalarPair(Scalar::Ptr(ptr),
+ Scalar::Bits { bits: n, .. }) => match result.ty.sty {
+ ty::Ref(_, tam, _) => match tam.sty {
+ ty::Str => {
let alloc = tcx
- .interpret_interner
- .get_alloc(ptr.alloc_id)
- .unwrap();
- let offset = ptr.offset as usize;
+ .alloc_map
+ .lock()
+ .unwrap_memory(ptr.alloc_id);
+ let offset = ptr.offset.bytes().try_into().expect("too-large pointer offset");
let n = n as usize;
String::from_utf8(alloc.bytes[offset..(offset + n)].to_owned()).ok().map(Constant::Str)
},
projects / rust.git / blobdiff