rustc_builtin_macros/deriving/

partial_eq.rs

use rustc_ast::{BinOpKind, BorrowKind, Expr, ExprKind, Mutability, Safety};
use rustc_expand::base::ExtCtxt;
use rustc_span::{Ident, Span, kw, sym};
use thin_vec::thin_vec;

use crate::deriving::generic::*;
use crate::deriving::{call_discriminant_value, path_std};

/// Expands a `#[derive(PartialEq)]` attribute into an implementation for the
/// target item.
pub(crate) fn expand_deriving_partial_eq(
    cx: &ExtCtxt<'_>,
    span: Span,
    item: &ast::Item,
    push: &mut dyn FnMut(Box<ast::Item>),
    is_const: bool,
) {
    let structural_trait_def = TraitDef {
        span,
        path: path_std!(cx, span, marker::StructuralPartialEq),
        skip_path_as_bound: true, // crucial!
        needs_copy_as_bound_if_packed: false,
        // The `StructuralPartialEq` impl must have the *same* bounds as the `PartialEq` impl,
        // or it will apply in situations where it should not, such as in the bug
        // <https://github.com/rust-lang/rust/issues/147714>.
        additional_bounds: smallvec![path_std!(cx, span, cmp::PartialEq)],
        // We really don't support unions, but that's already checked by the impl generated below;
        // a second check here would lead to redundant error messages.
        supports_unions: true,
        methods: SmallVec::new(),
        is_const: false,
        safety: Safety::Default,
        document: true,
    };
    structural_trait_def.expand(cx, item, push);

    // No need to generate `ne`, the default suffices, and not generating it is
    // faster.
    let methods = smallvec![MethodDef {
        name: sym::eq,
        generics: cx.empty_generics(span),
        explicit_self: true,
        nonself_args: smallvec![(cx.ty_self_ref(span), sym::other)],
        has_other_selflike_arg: true,
        ret_ty: cx.ty_path(cx.path_ident(span, Ident::new(sym::bool, span))),
        attributes: thin_vec![cx.attr_word(sym::inline, span)],
        fieldless_variants_strategy: FieldlessVariantsStrategy::Unify,
        combine_substructure: combine_substructure(get_substructure_equality_expr),
    }];

    let trait_def = TraitDef {
        span,
        path: path_std!(cx, span, cmp::PartialEq),
        skip_path_as_bound: false,
        needs_copy_as_bound_if_packed: true,
        additional_bounds: SmallVec::new(),
        supports_unions: false,
        methods,
        is_const,
        safety: Safety::Default,
        document: true,
    };
    trait_def.expand(cx, item, push)
}

/// Generates the equality expression for a struct or enum variant when deriving
/// `PartialEq`.
///
/// This function generates an expression that checks if all fields of a struct
/// or enum variant are equal.
/// - Scalar fields are compared first for efficiency, followed by compound
///   fields.
/// - If there are no fields, returns `true` (fieldless types are always equal).
///
/// Whether a field is considered "scalar" is determined by comparing the symbol
/// of its type to a set of known scalar type symbols (e.g., `i32`, `u8`, etc).
/// This check is based on the type's symbol.
///
/// ### Example 1
/// ```
/// #[derive(PartialEq)]
/// struct i32;
///
/// // Here, `field_2` is of type `i32`, but since it's a user-defined type (not
/// // the primitive), it will not be treated as scalar. The function will still
/// // check equality of `field_2` first because the symbol matches `i32`.
/// #[derive(PartialEq)]
/// struct Struct {
///     field_1: &'static str,
///     field_2: i32,
/// }
/// ```
///
/// ### Example 2
/// ```
/// mod ty {
///     pub type i32 = i32;
/// }
///
/// // Here, `field_2` is of type `ty::i32`, which is a type alias for `i32`.
/// // However, the function will not reorder the fields because the symbol for
/// // `ty::i32` does not match the symbol for the primitive `i32`
/// // ("ty::i32" != "i32").
/// #[derive(PartialEq)]
/// struct Struct {
///     field_1: &'static str,
///     field_2: ty::i32,
/// }
/// ```
///
/// For enums, the discriminant is compared first, then the rest of the fields.
///
/// # Panics
///
/// If called on static or all-fieldless enums/structs, which should not occur
/// during derive expansion.
fn get_substructure_equality_expr(
    cx: &ExtCtxt<'_>,
    span: Span,
    substructure: Substructure<'_>,
) -> BlockOrExpr {
    BlockOrExpr::new_expr(match substructure.fields {
        EnumMatching(.., fields) | Struct(.., fields) => {
            let combine = move |acc, field: &FieldInfo| {
                let rhs = field
                    .other_selflike_expr
                    .as_ref()
                    .expect("not exactly 2 arguments in `derive(PartialEq)`");

                let rhs = cx.expr_binary(
                    field.span,
                    BinOpKind::Eq,
                    wrap_block_expr(cx, peel_refs(&field.self_expr)),
                    wrap_block_expr(cx, peel_refs(rhs)),
                );
                match acc {
                    // Combine the previous comparison with the current field
                    // using logical AND.
                    Some(lhs) => Some(cx.expr_binary(field.span, BinOpKind::And, lhs, rhs)),
                    // Start the chain with the first field's comparison.
                    None => Some(rhs),
                }
            };

            // First compare scalar fields, then compound fields, combining all
            // with logical AND.
            fields
                .iter()
                .filter(|field| field.maybe_scalar)
                .chain(fields.iter().filter(|field| !field.maybe_scalar))
                .fold(None, combine)
                // If there are no fields, treat as always equal.
                .unwrap_or_else(|| cx.expr_bool(span, true))
        }
        EnumDiscr(match_expr) => {
            let self_expr = call_discriminant_value(cx, span, kw::SelfLower);
            let other_selflike_expr = call_discriminant_value(cx, span, sym::other);
            let lhs = cx.expr_binary(span, BinOpKind::Eq, self_expr, other_selflike_expr);
            let Some(match_expr) = match_expr else {
                return BlockOrExpr::new_expr(lhs);
            };
            // Compare the discriminant first (cheaper), then the rest of the
            // fields.
            cx.expr_binary(span, BinOpKind::And, lhs, match_expr)
        }
        _ => cx.dcx().span_bug(span, "unexpected substructure in `derive(PartialEq)`"),
    })
}

/// Removes all leading immutable references from an expression.
///
/// This is used to strip away any number of leading `&` from an expression
/// (e.g., `&&&T` becomes `T`). Only removes immutable references; mutable
/// references are preserved.
fn peel_refs(mut expr: &Box<Expr>) -> Box<Expr> {
    while let ExprKind::AddrOf(BorrowKind::Ref, Mutability::Not, inner) = &expr.kind {
        expr = inner;
    }
    expr.clone()
}

/// Wraps a block expression in parentheses to ensure valid AST in macro
/// expansion output.
///
/// If the given expression is a block, it is wrapped in parentheses; otherwise,
/// it is returned unchanged.
fn wrap_block_expr(cx: &ExtCtxt<'_>, expr: Box<Expr>) -> Box<Expr> {
    if matches!(&expr.kind, ExprKind::Block(..)) {
        return cx.expr_paren(expr.span, expr);
    }
    expr
}