1 use crate::check::FnCtxt;
2 use rustc_infer::infer::InferOk;
3 use rustc_trait_selection::infer::InferCtxtExt as _;
4 use rustc_trait_selection::traits::ObligationCause;
6 use rustc_ast::util::parser::PREC_POSTFIX;
7 use rustc_errors::{Applicability, DiagnosticBuilder};
9 use rustc_hir::lang_items::LangItem;
10 use rustc_hir::{is_range_literal, Node};
11 use rustc_middle::ty::adjustment::AllowTwoPhase;
12 use rustc_middle::ty::{self, AssocItem, Ty, TypeAndMut};
13 use rustc_span::symbol::sym;
16 use super::method::probe;
20 impl<'a, 'tcx> FnCtxt<'a, 'tcx> {
21 pub fn emit_coerce_suggestions(
23 err: &mut DiagnosticBuilder<'_>,
27 expected_ty_expr: Option<&'tcx hir::Expr<'tcx>>,
29 self.annotate_expected_due_to_let_ty(err, expr);
30 self.suggest_compatible_variants(err, expr, expected, expr_ty);
31 self.suggest_deref_ref_or_into(err, expr, expected, expr_ty, expected_ty_expr);
32 if self.suggest_calling_boxed_future_when_appropriate(err, expr, expected, expr_ty) {
35 self.suggest_no_capture_closure(err, expected, expr_ty);
36 self.suggest_boxing_when_appropriate(err, expr, expected, expr_ty);
37 self.suggest_missing_parentheses(err, expr);
38 self.note_need_for_fn_pointer(err, expected, expr_ty);
39 self.note_internal_mutation_in_method(err, expr, expected, expr_ty);
42 // Requires that the two types unify, and prints an error message if
44 pub fn demand_suptype(&self, sp: Span, expected: Ty<'tcx>, actual: Ty<'tcx>) {
45 if let Some(mut e) = self.demand_suptype_diag(sp, expected, actual) {
50 pub fn demand_suptype_diag(
55 ) -> Option<DiagnosticBuilder<'tcx>> {
56 self.demand_suptype_with_origin(&self.misc(sp), expected, actual)
59 pub fn demand_suptype_with_origin(
61 cause: &ObligationCause<'tcx>,
64 ) -> Option<DiagnosticBuilder<'tcx>> {
65 match self.at(cause, self.param_env).sup(expected, actual) {
66 Ok(InferOk { obligations, value: () }) => {
67 self.register_predicates(obligations);
70 Err(e) => Some(self.report_mismatched_types(&cause, expected, actual, e)),
74 pub fn demand_eqtype(&self, sp: Span, expected: Ty<'tcx>, actual: Ty<'tcx>) {
75 if let Some(mut err) = self.demand_eqtype_diag(sp, expected, actual) {
80 pub fn demand_eqtype_diag(
85 ) -> Option<DiagnosticBuilder<'tcx>> {
86 self.demand_eqtype_with_origin(&self.misc(sp), expected, actual)
89 pub fn demand_eqtype_with_origin(
91 cause: &ObligationCause<'tcx>,
94 ) -> Option<DiagnosticBuilder<'tcx>> {
95 match self.at(cause, self.param_env).eq(expected, actual) {
96 Ok(InferOk { obligations, value: () }) => {
97 self.register_predicates(obligations);
100 Err(e) => Some(self.report_mismatched_types(cause, expected, actual, e)),
104 pub fn demand_coerce(
106 expr: &hir::Expr<'_>,
107 checked_ty: Ty<'tcx>,
109 expected_ty_expr: Option<&'tcx hir::Expr<'tcx>>,
110 allow_two_phase: AllowTwoPhase,
113 self.demand_coerce_diag(expr, checked_ty, expected, expected_ty_expr, allow_two_phase);
114 if let Some(mut err) = err {
120 /// Checks that the type of `expr` can be coerced to `expected`.
122 /// N.B., this code relies on `self.diverges` to be accurate. In particular, assignments to `!`
123 /// will be permitted if the diverges flag is currently "always".
124 pub fn demand_coerce_diag(
126 expr: &hir::Expr<'_>,
127 checked_ty: Ty<'tcx>,
129 expected_ty_expr: Option<&'tcx hir::Expr<'tcx>>,
130 allow_two_phase: AllowTwoPhase,
131 ) -> (Ty<'tcx>, Option<DiagnosticBuilder<'tcx>>) {
132 let expected = self.resolve_vars_with_obligations(expected);
134 let e = match self.try_coerce(expr, checked_ty, expected, allow_two_phase) {
135 Ok(ty) => return (ty, None),
139 let expr = expr.peel_drop_temps();
140 let cause = self.misc(expr.span);
141 let expr_ty = self.resolve_vars_with_obligations(checked_ty);
142 let mut err = self.report_mismatched_types(&cause, expected, expr_ty, e);
144 if self.is_assign_to_bool(expr, expected) {
145 // Error reported in `check_assign` so avoid emitting error again.
147 return (expected, None);
150 self.emit_coerce_suggestions(&mut err, expr, expr_ty, expected, expected_ty_expr);
152 (expected, Some(err))
155 fn annotate_expected_due_to_let_ty(
157 err: &mut DiagnosticBuilder<'_>,
158 expr: &hir::Expr<'_>,
160 let parent = self.tcx.hir().get_parent_node(expr.hir_id);
161 if let Some(hir::Node::Local(hir::Local { ty: Some(ty), init: Some(init), .. })) =
162 self.tcx.hir().find(parent)
164 if init.hir_id == expr.hir_id {
165 // Point at `let` assignment type.
166 err.span_label(ty.span, "expected due to this");
171 /// Returns whether the expected type is `bool` and the expression is `x = y`.
172 pub fn is_assign_to_bool(&self, expr: &hir::Expr<'_>, expected: Ty<'tcx>) -> bool {
173 if let hir::ExprKind::Assign(..) = expr.kind {
174 return expected == self.tcx.types.bool;
179 /// If the expected type is an enum (Issue #55250) with any variants whose
180 /// sole field is of the found type, suggest such variants. (Issue #42764)
181 fn suggest_compatible_variants(
183 err: &mut DiagnosticBuilder<'_>,
184 expr: &hir::Expr<'_>,
188 if let ty::Adt(expected_adt, substs) = expected.kind() {
189 if !expected_adt.is_enum() {
193 let mut compatible_variants = expected_adt
196 .filter(|variant| variant.fields.len() == 1)
197 .filter_map(|variant| {
198 let sole_field = &variant.fields[0];
199 let sole_field_ty = sole_field.ty(self.tcx, substs);
200 if self.can_coerce(expr_ty, sole_field_ty) {
201 let variant_path = self.tcx.def_path_str(variant.def_id);
202 // FIXME #56861: DRYer prelude filtering
203 Some(variant_path.trim_start_matches("std::prelude::v1::").to_string())
210 if compatible_variants.peek().is_some() {
211 if let Ok(expr_text) = self.tcx.sess.source_map().span_to_snippet(expr.span) {
212 let suggestions = compatible_variants.map(|v| format!("{}({})", v, expr_text));
213 let msg = "try using a variant of the expected enum";
214 err.span_suggestions(
218 Applicability::MaybeIncorrect,
225 pub fn get_conversion_methods(
229 checked_ty: Ty<'tcx>,
231 ) -> Vec<AssocItem> {
233 self.probe_for_return_type(span, probe::Mode::MethodCall, expected, checked_ty, hir_id);
235 self.has_only_self_parameter(m)
240 // This special internal attribute is used to permit
241 // "identity-like" conversion methods to be suggested here.
243 // FIXME (#46459 and #46460): ideally
244 // `std::convert::Into::into` and `std::borrow:ToOwned` would
245 // also be `#[rustc_conversion_suggestion]`, if not for
246 // method-probing false-positives and -negatives (respectively).
248 // FIXME? Other potential candidate methods: `as_ref` and
250 .any(|a| self.sess().check_name(a, sym::rustc_conversion_suggestion))
256 /// This function checks whether the method is not static and does not accept other parameters than `self`.
257 fn has_only_self_parameter(&self, method: &AssocItem) -> bool {
259 ty::AssocKind::Fn => {
260 method.fn_has_self_parameter
261 && self.tcx.fn_sig(method.def_id).inputs().skip_binder().len() == 1
267 /// Identify some cases where `as_ref()` would be appropriate and suggest it.
269 /// Given the following code:
272 /// fn takes_ref(_: &Foo) {}
273 /// let ref opt = Some(Foo);
275 /// opt.map(|param| takes_ref(param));
277 /// Suggest using `opt.as_ref().map(|param| takes_ref(param));` instead.
279 /// It only checks for `Option` and `Result` and won't work with
281 /// opt.map(|param| { takes_ref(param) });
283 fn can_use_as_ref(&self, expr: &hir::Expr<'_>) -> Option<(Span, &'static str, String)> {
284 let path = match expr.kind {
285 hir::ExprKind::Path(hir::QPath::Resolved(_, ref path)) => path,
289 let local_id = match path.res {
290 hir::def::Res::Local(id) => id,
294 let local_parent = self.tcx.hir().get_parent_node(local_id);
295 let param_hir_id = match self.tcx.hir().find(local_parent) {
296 Some(Node::Param(hir::Param { hir_id, .. })) => hir_id,
300 let param_parent = self.tcx.hir().get_parent_node(*param_hir_id);
301 let (expr_hir_id, closure_fn_decl) = match self.tcx.hir().find(param_parent) {
302 Some(Node::Expr(hir::Expr {
304 kind: hir::ExprKind::Closure(_, decl, ..),
306 })) => (hir_id, decl),
310 let expr_parent = self.tcx.hir().get_parent_node(*expr_hir_id);
311 let hir = self.tcx.hir().find(expr_parent);
312 let closure_params_len = closure_fn_decl.inputs.len();
313 let (method_path, method_span, method_expr) = match (hir, closure_params_len) {
315 Some(Node::Expr(hir::Expr {
316 kind: hir::ExprKind::MethodCall(path, span, expr, _),
320 ) => (path, span, expr),
324 let self_ty = self.typeck_results.borrow().node_type(method_expr[0].hir_id);
325 let self_ty = format!("{:?}", self_ty);
326 let name = method_path.ident.name;
327 let is_as_ref_able = (self_ty.starts_with("&std::option::Option")
328 || self_ty.starts_with("&std::result::Result")
329 || self_ty.starts_with("std::option::Option")
330 || self_ty.starts_with("std::result::Result"))
331 && (name == sym::map || name == sym::and_then);
332 match (is_as_ref_able, self.sess().source_map().span_to_snippet(*method_span)) {
334 let suggestion = format!("as_ref().{}", src);
335 Some((*method_span, "consider using `as_ref` instead", suggestion))
341 crate fn is_hir_id_from_struct_pattern_shorthand_field(
346 let sm = self.sess().source_map();
347 let parent_id = self.tcx.hir().get_parent_node(hir_id);
348 if let Some(parent) = self.tcx.hir().find(parent_id) {
349 // Account for fields
350 if let Node::Expr(hir::Expr { kind: hir::ExprKind::Struct(_, fields, ..), .. }) = parent
352 if let Ok(src) = sm.span_to_snippet(sp) {
353 for field in *fields {
354 if field.ident.as_str() == src && field.is_shorthand {
364 /// This function is used to determine potential "simple" improvements or users' errors and
365 /// provide them useful help. For example:
368 /// fn some_fn(s: &str) {}
370 /// let x = "hey!".to_owned();
371 /// some_fn(x); // error
374 /// No need to find every potential function which could make a coercion to transform a
375 /// `String` into a `&str` since a `&` would do the trick!
377 /// In addition of this check, it also checks between references mutability state. If the
378 /// expected is mutable but the provided isn't, maybe we could just say "Hey, try with
382 expr: &hir::Expr<'_>,
383 checked_ty: Ty<'tcx>,
385 ) -> Option<(Span, &'static str, String, Applicability)> {
386 let sm = self.sess().source_map();
388 if sm.is_imported(sp) {
389 // Ignore if span is from within a macro #41858, #58298. We previously used the macro
390 // call span, but that breaks down when the type error comes from multiple calls down.
394 let replace_prefix = |s: &str, old: &str, new: &str| {
395 s.strip_prefix(old).map(|stripped| new.to_string() + stripped)
398 let is_struct_pat_shorthand_field =
399 self.is_hir_id_from_struct_pattern_shorthand_field(expr.hir_id, sp);
401 // If the span is from a macro, then it's hard to extract the text
402 // and make a good suggestion, so don't bother.
403 let is_macro = sp.from_expansion() && sp.desugaring_kind().is_none();
405 // `ExprKind::DropTemps` is semantically irrelevant for these suggestions.
406 let expr = expr.peel_drop_temps();
408 match (&expr.kind, expected.kind(), checked_ty.kind()) {
409 (_, &ty::Ref(_, exp, _), &ty::Ref(_, check, _)) => match (exp.kind(), check.kind()) {
410 (&ty::Str, &ty::Array(arr, _) | &ty::Slice(arr)) if arr == self.tcx.types.u8 => {
411 if let hir::ExprKind::Lit(_) = expr.kind {
412 if let Ok(src) = sm.span_to_snippet(sp) {
413 if let Some(src) = replace_prefix(&src, "b\"", "\"") {
416 "consider removing the leading `b`",
418 Applicability::MachineApplicable,
424 (&ty::Array(arr, _) | &ty::Slice(arr), &ty::Str) if arr == self.tcx.types.u8 => {
425 if let hir::ExprKind::Lit(_) = expr.kind {
426 if let Ok(src) = sm.span_to_snippet(sp) {
427 if let Some(src) = replace_prefix(&src, "\"", "b\"") {
430 "consider adding a leading `b`",
432 Applicability::MachineApplicable,
440 (_, &ty::Ref(_, _, mutability), _) => {
441 // Check if it can work when put into a ref. For example:
444 // fn bar(x: &mut i32) {}
447 // bar(&x); // error, expected &mut
449 let ref_ty = match mutability {
450 hir::Mutability::Mut => {
451 self.tcx.mk_mut_ref(self.tcx.mk_region(ty::ReStatic), checked_ty)
453 hir::Mutability::Not => {
454 self.tcx.mk_imm_ref(self.tcx.mk_region(ty::ReStatic), checked_ty)
457 if self.can_coerce(ref_ty, expected) {
458 let mut sugg_sp = sp;
459 if let hir::ExprKind::MethodCall(ref segment, sp, ref args, _) = expr.kind {
460 let clone_trait = self.tcx.require_lang_item(LangItem::Clone, Some(sp));
461 if let ([arg], Some(true), sym::clone) = (
463 self.typeck_results.borrow().type_dependent_def_id(expr.hir_id).map(
465 let ai = self.tcx.associated_item(did);
466 ai.container == ty::TraitContainer(clone_trait)
471 // If this expression had a clone call when suggesting borrowing
472 // we want to suggest removing it because it'd now be unnecessary.
476 if let Ok(src) = sm.span_to_snippet(sugg_sp) {
477 let needs_parens = match expr.kind {
478 // parenthesize if needed (Issue #46756)
479 hir::ExprKind::Cast(_, _) | hir::ExprKind::Binary(_, _, _) => true,
480 // parenthesize borrows of range literals (Issue #54505)
481 _ if is_range_literal(expr) => true,
484 let sugg_expr = if needs_parens { format!("({})", src) } else { src };
486 if let Some(sugg) = self.can_use_as_ref(expr) {
491 Applicability::MachineApplicable,
494 let field_name = if is_struct_pat_shorthand_field {
495 format!("{}: ", sugg_expr)
499 if let Some(hir::Node::Expr(hir::Expr {
500 kind: hir::ExprKind::Assign(left_expr, ..),
502 })) = self.tcx.hir().find(self.tcx.hir().get_parent_node(expr.hir_id))
504 if mutability == hir::Mutability::Mut {
505 // Found the following case:
506 // fn foo(opt: &mut Option<String>){ opt = None }
509 // consider dereferencing here: `*opt` |
510 // expected mutable reference, found enum `Option`
511 if let Ok(src) = sm.span_to_snippet(left_expr.span) {
514 "consider dereferencing here to assign to the mutable \
515 borrowed piece of memory",
517 Applicability::MachineApplicable,
523 return Some(match mutability {
524 hir::Mutability::Mut => (
526 "consider mutably borrowing here",
527 format!("{}&mut {}", field_name, sugg_expr),
528 Applicability::MachineApplicable,
530 hir::Mutability::Not => (
532 "consider borrowing here",
533 format!("{}&{}", field_name, sugg_expr),
534 Applicability::MachineApplicable,
541 hir::ExprKind::AddrOf(hir::BorrowKind::Ref, _, ref expr),
543 &ty::Ref(_, checked, _),
545 self.infcx.can_sub(self.param_env, checked, &expected).is_ok() && !is_macro
548 // We have `&T`, check if what was expected was `T`. If so,
549 // we may want to suggest removing a `&`.
550 if sm.is_imported(expr.span) {
551 if let Ok(src) = sm.span_to_snippet(sp) {
552 if let Some(src) = src.strip_prefix('&') {
555 "consider removing the borrow",
557 Applicability::MachineApplicable,
563 if let Ok(code) = sm.span_to_snippet(expr.span) {
566 "consider removing the borrow",
568 Applicability::MachineApplicable,
574 &ty::RawPtr(TypeAndMut { ty: ty_b, mutbl: mutbl_b }),
575 &ty::Ref(_, ty_a, mutbl_a),
577 if let Some(steps) = self.deref_steps(ty_a, ty_b) {
578 // Only suggest valid if dereferencing needed.
580 // The pointer type implements `Copy` trait so the suggestion is always valid.
581 if let Ok(src) = sm.span_to_snippet(sp) {
582 let derefs = &"*".repeat(steps);
583 if let Some((src, applicability)) = match mutbl_b {
584 hir::Mutability::Mut => {
585 let new_prefix = "&mut ".to_owned() + derefs;
587 hir::Mutability::Mut => {
588 replace_prefix(&src, "&mut ", &new_prefix)
589 .map(|s| (s, Applicability::MachineApplicable))
591 hir::Mutability::Not => {
592 replace_prefix(&src, "&", &new_prefix)
593 .map(|s| (s, Applicability::Unspecified))
597 hir::Mutability::Not => {
598 let new_prefix = "&".to_owned() + derefs;
600 hir::Mutability::Mut => {
601 replace_prefix(&src, "&mut ", &new_prefix)
602 .map(|s| (s, Applicability::MachineApplicable))
604 hir::Mutability::Not => {
605 replace_prefix(&src, "&", &new_prefix)
606 .map(|s| (s, Applicability::MachineApplicable))
611 return Some((sp, "consider dereferencing", src, applicability));
617 _ if sp == expr.span && !is_macro => {
618 if let Some(steps) = self.deref_steps(checked_ty, expected) {
620 // For a suggestion to make sense, the type would need to be `Copy`.
621 if self.infcx.type_is_copy_modulo_regions(self.param_env, expected, sp) {
622 if let Ok(code) = sm.span_to_snippet(sp) {
623 let message = if checked_ty.is_region_ptr() {
624 "consider dereferencing the borrow"
626 "consider dereferencing the type"
628 let suggestion = if is_struct_pat_shorthand_field {
629 format!("{}: *{}", code, code)
637 Applicability::MachineApplicable,
649 pub fn check_for_cast(
651 err: &mut DiagnosticBuilder<'_>,
652 expr: &hir::Expr<'_>,
653 checked_ty: Ty<'tcx>,
654 expected_ty: Ty<'tcx>,
655 expected_ty_expr: Option<&'tcx hir::Expr<'tcx>>,
657 if self.tcx.sess.source_map().is_imported(expr.span) {
658 // Ignore if span is from within a macro.
662 let src = if let Ok(src) = self.tcx.sess.source_map().span_to_snippet(expr.span) {
668 // If casting this expression to a given numeric type would be appropriate in case of a type
671 // We want to minimize the amount of casting operations that are suggested, as it can be a
672 // lossy operation with potentially bad side effects, so we only suggest when encountering
673 // an expression that indicates that the original type couldn't be directly changed.
675 // For now, don't suggest casting with `as`.
676 let can_cast = false;
678 let prefix = if let Some(hir::Node::Expr(hir::Expr {
679 kind: hir::ExprKind::Struct(_, fields, _),
681 })) = self.tcx.hir().find(self.tcx.hir().get_parent_node(expr.hir_id))
683 // `expr` is a literal field for a struct, only suggest if appropriate
686 .find(|field| field.expr.hir_id == expr.hir_id && field.is_shorthand)
688 // This is a field literal
689 Some(field) => format!("{}: ", field.ident),
690 // Likely a field was meant, but this field wasn't found. Do not suggest anything.
691 None => return false,
697 if let hir::ExprKind::Call(path, args) = &expr.kind {
698 if let (hir::ExprKind::Path(hir::QPath::TypeRelative(base_ty, path_segment)), 1) =
699 (&path.kind, args.len())
701 // `expr` is a conversion like `u32::from(val)`, do not suggest anything (#63697).
702 if let (hir::TyKind::Path(hir::QPath::Resolved(None, base_ty_path)), sym::from) =
703 (&base_ty.kind, path_segment.ident.name)
705 if let Some(ident) = &base_ty_path.segments.iter().map(|s| s.ident).next() {
719 if base_ty_path.segments.len() == 1 =>
731 "you can convert {} `{}` to {} `{}`",
732 checked_ty.kind().article(),
734 expected_ty.kind().article(),
737 let cast_msg = format!(
738 "you can cast {} `{}` to {} `{}`",
739 checked_ty.kind().article(),
741 expected_ty.kind().article(),
744 let lit_msg = format!(
745 "change the type of the numeric literal from `{}` to `{}`",
746 checked_ty, expected_ty,
749 let with_opt_paren: fn(&dyn fmt::Display) -> String =
750 if expr.precedence().order() < PREC_POSTFIX {
751 |s| format!("({})", s)
756 let cast_suggestion = format!("{}{} as {}", prefix, with_opt_paren(&src), expected_ty);
757 let into_suggestion = format!("{}{}.into()", prefix, with_opt_paren(&src));
758 let suffix_suggestion = with_opt_paren(&format_args!(
761 (&expected_ty.kind(), &checked_ty.kind()),
762 (ty::Int(_) | ty::Uint(_), ty::Float(_))
764 // Remove fractional part from literal, for example `42.0f32` into `42`
765 let src = src.trim_end_matches(&checked_ty.to_string());
766 src.split('.').next().unwrap()
768 src.trim_end_matches(&checked_ty.to_string())
772 let literal_is_ty_suffixed = |expr: &hir::Expr<'_>| {
773 if let hir::ExprKind::Lit(lit) = &expr.kind { lit.node.is_suffixed() } else { false }
775 let is_negative_int =
776 |expr: &hir::Expr<'_>| matches!(expr.kind, hir::ExprKind::Unary(hir::UnOp::Neg, ..));
777 let is_uint = |ty: Ty<'_>| matches!(ty.kind(), ty::Uint(..));
779 let in_const_context = self.tcx.hir().is_inside_const_context(expr.hir_id);
781 let suggest_fallible_into_or_lhs_from =
782 |err: &mut DiagnosticBuilder<'_>, exp_to_found_is_fallible: bool| {
783 // If we know the expression the expected type is derived from, we might be able
784 // to suggest a widening conversion rather than a narrowing one (which may
785 // panic). For example, given x: u8 and y: u32, if we know the span of "x",
787 // can be given the suggestion "u32::from(x) > y" rather than
788 // "x > y.try_into().unwrap()".
789 let lhs_expr_and_src = expected_ty_expr.and_then(|expr| {
793 .span_to_snippet(expr.span)
795 .map(|src| (expr, src))
797 let (span, msg, suggestion) = if let (Some((lhs_expr, lhs_src)), false) =
798 (lhs_expr_and_src, exp_to_found_is_fallible)
801 "you can convert `{}` from `{}` to `{}`, matching the type of `{}`",
802 lhs_src, expected_ty, checked_ty, src
804 let suggestion = format!("{}::from({})", checked_ty, lhs_src);
805 (lhs_expr.span, msg, suggestion)
807 let msg = format!("{} and panic if the converted value doesn't fit", msg);
809 format!("{}{}.try_into().unwrap()", prefix, with_opt_paren(&src));
810 (expr.span, msg, suggestion)
812 err.span_suggestion(span, &msg, suggestion, Applicability::MachineApplicable);
815 let suggest_to_change_suffix_or_into =
816 |err: &mut DiagnosticBuilder<'_>,
817 found_to_exp_is_fallible: bool,
818 exp_to_found_is_fallible: bool| {
820 expected_ty_expr.map(|e| self.tcx.hir().is_lhs(e.hir_id)).unwrap_or(false);
826 let always_fallible = found_to_exp_is_fallible
827 && (exp_to_found_is_fallible || expected_ty_expr.is_none());
828 let msg = if literal_is_ty_suffixed(expr) {
830 } else if always_fallible && (is_negative_int(expr) && is_uint(expected_ty)) {
831 // We now know that converting either the lhs or rhs is fallible. Before we
832 // suggest a fallible conversion, check if the value can never fit in the
834 let msg = format!("`{}` cannot fit into type `{}`", src, expected_ty);
837 } else if in_const_context {
838 // Do not recommend `into` or `try_into` in const contexts.
840 } else if found_to_exp_is_fallible {
841 return suggest_fallible_into_or_lhs_from(err, exp_to_found_is_fallible);
845 let suggestion = if literal_is_ty_suffixed(expr) {
846 suffix_suggestion.clone()
848 into_suggestion.clone()
850 err.span_suggestion(expr.span, msg, suggestion, Applicability::MachineApplicable);
853 match (&expected_ty.kind(), &checked_ty.kind()) {
854 (&ty::Int(ref exp), &ty::Int(ref found)) => {
855 let (f2e_is_fallible, e2f_is_fallible) = match (exp.bit_width(), found.bit_width())
857 (Some(exp), Some(found)) if exp < found => (true, false),
858 (Some(exp), Some(found)) if exp > found => (false, true),
859 (None, Some(8 | 16)) => (false, true),
860 (Some(8 | 16), None) => (true, false),
861 (None, _) | (_, None) => (true, true),
864 suggest_to_change_suffix_or_into(err, f2e_is_fallible, e2f_is_fallible);
867 (&ty::Uint(ref exp), &ty::Uint(ref found)) => {
868 let (f2e_is_fallible, e2f_is_fallible) = match (exp.bit_width(), found.bit_width())
870 (Some(exp), Some(found)) if exp < found => (true, false),
871 (Some(exp), Some(found)) if exp > found => (false, true),
872 (None, Some(8 | 16)) => (false, true),
873 (Some(8 | 16), None) => (true, false),
874 (None, _) | (_, None) => (true, true),
877 suggest_to_change_suffix_or_into(err, f2e_is_fallible, e2f_is_fallible);
880 (&ty::Int(exp), &ty::Uint(found)) => {
881 let (f2e_is_fallible, e2f_is_fallible) = match (exp.bit_width(), found.bit_width())
883 (Some(exp), Some(found)) if found < exp => (false, true),
884 (None, Some(8)) => (false, true),
887 suggest_to_change_suffix_or_into(err, f2e_is_fallible, e2f_is_fallible);
890 (&ty::Uint(exp), &ty::Int(found)) => {
891 let (f2e_is_fallible, e2f_is_fallible) = match (exp.bit_width(), found.bit_width())
893 (Some(exp), Some(found)) if found > exp => (true, false),
894 (Some(8), None) => (true, false),
897 suggest_to_change_suffix_or_into(err, f2e_is_fallible, e2f_is_fallible);
900 (&ty::Float(ref exp), &ty::Float(ref found)) => {
901 if found.bit_width() < exp.bit_width() {
902 suggest_to_change_suffix_or_into(err, false, true);
903 } else if literal_is_ty_suffixed(expr) {
908 Applicability::MachineApplicable,
911 // Missing try_into implementation for `f64` to `f32`
914 &format!("{}, producing the closest possible value", cast_msg),
916 Applicability::MaybeIncorrect, // lossy conversion
921 (&ty::Uint(_) | &ty::Int(_), &ty::Float(_)) => {
922 if literal_is_ty_suffixed(expr) {
927 Applicability::MachineApplicable,
930 // Missing try_into implementation for `{float}` to `{integer}`
933 &format!("{}, rounding the float towards zero", msg),
935 Applicability::MaybeIncorrect, // lossy conversion
940 (&ty::Float(ref exp), &ty::Uint(ref found)) => {
941 // if `found` is `None` (meaning found is `usize`), don't suggest `.into()`
942 if exp.bit_width() > found.bit_width().unwrap_or(256) {
946 "{}, producing the floating point representation of the integer",
950 Applicability::MachineApplicable,
952 } else if literal_is_ty_suffixed(expr) {
957 Applicability::MachineApplicable,
960 // Missing try_into implementation for `{integer}` to `{float}`
964 "{}, producing the floating point representation of the integer,
965 rounded if necessary",
969 Applicability::MaybeIncorrect, // lossy conversion
974 (&ty::Float(ref exp), &ty::Int(ref found)) => {
975 // if `found` is `None` (meaning found is `isize`), don't suggest `.into()`
976 if exp.bit_width() > found.bit_width().unwrap_or(256) {
980 "{}, producing the floating point representation of the integer",
984 Applicability::MachineApplicable,
986 } else if literal_is_ty_suffixed(expr) {
991 Applicability::MachineApplicable,
994 // Missing try_into implementation for `{integer}` to `{float}`
998 "{}, producing the floating point representation of the integer, \
999 rounded if necessary",
1003 Applicability::MaybeIncorrect, // lossy conversion