abcop 0.18.2

Must-have ABC complexity gate for AI development. Ruby, Rust, Python, Go, JS/TS, C/C++, PHP, Java, C#, Swift, Zig, Dart, Solidity, Haskell, 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

//! Scope tree and per-identifier bookkeeping shared by the analyses.

use std::collections::HashMap;

use tree_sitter::{Node, Tree};

#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub(super) enum IntroKind {
    /// `let x = ...`
    Assign,
    /// params, `+=`, pattern bindings — never inline candidates
    Binding,
}

#[derive(Clone, Copy, Debug)]
pub(super) struct Write {
    pub(super) byte: usize,
    pub(super) node_id: usize,
    pub(super) plain: bool,
    pub(super) rhs: Option<(usize, usize)>,
}

#[derive(Debug)]
pub(super) struct Entry {
    pub(super) intro_byte: usize,
    pub(super) intro_kind: IntroKind,
    pub(super) writes: Vec<Write>,
    pub(super) reads: Vec<usize>,
    /// reads that occurred inside a `token_tree` (macro input): macros may
    /// give identifiers syntactic roles, so they never justify inlining
    pub(super) macro_reads: usize,
}

#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub(super) enum ScopeKind {
    Root,
    Function,
    Block,
}

pub(super) struct Scope {
    pub(super) parent: Option<usize>,
    pub(super) kind: ScopeKind,
    pub(super) entries: HashMap<Box<str>, Entry>,
}

pub struct RustFile<'s> {
    pub src: &'s [u8],
    pub tree: Tree,
    pub(super) scopes: Vec<Scope>,
}

impl<'s> RustFile<'s> {
    pub(super) fn text(&self, n: Node<'_>) -> &str {
        n.utf8_text(self.src).unwrap_or("")
    }

    pub(super) fn line_col(&self, byte: usize) -> (usize, usize) {
        let point = self
            .tree
            .root_node()
            .descendant_for_byte_range(byte, byte)
            .map(|n| n.start_position())
            .unwrap_or_default();
        (point.row + 1, point.column)
    }
}