1 use crate::consts::constant_simple;
2 use crate::macros::macro_backtrace;
3 use crate::source::snippet_opt;
4 use rustc_ast::ast::InlineAsmTemplatePiece;
5 use rustc_data_structures::fx::FxHasher;
6 use rustc_hir::def::Res;
7 use rustc_hir::HirIdMap;
9 ArrayLen, BinOpKind, Block, BodyId, Expr, ExprField, ExprKind, FnRetTy, GenericArg, GenericArgs, Guard, HirId,
10 InlineAsmOperand, Let, Lifetime, LifetimeName, ParamName, Pat, PatField, PatKind, Path, PathSegment, QPath, Stmt,
11 StmtKind, Ty, TyKind, TypeBinding,
13 use rustc_lexer::{tokenize, TokenKind};
14 use rustc_lint::LateContext;
15 use rustc_middle::ty::TypeckResults;
16 use rustc_span::{sym, Symbol};
17 use std::hash::{Hash, Hasher};
19 /// Type used to check whether two ast are the same. This is different from the
20 /// operator `==` on ast types as this operator would compare true equality with
23 /// Note that some expressions kinds are not considered but could be added.
24 pub struct SpanlessEq<'a, 'tcx> {
25 /// Context used to evaluate constant expressions.
26 cx: &'a LateContext<'tcx>,
27 maybe_typeck_results: Option<(&'tcx TypeckResults<'tcx>, &'tcx TypeckResults<'tcx>)>,
28 allow_side_effects: bool,
29 expr_fallback: Option<Box<dyn FnMut(&Expr<'_>, &Expr<'_>) -> bool + 'a>>,
32 impl<'a, 'tcx> SpanlessEq<'a, 'tcx> {
33 pub fn new(cx: &'a LateContext<'tcx>) -> Self {
36 maybe_typeck_results: cx.maybe_typeck_results().map(|x| (x, x)),
37 allow_side_effects: true,
42 /// Consider expressions containing potential side effects as not equal.
44 pub fn deny_side_effects(self) -> Self {
46 allow_side_effects: false,
52 pub fn expr_fallback(self, expr_fallback: impl FnMut(&Expr<'_>, &Expr<'_>) -> bool + 'a) -> Self {
54 expr_fallback: Some(Box::new(expr_fallback)),
59 /// Use this method to wrap comparisons that may involve inter-expression context.
60 /// See `self.locals`.
61 pub fn inter_expr(&mut self) -> HirEqInterExpr<'_, 'a, 'tcx> {
64 locals: HirIdMap::default(),
68 pub fn eq_block(&mut self, left: &Block<'_>, right: &Block<'_>) -> bool {
69 !self.cannot_be_compared_block(left)
70 && !self.cannot_be_compared_block(right)
71 && self.inter_expr().eq_block(left, right)
74 pub fn eq_expr(&mut self, left: &Expr<'_>, right: &Expr<'_>) -> bool {
75 self.inter_expr().eq_expr(left, right)
78 pub fn eq_path(&mut self, left: &Path<'_>, right: &Path<'_>) -> bool {
79 self.inter_expr().eq_path(left, right)
82 pub fn eq_path_segment(&mut self, left: &PathSegment<'_>, right: &PathSegment<'_>) -> bool {
83 self.inter_expr().eq_path_segment(left, right)
86 pub fn eq_path_segments(&mut self, left: &[PathSegment<'_>], right: &[PathSegment<'_>]) -> bool {
87 self.inter_expr().eq_path_segments(left, right)
90 fn cannot_be_compared_block(&mut self, block: &Block<'_>) -> bool {
91 if block.stmts.last().map_or(false, |stmt| {
94 StmtKind::Semi(semi_expr) if self.should_ignore(semi_expr)
100 if let Some(block_expr) = block.expr
101 && self.should_ignore(block_expr)
109 fn should_ignore(&mut self, expr: &Expr<'_>) -> bool {
110 if macro_backtrace(expr.span).last().map_or(false, |macro_call| {
112 &self.cx.tcx.get_diagnostic_name(macro_call.def_id),
113 Some(sym::todo_macro | sym::unimplemented_macro)
123 pub struct HirEqInterExpr<'a, 'b, 'tcx> {
124 inner: &'a mut SpanlessEq<'b, 'tcx>,
126 // When binding are declared, the binding ID in the left expression is mapped to the one on the
127 // right. For example, when comparing `{ let x = 1; x + 2 }` and `{ let y = 1; y + 2 }`,
128 // these blocks are considered equal since `x` is mapped to `y`.
129 pub locals: HirIdMap<HirId>,
132 impl HirEqInterExpr<'_, '_, '_> {
133 pub fn eq_stmt(&mut self, left: &Stmt<'_>, right: &Stmt<'_>) -> bool {
134 match (&left.kind, &right.kind) {
135 (&StmtKind::Local(l), &StmtKind::Local(r)) => {
136 // This additional check ensures that the type of the locals are equivalent even if the init
137 // expression or type have some inferred parts.
138 if let Some((typeck_lhs, typeck_rhs)) = self.inner.maybe_typeck_results {
139 let l_ty = typeck_lhs.pat_ty(l.pat);
140 let r_ty = typeck_rhs.pat_ty(r.pat);
146 // eq_pat adds the HirIds to the locals map. We therefor call it last to make sure that
147 // these only get added if the init and type is equal.
148 both(&l.init, &r.init, |l, r| self.eq_expr(l, r))
149 && both(&l.ty, &r.ty, |l, r| self.eq_ty(l, r))
150 && self.eq_pat(l.pat, r.pat)
152 (&StmtKind::Expr(l), &StmtKind::Expr(r)) | (&StmtKind::Semi(l), &StmtKind::Semi(r)) => self.eq_expr(l, r),
157 /// Checks whether two blocks are the same.
158 fn eq_block(&mut self, left: &Block<'_>, right: &Block<'_>) -> bool {
159 match (left.stmts, left.expr, right.stmts, right.expr) {
160 ([], None, [], None) => {
161 // For empty blocks, check to see if the tokens are equal. This will catch the case where a macro
162 // expanded to nothing, or the cfg attribute was used.
163 let (left, right) = match (
164 snippet_opt(self.inner.cx, left.span),
165 snippet_opt(self.inner.cx, right.span),
167 (Some(left), Some(right)) => (left, right),
170 let mut left_pos = 0;
171 let left = tokenize(&left)
173 let end = left_pos + t.len;
174 let s = &left[left_pos..end];
181 TokenKind::LineComment { .. } | TokenKind::BlockComment { .. } | TokenKind::Whitespace
185 let mut right_pos = 0;
186 let right = tokenize(&right)
188 let end = right_pos + t.len;
189 let s = &right[right_pos..end];
196 TokenKind::LineComment { .. } | TokenKind::BlockComment { .. } | TokenKind::Whitespace
203 over(left.stmts, right.stmts, |l, r| self.eq_stmt(l, r))
204 && both(&left.expr, &right.expr, |l, r| self.eq_expr(l, r))
209 pub fn eq_array_length(&mut self, left: ArrayLen, right: ArrayLen) -> bool {
210 match (left, right) {
211 (ArrayLen::Infer(..), ArrayLen::Infer(..)) => true,
212 (ArrayLen::Body(l_ct), ArrayLen::Body(r_ct)) => self.eq_body(l_ct.body, r_ct.body),
217 pub fn eq_body(&mut self, left: BodyId, right: BodyId) -> bool {
218 // swap out TypeckResults when hashing a body
219 let old_maybe_typeck_results = self.inner.maybe_typeck_results.replace((
220 self.inner.cx.tcx.typeck_body(left),
221 self.inner.cx.tcx.typeck_body(right),
223 let res = self.eq_expr(
224 &self.inner.cx.tcx.hir().body(left).value,
225 &self.inner.cx.tcx.hir().body(right).value,
227 self.inner.maybe_typeck_results = old_maybe_typeck_results;
231 #[expect(clippy::similar_names)]
232 pub fn eq_expr(&mut self, left: &Expr<'_>, right: &Expr<'_>) -> bool {
233 if !self.inner.allow_side_effects && left.span.ctxt() != right.span.ctxt() {
237 if let Some((typeck_lhs, typeck_rhs)) = self.inner.maybe_typeck_results {
238 if let (Some(l), Some(r)) = (
239 constant_simple(self.inner.cx, typeck_lhs, left),
240 constant_simple(self.inner.cx, typeck_rhs, right),
249 reduce_exprkind(self.inner.cx, &left.kind),
250 reduce_exprkind(self.inner.cx, &right.kind),
252 (&ExprKind::AddrOf(lb, l_mut, le), &ExprKind::AddrOf(rb, r_mut, re)) => {
253 lb == rb && l_mut == r_mut && self.eq_expr(le, re)
255 (&ExprKind::Continue(li), &ExprKind::Continue(ri)) => {
256 both(&li.label, &ri.label, |l, r| l.ident.name == r.ident.name)
258 (&ExprKind::Assign(ll, lr, _), &ExprKind::Assign(rl, rr, _)) => {
259 self.inner.allow_side_effects && self.eq_expr(ll, rl) && self.eq_expr(lr, rr)
261 (&ExprKind::AssignOp(ref lo, ll, lr), &ExprKind::AssignOp(ref ro, rl, rr)) => {
262 self.inner.allow_side_effects && lo.node == ro.node && self.eq_expr(ll, rl) && self.eq_expr(lr, rr)
264 (&ExprKind::Block(l, _), &ExprKind::Block(r, _)) => self.eq_block(l, r),
265 (&ExprKind::Binary(l_op, ll, lr), &ExprKind::Binary(r_op, rl, rr)) => {
266 l_op.node == r_op.node && self.eq_expr(ll, rl) && self.eq_expr(lr, rr)
267 || swap_binop(l_op.node, ll, lr).map_or(false, |(l_op, ll, lr)| {
268 l_op == r_op.node && self.eq_expr(ll, rl) && self.eq_expr(lr, rr)
271 (&ExprKind::Break(li, ref le), &ExprKind::Break(ri, ref re)) => {
272 both(&li.label, &ri.label, |l, r| l.ident.name == r.ident.name)
273 && both(le, re, |l, r| self.eq_expr(l, r))
275 (&ExprKind::Box(l), &ExprKind::Box(r)) => self.eq_expr(l, r),
276 (&ExprKind::Call(l_fun, l_args), &ExprKind::Call(r_fun, r_args)) => {
277 self.inner.allow_side_effects && self.eq_expr(l_fun, r_fun) && self.eq_exprs(l_args, r_args)
279 (&ExprKind::Cast(lx, lt), &ExprKind::Cast(rx, rt)) | (&ExprKind::Type(lx, lt), &ExprKind::Type(rx, rt)) => {
280 self.eq_expr(lx, rx) && self.eq_ty(lt, rt)
282 (&ExprKind::Field(l_f_exp, ref l_f_ident), &ExprKind::Field(r_f_exp, ref r_f_ident)) => {
283 l_f_ident.name == r_f_ident.name && self.eq_expr(l_f_exp, r_f_exp)
285 (&ExprKind::Index(la, li), &ExprKind::Index(ra, ri)) => self.eq_expr(la, ra) && self.eq_expr(li, ri),
286 (&ExprKind::If(lc, lt, ref le), &ExprKind::If(rc, rt, ref re)) => {
287 self.eq_expr(lc, rc) && self.eq_expr(lt, rt) && both(le, re, |l, r| self.eq_expr(l, r))
289 (&ExprKind::Let(l), &ExprKind::Let(r)) => {
290 self.eq_pat(l.pat, r.pat) && both(&l.ty, &r.ty, |l, r| self.eq_ty(l, r)) && self.eq_expr(l.init, r.init)
292 (&ExprKind::Lit(ref l), &ExprKind::Lit(ref r)) => l.node == r.node,
293 (&ExprKind::Loop(lb, ref ll, ref lls, _), &ExprKind::Loop(rb, ref rl, ref rls, _)) => {
294 lls == rls && self.eq_block(lb, rb) && both(ll, rl, |l, r| l.ident.name == r.ident.name)
296 (&ExprKind::Match(le, la, ref ls), &ExprKind::Match(re, ra, ref rs)) => {
298 && self.eq_expr(le, re)
299 && over(la, ra, |l, r| {
300 self.eq_pat(l.pat, r.pat)
301 && both(&l.guard, &r.guard, |l, r| self.eq_guard(l, r))
302 && self.eq_expr(l.body, r.body)
305 (&ExprKind::MethodCall(l_path, l_args, _), &ExprKind::MethodCall(r_path, r_args, _)) => {
306 self.inner.allow_side_effects && self.eq_path_segment(l_path, r_path) && self.eq_exprs(l_args, r_args)
308 (&ExprKind::Repeat(le, ll), &ExprKind::Repeat(re, rl)) => {
309 self.eq_expr(le, re) && self.eq_array_length(ll, rl)
311 (&ExprKind::Ret(ref l), &ExprKind::Ret(ref r)) => both(l, r, |l, r| self.eq_expr(l, r)),
312 (&ExprKind::Path(ref l), &ExprKind::Path(ref r)) => self.eq_qpath(l, r),
313 (&ExprKind::Struct(l_path, lf, ref lo), &ExprKind::Struct(r_path, rf, ref ro)) => {
314 self.eq_qpath(l_path, r_path)
315 && both(lo, ro, |l, r| self.eq_expr(l, r))
316 && over(lf, rf, |l, r| self.eq_expr_field(l, r))
318 (&ExprKind::Tup(l_tup), &ExprKind::Tup(r_tup)) => self.eq_exprs(l_tup, r_tup),
319 (&ExprKind::Unary(l_op, le), &ExprKind::Unary(r_op, re)) => l_op == r_op && self.eq_expr(le, re),
320 (&ExprKind::Array(l), &ExprKind::Array(r)) => self.eq_exprs(l, r),
321 (&ExprKind::DropTemps(le), &ExprKind::DropTemps(re)) => self.eq_expr(le, re),
324 is_eq || self.inner.expr_fallback.as_mut().map_or(false, |f| f(left, right))
327 fn eq_exprs(&mut self, left: &[Expr<'_>], right: &[Expr<'_>]) -> bool {
328 over(left, right, |l, r| self.eq_expr(l, r))
331 fn eq_expr_field(&mut self, left: &ExprField<'_>, right: &ExprField<'_>) -> bool {
332 left.ident.name == right.ident.name && self.eq_expr(left.expr, right.expr)
335 fn eq_guard(&mut self, left: &Guard<'_>, right: &Guard<'_>) -> bool {
336 match (left, right) {
337 (Guard::If(l), Guard::If(r)) => self.eq_expr(l, r),
338 (Guard::IfLet(l), Guard::IfLet(r)) => {
339 self.eq_pat(l.pat, r.pat) && both(&l.ty, &r.ty, |l, r| self.eq_ty(l, r)) && self.eq_expr(l.init, r.init)
345 fn eq_generic_arg(&mut self, left: &GenericArg<'_>, right: &GenericArg<'_>) -> bool {
346 match (left, right) {
347 (GenericArg::Const(l), GenericArg::Const(r)) => self.eq_body(l.value.body, r.value.body),
348 (GenericArg::Lifetime(l_lt), GenericArg::Lifetime(r_lt)) => Self::eq_lifetime(l_lt, r_lt),
349 (GenericArg::Type(l_ty), GenericArg::Type(r_ty)) => self.eq_ty(l_ty, r_ty),
350 (GenericArg::Infer(l_inf), GenericArg::Infer(r_inf)) => self.eq_ty(&l_inf.to_ty(), &r_inf.to_ty()),
355 fn eq_lifetime(left: &Lifetime, right: &Lifetime) -> bool {
356 left.name == right.name
359 fn eq_pat_field(&mut self, left: &PatField<'_>, right: &PatField<'_>) -> bool {
360 let (PatField { ident: li, pat: lp, .. }, PatField { ident: ri, pat: rp, .. }) = (&left, &right);
361 li.name == ri.name && self.eq_pat(lp, rp)
364 /// Checks whether two patterns are the same.
365 fn eq_pat(&mut self, left: &Pat<'_>, right: &Pat<'_>) -> bool {
366 match (&left.kind, &right.kind) {
367 (&PatKind::Box(l), &PatKind::Box(r)) => self.eq_pat(l, r),
368 (&PatKind::Struct(ref lp, la, ..), &PatKind::Struct(ref rp, ra, ..)) => {
369 self.eq_qpath(lp, rp) && over(la, ra, |l, r| self.eq_pat_field(l, r))
371 (&PatKind::TupleStruct(ref lp, la, ls), &PatKind::TupleStruct(ref rp, ra, rs)) => {
372 self.eq_qpath(lp, rp) && over(la, ra, |l, r| self.eq_pat(l, r)) && ls == rs
374 (&PatKind::Binding(lb, li, _, ref lp), &PatKind::Binding(rb, ri, _, ref rp)) => {
375 let eq = lb == rb && both(lp, rp, |l, r| self.eq_pat(l, r));
377 self.locals.insert(li, ri);
381 (&PatKind::Path(ref l), &PatKind::Path(ref r)) => self.eq_qpath(l, r),
382 (&PatKind::Lit(l), &PatKind::Lit(r)) => self.eq_expr(l, r),
383 (&PatKind::Tuple(l, ls), &PatKind::Tuple(r, rs)) => ls == rs && over(l, r, |l, r| self.eq_pat(l, r)),
384 (&PatKind::Range(ref ls, ref le, li), &PatKind::Range(ref rs, ref re, ri)) => {
385 both(ls, rs, |a, b| self.eq_expr(a, b)) && both(le, re, |a, b| self.eq_expr(a, b)) && (li == ri)
387 (&PatKind::Ref(le, ref lm), &PatKind::Ref(re, ref rm)) => lm == rm && self.eq_pat(le, re),
388 (&PatKind::Slice(ls, ref li, le), &PatKind::Slice(rs, ref ri, re)) => {
389 over(ls, rs, |l, r| self.eq_pat(l, r))
390 && over(le, re, |l, r| self.eq_pat(l, r))
391 && both(li, ri, |l, r| self.eq_pat(l, r))
393 (&PatKind::Wild, &PatKind::Wild) => true,
398 #[expect(clippy::similar_names)]
399 fn eq_qpath(&mut self, left: &QPath<'_>, right: &QPath<'_>) -> bool {
400 match (left, right) {
401 (&QPath::Resolved(ref lty, lpath), &QPath::Resolved(ref rty, rpath)) => {
402 both(lty, rty, |l, r| self.eq_ty(l, r)) && self.eq_path(lpath, rpath)
404 (&QPath::TypeRelative(lty, lseg), &QPath::TypeRelative(rty, rseg)) => {
405 self.eq_ty(lty, rty) && self.eq_path_segment(lseg, rseg)
407 (&QPath::LangItem(llang_item, ..), &QPath::LangItem(rlang_item, ..)) => llang_item == rlang_item,
412 pub fn eq_path(&mut self, left: &Path<'_>, right: &Path<'_>) -> bool {
413 match (left.res, right.res) {
414 (Res::Local(l), Res::Local(r)) => l == r || self.locals.get(&l) == Some(&r),
415 (Res::Local(_), _) | (_, Res::Local(_)) => false,
416 _ => over(left.segments, right.segments, |l, r| self.eq_path_segment(l, r)),
420 fn eq_path_parameters(&mut self, left: &GenericArgs<'_>, right: &GenericArgs<'_>) -> bool {
421 if !(left.parenthesized || right.parenthesized) {
422 over(left.args, right.args, |l, r| self.eq_generic_arg(l, r)) // FIXME(flip1995): may not work
423 && over(left.bindings, right.bindings, |l, r| self.eq_type_binding(l, r))
424 } else if left.parenthesized && right.parenthesized {
425 over(left.inputs(), right.inputs(), |l, r| self.eq_ty(l, r))
426 && both(&Some(&left.bindings[0].ty()), &Some(&right.bindings[0].ty()), |l, r| {
434 pub fn eq_path_segments(&mut self, left: &[PathSegment<'_>], right: &[PathSegment<'_>]) -> bool {
435 left.len() == right.len() && left.iter().zip(right).all(|(l, r)| self.eq_path_segment(l, r))
438 pub fn eq_path_segment(&mut self, left: &PathSegment<'_>, right: &PathSegment<'_>) -> bool {
439 // The == of idents doesn't work with different contexts,
440 // we have to be explicit about hygiene
441 left.ident.name == right.ident.name && both(&left.args, &right.args, |l, r| self.eq_path_parameters(l, r))
444 pub fn eq_ty(&mut self, left: &Ty<'_>, right: &Ty<'_>) -> bool {
445 match (&left.kind, &right.kind) {
446 (&TyKind::Slice(l_vec), &TyKind::Slice(r_vec)) => self.eq_ty(l_vec, r_vec),
447 (&TyKind::Array(lt, ll), &TyKind::Array(rt, rl)) => self.eq_ty(lt, rt) && self.eq_array_length(ll, rl),
448 (&TyKind::Ptr(ref l_mut), &TyKind::Ptr(ref r_mut)) => {
449 l_mut.mutbl == r_mut.mutbl && self.eq_ty(l_mut.ty, r_mut.ty)
451 (&TyKind::Rptr(_, ref l_rmut), &TyKind::Rptr(_, ref r_rmut)) => {
452 l_rmut.mutbl == r_rmut.mutbl && self.eq_ty(l_rmut.ty, r_rmut.ty)
454 (&TyKind::Path(ref l), &TyKind::Path(ref r)) => self.eq_qpath(l, r),
455 (&TyKind::Tup(l), &TyKind::Tup(r)) => over(l, r, |l, r| self.eq_ty(l, r)),
456 (&TyKind::Infer, &TyKind::Infer) => true,
461 fn eq_type_binding(&mut self, left: &TypeBinding<'_>, right: &TypeBinding<'_>) -> bool {
462 left.ident.name == right.ident.name && self.eq_ty(left.ty(), right.ty())
466 /// Some simple reductions like `{ return }` => `return`
467 fn reduce_exprkind<'hir>(cx: &LateContext<'_>, kind: &'hir ExprKind<'hir>) -> &'hir ExprKind<'hir> {
468 if let ExprKind::Block(block, _) = kind {
469 match (block.stmts, block.expr) {
470 // From an `if let` expression without an `else` block. The arm for the implicit wild pattern is an empty
471 // block with an empty span.
472 ([], None) if block.span.is_empty() => &ExprKind::Tup(&[]),
474 ([], None) => match snippet_opt(cx, block.span) {
475 // Don't reduce if there are any tokens contained in the braces
482 TokenKind::LineComment { .. } | TokenKind::BlockComment { .. } | TokenKind::Whitespace
485 .ne([TokenKind::OpenBrace, TokenKind::CloseBrace].iter().copied()) =>
489 _ => &ExprKind::Tup(&[]),
491 ([], Some(expr)) => match expr.kind {
492 // `{ return .. }` => `return ..`
493 ExprKind::Ret(..) => &expr.kind,
496 ([stmt], None) => match stmt.kind {
497 StmtKind::Expr(expr) | StmtKind::Semi(expr) => match expr.kind {
498 // `{ return ..; }` => `return ..`
499 ExprKind::Ret(..) => &expr.kind,
515 ) -> Option<(BinOpKind, &'a Expr<'a>, &'a Expr<'a>)> {
517 BinOpKind::Add | BinOpKind::Eq | BinOpKind::Ne | BinOpKind::BitAnd | BinOpKind::BitXor | BinOpKind::BitOr => {
518 Some((binop, rhs, lhs))
520 BinOpKind::Lt => Some((BinOpKind::Gt, rhs, lhs)),
521 BinOpKind::Le => Some((BinOpKind::Ge, rhs, lhs)),
522 BinOpKind::Ge => Some((BinOpKind::Le, rhs, lhs)),
523 BinOpKind::Gt => Some((BinOpKind::Lt, rhs, lhs)),
524 BinOpKind::Mul // Not always commutative, e.g. with matrices. See issue #5698
531 | BinOpKind::Or => None,
535 /// Checks if the two `Option`s are both `None` or some equal values as per
537 pub fn both<X>(l: &Option<X>, r: &Option<X>, mut eq_fn: impl FnMut(&X, &X) -> bool) -> bool {
539 .map_or_else(|| r.is_none(), |x| r.as_ref().map_or(false, |y| eq_fn(x, y)))
542 /// Checks if two slices are equal as per `eq_fn`.
543 pub fn over<X>(left: &[X], right: &[X], mut eq_fn: impl FnMut(&X, &X) -> bool) -> bool {
544 left.len() == right.len() && left.iter().zip(right).all(|(x, y)| eq_fn(x, y))
547 /// Counts how many elements of the slices are equal as per `eq_fn`.
548 pub fn count_eq<X: Sized>(
549 left: &mut dyn Iterator<Item = X>,
550 right: &mut dyn Iterator<Item = X>,
551 mut eq_fn: impl FnMut(&X, &X) -> bool,
553 left.zip(right).take_while(|(l, r)| eq_fn(l, r)).count()
556 /// Checks if two expressions evaluate to the same value, and don't contain any side effects.
557 pub fn eq_expr_value(cx: &LateContext<'_>, left: &Expr<'_>, right: &Expr<'_>) -> bool {
558 SpanlessEq::new(cx).deny_side_effects().eq_expr(left, right)
561 /// Type used to hash an ast element. This is different from the `Hash` trait
562 /// on ast types as this
563 /// trait would consider IDs and spans.
565 /// All expressions kind are hashed, but some might have a weaker hash.
566 pub struct SpanlessHash<'a, 'tcx> {
567 /// Context used to evaluate constant expressions.
568 cx: &'a LateContext<'tcx>,
569 maybe_typeck_results: Option<&'tcx TypeckResults<'tcx>>,
573 impl<'a, 'tcx> SpanlessHash<'a, 'tcx> {
574 pub fn new(cx: &'a LateContext<'tcx>) -> Self {
577 maybe_typeck_results: cx.maybe_typeck_results(),
578 s: FxHasher::default(),
582 pub fn finish(self) -> u64 {
586 pub fn hash_block(&mut self, b: &Block<'_>) {
591 if let Some(e) = b.expr {
595 std::mem::discriminant(&b.rules).hash(&mut self.s);
598 #[expect(clippy::too_many_lines)]
599 pub fn hash_expr(&mut self, e: &Expr<'_>) {
600 let simple_const = self
601 .maybe_typeck_results
602 .and_then(|typeck_results| constant_simple(self.cx, typeck_results, e));
604 // const hashing may result in the same hash as some unrelated node, so add a sort of
605 // discriminant depending on which path we're choosing next
606 simple_const.hash(&mut self.s);
607 if simple_const.is_some() {
611 std::mem::discriminant(&e.kind).hash(&mut self.s);
614 ExprKind::AddrOf(kind, m, e) => {
615 std::mem::discriminant(&kind).hash(&mut self.s);
619 ExprKind::Continue(i) => {
620 if let Some(i) = i.label {
621 self.hash_name(i.ident.name);
624 ExprKind::Assign(l, r, _) => {
628 ExprKind::AssignOp(ref o, l, r) => {
629 std::mem::discriminant(&o.node).hash(&mut self.s);
633 ExprKind::Block(b, _) => {
636 ExprKind::Binary(op, l, r) => {
637 std::mem::discriminant(&op.node).hash(&mut self.s);
641 ExprKind::Break(i, ref j) => {
642 if let Some(i) = i.label {
643 self.hash_name(i.ident.name);
645 if let Some(j) = *j {
649 ExprKind::Box(e) | ExprKind::DropTemps(e) | ExprKind::Yield(e, _) => {
652 ExprKind::Call(fun, args) => {
654 self.hash_exprs(args);
656 ExprKind::Cast(e, ty) | ExprKind::Type(e, ty) => {
660 ExprKind::Closure(cap, _, eid, _, _) => {
661 std::mem::discriminant(&cap).hash(&mut self.s);
662 // closures inherit TypeckResults
663 self.hash_expr(&self.cx.tcx.hir().body(eid).value);
665 ExprKind::Field(e, ref f) => {
667 self.hash_name(f.name);
669 ExprKind::Index(a, i) => {
673 ExprKind::InlineAsm(asm) => {
674 for piece in asm.template {
676 InlineAsmTemplatePiece::String(s) => s.hash(&mut self.s),
677 InlineAsmTemplatePiece::Placeholder {
682 operand_idx.hash(&mut self.s);
683 modifier.hash(&mut self.s);
687 asm.options.hash(&mut self.s);
688 for (op, _op_sp) in asm.operands {
690 InlineAsmOperand::In { reg, expr } => {
691 reg.hash(&mut self.s);
692 self.hash_expr(expr);
694 InlineAsmOperand::Out { reg, late, expr } => {
695 reg.hash(&mut self.s);
696 late.hash(&mut self.s);
697 if let Some(expr) = expr {
698 self.hash_expr(expr);
701 InlineAsmOperand::InOut { reg, late, expr } => {
702 reg.hash(&mut self.s);
703 late.hash(&mut self.s);
704 self.hash_expr(expr);
706 InlineAsmOperand::SplitInOut {
712 reg.hash(&mut self.s);
713 late.hash(&mut self.s);
714 self.hash_expr(in_expr);
715 if let Some(out_expr) = out_expr {
716 self.hash_expr(out_expr);
719 InlineAsmOperand::Const { anon_const } | InlineAsmOperand::SymFn { anon_const } => {
720 self.hash_body(anon_const.body);
722 InlineAsmOperand::SymStatic { path, def_id: _ } => self.hash_qpath(path),
726 ExprKind::Let(Let { pat, init, ty, .. }) => {
727 self.hash_expr(init);
728 if let Some(ty) = ty {
734 ExprKind::Lit(ref l) => {
735 l.node.hash(&mut self.s);
737 ExprKind::Loop(b, ref i, ..) => {
739 if let Some(i) = *i {
740 self.hash_name(i.ident.name);
743 ExprKind::If(cond, then, ref else_opt) => {
744 self.hash_expr(cond);
745 self.hash_expr(then);
746 if let Some(e) = *else_opt {
750 ExprKind::Match(e, arms, ref s) => {
754 self.hash_pat(arm.pat);
755 if let Some(ref e) = arm.guard {
758 self.hash_expr(arm.body);
763 ExprKind::MethodCall(path, args, ref _fn_span) => {
764 self.hash_name(path.ident.name);
765 self.hash_exprs(args);
767 ExprKind::ConstBlock(ref l_id) => {
768 self.hash_body(l_id.body);
770 ExprKind::Repeat(e, len) => {
772 self.hash_array_length(len);
774 ExprKind::Ret(ref e) => {
775 if let Some(e) = *e {
779 ExprKind::Path(ref qpath) => {
780 self.hash_qpath(qpath);
782 ExprKind::Struct(path, fields, ref expr) => {
783 self.hash_qpath(path);
786 self.hash_name(f.ident.name);
787 self.hash_expr(f.expr);
790 if let Some(e) = *expr {
794 ExprKind::Tup(tup) => {
795 self.hash_exprs(tup);
797 ExprKind::Array(v) => {
800 ExprKind::Unary(lop, le) => {
801 std::mem::discriminant(&lop).hash(&mut self.s);
807 pub fn hash_exprs(&mut self, e: &[Expr<'_>]) {
813 pub fn hash_name(&mut self, n: Symbol) {
817 pub fn hash_qpath(&mut self, p: &QPath<'_>) {
819 QPath::Resolved(_, path) => {
820 self.hash_path(path);
822 QPath::TypeRelative(_, path) => {
823 self.hash_name(path.ident.name);
825 QPath::LangItem(lang_item, ..) => {
826 std::mem::discriminant(&lang_item).hash(&mut self.s);
829 // self.maybe_typeck_results.unwrap().qpath_res(p, id).hash(&mut self.s);
832 pub fn hash_pat(&mut self, pat: &Pat<'_>) {
833 std::mem::discriminant(&pat.kind).hash(&mut self.s);
835 PatKind::Binding(ann, _, _, pat) => {
836 std::mem::discriminant(&ann).hash(&mut self.s);
837 if let Some(pat) = pat {
841 PatKind::Box(pat) => self.hash_pat(pat),
842 PatKind::Lit(expr) => self.hash_expr(expr),
843 PatKind::Or(pats) => {
848 PatKind::Path(ref qpath) => self.hash_qpath(qpath),
849 PatKind::Range(s, e, i) => {
856 std::mem::discriminant(&i).hash(&mut self.s);
858 PatKind::Ref(pat, mu) => {
860 std::mem::discriminant(&mu).hash(&mut self.s);
862 PatKind::Slice(l, m, r) => {
866 if let Some(pat) = m {
873 PatKind::Struct(ref qpath, fields, e) => {
874 self.hash_qpath(qpath);
876 self.hash_name(f.ident.name);
877 self.hash_pat(f.pat);
881 PatKind::Tuple(pats, e) => {
887 PatKind::TupleStruct(ref qpath, pats, e) => {
888 self.hash_qpath(qpath);
898 pub fn hash_path(&mut self, path: &Path<'_>) {
900 // constant hash since equality is dependant on inter-expression context
901 // e.g. The expressions `if let Some(x) = foo() {}` and `if let Some(y) = foo() {}` are considered equal
902 // even though the binding names are different and they have different `HirId`s.
903 Res::Local(_) => 1_usize.hash(&mut self.s),
905 for seg in path.segments {
906 self.hash_name(seg.ident.name);
907 self.hash_generic_args(seg.args().args);
913 pub fn hash_stmt(&mut self, b: &Stmt<'_>) {
914 std::mem::discriminant(&b.kind).hash(&mut self.s);
917 StmtKind::Local(local) => {
918 self.hash_pat(local.pat);
919 if let Some(init) = local.init {
920 self.hash_expr(init);
923 StmtKind::Item(..) => {},
924 StmtKind::Expr(expr) | StmtKind::Semi(expr) => {
925 self.hash_expr(expr);
930 pub fn hash_guard(&mut self, g: &Guard<'_>) {
932 Guard::If(expr) | Guard::IfLet(Let { init: expr, .. }) => {
933 self.hash_expr(expr);
938 pub fn hash_lifetime(&mut self, lifetime: Lifetime) {
939 std::mem::discriminant(&lifetime.name).hash(&mut self.s);
940 if let LifetimeName::Param(param_id, ref name) = lifetime.name {
941 std::mem::discriminant(name).hash(&mut self.s);
942 param_id.hash(&mut self.s);
944 ParamName::Plain(ref ident) => {
945 ident.name.hash(&mut self.s);
947 ParamName::Fresh | ParamName::Error => {},
952 pub fn hash_ty(&mut self, ty: &Ty<'_>) {
953 std::mem::discriminant(&ty.kind).hash(&mut self.s);
954 self.hash_tykind(&ty.kind);
957 pub fn hash_tykind(&mut self, ty: &TyKind<'_>) {
959 TyKind::Slice(ty) => {
962 &TyKind::Array(ty, len) => {
964 self.hash_array_length(len);
966 TyKind::Ptr(ref mut_ty) => {
967 self.hash_ty(mut_ty.ty);
968 mut_ty.mutbl.hash(&mut self.s);
970 TyKind::Rptr(lifetime, ref mut_ty) => {
971 self.hash_lifetime(*lifetime);
972 self.hash_ty(mut_ty.ty);
973 mut_ty.mutbl.hash(&mut self.s);
975 TyKind::BareFn(bfn) => {
976 bfn.unsafety.hash(&mut self.s);
977 bfn.abi.hash(&mut self.s);
978 for arg in bfn.decl.inputs {
981 std::mem::discriminant(&bfn.decl.output).hash(&mut self.s);
982 match bfn.decl.output {
983 FnRetTy::DefaultReturn(_) => {},
984 FnRetTy::Return(ty) => {
988 bfn.decl.c_variadic.hash(&mut self.s);
990 TyKind::Tup(ty_list) => {
995 TyKind::Path(ref qpath) => self.hash_qpath(qpath),
996 TyKind::OpaqueDef(_, arg_list) => {
997 self.hash_generic_args(arg_list);
999 TyKind::TraitObject(_, lifetime, _) => {
1000 self.hash_lifetime(*lifetime);
1002 TyKind::Typeof(anon_const) => {
1003 self.hash_body(anon_const.body);
1005 TyKind::Err | TyKind::Infer | TyKind::Never => {},
1009 pub fn hash_array_length(&mut self, length: ArrayLen) {
1011 ArrayLen::Infer(..) => {},
1012 ArrayLen::Body(anon_const) => self.hash_body(anon_const.body),
1016 pub fn hash_body(&mut self, body_id: BodyId) {
1017 // swap out TypeckResults when hashing a body
1018 let old_maybe_typeck_results = self.maybe_typeck_results.replace(self.cx.tcx.typeck_body(body_id));
1019 self.hash_expr(&self.cx.tcx.hir().body(body_id).value);
1020 self.maybe_typeck_results = old_maybe_typeck_results;
1023 fn hash_generic_args(&mut self, arg_list: &[GenericArg<'_>]) {
1024 for arg in arg_list {
1026 GenericArg::Lifetime(l) => self.hash_lifetime(l),
1027 GenericArg::Type(ref ty) => self.hash_ty(ty),
1028 GenericArg::Const(ref ca) => self.hash_body(ca.value.body),
1029 GenericArg::Infer(ref inf) => self.hash_ty(&inf.to_ty()),
1035 pub fn hash_stmt(cx: &LateContext<'_>, s: &Stmt<'_>) -> u64 {
1036 let mut h = SpanlessHash::new(cx);
1041 pub fn hash_expr(cx: &LateContext<'_>, e: &Expr<'_>) -> u64 {
1042 let mut h = SpanlessHash::new(cx);