1 use crate::consts::{constant_context, constant_simple};
2 use crate::utils::differing_macro_contexts;
3 use rustc_ast::ast::InlineAsmTemplatePiece;
4 use rustc_data_structures::stable_hasher::{HashStable, StableHasher};
6 BinOpKind, Block, BlockCheckMode, BodyId, BorrowKind, CaptureBy, Expr, ExprKind, Field, FnRetTy, GenericArg,
7 GenericArgs, Guard, InlineAsmOperand, Lifetime, LifetimeName, ParamName, Pat, PatKind, Path, PathSegment, QPath,
8 Stmt, StmtKind, Ty, TyKind, TypeBinding,
10 use rustc_lint::LateContext;
11 use rustc_middle::ich::StableHashingContextProvider;
12 use rustc_middle::ty::TypeckTables;
13 use rustc_span::Symbol;
16 /// Type used to check whether two ast are the same. This is different from the
18 /// `==` on ast types as this operator would compare true equality with ID and
21 /// Note that some expressions kinds are not considered but could be added.
22 pub struct SpanlessEq<'a, 'tcx> {
23 /// Context used to evaluate constant expressions.
24 cx: &'a LateContext<'a, 'tcx>,
25 tables: &'a TypeckTables<'tcx>,
26 /// If is true, never consider as equal expressions containing function
31 impl<'a, 'tcx> SpanlessEq<'a, 'tcx> {
32 pub fn new(cx: &'a LateContext<'a, 'tcx>) -> Self {
40 pub fn ignore_fn(self) -> Self {
43 tables: self.cx.tables,
48 /// Checks whether two statements are the same.
49 pub fn eq_stmt(&mut self, left: &Stmt<'_>, right: &Stmt<'_>) -> bool {
50 match (&left.kind, &right.kind) {
51 (&StmtKind::Local(ref l), &StmtKind::Local(ref r)) => {
52 self.eq_pat(&l.pat, &r.pat)
53 && both(&l.ty, &r.ty, |l, r| self.eq_ty(l, r))
54 && both(&l.init, &r.init, |l, r| self.eq_expr(l, r))
56 (&StmtKind::Expr(ref l), &StmtKind::Expr(ref r)) | (&StmtKind::Semi(ref l), &StmtKind::Semi(ref r)) => {
63 /// Checks whether two blocks are the same.
64 pub fn eq_block(&mut self, left: &Block<'_>, right: &Block<'_>) -> bool {
65 over(&left.stmts, &right.stmts, |l, r| self.eq_stmt(l, r))
66 && both(&left.expr, &right.expr, |l, r| self.eq_expr(l, r))
69 #[allow(clippy::similar_names)]
70 pub fn eq_expr(&mut self, left: &Expr<'_>, right: &Expr<'_>) -> bool {
71 if self.ignore_fn && differing_macro_contexts(left.span, right.span) {
75 if let (Some(l), Some(r)) = (
76 constant_simple(self.cx, self.tables, left),
77 constant_simple(self.cx, self.tables, right),
84 match (&left.kind, &right.kind) {
85 (&ExprKind::AddrOf(lb, l_mut, ref le), &ExprKind::AddrOf(rb, r_mut, ref re)) => {
86 lb == rb && l_mut == r_mut && self.eq_expr(le, re)
88 (&ExprKind::Continue(li), &ExprKind::Continue(ri)) => {
89 both(&li.label, &ri.label, |l, r| l.ident.as_str() == r.ident.as_str())
91 (&ExprKind::Assign(ref ll, ref lr, _), &ExprKind::Assign(ref rl, ref rr, _)) => {
92 self.eq_expr(ll, rl) && self.eq_expr(lr, rr)
94 (&ExprKind::AssignOp(ref lo, ref ll, ref lr), &ExprKind::AssignOp(ref ro, ref rl, ref rr)) => {
95 lo.node == ro.node && self.eq_expr(ll, rl) && self.eq_expr(lr, rr)
97 (&ExprKind::Block(ref l, _), &ExprKind::Block(ref r, _)) => self.eq_block(l, r),
98 (&ExprKind::Binary(l_op, ref ll, ref lr), &ExprKind::Binary(r_op, ref rl, ref rr)) => {
99 l_op.node == r_op.node && self.eq_expr(ll, rl) && self.eq_expr(lr, rr)
100 || swap_binop(l_op.node, ll, lr).map_or(false, |(l_op, ll, lr)| {
101 l_op == r_op.node && self.eq_expr(ll, rl) && self.eq_expr(lr, rr)
104 (&ExprKind::Break(li, ref le), &ExprKind::Break(ri, ref re)) => {
105 both(&li.label, &ri.label, |l, r| l.ident.as_str() == r.ident.as_str())
106 && both(le, re, |l, r| self.eq_expr(l, r))
108 (&ExprKind::Box(ref l), &ExprKind::Box(ref r)) => self.eq_expr(l, r),
109 (&ExprKind::Call(l_fun, l_args), &ExprKind::Call(r_fun, r_args)) => {
110 !self.ignore_fn && self.eq_expr(l_fun, r_fun) && self.eq_exprs(l_args, r_args)
112 (&ExprKind::Cast(ref lx, ref lt), &ExprKind::Cast(ref rx, ref rt))
113 | (&ExprKind::Type(ref lx, ref lt), &ExprKind::Type(ref rx, ref rt)) => {
114 self.eq_expr(lx, rx) && self.eq_ty(lt, rt)
116 (&ExprKind::Field(ref l_f_exp, ref l_f_ident), &ExprKind::Field(ref r_f_exp, ref r_f_ident)) => {
117 l_f_ident.name == r_f_ident.name && self.eq_expr(l_f_exp, r_f_exp)
119 (&ExprKind::Index(ref la, ref li), &ExprKind::Index(ref ra, ref ri)) => {
120 self.eq_expr(la, ra) && self.eq_expr(li, ri)
122 (&ExprKind::Lit(ref l), &ExprKind::Lit(ref r)) => l.node == r.node,
123 (&ExprKind::Loop(ref lb, ref ll, ref lls), &ExprKind::Loop(ref rb, ref rl, ref rls)) => {
124 lls == rls && self.eq_block(lb, rb) && both(ll, rl, |l, r| l.ident.as_str() == r.ident.as_str())
126 (&ExprKind::Match(ref le, ref la, ref ls), &ExprKind::Match(ref re, ref ra, ref rs)) => {
128 && self.eq_expr(le, re)
129 && over(la, ra, |l, r| {
130 self.eq_expr(&l.body, &r.body)
131 && both(&l.guard, &r.guard, |l, r| self.eq_guard(l, r))
132 && self.eq_pat(&l.pat, &r.pat)
135 (&ExprKind::MethodCall(l_path, _, l_args, _), &ExprKind::MethodCall(r_path, _, r_args, _)) => {
136 !self.ignore_fn && self.eq_path_segment(l_path, r_path) && self.eq_exprs(l_args, r_args)
138 (&ExprKind::Repeat(ref le, ref ll_id), &ExprKind::Repeat(ref re, ref rl_id)) => {
139 let mut celcx = constant_context(self.cx, self.cx.tcx.body_tables(ll_id.body));
140 let ll = celcx.expr(&self.cx.tcx.hir().body(ll_id.body).value);
141 let mut celcx = constant_context(self.cx, self.cx.tcx.body_tables(rl_id.body));
142 let rl = celcx.expr(&self.cx.tcx.hir().body(rl_id.body).value);
144 self.eq_expr(le, re) && ll == rl
146 (&ExprKind::Ret(ref l), &ExprKind::Ret(ref r)) => both(l, r, |l, r| self.eq_expr(l, r)),
147 (&ExprKind::Path(ref l), &ExprKind::Path(ref r)) => self.eq_qpath(l, r),
148 (&ExprKind::Struct(ref l_path, ref lf, ref lo), &ExprKind::Struct(ref r_path, ref rf, ref ro)) => {
149 self.eq_qpath(l_path, r_path)
150 && both(lo, ro, |l, r| self.eq_expr(l, r))
151 && over(lf, rf, |l, r| self.eq_field(l, r))
153 (&ExprKind::Tup(l_tup), &ExprKind::Tup(r_tup)) => self.eq_exprs(l_tup, r_tup),
154 (&ExprKind::Unary(l_op, ref le), &ExprKind::Unary(r_op, ref re)) => l_op == r_op && self.eq_expr(le, re),
155 (&ExprKind::Array(l), &ExprKind::Array(r)) => self.eq_exprs(l, r),
156 (&ExprKind::DropTemps(ref le), &ExprKind::DropTemps(ref re)) => self.eq_expr(le, re),
161 fn eq_exprs(&mut self, left: &[Expr<'_>], right: &[Expr<'_>]) -> bool {
162 over(left, right, |l, r| self.eq_expr(l, r))
165 fn eq_field(&mut self, left: &Field<'_>, right: &Field<'_>) -> bool {
166 left.ident.name == right.ident.name && self.eq_expr(&left.expr, &right.expr)
169 fn eq_guard(&mut self, left: &Guard<'_>, right: &Guard<'_>) -> bool {
170 match (left, right) {
171 (Guard::If(l), Guard::If(r)) => self.eq_expr(l, r),
175 fn eq_generic_arg(&mut self, left: &GenericArg<'_>, right: &GenericArg<'_>) -> bool {
176 match (left, right) {
177 (GenericArg::Lifetime(l_lt), GenericArg::Lifetime(r_lt)) => Self::eq_lifetime(l_lt, r_lt),
178 (GenericArg::Type(l_ty), GenericArg::Type(r_ty)) => self.eq_ty(l_ty, r_ty),
183 fn eq_lifetime(left: &Lifetime, right: &Lifetime) -> bool {
184 left.name == right.name
187 /// Checks whether two patterns are the same.
188 pub fn eq_pat(&mut self, left: &Pat<'_>, right: &Pat<'_>) -> bool {
189 match (&left.kind, &right.kind) {
190 (&PatKind::Box(ref l), &PatKind::Box(ref r)) => self.eq_pat(l, r),
191 (&PatKind::TupleStruct(ref lp, ref la, ls), &PatKind::TupleStruct(ref rp, ref ra, rs)) => {
192 self.eq_qpath(lp, rp) && over(la, ra, |l, r| self.eq_pat(l, r)) && ls == rs
194 (&PatKind::Binding(ref lb, .., ref li, ref lp), &PatKind::Binding(ref rb, .., ref ri, ref rp)) => {
195 lb == rb && li.name.as_str() == ri.name.as_str() && both(lp, rp, |l, r| self.eq_pat(l, r))
197 (&PatKind::Path(ref l), &PatKind::Path(ref r)) => self.eq_qpath(l, r),
198 (&PatKind::Lit(ref l), &PatKind::Lit(ref r)) => self.eq_expr(l, r),
199 (&PatKind::Tuple(ref l, ls), &PatKind::Tuple(ref r, rs)) => {
200 ls == rs && over(l, r, |l, r| self.eq_pat(l, r))
202 (&PatKind::Range(ref ls, ref le, li), &PatKind::Range(ref rs, ref re, ri)) => {
203 both(ls, rs, |a, b| self.eq_expr(a, b)) && both(le, re, |a, b| self.eq_expr(a, b)) && (li == ri)
205 (&PatKind::Ref(ref le, ref lm), &PatKind::Ref(ref re, ref rm)) => lm == rm && self.eq_pat(le, re),
206 (&PatKind::Slice(ref ls, ref li, ref le), &PatKind::Slice(ref rs, ref ri, ref re)) => {
207 over(ls, rs, |l, r| self.eq_pat(l, r))
208 && over(le, re, |l, r| self.eq_pat(l, r))
209 && both(li, ri, |l, r| self.eq_pat(l, r))
211 (&PatKind::Wild, &PatKind::Wild) => true,
216 #[allow(clippy::similar_names)]
217 fn eq_qpath(&mut self, left: &QPath<'_>, right: &QPath<'_>) -> bool {
218 match (left, right) {
219 (&QPath::Resolved(ref lty, ref lpath), &QPath::Resolved(ref rty, ref rpath)) => {
220 both(lty, rty, |l, r| self.eq_ty(l, r)) && self.eq_path(lpath, rpath)
222 (&QPath::TypeRelative(ref lty, ref lseg), &QPath::TypeRelative(ref rty, ref rseg)) => {
223 self.eq_ty(lty, rty) && self.eq_path_segment(lseg, rseg)
229 fn eq_path(&mut self, left: &Path<'_>, right: &Path<'_>) -> bool {
230 left.is_global() == right.is_global()
231 && over(&left.segments, &right.segments, |l, r| self.eq_path_segment(l, r))
234 fn eq_path_parameters(&mut self, left: &GenericArgs<'_>, right: &GenericArgs<'_>) -> bool {
235 if !(left.parenthesized || right.parenthesized) {
236 over(&left.args, &right.args, |l, r| self.eq_generic_arg(l, r)) // FIXME(flip1995): may not work
237 && over(&left.bindings, &right.bindings, |l, r| self.eq_type_binding(l, r))
238 } else if left.parenthesized && right.parenthesized {
239 over(left.inputs(), right.inputs(), |l, r| self.eq_ty(l, r))
240 && both(&Some(&left.bindings[0].ty()), &Some(&right.bindings[0].ty()), |l, r| {
248 pub fn eq_path_segments(&mut self, left: &[PathSegment<'_>], right: &[PathSegment<'_>]) -> bool {
249 left.len() == right.len() && left.iter().zip(right).all(|(l, r)| self.eq_path_segment(l, r))
252 pub fn eq_path_segment(&mut self, left: &PathSegment<'_>, right: &PathSegment<'_>) -> bool {
253 // The == of idents doesn't work with different contexts,
254 // we have to be explicit about hygiene
255 if left.ident.as_str() != right.ident.as_str() {
258 match (&left.args, &right.args) {
259 (&None, &None) => true,
260 (&Some(ref l), &Some(ref r)) => self.eq_path_parameters(l, r),
265 pub fn eq_ty(&mut self, left: &Ty<'_>, right: &Ty<'_>) -> bool {
266 self.eq_ty_kind(&left.kind, &right.kind)
269 #[allow(clippy::similar_names)]
270 pub fn eq_ty_kind(&mut self, left: &TyKind<'_>, right: &TyKind<'_>) -> bool {
271 match (left, right) {
272 (&TyKind::Slice(ref l_vec), &TyKind::Slice(ref r_vec)) => self.eq_ty(l_vec, r_vec),
273 (&TyKind::Array(ref lt, ref ll_id), &TyKind::Array(ref rt, ref rl_id)) => {
274 let full_table = self.tables;
276 let mut celcx = constant_context(self.cx, self.cx.tcx.body_tables(ll_id.body));
277 self.tables = self.cx.tcx.body_tables(ll_id.body);
278 let ll = celcx.expr(&self.cx.tcx.hir().body(ll_id.body).value);
280 let mut celcx = constant_context(self.cx, self.cx.tcx.body_tables(rl_id.body));
281 self.tables = self.cx.tcx.body_tables(rl_id.body);
282 let rl = celcx.expr(&self.cx.tcx.hir().body(rl_id.body).value);
284 let eq_ty = self.eq_ty(lt, rt);
285 self.tables = full_table;
288 (&TyKind::Ptr(ref l_mut), &TyKind::Ptr(ref r_mut)) => {
289 l_mut.mutbl == r_mut.mutbl && self.eq_ty(&*l_mut.ty, &*r_mut.ty)
291 (&TyKind::Rptr(_, ref l_rmut), &TyKind::Rptr(_, ref r_rmut)) => {
292 l_rmut.mutbl == r_rmut.mutbl && self.eq_ty(&*l_rmut.ty, &*r_rmut.ty)
294 (&TyKind::Path(ref l), &TyKind::Path(ref r)) => self.eq_qpath(l, r),
295 (&TyKind::Tup(ref l), &TyKind::Tup(ref r)) => over(l, r, |l, r| self.eq_ty(l, r)),
296 (&TyKind::Infer, &TyKind::Infer) => true,
301 fn eq_type_binding(&mut self, left: &TypeBinding<'_>, right: &TypeBinding<'_>) -> bool {
302 left.ident.name == right.ident.name && self.eq_ty(&left.ty(), &right.ty())
310 ) -> Option<(BinOpKind, &'a Expr<'a>, &'a Expr<'a>)> {
318 | BinOpKind::BitOr => Some((binop, rhs, lhs)),
319 BinOpKind::Lt => Some((BinOpKind::Gt, rhs, lhs)),
320 BinOpKind::Le => Some((BinOpKind::Ge, rhs, lhs)),
321 BinOpKind::Ge => Some((BinOpKind::Le, rhs, lhs)),
322 BinOpKind::Gt => Some((BinOpKind::Lt, rhs, lhs)),
329 | BinOpKind::Or => None,
333 /// Checks if the two `Option`s are both `None` or some equal values as per
335 pub fn both<X>(l: &Option<X>, r: &Option<X>, mut eq_fn: impl FnMut(&X, &X) -> bool) -> bool {
337 .map_or_else(|| r.is_none(), |x| r.as_ref().map_or(false, |y| eq_fn(x, y)))
340 /// Checks if two slices are equal as per `eq_fn`.
341 pub fn over<X>(left: &[X], right: &[X], mut eq_fn: impl FnMut(&X, &X) -> bool) -> bool {
342 left.len() == right.len() && left.iter().zip(right).all(|(x, y)| eq_fn(x, y))
345 /// Type used to hash an ast element. This is different from the `Hash` trait
346 /// on ast types as this
347 /// trait would consider IDs and spans.
349 /// All expressions kind are hashed, but some might have a weaker hash.
350 pub struct SpanlessHash<'a, 'tcx> {
351 /// Context used to evaluate constant expressions.
352 cx: &'a LateContext<'a, 'tcx>,
353 tables: &'a TypeckTables<'tcx>,
357 impl<'a, 'tcx> SpanlessHash<'a, 'tcx> {
358 pub fn new(cx: &'a LateContext<'a, 'tcx>, tables: &'a TypeckTables<'tcx>) -> Self {
362 s: StableHasher::new(),
366 pub fn finish(self) -> u64 {
370 pub fn hash_block(&mut self, b: &Block<'_>) {
375 if let Some(ref e) = b.expr {
380 BlockCheckMode::DefaultBlock => 0,
381 BlockCheckMode::UnsafeBlock(_) => 1,
382 BlockCheckMode::PushUnsafeBlock(_) => 2,
383 BlockCheckMode::PopUnsafeBlock(_) => 3,
388 #[allow(clippy::many_single_char_names, clippy::too_many_lines)]
389 pub fn hash_expr(&mut self, e: &Expr<'_>) {
390 let simple_const = constant_simple(self.cx, self.tables, e);
392 // const hashing may result in the same hash as some unrelated node, so add a sort of
393 // discriminant depending on which path we're choosing next
394 simple_const.is_some().hash(&mut self.s);
396 if let Some(e) = simple_const {
397 return e.hash(&mut self.s);
400 std::mem::discriminant(&e.kind).hash(&mut self.s);
403 ExprKind::AddrOf(kind, m, ref e) => {
405 BorrowKind::Ref => 0,
406 BorrowKind::Raw => 1,
412 ExprKind::Continue(i) => {
413 if let Some(i) = i.label {
414 self.hash_name(i.ident.name);
417 ExprKind::Assign(ref l, ref r, _) => {
421 ExprKind::AssignOp(ref o, ref l, ref r) => {
423 .hash_stable(&mut self.cx.tcx.get_stable_hashing_context(), &mut self.s);
427 ExprKind::Block(ref b, _) => {
430 ExprKind::Binary(op, ref l, ref r) => {
432 .hash_stable(&mut self.cx.tcx.get_stable_hashing_context(), &mut self.s);
436 ExprKind::Break(i, ref j) => {
437 if let Some(i) = i.label {
438 self.hash_name(i.ident.name);
440 if let Some(ref j) = *j {
444 ExprKind::Box(ref e) | ExprKind::DropTemps(ref e) | ExprKind::Yield(ref e, _) => {
447 ExprKind::Call(ref fun, args) => {
449 self.hash_exprs(args);
451 ExprKind::Cast(ref e, ref ty) | ExprKind::Type(ref e, ref ty) => {
455 ExprKind::Closure(cap, _, eid, _, _) => {
457 CaptureBy::Value => 0,
461 // closures inherit TypeckTables
462 self.hash_expr(&self.cx.tcx.hir().body(eid).value);
464 ExprKind::Field(ref e, ref f) => {
466 self.hash_name(f.name);
468 ExprKind::Index(ref a, ref i) => {
472 ExprKind::InlineAsm(ref asm) => {
473 for piece in asm.template {
475 InlineAsmTemplatePiece::String(s) => s.hash(&mut self.s),
476 InlineAsmTemplatePiece::Placeholder {
481 operand_idx.hash(&mut self.s);
482 modifier.hash(&mut self.s);
486 asm.options.hash(&mut self.s);
487 for op in asm.operands {
489 InlineAsmOperand::In { reg, expr } => {
490 reg.hash(&mut self.s);
491 self.hash_expr(expr);
493 InlineAsmOperand::Out { reg, late, expr } => {
494 reg.hash(&mut self.s);
495 late.hash(&mut self.s);
496 if let Some(expr) = expr {
497 self.hash_expr(expr);
500 InlineAsmOperand::InOut { reg, late, expr } => {
501 reg.hash(&mut self.s);
502 late.hash(&mut self.s);
503 self.hash_expr(expr);
505 InlineAsmOperand::SplitInOut {
511 reg.hash(&mut self.s);
512 late.hash(&mut self.s);
513 self.hash_expr(in_expr);
514 if let Some(out_expr) = out_expr {
515 self.hash_expr(out_expr);
518 InlineAsmOperand::Const { expr } | InlineAsmOperand::Sym { expr } => self.hash_expr(expr),
522 ExprKind::LlvmInlineAsm(..) | ExprKind::Err => {},
523 ExprKind::Lit(ref l) => {
524 l.node.hash(&mut self.s);
526 ExprKind::Loop(ref b, ref i, _) => {
528 if let Some(i) = *i {
529 self.hash_name(i.ident.name);
532 ExprKind::Match(ref e, arms, ref s) => {
537 if let Some(ref e) = arm.guard {
540 self.hash_expr(&arm.body);
545 ExprKind::MethodCall(ref path, ref _tys, args, ref _fn_span) => {
546 self.hash_name(path.ident.name);
547 self.hash_exprs(args);
549 ExprKind::Repeat(ref e, ref l_id) => {
551 self.hash_body(l_id.body);
553 ExprKind::Ret(ref e) => {
554 if let Some(ref e) = *e {
558 ExprKind::Path(ref qpath) => {
559 self.hash_qpath(qpath);
561 ExprKind::Struct(ref path, fields, ref expr) => {
562 self.hash_qpath(path);
565 self.hash_name(f.ident.name);
566 self.hash_expr(&f.expr);
569 if let Some(ref e) = *expr {
573 ExprKind::Tup(tup) => {
574 self.hash_exprs(tup);
576 ExprKind::Array(v) => {
579 ExprKind::Unary(lop, ref le) => {
580 lop.hash_stable(&mut self.cx.tcx.get_stable_hashing_context(), &mut self.s);
586 pub fn hash_exprs(&mut self, e: &[Expr<'_>]) {
592 pub fn hash_name(&mut self, n: Symbol) {
593 n.as_str().hash(&mut self.s);
596 pub fn hash_qpath(&mut self, p: &QPath<'_>) {
598 QPath::Resolved(_, ref path) => {
599 self.hash_path(path);
601 QPath::TypeRelative(_, ref path) => {
602 self.hash_name(path.ident.name);
605 // self.cx.tables.qpath_res(p, id).hash(&mut self.s);
608 pub fn hash_path(&mut self, p: &Path<'_>) {
609 p.is_global().hash(&mut self.s);
610 for p in p.segments {
611 self.hash_name(p.ident.name);
615 pub fn hash_stmt(&mut self, b: &Stmt<'_>) {
616 std::mem::discriminant(&b.kind).hash(&mut self.s);
619 StmtKind::Local(local) => {
620 if let Some(ref init) = local.init {
621 self.hash_expr(init);
624 StmtKind::Item(..) => {},
625 StmtKind::Expr(expr) | StmtKind::Semi(expr) => {
626 self.hash_expr(expr);
631 pub fn hash_guard(&mut self, g: &Guard<'_>) {
633 Guard::If(ref expr) => {
634 self.hash_expr(expr);
639 pub fn hash_lifetime(&mut self, lifetime: &Lifetime) {
640 std::mem::discriminant(&lifetime.name).hash(&mut self.s);
641 if let LifetimeName::Param(ref name) = lifetime.name {
642 std::mem::discriminant(name).hash(&mut self.s);
644 ParamName::Plain(ref ident) => {
645 ident.name.hash(&mut self.s);
647 ParamName::Fresh(ref size) => {
648 size.hash(&mut self.s);
650 ParamName::Error => {},
655 pub fn hash_ty(&mut self, ty: &Ty<'_>) {
656 self.hash_tykind(&ty.kind);
659 pub fn hash_tykind(&mut self, ty: &TyKind<'_>) {
660 std::mem::discriminant(ty).hash(&mut self.s);
662 TyKind::Slice(ty) => {
665 TyKind::Array(ty, anon_const) => {
667 self.hash_body(anon_const.body);
669 TyKind::Ptr(mut_ty) => {
670 self.hash_ty(&mut_ty.ty);
671 mut_ty.mutbl.hash(&mut self.s);
673 TyKind::Rptr(lifetime, mut_ty) => {
674 self.hash_lifetime(lifetime);
675 self.hash_ty(&mut_ty.ty);
676 mut_ty.mutbl.hash(&mut self.s);
678 TyKind::BareFn(bfn) => {
679 bfn.unsafety.hash(&mut self.s);
680 bfn.abi.hash(&mut self.s);
681 for arg in bfn.decl.inputs {
684 match bfn.decl.output {
685 FnRetTy::DefaultReturn(_) => {
686 ().hash(&mut self.s);
688 FnRetTy::Return(ref ty) => {
692 bfn.decl.c_variadic.hash(&mut self.s);
694 TyKind::Tup(ty_list) => {
699 TyKind::Path(qpath) => match qpath {
700 QPath::Resolved(ref maybe_ty, ref path) => {
701 if let Some(ref ty) = maybe_ty {
704 for segment in path.segments {
705 segment.ident.name.hash(&mut self.s);
708 QPath::TypeRelative(ref ty, ref segment) => {
710 segment.ident.name.hash(&mut self.s);
713 TyKind::Def(_, arg_list) => {
714 for arg in *arg_list {
716 GenericArg::Lifetime(ref l) => self.hash_lifetime(l),
717 GenericArg::Type(ref ty) => self.hash_ty(&ty),
718 GenericArg::Const(ref ca) => self.hash_body(ca.value.body),
722 TyKind::TraitObject(_, lifetime) => {
723 self.hash_lifetime(lifetime);
725 TyKind::Typeof(anon_const) => {
726 self.hash_body(anon_const.body);
728 TyKind::Err | TyKind::Infer | TyKind::Never => {},
732 pub fn hash_body(&mut self, body_id: BodyId) {
733 // swap out TypeckTables when hashing a body
734 let old_tables = self.tables;
735 self.tables = self.cx.tcx.body_tables(body_id);
736 self.hash_expr(&self.cx.tcx.hir().body(body_id).value);
737 self.tables = old_tables;