2018-05-23 04:56:02 +00:00
|
|
|
//! lint on indexing and slicing operations
|
|
|
|
|
2018-05-30 08:15:50 +00:00
|
|
|
use crate::consts::{constant, Constant};
|
2020-02-18 13:28:18 +00:00
|
|
|
use crate::utils::{higher, span_lint, span_lint_and_help};
|
2020-03-01 03:23:33 +00:00
|
|
|
use rustc_ast::ast::RangeLimits;
|
2020-02-21 08:39:38 +00:00
|
|
|
use rustc_hir::{Expr, ExprKind};
|
2020-01-12 06:08:41 +00:00
|
|
|
use rustc_lint::{LateContext, LateLintPass};
|
2020-03-30 09:02:14 +00:00
|
|
|
use rustc_middle::ty;
|
2020-01-11 11:37:08 +00:00
|
|
|
use rustc_session::{declare_lint_pass, declare_tool_lint};
|
2015-12-21 18:22:29 +00:00
|
|
|
|
2018-03-28 13:24:26 +00:00
|
|
|
declare_clippy_lint! {
|
2019-03-05 16:50:33 +00:00
|
|
|
/// **What it does:** Checks for out of bounds array indexing with a constant
|
|
|
|
/// index.
|
|
|
|
///
|
|
|
|
/// **Why is this bad?** This will always panic at runtime.
|
|
|
|
///
|
|
|
|
/// **Known problems:** Hopefully none.
|
|
|
|
///
|
|
|
|
/// **Example:**
|
2019-03-05 22:23:50 +00:00
|
|
|
/// ```no_run
|
|
|
|
/// # #![allow(const_err)]
|
2019-03-05 16:50:33 +00:00
|
|
|
/// let x = [1, 2, 3, 4];
|
|
|
|
///
|
|
|
|
/// // Bad
|
|
|
|
/// x[9];
|
|
|
|
/// &x[2..9];
|
|
|
|
///
|
|
|
|
/// // Good
|
|
|
|
/// x[0];
|
|
|
|
/// x[3];
|
|
|
|
/// ```
|
2015-12-21 18:22:29 +00:00
|
|
|
pub OUT_OF_BOUNDS_INDEXING,
|
2018-03-28 13:24:26 +00:00
|
|
|
correctness,
|
2016-08-06 08:18:36 +00:00
|
|
|
"out of bounds constant indexing"
|
2015-12-21 18:22:29 +00:00
|
|
|
}
|
|
|
|
|
2018-03-28 13:24:26 +00:00
|
|
|
declare_clippy_lint! {
|
2019-06-12 18:07:10 +00:00
|
|
|
/// **What it does:** Checks for usage of indexing or slicing. Arrays are special cases, this lint
|
2019-03-05 16:50:33 +00:00
|
|
|
/// does report on arrays if we can tell that slicing operations are in bounds and does not
|
|
|
|
/// lint on constant `usize` indexing on arrays because that is handled by rustc's `const_err` lint.
|
|
|
|
///
|
|
|
|
/// **Why is this bad?** Indexing and slicing can panic at runtime and there are
|
|
|
|
/// safe alternatives.
|
|
|
|
///
|
|
|
|
/// **Known problems:** Hopefully none.
|
|
|
|
///
|
|
|
|
/// **Example:**
|
2019-08-03 19:24:50 +00:00
|
|
|
/// ```rust,no_run
|
2019-03-05 16:50:33 +00:00
|
|
|
/// // Vector
|
|
|
|
/// let x = vec![0; 5];
|
|
|
|
///
|
|
|
|
/// // Bad
|
|
|
|
/// x[2];
|
|
|
|
/// &x[2..100];
|
|
|
|
/// &x[2..];
|
|
|
|
/// &x[..100];
|
|
|
|
///
|
|
|
|
/// // Good
|
|
|
|
/// x.get(2);
|
|
|
|
/// x.get(2..100);
|
|
|
|
/// x.get(2..);
|
|
|
|
/// x.get(..100);
|
|
|
|
///
|
|
|
|
/// // Array
|
|
|
|
/// let y = [0, 1, 2, 3];
|
|
|
|
///
|
|
|
|
/// // Bad
|
|
|
|
/// &y[10..100];
|
|
|
|
/// &y[10..];
|
|
|
|
/// &y[..100];
|
|
|
|
///
|
|
|
|
/// // Good
|
|
|
|
/// &y[2..];
|
|
|
|
/// &y[..2];
|
|
|
|
/// &y[0..3];
|
|
|
|
/// y.get(10);
|
|
|
|
/// y.get(10..100);
|
|
|
|
/// y.get(10..);
|
|
|
|
/// y.get(..100);
|
|
|
|
/// ```
|
2016-03-11 09:51:16 +00:00
|
|
|
pub INDEXING_SLICING,
|
2018-08-02 17:06:03 +00:00
|
|
|
restriction,
|
2016-03-11 09:51:16 +00:00
|
|
|
"indexing/slicing usage"
|
|
|
|
}
|
|
|
|
|
2019-04-08 20:43:55 +00:00
|
|
|
declare_lint_pass!(IndexingSlicing => [INDEXING_SLICING, OUT_OF_BOUNDS_INDEXING]);
|
2015-12-21 18:22:29 +00:00
|
|
|
|
2020-06-25 20:41:36 +00:00
|
|
|
impl<'tcx> LateLintPass<'tcx> for IndexingSlicing {
|
|
|
|
fn check_expr(&mut self, cx: &LateContext<'tcx>, expr: &'tcx Expr<'_>) {
|
2019-09-27 15:16:06 +00:00
|
|
|
if let ExprKind::Index(ref array, ref index) = &expr.kind {
|
2020-07-17 08:47:04 +00:00
|
|
|
let ty = cx.typeck_results().expr_ty(array);
|
2020-08-04 13:24:13 +00:00
|
|
|
if let Some(range) = higher::range(index) {
|
2019-01-31 01:15:29 +00:00
|
|
|
// Ranged indexes, i.e., &x[n..m], &x[n..], &x[..n] and &x[..]
|
2019-09-26 09:03:36 +00:00
|
|
|
if let ty::Array(_, s) = ty.kind {
|
2020-03-02 20:53:41 +00:00
|
|
|
let size: u128 = if let Some(size) = s.try_eval_usize(cx.tcx, cx.param_env) {
|
|
|
|
size.into()
|
|
|
|
} else {
|
|
|
|
return;
|
|
|
|
};
|
2018-10-13 20:51:53 +00:00
|
|
|
|
2018-10-14 14:49:28 +00:00
|
|
|
let const_range = to_const_range(cx, range, size);
|
|
|
|
|
|
|
|
if let (Some(start), _) = const_range {
|
|
|
|
if start > size {
|
2020-02-18 13:28:18 +00:00
|
|
|
span_lint(
|
2018-10-14 14:49:28 +00:00
|
|
|
cx,
|
|
|
|
OUT_OF_BOUNDS_INDEXING,
|
2018-10-15 11:44:39 +00:00
|
|
|
range.start.map_or(expr.span, |start| start.span),
|
2018-10-14 14:49:28 +00:00
|
|
|
"range is out of bounds",
|
|
|
|
);
|
2018-10-13 20:51:53 +00:00
|
|
|
return;
|
2018-10-14 14:49:28 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if let (_, Some(end)) = const_range {
|
|
|
|
if end > size {
|
2020-02-18 13:28:18 +00:00
|
|
|
span_lint(
|
2018-10-14 14:49:28 +00:00
|
|
|
cx,
|
|
|
|
OUT_OF_BOUNDS_INDEXING,
|
2018-10-15 11:44:39 +00:00
|
|
|
range.end.map_or(expr.span, |end| end.span),
|
2018-10-14 14:49:28 +00:00
|
|
|
"range is out of bounds",
|
|
|
|
);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if let (Some(_), Some(_)) = const_range {
|
|
|
|
// early return because both start and end are constants
|
|
|
|
// and we have proven above that they are in bounds
|
|
|
|
return;
|
2017-09-13 13:34:04 +00:00
|
|
|
}
|
2015-12-21 18:22:29 +00:00
|
|
|
}
|
2018-06-14 20:04:37 +00:00
|
|
|
|
|
|
|
let help_msg = match (range.start, range.end) {
|
|
|
|
(None, Some(_)) => "Consider using `.get(..n)`or `.get_mut(..n)` instead",
|
|
|
|
(Some(_), None) => "Consider using `.get(n..)` or .get_mut(n..)` instead",
|
|
|
|
(Some(_), Some(_)) => "Consider using `.get(n..m)` or `.get_mut(n..m)` instead",
|
|
|
|
(None, None) => return, // [..] is ok.
|
|
|
|
};
|
|
|
|
|
2020-04-18 10:28:29 +00:00
|
|
|
span_lint_and_help(cx, INDEXING_SLICING, expr.span, "slicing may panic.", None, help_msg);
|
2018-06-14 20:04:37 +00:00
|
|
|
} else {
|
2019-01-31 01:15:29 +00:00
|
|
|
// Catchall non-range index, i.e., [n] or [n << m]
|
2019-09-26 09:03:36 +00:00
|
|
|
if let ty::Array(..) = ty.kind {
|
2018-06-14 20:04:37 +00:00
|
|
|
// Index is a constant uint.
|
2020-07-17 08:47:04 +00:00
|
|
|
if let Some(..) = constant(cx, cx.typeck_results(), index) {
|
2018-06-19 21:30:43 +00:00
|
|
|
// Let rustc's `const_err` lint handle constant `usize` indexing on arrays.
|
2018-06-14 20:04:37 +00:00
|
|
|
return;
|
2016-03-11 09:51:16 +00:00
|
|
|
}
|
|
|
|
}
|
2018-06-14 20:04:37 +00:00
|
|
|
|
2020-02-18 13:28:18 +00:00
|
|
|
span_lint_and_help(
|
2018-06-14 20:04:37 +00:00
|
|
|
cx,
|
|
|
|
INDEXING_SLICING,
|
|
|
|
expr.span,
|
|
|
|
"indexing may panic.",
|
2020-04-18 10:28:29 +00:00
|
|
|
None,
|
2018-06-14 20:04:37 +00:00
|
|
|
"Consider using `.get(n)` or `.get_mut(n)` instead",
|
|
|
|
);
|
2015-12-21 18:22:29 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2016-03-11 09:51:16 +00:00
|
|
|
|
2018-10-13 20:51:53 +00:00
|
|
|
/// Returns a tuple of options with the start and end (exclusive) values of
|
|
|
|
/// the range. If the start or end is not constant, None is returned.
|
2020-06-25 20:41:36 +00:00
|
|
|
fn to_const_range<'tcx>(
|
|
|
|
cx: &LateContext<'tcx>,
|
2020-02-18 13:28:18 +00:00
|
|
|
range: higher::Range<'_>,
|
2018-05-23 04:56:02 +00:00
|
|
|
array_size: u128,
|
2018-10-13 20:51:53 +00:00
|
|
|
) -> (Option<u128>, Option<u128>) {
|
2020-07-17 08:47:04 +00:00
|
|
|
let s = range
|
|
|
|
.start
|
|
|
|
.map(|expr| constant(cx, cx.typeck_results(), expr).map(|(c, _)| c));
|
2018-04-02 04:34:11 +00:00
|
|
|
let start = match s {
|
2018-10-13 20:51:53 +00:00
|
|
|
Some(Some(Constant::Int(x))) => Some(x),
|
|
|
|
Some(_) => None,
|
|
|
|
None => Some(0),
|
2016-03-11 09:51:16 +00:00
|
|
|
};
|
|
|
|
|
2020-07-17 08:47:04 +00:00
|
|
|
let e = range
|
|
|
|
.end
|
|
|
|
.map(|expr| constant(cx, cx.typeck_results(), expr).map(|(c, _)| c));
|
2018-04-02 04:34:11 +00:00
|
|
|
let end = match e {
|
2018-11-27 20:14:15 +00:00
|
|
|
Some(Some(Constant::Int(x))) => {
|
|
|
|
if range.limits == RangeLimits::Closed {
|
|
|
|
Some(x + 1)
|
|
|
|
} else {
|
|
|
|
Some(x)
|
|
|
|
}
|
2016-12-20 17:21:30 +00:00
|
|
|
},
|
2018-10-13 20:51:53 +00:00
|
|
|
Some(_) => None,
|
|
|
|
None => Some(array_size),
|
2016-03-11 09:51:16 +00:00
|
|
|
};
|
|
|
|
|
2018-10-13 20:51:53 +00:00
|
|
|
(start, end)
|
2016-03-11 09:51:16 +00:00
|
|
|
}
|