debtmap
đ§ Early Prototype - This project is under active development and APIs may change
A fast code complexity and technical debt analyzer written in Rust. Debtmap identifies which code to refactor for maximum cognitive debt reduction and which code to test for maximum risk reduction, providing data-driven prioritization for both.
Why Debtmap?
đ¯ What Makes Debtmap Different
Unlike traditional static analysis tools that simply flag complex code, debtmap answers two critical questions:
- "What should I refactor to reduce cognitive burden?" - Identifies overly complex code that slows down development
- "What should I test first to reduce the most risk?" - Pinpoints untested complex code that threatens stability
Unique Capabilities:
- Entropy-Based Complexity Analysis: Uses information theory to distinguish genuinely complex code from pattern-based repetitive code, reducing false positives by up to 70%
- Advanced Token Classification: Categorizes and weights different token types (variables, methods, literals) for more accurate complexity assessment
- Cognitive Complexity Analysis: Goes beyond cyclomatic complexity to measure how hard code is to understand, identifying functions that need refactoring to reduce mental load
- Coverage-Risk Correlation: The only tool that combines complexity metrics with test coverage to identify genuinely risky code (high complexity + low coverage = critical risk)
- Risk-Driven Prioritization: Prioritizes refactoring and testing efforts based on complexity, coverage, and dependency factors to show which changes will have the most impact
- Actionable Refactoring Guidance: Provides specific recommendations like "extract nested conditions" or "split this 80-line function" rather than just flagging issues
- Quantified Impact: Provides concrete metrics like "refactoring this will reduce complexity by 60%" or "testing this will reduce risk by 5%"
- Language-Agnostic Coverage Integration: Works with any tool that generates LCOV format (Jest, pytest, cargo-tarpaulin, etc.)
- Context-Aware False Positive Reduction: Intelligently reduces false positives by understanding code context and patterns (enabled by default)
Speed:
- Written in Rust for 10-100x faster analysis than Java/Python-based competitors
- Parallel processing with Rayon for analyzing massive codebases in seconds
- Incremental analysis caches results for lightning-fast re-runs
Features
- Multi-language support - Fully supports Rust. Partial support for Python, JavaScript, and TypeScript with planned full support.
- Entropy-based complexity analysis - Distinguishes between genuinely complex code and pattern-based repetitive code using information theory
- Token classification system - Advanced token categorization with weighted entropy for more accurate complexity assessment
- Comprehensive debt detection - Identifies technical debt across security, organization, testing, and resource management
- Security vulnerability detection - Finds hardcoded secrets, weak crypto, SQL injection risks, and unsafe code patterns
- Resource management analysis - Identifies inefficient allocations, nested loops, and blocking I/O patterns
- Code organization analysis - Detects god objects, feature envy, primitive obsession, and magic values
- God object detection - Identifies classes/modules with too many responsibilities using method count, field count, and responsibility analysis
- Testing quality assessment - Analyzes test complexity, flaky patterns, and assertion quality
- Context-aware analysis - Reduces false positives through intelligent context detection (enabled by default)
- Enhanced scoring system - Advanced scoring differentiation for better prioritization
- Macro expansion support - Handles Rust macro expansions with configurable warnings and statistics
- Verbosity controls - Multiple verbosity levels (-v, -vv, -vvv) for progressive detail
- Resource management review - Finds async/await misuse, resource leaks, and collection inefficiencies
- Coverage-based risk analysis - Uniquely correlates complexity with test coverage to identify truly risky code
- Risk-driven testing recommendations - Prioritizes testing efforts based on complexity-coverage correlation and dependency impact
- Parallel processing - Built with Rust and Rayon for blazing-fast analysis of large codebases
- Multiple output formats - JSON, TOML, and human-readable table formats
- Configurable thresholds - Customize complexity and duplication thresholds to match your standards
- Incremental analysis - Smart caching system for analyzing only changed files
- Flexible suppression - Inline comment-based suppression for specific code sections and configuration-based ignore patterns
- Test-friendly - Easily exclude test fixtures and example code from debt analysis
Installation
Quick Install (Recommended)
Install the latest release with a single command:
|
Or with wget:
|
This will:
- Automatically detect your OS and architecture
- Download the appropriate pre-built binary from the latest GitHub release
- Install debtmap to
~/.cargo/binif it exists, otherwise~/.local/bin(or$INSTALL_DIRif set) - Offer to automatically add the install directory to your PATH if needed
Using Cargo
From Source
# Clone the repository
# Build and install
Quick Start
# Analyze current directory
# Analyze with coverage data for risk scoring
# Generate coverage with cargo tarpaulin (Rust projects)
# Analyze with custom thresholds
# Output as JSON
# Analyze specific languages only
# Show only top 10 high-priority issues with verbose scoring
# Focus on security issues only
# Group results by debt category
# Initialize configuration file
# Validate project against thresholds
God Object Detection
Debtmap includes sophisticated god object detection that identifies classes and modules with too many responsibilities. A god object is detected based on:
- Method count - Number of methods/functions in a class/module
- Field count - Number of fields/attributes
- Responsibility count - Number of distinct responsibilities (grouped by method naming patterns)
- Lines of code - Overall size of the class/module
God objects are flagged in both terminal and markdown output with detailed metrics:
- Number of methods, fields, and responsibilities
- God object score (0-100%)
- Recommendations for splitting into smaller, focused modules
You can configure god object thresholds in .debtmap.toml:
[]
= true
= 20
= 15
= 5
To disable god object detection for a specific run:
Commands
analyze
Comprehensive analysis with unified prioritization that identifies the highest-value improvements for both testing and refactoring efforts.
)
)
)
)
)
)
)
)
)
)
)
init
Initialize a configuration file for the project.
validate
Validate code against configured thresholds and fail if metrics exceed limits. Supports risk-based validation with coverage data.
)
)
)
compare
Compare two debtmap analysis results to track improvements and detect regressions. Ideal for validating that refactoring efforts achieved their goals.
)
)
)
)
)
Example workflow:
# Generate baseline analysis
# Make improvements to your code
# ... refactor, add tests, etc ...
# Generate new analysis
# Compare and verify improvements
# Or use with an implementation plan
# Output in different formats
Target Location Format:
file:function:line- e.g.,src/main.rs:process_data:100- Can be extracted automatically from plan files containing
**Target**: file:function:linemarkers - When specified, comparison focuses on whether the target item improved
Comparison Results:
- Target Status: Resolved, Improved, Unchanged, Regressed, or Not Found
- Overall Trend: Improving, Stable, or Regressing
- Regressions: New critical debt items introduced
- Metrics: Complexity reduction, coverage improvement, score changes
- Project Health: Before/after comparison with detailed breakdowns
Verbosity Levels
Control the amount of detail in the output using the -v flag:
# Standard output (no verbosity)
# Level 1 (-v): Show main score factors
# Level 2 (-vv): Show detailed calculations
# Level 3 (-vvv): Show all debug information
# Show macro expansion warnings and statistics
Example Output
With Entropy Analysis Enabled
When entropy analysis is enabled, pattern-based complexity is automatically dampened:
# Traditional analysis (without entropy)
# validate_input: Complexity: 15, Priority: HIGH
# With entropy analysis (enabled by default)
# validate_input: Complexity: 5 (dampened by 67%), Priority: LOW
# ââ Token Entropy: 0.3 (repetitive patterns detected)
# ââ Pattern Repetition: 0.8 (high repetition)
# ââ Branch Similarity: 0.9 (similar validation checks)
Unified Priority Output (Default)
debtmap analyze . --lcov target/coverage/lcov.info --top 3
ââââââââââââââââââââââââââââââââââââââââââââ
PRIORITY TECHNICAL DEBT FIXES
ââââââââââââââââââââââââââââââââââââââââââââ
đ¯ TOP 3 RECOMMENDATIONS (by unified priority)
#1 SCORE: 8.9 [CRITICAL]
ââ TEST GAP: ./src/analyzers/rust_call_graph.rs:38 add_function_to_graph()
ââ ACTION: Add 6 unit tests for full coverage
ââ IMPACT: Full test coverage, -3.7 risk
ââ COMPLEXITY: cyclomatic=6, branches=6, cognitive=8, nesting=2, lines=32
ââ DEPENDENCIES: 0 upstream, 11 downstream
ââ WHY: Business logic with 0% coverage, manageable complexity (cyclo=6, cog=8)
#2 SCORE: 8.9 [CRITICAL]
ââ TEST GAP: ./src/debt/smells.rs:196 detect_data_clumps()
ââ ACTION: Add 5 unit tests for full coverage
ââ IMPACT: Full test coverage, -3.7 risk
ââ COMPLEXITY: cyclomatic=5, branches=5, cognitive=11, nesting=5, lines=31
ââ DEPENDENCIES: 0 upstream, 4 downstream
ââ WHY: Business logic with 0% coverage, manageable complexity (cyclo=5, cog=11)
#3 SCORE: 8.6 [CRITICAL]
ââ TEST GAP: ./src/risk/context/dependency.rs:247 explain()
ââ ACTION: Add 5 unit tests for full coverage
ââ IMPACT: Full test coverage, -3.6 risk
ââ COMPLEXITY: cyclomatic=5, branches=5, cognitive=9, nesting=1, lines=24
ââ DEPENDENCIES: 0 upstream, 1 downstream
ââ WHY: Business logic with 0% coverage, manageable complexity (cyclo=5, cog=9)
đ TOTAL DEBT SCORE: 4907
đ OVERALL COVERAGE: 67.12%
JSON Output Format
Analysis Modes
Debtmap offers several specialized analysis modes for focused technical debt assessment:
Category-Specific Analysis
Focus on specific aspects of technical debt using the filter option:
# Architecture-focused analysis (god objects, complexity hotspots)
# Testing quality analysis (coverage gaps, untested code)
# Performance analysis (resource leaks, inefficient patterns)
# Code quality analysis (code smells, maintainability)
# Multiple categories at once
Combined Filtering
Combine multiple options for precise analysis:
# High-priority issues only
# Group by category with coverage data
# Filter specific debt categories with coverage
How Debtmap Works
Analysis Workflow
graph TD
A[Start: debtmap analyze] --> B[Parse Source Files]
B --> C{Language?}
C -->|Rust| D[syn AST Parser]
C -->|Python| E[rustpython Parser]
C -->|JS/TS| F[tree-sitter Parser]
D --> G[Extract Metrics]
E --> G
F --> G
G --> H[Build Call Graph]
H --> I[Semantic Classification]
G --> J[Calculate Complexity]
J --> K[Cyclomatic Complexity]
J --> L[Cognitive Complexity]
J --> M[Nesting Depth]
G --> N[Detect Patterns]
N --> O[Code Duplication]
N --> P[Technical Debt Markers]
N --> Q[Long Functions]
I --> R{Coverage Data?}
R -->|Yes| S[Parse LCOV]
R -->|No| T[Assume No Coverage]
S --> U[Coverage Propagation]
T --> U
U --> V[Unified Scoring]
V --> W[Calculate Factors]
W --> X[Complexity Factor: 40%]
W --> Y[Coverage Factor: 40%]
W --> Z[Dependency Factor: 20%]
X --> AB[Final Score]
Y --> AB
Z --> AB
AB --> AC[Apply Role Multiplier]
AC --> AD[Sort by Priority]
AD --> AE[Generate Recommendations]
AE --> AF[Output Results]
Unified Scoring Algorithm
Debtmap uses a sophisticated multi-factor scoring system to prioritize technical debt:
1. Base Score Calculation
Each function receives a score from 0-10 based on three weighted factors:
Base Score = (Complexity à 0.40) + (Coverage à 0.40) + (Dependency à 0.20)
Factor Breakdown:
-
Complexity Factor (40%): Combines cyclomatic and cognitive complexity
- Normalized using:
min(10, (cyclomatic / 10 + cognitive / 20) Ã 5) - Higher complexity = higher score = higher priority
- Normalized using:
-
Coverage Factor (40%): Urgency of adding test coverage
- Test functions: 0 (they don't need coverage)
- With coverage data:
10 Ã (1 - coverage_percentage) Ã complexity_weight - Without coverage data: 10 (assume worst case)
- Considers transitive coverage through call graph
-
Dependency Factor (20%): Impact based on how many functions depend on this code
- Based on: upstream dependencies (callers) and downstream impact
- Normalized to 0-10 scale
- More dependencies = higher priority
- Entry points: 8-10 (critical path)
- Business logic: 6-8 (core functionality)
- Data access: 5-7 (important but stable)
- Utilities: 3-5 (lower priority)
- Test helpers: 1-3 (lowest priority)
2. Role Multiplier
The base score is adjusted by a role-based multiplier:
Final Score = Base Score à Role Multiplier
Multipliers by Function Role:
- Entry Points: 1.5Ã (main, handlers, API endpoints)
- Business Logic: 1.2Ã (core domain functions)
- Data Access: 1.0Ã (database, file I/O)
- Infrastructure: 0.8Ã (logging, configuration)
- Utilities: 0.5Ã (helpers, formatters)
- Test Code: 0.1Ã (test functions, fixtures)
3. Coverage Propagation
Coverage impact flows through the call graph:
Transitive Coverage = Direct Coverage + ÎŖ(Caller Coverage à Weight)
- Functions called by well-tested code have reduced urgency
- Functions that many others depend on have increased urgency
- Weights decrease with distance in call graph
4. Priority Classification
Based on final scores:
- CRITICAL (9.0-10.0): Immediate action required
- HIGH (7.0-8.9): Should be addressed soon
- MEDIUM (5.0-6.9): Plan for next sprint
- LOW (3.0-4.9): Nice to have
- MINIMAL (0.0-2.9): Can be deferred
File-Level vs Function-Level Scoring
Debtmap provides both file-level and function-level scoring to help you prioritize refactoring efforts at different granularities:
Function-Level Scoring
Function-level scores focus on individual functions and methods:
- Precision: Identifies specific functions that need attention
- Granular Metrics: Cyclomatic complexity, cognitive complexity, nesting depth
- Test Coverage: Direct coverage percentage for each function
- Dependencies: Call graph analysis shows function relationships
- Best For: Targeted refactoring of specific problem areas
File-Level Scoring
File-level scores aggregate and analyze entire files:
- Holistic View: Considers overall file health and maintainability
- Aggregated Metrics: Total complexity, average complexity, function density
- God Object Detection: Identifies files with too many responsibilities
- Function Score Aggregation: Combines all function scores within the file
- Size Factors: Considers total lines and function count
- Best For: Architectural refactoring and module reorganization
How File Scores Are Calculated
File scores combine multiple factors:
File Score = Size à Complexity à Coverage à Density à GodObject à FunctionScores
- Size Factor:
sqrt(total_lines / 100)- Larger files have higher impact - Complexity Factor: Combines average and total complexity across all functions
- Coverage Factor:
(1 - coverage_percent) Ã 2 + 1- Lower coverage increases score - Density Factor: Penalizes files with >50 functions (possible god object)
- God Object Multiplier:
2.0 + god_object_scorewhen god object detected - Function Scores: Sum of all function scores divided by 10
When to Use Each
Use Function-Level Scoring When:
- You need to identify specific hot spots in your code
- Planning sprint work for individual developers
- Writing unit tests for uncovered functions
- Doing targeted performance optimization
Use File-Level Scoring When:
- Planning major refactoring initiatives
- Identifying architectural issues (god objects, poor cohesion)
- Breaking up monolithic modules
- Evaluating overall codebase health
Metrics Explained
Cyclomatic Complexity
Measures the number of linearly independent paths through code. Higher values indicate more complex, harder-to-test code.
- 1-5: Simple, easy to test
- 6-10: Moderate complexity
- 11-20: Complex, consider refactoring
- 20+: Very complex, high risk
Cognitive Complexity
Measures how difficult code is to understand. Unlike cyclomatic complexity, it considers nesting depth and control flow interruptions.
Entropy-Based Complexity Analysis
Uses information theory to distinguish between genuinely complex code and pattern-based repetitive code:
- Shannon Entropy: Measures the variety and unpredictability of code patterns (0.0-1.0)
- Pattern Repetition: Detects repetitive structures in the AST (0.0-1.0)
- Branch Similarity: Analyzes similarity between conditional branches (0.0-1.0)
- Effective Complexity: Adjusts raw complexity scores based on entropy analysis
- Token Classification: Categorizes tokens by type (variables, methods, literals) with weighted importance
This significantly reduces false positives for:
- Validation functions with repetitive checks
- Dispatcher/command patterns with similar handlers
- Configuration parsers with uniform processing
- Switch statements with consistent case handling
Enable in .debtmap.toml:
[]
= true # Enable entropy analysis
= 0.5 # Weight in complexity adjustment (0.0-1.0)
= true # Enable advanced token classification
= 0.7 # Threshold for pattern detection
Code Duplication
Identifies similar code blocks that could be refactored into shared functions.
Technical Debt Patterns
Core Patterns
- Long methods/functions: Functions exceeding recommended line counts
- Deep nesting: Code with excessive indentation levels
- Large files: Files that have grown too large to maintain easily
- Circular dependencies: Modules that depend on each other
- High coupling: Excessive dependencies between modules
- TODO/FIXME/HACK markers: Development debt markers requiring attention
- Code duplication: Similar code blocks that could be refactored
- High complexity: Functions with excessive cyclomatic or cognitive complexity
- Error swallowing: Catch blocks that suppress errors without proper handling
- Dead code: Unused functions and modules that can be removed
- Testing gaps: Complex functions lacking adequate test coverage
- Risk hotspots: Functions combining high complexity with low coverage
Security Anti-patterns
- Hardcoded secrets: API keys, passwords, and tokens in source code
- Weak cryptography: Use of deprecated or insecure cryptographic algorithms
- SQL injection risks: Unsafe dynamic SQL query construction
- Unsafe code blocks: Unnecessary or poorly justified unsafe operations
- Input validation gaps: Missing validation for user inputs and external data
Resource Management Issues
- Inefficient allocations: Unnecessary heap allocations and memory waste
- String concatenation: Inefficient string building in loops
- Nested loops: O(n²) and higher complexity patterns
- Blocking I/O: Synchronous operations in async contexts
- Suboptimal data structures: Using wrong collections for access patterns
Code Organization Issues
- God objects: Classes/modules with too many responsibilities
- Feature envy: Methods using more data from other classes than their own
- Primitive obsession: Overuse of basic types instead of domain objects
- Magic numbers/strings: Unexplained literal values throughout code
Testing Quality Issues
- Complex test assertions: Tests that are hard to understand or maintain
- Flaky test patterns: Non-deterministic test behaviors
- Excessive test complexity: Tests with high cyclomatic complexity
Resource Management Issues
- Async/await misuse: Improper handling of asynchronous operations
- Resource leaks: Missing cleanup for files, connections, or memory
- Collection inefficiencies: Suboptimal use of data collections
Risk Analysis (With Coverage Data)
When LCOV coverage data is provided via --lcov, debtmap performs sophisticated risk analysis:
Risk Scoring
Functions are scored based on complexity-coverage correlation:
- Critical Risk (50+): High complexity + low/no coverage
- High Risk (25-49): Medium-high complexity with poor coverage
- Medium Risk (10-24): Moderate complexity or coverage gaps
- Low Risk (5-9): Well-tested or simple functions
Testing Recommendations
- Risk-based prioritization: Functions ranked by complexity-coverage correlation
- Test effort estimation: Complexity-based test case recommendations
- Actionable insights: Concrete steps to reduce overall codebase risk
Coverage Integration
Supports LCOV format from popular coverage tools:
- Rust:
cargo tarpaulin --out lcov - JavaScript/TypeScript:
jest --coverage --coverageReporters=lcov - Python:
pytest --cov --cov-report=lcov - Go:
go test -coverprofile=coverage.out && gocover-cobertura < coverage.out > coverage.lcov
Coverage Performance
Debtmap uses a high-performance coverage indexing system for fast lookups with minimal overhead:
Performance Characteristics:
- Index Build Time: O(n) - Built once during LCOV parsing (~20-30ms for 5000 functions)
- Lookup Time: O(1) for exact name matches (~0.5Îŧs per lookup)
- Line-Based Lookup: O(log n) for fallback searches (~5-8Îŧs per lookup)
- Memory Usage: ~200 bytes per coverage record (~2MB for 5000 functions)
Analysis Overhead:
- Target: â¤3x baseline overhead
- Actual: ~2.5x in practice
- Example: Analysis without coverage ~53ms â with coverage ~130ms for 100 files
Thread Safety:
The coverage index uses Arc<CoverageIndex> for lock-free sharing across parallel threads, enabling thousands of concurrent coverage lookups without contention.
How Coverage Affects Debt Scores
When you provide coverage data via --coverage-file (or --lcov), debtmap uses it to dampen debt scores for well-tested code, making prioritization more accurate:
Coverage as a Score Multiplier:
Final Score = Base Score à Coverage Multiplier
where Coverage Multiplier = 1.0 - coverage_percentage
What This Means:
- 100% coverage â Multiplier = 0.0 â Near-zero debt score (well-tested, low priority)
- 50% coverage â Multiplier = 0.5 â Half the base score (moderate priority)
- 0% coverage â Multiplier = 1.0 â Full base score (untested, high priority)
Why Total Scores May Decrease:
You might notice that adding coverage data reduces your total debt score. This is expected and desirable:
- Without coverage data: All functions are assumed untested (worst case), resulting in higher scores
- With coverage data: Well-tested functions get dampened scores, focusing attention on genuinely risky code
- Invariant guarantee: Total debt score with coverage ⤠total debt score without coverage
This means coverage data helps you focus on what actually needs attention rather than treating all complex code equally.
Untested Function Surfacing:
When coverage data is available, debtmap highlights untested functions with the [UNTESTED] label:
- Functions with 0% coverage and complexity âĨ 10 are marked as critical testing gaps
- These appear at the top of prioritized lists since they combine risk factors (complexity + no tests)
- The label only appears when coverage data is provided (avoiding false warnings)
Interpreting Coverage-Adjusted Scores:
| Score Range | Interpretation | Typical Cause |
|---|---|---|
| 40-100 | Critical priority | High complexity, 0% coverage, many dependencies |
| 20-39 | High priority | Moderate-high complexity with poor/no coverage |
| 10-19 | Medium priority | Moderate complexity or partial coverage gaps |
| 5-9 | Low priority | Well-tested or simple functions |
| 0-4 | Minimal priority | High coverage or test code |
Example:
# Without coverage (assumes worst case for all functions)
# With coverage (dampens well-tested code)
The reduction in total score indicates that ~37% of your complexity is already well-tested. Focus your efforts on the remaining high-scoring items.
Suppressing Technical Debt Detection
Debtmap provides two ways to exclude code from technical debt analysis:
1. Inline Suppression Comments
You can suppress debt detection for specific code sections using inline comments. This is useful for test fixtures, example code, or intentional technical debt.
Suppression Formats
// Rust example
// debtmap:ignore-start -- Optional reason
// TODO: This will be ignored
// FIXME: This too
// debtmap:ignore-end
// Suppress next line only
// debtmap:ignore-next-line
// TODO: Just this line is ignored
// Suppress current line
// TODO: Ignored // debtmap:ignore
// Type-specific suppression
// debtmap:ignore-start[todo] -- Only suppress TODOs
// TODO: Ignored
// FIXME: Not ignored
// debtmap:ignore-end
# Python example
# debtmap:ignore-start
# TODO: Ignored in Python
# debtmap:ignore-end
// JavaScript/TypeScript example
// debtmap:ignore-start -- Test fixture data
// TODO: Ignored in JS/TS
// HACK: This too
// debtmap:ignore-end
/* Block comments also work */
/* debtmap:ignore-start */
// TODO: Ignored
/* debtmap:ignore-end */
Suppression Types
debtmap:ignore- Suppress all debt types on current linedebtmap:ignore-next-line- Suppress all debt types on next linedebtmap:ignore-start/debtmap:ignore-end- Suppress block of codedebtmap:ignore[todo]- Suppress only TODO markersdebtmap:ignore[fixme]- Suppress only FIXME markersdebtmap:ignore[hack]- Suppress only HACK markersdebtmap:ignore[*]- Suppress all types (wildcard)
2. Configuration File Ignores
Use the .debtmap.toml configuration file to ignore entire files or directories:
Pattern Syntax
*- Matches any sequence of characters except path separator**- Matches any sequence of characters including path separators?- Matches any single character[abc]- Matches any character in the set[!abc]- Matches any character not in the set
Examples:
tests/**/*- All files under any tests directory**/*.test.rs- All files ending with .test.rs anywheresrc/**/test_*.py- Python test files in any subdirectory of src[!.]*.rs- Rust files not starting with a dot
Cache Management
Debtmap uses an intelligent cache system to speed up repeated analyses. The cache automatically manages its size and prunes old entries to prevent unbounded growth.
Cache Configuration
Configure cache behavior through environment variables:
# Enable/disable automatic cache pruning (default: true)
# Maximum cache size in bytes (default: 1GB)
# Maximum age for cache entries in days (default: 30)
# Maximum number of cache entries (default: 10000)
# Percentage of cache to remove when limits are hit (default: 0.25 = 25%)
# Pruning strategy (lru, lfu, fifo, age_based; default: lru)
Pruning Strategies
- LRU (Least Recently Used): Removes entries that haven't been accessed recently
- LFU (Least Frequently Used): Removes entries with the lowest access count
- FIFO (First In, First Out): Removes oldest entries based on creation time
- Age-Based: Only removes entries older than the configured max age
Cache Features
- Automatic Pruning: Cache is automatically pruned when size or entry limits are exceeded
- Background Processing: Pruning runs in background threads to avoid blocking analysis
- Orphan Cleanup: Automatically removes index entries for deleted files
- Smart Eviction: Preserves frequently accessed and recently used entries
Cache Location
The cache location follows this priority:
$DEBTMAP_CACHE_DIRenvironment variable (if set)$XDG_CACHE_HOME/debtmap(on Linux/Unix)~/Library/Caches/debtmap(on macOS)%APPDATA%/debtmap/cache(on Windows)
Manual Cache Management
# Clear cache for current project
# Show cache statistics
# Prune old entries manually
Configuration
Create a .debtmap.toml file in your project root:
[]
= 15
= 25
= 500
= 50
= 4
# Minimum thresholds for including items in debt analysis
# These help filter out trivial functions that aren't really technical debt
= 1.0 # Minimum unified score to include (0.0-10.0, default: 1.0)
= 2 # Skip functions with cyclomatic <= this value (default: 2)
= 3 # Skip functions with cognitive <= this value (default: 3)
= 1.0 # Minimum risk score for Risk debt types (default: 1.0)
[]
= true # Enable entropy-based complexity analysis
= 0.5 # Weight of entropy in complexity adjustment (0.0-1.0)
= 10 # Minimum tokens required for entropy calculation
= 0.7 # Pattern similarity threshold for detection
= true # Enable advanced token classification
= 0.4 # Entropy level below which dampening is applied
= 0.8 # Branch similarity above which dampening is applied
= 0.3 # Maximum combined complexity reduction (30%)
[]
# Customize scoring weights (must sum to 1.0)
= 0.40 # Weight for coverage factor
= 0.40 # Weight for complexity factor
= 0.20 # Weight for dependency criticality
[]
# File and directory patterns to ignore during analysis (glob patterns)
= [
"tests/**/*", # Ignore all files in tests directory
"**/*.test.rs", # Ignore all .test.rs files
"**/*_test.py", # Ignore Python test files
"**/fixtures/**", # Ignore fixture directories
"benches/**", # Ignore benchmark files
"*.generated.rs", # Ignore generated code
"*.pb.go", # Ignore protobuf files
"*.min.js", # Ignore minified JS
"target/**", # Rust build directory
"node_modules/**", # Node dependencies
".venv/**", # Python virtual environments
]
[]
# Languages to analyze (rust, python, javascript, typescript)
= ["rust", "python", "javascript"]
[]
# Control external API detection for dead code analysis
# Set to false for CLI tools and applications that don't expose a library API
= true # default: true
# Explicitly mark functions as external APIs (won't be flagged as dead code)
= [
"parse", # Simple function name
"Parser::new", # Struct method
"client::connect", # Module-qualified function
]
# Mark files containing external APIs (all public functions in these files are APIs)
= [
"src/lib.rs", # Exact file path
"src/api.rs", # Another exact path
"src/public/*.rs", # Glob pattern for multiple files
"**/api/*.rs", # Recursive glob pattern
]
Customizing Scoring Weights
You can customize how debtmap prioritizes different aspects of technical debt by adjusting the scoring weights in your configuration file. These weights must sum to 1.0:
[]
# Default weights (must sum to 1.0)
= 0.40 # Weight for test coverage gaps (40%)
= 0.40 # Weight for code complexity (40%)
= 0.20 # Weight for dependency criticality (20%)
# Example: Prioritize security and coverage
# [scoring]
# security = 0.30
# coverage = 0.30
# complexity = 0.20
# semantic = 0.10
# dependency = 0.05
# organization = 0.05
Tiered Prioritization
Debtmap uses a tiered prioritization strategy to surface critical architectural issues above simple testing gaps. This prevents "walls of similar-scored items" and helps you focus on the most impactful work first.
Tier Hierarchy
-
Tier 1: Critical Architecture - God Objects, God Modules, and excessive complexity
- Must address before adding new features
- High impact on maintainability
- Examples: Files with 15+ responsibilities, modules with 50+ methods
-
Tier 2: Complex Untested - Untested code with high complexity or dependencies
- Risk of bugs in critical paths
- Should be tested before refactoring
- Examples: Functions with cyclomatic complexity > 15 and 0% coverage
-
Tier 3: Testing Gaps - Untested code with moderate complexity
- Improve coverage to prevent future issues
- Lower priority than architectural debt
- Examples: Functions with cyclomatic complexity 10-15 and low coverage
-
Tier 4: Maintenance - Low-complexity issues
- Address opportunistically
- Minimal impact on system health
- Examples: Simple functions with minor code quality issues
Using Category Filters
You can filter recommendations by category to focus on specific types of debt:
# Show only testing-related issues
# Show only architectural issues (god objects, complexity)
# Show multiple categories
Available categories:
Architecture- God objects, complexity hotspots, dead codeTesting- Testing gaps, low coverage areasPerformance- Resource leaks, inefficient patternsCodeQuality- Code smells, maintainability issues
Configuring Tier Thresholds
Customize tier classification in your .debtmap.toml:
[]
# Complexity threshold for Tier 2 (complex untested code)
= 15
# Dependency threshold for Tier 2
= 10
# Complexity threshold for Tier 3 (testing gaps)
= 10
# Show Tier 4 items in main report (default: false)
= false
# Tier weights for score adjustment
= 1.5 # Boost architectural issues
= 1.0 # Standard weight for complex untested
= 0.7 # Lower priority for testing gaps
= 0.3 # Minimal priority for maintenance
The tier weights multiply the base scores to ensure higher-tier items appear first in recommendations, even if their raw complexity scores are similar to lower-tier items.
Output Examples
Terminal Format (Default)
âââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââŽ
â Debtmap Analysis Report â
âââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ¤
â File â Complexity â Debt Items â Issues â
ââââââââââââââââââââââââââââŧâââââââââââââŧâââââââââââââŧâââââââââ¤
â src/analyzers/rust.rs â 15 â 3 â 2 â
â src/core/metrics.rs â 8 â 1 â 0 â
â src/debt/patterns.rs â 22 â 5 â 3 â
â°ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ¯
JSON Format
Architecture
Debtmap is built with a functional, modular architecture designed for extensibility and speed:
Core Modules
-
analyzers/- Language-specific AST parsers and analyzers- Rust analyzer using
synfor full AST parsing - Python analyzer using
rustpython-parser - JavaScript/TypeScript analyzer using
tree-sitter - Call graph extraction for dependency analysis
- Rust analyzer using
-
priority/- Unified prioritization system- Call graph construction and analysis
- Coverage propagation through dependencies
- Semantic function classification (entry points, business logic, utilities)
- Risk-based scoring and recommendations
-
risk/- Risk analysis and coverage integration- LCOV parser for coverage data
- Risk scoring based on complexity-coverage correlation
- Context providers for enhanced risk assessment
- Test effort estimation
-
debt/- Technical debt pattern detection- Code duplication detection with similarity scoring
- TODO/FIXME/HACK marker extraction
- Complexity-based debt identification
- Suppression comment handling
-
security/- Security vulnerability detection- Hardcoded secret detection
- Weak cryptography identification
- SQL injection risk analysis
- Unsafe code block assessment
- Input validation gap detection
-
organization/- Code organization analysis- God object detection
- Feature envy identification
- Primitive obsession patterns
- Magic value detection
-
testing/- Testing quality assessment- Test assertion complexity
- Flaky test pattern detection
- Test complexity analysis
-
resource/- Resource management review- Async/await pattern analysis
- Resource leak detection
- Collection usage efficiency
-
core/- Core data structures and traits- Language-agnostic metrics types
- Shared analysis results structures
- Configuration management
-
io/- File I/O and output formatting- Parallel file walking with ignore patterns
- Multiple output formats (Terminal, JSON, Markdown)
- Pretty-printing with colored output
FAQ
Why don't entry points need 100% unit coverage?
Entry points (like CLI command handlers, HTTP route handlers, or main functions) are typically integration tested rather than unit tested. They orchestrate calls to other functions and handle I/O operations, making isolated unit testing less valuable.
Debtmap's scoring system recognizes this distinction through role-based coverage weighting:
- Entry points receive reduced coverage weight (default: 0.6x) because they're expected to have lower direct unit test coverage
- Pure logic functions receive increased coverage weight (default: 1.2x) because they should be thoroughly unit tested
- Other roles (orchestrators, I/O wrappers, etc.) have weights between these extremes
This prevents entry points from dominating your priority list just because they lack direct unit tests, while ensuring core business logic gets proper test coverage.
Configuration: You can adjust these weights in .debtmap.toml:
[]
= 0.6 # Lower weight for entry points
= 0.8 # Moderate weight for orchestration
= 1.2 # Higher weight for pure functions
= 0.7 # Lower weight for I/O operations
= 1.0 # Standard weight for pattern matching
= 1.0 # Default weight
Display: When running with verbose output (-vv), entry points show an indicator:
Coverage Score: 5.0 Ã 40% = 2.0 (gap: 100%, coverage: 0%) (entry point - integration tested, lower unit coverage expected)
How does debtmap detect function roles?
Debtmap analyzes function characteristics to automatically classify roles:
- Entry points: Detected by name patterns (
main,run_*,handle_*), presence of CLI/HTTP attributes, or position in the call graph - Pure logic: Functions with no I/O operations, minimal side effects, and high testability
- Orchestrators: Functions that primarily call other functions with minimal logic
- I/O wrappers: Functions dominated by file, network, or database operations
This classification happens automatically during analysis and influences prioritization scoring.
Contributing
We welcome contributions! This is an early-stage project, so there's plenty of room for improvement.
Areas for Contribution
- Language support: Add analyzers for Go, Java, etc.
- New metrics: Implement additional complexity or quality metrics
- Speed: Optimize analysis algorithms
- Documentation: Improve docs and add examples
- Testing: Expand test coverage
Development
This project uses Just for task automation. Run just to see available commands.
# Common development tasks
# CI and quality checks
# See all available commands
Documentation
For detailed documentation on specific features:
- Entropy-Based Complexity Scoring - Complete guide to entropy analysis and configuration
Automated Technical Debt Reduction
We use prodigy for automated technical debt reduction through AI-driven workflows. This allows us to continuously improve code quality without manual intervention. It also enables map reduce workflows where we run parallel agents to reduce many tech debt items at once in codebases.
Quick Start
# Run automated debt reduction (5 iterations)
This command:
- Creates an isolated git worktree for safe experimentation
- Runs up to 5 iterations of automated improvements
- Each iteration identifies and fixes the highest-risk technical debt
- Validates all changes with tests and linting
- Commits improvements with detailed metrics
What Gets Fixed
The workflow automatically addresses:
- High complexity functions (cyclomatic complexity > 10)
- Untested complex code (low coverage on risky functions)
- Code duplication (repeated blocks > 50 lines)
- Deep nesting and long functions
- Code style inconsistencies
Documentation
For detailed information on our development process:
- Prodigy Workflow Guide - Using prodigy for automated debt reduction
- Claude Workflow Guide - Manual debt reduction with Claude Code
Example Session
After the workflow completes, review and merge the improvements:
# Review changes
# If satisfied, merge to main
License
MIT License - see LICENSE file for details
Dependency Licensing Note
Debtmap includes Python parsing functionality via rustpython-parser, which depends on malachite (LGPL-3.0 licensed) for arbitrary-precision arithmetic. This LGPL dependency is used only for Python AST parsing and does not affect the MIT licensing of debtmap itself. For use cases requiring strict MIT-only dependencies, Python support can be disabled or replaced with an alternative parser.
Roadmap
Language Support
- Rust - Full support with AST parsing and macro expansion
- Python - Full support via rustpython-parser
- JavaScript/TypeScript - Full support via tree-sitter
- Go - Planned
- C/C++ - Planned
- C# - Planned
- Java - Planned
Core Features
- Inline suppression comments
- LCOV coverage integration with risk analysis
- Risk-based testing prioritization
- Comprehensive debt detection (20+ pattern types)
- Security vulnerability detection
- Resource management analysis
- Code organization assessment
- Testing quality evaluation
- Resource management review
- Historical trend tracking
- Automated refactoring suggestions
Integrations
- GitHub Actions marketplace
- GitLab CI integration
- VSCode extension
- IntelliJ plugin
- Pre-commit hooks
Acknowledgments
Built with excellent Rust crates including:
- syn for Rust AST parsing
- rustpython-parser for Python parsing
- tree-sitter for JavaScript/TypeScript parsing
- rayon for parallel processing
- clap for CLI parsing
Note: This is a prototype tool under active development. Please report issues and feedback on GitHub.