1 use crate::consts::{constant_context, constant_simple};
2 use crate::differing_macro_contexts;
3 use crate::source::snippet_opt;
4 use rustc_ast::ast::InlineAsmTemplatePiece;
5 use rustc_data_structures::fx::FxHashMap;
6 use rustc_data_structures::stable_hasher::{HashStable, StableHasher};
7 use rustc_hir::def::Res;
9 BinOpKind, Block, BlockCheckMode, BodyId, BorrowKind, CaptureBy, Expr, ExprField, ExprKind, FnRetTy, GenericArg,
10 GenericArgs, Guard, HirId, InlineAsmOperand, Lifetime, LifetimeName, ParamName, Pat, PatField, PatKind, Path,
11 PathSegment, QPath, Stmt, StmtKind, Ty, TyKind, TypeBinding,
13 use rustc_lexer::{tokenize, TokenKind};
14 use rustc_lint::LateContext;
15 use rustc_middle::ich::StableHashingContextProvider;
16 use rustc_middle::ty::TypeckResults;
17 use rustc_span::Symbol;
20 /// Type used to check whether two ast are the same. This is different from the
22 /// `==` on ast types as this operator would compare true equality with ID and
25 /// Note that some expressions kinds are not considered but could be added.
26 pub struct SpanlessEq<'a, 'tcx> {
27 /// Context used to evaluate constant expressions.
28 cx: &'a LateContext<'tcx>,
29 maybe_typeck_results: Option<&'tcx TypeckResults<'tcx>>,
30 allow_side_effects: bool,
31 expr_fallback: Option<Box<dyn FnMut(&Expr<'_>, &Expr<'_>) -> bool + 'a>>,
34 impl<'a, 'tcx> SpanlessEq<'a, 'tcx> {
35 pub fn new(cx: &'a LateContext<'tcx>) -> Self {
38 maybe_typeck_results: cx.maybe_typeck_results(),
39 allow_side_effects: true,
44 /// Consider expressions containing potential side effects as not equal.
45 pub fn deny_side_effects(self) -> Self {
47 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 fn inter_expr(&mut self) -> HirEqInterExpr<'_, 'a, 'tcx> {
64 locals: FxHashMap::default(),
68 pub fn eq_block(&mut self, left: &Block<'_>, right: &Block<'_>) -> bool {
69 self.inter_expr().eq_block(left, right)
72 pub fn eq_expr(&mut self, left: &Expr<'_>, right: &Expr<'_>) -> bool {
73 self.inter_expr().eq_expr(left, right)
76 pub fn eq_path_segment(&mut self, left: &PathSegment<'_>, right: &PathSegment<'_>) -> bool {
77 self.inter_expr().eq_path_segment(left, right)
80 pub fn eq_path_segments(&mut self, left: &[PathSegment<'_>], right: &[PathSegment<'_>]) -> bool {
81 self.inter_expr().eq_path_segments(left, right)
85 struct HirEqInterExpr<'a, 'b, 'tcx> {
86 inner: &'a mut SpanlessEq<'b, 'tcx>,
88 // When binding are declared, the binding ID in the left expression is mapped to the one on the
89 // right. For example, when comparing `{ let x = 1; x + 2 }` and `{ let y = 1; y + 2 }`,
90 // these blocks are considered equal since `x` is mapped to `y`.
91 locals: FxHashMap<HirId, HirId>,
94 impl HirEqInterExpr<'_, '_, '_> {
95 fn eq_stmt(&mut self, left: &Stmt<'_>, right: &Stmt<'_>) -> bool {
96 match (&left.kind, &right.kind) {
97 (&StmtKind::Local(ref l), &StmtKind::Local(ref r)) => {
98 self.eq_pat(&l.pat, &r.pat)
99 && both(&l.ty, &r.ty, |l, r| self.eq_ty(l, r))
100 && both(&l.init, &r.init, |l, r| self.eq_expr(l, r))
102 (&StmtKind::Expr(ref l), &StmtKind::Expr(ref r)) | (&StmtKind::Semi(ref l), &StmtKind::Semi(ref r)) => {
109 /// Checks whether two blocks are the same.
110 fn eq_block(&mut self, left: &Block<'_>, right: &Block<'_>) -> bool {
111 match (left.stmts, left.expr, right.stmts, right.expr) {
112 ([], None, [], None) => {
113 // For empty blocks, check to see if the tokens are equal. This will catch the case where a macro
114 // expanded to nothing, or the cfg attribute was used.
115 let (left, right) = match (
116 snippet_opt(self.inner.cx, left.span),
117 snippet_opt(self.inner.cx, right.span),
119 (Some(left), Some(right)) => (left, right),
122 let mut left_pos = 0;
123 let left = tokenize(&left)
125 let end = left_pos + t.len;
126 let s = &left[left_pos..end];
133 TokenKind::LineComment { .. } | TokenKind::BlockComment { .. } | TokenKind::Whitespace
137 let mut right_pos = 0;
138 let right = tokenize(&right)
140 let end = right_pos + t.len;
141 let s = &right[right_pos..end];
148 TokenKind::LineComment { .. } | TokenKind::BlockComment { .. } | TokenKind::Whitespace
155 over(&left.stmts, &right.stmts, |l, r| self.eq_stmt(l, r))
156 && both(&left.expr, &right.expr, |l, r| self.eq_expr(l, r))
161 #[allow(clippy::similar_names)]
162 fn eq_expr(&mut self, left: &Expr<'_>, right: &Expr<'_>) -> bool {
163 if !self.inner.allow_side_effects && differing_macro_contexts(left.span, right.span) {
167 if let Some(typeck_results) = self.inner.maybe_typeck_results {
168 if let (Some(l), Some(r)) = (
169 constant_simple(self.inner.cx, typeck_results, left),
170 constant_simple(self.inner.cx, typeck_results, right),
179 &reduce_exprkind(self.inner.cx, &left.kind),
180 &reduce_exprkind(self.inner.cx, &right.kind),
182 (&ExprKind::AddrOf(lb, l_mut, ref le), &ExprKind::AddrOf(rb, r_mut, ref re)) => {
183 lb == rb && l_mut == r_mut && self.eq_expr(le, re)
185 (&ExprKind::Continue(li), &ExprKind::Continue(ri)) => {
186 both(&li.label, &ri.label, |l, r| l.ident.name == r.ident.name)
188 (&ExprKind::Assign(ref ll, ref lr, _), &ExprKind::Assign(ref rl, ref rr, _)) => {
189 self.inner.allow_side_effects && self.eq_expr(ll, rl) && self.eq_expr(lr, rr)
191 (&ExprKind::AssignOp(ref lo, ref ll, ref lr), &ExprKind::AssignOp(ref ro, ref rl, ref rr)) => {
192 self.inner.allow_side_effects && lo.node == ro.node && self.eq_expr(ll, rl) && self.eq_expr(lr, rr)
194 (&ExprKind::Block(ref l, _), &ExprKind::Block(ref r, _)) => self.eq_block(l, r),
195 (&ExprKind::Binary(l_op, ref ll, ref lr), &ExprKind::Binary(r_op, ref rl, ref rr)) => {
196 l_op.node == r_op.node && self.eq_expr(ll, rl) && self.eq_expr(lr, rr)
197 || swap_binop(l_op.node, ll, lr).map_or(false, |(l_op, ll, lr)| {
198 l_op == r_op.node && self.eq_expr(ll, rl) && self.eq_expr(lr, rr)
201 (&ExprKind::Break(li, ref le), &ExprKind::Break(ri, ref re)) => {
202 both(&li.label, &ri.label, |l, r| l.ident.name == r.ident.name)
203 && both(le, re, |l, r| self.eq_expr(l, r))
205 (&ExprKind::Box(ref l), &ExprKind::Box(ref r)) => self.eq_expr(l, r),
206 (&ExprKind::Call(l_fun, l_args), &ExprKind::Call(r_fun, r_args)) => {
207 self.inner.allow_side_effects && self.eq_expr(l_fun, r_fun) && self.eq_exprs(l_args, r_args)
209 (&ExprKind::Cast(ref lx, ref lt), &ExprKind::Cast(ref rx, ref rt))
210 | (&ExprKind::Type(ref lx, ref lt), &ExprKind::Type(ref rx, ref rt)) => {
211 self.eq_expr(lx, rx) && self.eq_ty(lt, rt)
213 (&ExprKind::Field(ref l_f_exp, ref l_f_ident), &ExprKind::Field(ref r_f_exp, ref r_f_ident)) => {
214 l_f_ident.name == r_f_ident.name && self.eq_expr(l_f_exp, r_f_exp)
216 (&ExprKind::Index(ref la, ref li), &ExprKind::Index(ref ra, ref ri)) => {
217 self.eq_expr(la, ra) && self.eq_expr(li, ri)
219 (&ExprKind::If(ref lc, ref lt, ref le), &ExprKind::If(ref rc, ref rt, ref re)) => {
220 self.eq_expr(lc, rc) && self.eq_expr(&**lt, &**rt) && both(le, re, |l, r| self.eq_expr(l, r))
222 (&ExprKind::Lit(ref l), &ExprKind::Lit(ref r)) => l.node == r.node,
223 (&ExprKind::Loop(ref lb, ref ll, ref lls, _), &ExprKind::Loop(ref rb, ref rl, ref rls, _)) => {
224 lls == rls && self.eq_block(lb, rb) && both(ll, rl, |l, r| l.ident.name == r.ident.name)
226 (&ExprKind::Match(ref le, ref la, ref ls), &ExprKind::Match(ref re, ref ra, ref rs)) => {
228 && self.eq_expr(le, re)
229 && over(la, ra, |l, r| {
230 self.eq_pat(&l.pat, &r.pat)
231 && both(&l.guard, &r.guard, |l, r| self.eq_guard(l, r))
232 && self.eq_expr(&l.body, &r.body)
235 (&ExprKind::MethodCall(l_path, _, l_args, _), &ExprKind::MethodCall(r_path, _, r_args, _)) => {
236 self.inner.allow_side_effects && self.eq_path_segment(l_path, r_path) && self.eq_exprs(l_args, r_args)
238 (&ExprKind::Repeat(ref le, ref ll_id), &ExprKind::Repeat(ref re, ref rl_id)) => {
239 let mut celcx = constant_context(self.inner.cx, self.inner.cx.tcx.typeck_body(ll_id.body));
240 let ll = celcx.expr(&self.inner.cx.tcx.hir().body(ll_id.body).value);
241 let mut celcx = constant_context(self.inner.cx, self.inner.cx.tcx.typeck_body(rl_id.body));
242 let rl = celcx.expr(&self.inner.cx.tcx.hir().body(rl_id.body).value);
244 self.eq_expr(le, re) && ll == rl
246 (&ExprKind::Ret(ref l), &ExprKind::Ret(ref r)) => both(l, r, |l, r| self.eq_expr(l, r)),
247 (&ExprKind::Path(ref l), &ExprKind::Path(ref r)) => self.eq_qpath(l, r),
248 (&ExprKind::Struct(ref l_path, ref lf, ref lo), &ExprKind::Struct(ref r_path, ref rf, ref ro)) => {
249 self.eq_qpath(l_path, r_path)
250 && both(lo, ro, |l, r| self.eq_expr(l, r))
251 && over(lf, rf, |l, r| self.eq_expr_field(l, r))
253 (&ExprKind::Tup(l_tup), &ExprKind::Tup(r_tup)) => self.eq_exprs(l_tup, r_tup),
254 (&ExprKind::Unary(l_op, ref le), &ExprKind::Unary(r_op, ref re)) => l_op == r_op && self.eq_expr(le, re),
255 (&ExprKind::Array(l), &ExprKind::Array(r)) => self.eq_exprs(l, r),
256 (&ExprKind::DropTemps(ref le), &ExprKind::DropTemps(ref re)) => self.eq_expr(le, re),
259 is_eq || self.inner.expr_fallback.as_mut().map_or(false, |f| f(left, right))
262 fn eq_exprs(&mut self, left: &[Expr<'_>], right: &[Expr<'_>]) -> bool {
263 over(left, right, |l, r| self.eq_expr(l, r))
266 fn eq_expr_field(&mut self, left: &ExprField<'_>, right: &ExprField<'_>) -> bool {
267 left.ident.name == right.ident.name && self.eq_expr(&left.expr, &right.expr)
270 fn eq_guard(&mut self, left: &Guard<'_>, right: &Guard<'_>) -> bool {
271 match (left, right) {
272 (Guard::If(l), Guard::If(r)) => self.eq_expr(l, r),
273 (Guard::IfLet(lp, le), Guard::IfLet(rp, re)) => self.eq_pat(lp, rp) && self.eq_expr(le, re),
278 fn eq_generic_arg(&mut self, left: &GenericArg<'_>, right: &GenericArg<'_>) -> bool {
279 match (left, right) {
280 (GenericArg::Lifetime(l_lt), GenericArg::Lifetime(r_lt)) => Self::eq_lifetime(l_lt, r_lt),
281 (GenericArg::Type(l_ty), GenericArg::Type(r_ty)) => self.eq_ty(l_ty, r_ty),
286 fn eq_lifetime(left: &Lifetime, right: &Lifetime) -> bool {
287 left.name == right.name
290 fn eq_pat_field(&mut self, left: &PatField<'_>, right: &PatField<'_>) -> bool {
291 let (PatField { ident: li, pat: lp, .. }, PatField { ident: ri, pat: rp, .. }) = (&left, &right);
292 li.name == ri.name && self.eq_pat(lp, rp)
295 /// Checks whether two patterns are the same.
296 fn eq_pat(&mut self, left: &Pat<'_>, right: &Pat<'_>) -> bool {
297 match (&left.kind, &right.kind) {
298 (&PatKind::Box(ref l), &PatKind::Box(ref r)) => self.eq_pat(l, r),
299 (&PatKind::Struct(ref lp, ref la, ..), &PatKind::Struct(ref rp, ref ra, ..)) => {
300 self.eq_qpath(lp, rp) && over(la, ra, |l, r| self.eq_pat_field(l, r))
302 (&PatKind::TupleStruct(ref lp, ref la, ls), &PatKind::TupleStruct(ref rp, ref ra, rs)) => {
303 self.eq_qpath(lp, rp) && over(la, ra, |l, r| self.eq_pat(l, r)) && ls == rs
305 (&PatKind::Binding(lb, li, _, ref lp), &PatKind::Binding(rb, ri, _, ref rp)) => {
306 let eq = lb == rb && both(lp, rp, |l, r| self.eq_pat(l, r));
308 self.locals.insert(li, ri);
312 (&PatKind::Path(ref l), &PatKind::Path(ref r)) => self.eq_qpath(l, r),
313 (&PatKind::Lit(ref l), &PatKind::Lit(ref r)) => self.eq_expr(l, r),
314 (&PatKind::Tuple(ref l, ls), &PatKind::Tuple(ref r, rs)) => {
315 ls == rs && over(l, r, |l, r| self.eq_pat(l, r))
317 (&PatKind::Range(ref ls, ref le, li), &PatKind::Range(ref rs, ref re, ri)) => {
318 both(ls, rs, |a, b| self.eq_expr(a, b)) && both(le, re, |a, b| self.eq_expr(a, b)) && (li == ri)
320 (&PatKind::Ref(ref le, ref lm), &PatKind::Ref(ref re, ref rm)) => lm == rm && self.eq_pat(le, re),
321 (&PatKind::Slice(ref ls, ref li, ref le), &PatKind::Slice(ref rs, ref ri, ref re)) => {
322 over(ls, rs, |l, r| self.eq_pat(l, r))
323 && over(le, re, |l, r| self.eq_pat(l, r))
324 && both(li, ri, |l, r| self.eq_pat(l, r))
326 (&PatKind::Wild, &PatKind::Wild) => true,
331 #[allow(clippy::similar_names)]
332 fn eq_qpath(&mut self, left: &QPath<'_>, right: &QPath<'_>) -> bool {
333 match (left, right) {
334 (&QPath::Resolved(ref lty, ref lpath), &QPath::Resolved(ref rty, ref rpath)) => {
335 both(lty, rty, |l, r| self.eq_ty(l, r)) && self.eq_path(lpath, rpath)
337 (&QPath::TypeRelative(ref lty, ref lseg), &QPath::TypeRelative(ref rty, ref rseg)) => {
338 self.eq_ty(lty, rty) && self.eq_path_segment(lseg, rseg)
340 (&QPath::LangItem(llang_item, _), &QPath::LangItem(rlang_item, _)) => llang_item == rlang_item,
345 fn eq_path(&mut self, left: &Path<'_>, right: &Path<'_>) -> bool {
346 match (left.res, right.res) {
347 (Res::Local(l), Res::Local(r)) => l == r || self.locals.get(&l) == Some(&r),
348 (Res::Local(_), _) | (_, Res::Local(_)) => false,
349 _ => over(&left.segments, &right.segments, |l, r| self.eq_path_segment(l, r)),
353 fn eq_path_parameters(&mut self, left: &GenericArgs<'_>, right: &GenericArgs<'_>) -> bool {
354 if !(left.parenthesized || right.parenthesized) {
355 over(&left.args, &right.args, |l, r| self.eq_generic_arg(l, r)) // FIXME(flip1995): may not work
356 && over(&left.bindings, &right.bindings, |l, r| self.eq_type_binding(l, r))
357 } else if left.parenthesized && right.parenthesized {
358 over(left.inputs(), right.inputs(), |l, r| self.eq_ty(l, r))
359 && both(&Some(&left.bindings[0].ty()), &Some(&right.bindings[0].ty()), |l, r| {
367 pub fn eq_path_segments(&mut self, left: &[PathSegment<'_>], right: &[PathSegment<'_>]) -> bool {
368 left.len() == right.len() && left.iter().zip(right).all(|(l, r)| self.eq_path_segment(l, r))
371 pub fn eq_path_segment(&mut self, left: &PathSegment<'_>, right: &PathSegment<'_>) -> bool {
372 // The == of idents doesn't work with different contexts,
373 // we have to be explicit about hygiene
374 left.ident.name == right.ident.name && both(&left.args, &right.args, |l, r| self.eq_path_parameters(l, r))
377 #[allow(clippy::similar_names)]
378 fn eq_ty(&mut self, left: &Ty<'_>, right: &Ty<'_>) -> bool {
379 match (&left.kind, &right.kind) {
380 (&TyKind::Slice(ref l_vec), &TyKind::Slice(ref r_vec)) => self.eq_ty(l_vec, r_vec),
381 (&TyKind::Array(ref lt, ref ll_id), &TyKind::Array(ref rt, ref rl_id)) => {
382 let cx = self.inner.cx;
384 |body| constant_context(cx, cx.tcx.typeck_body(body)).expr(&cx.tcx.hir().body(body).value);
385 self.eq_ty(lt, rt) && eval_const(ll_id.body) == eval_const(rl_id.body)
387 (&TyKind::Ptr(ref l_mut), &TyKind::Ptr(ref r_mut)) => {
388 l_mut.mutbl == r_mut.mutbl && self.eq_ty(&*l_mut.ty, &*r_mut.ty)
390 (&TyKind::Rptr(_, ref l_rmut), &TyKind::Rptr(_, ref r_rmut)) => {
391 l_rmut.mutbl == r_rmut.mutbl && self.eq_ty(&*l_rmut.ty, &*r_rmut.ty)
393 (&TyKind::Path(ref l), &TyKind::Path(ref r)) => self.eq_qpath(l, r),
394 (&TyKind::Tup(ref l), &TyKind::Tup(ref r)) => over(l, r, |l, r| self.eq_ty(l, r)),
395 (&TyKind::Infer, &TyKind::Infer) => true,
400 fn eq_type_binding(&mut self, left: &TypeBinding<'_>, right: &TypeBinding<'_>) -> bool {
401 left.ident.name == right.ident.name && self.eq_ty(&left.ty(), &right.ty())
405 /// Some simple reductions like `{ return }` => `return`
406 fn reduce_exprkind<'hir>(cx: &LateContext<'_>, kind: &'hir ExprKind<'hir>) -> &'hir ExprKind<'hir> {
407 if let ExprKind::Block(block, _) = kind {
408 match (block.stmts, block.expr) {
409 // From an `if let` expression without an `else` block. The arm for the implicit wild pattern is an empty
410 // block with an empty span.
411 ([], None) if block.span.is_empty() => &ExprKind::Tup(&[]),
413 ([], None) => match snippet_opt(cx, block.span) {
414 // Don't reduce if there are any tokens contained in the braces
421 TokenKind::LineComment { .. } | TokenKind::BlockComment { .. } | TokenKind::Whitespace
424 .ne([TokenKind::OpenBrace, TokenKind::CloseBrace].iter().cloned()) =>
428 _ => &ExprKind::Tup(&[]),
430 ([], Some(expr)) => match expr.kind {
431 // `{ return .. }` => `return ..`
432 ExprKind::Ret(..) => &expr.kind,
435 ([stmt], None) => match stmt.kind {
436 StmtKind::Expr(expr) | StmtKind::Semi(expr) => match expr.kind {
437 // `{ return ..; }` => `return ..`
438 ExprKind::Ret(..) => &expr.kind,
454 ) -> Option<(BinOpKind, &'a Expr<'a>, &'a Expr<'a>)> {
456 BinOpKind::Add | BinOpKind::Eq | BinOpKind::Ne | BinOpKind::BitAnd | BinOpKind::BitXor | BinOpKind::BitOr => {
457 Some((binop, rhs, lhs))
459 BinOpKind::Lt => Some((BinOpKind::Gt, rhs, lhs)),
460 BinOpKind::Le => Some((BinOpKind::Ge, rhs, lhs)),
461 BinOpKind::Ge => Some((BinOpKind::Le, rhs, lhs)),
462 BinOpKind::Gt => Some((BinOpKind::Lt, rhs, lhs)),
463 BinOpKind::Mul // Not always commutative, e.g. with matrices. See issue #5698
470 | BinOpKind::Or => None,
474 /// Checks if the two `Option`s are both `None` or some equal values as per
476 pub fn both<X>(l: &Option<X>, r: &Option<X>, mut eq_fn: impl FnMut(&X, &X) -> bool) -> bool {
478 .map_or_else(|| r.is_none(), |x| r.as_ref().map_or(false, |y| eq_fn(x, y)))
481 /// Checks if two slices are equal as per `eq_fn`.
482 pub fn over<X>(left: &[X], right: &[X], mut eq_fn: impl FnMut(&X, &X) -> bool) -> bool {
483 left.len() == right.len() && left.iter().zip(right).all(|(x, y)| eq_fn(x, y))
486 /// Checks if two expressions evaluate to the same value, and don't contain any side effects.
487 pub fn eq_expr_value(cx: &LateContext<'_>, left: &Expr<'_>, right: &Expr<'_>) -> bool {
488 SpanlessEq::new(cx).deny_side_effects().eq_expr(left, right)
491 /// Type used to hash an ast element. This is different from the `Hash` trait
492 /// on ast types as this
493 /// trait would consider IDs and spans.
495 /// All expressions kind are hashed, but some might have a weaker hash.
496 pub struct SpanlessHash<'a, 'tcx> {
497 /// Context used to evaluate constant expressions.
498 cx: &'a LateContext<'tcx>,
499 maybe_typeck_results: Option<&'tcx TypeckResults<'tcx>>,
503 impl<'a, 'tcx> SpanlessHash<'a, 'tcx> {
504 pub fn new(cx: &'a LateContext<'tcx>) -> Self {
507 maybe_typeck_results: cx.maybe_typeck_results(),
508 s: StableHasher::new(),
512 pub fn finish(self) -> u64 {
516 pub fn hash_block(&mut self, b: &Block<'_>) {
521 if let Some(ref e) = b.expr {
526 BlockCheckMode::DefaultBlock => 0,
527 BlockCheckMode::UnsafeBlock(_) => 1,
528 BlockCheckMode::PushUnsafeBlock(_) => 2,
529 BlockCheckMode::PopUnsafeBlock(_) => 3,
534 #[allow(clippy::many_single_char_names, clippy::too_many_lines)]
535 pub fn hash_expr(&mut self, e: &Expr<'_>) {
536 let simple_const = self
537 .maybe_typeck_results
538 .and_then(|typeck_results| constant_simple(self.cx, typeck_results, e));
540 // const hashing may result in the same hash as some unrelated node, so add a sort of
541 // discriminant depending on which path we're choosing next
542 simple_const.is_some().hash(&mut self.s);
544 if let Some(e) = simple_const {
545 return e.hash(&mut self.s);
548 std::mem::discriminant(&e.kind).hash(&mut self.s);
551 ExprKind::AddrOf(kind, m, ref e) => {
553 BorrowKind::Ref => 0,
554 BorrowKind::Raw => 1,
560 ExprKind::Continue(i) => {
561 if let Some(i) = i.label {
562 self.hash_name(i.ident.name);
565 ExprKind::Assign(ref l, ref r, _) => {
569 ExprKind::AssignOp(ref o, ref l, ref r) => {
571 .hash_stable(&mut self.cx.tcx.get_stable_hashing_context(), &mut self.s);
575 ExprKind::Block(ref b, _) => {
578 ExprKind::Binary(op, ref l, ref r) => {
580 .hash_stable(&mut self.cx.tcx.get_stable_hashing_context(), &mut self.s);
584 ExprKind::Break(i, ref j) => {
585 if let Some(i) = i.label {
586 self.hash_name(i.ident.name);
588 if let Some(ref j) = *j {
592 ExprKind::Box(ref e) | ExprKind::DropTemps(ref e) | ExprKind::Yield(ref e, _) => {
595 ExprKind::Call(ref fun, args) => {
597 self.hash_exprs(args);
599 ExprKind::Cast(ref e, ref ty) | ExprKind::Type(ref e, ref ty) => {
603 ExprKind::Closure(cap, _, eid, _, _) => {
605 CaptureBy::Value => 0,
609 // closures inherit TypeckResults
610 self.hash_expr(&self.cx.tcx.hir().body(eid).value);
612 ExprKind::Field(ref e, ref f) => {
614 self.hash_name(f.name);
616 ExprKind::Index(ref a, ref i) => {
620 ExprKind::InlineAsm(ref asm) => {
621 for piece in asm.template {
623 InlineAsmTemplatePiece::String(s) => s.hash(&mut self.s),
624 InlineAsmTemplatePiece::Placeholder {
629 operand_idx.hash(&mut self.s);
630 modifier.hash(&mut self.s);
634 asm.options.hash(&mut self.s);
635 for (op, _op_sp) in asm.operands {
637 InlineAsmOperand::In { reg, expr } => {
638 reg.hash(&mut self.s);
639 self.hash_expr(expr);
641 InlineAsmOperand::Out { reg, late, expr } => {
642 reg.hash(&mut self.s);
643 late.hash(&mut self.s);
644 if let Some(expr) = expr {
645 self.hash_expr(expr);
648 InlineAsmOperand::InOut { reg, late, expr } => {
649 reg.hash(&mut self.s);
650 late.hash(&mut self.s);
651 self.hash_expr(expr);
653 InlineAsmOperand::SplitInOut {
659 reg.hash(&mut self.s);
660 late.hash(&mut self.s);
661 self.hash_expr(in_expr);
662 if let Some(out_expr) = out_expr {
663 self.hash_expr(out_expr);
666 InlineAsmOperand::Const { expr } | InlineAsmOperand::Sym { expr } => self.hash_expr(expr),
670 ExprKind::LlvmInlineAsm(..) | ExprKind::Err => {},
671 ExprKind::Lit(ref l) => {
672 l.node.hash(&mut self.s);
674 ExprKind::Loop(ref b, ref i, ..) => {
676 if let Some(i) = *i {
677 self.hash_name(i.ident.name);
680 ExprKind::If(ref cond, ref then, ref else_opt) => {
681 let c: fn(_, _, _) -> _ = ExprKind::If;
683 self.hash_expr(cond);
684 self.hash_expr(&**then);
685 if let Some(ref e) = *else_opt {
689 ExprKind::Match(ref e, arms, ref s) => {
694 if let Some(ref e) = arm.guard {
697 self.hash_expr(&arm.body);
702 ExprKind::MethodCall(ref path, ref _tys, args, ref _fn_span) => {
703 self.hash_name(path.ident.name);
704 self.hash_exprs(args);
706 ExprKind::ConstBlock(ref l_id) => {
707 self.hash_body(l_id.body);
709 ExprKind::Repeat(ref e, ref l_id) => {
711 self.hash_body(l_id.body);
713 ExprKind::Ret(ref e) => {
714 if let Some(ref e) = *e {
718 ExprKind::Path(ref qpath) => {
719 self.hash_qpath(qpath);
721 ExprKind::Struct(ref path, fields, ref expr) => {
722 self.hash_qpath(path);
725 self.hash_name(f.ident.name);
726 self.hash_expr(&f.expr);
729 if let Some(ref e) = *expr {
733 ExprKind::Tup(tup) => {
734 self.hash_exprs(tup);
736 ExprKind::Array(v) => {
739 ExprKind::Unary(lop, ref le) => {
740 lop.hash_stable(&mut self.cx.tcx.get_stable_hashing_context(), &mut self.s);
746 pub fn hash_exprs(&mut self, e: &[Expr<'_>]) {
752 pub fn hash_name(&mut self, n: Symbol) {
753 n.as_str().hash(&mut self.s);
756 pub fn hash_qpath(&mut self, p: &QPath<'_>) {
758 QPath::Resolved(_, ref path) => {
759 self.hash_path(path);
761 QPath::TypeRelative(_, ref path) => {
762 self.hash_name(path.ident.name);
764 QPath::LangItem(lang_item, ..) => {
765 lang_item.hash_stable(&mut self.cx.tcx.get_stable_hashing_context(), &mut self.s);
768 // self.maybe_typeck_results.unwrap().qpath_res(p, id).hash(&mut self.s);
771 pub fn hash_path(&mut self, path: &Path<'_>) {
773 // constant hash since equality is dependant on inter-expression context
774 Res::Local(_) => 1_usize.hash(&mut self.s),
776 for seg in path.segments {
777 self.hash_name(seg.ident.name);
783 pub fn hash_stmt(&mut self, b: &Stmt<'_>) {
784 std::mem::discriminant(&b.kind).hash(&mut self.s);
787 StmtKind::Local(local) => {
788 if let Some(ref init) = local.init {
789 self.hash_expr(init);
792 StmtKind::Item(..) => {},
793 StmtKind::Expr(expr) | StmtKind::Semi(expr) => {
794 self.hash_expr(expr);
799 pub fn hash_guard(&mut self, g: &Guard<'_>) {
801 Guard::If(ref expr) | Guard::IfLet(_, ref expr) => {
802 self.hash_expr(expr);
807 pub fn hash_lifetime(&mut self, lifetime: &Lifetime) {
808 std::mem::discriminant(&lifetime.name).hash(&mut self.s);
809 if let LifetimeName::Param(ref name) = lifetime.name {
810 std::mem::discriminant(name).hash(&mut self.s);
812 ParamName::Plain(ref ident) => {
813 ident.name.hash(&mut self.s);
815 ParamName::Fresh(ref size) => {
816 size.hash(&mut self.s);
818 ParamName::Error => {},
823 pub fn hash_ty(&mut self, ty: &Ty<'_>) {
824 self.hash_tykind(&ty.kind);
827 pub fn hash_tykind(&mut self, ty: &TyKind<'_>) {
828 std::mem::discriminant(ty).hash(&mut self.s);
830 TyKind::Slice(ty) => {
833 TyKind::Array(ty, anon_const) => {
835 self.hash_body(anon_const.body);
837 TyKind::Ptr(mut_ty) => {
838 self.hash_ty(&mut_ty.ty);
839 mut_ty.mutbl.hash(&mut self.s);
841 TyKind::Rptr(lifetime, mut_ty) => {
842 self.hash_lifetime(lifetime);
843 self.hash_ty(&mut_ty.ty);
844 mut_ty.mutbl.hash(&mut self.s);
846 TyKind::BareFn(bfn) => {
847 bfn.unsafety.hash(&mut self.s);
848 bfn.abi.hash(&mut self.s);
849 for arg in bfn.decl.inputs {
852 match bfn.decl.output {
853 FnRetTy::DefaultReturn(_) => {
854 ().hash(&mut self.s);
856 FnRetTy::Return(ref ty) => {
860 bfn.decl.c_variadic.hash(&mut self.s);
862 TyKind::Tup(ty_list) => {
867 TyKind::Path(qpath) => match qpath {
868 QPath::Resolved(ref maybe_ty, ref path) => {
869 if let Some(ref ty) = maybe_ty {
872 for segment in path.segments {
873 segment.ident.name.hash(&mut self.s);
874 self.hash_generic_args(segment.args().args);
877 QPath::TypeRelative(ref ty, ref segment) => {
879 segment.ident.name.hash(&mut self.s);
881 QPath::LangItem(lang_item, ..) => {
882 lang_item.hash(&mut self.s);
885 TyKind::OpaqueDef(_, arg_list) => {
886 self.hash_generic_args(arg_list);
888 TyKind::TraitObject(_, lifetime, _) => {
889 self.hash_lifetime(lifetime);
891 TyKind::Typeof(anon_const) => {
892 self.hash_body(anon_const.body);
894 TyKind::Err | TyKind::Infer | TyKind::Never => {},
898 pub fn hash_body(&mut self, body_id: BodyId) {
899 // swap out TypeckResults when hashing a body
900 let old_maybe_typeck_results = self.maybe_typeck_results.replace(self.cx.tcx.typeck_body(body_id));
901 self.hash_expr(&self.cx.tcx.hir().body(body_id).value);
902 self.maybe_typeck_results = old_maybe_typeck_results;
905 fn hash_generic_args(&mut self, arg_list: &[GenericArg<'_>]) {
906 for arg in arg_list {
908 GenericArg::Lifetime(ref l) => self.hash_lifetime(l),
909 GenericArg::Type(ref ty) => self.hash_ty(&ty),
910 GenericArg::Const(ref ca) => self.hash_body(ca.value.body),