abcop 0.16.1

Must-have ABC complexity gate for AI development. Ruby, Rust, Python, Go, JS/TS, C/C++, PHP, Java, C#, Swift, Zig, Dart, Solidity, ObjC
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71

//! Solidity candidate-evaluation policy over the shared scope model:
//! the RHS purity whitelist and the straight-line veto/boundary lists.

use tree_sitter::Node;

use super::SolFile;
use crate::scope_model;

/// Ancestors that mark a write as conditional.
const VETO_KINDS: &[&str] = &[
    "if_statement",
    "for_statement",
    "while_statement",
    "do_while_statement",
    "try_statement",
    "catch_clause",
];

/// Ancestors that end the straight-line check (unit boundaries).
const OWNER_KINDS: &[&str] = &[
    "function_definition",
    "constructor_definition",
    "modifier_definition",
];

static SOLIDITY_SEMANTICS: scope_model::Semantics = scope_model::Semantics {
    pure,
    veto: VETO_KINDS,
    owners: OWNER_KINDS,
    include_root_scope: true,
};

pub fn used_once_offenses(fm: &SolFile) -> Vec<crate::used_once::UsedOnceOffense> {
    scope_model::used_once_offenses(
        fm.tree.root_node(),
        &|byte| fm.line_col(byte),
        &fm.scopes,
        &SOLIDITY_SEMANTICS,
    )
}

pub fn never_used_offenses(fm: &SolFile) -> Vec<crate::never_used::NeverUsedOffense> {
    scope_model::never_used_offenses(&|byte| fm.line_col(byte), &fm.scopes, &SOLIDITY_SEMANTICS)
}

/// Conservative RHS purity: literals, arrays/tuples of literals, and
/// operator compositions over them. The grammar wraps every operand in
/// an `expression` node, so unwrapping is part of the whitelist; calls
/// inside that wrapper fail it naturally.
fn pure(n: Node) -> bool {
    match n.kind() {
        "number_literal" | "string_literal" | "string" | "boolean_literal" | "true" | "false" => {
            true
        }
        "expression"
        | "parenthesized_expression"
        | "tuple_expression"
        | "array_expression"
        | "binary_expression"
        | "unary_op_expression"
        | "unary_expression" => children_pure(n),
        _ => false,
    }
}

fn children_pure(n: Node) -> bool {
    let mut c = n.walk();
    n.children(&mut c)
        .filter(|ch| ch.is_named())
        .all(|ch| pure(ch))
}