rust-clippy/clippy_lints/src/consts.rs

489 lines
20 KiB
Rust
Raw Normal View History

2018-08-01 20:48:41 +00:00
#![allow(clippy::float_cmp)]
2015-08-26 23:10:01 +00:00
use crate::utils::{clip, get_def_path, sext, unsext};
use if_chain::if_chain;
use rustc::hir::def::Def;
use rustc::hir::*;
use rustc::lint::LateContext;
use rustc::ty::subst::{Subst, Substs};
use rustc::ty::{self, Instance, Ty, TyCtxt};
use rustc::{bug, span_bug};
2019-01-03 17:17:43 +00:00
use rustc_data_structures::sync::Lrc;
2016-03-16 11:38:26 +00:00
use std::cmp::Ordering::{self, Equal};
use std::cmp::PartialOrd;
2019-01-28 10:32:41 +00:00
use std::convert::TryFrom;
2018-10-09 04:40:21 +00:00
use std::convert::TryInto;
use std::hash::{Hash, Hasher};
use syntax::ast::{FloatTy, LitKind};
use syntax::ptr::P;
use syntax_pos::symbol::Symbol;
2016-03-19 16:48:29 +00:00
/// A `LitKind`-like enum to fold constant `Expr`s into.
#[derive(Debug, Clone)]
pub enum Constant {
2015-08-13 07:25:44 +00:00
/// a String "abc"
2018-03-13 10:38:11 +00:00
Str(String),
2015-08-13 07:25:44 +00:00
/// a Binary String b"abc"
2019-01-03 17:17:43 +00:00
Binary(Lrc<Vec<u8>>),
2015-08-13 07:25:44 +00:00
/// a single char 'a'
2016-02-01 11:51:33 +00:00
Char(char),
2018-03-13 10:38:11 +00:00
/// an integer's bit representation
Int(u128),
/// an f32
F32(f32),
/// an f64
F64(f64),
2015-08-13 07:25:44 +00:00
/// true or false
2016-02-01 11:51:33 +00:00
Bool(bool),
2015-08-13 07:25:44 +00:00
/// an array of constants
2016-02-01 11:51:33 +00:00
Vec(Vec<Constant>),
2015-08-13 07:25:44 +00:00
/// also an array, but with only one constant, repeated N times
2017-09-13 13:34:04 +00:00
Repeat(Box<Constant>, u64),
2015-08-13 07:25:44 +00:00
/// a tuple of constants
2016-02-01 11:51:33 +00:00
Tuple(Vec<Constant>),
/// a literal with syntax error
Err(Symbol),
2015-08-12 11:49:28 +00:00
}
impl PartialEq for Constant {
2017-08-21 11:32:12 +00:00
fn eq(&self, other: &Self) -> bool {
match (self, other) {
2018-03-13 10:38:11 +00:00
(&Constant::Str(ref ls), &Constant::Str(ref rs)) => ls == rs,
2016-02-01 11:51:33 +00:00
(&Constant::Binary(ref l), &Constant::Binary(ref r)) => l == r,
(&Constant::Char(l), &Constant::Char(r)) => l == r,
2018-03-13 10:38:11 +00:00
(&Constant::Int(l), &Constant::Int(r)) => l == r,
(&Constant::F64(l), &Constant::F64(r)) => {
// we want `Fw32 == FwAny` and `FwAny == Fw64`, by transitivity we must have
// `Fw32 == Fw64` so dont compare them
2018-12-28 23:40:48 +00:00
// to_bits is required to catch non-matching 0.0, -0.0, and NaNs
l.to_bits() == r.to_bits()
2016-12-20 17:21:30 +00:00
},
2018-03-13 10:38:11 +00:00
(&Constant::F32(l), &Constant::F32(r)) => {
// we want `Fw32 == FwAny` and `FwAny == Fw64`, by transitivity we must have
// `Fw32 == Fw64` so dont compare them
2018-12-28 23:40:48 +00:00
// to_bits is required to catch non-matching 0.0, -0.0, and NaNs
f64::from(l).to_bits() == f64::from(r).to_bits()
2016-12-20 17:21:30 +00:00
},
2016-02-01 11:51:33 +00:00
(&Constant::Bool(l), &Constant::Bool(r)) => l == r,
2018-11-27 20:14:15 +00:00
(&Constant::Vec(ref l), &Constant::Vec(ref r)) | (&Constant::Tuple(ref l), &Constant::Tuple(ref r)) => {
l == r
},
2016-02-01 11:51:33 +00:00
(&Constant::Repeat(ref lv, ref ls), &Constant::Repeat(ref rv, ref rs)) => ls == rs && lv == rv,
2017-09-05 09:33:04 +00:00
_ => false, // TODO: Are there inter-type equalities?
}
}
}
impl Hash for Constant {
2016-02-24 16:38:57 +00:00
fn hash<H>(&self, state: &mut H)
2017-08-09 07:30:56 +00:00
where
H: Hasher,
2016-02-24 16:38:57 +00:00
{
match *self {
2018-03-13 10:38:11 +00:00
Constant::Str(ref s) => {
s.hash(state);
2016-12-20 17:21:30 +00:00
},
Constant::Binary(ref b) => {
b.hash(state);
2016-12-20 17:21:30 +00:00
},
Constant::Char(c) => {
c.hash(state);
2016-12-20 17:21:30 +00:00
},
2016-03-16 11:38:26 +00:00
Constant::Int(i) => {
2018-03-13 10:38:11 +00:00
i.hash(state);
2016-12-20 17:21:30 +00:00
},
2018-03-13 10:38:11 +00:00
Constant::F32(f) => {
2018-12-28 23:40:48 +00:00
f64::from(f).to_bits().hash(state);
2018-03-13 10:38:11 +00:00
},
Constant::F64(f) => {
2018-12-28 23:40:48 +00:00
f.to_bits().hash(state);
2016-12-20 17:21:30 +00:00
},
Constant::Bool(b) => {
b.hash(state);
2016-12-20 17:21:30 +00:00
},
2017-09-05 09:33:04 +00:00
Constant::Vec(ref v) | Constant::Tuple(ref v) => {
v.hash(state);
2016-12-20 17:21:30 +00:00
},
Constant::Repeat(ref c, l) => {
c.hash(state);
l.hash(state);
2016-12-20 17:21:30 +00:00
},
Constant::Err(ref s) => {
s.hash(state);
},
}
}
}
2018-06-19 05:37:09 +00:00
impl Constant {
2018-12-04 23:14:44 +00:00
pub fn partial_cmp(tcx: TyCtxt<'_, '_, '_>, cmp_type: ty::Ty<'_>, left: &Self, right: &Self) -> Option<Ordering> {
2018-06-19 05:37:09 +00:00
match (left, right) {
2018-03-13 10:38:11 +00:00
(&Constant::Str(ref ls), &Constant::Str(ref rs)) => Some(ls.cmp(rs)),
2016-02-01 11:51:33 +00:00
(&Constant::Char(ref l), &Constant::Char(ref r)) => Some(l.cmp(r)),
2018-06-19 05:37:09 +00:00
(&Constant::Int(l), &Constant::Int(r)) => {
2018-12-04 23:14:44 +00:00
if let ty::Int(int_ty) = cmp_type.sty {
2018-06-19 05:37:09 +00:00
Some(sext(tcx, l, int_ty).cmp(&sext(tcx, r, int_ty)))
} else {
Some(l.cmp(&r))
}
},
2018-03-13 10:38:11 +00:00
(&Constant::F64(l), &Constant::F64(r)) => l.partial_cmp(&r),
(&Constant::F32(l), &Constant::F32(r)) => l.partial_cmp(&r),
2016-02-01 11:51:33 +00:00
(&Constant::Bool(ref l), &Constant::Bool(ref r)) => Some(l.cmp(r)),
2018-06-19 05:37:09 +00:00
(&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))
2018-06-19 05:37:09 +00:00
.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) {
2018-06-19 05:37:09 +00:00
Some(Equal) => Some(ls.cmp(rs)),
x => x,
}
2016-12-20 17:21:30 +00:00
},
2017-09-05 09:33:04 +00:00
_ => None, // TODO: Are there any useful inter-type orderings?
2016-01-04 04:26:12 +00:00
}
}
}
/// parse a `LitKind` to a `Constant`
pub fn lit_to_constant<'tcx>(lit: &LitKind, ty: Ty<'tcx>) -> Constant {
use syntax::ast::*;
2017-03-01 17:46:18 +00:00
2015-08-18 12:18:36 +00:00
match *lit {
2018-03-13 10:38:11 +00:00
LitKind::Str(ref is, _) => Constant::Str(is.to_string()),
LitKind::Byte(b) => Constant::Int(u128::from(b)),
2019-01-03 17:17:43 +00:00
LitKind::ByteStr(ref s) => Constant::Binary(Lrc::clone(s)),
2016-02-12 17:35:44 +00:00
LitKind::Char(c) => Constant::Char(c),
2018-03-13 10:38:11 +00:00
LitKind::Int(n, _) => Constant::Int(n),
2018-11-27 20:14:15 +00:00
LitKind::Float(ref is, _) | LitKind::FloatUnsuffixed(ref is) => match ty.sty {
ty::Float(FloatTy::F32) => Constant::F32(is.as_str().parse().unwrap()),
ty::Float(FloatTy::F64) => Constant::F64(is.as_str().parse().unwrap()),
2017-09-05 09:33:04 +00:00
_ => bug!(),
2017-03-05 09:27:20 +00:00
},
2016-02-12 17:35:44 +00:00
LitKind::Bool(b) => Constant::Bool(b),
LitKind::Err(s) => Constant::Err(s),
2015-08-12 11:49:28 +00:00
}
}
2018-11-27 20:14:15 +00:00
pub fn constant<'c, 'cc>(
lcx: &LateContext<'c, 'cc>,
tables: &'c ty::TypeckTables<'cc>,
e: &Expr,
) -> Option<(Constant, bool)> {
2016-01-04 04:26:12 +00:00
let mut cx = ConstEvalLateContext {
2017-03-01 17:46:18 +00:00
tcx: lcx.tcx,
2018-05-13 11:16:31 +00:00
tables,
2017-07-31 10:37:38 +00:00
param_env: lcx.param_env,
2016-01-04 04:26:12 +00:00
needed_resolution: false,
substs: lcx.tcx.intern_substs(&[]),
2016-01-04 04:26:12 +00:00
};
cx.expr(e).map(|cst| (cst, cx.needed_resolution))
2015-08-13 07:25:44 +00:00
}
2018-11-27 20:14:15 +00:00
pub fn constant_simple<'c, 'cc>(
lcx: &LateContext<'c, 'cc>,
tables: &'c ty::TypeckTables<'cc>,
e: &Expr,
) -> Option<Constant> {
2018-05-13 11:16:31 +00:00
constant(lcx, tables, e).and_then(|(cst, res)| if res { None } else { Some(cst) })
}
/// Creates a `ConstEvalLateContext` from the given `LateContext` and `TypeckTables`
2018-11-27 20:14:15 +00:00
pub fn constant_context<'c, 'cc>(
lcx: &LateContext<'c, 'cc>,
tables: &'c ty::TypeckTables<'cc>,
) -> ConstEvalLateContext<'c, 'cc> {
ConstEvalLateContext {
tcx: lcx.tcx,
tables,
param_env: lcx.param_env,
needed_resolution: false,
substs: lcx.tcx.intern_substs(&[]),
}
}
pub struct ConstEvalLateContext<'a, 'tcx: 'a> {
2017-03-01 17:46:18 +00:00
tcx: TyCtxt<'a, 'tcx, 'tcx>,
tables: &'a ty::TypeckTables<'tcx>,
2017-07-31 10:37:38 +00:00
param_env: ty::ParamEnv<'tcx>,
2016-01-04 04:26:12 +00:00
needed_resolution: bool,
substs: &'tcx Substs<'tcx>,
}
impl<'c, 'cc> ConstEvalLateContext<'c, 'cc> {
/// simple constant folding: Insert an expression, get a constant or none.
pub fn expr(&mut self, e: &Expr) -> Option<Constant> {
2015-08-17 17:55:59 +00:00
match e.node {
2018-07-12 07:30:57 +00:00
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, _) => {
2017-03-03 13:46:33 +00:00
let n = match self.tables.expr_ty(e).sty {
ty::Array(_, n) => n.assert_usize(self.tcx).expect("array length"),
2017-03-03 13:46:33 +00:00
_ => span_bug!(e.span, "typeck error"),
};
self.expr(value).map(|v| Constant::Repeat(Box::new(v), n))
2016-12-20 17:21:30 +00:00
},
2018-07-12 07:30:57 +00:00
ExprKind::Unary(op, ref operand) => self.expr(operand).and_then(|o| match op {
2018-03-13 10:38:11 +00:00
UnNot => self.constant_not(&o, self.tables.expr_ty(e)),
UnNeg => self.constant_negate(&o, self.tables.expr_ty(e)),
2017-09-05 09:33:04 +00:00
UnDeref => Some(o),
}),
2018-07-12 07:30:57 +00:00
ExprKind::Binary(op, ref left, ref right) => self.binop(op, left, right),
ExprKind::Call(ref callee, ref args) => {
// We only handle a few const functions for now
if_chain! {
if args.is_empty();
if let ExprKind::Path(qpath) = &callee.node;
let def = self.tables.qpath_def(qpath, callee.hir_id);
if let Some(def_id) = def.opt_def_id();
let def_path = get_def_path(self.tcx, def_id);
if let &["core", "num", impl_ty, "max_value"] = &def_path[..];
then {
let value = match impl_ty {
"<impl i8>" => i8::max_value() as u128,
"<impl i16>" => i16::max_value() as u128,
"<impl i32>" => i32::max_value() as u128,
"<impl i64>" => i64::max_value() as u128,
"<impl i128>" => i128::max_value() as u128,
_ => return None,
};
Some(Constant::Int(value))
}
else {
None
}
}
},
2016-01-04 04:26:12 +00:00
// TODO: add other expressions
_ => None,
}
}
#[allow(clippy::cast_possible_wrap)]
2018-07-23 11:01:12 +00:00
fn constant_not(&self, o: &Constant, ty: ty::Ty<'_>) -> Option<Constant> {
2018-03-13 10:38:11 +00:00
use self::Constant::*;
match *o {
Bool(b) => Some(Bool(!b)),
Int(value) => {
2018-07-31 05:45:05 +00:00
let value = !value;
2018-03-13 10:38:11 +00:00
match ty.sty {
ty::Int(ity) => Some(Int(unsext(self.tcx, value as i128, ity))),
ty::Uint(ity) => Some(Int(clip(self.tcx, value, ity))),
2018-03-13 10:38:11 +00:00
_ => None,
}
},
_ => None,
}
}
2018-07-23 11:01:12 +00:00
fn constant_negate(&self, o: &Constant, ty: ty::Ty<'_>) -> Option<Constant> {
2018-03-13 10:38:11 +00:00
use self::Constant::*;
match *o {
2018-03-13 10:38:11 +00:00
Int(value) => {
let ity = match ty.sty {
ty::Int(ity) => ity,
2018-03-13 10:38:11 +00:00
_ => return None,
};
// sign extend
let value = sext(self.tcx, value, ity);
let value = value.checked_neg()?;
// clear unused bits
Some(Int(unsext(self.tcx, value, ity)))
},
F32(f) => Some(F32(-f)),
F64(f) => Some(F64(-f)),
_ => None,
}
}
2015-08-18 10:26:01 +00:00
/// create `Some(Vec![..])` of all constants, unless there is any
/// non-constant part
fn multi(&mut self, vec: &[Expr]) -> Option<Vec<Constant>> {
2018-11-27 20:14:15 +00:00
vec.iter().map(|elem| self.expr(elem)).collect::<Option<_>>()
}
2018-07-12 07:30:57 +00:00
/// lookup a possibly constant expression from a ExprKind::Path
2017-08-15 09:10:49 +00:00
fn fetch_path(&mut self, qpath: &QPath, id: HirId) -> Option<Constant> {
use rustc::mir::interpret::GlobalId;
2017-03-01 17:46:18 +00:00
let def = self.tables.qpath_def(qpath, id);
match def {
2017-09-05 09:33:04 +00:00
Def::Const(def_id) | Def::AssociatedConst(def_id) => {
let substs = self.tables.node_substs(id);
let substs = if self.substs.is_empty() {
substs
} else {
substs.subst(self.tcx, self.substs)
};
2018-03-13 10:38:11 +00:00
let instance = Instance::resolve(self.tcx, self.param_env, def_id, substs)?;
let gid = GlobalId {
instance,
promoted: None,
};
2018-11-17 12:47:27 +00:00
2018-03-13 10:38:11 +00:00
let result = self.tcx.const_eval(self.param_env.and(gid)).ok()?;
let ret = miri_to_const(self.tcx, &result);
2018-03-13 10:38:11 +00:00
if ret.is_some() {
self.needed_resolution = true;
2017-03-01 17:46:18 +00:00
}
2018-03-13 10:38:11 +00:00
return ret;
2017-03-01 17:46:18 +00:00
},
_ => {},
}
None
}
/// A block can only yield a constant if it only has one constant expression
fn block(&mut self, block: &Block) -> Option<Constant> {
if block.stmts.is_empty() {
2016-08-01 14:59:14 +00:00
block.expr.as_ref().and_then(|b| self.expr(b))
2016-01-04 04:26:12 +00:00
} else {
None
}
}
fn ifthenelse(&mut self, cond: &Expr, then: &P<Expr>, otherwise: &Option<P<Expr>>) -> Option<Constant> {
2016-02-01 11:51:33 +00:00
if let Some(Constant::Bool(b)) = self.expr(cond) {
if b {
self.expr(&**then)
} else {
otherwise.as_ref().and_then(|expr| self.expr(expr))
}
2016-01-04 04:26:12 +00:00
} else {
None
}
}
fn binop(&mut self, op: BinOp, left: &Expr, right: &Expr) -> Option<Constant> {
2018-03-13 10:38:11 +00:00
let l = self.expr(left)?;
2016-03-16 11:38:26 +00:00
let r = self.expr(right);
2018-03-13 10:38:11 +00:00
match (l, r) {
2018-11-27 20:14:15 +00:00
(Constant::Int(l), Some(Constant::Int(r))) => match self.tables.expr_ty(left).sty {
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 {
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,
2018-03-13 10:38:11 +00:00
}
2018-11-27 20:14:15 +00:00
},
ty::Uint(_) => match op.node {
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)),
2018-03-13 10:38:11 +00:00
_ => None,
2018-11-27 20:14:15 +00:00
},
_ => None,
2018-03-13 10:38:11 +00:00
},
(Constant::F32(l), Some(Constant::F32(r))) => match op.node {
2018-07-12 07:50:09 +00:00
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)),
2018-03-13 10:38:11 +00:00
_ => None,
},
(Constant::F64(l), Some(Constant::F64(r))) => match op.node {
2018-07-12 07:50:09 +00:00
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)),
2018-03-13 10:38:11 +00:00
_ => None,
},
(l, r) => match (op.node, l, r) {
2018-07-12 07:50:09 +00:00
(BinOpKind::And, Constant::Bool(false), _) => Some(Constant::Bool(false)),
(BinOpKind::Or, Constant::Bool(true), _) => Some(Constant::Bool(true)),
2018-11-27 20:14:15 +00:00
(BinOpKind::And, Constant::Bool(true), Some(r)) | (BinOpKind::Or, Constant::Bool(false), Some(r)) => {
Some(r)
},
2018-07-12 07:50:09 +00:00
(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)),
2018-03-13 10:38:11 +00:00
_ => None,
},
}
}
}
pub fn miri_to_const<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>, result: &ty::Const<'tcx>) -> Option<Constant> {
use rustc::mir::interpret::{ConstValue, Scalar};
2018-03-13 10:38:11 +00:00
match result.val {
2018-11-27 20:14:15 +00:00
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)),
2018-10-09 04:40:21 +00:00
ty::Float(FloatTy::F32) => Some(Constant::F32(f32::from_bits(
2018-11-27 20:14:15 +00:00
b.try_into().expect("invalid f32 bit representation"),
2018-10-09 04:40:21 +00:00
))),
ty::Float(FloatTy::F64) => Some(Constant::F64(f64::from_bits(
2018-11-27 20:14:15 +00:00
b.try_into().expect("invalid f64 bit representation"),
2018-10-09 04:40:21 +00:00
))),
2018-03-13 10:38:11 +00:00
// FIXME: implement other conversion
_ => None,
},
2019-01-28 09:09:34 +00:00
ConstValue::Slice(Scalar::Ptr(ptr), n) => match result.ty.sty {
ty::Ref(_, tam, _) => match tam.sty {
ty::Str => {
2018-11-27 20:14:15 +00:00
let alloc = tcx.alloc_map.lock().unwrap_memory(ptr.alloc_id);
2018-10-09 04:40:21 +00:00
let offset = ptr.offset.bytes().try_into().expect("too-large pointer offset");
let n = usize::try_from(n).unwrap();
2018-11-27 20:14:15 +00:00
String::from_utf8(alloc.bytes[offset..(offset + n)].to_owned())
.ok()
.map(Constant::Str)
2018-03-13 10:38:11 +00:00
},
_ => None,
},
2016-01-04 04:26:12 +00:00
_ => None,
2018-11-27 20:14:15 +00:00
},
2018-03-13 10:38:11 +00:00
// FIXME: implement other conversions
_ => None,
}
2016-02-12 17:35:44 +00:00
}