1 //! Utilities for manipulating and extracting information from `rustc_ast::ast`.
3 //! - The `eq_foobar` functions test for semantic equality but ignores `NodeId`s and `Span`s.
5 #![allow(clippy::similar_names, clippy::wildcard_imports, clippy::enum_glob_use)]
7 use crate::{both, over};
9 use rustc_ast::{self as ast, *};
10 use rustc_span::symbol::Ident;
14 pub use ident_iter::IdentIter;
16 pub fn is_useless_with_eq_exprs(kind: BinOpKind) -> bool {
20 Sub | Div | Eq | Lt | Le | Gt | Ge | Ne | And | Or | BitXor | BitAnd | BitOr
24 /// Checks if each element in the first slice is contained within the latter as per `eq_fn`.
25 pub fn unordered_over<X>(left: &[X], right: &[X], mut eq_fn: impl FnMut(&X, &X) -> bool) -> bool {
26 left.len() == right.len() && left.iter().all(|l| right.iter().any(|r| eq_fn(l, r)))
29 pub fn eq_id(l: Ident, r: Ident) -> bool {
33 pub fn eq_pat(l: &Pat, r: &Pat) -> bool {
35 match (&l.kind, &r.kind) {
36 (Paren(l), _) => eq_pat(l, r),
37 (_, Paren(r)) => eq_pat(l, r),
38 (Wild, Wild) | (Rest, Rest) => true,
39 (Lit(l), Lit(r)) => eq_expr(l, r),
40 (Ident(b1, i1, s1), Ident(b2, i2, s2)) => b1 == b2 && eq_id(*i1, *i2) && both(s1, s2, |l, r| eq_pat(l, r)),
41 (Range(lf, lt, le), Range(rf, rt, re)) => {
42 eq_expr_opt(lf, rf) && eq_expr_opt(lt, rt) && eq_range_end(&le.node, &re.node)
45 | (Ref(l, Mutability::Not), Ref(r, Mutability::Not))
46 | (Ref(l, Mutability::Mut), Ref(r, Mutability::Mut)) => eq_pat(l, r),
47 (Tuple(l), Tuple(r)) | (Slice(l), Slice(r)) => over(l, r, |l, r| eq_pat(l, r)),
48 (Path(lq, lp), Path(rq, rp)) => both(lq, rq, eq_qself) && eq_path(lp, rp),
49 (TupleStruct(lqself, lp, lfs), TupleStruct(rqself, rp, rfs)) => {
50 eq_maybe_qself(lqself, rqself) && eq_path(lp, rp) && over(lfs, rfs, |l, r| eq_pat(l, r))
52 (Struct(lqself, lp, lfs, lr), Struct(rqself, rp, rfs, rr)) => {
53 lr == rr && eq_maybe_qself(lqself, rqself) && eq_path(lp, rp) && unordered_over(lfs, rfs, eq_field_pat)
55 (Or(ls), Or(rs)) => unordered_over(ls, rs, |l, r| eq_pat(l, r)),
56 (MacCall(l), MacCall(r)) => eq_mac_call(l, r),
61 pub fn eq_range_end(l: &RangeEnd, r: &RangeEnd) -> bool {
63 (RangeEnd::Excluded, RangeEnd::Excluded) => true,
64 (RangeEnd::Included(l), RangeEnd::Included(r)) => {
65 matches!(l, RangeSyntax::DotDotEq) == matches!(r, RangeSyntax::DotDotEq)
71 pub fn eq_field_pat(l: &PatField, r: &PatField) -> bool {
72 l.is_placeholder == r.is_placeholder
73 && eq_id(l.ident, r.ident)
74 && eq_pat(&l.pat, &r.pat)
75 && over(&l.attrs, &r.attrs, eq_attr)
78 pub fn eq_qself(l: &QSelf, r: &QSelf) -> bool {
79 l.position == r.position && eq_ty(&l.ty, &r.ty)
82 pub fn eq_maybe_qself(l: &Option<QSelf>, r: &Option<QSelf>) -> bool {
84 (Some(l), Some(r)) => eq_qself(l, r),
90 pub fn eq_path(l: &Path, r: &Path) -> bool {
91 over(&l.segments, &r.segments, eq_path_seg)
94 pub fn eq_path_seg(l: &PathSegment, r: &PathSegment) -> bool {
95 eq_id(l.ident, r.ident) && both(&l.args, &r.args, |l, r| eq_generic_args(l, r))
98 pub fn eq_generic_args(l: &GenericArgs, r: &GenericArgs) -> bool {
100 (GenericArgs::AngleBracketed(l), GenericArgs::AngleBracketed(r)) => over(&l.args, &r.args, eq_angle_arg),
101 (GenericArgs::Parenthesized(l), GenericArgs::Parenthesized(r)) => {
102 over(&l.inputs, &r.inputs, |l, r| eq_ty(l, r)) && eq_fn_ret_ty(&l.output, &r.output)
108 pub fn eq_angle_arg(l: &AngleBracketedArg, r: &AngleBracketedArg) -> bool {
110 (AngleBracketedArg::Arg(l), AngleBracketedArg::Arg(r)) => eq_generic_arg(l, r),
111 (AngleBracketedArg::Constraint(l), AngleBracketedArg::Constraint(r)) => eq_assoc_constraint(l, r),
116 pub fn eq_generic_arg(l: &GenericArg, r: &GenericArg) -> bool {
118 (GenericArg::Lifetime(l), GenericArg::Lifetime(r)) => eq_id(l.ident, r.ident),
119 (GenericArg::Type(l), GenericArg::Type(r)) => eq_ty(l, r),
120 (GenericArg::Const(l), GenericArg::Const(r)) => eq_expr(&l.value, &r.value),
125 pub fn eq_expr_opt(l: &Option<P<Expr>>, r: &Option<P<Expr>>) -> bool {
126 both(l, r, |l, r| eq_expr(l, r))
129 pub fn eq_struct_rest(l: &StructRest, r: &StructRest) -> bool {
131 (StructRest::Base(lb), StructRest::Base(rb)) => eq_expr(lb, rb),
132 (StructRest::Rest(_), StructRest::Rest(_)) | (StructRest::None, StructRest::None) => true,
137 pub fn eq_expr(l: &Expr, r: &Expr) -> bool {
139 if !over(&l.attrs, &r.attrs, eq_attr) {
142 match (&l.kind, &r.kind) {
143 (Paren(l), _) => eq_expr(l, r),
144 (_, Paren(r)) => eq_expr(l, r),
146 (Box(l), Box(r)) | (Try(l), Try(r)) | (Await(l), Await(r)) => eq_expr(l, r),
147 (Array(l), Array(r)) | (Tup(l), Tup(r)) => over(l, r, |l, r| eq_expr(l, r)),
148 (Repeat(le, ls), Repeat(re, rs)) => eq_expr(le, re) && eq_expr(&ls.value, &rs.value),
149 (Call(lc, la), Call(rc, ra)) => eq_expr(lc, rc) && over(la, ra, |l, r| eq_expr(l, r)),
150 (MethodCall(lc, la, _), MethodCall(rc, ra, _)) => eq_path_seg(lc, rc) && over(la, ra, |l, r| eq_expr(l, r)),
151 (Binary(lo, ll, lr), Binary(ro, rl, rr)) => lo.node == ro.node && eq_expr(ll, rl) && eq_expr(lr, rr),
152 (Unary(lo, l), Unary(ro, r)) => mem::discriminant(lo) == mem::discriminant(ro) && eq_expr(l, r),
153 (Lit(l), Lit(r)) => l.kind == r.kind,
154 (Cast(l, lt), Cast(r, rt)) | (Type(l, lt), Type(r, rt)) => eq_expr(l, r) && eq_ty(lt, rt),
155 (Let(lp, le, _), Let(rp, re, _)) => eq_pat(lp, rp) && eq_expr(le, re),
156 (If(lc, lt, le), If(rc, rt, re)) => eq_expr(lc, rc) && eq_block(lt, rt) && eq_expr_opt(le, re),
157 (While(lc, lt, ll), While(rc, rt, rl)) => eq_label(ll, rl) && eq_expr(lc, rc) && eq_block(lt, rt),
158 (ForLoop(lp, li, lt, ll), ForLoop(rp, ri, rt, rl)) => {
159 eq_label(ll, rl) && eq_pat(lp, rp) && eq_expr(li, ri) && eq_block(lt, rt)
161 (Loop(lt, ll), Loop(rt, rl)) => eq_label(ll, rl) && eq_block(lt, rt),
162 (Block(lb, ll), Block(rb, rl)) => eq_label(ll, rl) && eq_block(lb, rb),
163 (TryBlock(l), TryBlock(r)) => eq_block(l, r),
164 (Yield(l), Yield(r)) | (Ret(l), Ret(r)) => eq_expr_opt(l, r),
165 (Break(ll, le), Break(rl, re)) => eq_label(ll, rl) && eq_expr_opt(le, re),
166 (Continue(ll), Continue(rl)) => eq_label(ll, rl),
167 (Assign(l1, l2, _), Assign(r1, r2, _)) | (Index(l1, l2), Index(r1, r2)) => eq_expr(l1, r1) && eq_expr(l2, r2),
168 (AssignOp(lo, lp, lv), AssignOp(ro, rp, rv)) => lo.node == ro.node && eq_expr(lp, rp) && eq_expr(lv, rv),
169 (Field(lp, lf), Field(rp, rf)) => eq_id(*lf, *rf) && eq_expr(lp, rp),
170 (Match(ls, la), Match(rs, ra)) => eq_expr(ls, rs) && over(la, ra, eq_arm),
171 (Closure(lb, lc, la, lm, lf, le, _), Closure(rb, rc, ra, rm, rf, re, _)) => {
172 eq_closure_binder(lb, rb)
174 && la.is_async() == ra.is_async()
176 && eq_fn_decl(lf, rf)
179 (Async(lc, _, lb), Async(rc, _, rb)) => lc == rc && eq_block(lb, rb),
180 (Range(lf, lt, ll), Range(rf, rt, rl)) => ll == rl && eq_expr_opt(lf, rf) && eq_expr_opt(lt, rt),
181 (AddrOf(lbk, lm, le), AddrOf(rbk, rm, re)) => lbk == rbk && lm == rm && eq_expr(le, re),
182 (Path(lq, lp), Path(rq, rp)) => both(lq, rq, eq_qself) && eq_path(lp, rp),
183 (MacCall(l), MacCall(r)) => eq_mac_call(l, r),
184 (Struct(lse), Struct(rse)) => {
185 eq_maybe_qself(&lse.qself, &rse.qself)
186 && eq_path(&lse.path, &rse.path)
187 && eq_struct_rest(&lse.rest, &rse.rest)
188 && unordered_over(&lse.fields, &rse.fields, eq_field)
194 pub fn eq_field(l: &ExprField, r: &ExprField) -> bool {
195 l.is_placeholder == r.is_placeholder
196 && eq_id(l.ident, r.ident)
197 && eq_expr(&l.expr, &r.expr)
198 && over(&l.attrs, &r.attrs, eq_attr)
201 pub fn eq_arm(l: &Arm, r: &Arm) -> bool {
202 l.is_placeholder == r.is_placeholder
203 && eq_pat(&l.pat, &r.pat)
204 && eq_expr(&l.body, &r.body)
205 && eq_expr_opt(&l.guard, &r.guard)
206 && over(&l.attrs, &r.attrs, eq_attr)
209 pub fn eq_label(l: &Option<Label>, r: &Option<Label>) -> bool {
210 both(l, r, |l, r| eq_id(l.ident, r.ident))
213 pub fn eq_block(l: &Block, r: &Block) -> bool {
214 l.rules == r.rules && over(&l.stmts, &r.stmts, eq_stmt)
217 pub fn eq_stmt(l: &Stmt, r: &Stmt) -> bool {
219 match (&l.kind, &r.kind) {
220 (Local(l), Local(r)) => {
221 eq_pat(&l.pat, &r.pat)
222 && both(&l.ty, &r.ty, |l, r| eq_ty(l, r))
223 && eq_local_kind(&l.kind, &r.kind)
224 && over(&l.attrs, &r.attrs, eq_attr)
226 (Item(l), Item(r)) => eq_item(l, r, eq_item_kind),
227 (Expr(l), Expr(r)) | (Semi(l), Semi(r)) => eq_expr(l, r),
228 (Empty, Empty) => true,
229 (MacCall(l), MacCall(r)) => {
230 l.style == r.style && eq_mac_call(&l.mac, &r.mac) && over(&l.attrs, &r.attrs, eq_attr)
236 pub fn eq_local_kind(l: &LocalKind, r: &LocalKind) -> bool {
239 (Decl, Decl) => true,
240 (Init(l), Init(r)) => eq_expr(l, r),
241 (InitElse(li, le), InitElse(ri, re)) => eq_expr(li, ri) && eq_block(le, re),
246 pub fn eq_item<K>(l: &Item<K>, r: &Item<K>, mut eq_kind: impl FnMut(&K, &K) -> bool) -> bool {
247 eq_id(l.ident, r.ident) && over(&l.attrs, &r.attrs, eq_attr) && eq_vis(&l.vis, &r.vis) && eq_kind(&l.kind, &r.kind)
250 #[expect(clippy::too_many_lines)] // Just a big match statement
251 pub fn eq_item_kind(l: &ItemKind, r: &ItemKind) -> bool {
254 (ExternCrate(l), ExternCrate(r)) => l == r,
255 (Use(l), Use(r)) => eq_use_tree(l, r),
256 (Static(lt, lm, le), Static(rt, rm, re)) => lm == rm && eq_ty(lt, rt) && eq_expr_opt(le, re),
257 (Const(ld, lt, le), Const(rd, rt, re)) => eq_defaultness(*ld, *rd) && eq_ty(lt, rt) && eq_expr_opt(le, re),
272 eq_defaultness(*ld, *rd) && eq_fn_sig(lf, rf) && eq_generics(lg, rg) && both(lb, rb, |l, r| eq_block(l, r))
274 (Mod(lu, lmk), Mod(ru, rmk)) => {
276 && match (lmk, rmk) {
277 (ModKind::Loaded(litems, linline, _), ModKind::Loaded(ritems, rinline, _)) => {
278 linline == rinline && over(litems, ritems, |l, r| eq_item(l, r, eq_item_kind))
280 (ModKind::Unloaded, ModKind::Unloaded) => true,
284 (ForeignMod(l), ForeignMod(r)) => {
285 both(&l.abi, &r.abi, eq_str_lit) && over(&l.items, &r.items, |l, r| eq_item(l, r, eq_foreign_item_kind))
288 TyAlias(box ast::TyAlias {
295 TyAlias(box ast::TyAlias {
303 eq_defaultness(*ld, *rd)
304 && eq_generics(lg, rg)
305 && over(lb, rb, eq_generic_bound)
306 && both(lt, rt, |l, r| eq_ty(l, r))
308 (Enum(le, lg), Enum(re, rg)) => over(&le.variants, &re.variants, eq_variant) && eq_generics(lg, rg),
309 (Struct(lv, lg), Struct(rv, rg)) | (Union(lv, lg), Union(rv, rg)) => {
310 eq_variant_data(lv, rv) && eq_generics(lg, rg)
313 Trait(box ast::Trait {
320 Trait(box ast::Trait {
329 && matches!(lu, Unsafe::No) == matches!(ru, Unsafe::No)
330 && eq_generics(lg, rg)
331 && over(lb, rb, eq_generic_bound)
332 && over(li, ri, |l, r| eq_item(l, r, eq_assoc_item_kind))
334 (TraitAlias(lg, lb), TraitAlias(rg, rb)) => eq_generics(lg, rg) && over(lb, rb, eq_generic_bound),
357 matches!(lu, Unsafe::No) == matches!(ru, Unsafe::No)
358 && matches!(lp, ImplPolarity::Positive) == matches!(rp, ImplPolarity::Positive)
359 && eq_defaultness(*ld, *rd)
360 && matches!(lc, ast::Const::No) == matches!(rc, ast::Const::No)
361 && eq_generics(lg, rg)
362 && both(lot, rot, |l, r| eq_path(&l.path, &r.path))
364 && over(li, ri, |l, r| eq_item(l, r, eq_assoc_item_kind))
366 (MacCall(l), MacCall(r)) => eq_mac_call(l, r),
367 (MacroDef(l), MacroDef(r)) => l.macro_rules == r.macro_rules && eq_mac_args(&l.body, &r.body),
372 pub fn eq_foreign_item_kind(l: &ForeignItemKind, r: &ForeignItemKind) -> bool {
373 use ForeignItemKind::*;
375 (Static(lt, lm, le), Static(rt, rm, re)) => lm == rm && eq_ty(lt, rt) && eq_expr_opt(le, re),
390 eq_defaultness(*ld, *rd) && eq_fn_sig(lf, rf) && eq_generics(lg, rg) && both(lb, rb, |l, r| eq_block(l, r))
393 TyAlias(box ast::TyAlias {
400 TyAlias(box ast::TyAlias {
408 eq_defaultness(*ld, *rd)
409 && eq_generics(lg, rg)
410 && over(lb, rb, eq_generic_bound)
411 && both(lt, rt, |l, r| eq_ty(l, r))
413 (MacCall(l), MacCall(r)) => eq_mac_call(l, r),
418 pub fn eq_assoc_item_kind(l: &AssocItemKind, r: &AssocItemKind) -> bool {
419 use AssocItemKind::*;
421 (Const(ld, lt, le), Const(rd, rt, re)) => eq_defaultness(*ld, *rd) && eq_ty(lt, rt) && eq_expr_opt(le, re),
436 eq_defaultness(*ld, *rd) && eq_fn_sig(lf, rf) && eq_generics(lg, rg) && both(lb, rb, |l, r| eq_block(l, r))
439 TyAlias(box ast::TyAlias {
446 TyAlias(box ast::TyAlias {
454 eq_defaultness(*ld, *rd)
455 && eq_generics(lg, rg)
456 && over(lb, rb, eq_generic_bound)
457 && both(lt, rt, |l, r| eq_ty(l, r))
459 (MacCall(l), MacCall(r)) => eq_mac_call(l, r),
464 pub fn eq_variant(l: &Variant, r: &Variant) -> bool {
465 l.is_placeholder == r.is_placeholder
466 && over(&l.attrs, &r.attrs, eq_attr)
467 && eq_vis(&l.vis, &r.vis)
468 && eq_id(l.ident, r.ident)
469 && eq_variant_data(&l.data, &r.data)
470 && both(&l.disr_expr, &r.disr_expr, |l, r| eq_expr(&l.value, &r.value))
473 pub fn eq_variant_data(l: &VariantData, r: &VariantData) -> bool {
476 (Unit(_), Unit(_)) => true,
477 (Struct(l, _), Struct(r, _)) | (Tuple(l, _), Tuple(r, _)) => over(l, r, eq_struct_field),
482 pub fn eq_struct_field(l: &FieldDef, r: &FieldDef) -> bool {
483 l.is_placeholder == r.is_placeholder
484 && over(&l.attrs, &r.attrs, eq_attr)
485 && eq_vis(&l.vis, &r.vis)
486 && both(&l.ident, &r.ident, |l, r| eq_id(*l, *r))
487 && eq_ty(&l.ty, &r.ty)
490 pub fn eq_fn_sig(l: &FnSig, r: &FnSig) -> bool {
491 eq_fn_decl(&l.decl, &r.decl) && eq_fn_header(&l.header, &r.header)
494 pub fn eq_fn_header(l: &FnHeader, r: &FnHeader) -> bool {
495 matches!(l.unsafety, Unsafe::No) == matches!(r.unsafety, Unsafe::No)
496 && l.asyncness.is_async() == r.asyncness.is_async()
497 && matches!(l.constness, Const::No) == matches!(r.constness, Const::No)
498 && eq_ext(&l.ext, &r.ext)
501 pub fn eq_generics(l: &Generics, r: &Generics) -> bool {
502 over(&l.params, &r.params, eq_generic_param)
503 && over(&l.where_clause.predicates, &r.where_clause.predicates, |l, r| {
504 eq_where_predicate(l, r)
508 pub fn eq_where_predicate(l: &WherePredicate, r: &WherePredicate) -> bool {
509 use WherePredicate::*;
511 (BoundPredicate(l), BoundPredicate(r)) => {
512 over(&l.bound_generic_params, &r.bound_generic_params, |l, r| {
513 eq_generic_param(l, r)
514 }) && eq_ty(&l.bounded_ty, &r.bounded_ty)
515 && over(&l.bounds, &r.bounds, eq_generic_bound)
517 (RegionPredicate(l), RegionPredicate(r)) => {
518 eq_id(l.lifetime.ident, r.lifetime.ident) && over(&l.bounds, &r.bounds, eq_generic_bound)
520 (EqPredicate(l), EqPredicate(r)) => eq_ty(&l.lhs_ty, &r.lhs_ty) && eq_ty(&l.rhs_ty, &r.rhs_ty),
525 pub fn eq_use_tree(l: &UseTree, r: &UseTree) -> bool {
526 eq_path(&l.prefix, &r.prefix) && eq_use_tree_kind(&l.kind, &r.kind)
529 pub fn eq_anon_const(l: &AnonConst, r: &AnonConst) -> bool {
530 eq_expr(&l.value, &r.value)
533 pub fn eq_use_tree_kind(l: &UseTreeKind, r: &UseTreeKind) -> bool {
536 (Glob, Glob) => true,
537 (Simple(l, _, _), Simple(r, _, _)) => both(l, r, |l, r| eq_id(*l, *r)),
538 (Nested(l), Nested(r)) => over(l, r, |(l, _), (r, _)| eq_use_tree(l, r)),
543 pub fn eq_defaultness(l: Defaultness, r: Defaultness) -> bool {
546 (Defaultness::Final, Defaultness::Final) | (Defaultness::Default(_), Defaultness::Default(_))
550 pub fn eq_vis(l: &Visibility, r: &Visibility) -> bool {
551 use VisibilityKind::*;
552 match (&l.kind, &r.kind) {
553 (Public, Public) | (Inherited, Inherited) => true,
554 (Restricted { path: l, .. }, Restricted { path: r, .. }) => eq_path(l, r),
559 pub fn eq_fn_decl(l: &FnDecl, r: &FnDecl) -> bool {
560 eq_fn_ret_ty(&l.output, &r.output)
561 && over(&l.inputs, &r.inputs, |l, r| {
562 l.is_placeholder == r.is_placeholder
563 && eq_pat(&l.pat, &r.pat)
564 && eq_ty(&l.ty, &r.ty)
565 && over(&l.attrs, &r.attrs, eq_attr)
569 pub fn eq_closure_binder(l: &ClosureBinder, r: &ClosureBinder) -> bool {
571 (ClosureBinder::NotPresent, ClosureBinder::NotPresent) => true,
572 (ClosureBinder::For { generic_params: lp, .. }, ClosureBinder::For { generic_params: rp, .. }) => {
573 lp.len() == rp.len() && std::iter::zip(lp.iter(), rp.iter()).all(|(l, r)| eq_generic_param(l, r))
579 pub fn eq_fn_ret_ty(l: &FnRetTy, r: &FnRetTy) -> bool {
581 (FnRetTy::Default(_), FnRetTy::Default(_)) => true,
582 (FnRetTy::Ty(l), FnRetTy::Ty(r)) => eq_ty(l, r),
587 pub fn eq_ty(l: &Ty, r: &Ty) -> bool {
589 match (&l.kind, &r.kind) {
590 (Paren(l), _) => eq_ty(l, r),
591 (_, Paren(r)) => eq_ty(l, r),
592 (Never, Never) | (Infer, Infer) | (ImplicitSelf, ImplicitSelf) | (Err, Err) | (CVarArgs, CVarArgs) => true,
593 (Slice(l), Slice(r)) => eq_ty(l, r),
594 (Array(le, ls), Array(re, rs)) => eq_ty(le, re) && eq_expr(&ls.value, &rs.value),
595 (Ptr(l), Ptr(r)) => l.mutbl == r.mutbl && eq_ty(&l.ty, &r.ty),
596 (Rptr(ll, l), Rptr(rl, r)) => {
597 both(ll, rl, |l, r| eq_id(l.ident, r.ident)) && l.mutbl == r.mutbl && eq_ty(&l.ty, &r.ty)
599 (BareFn(l), BareFn(r)) => {
600 l.unsafety == r.unsafety
601 && eq_ext(&l.ext, &r.ext)
602 && over(&l.generic_params, &r.generic_params, eq_generic_param)
603 && eq_fn_decl(&l.decl, &r.decl)
605 (Tup(l), Tup(r)) => over(l, r, |l, r| eq_ty(l, r)),
606 (Path(lq, lp), Path(rq, rp)) => both(lq, rq, eq_qself) && eq_path(lp, rp),
607 (TraitObject(lg, ls), TraitObject(rg, rs)) => ls == rs && over(lg, rg, eq_generic_bound),
608 (ImplTrait(_, lg), ImplTrait(_, rg)) => over(lg, rg, eq_generic_bound),
609 (Typeof(l), Typeof(r)) => eq_expr(&l.value, &r.value),
610 (MacCall(l), MacCall(r)) => eq_mac_call(l, r),
615 pub fn eq_ext(l: &Extern, r: &Extern) -> bool {
618 (None, None) | (Implicit(_), Implicit(_)) => true,
619 (Explicit(l, _), Explicit(r, _)) => eq_str_lit(l, r),
624 pub fn eq_str_lit(l: &StrLit, r: &StrLit) -> bool {
625 l.style == r.style && l.symbol == r.symbol && l.suffix == r.suffix
628 pub fn eq_poly_ref_trait(l: &PolyTraitRef, r: &PolyTraitRef) -> bool {
629 eq_path(&l.trait_ref.path, &r.trait_ref.path)
630 && over(&l.bound_generic_params, &r.bound_generic_params, |l, r| {
631 eq_generic_param(l, r)
635 pub fn eq_generic_param(l: &GenericParam, r: &GenericParam) -> bool {
636 use GenericParamKind::*;
637 l.is_placeholder == r.is_placeholder
638 && eq_id(l.ident, r.ident)
639 && over(&l.bounds, &r.bounds, eq_generic_bound)
640 && match (&l.kind, &r.kind) {
641 (Lifetime, Lifetime) => true,
642 (Type { default: l }, Type { default: r }) => both(l, r, |l, r| eq_ty(l, r)),
654 ) => eq_ty(lt, rt) && both(ld, rd, eq_anon_const),
657 && over(&l.attrs, &r.attrs, eq_attr)
660 pub fn eq_generic_bound(l: &GenericBound, r: &GenericBound) -> bool {
663 (Trait(ptr1, tbm1), Trait(ptr2, tbm2)) => tbm1 == tbm2 && eq_poly_ref_trait(ptr1, ptr2),
664 (Outlives(l), Outlives(r)) => eq_id(l.ident, r.ident),
669 fn eq_term(l: &Term, r: &Term) -> bool {
671 (Term::Ty(l), Term::Ty(r)) => eq_ty(l, r),
672 (Term::Const(l), Term::Const(r)) => eq_anon_const(l, r),
677 pub fn eq_assoc_constraint(l: &AssocConstraint, r: &AssocConstraint) -> bool {
678 use AssocConstraintKind::*;
679 eq_id(l.ident, r.ident)
680 && match (&l.kind, &r.kind) {
681 (Equality { term: l }, Equality { term: r }) => eq_term(l, r),
682 (Bound { bounds: l }, Bound { bounds: r }) => over(l, r, eq_generic_bound),
687 pub fn eq_mac_call(l: &MacCall, r: &MacCall) -> bool {
688 eq_path(&l.path, &r.path) && eq_mac_args(&l.args, &r.args)
691 pub fn eq_attr(l: &Attribute, r: &Attribute) -> bool {
694 && match (&l.kind, &r.kind) {
695 (DocComment(l1, l2), DocComment(r1, r2)) => l1 == r1 && l2 == r2,
696 (Normal(l, _), Normal(r, _)) => eq_path(&l.path, &r.path) && eq_mac_args(&l.args, &r.args),
701 pub fn eq_mac_args(l: &MacArgs, r: &MacArgs) -> bool {
704 (Empty, Empty) => true,
705 (Delimited(_, ld, lts), Delimited(_, rd, rts)) => ld == rd && lts.eq_unspanned(rts),
706 (Eq(_, MacArgsEq::Ast(le)), Eq(_, MacArgsEq::Ast(re))) => eq_expr(le, re),
707 (Eq(_, MacArgsEq::Hir(ll)), Eq(_, MacArgsEq::Hir(rl))) => ll.kind == rl.kind,