2019-02-23 01:19:50 +00:00
|
|
|
//! calculate cognitive complexity and warn about overly complex functions
|
2015-11-18 11:35:18 +00:00
|
|
|
|
2020-01-09 07:13:22 +00:00
|
|
|
use rustc::hir::map::Map;
|
2020-01-11 11:37:08 +00:00
|
|
|
use rustc::lint::{LateContext, LateLintPass, LintContext};
|
2020-01-09 07:13:22 +00:00
|
|
|
use rustc_hir::intravisit::{walk_expr, FnKind, NestedVisitorMap, Visitor};
|
2020-01-06 16:39:50 +00:00
|
|
|
use rustc_hir::*;
|
2020-01-11 11:37:08 +00:00
|
|
|
use rustc_session::{declare_tool_lint, impl_lint_pass};
|
2020-01-04 10:00:00 +00:00
|
|
|
use rustc_span::source_map::Span;
|
2019-12-31 00:17:56 +00:00
|
|
|
use rustc_span::BytePos;
|
2019-02-20 10:11:11 +00:00
|
|
|
use syntax::ast::Attribute;
|
2015-11-18 11:35:18 +00:00
|
|
|
|
2019-12-22 02:07:53 +00:00
|
|
|
use crate::utils::{match_type, paths, snippet_opt, span_help_and_lint, LimitStack};
|
2015-11-18 11:35:18 +00:00
|
|
|
|
2018-03-28 13:24:26 +00:00
|
|
|
declare_clippy_lint! {
|
2019-02-23 01:19:50 +00:00
|
|
|
/// **What it does:** Checks for methods with high cognitive complexity.
|
2019-03-05 16:50:33 +00:00
|
|
|
///
|
2019-02-23 01:19:50 +00:00
|
|
|
/// **Why is this bad?** Methods of high cognitive complexity tend to be hard to
|
|
|
|
/// both read and maintain. Also LLVM will tend to optimize small methods better.
|
2019-03-05 16:50:33 +00:00
|
|
|
///
|
|
|
|
/// **Known problems:** Sometimes it's hard to find a way to reduce the
|
|
|
|
/// complexity.
|
|
|
|
///
|
|
|
|
/// **Example:** No. You'll see it when you get the warning.
|
2019-02-23 01:19:50 +00:00
|
|
|
pub COGNITIVE_COMPLEXITY,
|
2018-03-28 13:24:26 +00:00
|
|
|
complexity,
|
2016-08-06 08:18:36 +00:00
|
|
|
"functions that should be split up into multiple functions"
|
2016-02-05 23:13:29 +00:00
|
|
|
}
|
2015-11-18 11:35:18 +00:00
|
|
|
|
2019-02-23 01:19:50 +00:00
|
|
|
pub struct CognitiveComplexity {
|
2015-11-18 11:35:18 +00:00
|
|
|
limit: LimitStack,
|
|
|
|
}
|
|
|
|
|
2019-02-23 01:19:50 +00:00
|
|
|
impl CognitiveComplexity {
|
2019-09-18 06:37:41 +00:00
|
|
|
#[must_use]
|
2015-11-18 11:35:18 +00:00
|
|
|
pub fn new(limit: u64) -> Self {
|
2017-09-05 09:33:04 +00:00
|
|
|
Self {
|
|
|
|
limit: LimitStack::new(limit),
|
|
|
|
}
|
2015-11-18 11:35:18 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-04-08 20:43:55 +00:00
|
|
|
impl_lint_pass!(CognitiveComplexity => [COGNITIVE_COMPLEXITY]);
|
2015-11-18 11:35:18 +00:00
|
|
|
|
2019-02-23 01:19:50 +00:00
|
|
|
impl CognitiveComplexity {
|
2019-12-22 02:07:53 +00:00
|
|
|
#[allow(clippy::cast_possible_truncation)]
|
|
|
|
fn check<'a, 'tcx>(
|
|
|
|
&mut self,
|
|
|
|
cx: &'a LateContext<'a, 'tcx>,
|
|
|
|
kind: FnKind<'tcx>,
|
2019-12-30 04:02:10 +00:00
|
|
|
decl: &'tcx FnDecl<'_>,
|
2019-12-22 14:42:41 +00:00
|
|
|
body: &'tcx Body<'_>,
|
2019-12-22 02:07:53 +00:00
|
|
|
body_span: Span,
|
|
|
|
) {
|
|
|
|
if body_span.from_expansion() {
|
2016-01-04 04:26:12 +00:00
|
|
|
return;
|
|
|
|
}
|
2016-04-05 15:29:14 +00:00
|
|
|
|
2017-03-05 02:10:46 +00:00
|
|
|
let expr = &body.value;
|
2019-09-08 10:39:42 +00:00
|
|
|
|
|
|
|
let mut helper = CCHelper { cc: 1, returns: 0 };
|
2016-11-16 20:57:56 +00:00
|
|
|
helper.visit_expr(expr);
|
2019-09-08 10:39:42 +00:00
|
|
|
let CCHelper { cc, returns } = helper;
|
2019-02-13 21:06:19 +00:00
|
|
|
let ret_ty = cx.tables.node_type(expr.hir_id);
|
2019-05-17 21:53:54 +00:00
|
|
|
let ret_adjust = if match_type(cx, ret_ty, &paths::RESULT) {
|
2016-04-23 12:30:05 +00:00
|
|
|
returns
|
|
|
|
} else {
|
2019-06-11 16:53:12 +00:00
|
|
|
#[allow(clippy::integer_division)]
|
|
|
|
(returns / 2)
|
2016-04-23 12:30:05 +00:00
|
|
|
};
|
2016-03-04 15:27:03 +00:00
|
|
|
|
2019-09-08 10:39:42 +00:00
|
|
|
let mut rust_cc = cc;
|
|
|
|
// prevent degenerate cases where unreachable code contains `return` statements
|
|
|
|
if rust_cc >= ret_adjust {
|
|
|
|
rust_cc -= ret_adjust;
|
|
|
|
}
|
2019-12-22 02:07:53 +00:00
|
|
|
|
2019-09-08 10:39:42 +00:00
|
|
|
if rust_cc > self.limit.limit() {
|
2019-12-22 02:07:53 +00:00
|
|
|
let fn_span = match kind {
|
|
|
|
FnKind::ItemFn(ident, _, _, _, _) | FnKind::Method(ident, _, _, _) => ident.span,
|
|
|
|
FnKind::Closure(_) => {
|
|
|
|
let header_span = body_span.with_hi(decl.output.span().lo());
|
|
|
|
let pos = snippet_opt(cx, header_span).and_then(|snip| {
|
|
|
|
let low_offset = snip.find('|')?;
|
|
|
|
let high_offset = 1 + snip.get(low_offset + 1..)?.find('|')?;
|
|
|
|
let low = header_span.lo() + BytePos(low_offset as u32);
|
|
|
|
let high = low + BytePos(high_offset as u32 + 1);
|
|
|
|
|
|
|
|
Some((low, high))
|
|
|
|
});
|
|
|
|
|
|
|
|
if let Some((low, high)) = pos {
|
|
|
|
Span::new(low, high, header_span.ctxt())
|
|
|
|
} else {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
},
|
|
|
|
};
|
|
|
|
|
2019-09-08 10:39:42 +00:00
|
|
|
span_help_and_lint(
|
2017-08-11 12:11:46 +00:00
|
|
|
cx,
|
2019-09-08 10:39:42 +00:00
|
|
|
COGNITIVE_COMPLEXITY,
|
2019-12-22 02:07:53 +00:00
|
|
|
fn_span,
|
2019-09-08 10:39:42 +00:00
|
|
|
&format!(
|
|
|
|
"the function has a cognitive complexity of ({}/{})",
|
|
|
|
rust_cc,
|
|
|
|
self.limit.limit()
|
|
|
|
),
|
|
|
|
"you could split it up into multiple smaller functions",
|
2017-08-11 12:11:46 +00:00
|
|
|
);
|
2015-11-18 11:35:18 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-02-23 01:19:50 +00:00
|
|
|
impl<'a, 'tcx> LateLintPass<'a, 'tcx> for CognitiveComplexity {
|
2017-01-13 16:04:56 +00:00
|
|
|
fn check_fn(
|
|
|
|
&mut self,
|
|
|
|
cx: &LateContext<'a, 'tcx>,
|
2019-12-22 02:07:53 +00:00
|
|
|
kind: FnKind<'tcx>,
|
2019-12-30 04:02:10 +00:00
|
|
|
decl: &'tcx FnDecl<'_>,
|
2019-12-22 14:42:41 +00:00
|
|
|
body: &'tcx Body<'_>,
|
2017-01-13 16:04:56 +00:00
|
|
|
span: Span,
|
2019-02-20 10:11:11 +00:00
|
|
|
hir_id: HirId,
|
2017-01-13 16:04:56 +00:00
|
|
|
) {
|
2019-07-06 03:52:51 +00:00
|
|
|
let def_id = cx.tcx.hir().local_def_id(hir_id);
|
2019-05-17 21:53:54 +00:00
|
|
|
if !cx.tcx.has_attr(def_id, sym!(test)) {
|
2019-12-22 02:07:53 +00:00
|
|
|
self.check(cx, kind, decl, body, span);
|
2015-11-18 11:35:18 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-12-07 12:13:40 +00:00
|
|
|
fn enter_lint_attrs(&mut self, cx: &LateContext<'a, 'tcx>, attrs: &'tcx [Attribute]) {
|
2019-02-23 01:19:50 +00:00
|
|
|
self.limit.push_attrs(cx.sess(), attrs, "cognitive_complexity");
|
2015-11-18 11:35:18 +00:00
|
|
|
}
|
2016-12-07 12:13:40 +00:00
|
|
|
fn exit_lint_attrs(&mut self, cx: &LateContext<'a, 'tcx>, attrs: &'tcx [Attribute]) {
|
2019-02-23 01:19:50 +00:00
|
|
|
self.limit.pop_attrs(cx.sess(), attrs, "cognitive_complexity");
|
2015-11-18 11:35:18 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-09-08 10:39:42 +00:00
|
|
|
struct CCHelper {
|
|
|
|
cc: u64,
|
2016-04-23 12:30:05 +00:00
|
|
|
returns: u64,
|
2016-03-04 15:27:03 +00:00
|
|
|
}
|
2015-11-18 11:35:18 +00:00
|
|
|
|
2019-09-08 10:39:42 +00:00
|
|
|
impl<'tcx> Visitor<'tcx> for CCHelper {
|
2020-01-09 07:13:22 +00:00
|
|
|
type Map = Map<'tcx>;
|
|
|
|
|
2019-12-27 07:12:26 +00:00
|
|
|
fn visit_expr(&mut self, e: &'tcx Expr<'_>) {
|
2019-09-08 10:39:42 +00:00
|
|
|
walk_expr(self, e);
|
2019-09-27 15:16:06 +00:00
|
|
|
match e.kind {
|
2018-07-12 07:30:57 +00:00
|
|
|
ExprKind::Match(_, ref arms, _) => {
|
2019-09-25 19:00:17 +00:00
|
|
|
if arms.len() > 1 {
|
2019-09-08 10:39:42 +00:00
|
|
|
self.cc += 1;
|
2016-03-08 14:10:02 +00:00
|
|
|
}
|
2019-09-08 10:39:42 +00:00
|
|
|
self.cc += arms.iter().filter(|arm| arm.guard.is_some()).count() as u64;
|
2016-12-20 17:21:30 +00:00
|
|
|
},
|
2018-07-12 07:30:57 +00:00
|
|
|
ExprKind::Ret(_) => self.returns += 1,
|
2019-09-08 10:39:42 +00:00
|
|
|
_ => {},
|
2015-11-18 11:35:18 +00:00
|
|
|
}
|
|
|
|
}
|
2020-01-09 07:13:22 +00:00
|
|
|
fn nested_visit_map(&mut self) -> NestedVisitorMap<'_, Self::Map> {
|
2016-12-06 10:32:21 +00:00
|
|
|
NestedVisitorMap::None
|
|
|
|
}
|
2015-11-18 11:35:18 +00:00
|
|
|
}
|