Unify expanded constants and named constants in PatKind
This commit is contained in:
parent
a5b4d458a1
commit
f563efec15
17 changed files with 215 additions and 58 deletions
|
@ -144,7 +144,7 @@ impl<'a, 'tcx> ParseCtxt<'a, 'tcx> {
|
|||
let mut targets = Vec::new();
|
||||
for arm in rest {
|
||||
let arm = &self.thir[*arm];
|
||||
let PatKind::Constant { value, opt_def: _ } = arm.pattern.kind else {
|
||||
let PatKind::Constant { value } = arm.pattern.kind else {
|
||||
return Err(ParseError {
|
||||
span: arm.pattern.span,
|
||||
item_description: format!("{:?}", arm.pattern.kind),
|
||||
|
|
|
@ -129,7 +129,7 @@ impl<'pat, 'tcx> MatchPairTree<'pat, 'tcx> {
|
|||
}
|
||||
}
|
||||
|
||||
PatKind::Constant { value, opt_def: _ } => TestCase::Constant { value },
|
||||
PatKind::Constant { value } => TestCase::Constant { value },
|
||||
|
||||
PatKind::AscribeUserType {
|
||||
ascription: thir::Ascription { ref annotation, variance },
|
||||
|
@ -162,7 +162,11 @@ impl<'pat, 'tcx> MatchPairTree<'pat, 'tcx> {
|
|||
TestCase::Irrefutable { ascription: None, binding }
|
||||
}
|
||||
|
||||
PatKind::InlineConstant { subpattern: ref pattern, def, .. } => {
|
||||
PatKind::ExpandedConstant { subpattern: ref pattern, def_id: _, is_inline: false } => {
|
||||
subpairs.push(MatchPairTree::for_pattern(place_builder, pattern, cx));
|
||||
default_irrefutable()
|
||||
}
|
||||
PatKind::ExpandedConstant { subpattern: ref pattern, def_id, is_inline: true } => {
|
||||
// Apply a type ascription for the inline constant to the value at `match_pair.place`
|
||||
let ascription = place.map(|source| {
|
||||
let span = pattern.span;
|
||||
|
@ -173,7 +177,7 @@ impl<'pat, 'tcx> MatchPairTree<'pat, 'tcx> {
|
|||
})
|
||||
.args;
|
||||
let user_ty = cx.infcx.canonicalize_user_type_annotation(ty::UserType::TypeOf(
|
||||
def.to_def_id(),
|
||||
def_id,
|
||||
ty::UserArgs { args, user_self_ty: None },
|
||||
));
|
||||
let annotation = ty::CanonicalUserTypeAnnotation {
|
||||
|
|
|
@ -917,7 +917,7 @@ impl<'a, 'tcx> Builder<'a, 'tcx> {
|
|||
self.visit_primary_bindings(subpattern, subpattern_user_ty, f)
|
||||
}
|
||||
|
||||
PatKind::InlineConstant { ref subpattern, .. } => {
|
||||
PatKind::ExpandedConstant { ref subpattern, .. } => {
|
||||
self.visit_primary_bindings(subpattern, pattern_user_ty, f)
|
||||
}
|
||||
|
||||
|
|
|
@ -332,7 +332,7 @@ impl<'a, 'tcx> Visitor<'a, 'tcx> for UnsafetyVisitor<'a, 'tcx> {
|
|||
PatKind::Wild |
|
||||
// these just wrap other patterns, which we recurse on below.
|
||||
PatKind::Or { .. } |
|
||||
PatKind::InlineConstant { .. } |
|
||||
PatKind::ExpandedConstant { .. } |
|
||||
PatKind::AscribeUserType { .. } |
|
||||
PatKind::Error(_) => {}
|
||||
}
|
||||
|
@ -386,8 +386,12 @@ impl<'a, 'tcx> Visitor<'a, 'tcx> for UnsafetyVisitor<'a, 'tcx> {
|
|||
visit::walk_pat(self, pat);
|
||||
self.inside_adt = old_inside_adt;
|
||||
}
|
||||
PatKind::InlineConstant { def, .. } => {
|
||||
self.visit_inner_body(*def);
|
||||
PatKind::ExpandedConstant { def_id, is_inline, .. } => {
|
||||
if let Some(def) = def_id.as_local()
|
||||
&& *is_inline
|
||||
{
|
||||
self.visit_inner_body(def);
|
||||
}
|
||||
visit::walk_pat(self, pat);
|
||||
}
|
||||
_ => {
|
||||
|
|
|
@ -670,11 +670,13 @@ impl<'p, 'tcx> MatchVisitor<'p, 'tcx> {
|
|||
let mut interpreted_as_const = None;
|
||||
let mut interpreted_as_const_sugg = None;
|
||||
|
||||
if let PatKind::Constant { opt_def: Some(def_id), .. }
|
||||
if let PatKind::ExpandedConstant { def_id, is_inline: false, .. }
|
||||
| PatKind::AscribeUserType {
|
||||
subpattern: box Pat { kind: PatKind::Constant { opt_def: Some(def_id), .. }, .. },
|
||||
subpattern:
|
||||
box Pat { kind: PatKind::ExpandedConstant { def_id, is_inline: false, .. }, .. },
|
||||
..
|
||||
} = pat.kind
|
||||
&& let DefKind::Const = self.tcx.def_kind(def_id)
|
||||
{
|
||||
let span = self.tcx.def_span(def_id);
|
||||
let variable = self.tcx.item_name(def_id).to_string();
|
||||
|
@ -1145,7 +1147,7 @@ fn report_non_exhaustive_match<'p, 'tcx>(
|
|||
|
||||
for &arm in arms {
|
||||
let arm = &thir.arms[arm];
|
||||
if let PatKind::Constant { opt_def: Some(def_id), .. } = arm.pattern.kind {
|
||||
if let PatKind::ExpandedConstant { def_id, is_inline: false, .. } = arm.pattern.kind {
|
||||
let const_name = cx.tcx.item_name(def_id);
|
||||
err.span_label(
|
||||
arm.pattern.span,
|
||||
|
|
|
@ -266,7 +266,6 @@ impl<'tcx> ConstToPat<'tcx> {
|
|||
// optimization for now.
|
||||
ty::Str => PatKind::Constant {
|
||||
value: mir::Const::Ty(ty, ty::Const::new_value(tcx, cv, ty)),
|
||||
opt_def: None,
|
||||
},
|
||||
// All other references are converted into deref patterns and then recursively
|
||||
// convert the dereferenced constant to a pattern that is the sub-pattern of the
|
||||
|
@ -312,17 +311,13 @@ impl<'tcx> ConstToPat<'tcx> {
|
|||
} else {
|
||||
PatKind::Constant {
|
||||
value: mir::Const::Ty(ty, ty::Const::new_value(tcx, cv, ty)),
|
||||
opt_def: None,
|
||||
}
|
||||
}
|
||||
}
|
||||
ty::Pat(..) | ty::Bool | ty::Char | ty::Int(_) | ty::Uint(_) | ty::RawPtr(..) => {
|
||||
// The raw pointers we see here have been "vetted" by valtree construction to be
|
||||
// just integers, so we simply allow them.
|
||||
PatKind::Constant {
|
||||
value: mir::Const::Ty(ty, ty::Const::new_value(tcx, cv, ty)),
|
||||
opt_def: None,
|
||||
}
|
||||
PatKind::Constant { value: mir::Const::Ty(ty, ty::Const::new_value(tcx, cv, ty)) }
|
||||
}
|
||||
ty::FnPtr(..) => {
|
||||
unreachable!(
|
||||
|
|
|
@ -149,15 +149,18 @@ impl<'a, 'tcx> PatCtxt<'a, 'tcx> {
|
|||
None => Ok((None, None, None)),
|
||||
Some(expr) => {
|
||||
let (kind, ascr, inline_const) = match self.lower_lit(expr) {
|
||||
PatKind::InlineConstant { subpattern, def } => {
|
||||
(subpattern.kind, None, Some(def))
|
||||
PatKind::ExpandedConstant { subpattern, def_id, is_inline: true } => {
|
||||
(subpattern.kind, None, def_id.as_local())
|
||||
}
|
||||
PatKind::ExpandedConstant { subpattern, is_inline: false, .. } => {
|
||||
(subpattern.kind, None, None)
|
||||
}
|
||||
PatKind::AscribeUserType { ascription, subpattern: box Pat { kind, .. } } => {
|
||||
(kind, Some(ascription), None)
|
||||
}
|
||||
kind => (kind, None, None),
|
||||
};
|
||||
let value = if let PatKind::Constant { value, opt_def: _ } = kind {
|
||||
let value = if let PatKind::Constant { value } = kind {
|
||||
value
|
||||
} else {
|
||||
let msg = format!(
|
||||
|
@ -251,7 +254,7 @@ impl<'a, 'tcx> PatCtxt<'a, 'tcx> {
|
|||
(RangeEnd::Included, Some(Ordering::Less)) => {}
|
||||
// `x..=y` where `x == y` and `x` and `y` are finite.
|
||||
(RangeEnd::Included, Some(Ordering::Equal)) if lo.is_finite() && hi.is_finite() => {
|
||||
kind = PatKind::Constant { value: lo.as_finite().unwrap(), opt_def: None };
|
||||
kind = PatKind::Constant { value: lo.as_finite().unwrap() };
|
||||
}
|
||||
// `..=x` where `x == ty::MIN`.
|
||||
(RangeEnd::Included, Some(Ordering::Equal)) if !lo.is_finite() => {}
|
||||
|
@ -288,7 +291,11 @@ impl<'a, 'tcx> PatCtxt<'a, 'tcx> {
|
|||
};
|
||||
}
|
||||
for def in [lo_inline, hi_inline].into_iter().flatten() {
|
||||
kind = PatKind::InlineConstant { def, subpattern: Box::new(Pat { span, ty, kind }) };
|
||||
kind = PatKind::ExpandedConstant {
|
||||
def_id: def.to_def_id(),
|
||||
is_inline: true,
|
||||
subpattern: Box::new(Pat { span, ty, kind }),
|
||||
};
|
||||
}
|
||||
Ok(kind)
|
||||
}
|
||||
|
@ -562,10 +569,20 @@ impl<'a, 'tcx> PatCtxt<'a, 'tcx> {
|
|||
|
||||
let args = self.typeck_results.node_args(id);
|
||||
let c = ty::Const::new_unevaluated(self.tcx, ty::UnevaluatedConst { def: def_id, args });
|
||||
let mut pattern = self.const_to_pat(c, ty, id, span);
|
||||
if let PatKind::Constant { value, opt_def: None } = pattern.kind {
|
||||
pattern.kind = PatKind::Constant { value, opt_def: Some(def_id) };
|
||||
}
|
||||
let subpattern = self.const_to_pat(c, ty, id, span);
|
||||
let pattern = if let hir::QPath::Resolved(None, path) = qpath
|
||||
&& path.segments.len() == 1
|
||||
{
|
||||
// We only want to mark constants when referenced as bare names that could have been
|
||||
// new bindings if the `const` didn't exist.
|
||||
Box::new(Pat {
|
||||
span,
|
||||
ty,
|
||||
kind: PatKind::ExpandedConstant { subpattern, def_id, is_inline: false },
|
||||
})
|
||||
} else {
|
||||
subpattern
|
||||
};
|
||||
|
||||
if !is_associated_const {
|
||||
return pattern;
|
||||
|
@ -640,7 +657,7 @@ impl<'a, 'tcx> PatCtxt<'a, 'tcx> {
|
|||
|
||||
let ct = ty::UnevaluatedConst { def: def_id.to_def_id(), args };
|
||||
let subpattern = self.const_to_pat(ty::Const::new_unevaluated(self.tcx, ct), ty, id, span);
|
||||
PatKind::InlineConstant { subpattern, def: def_id }
|
||||
PatKind::ExpandedConstant { subpattern, def_id: def_id.to_def_id(), is_inline: true }
|
||||
}
|
||||
|
||||
/// Converts literals, paths and negation of literals to patterns.
|
||||
|
|
|
@ -702,14 +702,15 @@ impl<'a, 'tcx> ThirPrinter<'a, 'tcx> {
|
|||
self.print_pat(subpattern, depth_lvl + 2);
|
||||
print_indented!(self, "}", depth_lvl + 1);
|
||||
}
|
||||
PatKind::Constant { value, opt_def: _ } => {
|
||||
PatKind::Constant { value } => {
|
||||
print_indented!(self, "Constant {", depth_lvl + 1);
|
||||
print_indented!(self, format!("value: {:?}", value), depth_lvl + 2);
|
||||
print_indented!(self, "}", depth_lvl + 1);
|
||||
}
|
||||
PatKind::InlineConstant { def, subpattern } => {
|
||||
print_indented!(self, "InlineConstant {", depth_lvl + 1);
|
||||
print_indented!(self, format!("def: {:?}", def), depth_lvl + 2);
|
||||
PatKind::ExpandedConstant { def_id, is_inline, subpattern } => {
|
||||
print_indented!(self, "ExpandedConstant {", depth_lvl + 1);
|
||||
print_indented!(self, format!("def_id: {def_id:?}"), depth_lvl + 2);
|
||||
print_indented!(self, format!("is_inline: {is_inline:?}"), depth_lvl + 2);
|
||||
print_indented!(self, "subpattern:", depth_lvl + 2);
|
||||
self.print_pat(subpattern, depth_lvl + 2);
|
||||
print_indented!(self, "}", depth_lvl + 1);
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue