2
0
Fork 0
mirror of https://github.com/rust-lang/rust-clippy synced 2024-12-30 15:03:36 +00:00
rust-clippy/clippy_lints/src/cyclomatic_complexity.rs

190 lines
6.7 KiB
Rust
Raw Normal View History

//! calculate cyclomatic complexity and warn about overly complex functions
use rustc::cfg::CFG;
use rustc::lint::*;
use rustc::ty;
use rustc::hir::*;
use rustc::hir::intravisit::{Visitor, walk_expr};
2016-02-24 16:38:57 +00:00
use syntax::ast::Attribute;
use syntax::attr;
2016-02-24 16:38:57 +00:00
use syntax::codemap::Span;
2016-04-23 12:30:05 +00:00
use utils::{in_macro, LimitStack, span_help_and_lint, paths, match_type};
/// **What it does:** Checks for methods with high cyclomatic complexity.
2015-12-14 21:16:56 +00:00
///
/// **Why is this bad?** Methods of high cyclomatic complexity tend to be badly
/// readable. Also LLVM will usually optimize small methods better.
2015-12-14 21:16:56 +00:00
///
/// **Known problems:** Sometimes it's hard to find a way to reduce the complexity.
2015-12-14 21:16:56 +00:00
///
/// **Example:** No. You'll see it when you get the warning.
declare_lint! {
pub CYCLOMATIC_COMPLEXITY, Warn,
"finds functions that should be split up into multiple functions"
}
pub struct CyclomaticComplexity {
limit: LimitStack,
}
impl CyclomaticComplexity {
pub fn new(limit: u64) -> Self {
2016-01-04 04:26:12 +00:00
CyclomaticComplexity { limit: LimitStack::new(limit) }
}
}
impl LintPass for CyclomaticComplexity {
fn get_lints(&self) -> LintArray {
lint_array!(CYCLOMATIC_COMPLEXITY)
}
}
impl CyclomaticComplexity {
fn check<'a, 'tcx>(&mut self, cx: &'a LateContext<'a, 'tcx>, block: &Block, span: Span) {
2016-01-04 04:26:12 +00:00
if in_macro(cx, span) {
return;
}
let cfg = CFG::new(cx.tcx, block);
let n = cfg.graph.len_nodes() as u64;
let e = cfg.graph.len_edges() as u64;
if e + 2 < n {
// the function has unreachable code, other lints should catch this
return;
}
let cc = e + 2 - n;
let mut helper = CCHelper {
match_arms: 0,
divergence: 0,
short_circuits: 0,
2016-04-23 12:30:05 +00:00
returns: 0,
tcx: &cx.tcx,
};
helper.visit_block(block);
2016-04-23 12:30:05 +00:00
let CCHelper { match_arms, divergence, short_circuits, returns, .. } = helper;
let ret_ty = cx.tcx.node_id_to_type(block.id);
let ret_adjust = if match_type(cx, ret_ty, &paths::RESULT) {
returns
} else {
returns / 2
};
if cc + divergence < match_arms + short_circuits {
2016-04-23 12:30:05 +00:00
report_cc_bug(cx, cc, match_arms, divergence, short_circuits, ret_adjust, span);
} else {
2016-04-23 12:30:05 +00:00
let mut rust_cc = cc + divergence - match_arms - short_circuits;
// prevent degenerate cases where unreachable code contains `return` statements
if rust_cc >= ret_adjust {
rust_cc -= ret_adjust;
}
if rust_cc > self.limit.limit() {
2016-01-04 04:26:12 +00:00
span_help_and_lint(cx,
CYCLOMATIC_COMPLEXITY,
span,
2016-02-05 20:54:29 +00:00
&format!("the function has a cyclomatic complexity of {}", rust_cc),
"you could split it up into multiple smaller functions");
}
}
}
}
impl LateLintPass for CyclomaticComplexity {
fn check_item(&mut self, cx: &LateContext, item: &Item) {
if let ItemFn(_, _, _, _, _, ref block) = item.node {
if !attr::contains_name(&item.attrs, "test") {
self.check(cx, block, item.span);
}
}
}
fn check_impl_item(&mut self, cx: &LateContext, item: &ImplItem) {
if let ImplItemKind::Method(_, ref block) = item.node {
self.check(cx, block, item.span);
}
}
fn check_trait_item(&mut self, cx: &LateContext, item: &TraitItem) {
if let MethodTraitItem(_, Some(ref block)) = item.node {
self.check(cx, block, item.span);
}
}
fn enter_lint_attrs(&mut self, cx: &LateContext, attrs: &[Attribute]) {
self.limit.push_attrs(cx.sess(), attrs, "cyclomatic_complexity");
}
fn exit_lint_attrs(&mut self, cx: &LateContext, attrs: &[Attribute]) {
self.limit.pop_attrs(cx.sess(), attrs, "cyclomatic_complexity");
}
}
struct CCHelper<'a, 'gcx: 'a + 'tcx, 'tcx: 'a> {
match_arms: u64,
divergence: u64,
2016-04-23 12:30:05 +00:00
returns: u64,
short_circuits: u64, // && and ||
tcx: &'a ty::TyCtxt<'a, 'gcx, 'tcx>,
}
impl<'a, 'b, 'tcx, 'gcx> Visitor<'a> for CCHelper<'b, 'gcx, 'tcx> {
fn visit_expr(&mut self, e: &'a Expr) {
match e.node {
ExprMatch(_, ref arms, _) => {
walk_expr(self, e);
let arms_n: u64 = arms.iter().map(|arm| arm.pats.len() as u64).sum();
if arms_n > 1 {
self.match_arms += arms_n - 2;
}
2016-01-04 04:26:12 +00:00
}
ExprCall(ref callee, _) => {
walk_expr(self, e);
let ty = self.tcx.node_id_to_type(callee.id);
match ty.sty {
2016-04-14 18:14:03 +00:00
ty::TyFnDef(_, _, ty) |
ty::TyFnPtr(ty) if ty.sig.skip_binder().output.diverges() => {
self.divergence += 1;
}
_ => (),
}
2016-01-04 04:26:12 +00:00
}
ExprClosure(..) => (),
ExprBinary(op, _, _) => {
walk_expr(self, e);
match op.node {
BiAnd | BiOr => self.short_circuits += 1,
2016-04-14 18:14:03 +00:00
_ => (),
}
}
2016-04-23 12:30:05 +00:00
ExprRet(_) => self.returns += 1,
_ => walk_expr(self, e),
}
}
}
#[cfg(feature="debugging")]
2016-04-23 12:30:05 +00:00
fn report_cc_bug(_: &LateContext, cc: u64, narms: u64, div: u64, shorts: u64, returns: u64, span: Span) {
span_bug!(span,
"Clippy encountered a bug calculating cyclomatic complexity: cc = {}, arms = {}, \
2016-04-23 12:30:05 +00:00
div = {}, shorts = {}, returns = {}. Please file a bug report.",
2016-04-14 18:14:03 +00:00
cc,
narms,
div,
2016-04-23 12:30:05 +00:00
shorts,
returns);
}
#[cfg(not(feature="debugging"))]
2016-04-23 12:30:05 +00:00
fn report_cc_bug(cx: &LateContext, cc: u64, narms: u64, div: u64, shorts: u64, returns: u64, span: Span) {
if cx.current_level(CYCLOMATIC_COMPLEXITY) != Level::Allow {
2015-12-31 20:39:03 +00:00
cx.sess().span_note_without_error(span,
&format!("Clippy encountered a bug calculating cyclomatic complexity \
(hide this message with `#[allow(cyclomatic_complexity)]`): \
cc = {}, arms = {}, div = {}, shorts = {}, returns = {}. \
Please file a bug report.",
2016-01-04 04:26:12 +00:00
cc,
narms,
div,
2016-04-23 12:30:05 +00:00
shorts,
returns));
}
}