rust/compiler/rustc_pattern_analysis/src/lib.rs

Ignoring revisions in .git-blame-ignore-revs. Click here to bypass and see the normal blame view.

127 lines
4.3 KiB
Rust
Raw Normal View History

//! Analysis of patterns, notably match exhaustiveness checking. The main entrypoint for this crate
//! is [`usefulness::compute_match_usefulness`]. For rustc-specific types and entrypoints, see the
//! [`rustc`] module.
// tidy-alphabetical-start
#![allow(rustc::diagnostic_outside_of_impl)]
#![allow(rustc::untranslatable_diagnostic)]
#![cfg_attr(feature = "rustc", feature(let_chains))]
// tidy-alphabetical-end
pub mod constructor;
#[cfg(feature = "rustc")]
pub mod errors;
#[cfg(feature = "rustc")]
2023-12-11 09:40:31 +00:00
pub(crate) mod lints;
pub mod pat;
pub mod pat_column;
#[cfg(feature = "rustc")]
2023-12-11 19:15:52 +00:00
pub mod rustc;
pub mod usefulness;
#[cfg(feature = "rustc")]
rustc_fluent_macro::fluent_messages! { "../messages.ftl" }
2023-12-11 09:40:31 +00:00
2023-12-11 19:01:02 +00:00
use std::fmt;
pub use rustc_index::{Idx, IndexVec}; // re-exported to avoid rustc_index version issues
use crate::constructor::{Constructor, ConstructorSet, IntRange};
2023-12-11 09:40:31 +00:00
use crate::pat::DeconstructedPat;
2023-12-15 15:53:29 +00:00
pub trait Captures<'a> {}
impl<'a, T: ?Sized> Captures<'a> for T {}
2024-02-28 16:56:01 +00:00
/// `bool` newtype that indicates whether this is a privately uninhabited field that we should skip
/// during analysis.
#[derive(Copy, Clone, Debug, PartialEq, Eq)]
2024-02-28 16:56:01 +00:00
pub struct PrivateUninhabitedField(pub bool);
2023-12-15 15:53:29 +00:00
/// Context that provides type information about constructors.
///
/// Most of the crate is parameterized on a type that implements this trait.
2024-03-13 12:56:06 +00:00
pub trait PatCx: Sized + fmt::Debug {
/// The type of a pattern.
2023-12-22 23:21:27 +00:00
type Ty: Clone + fmt::Debug;
2024-01-07 20:20:16 +00:00
/// Errors that can abort analysis.
type Error: fmt::Debug;
2023-12-11 19:45:34 +00:00
/// The index of an enum variant.
2024-03-30 15:18:18 +00:00
type VariantIdx: Clone + Idx + fmt::Debug;
2023-12-11 19:45:34 +00:00
/// A string literal
2023-12-11 19:01:02 +00:00
type StrLit: Clone + PartialEq + fmt::Debug;
2023-12-15 16:25:11 +00:00
/// Extra data to store in a match arm.
2023-12-11 19:45:34 +00:00
type ArmData: Copy + Clone + fmt::Debug;
/// Extra data to store in a pattern.
type PatData: Clone;
2023-12-11 19:01:02 +00:00
fn is_exhaustive_patterns_feature_on(&self) -> bool;
/// The number of fields for this constructor.
2023-12-22 23:21:27 +00:00
fn ctor_arity(&self, ctor: &Constructor<Self>, ty: &Self::Ty) -> usize;
2023-12-11 19:01:02 +00:00
2024-02-06 02:50:22 +00:00
/// The types of the fields for this constructor. The result must contain `ctor_arity()` fields.
fn ctor_sub_tys<'a>(
&'a self,
ctor: &'a Constructor<Self>,
ty: &'a Self::Ty,
2024-02-28 16:56:01 +00:00
) -> impl Iterator<Item = (Self::Ty, PrivateUninhabitedField)> + ExactSizeIterator + Captures<'a>;
2023-12-11 19:01:02 +00:00
/// The set of all the constructors for `ty`.
///
/// This must follow the invariants of `ConstructorSet`
2023-12-22 23:21:27 +00:00
fn ctors_for_ty(&self, ty: &Self::Ty) -> Result<ConstructorSet<Self>, Self::Error>;
2023-12-11 19:01:02 +00:00
/// Write the name of the variant represented by `pat`. Used for the best-effort `Debug` impl of
/// `DeconstructedPat`. Only invoqued when `pat.ctor()` is `Struct | Variant(_) | UnionField`.
fn write_variant_name(
f: &mut fmt::Formatter<'_>,
2024-03-04 23:16:11 +00:00
ctor: &crate::constructor::Constructor<Self>,
ty: &Self::Ty,
) -> fmt::Result;
2023-12-11 19:01:02 +00:00
/// Raise a bug.
fn bug(&self, fmt: fmt::Arguments<'_>) -> Self::Error;
/// Lint that the range `pat` overlapped with all the ranges in `overlaps_with`, where the range
/// they overlapped over is `overlaps_on`. We only detect singleton overlaps.
/// The default implementation does nothing.
fn lint_overlapping_range_endpoints(
&self,
_pat: &DeconstructedPat<Self>,
_overlaps_on: IntRange,
_overlaps_with: &[&DeconstructedPat<Self>],
) {
}
/// The maximum pattern complexity limit was reached.
fn complexity_exceeded(&self) -> Result<(), Self::Error>;
2024-01-14 21:24:10 +00:00
/// Lint that there is a gap `gap` between `pat` and all of `gapped_with` such that the gap is
/// not matched by another range. If `gapped_with` is empty, then `gap` is `T::MAX`. We only
/// detect singleton gaps.
/// The default implementation does nothing.
fn lint_non_contiguous_range_endpoints(
&self,
_pat: &DeconstructedPat<Self>,
_gap: IntRange,
_gapped_with: &[&DeconstructedPat<Self>],
) {
}
2023-12-11 19:01:02 +00:00
}
2023-12-11 09:40:31 +00:00
/// The arm of a match expression.
#[derive(Debug)]
2024-03-13 12:56:06 +00:00
pub struct MatchArm<'p, Cx: PatCx> {
pub pat: &'p DeconstructedPat<Cx>,
2023-12-11 09:40:31 +00:00
pub has_guard: bool,
2023-12-11 19:45:34 +00:00
pub arm_data: Cx::ArmData,
2023-12-11 09:40:31 +00:00
}
2024-03-13 12:56:06 +00:00
impl<'p, Cx: PatCx> Clone for MatchArm<'p, Cx> {
fn clone(&self) -> Self {
Self { pat: self.pat, has_guard: self.has_guard, arm_data: self.arm_data }
}
}
2024-03-13 12:56:06 +00:00
impl<'p, Cx: PatCx> Copy for MatchArm<'p, Cx> {}