2018-01-28 07:41:17 -06:00
|
|
|
// Copyright 2017 The Rust Project Developers. See the COPYRIGHT
|
|
|
|
// file at the top-level directory of this distribution and at
|
|
|
|
// http://rust-lang.org/COPYRIGHT.
|
|
|
|
//
|
|
|
|
// 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.
|
|
|
|
|
|
|
|
//! Propagates constants for early reporting of statically known
|
|
|
|
//! assertion failures
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
use rustc::mir::{Constant, Literal, Location, Place, Mir, Operand, Rvalue, Local};
|
|
|
|
use rustc::mir::{NullOp, StatementKind, Statement, BasicBlock, LocalKind};
|
2018-01-30 07:12:16 -06:00
|
|
|
use rustc::mir::{TerminatorKind, ClearCrossCrate, SourceInfo, BinOp};
|
2018-01-30 06:57:13 -06:00
|
|
|
use rustc::mir::visit::{Visitor, PlaceContext};
|
2018-01-29 08:12:45 -06:00
|
|
|
use rustc::ty::layout::LayoutOf;
|
2018-01-28 07:41:17 -06:00
|
|
|
use rustc::middle::const_val::ConstVal;
|
|
|
|
use rustc::ty::{TyCtxt, self, Instance};
|
|
|
|
use rustc::mir::interpret::{Value, PrimVal, GlobalId};
|
|
|
|
use interpret::{eval_body_with_mir, eval_body, mk_borrowck_eval_cx, unary_op, ValTy};
|
|
|
|
use transform::{MirPass, MirSource};
|
|
|
|
use syntax::codemap::Span;
|
|
|
|
use rustc::ty::subst::Substs;
|
2018-01-29 08:12:45 -06:00
|
|
|
use rustc_data_structures::indexed_vec::IndexVec;
|
2018-01-28 07:41:17 -06:00
|
|
|
|
|
|
|
pub struct ConstProp;
|
|
|
|
|
|
|
|
impl MirPass for ConstProp {
|
|
|
|
fn run_pass<'a, 'tcx>(&self,
|
|
|
|
tcx: TyCtxt<'a, 'tcx, 'tcx>,
|
|
|
|
source: MirSource,
|
|
|
|
mir: &mut Mir<'tcx>) {
|
|
|
|
trace!("ConstProp starting for {:?}", source.def_id);
|
|
|
|
|
2018-01-29 08:12:45 -06:00
|
|
|
// FIXME(oli-obk, eddyb) Optimize locals (or even local paths) to hold
|
|
|
|
// constants, instead of just checking for const-folding succeeding.
|
|
|
|
// That would require an uniform one-def no-mutation analysis
|
|
|
|
// and RPO (or recursing when needing the value of a local).
|
2018-01-30 07:12:16 -06:00
|
|
|
let mut optimization_finder = ConstPropagator::new(mir, tcx, source);
|
2018-01-29 03:38:05 -06:00
|
|
|
optimization_finder.visit_mir(mir);
|
2018-01-28 07:41:17 -06:00
|
|
|
|
|
|
|
trace!("ConstProp done for {:?}", source.def_id);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
type Const<'tcx> = (Value, ty::Ty<'tcx>, Span);
|
|
|
|
|
|
|
|
/// Finds optimization opportunities on the MIR.
|
2018-01-30 07:12:16 -06:00
|
|
|
struct ConstPropagator<'b, 'a, 'tcx:'a+'b> {
|
2018-01-28 07:41:17 -06:00
|
|
|
mir: &'b Mir<'tcx>,
|
|
|
|
tcx: TyCtxt<'a, 'tcx, 'tcx>,
|
|
|
|
source: MirSource,
|
2018-01-29 08:12:45 -06:00
|
|
|
places: IndexVec<Local, Option<Const<'tcx>>>,
|
2018-01-30 02:40:46 -06:00
|
|
|
can_const_prop: IndexVec<Local, bool>,
|
2018-01-28 07:41:17 -06:00
|
|
|
}
|
|
|
|
|
2018-01-30 07:12:16 -06:00
|
|
|
impl<'b, 'a, 'tcx:'b> ConstPropagator<'b, 'a, 'tcx> {
|
2018-01-28 07:41:17 -06:00
|
|
|
fn new(
|
|
|
|
mir: &'b Mir<'tcx>,
|
|
|
|
tcx: TyCtxt<'a, 'tcx, 'tcx>,
|
|
|
|
source: MirSource,
|
2018-01-30 07:12:16 -06:00
|
|
|
) -> ConstPropagator<'b, 'a, 'tcx> {
|
|
|
|
ConstPropagator {
|
2018-01-28 07:41:17 -06:00
|
|
|
mir,
|
|
|
|
tcx,
|
|
|
|
source,
|
2018-01-30 07:12:16 -06:00
|
|
|
can_const_prop: CanConstProp::check(mir),
|
2018-01-29 08:12:45 -06:00
|
|
|
places: IndexVec::from_elem(None, &mir.local_decls),
|
2018-01-28 07:41:17 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn eval_constant(&mut self, c: &Constant<'tcx>) -> Option<Const<'tcx>> {
|
|
|
|
match c.literal {
|
|
|
|
Literal::Value { value } => match value.val {
|
|
|
|
ConstVal::Value(v) => Some((v, value.ty, c.span)),
|
|
|
|
ConstVal::Unevaluated(did, substs) => {
|
|
|
|
let param_env = self.tcx.param_env(self.source.def_id);
|
|
|
|
let instance = Instance::resolve(
|
|
|
|
self.tcx,
|
|
|
|
param_env,
|
|
|
|
did,
|
|
|
|
substs,
|
|
|
|
)?;
|
|
|
|
let cid = GlobalId {
|
|
|
|
instance,
|
|
|
|
promoted: None,
|
|
|
|
};
|
|
|
|
let (value, _, ty) = eval_body(self.tcx, cid, param_env)?;
|
|
|
|
let val = (value, ty, c.span);
|
|
|
|
trace!("evaluated {:?} to {:?}", c, val);
|
|
|
|
Some(val)
|
|
|
|
},
|
|
|
|
},
|
|
|
|
// evaluate the promoted and replace the constant with the evaluated result
|
|
|
|
Literal::Promoted { index } => {
|
|
|
|
let generics = self.tcx.generics_of(self.source.def_id);
|
|
|
|
if generics.parent_types as usize + generics.types.len() > 0 {
|
|
|
|
// FIXME: can't handle code with generics
|
|
|
|
return None;
|
|
|
|
}
|
|
|
|
let substs = Substs::identity_for_item(self.tcx, self.source.def_id);
|
|
|
|
let instance = Instance::new(self.source.def_id, substs);
|
|
|
|
let cid = GlobalId {
|
|
|
|
instance,
|
|
|
|
promoted: Some(index),
|
|
|
|
};
|
|
|
|
let param_env = self.tcx.param_env(self.source.def_id);
|
|
|
|
let (value, _, ty) = eval_body_with_mir(self.tcx, cid, self.mir, param_env)?;
|
|
|
|
let val = (value, ty, c.span);
|
|
|
|
trace!("evaluated {:?} to {:?}", c, val);
|
|
|
|
Some(val)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn eval_operand(&mut self, op: &Operand<'tcx>) -> Option<Const<'tcx>> {
|
|
|
|
match *op {
|
|
|
|
Operand::Constant(ref c) => self.eval_constant(c),
|
|
|
|
Operand::Move(ref place) | Operand::Copy(ref place) => match *place {
|
2018-01-29 08:12:45 -06:00
|
|
|
Place::Local(loc) => self.places[loc].clone(),
|
2018-01-28 07:41:17 -06:00
|
|
|
// FIXME(oli-obk): field and index projections
|
|
|
|
Place::Projection(_) => None,
|
|
|
|
_ => None,
|
|
|
|
},
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn const_prop(
|
|
|
|
&mut self,
|
|
|
|
rvalue: &Rvalue<'tcx>,
|
|
|
|
place_ty: ty::Ty<'tcx>,
|
2018-01-29 08:12:45 -06:00
|
|
|
source_info: SourceInfo,
|
2018-01-28 07:41:17 -06:00
|
|
|
) -> Option<Const<'tcx>> {
|
2018-01-29 08:12:45 -06:00
|
|
|
let span = source_info.span;
|
2018-01-28 07:41:17 -06:00
|
|
|
match *rvalue {
|
|
|
|
// No need to overwrite an already evaluated constant
|
|
|
|
Rvalue::Use(Operand::Constant(box Constant {
|
|
|
|
literal: Literal::Value {
|
|
|
|
value: &ty::Const {
|
|
|
|
val: ConstVal::Value(_),
|
|
|
|
..
|
|
|
|
},
|
|
|
|
},
|
|
|
|
..
|
|
|
|
})) => None,
|
|
|
|
// This branch exists for the sanity type check
|
|
|
|
Rvalue::Use(Operand::Constant(ref c)) => {
|
|
|
|
assert_eq!(c.ty, place_ty);
|
|
|
|
self.eval_constant(c)
|
|
|
|
},
|
|
|
|
Rvalue::Use(ref op) => {
|
|
|
|
self.eval_operand(op)
|
|
|
|
},
|
|
|
|
Rvalue::Repeat(..) |
|
|
|
|
Rvalue::Ref(..) |
|
|
|
|
Rvalue::Cast(..) |
|
|
|
|
Rvalue::Aggregate(..) |
|
|
|
|
Rvalue::NullaryOp(NullOp::Box, _) |
|
|
|
|
Rvalue::Discriminant(..) => None,
|
|
|
|
// FIXME(oli-obk): evaluate static/constant slice lengths
|
|
|
|
Rvalue::Len(_) => None,
|
|
|
|
Rvalue::NullaryOp(NullOp::SizeOf, ty) => {
|
|
|
|
let param_env = self.tcx.param_env(self.source.def_id);
|
|
|
|
type_size_of(self.tcx, param_env, ty).map(|n| (
|
|
|
|
Value::ByVal(PrimVal::Bytes(n as u128)),
|
|
|
|
self.tcx.types.usize,
|
|
|
|
span,
|
|
|
|
))
|
|
|
|
}
|
|
|
|
Rvalue::UnaryOp(op, ref arg) => {
|
|
|
|
let def_id = if self.tcx.is_closure(self.source.def_id) {
|
|
|
|
self.tcx.closure_base_def_id(self.source.def_id)
|
|
|
|
} else {
|
|
|
|
self.source.def_id
|
|
|
|
};
|
|
|
|
let generics = self.tcx.generics_of(def_id);
|
|
|
|
if generics.parent_types as usize + generics.types.len() > 0 {
|
|
|
|
// FIXME: can't handle code with generics
|
|
|
|
return None;
|
|
|
|
}
|
|
|
|
let substs = Substs::identity_for_item(self.tcx, self.source.def_id);
|
|
|
|
let instance = Instance::new(self.source.def_id, substs);
|
|
|
|
let ecx = mk_borrowck_eval_cx(self.tcx, instance, self.mir, span).unwrap();
|
|
|
|
|
|
|
|
let val = self.eval_operand(arg)?;
|
|
|
|
let prim = ecx.value_to_primval(ValTy { value: val.0, ty: val.1 }).ok()?;
|
|
|
|
let kind = ecx.ty_to_primval_kind(val.1).ok()?;
|
|
|
|
match unary_op(op, prim, kind) {
|
|
|
|
Ok(val) => Some((Value::ByVal(val), place_ty, span)),
|
|
|
|
Err(mut err) => {
|
|
|
|
ecx.report(&mut err, false, Some(span));
|
|
|
|
None
|
|
|
|
},
|
|
|
|
}
|
|
|
|
}
|
|
|
|
Rvalue::CheckedBinaryOp(op, ref left, ref right) |
|
|
|
|
Rvalue::BinaryOp(op, ref left, ref right) => {
|
|
|
|
trace!("rvalue binop {:?} for {:?} and {:?}", op, left, right);
|
|
|
|
let right = self.eval_operand(right)?;
|
|
|
|
let def_id = if self.tcx.is_closure(self.source.def_id) {
|
|
|
|
self.tcx.closure_base_def_id(self.source.def_id)
|
|
|
|
} else {
|
|
|
|
self.source.def_id
|
|
|
|
};
|
|
|
|
let generics = self.tcx.generics_of(def_id);
|
|
|
|
let has_generics = generics.parent_types as usize + generics.types.len() > 0;
|
|
|
|
if has_generics {
|
|
|
|
// FIXME: can't handle code with generics
|
|
|
|
return None;
|
|
|
|
}
|
|
|
|
let substs = Substs::identity_for_item(self.tcx, self.source.def_id);
|
|
|
|
let instance = Instance::new(self.source.def_id, substs);
|
|
|
|
let ecx = mk_borrowck_eval_cx(self.tcx, instance, self.mir, span).unwrap();
|
|
|
|
|
|
|
|
let r = ecx.value_to_primval(ValTy { value: right.0, ty: right.1 }).ok()?;
|
2018-01-29 12:06:44 -06:00
|
|
|
if op == BinOp::Shr || op == BinOp::Shl {
|
|
|
|
let param_env = self.tcx.param_env(self.source.def_id);
|
2018-01-29 13:47:09 -06:00
|
|
|
let bits = (self.tcx, param_env).layout_of(place_ty).unwrap().size.bits();
|
|
|
|
if r.to_bytes().ok().map_or(false, |b| b >= bits as u128) {
|
2018-01-29 12:06:44 -06:00
|
|
|
let scope_info = match self.mir.visibility_scope_info {
|
|
|
|
ClearCrossCrate::Set(ref data) => data,
|
|
|
|
ClearCrossCrate::Clear => return None,
|
|
|
|
};
|
|
|
|
let node_id = scope_info[source_info.scope].lint_root;
|
|
|
|
self.tcx.lint_node(
|
|
|
|
::rustc::lint::builtin::EXCEEDING_BITSHIFTS,
|
|
|
|
node_id,
|
|
|
|
span,
|
|
|
|
"bitshift exceeds the type's number of bits");
|
2018-01-29 13:47:09 -06:00
|
|
|
return None;
|
2018-01-29 12:06:44 -06:00
|
|
|
}
|
2018-01-29 08:10:26 -06:00
|
|
|
}
|
2018-01-29 13:47:09 -06:00
|
|
|
let left = self.eval_operand(left)?;
|
2018-01-29 08:10:26 -06:00
|
|
|
let l = ecx.value_to_primval(ValTy { value: left.0, ty: left.1 }).ok()?;
|
2018-01-28 07:41:17 -06:00
|
|
|
trace!("const evaluating {:?} for {:?} and {:?}", op, left, right);
|
|
|
|
match ecx.binary_op(op, l, left.1, r, right.1) {
|
|
|
|
Ok((val, overflow)) => {
|
|
|
|
let val = if let Rvalue::CheckedBinaryOp(..) = *rvalue {
|
|
|
|
Value::ByValPair(
|
|
|
|
val,
|
|
|
|
PrimVal::from_bool(overflow),
|
|
|
|
)
|
|
|
|
} else {
|
|
|
|
if overflow {
|
|
|
|
use rustc::mir::interpret::EvalErrorKind;
|
|
|
|
let mut err = EvalErrorKind::OverflowingMath.into();
|
|
|
|
ecx.report(&mut err, false, Some(span));
|
|
|
|
return None;
|
|
|
|
}
|
|
|
|
Value::ByVal(val)
|
|
|
|
};
|
|
|
|
Some((val, place_ty, span))
|
|
|
|
},
|
|
|
|
Err(mut err) => {
|
|
|
|
ecx.report(&mut err, false, Some(span));
|
|
|
|
None
|
|
|
|
},
|
|
|
|
}
|
|
|
|
},
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn type_size_of<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
|
|
|
|
param_env: ty::ParamEnv<'tcx>,
|
|
|
|
ty: ty::Ty<'tcx>) -> Option<u64> {
|
|
|
|
use rustc::ty::layout::LayoutOf;
|
|
|
|
(tcx, param_env).layout_of(ty).ok().map(|layout| layout.size.bytes())
|
|
|
|
}
|
|
|
|
|
2018-01-30 07:12:16 -06:00
|
|
|
struct CanConstProp {
|
2018-01-30 02:40:46 -06:00
|
|
|
can_const_prop: IndexVec<Local, bool>,
|
2018-01-28 07:41:17 -06:00
|
|
|
// false at the beginning, once set, there are not allowed to be any more assignments
|
2018-01-30 02:40:46 -06:00
|
|
|
found_assignment: IndexVec<Local, bool>,
|
2018-01-28 07:41:17 -06:00
|
|
|
}
|
|
|
|
|
2018-01-30 07:12:16 -06:00
|
|
|
impl CanConstProp {
|
2018-01-28 07:41:17 -06:00
|
|
|
/// returns true if `local` can be propagated
|
2018-01-30 07:12:16 -06:00
|
|
|
fn check(mir: &Mir) -> IndexVec<Local, bool> {
|
2018-01-28 07:41:17 -06:00
|
|
|
let mut cpv = CanConstProp {
|
2018-01-30 02:40:46 -06:00
|
|
|
can_const_prop: IndexVec::from_elem(true, &mir.local_decls),
|
|
|
|
found_assignment: IndexVec::from_elem(false, &mir.local_decls),
|
2018-01-28 07:41:17 -06:00
|
|
|
};
|
2018-01-30 02:40:46 -06:00
|
|
|
for (local, val) in cpv.can_const_prop.iter_enumerated_mut() {
|
2018-01-30 06:57:13 -06:00
|
|
|
*val = mir.local_kind(local) != LocalKind::Arg;
|
2018-01-30 02:40:46 -06:00
|
|
|
}
|
2018-01-28 07:41:17 -06:00
|
|
|
cpv.visit_mir(mir);
|
|
|
|
cpv.can_const_prop
|
|
|
|
}
|
2018-01-30 02:40:46 -06:00
|
|
|
}
|
2018-01-28 07:41:17 -06:00
|
|
|
|
2018-01-30 07:12:16 -06:00
|
|
|
impl<'tcx> Visitor<'tcx> for CanConstProp {
|
2018-01-30 06:57:13 -06:00
|
|
|
fn visit_local(
|
2018-01-28 07:41:17 -06:00
|
|
|
&mut self,
|
2018-01-30 06:57:13 -06:00
|
|
|
&local: &Local,
|
|
|
|
context: PlaceContext<'tcx>,
|
|
|
|
_: Location,
|
2018-01-28 07:41:17 -06:00
|
|
|
) {
|
2018-01-30 06:57:13 -06:00
|
|
|
use rustc::mir::visit::PlaceContext::*;
|
|
|
|
match context {
|
|
|
|
// Constants must have at most one write
|
|
|
|
// FIXME(oli-obk): we could be more powerful here, if the multiple writes
|
|
|
|
// only occur in independent execution paths
|
|
|
|
Store => if self.found_assignment[local] {
|
|
|
|
self.can_const_prop[local] = false;
|
|
|
|
} else {
|
|
|
|
self.found_assignment[local] = true
|
2018-01-28 07:41:17 -06:00
|
|
|
},
|
2018-01-30 06:57:13 -06:00
|
|
|
// Reading constants is allowed an arbitrary number of times
|
|
|
|
Copy | Move |
|
|
|
|
StorageDead | StorageLive |
|
|
|
|
Validate |
|
|
|
|
Inspect => {},
|
|
|
|
_ => self.can_const_prop[local] = false,
|
2018-01-28 07:41:17 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-01-30 07:12:16 -06:00
|
|
|
impl<'b, 'a, 'tcx> Visitor<'tcx> for ConstPropagator<'b, 'a, 'tcx> {
|
2018-01-28 07:41:17 -06:00
|
|
|
fn visit_constant(
|
|
|
|
&mut self,
|
|
|
|
constant: &Constant<'tcx>,
|
|
|
|
location: Location,
|
|
|
|
) {
|
|
|
|
trace!("visit_constant: {:?}", constant);
|
|
|
|
self.super_constant(constant, location);
|
|
|
|
self.eval_constant(constant);
|
|
|
|
}
|
|
|
|
|
|
|
|
fn visit_statement(
|
|
|
|
&mut self,
|
|
|
|
block: BasicBlock,
|
|
|
|
statement: &Statement<'tcx>,
|
|
|
|
location: Location,
|
|
|
|
) {
|
|
|
|
trace!("visit_statement: {:?}", statement);
|
|
|
|
if let StatementKind::Assign(ref place, ref rval) = statement.kind {
|
|
|
|
let place_ty = place
|
|
|
|
.ty(&self.mir.local_decls, self.tcx)
|
|
|
|
.to_ty(self.tcx);
|
2018-01-29 08:12:45 -06:00
|
|
|
if let Some(value) = self.const_prop(rval, place_ty, statement.source_info) {
|
2018-01-28 07:41:17 -06:00
|
|
|
if let Place::Local(local) = *place {
|
2018-01-30 02:40:46 -06:00
|
|
|
if self.can_const_prop[local] {
|
2018-01-28 07:41:17 -06:00
|
|
|
trace!("storing {:?} to {:?}", value, local);
|
2018-01-29 08:12:45 -06:00
|
|
|
assert!(self.places[local].is_none());
|
|
|
|
self.places[local] = Some(value);
|
2018-01-28 07:41:17 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
self.super_statement(block, statement, location);
|
|
|
|
}
|
|
|
|
|
|
|
|
fn visit_terminator_kind(
|
|
|
|
&mut self,
|
|
|
|
block: BasicBlock,
|
|
|
|
kind: &TerminatorKind<'tcx>,
|
2018-01-29 03:18:49 -06:00
|
|
|
_location: Location,
|
2018-01-28 07:41:17 -06:00
|
|
|
) {
|
|
|
|
match kind {
|
|
|
|
TerminatorKind::SwitchInt { discr: value, .. } |
|
|
|
|
TerminatorKind::Yield { value, .. } |
|
|
|
|
TerminatorKind::Assert { cond: value, .. } => {
|
2018-01-29 01:50:47 -06:00
|
|
|
match value {
|
|
|
|
Operand::Constant(box Constant {
|
|
|
|
literal: Literal::Value {
|
|
|
|
value: &ty::Const {
|
|
|
|
val: ConstVal::Value(_),
|
|
|
|
..
|
|
|
|
},
|
|
|
|
},
|
|
|
|
..
|
|
|
|
}) => return,
|
|
|
|
_ => {},
|
|
|
|
}
|
|
|
|
if let Some(value) = self.eval_operand(value) {
|
|
|
|
if let TerminatorKind::Assert { expected, msg, .. } = kind {
|
|
|
|
if Value::ByVal(PrimVal::from_bool(*expected)) != value.0 {
|
|
|
|
let span = self.mir[block]
|
2018-01-29 03:18:49 -06:00
|
|
|
.terminator
|
|
|
|
.as_ref()
|
|
|
|
.unwrap()
|
2018-01-29 01:50:47 -06:00
|
|
|
.source_info
|
|
|
|
.span;
|
|
|
|
let node_id = self
|
|
|
|
.tcx
|
|
|
|
.hir
|
|
|
|
.as_local_node_id(self.source.def_id)
|
|
|
|
.expect("some part of a failing const eval must be local");
|
|
|
|
let mut lint = self.tcx.struct_span_lint_node(
|
|
|
|
::rustc::lint::builtin::CONST_ERR,
|
|
|
|
node_id,
|
|
|
|
span,
|
|
|
|
"constant evaluation error",
|
|
|
|
);
|
|
|
|
use rustc::mir::AssertMessage::*;
|
|
|
|
match msg {
|
|
|
|
GeneratorResumedAfterReturn =>
|
|
|
|
lint.span_label(span, "generator resumed after completion"),
|
|
|
|
GeneratorResumedAfterPanic =>
|
|
|
|
lint.span_label(span, "generator resumed after panicking"),
|
|
|
|
Math(ref err) => lint.span_label(span, err.description()),
|
|
|
|
BoundsCheck { ref len, ref index } => {
|
|
|
|
let len = self.eval_operand(len).expect("len must be const");
|
|
|
|
let len = match len.0 {
|
|
|
|
Value::ByVal(PrimVal::Bytes(n)) => n,
|
|
|
|
_ => bug!("const len not primitive: {:?}", len),
|
|
|
|
};
|
|
|
|
let index = self
|
|
|
|
.eval_operand(index)
|
|
|
|
.expect("index must be const");
|
|
|
|
let index = match index.0 {
|
|
|
|
Value::ByVal(PrimVal::Bytes(n)) => n,
|
|
|
|
_ => bug!("const index not primitive: {:?}", index),
|
|
|
|
};
|
|
|
|
lint.span_label(
|
|
|
|
span,
|
|
|
|
format!(
|
|
|
|
"index out of bounds: \
|
|
|
|
the len is {} but the index is {}",
|
|
|
|
len,
|
|
|
|
index,
|
|
|
|
),
|
|
|
|
)
|
|
|
|
},
|
|
|
|
}.emit();
|
|
|
|
}
|
|
|
|
}
|
2018-01-28 07:41:17 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
// FIXME: do this optimization for function calls
|
|
|
|
_ => {},
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|