rustc_mir_transform/
trivial_const.rs

1use std::ops::Deref;
2
3use rustc_hir::def::DefKind;
4use rustc_hir::def_id::LocalDefId;
5use rustc_middle::mir::{
6    Body, Const, ConstValue, Operand, Place, RETURN_PLACE, Rvalue, START_BLOCK, StatementKind,
7    TerminatorKind, UnevaluatedConst,
8};
9use rustc_middle::ty::{Ty, TyCtxt, TypeVisitableExt};
10
11/// If the given def is a trivial const, returns the value and type the const evaluates to.
12///
13/// A "trivial const" is a const which can be easily proven to evaluate successfully, and the value
14/// that it evaluates to can be easily found without going through the usual MIR phases for a const.
15///
16/// Currently, we support two forms of trivial const.
17///
18/// The base case is this:
19/// ```
20/// const A: usize = 0;
21/// ```
22/// which has this MIR:
23/// ```text
24/// const A: usize = {
25///     let mut _0: usize;
26///
27///     bb0: {
28///         _0 = const 0_usize;
29///         return;
30///     }
31/// }
32/// ```
33/// Which we recognize by looking for a Body which has a single basic block with a return
34/// terminator and a single statement which assigns an `Operand::Constant(Const::Val)` to the
35/// return place.
36/// This scenario meets the required criteria because:
37/// * Control flow cannot panic, we don't have any calls or assert terminators
38/// * The value of the const is already computed, so it cannot fail
39///
40/// In addition to assignment of literals, assignments of trivial consts are also considered
41/// trivial consts. In this case, both `A` and `B` are trivial:
42/// ```
43/// const A: usize = 0;
44/// const B: usize = A;
45/// ```
46pub(crate) fn trivial_const<'a, 'tcx: 'a, F, B>(
47    tcx: TyCtxt<'tcx>,
48    def: LocalDefId,
49    body_provider: F,
50) -> Option<(ConstValue, Ty<'tcx>)>
51where
52    F: FnOnce() -> B,
53    B: Deref<Target = Body<'tcx>>,
54{
55    if !matches!(tcx.def_kind(def), DefKind::AssocConst | DefKind::Const | DefKind::AnonConst) {
56        return None;
57    }
58
59    let body = body_provider();
60
61    if body.has_opaque_types() {
62        return None;
63    }
64
65    if body.basic_blocks.len() != 1 {
66        return None;
67    }
68
69    let block = &body.basic_blocks[START_BLOCK];
70    if block.statements.len() != 1 {
71        return None;
72    }
73
74    if block.terminator().kind != TerminatorKind::Return {
75        return None;
76    }
77
78    let StatementKind::Assign(box (place, rvalue)) = &block.statements[0].kind else {
79        return None;
80    };
81
82    if *place != Place::from(RETURN_PLACE) {
83        return None;
84    }
85
86    let Rvalue::Use(Operand::Constant(c)) = rvalue else {
87        return None;
88    };
89    match c.const_ {
90        Const::Ty(..) => None,
91        Const::Unevaluated(UnevaluatedConst { def, args, .. }, _ty) => {
92            if !args.is_empty() {
93                return None;
94            }
95            tcx.trivial_const(def)
96        }
97        Const::Val(v, ty) => Some((v, ty)),
98    }
99}
100
101// The query provider is based on calling the free function trivial_const, which calls mir_built,
102// which internally has a fast-path for trivial consts so it too calls trivial_const. This isn't
103// recursive, but we are checking if the const is trivial twice. A better design might detect
104// trivial consts before getting to MIR, which would hopefully straighten this out.
105pub(crate) fn trivial_const_provider<'tcx>(
106    tcx: TyCtxt<'tcx>,
107    def: LocalDefId,
108) -> Option<(ConstValue, Ty<'tcx>)> {
109    trivial_const(tcx, def, || tcx.mir_built(def).borrow())
110}
rustc_mir_transform/trivial_const.rs

rustc_mir_transform/
trivial_const.rs
