1 // Not in interpret to make sure we do not use private implementation details
5 use std::borrow::{Borrow, Cow};
7 use std::collections::hash_map::Entry;
8 use std::convert::TryInto;
10 use rustc::hir::def::DefKind;
11 use rustc::hir::def_id::DefId;
12 use rustc::mir::interpret::{ConstEvalErr, ErrorHandled, ScalarMaybeUndef};
14 use rustc::ty::{self, TyCtxt};
15 use rustc::ty::layout::{self, LayoutOf, VariantIdx};
16 use rustc::ty::subst::Subst;
17 use rustc::traits::Reveal;
18 use rustc_data_structures::fx::FxHashMap;
20 use syntax::source_map::{Span, DUMMY_SP};
22 use crate::interpret::{self,
23 PlaceTy, MPlaceTy, OpTy, ImmTy, Immediate, Scalar,
25 InterpResult, InterpErrorInfo, InterpError, GlobalId, InterpCx, StackPopCleanup,
26 Allocation, AllocId, MemoryKind,
27 snapshot, RefTracking, intern_const_alloc_recursive, UnsupportedOpInfo,
30 /// Number of steps until the detector even starts doing anything.
31 /// Also, a warning is shown to the user when this number is reached.
32 const STEPS_UNTIL_DETECTOR_ENABLED: isize = 1_000_000;
33 /// The number of steps between loop detector snapshots.
34 /// Should be a power of two for performance reasons.
35 const DETECTOR_SNAPSHOT_PERIOD: isize = 256;
37 /// The `InterpCx` is only meant to be used to do field and index projections into constants for
38 /// `simd_shuffle` and const patterns in match arms.
40 /// The function containing the `match` that is currently being analyzed may have generic bounds
41 /// that inform us about the generic bounds of the constant. E.g., using an associated constant
42 /// of a function's generic parameter will require knowledge about the bounds on the generic
43 /// parameter. These bounds are passed to `mk_eval_cx` via the `ParamEnv` argument.
44 pub(crate) fn mk_eval_cx<'mir, 'tcx>(
47 param_env: ty::ParamEnv<'tcx>,
48 ) -> CompileTimeEvalContext<'mir, 'tcx> {
49 debug!("mk_eval_cx: {:?}", param_env);
50 InterpCx::new(tcx.at(span), param_env, CompileTimeInterpreter::new(), Default::default())
53 pub(crate) fn eval_promoted<'mir, 'tcx>(
56 body: &'mir mir::Body<'tcx>,
57 param_env: ty::ParamEnv<'tcx>,
58 ) -> InterpResult<'tcx, MPlaceTy<'tcx>> {
59 let span = tcx.def_span(cid.instance.def_id());
60 let mut ecx = mk_eval_cx(tcx, span, param_env);
61 eval_body_using_ecx(&mut ecx, cid, body, param_env)
65 ecx: &CompileTimeEvalContext<'_, 'tcx>,
67 ) -> &'tcx ty::Const<'tcx> {
68 // We do not have value optmizations for everything.
69 // Only scalars and slices, since they are very common.
70 // Note that further down we turn scalars of undefined bits back to `ByRef`. These can result
71 // from scalar unions that are initialized with one of their zero sized variants. We could
72 // instead allow `ConstValue::Scalar` to store `ScalarMaybeUndef`, but that would affect all
73 // the usual cases of extracting e.g. a `usize`, without there being a real use case for the
75 let try_as_immediate = match op.layout.abi {
76 layout::Abi::Scalar(..) => true,
77 layout::Abi::ScalarPair(..) => match op.layout.ty.sty {
78 ty::Ref(_, inner, _) => match inner.sty {
79 ty::Slice(elem) => elem == ecx.tcx.types.u8,
87 let immediate = if try_as_immediate {
88 Err(ecx.read_immediate(op).expect("normalization works on validated constants"))
90 // It is guaranteed that any non-slice scalar pair is actually ByRef here.
91 // When we come back from raw const eval, we are always by-ref. The only way our op here is
92 // by-val is if we are in const_field, i.e., if this is (a field of) something that we
93 // "tried to make immediate" before. We wouldn't do that for non-slice scalar pairs or
94 // structs containing such.
97 let val = match immediate {
99 let ptr = mplace.ptr.to_ptr().unwrap();
100 let alloc = ecx.tcx.alloc_map.lock().unwrap_memory(ptr.alloc_id);
101 ConstValue::ByRef { offset: ptr.offset, align: mplace.align, alloc }
103 // see comment on `let try_as_immediate` above
104 Err(ImmTy { imm: Immediate::Scalar(x), .. }) => match x {
105 ScalarMaybeUndef::Scalar(s) => ConstValue::Scalar(s),
106 ScalarMaybeUndef::Undef => {
107 // When coming out of "normal CTFE", we'll always have an `Indirect` operand as
108 // argument and we will not need this. The only way we can already have an
109 // `Immediate` is when we are called from `const_field`, and that `Immediate`
110 // comes from a constant so it can happen have `Undef`, because the indirect
111 // memory that was read had undefined bytes.
112 let mplace = op.assert_mem_place();
113 let ptr = mplace.ptr.to_ptr().unwrap();
114 let alloc = ecx.tcx.alloc_map.lock().unwrap_memory(ptr.alloc_id);
115 ConstValue::ByRef { offset: ptr.offset, align: mplace.align, alloc }
118 Err(ImmTy { imm: Immediate::ScalarPair(a, b), .. }) => {
119 let (data, start) = match a.not_undef().unwrap() {
120 Scalar::Ptr(ptr) => (
121 ecx.tcx.alloc_map.lock().unwrap_memory(ptr.alloc_id),
124 Scalar::Raw { .. } => (
125 ecx.tcx.intern_const_alloc(Allocation::from_byte_aligned_bytes(
131 let len = b.to_usize(&ecx.tcx.tcx).unwrap();
132 let start = start.try_into().unwrap();
133 let len: usize = len.try_into().unwrap();
141 ecx.tcx.mk_const(ty::Const { val, ty: op.layout.ty })
144 // Returns a pointer to where the result lives
145 fn eval_body_using_ecx<'mir, 'tcx>(
146 ecx: &mut CompileTimeEvalContext<'mir, 'tcx>,
148 body: &'mir mir::Body<'tcx>,
149 param_env: ty::ParamEnv<'tcx>,
150 ) -> InterpResult<'tcx, MPlaceTy<'tcx>> {
151 debug!("eval_body_using_ecx: {:?}, {:?}", cid, param_env);
152 let tcx = ecx.tcx.tcx;
153 let layout = ecx.layout_of(body.return_ty().subst(tcx, cid.instance.substs))?;
154 assert!(!layout.is_unsized());
155 let ret = ecx.allocate(layout, MemoryKind::Stack);
157 let name = ty::tls::with(|tcx| tcx.def_path_str(cid.instance.def_id()));
158 let prom = cid.promoted.map_or(String::new(), |p| format!("::promoted[{:?}]", p));
159 trace!("eval_body_using_ecx: pushing stack frame for global: {}{}", name, prom);
160 assert!(body.arg_count == 0);
161 ecx.push_stack_frame(
166 StackPopCleanup::None { cleanup: false },
169 // The main interpreter loop.
173 intern_const_alloc_recursive(
175 cid.instance.def_id(),
180 debug!("eval_body_using_ecx done: {:?}", *ret);
184 impl<'tcx> Into<InterpErrorInfo<'tcx>> for ConstEvalError {
185 fn into(self) -> InterpErrorInfo<'tcx> {
186 InterpError::Unsupported(UnsupportedOpInfo::MachineError(self.to_string())).into()
190 #[derive(Clone, Debug)]
191 enum ConstEvalError {
195 impl fmt::Display for ConstEvalError {
196 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
197 use self::ConstEvalError::*;
199 NeedsRfc(ref msg) => {
202 "\"{}\" needs an rfc before being allowed inside constants",
210 impl Error for ConstEvalError {
211 fn description(&self) -> &str {
212 use self::ConstEvalError::*;
214 NeedsRfc(_) => "this feature needs an rfc before being allowed inside constants",
218 fn cause(&self) -> Option<&dyn Error> {
223 // Extra machine state for CTFE, and the Machine instance
224 pub struct CompileTimeInterpreter<'mir, 'tcx> {
225 /// When this value is negative, it indicates the number of interpreter
226 /// steps *until* the loop detector is enabled. When it is positive, it is
227 /// the number of steps after the detector has been enabled modulo the loop
229 pub(super) steps_since_detector_enabled: isize,
231 /// Extra state to detect loops.
232 pub(super) loop_detector: snapshot::InfiniteLoopDetector<'mir, 'tcx>,
235 impl<'mir, 'tcx> CompileTimeInterpreter<'mir, 'tcx> {
237 CompileTimeInterpreter {
238 loop_detector: Default::default(),
239 steps_since_detector_enabled: -STEPS_UNTIL_DETECTOR_ENABLED,
244 impl<K: Hash + Eq, V> interpret::AllocMap<K, V> for FxHashMap<K, V> {
246 fn contains_key<Q: ?Sized + Hash + Eq>(&mut self, k: &Q) -> bool
249 FxHashMap::contains_key(self, k)
253 fn insert(&mut self, k: K, v: V) -> Option<V>
255 FxHashMap::insert(self, k, v)
259 fn remove<Q: ?Sized + Hash + Eq>(&mut self, k: &Q) -> Option<V>
262 FxHashMap::remove(self, k)
266 fn filter_map_collect<T>(&self, mut f: impl FnMut(&K, &V) -> Option<T>) -> Vec<T> {
268 .filter_map(move |(k, v)| f(k, &*v))
276 vacant: impl FnOnce() -> Result<V, E>
283 bug!("The CTFE machine shouldn't ever need to extend the alloc_map when reading")
292 vacant: impl FnOnce() -> Result<V, E>
293 ) -> Result<&mut V, E>
295 match self.entry(k) {
296 Entry::Occupied(e) => Ok(e.into_mut()),
297 Entry::Vacant(e) => {
305 crate type CompileTimeEvalContext<'mir, 'tcx> =
306 InterpCx<'mir, 'tcx, CompileTimeInterpreter<'mir, 'tcx>>;
308 impl interpret::MayLeak for ! {
310 fn may_leak(self) -> bool {
311 // `self` is uninhabited
316 impl<'mir, 'tcx> interpret::Machine<'mir, 'tcx> for CompileTimeInterpreter<'mir, 'tcx> {
317 type MemoryKinds = !;
318 type PointerTag = ();
321 type FrameExtra = ();
322 type MemoryExtra = ();
323 type AllocExtra = ();
325 type MemoryMap = FxHashMap<AllocId, (MemoryKind<!>, Allocation)>;
327 const STATIC_KIND: Option<!> = None; // no copying of statics allowed
330 fn enforce_validity(_ecx: &InterpCx<'mir, 'tcx, Self>) -> bool {
331 false // for now, we don't enforce validity
335 ecx: &mut InterpCx<'mir, 'tcx, Self>,
336 instance: ty::Instance<'tcx>,
338 dest: Option<PlaceTy<'tcx>>,
339 ret: Option<mir::BasicBlock>,
340 ) -> InterpResult<'tcx, Option<&'mir mir::Body<'tcx>>> {
341 debug!("eval_fn_call: {:?}", instance);
342 // Only check non-glue functions
343 if let ty::InstanceDef::Item(def_id) = instance.def {
344 // Execution might have wandered off into other crates, so we cannot to a stability-
345 // sensitive check here. But we can at least rule out functions that are not const
347 if !ecx.tcx.is_const_fn_raw(def_id) {
348 // Some functions we support even if they are non-const -- but avoid testing
349 // that for const fn! We certainly do *not* want to actually call the fn
350 // though, so be sure we return here.
351 return if ecx.hook_fn(instance, args, dest)? {
352 ecx.goto_block(ret)?; // fully evaluated and done
355 err!(MachineError(format!("calling non-const function `{}`", instance)))
359 // This is a const fn. Call it.
360 Ok(Some(match ecx.load_mir(instance.def) {
363 if let InterpError::Unsupported(UnsupportedOpInfo::NoMirFor(ref path)) = err.kind {
365 ConstEvalError::NeedsRfc(format!("calling extern function `{}`", path))
375 _ecx: &mut InterpCx<'mir, 'tcx, Self>,
377 _args: &[OpTy<'tcx>],
378 _dest: Option<PlaceTy<'tcx>>,
379 _ret: Option<mir::BasicBlock>,
380 ) -> InterpResult<'tcx> {
385 ecx: &mut InterpCx<'mir, 'tcx, Self>,
386 instance: ty::Instance<'tcx>,
389 ) -> InterpResult<'tcx> {
390 if ecx.emulate_intrinsic(instance, args, dest)? {
393 // An intrinsic that we do not support
394 let intrinsic_name = &ecx.tcx.item_name(instance.def_id()).as_str()[..];
396 ConstEvalError::NeedsRfc(format!("calling intrinsic `{}`", intrinsic_name)).into()
401 _ecx: &InterpCx<'mir, 'tcx, Self>,
405 ) -> InterpResult<'tcx, (Scalar, bool)> {
407 ConstEvalError::NeedsRfc("pointer arithmetic or comparison".to_string()).into(),
411 fn find_foreign_static(
414 ) -> InterpResult<'tcx, Cow<'tcx, Allocation<Self::PointerTag>>> {
415 err!(ReadForeignStatic)
419 fn tag_allocation<'b>(
422 alloc: Cow<'b, Allocation>,
423 _kind: Option<MemoryKind<!>>,
424 ) -> (Cow<'b, Allocation<Self::PointerTag>>, Self::PointerTag) {
425 // We do not use a tag so we can just cheaply forward the allocation
430 fn tag_static_base_pointer(
433 ) -> Self::PointerTag {
438 _ecx: &mut InterpCx<'mir, 'tcx, Self>,
439 _dest: PlaceTy<'tcx>,
440 ) -> InterpResult<'tcx> {
442 ConstEvalError::NeedsRfc("heap allocations via `box` keyword".to_string()).into(),
446 fn before_terminator(ecx: &mut InterpCx<'mir, 'tcx, Self>) -> InterpResult<'tcx> {
448 let steps = &mut ecx.machine.steps_since_detector_enabled;
455 *steps %= DETECTOR_SNAPSHOT_PERIOD;
461 let span = ecx.frame().span;
462 ecx.machine.loop_detector.observe_and_analyze(
471 fn stack_push(_ecx: &mut InterpCx<'mir, 'tcx, Self>) -> InterpResult<'tcx> {
475 /// Called immediately before a stack frame gets popped.
477 fn stack_pop(_ecx: &mut InterpCx<'mir, 'tcx, Self>, _extra: ()) -> InterpResult<'tcx> {
482 /// Extracts a field of a (variant of a) const.
483 // this function uses `unwrap` copiously, because an already validated constant must have valid
484 // fields and can thus never fail outside of compiler bugs
485 pub fn const_field<'tcx>(
487 param_env: ty::ParamEnv<'tcx>,
488 variant: Option<VariantIdx>,
490 value: &'tcx ty::Const<'tcx>,
491 ) -> &'tcx ty::Const<'tcx> {
492 trace!("const_field: {:?}, {:?}", field, value);
493 let ecx = mk_eval_cx(tcx, DUMMY_SP, param_env);
494 // get the operand again
495 let op = ecx.eval_const_to_op(value, None).unwrap();
497 let down = match variant {
499 Some(variant) => ecx.operand_downcast(op, variant).unwrap(),
502 let field = ecx.operand_field(down, field.index() as u64).unwrap();
503 // and finally move back to the const world, always normalizing because
504 // this is not called for statics.
505 op_to_const(&ecx, field)
508 // this function uses `unwrap` copiously, because an already validated constant must have valid
509 // fields and can thus never fail outside of compiler bugs
510 pub fn const_variant_index<'tcx>(
512 param_env: ty::ParamEnv<'tcx>,
513 val: &'tcx ty::Const<'tcx>,
515 trace!("const_variant_index: {:?}", val);
516 let ecx = mk_eval_cx(tcx, DUMMY_SP, param_env);
517 let op = ecx.eval_const_to_op(val, None).unwrap();
518 ecx.read_discriminant(op).unwrap().1
521 pub fn error_to_const_error<'mir, 'tcx>(
522 ecx: &InterpCx<'mir, 'tcx, CompileTimeInterpreter<'mir, 'tcx>>,
523 mut error: InterpErrorInfo<'tcx>,
524 ) -> ConstEvalErr<'tcx> {
525 error.print_backtrace();
526 let stacktrace = ecx.generate_stacktrace(None);
527 ConstEvalErr { error: error.kind, stacktrace, span: ecx.tcx.span }
530 fn validate_and_turn_into_const<'tcx>(
532 constant: RawConst<'tcx>,
533 key: ty::ParamEnvAnd<'tcx, GlobalId<'tcx>>,
534 ) -> ::rustc::mir::interpret::ConstEvalResult<'tcx> {
536 let ecx = mk_eval_cx(tcx, tcx.def_span(key.value.instance.def_id()), key.param_env);
538 let mplace = ecx.raw_const_to_mplace(constant)?;
539 let mut ref_tracking = RefTracking::new(mplace);
540 while let Some((mplace, path)) = ref_tracking.todo.pop() {
541 ecx.validate_operand(
544 Some(&mut ref_tracking),
547 // Now that we validated, turn this into a proper constant.
548 // Statics/promoteds are always `ByRef`, for the rest `op_to_const` decides
549 // whether they become immediates.
550 let def_id = cid.instance.def.def_id();
551 if tcx.is_static(def_id) || cid.promoted.is_some() {
552 let ptr = mplace.ptr.to_ptr()?;
553 Ok(tcx.mk_const(ty::Const {
554 val: ConstValue::ByRef {
557 alloc: ecx.tcx.alloc_map.lock().unwrap_memory(ptr.alloc_id),
559 ty: mplace.layout.ty,
562 Ok(op_to_const(&ecx, mplace.into()))
566 val.map_err(|error| {
567 let err = error_to_const_error(&ecx, error);
568 match err.struct_error(ecx.tcx, "it is undefined behavior to use this value") {
570 diag.note("The rules on what exactly is undefined behavior aren't clear, \
571 so this check might be overzealous. Please open an issue on the rust compiler \
572 repository if you believe it should not be considered undefined behavior",
575 ErrorHandled::Reported
582 pub fn const_eval_provider<'tcx>(
584 key: ty::ParamEnvAnd<'tcx, GlobalId<'tcx>>,
585 ) -> ::rustc::mir::interpret::ConstEvalResult<'tcx> {
586 // see comment in const_eval_provider for what we're doing here
587 if key.param_env.reveal == Reveal::All {
588 let mut key = key.clone();
589 key.param_env.reveal = Reveal::UserFacing;
590 match tcx.const_eval(key) {
591 // try again with reveal all as requested
592 Err(ErrorHandled::TooGeneric) => {
593 // Promoteds should never be "too generic" when getting evaluated.
594 // They either don't get evaluated, or we are in a monomorphic context
595 assert!(key.value.promoted.is_none());
598 other => return other,
601 tcx.const_eval_raw(key).and_then(|val| {
602 validate_and_turn_into_const(tcx, val, key)
606 pub fn const_eval_raw_provider<'tcx>(
608 key: ty::ParamEnvAnd<'tcx, GlobalId<'tcx>>,
609 ) -> ::rustc::mir::interpret::ConstEvalRawResult<'tcx> {
610 // Because the constant is computed twice (once per value of `Reveal`), we are at risk of
611 // reporting the same error twice here. To resolve this, we check whether we can evaluate the
612 // constant in the more restrictive `Reveal::UserFacing`, which most likely already was
613 // computed. For a large percentage of constants that will already have succeeded. Only
614 // associated constants of generic functions will fail due to not enough monomorphization
615 // information being available.
617 // In case we fail in the `UserFacing` variant, we just do the real computation.
618 if key.param_env.reveal == Reveal::All {
619 let mut key = key.clone();
620 key.param_env.reveal = Reveal::UserFacing;
621 match tcx.const_eval_raw(key) {
622 // try again with reveal all as requested
623 Err(ErrorHandled::TooGeneric) => {},
625 other => return other,
628 if cfg!(debug_assertions) {
629 // Make sure we format the instance even if we do not print it.
630 // This serves as a regression test against an ICE on printing.
631 // The next two lines concatenated contain some discussion:
632 // https://rust-lang.zulipchat.com/#narrow/stream/146212-t-compiler.2Fconst-eval/
633 // subject/anon_const_instance_printing/near/135980032
634 let instance = key.value.instance.to_string();
635 trace!("const eval: {:?} ({})", key, instance);
639 let def_id = cid.instance.def.def_id();
641 if def_id.is_local() && tcx.typeck_tables_of(def_id).tainted_by_errors {
642 return Err(ErrorHandled::Reported);
645 let span = tcx.def_span(cid.instance.def_id());
646 let mut ecx = InterpCx::new(
649 CompileTimeInterpreter::new(),
653 let res = ecx.load_mir(cid.instance.def);
655 if let Some(index) = cid.promoted {
656 &body.promoted[index]
661 |body| eval_body_using_ecx(&mut ecx, cid, body, key.param_env)
664 alloc_id: place.ptr.assert_ptr().alloc_id,
668 let err = error_to_const_error(&ecx, error);
669 // errors in statics are always emitted as fatal errors
670 if tcx.is_static(def_id) {
671 // Ensure that if the above error was either `TooGeneric` or `Reported`
672 // an error must be reported.
673 let v = err.report_as_error(ecx.tcx, "could not evaluate static initializer");
674 tcx.sess.delay_span_bug(
676 &format!("static eval failure did not emit an error: {:#?}", v)
679 } else if def_id.is_local() {
680 // constant defined in this crate, we can figure out a lint level!
681 match tcx.def_kind(def_id) {
682 // constants never produce a hard error at the definition site. Anything else is
683 // a backwards compatibility hazard (and will break old versions of winapi for sure)
685 // note that validation may still cause a hard error on this very same constant,
686 // because any code that existed before validation could not have failed validation
687 // thus preventing such a hard error from being a backwards compatibility hazard
688 Some(DefKind::Const) | Some(DefKind::AssocConst) => {
689 let hir_id = tcx.hir().as_local_hir_id(def_id).unwrap();
691 tcx.at(tcx.def_span(def_id)),
692 "any use of this value will cause an error",
697 // promoting runtime code is only allowed to error if it references broken constants
698 // any other kind of error will be reported to the user as a deny-by-default lint
699 _ => if let Some(p) = cid.promoted {
700 use crate::interpret::InvalidProgramInfo::*;
701 let span = tcx.promoted_mir(def_id)[p].span;
702 if let InterpError::InvalidProgram(ReferencedConstant) = err.error {
705 "evaluation of constant expression failed",
710 "reaching this expression at runtime will panic or abort",
711 tcx.hir().as_local_hir_id(def_id).unwrap(),
715 // anything else (array lengths, enum initializers, constant patterns) are reported
720 "evaluation of constant value failed",
725 // use of broken constant from other crate
726 err.report_as_error(ecx.tcx, "could not evaluate constant")