2019-03-26 09:12:14 -05:00
|
|
|
use crate::consts::{constant_context, Constant};
|
2019-05-14 03:06:21 -05:00
|
|
|
use crate::utils::{match_qpath, paths, span_lint};
|
2019-03-26 09:12:14 -05:00
|
|
|
use if_chain::if_chain;
|
2019-12-03 17:16:03 -06:00
|
|
|
use rustc::declare_lint_pass;
|
2019-03-26 09:12:14 -05:00
|
|
|
use rustc::hir::{Expr, ExprKind};
|
|
|
|
use rustc::lint::{in_external_macro, LateContext, LateLintPass, LintArray, LintContext, LintPass};
|
2019-12-03 17:16:03 -06:00
|
|
|
use rustc_session::declare_tool_lint;
|
2019-03-26 09:12:14 -05:00
|
|
|
use syntax::ast::LitKind;
|
|
|
|
|
|
|
|
declare_clippy_lint! {
|
|
|
|
/// **What it does:** Checks for transmute calls which would receive a null pointer.
|
|
|
|
///
|
|
|
|
/// **Why is this bad?** Transmuting a null pointer is undefined behavior.
|
|
|
|
///
|
|
|
|
/// **Known problems:** Not all cases can be detected at the moment of this writing.
|
|
|
|
/// For example, variables which hold a null pointer and are then fed to a `transmute`
|
|
|
|
/// call, aren't detectable yet.
|
|
|
|
///
|
|
|
|
/// **Example:**
|
|
|
|
/// ```rust
|
|
|
|
/// let null_ref: &u64 = unsafe { std::mem::transmute(0 as *const u64) };
|
|
|
|
/// ```
|
|
|
|
pub TRANSMUTING_NULL,
|
|
|
|
correctness,
|
|
|
|
"transmutes from a null pointer to a reference, which is undefined behavior"
|
|
|
|
}
|
|
|
|
|
2019-04-08 15:43:55 -05:00
|
|
|
declare_lint_pass!(TransmutingNull => [TRANSMUTING_NULL]);
|
2019-03-26 09:12:14 -05:00
|
|
|
|
|
|
|
const LINT_MSG: &str = "transmuting a known null pointer into a reference.";
|
|
|
|
|
2019-04-08 15:43:55 -05:00
|
|
|
impl<'a, 'tcx> LateLintPass<'a, 'tcx> for TransmutingNull {
|
2019-03-26 09:12:14 -05:00
|
|
|
fn check_expr(&mut self, cx: &LateContext<'a, 'tcx>, expr: &'tcx Expr) {
|
|
|
|
if in_external_macro(cx.sess(), expr.span) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if_chain! {
|
2019-09-27 10:16:06 -05:00
|
|
|
if let ExprKind::Call(ref func, ref args) = expr.kind;
|
|
|
|
if let ExprKind::Path(ref path) = func.kind;
|
2019-05-17 16:53:54 -05:00
|
|
|
if match_qpath(path, &paths::STD_MEM_TRANSMUTE);
|
2019-03-26 09:12:14 -05:00
|
|
|
if args.len() == 1;
|
|
|
|
|
|
|
|
then {
|
|
|
|
|
|
|
|
// Catching transmute over constants that resolve to `null`.
|
|
|
|
let mut const_eval_context = constant_context(cx, cx.tables);
|
|
|
|
if_chain! {
|
2019-09-27 10:16:06 -05:00
|
|
|
if let ExprKind::Path(ref _qpath) = args[0].kind;
|
2019-03-26 09:12:14 -05:00
|
|
|
let x = const_eval_context.expr(&args[0]);
|
|
|
|
if let Some(constant) = x;
|
2019-09-29 11:40:38 -05:00
|
|
|
if let Constant::RawPtr(0) = constant;
|
2019-03-26 09:12:14 -05:00
|
|
|
then {
|
2019-09-29 11:40:38 -05:00
|
|
|
span_lint(cx, TRANSMUTING_NULL, expr.span, LINT_MSG)
|
2019-03-26 09:12:14 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Catching:
|
|
|
|
// `std::mem::transmute(0 as *const i32)`
|
|
|
|
if_chain! {
|
2019-09-27 10:16:06 -05:00
|
|
|
if let ExprKind::Cast(ref inner_expr, ref _cast_ty) = args[0].kind;
|
|
|
|
if let ExprKind::Lit(ref lit) = inner_expr.kind;
|
2019-03-26 09:12:14 -05:00
|
|
|
if let LitKind::Int(0, _) = lit.node;
|
|
|
|
then {
|
2019-09-29 11:40:38 -05:00
|
|
|
span_lint(cx, TRANSMUTING_NULL, expr.span, LINT_MSG)
|
2019-03-26 09:12:14 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Catching:
|
|
|
|
// `std::mem::transmute(std::ptr::null::<i32>())`
|
|
|
|
if_chain! {
|
2019-09-27 10:16:06 -05:00
|
|
|
if let ExprKind::Call(ref func1, ref args1) = args[0].kind;
|
|
|
|
if let ExprKind::Path(ref path1) = func1.kind;
|
2019-05-17 16:53:54 -05:00
|
|
|
if match_qpath(path1, &paths::STD_PTR_NULL);
|
2019-03-26 09:12:14 -05:00
|
|
|
if args1.len() == 0;
|
|
|
|
then {
|
2019-09-29 11:40:38 -05:00
|
|
|
span_lint(cx, TRANSMUTING_NULL, expr.span, LINT_MSG)
|
2019-03-26 09:12:14 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// FIXME:
|
|
|
|
// Also catch transmutations of variables which are known nulls.
|
|
|
|
// To do this, MIR const propagation seems to be the better tool.
|
|
|
|
// Whenever MIR const prop routines are more developed, this will
|
|
|
|
// become available. As of this writing (25/03/19) it is not yet.
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|