bjoernager/rust
bjoernager/rust
1
Fork 0
Code Activity

Introduce DotDotPos.

Browse source 
This shrinks `hir::Pat` from 88 to 72 bytes.
This commit is contained in:
Nicholas Nethercote 2022-09-01 13:29:57 +10:00
parent 4314615ff8
commit e67f39f8bc
15 changed files with 85 additions and 47 deletions
Download patch file Download diff file Expand all files Collapse all files

11
compiler/rustc_ast_lowering/src/expr.rs
View file

@ -1128,8 +1128,11 @@ impl<'hir> LoweringContext<'_, 'hir> {
&mut ImplTraitContext::Disallowed(ImplTraitPosition::Path), &mut ImplTraitContext::Disallowed(ImplTraitPosition::Path),
); );
// Destructure like a tuple struct. // Destructure like a tuple struct.
let tuple_struct_pat = let tuple_struct_pat = hir::PatKind::TupleStruct(
hir::PatKind::TupleStruct(qpath, pats, rest.map(|r| r.0)); qpath,
pats,
hir::DotDotPos::new(rest.map(|r| r.0)),
);
return self.pat_without_dbm(lhs.span, tuple_struct_pat); return self.pat_without_dbm(lhs.span, tuple_struct_pat);
} }
} }
@ -1184,13 +1187,13 @@ impl<'hir> LoweringContext<'_, 'hir> {
ExprKind::Tup(elements) => { ExprKind::Tup(elements) => {
let (pats, rest) = let (pats, rest) =
self.destructure_sequence(elements, "tuple", eq_sign_span, assignments); self.destructure_sequence(elements, "tuple", eq_sign_span, assignments);
let tuple_pat = hir::PatKind::Tuple(pats, rest.map(|r| r.0)); let tuple_pat = hir::PatKind::Tuple(pats, hir::DotDotPos::new(rest.map(|r| r.0)));
return self.pat_without_dbm(lhs.span, tuple_pat); return self.pat_without_dbm(lhs.span, tuple_pat);
} }
ExprKind::Paren(e) => { ExprKind::Paren(e) => {
// We special-case `(..)` for consistency with patterns. // We special-case `(..)` for consistency with patterns.
if let ExprKind::Range(None, None, RangeLimits::HalfOpen) = e.kind { if let ExprKind::Range(None, None, RangeLimits::HalfOpen) = e.kind {
let tuple_pat = hir::PatKind::Tuple(&[], Some(0)); let tuple_pat = hir::PatKind::Tuple(&[], hir::DotDotPos::new(Some(0)));
return self.pat_without_dbm(lhs.span, tuple_pat); return self.pat_without_dbm(lhs.span, tuple_pat);
} else { } else {
return self.destructure_assign_mut(e, eq_sign_span, assignments); return self.destructure_assign_mut(e, eq_sign_span, assignments);

4
compiler/rustc_ast_lowering/src/pat.rs
View file

@ -116,7 +116,7 @@ impl<'a, 'hir> LoweringContext<'a, 'hir> {
&mut self, &mut self,
pats: &[P<Pat>], pats: &[P<Pat>],
ctx: &str, ctx: &str,
) -> (&'hir [hir::Pat<'hir>], Option<usize>) { ) -> (&'hir [hir::Pat<'hir>], hir::DotDotPos) {
let mut elems = Vec::with_capacity(pats.len()); let mut elems = Vec::with_capacity(pats.len());
let mut rest = None; let mut rest = None;
@ -160,7 +160,7 @@ impl<'a, 'hir> LoweringContext<'a, 'hir> {
} }
} }
(self.arena.alloc_from_iter(elems), rest.map(|(ddpos, _)| ddpos)) (self.arena.alloc_from_iter(elems), hir::DotDotPos::new(rest.map(|(ddpos, _)| ddpos)))
} }
/// Lower a slice pattern of form `[pat_0, ..., pat_n]` into /// Lower a slice pattern of form `[pat_0, ..., pat_n]` into

39
compiler/rustc_hir/src/hir.rs
View file

@ -1059,6 +1059,35 @@ impl fmt::Display for RangeEnd {
} }
} }
// Equivalent to `Option<usize>`. That type takes up 16 bytes on 64-bit, but
// this type only takes up 4 bytes, at the cost of being restricted to a
// maximum value of `u32::MAX - 1`. In practice, this is more than enough.
#[derive(Clone, Copy, PartialEq, Eq, Hash, HashStable_Generic)]
pub struct DotDotPos(u32);
impl DotDotPos {
// Panics if n >= u32::MAX.
pub fn new(n: Option<usize>) -> Self {
match n {
Some(n) => {
assert!(n < u32::MAX as usize);
Self(n as u32)
}
None => Self(u32::MAX),
}
}
pub fn as_opt_usize(&self) -> Option<usize> {
if self.0 == u32::MAX { None } else { Some(self.0 as usize) }
}
}
impl fmt::Debug for DotDotPos {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
self.as_opt_usize().fmt(f)
}
}
#[derive(Debug, HashStable_Generic)] #[derive(Debug, HashStable_Generic)]
pub enum PatKind<'hir> { pub enum PatKind<'hir> {
/// Represents a wildcard pattern (i.e., `_`). /// Represents a wildcard pattern (i.e., `_`).
@ -1075,9 +1104,9 @@ pub enum PatKind<'hir> {
Struct(QPath<'hir>, &'hir [PatField<'hir>], bool), Struct(QPath<'hir>, &'hir [PatField<'hir>], bool),
/// A tuple struct/variant pattern `Variant(x, y, .., z)`. /// A tuple struct/variant pattern `Variant(x, y, .., z)`.
/// If the `..` pattern fragment is present, then `Option<usize>` denotes its position. /// If the `..` pattern fragment is present, then `DotDotPos` denotes its position.
/// `0 <= position <= subpats.len()` /// `0 <= position <= subpats.len()`
TupleStruct(QPath<'hir>, &'hir [Pat<'hir>], Option<usize>), TupleStruct(QPath<'hir>, &'hir [Pat<'hir>], DotDotPos),
/// An or-pattern `A | B | C`. /// An or-pattern `A | B | C`.
/// Invariant: `pats.len() >= 2`. /// Invariant: `pats.len() >= 2`.
@ -1089,7 +1118,7 @@ pub enum PatKind<'hir> {
/// A tuple pattern (e.g., `(a, b)`). /// A tuple pattern (e.g., `(a, b)`).
/// If the `..` pattern fragment is present, then `Option<usize>` denotes its position. /// If the `..` pattern fragment is present, then `Option<usize>` denotes its position.
/// `0 <= position <= subpats.len()` /// `0 <= position <= subpats.len()`
Tuple(&'hir [Pat<'hir>], Option<usize>), Tuple(&'hir [Pat<'hir>], DotDotPos),
/// A `box` pattern. /// A `box` pattern.
Box(&'hir Pat<'hir>), Box(&'hir Pat<'hir>),
@ -3486,8 +3515,8 @@ mod size_asserts {
static_assert_size!(ItemKind<'_>, 48); static_assert_size!(ItemKind<'_>, 48);
static_assert_size!(Local<'_>, 64); static_assert_size!(Local<'_>, 64);
static_assert_size!(Param<'_>, 32); static_assert_size!(Param<'_>, 32);
static_assert_size!(Pat<'_>, 88); static_assert_size!(Pat<'_>, 72);
static_assert_size!(PatKind<'_>, 64); static_assert_size!(PatKind<'_>, 48);
static_assert_size!(Path<'_>, 48); static_assert_size!(Path<'_>, 48);
static_assert_size!(PathSegment<'_>, 56); static_assert_size!(PathSegment<'_>, 56);
static_assert_size!(QPath<'_>, 24); static_assert_size!(QPath<'_>, 24);

6
compiler/rustc_hir/src/pat_util.rs
View file

@ -35,7 +35,7 @@ pub trait EnumerateAndAdjustIterator {
fn enumerate_and_adjust( fn enumerate_and_adjust(
self, self,
expected_len: usize, expected_len: usize,
gap_pos: Option<usize>, gap_pos: hir::DotDotPos,
) -> EnumerateAndAdjust<Self> ) -> EnumerateAndAdjust<Self>
where where
Self: Sized; Self: Sized;
@ -45,7 +45,7 @@ impl<T: ExactSizeIterator> EnumerateAndAdjustIterator for T {
fn enumerate_and_adjust( fn enumerate_and_adjust(
self, self,
expected_len: usize, expected_len: usize,
gap_pos: Option<usize>, gap_pos: hir::DotDotPos,
) -> EnumerateAndAdjust<Self> ) -> EnumerateAndAdjust<Self>
where where
Self: Sized, Self: Sized,
@ -53,7 +53,7 @@ impl<T: ExactSizeIterator> EnumerateAndAdjustIterator for T {
let actual_len = self.len(); let actual_len = self.len();
EnumerateAndAdjust { EnumerateAndAdjust {
enumerate: self.enumerate(), enumerate: self.enumerate(),
gap_pos: gap_pos.unwrap_or(expected_len), gap_pos: gap_pos.as_opt_usize().unwrap_or(expected_len),
gap_len: expected_len - actual_len, gap_len: expected_len - actual_len,
} }
} }

5
compiler/rustc_hir_pretty/src/lib.rs
View file

@ -1761,7 +1761,8 @@ impl<'a> State<'a> {
PatKind::TupleStruct(ref qpath, elts, ddpos) => { PatKind::TupleStruct(ref qpath, elts, ddpos) => {
self.print_qpath(qpath, true); self.print_qpath(qpath, true);
self.popen(); self.popen();
if let Some(ddpos) = ddpos { if let Some(ddpos) = ddpos.as_opt_usize() {
let ddpos = ddpos as usize;
self.commasep(Inconsistent, &elts[..ddpos], |s, p| s.print_pat(p)); self.commasep(Inconsistent, &elts[..ddpos], |s, p| s.print_pat(p));
if ddpos != 0 { if ddpos != 0 {
self.word_space(","); self.word_space(",");
@ -1804,7 +1805,7 @@ impl<'a> State<'a> {
} }
PatKind::Tuple(elts, ddpos) => { PatKind::Tuple(elts, ddpos) => {
self.popen(); self.popen();
if let Some(ddpos) = ddpos { if let Some(ddpos) = ddpos.as_opt_usize() {
self.commasep(Inconsistent, &elts[..ddpos], |s, p| s.print_pat(p)); self.commasep(Inconsistent, &elts[..ddpos], |s, p| s.print_pat(p));
if ddpos != 0 { if ddpos != 0 {
self.word_space(","); self.word_space(",");

2
compiler/rustc_mir_build/src/thir/pattern/mod.rs
View file

@ -333,7 +333,7 @@ impl<'a, 'tcx> PatCtxt<'a, 'tcx> {
&mut self, &mut self,
pats: &'tcx [hir::Pat<'tcx>], pats: &'tcx [hir::Pat<'tcx>],
expected_len: usize, expected_len: usize,
gap_pos: Option<usize>, gap_pos: hir::DotDotPos,
) -> Vec<FieldPat<'tcx>> { ) -> Vec<FieldPat<'tcx>> {
pats.iter() pats.iter()
.enumerate_and_adjust(expected_len, gap_pos) .enumerate_and_adjust(expected_len, gap_pos)

11
compiler/rustc_passes/src/dead.rs
View file

@ -226,19 +226,16 @@ impl<'tcx> MarkSymbolVisitor<'tcx> {
lhs: &hir::Pat<'_>, lhs: &hir::Pat<'_>,
res: Res, res: Res,
pats: &[hir::Pat<'_>], pats: &[hir::Pat<'_>],
dotdot: Option<usize>, dotdot: hir::DotDotPos,
) { ) {
let variant = match self.typeck_results().node_type(lhs.hir_id).kind() { let variant = match self.typeck_results().node_type(lhs.hir_id).kind() {
ty::Adt(adt, _) => adt.variant_of_res(res), ty::Adt(adt, _) => adt.variant_of_res(res),
_ => span_bug!(lhs.span, "non-ADT in tuple struct pattern"), _ => span_bug!(lhs.span, "non-ADT in tuple struct pattern"),
}; };
let first_n = pats.iter().enumerate().take(dotdot.unwrap_or(pats.len())); let dotdot = dotdot.as_opt_usize().unwrap_or(pats.len());
let first_n = pats.iter().enumerate().take(dotdot);
let missing = variant.fields.len() - pats.len(); let missing = variant.fields.len() - pats.len();
let last_n = pats let last_n = pats.iter().enumerate().skip(dotdot).map(|(idx, pat)| (idx + missing, pat));
.iter()
.enumerate()
.skip(dotdot.unwrap_or(pats.len()))
.map(|(idx, pat)| (idx + missing, pat));
for (idx, pat) in first_n.chain(last_n) { for (idx, pat) in first_n.chain(last_n) {
if let PatKind::Wild = pat.kind { if let PatKind::Wild = pat.kind {
continue; continue;

8
compiler/rustc_typeck/src/check/pat.rs
View file

@ -981,7 +981,7 @@ impl<'a, 'tcx> FnCtxt<'a, 'tcx> {
pat: &'tcx Pat<'tcx>, pat: &'tcx Pat<'tcx>,
qpath: &'tcx hir::QPath<'tcx>, qpath: &'tcx hir::QPath<'tcx>,
subpats: &'tcx [Pat<'tcx>], subpats: &'tcx [Pat<'tcx>],
ddpos: Option<usize>, ddpos: hir::DotDotPos,
expected: Ty<'tcx>, expected: Ty<'tcx>,
def_bm: BindingMode, def_bm: BindingMode,
ti: TopInfo<'tcx>, ti: TopInfo<'tcx>,
@ -1066,7 +1066,7 @@ impl<'a, 'tcx> FnCtxt<'a, 'tcx> {
// Type-check subpatterns. // Type-check subpatterns.
if subpats.len() == variant.fields.len() if subpats.len() == variant.fields.len()
|| subpats.len() < variant.fields.len() && ddpos.is_some() || subpats.len() < variant.fields.len() && ddpos.as_opt_usize().is_some()
{ {
let ty::Adt(_, substs) = pat_ty.kind() else { let ty::Adt(_, substs) = pat_ty.kind() else {
bug!("unexpected pattern type {:?}", pat_ty); bug!("unexpected pattern type {:?}", pat_ty);
@ -1254,14 +1254,14 @@ impl<'a, 'tcx> FnCtxt<'a, 'tcx> {
&self, &self,
span: Span, span: Span,
elements: &'tcx [Pat<'tcx>], elements: &'tcx [Pat<'tcx>],
ddpos: Option<usize>, ddpos: hir::DotDotPos,
expected: Ty<'tcx>, expected: Ty<'tcx>,
def_bm: BindingMode, def_bm: BindingMode,
ti: TopInfo<'tcx>, ti: TopInfo<'tcx>,
) -> Ty<'tcx> { ) -> Ty<'tcx> {
let tcx = self.tcx; let tcx = self.tcx;
let mut expected_len = elements.len(); let mut expected_len = elements.len();
if ddpos.is_some() { if ddpos.as_opt_usize().is_some() {
// Require known type only when `..` is present. // Require known type only when `..` is present.
if let ty::Tuple(tys) = self.structurally_resolved_type(span, expected).kind() { if let ty::Tuple(tys) = self.structurally_resolved_type(span, expected).kind() {
expected_len = tys.len(); expected_len = tys.len();

24
src/test/ui/stats/hir-stats.stderr
View file

@ -140,18 +140,18 @@ hir-stats - Expr 32 ( 0.3%) 1
hir-stats FnDecl 120 ( 1.2%) 3 40 hir-stats FnDecl 120 ( 1.2%) 3 40
hir-stats Attribute 128 ( 1.3%) 4 32 hir-stats Attribute 128 ( 1.3%) 4 32
hir-stats GenericArgs 144 ( 1.5%) 3 48 hir-stats GenericArgs 144 ( 1.5%) 3 48
hir-stats Variant 160 ( 1.6%) 2 80 hir-stats Variant 160 ( 1.7%) 2 80
hir-stats WherePredicate 168 ( 1.7%) 3 56 hir-stats WherePredicate 168 ( 1.7%) 3 56
hir-stats - BoundPredicate 168 ( 1.7%) 3 hir-stats - BoundPredicate 168 ( 1.7%) 3
hir-stats GenericBound 192 ( 2.0%) 4 48 hir-stats GenericBound 192 ( 2.0%) 4 48
hir-stats - Trait 192 ( 2.0%) 4 hir-stats - Trait 192 ( 2.0%) 4
hir-stats Block 288 ( 3.0%) 6 48 hir-stats Block 288 ( 3.0%) 6 48
hir-stats Pat 360 ( 3.7%) 5 72
hir-stats - Wild 72 ( 0.7%) 1
hir-stats - Struct 72 ( 0.7%) 1
hir-stats - Binding 216 ( 2.2%) 3
hir-stats GenericParam 400 ( 4.1%) 5 80 hir-stats GenericParam 400 ( 4.1%) 5 80
hir-stats Pat 440 ( 4.5%) 5 88 hir-stats Generics 560 ( 5.8%) 10 56
hir-stats - Wild 88 ( 0.9%) 1
hir-stats - Struct 88 ( 0.9%) 1
hir-stats - Binding 264 ( 2.7%) 3
hir-stats Generics 560 ( 5.7%) 10 56
hir-stats Ty 720 ( 7.4%) 15 48 hir-stats Ty 720 ( 7.4%) 15 48
hir-stats - Ptr 48 ( 0.5%) 1 hir-stats - Ptr 48 ( 0.5%) 1
hir-stats - Rptr 48 ( 0.5%) 1 hir-stats - Rptr 48 ( 0.5%) 1
@ -162,17 +162,17 @@ hir-stats - Struct 64 ( 0.7%) 1
hir-stats - Match 64 ( 0.7%) 1 hir-stats - Match 64 ( 0.7%) 1
hir-stats - InlineAsm 64 ( 0.7%) 1 hir-stats - InlineAsm 64 ( 0.7%) 1
hir-stats - Lit 128 ( 1.3%) 2 hir-stats - Lit 128 ( 1.3%) 2
hir-stats - Block 384 ( 3.9%) 6 hir-stats - Block 384 ( 4.0%) 6
hir-stats Item 960 ( 9.8%) 12 80 hir-stats Item 960 ( 9.9%) 12 80
hir-stats - Trait 80 ( 0.8%) 1 hir-stats - Trait 80 ( 0.8%) 1
hir-stats - Enum 80 ( 0.8%) 1 hir-stats - Enum 80 ( 0.8%) 1
hir-stats - ExternCrate 80 ( 0.8%) 1 hir-stats - ExternCrate 80 ( 0.8%) 1
hir-stats - ForeignMod 80 ( 0.8%) 1 hir-stats - ForeignMod 80 ( 0.8%) 1
hir-stats - Impl 80 ( 0.8%) 1 hir-stats - Impl 80 ( 0.8%) 1
hir-stats - Fn 160 ( 1.6%) 2 hir-stats - Fn 160 ( 1.7%) 2
hir-stats - Use 400 ( 4.1%) 5 hir-stats - Use 400 ( 4.1%) 5
hir-stats Path 1_536 (15.7%) 32 48 hir-stats Path 1_536 (15.9%) 32 48
hir-stats PathSegment 2_240 (23.0%) 40 56 hir-stats PathSegment 2_240 (23.1%) 40 56
hir-stats ---------------------------------------------------------------- hir-stats ----------------------------------------------------------------
hir-stats Total 9_760 hir-stats Total 9_680
hir-stats hir-stats

4
src/tools/clippy/clippy_lints/src/equatable_if_let.rs
View file

@ -51,7 +51,9 @@ fn unary_pattern(pat: &Pat<'_>) -> bool {
false false
}, },
PatKind::Struct(_, a, etc) => !etc && a.iter().all(|x| unary_pattern(x.pat)), PatKind::Struct(_, a, etc) => !etc && a.iter().all(|x| unary_pattern(x.pat)),
PatKind::Tuple(a, etc) | PatKind::TupleStruct(_, a, etc) => !etc.is_some() && array_rec(a), PatKind::Tuple(a, etc) | PatKind::TupleStruct(_, a, etc) => {
!etc.as_opt_usize().is_some() && array_rec(a)
}
PatKind::Ref(x, _) | PatKind::Box(x) => unary_pattern(x), PatKind::Ref(x, _) | PatKind::Box(x) => unary_pattern(x),
PatKind::Path(_) | PatKind::Lit(_) => true, PatKind::Path(_) | PatKind::Lit(_) => true,
} }

4
src/tools/clippy/clippy_lints/src/matches/match_same_arms.rs
View file

@ -248,7 +248,7 @@ impl<'a> NormalizedPat<'a> {
} else { } else {
(None, adt.non_enum_variant()) (None, adt.non_enum_variant())
}; };
let (front, back) = match wild_idx { let (front, back) = match wild_idx.as_opt_usize() {
Some(i) => pats.split_at(i), Some(i) => pats.split_at(i),
None => (pats, [].as_slice()), None => (pats, [].as_slice()),
}; };
@ -268,7 +268,7 @@ impl<'a> NormalizedPat<'a> {
ty::Tuple(subs) => subs.len(), ty::Tuple(subs) => subs.len(),
_ => return Self::Wild, _ => return Self::Wild,
}; };
let (front, back) = match wild_idx { let (front, back) = match wild_idx.as_opt_usize() {
Some(i) => pats.split_at(i), Some(i) => pats.split_at(i),
None => (pats, [].as_slice()), None => (pats, [].as_slice()),
}; };

2
src/tools/clippy/clippy_lints/src/matches/single_match.rs
View file

@ -200,6 +200,8 @@ fn form_exhaustive_matches<'a>(cx: &LateContext<'a>, ty: Ty<'a>, left: &Pat<'_>,
// We don't actually know the position and the presence of the `..` (dotdot) operator // We don't actually know the position and the presence of the `..` (dotdot) operator
// in the arms, so we need to evaluate the correct offsets here in order to iterate in // in the arms, so we need to evaluate the correct offsets here in order to iterate in
// both arms at the same time. // both arms at the same time.
let left_pos = left_pos.as_opt_usize();
let right_pos = right_pos.as_opt_usize();
let len = max( let len = max(
left_in.len() + { left_in.len() + {
if left_pos.is_some() { 1 } else { 0 } if left_pos.is_some() { 1 } else { 0 }

3
src/tools/clippy/clippy_lints/src/question_mark.rs
View file

@ -122,7 +122,8 @@ fn check_if_let_some_or_err_and_early_return<'tcx>(cx: &LateContext<'tcx>, expr:
if_chain! { if_chain! {
if let Some(higher::IfLet { let_pat, let_expr, if_then, if_else }) = higher::IfLet::hir(cx, expr); if let Some(higher::IfLet { let_pat, let_expr, if_then, if_else }) = higher::IfLet::hir(cx, expr);
if !is_else_clause(cx.tcx, expr); if !is_else_clause(cx.tcx, expr);
if let PatKind::TupleStruct(ref path1, [field], None) = let_pat.kind; if let PatKind::TupleStruct(ref path1, [field], ddpos) = let_pat.kind;
if ddpos.as_opt_usize().is_none();
if let PatKind::Binding(BindingAnnotation(by_ref, _), bind_id, ident, None) = field.kind; if let PatKind::Binding(BindingAnnotation(by_ref, _), bind_id, ident, None) = field.kind;
let caller_ty = cx.typeck_results().expr_ty(let_expr); let caller_ty = cx.typeck_results().expr_ty(let_expr);
let if_block = IfBlockType::IfLet(path1, caller_ty, ident.name, let_expr, if_then, if_else); let if_block = IfBlockType::IfLet(path1, caller_ty, ident.name, let_expr, if_then, if_else);

6
src/tools/clippy/clippy_lints/src/unit_types/let_unit_value.rs
View file

@ -19,10 +19,12 @@ pub(super) fn check<'tcx>(cx: &LateContext<'tcx>, local: &'tcx Local<'_>) {
&& cx.typeck_results().pat_ty(local.pat).is_unit() && cx.typeck_results().pat_ty(local.pat).is_unit()
{ {
if (local.ty.map_or(false, |ty| !matches!(ty.kind, TyKind::Infer)) if (local.ty.map_or(false, |ty| !matches!(ty.kind, TyKind::Infer))
|| matches!(local.pat.kind, PatKind::Tuple([], None))) || matches!(local.pat.kind, PatKind::Tuple([], ddpos) if ddpos.as_opt_usize().is_none()))
&& expr_needs_inferred_result(cx, init) && expr_needs_inferred_result(cx, init)
{ {
if !matches!(local.pat.kind, PatKind::Wild | PatKind::Tuple([], None)) { if !matches!(local.pat.kind, PatKind::Wild)
&& !matches!(local.pat.kind, PatKind::Tuple([], ddpos) if ddpos.as_opt_usize().is_none())
{
span_lint_and_then( span_lint_and_then(
cx, cx,
LET_UNIT_VALUE, LET_UNIT_VALUE,

3
src/tools/clippy/clippy_utils/src/lib.rs
View file

@ -1552,7 +1552,8 @@ pub fn iter_input_pats<'tcx>(decl: &FnDecl<'_>, body: &'tcx Body<'_>) -> impl It
pub fn is_try<'tcx>(cx: &LateContext<'_>, expr: &'tcx Expr<'tcx>) -> Option<&'tcx Expr<'tcx>> { pub fn is_try<'tcx>(cx: &LateContext<'_>, expr: &'tcx Expr<'tcx>) -> Option<&'tcx Expr<'tcx>> {
fn is_ok(cx: &LateContext<'_>, arm: &Arm<'_>) -> bool { fn is_ok(cx: &LateContext<'_>, arm: &Arm<'_>) -> bool {
if_chain! { if_chain! {
if let PatKind::TupleStruct(ref path, pat, None) = arm.pat.kind; if let PatKind::TupleStruct(ref path, pat, ddpos) = arm.pat.kind;
if ddpos.as_opt_usize().is_none();
if is_lang_ctor(cx, path, ResultOk); if is_lang_ctor(cx, path, ResultOk);
if let PatKind::Binding(_, hir_id, _, None) = pat[0].kind; if let PatKind::Binding(_, hir_id, _, None) = pat[0].kind;
if path_to_local_id(arm.body, hir_id); if path_to_local_id(arm.body, hir_id);