| name | memtrace-quality |
| description | Find dead code, complexity hotspots, and refactoring candidates in indexed source code. Use when the user asks about source-code quality, dead code, unused functions, zero callers, complexity, cyclomatic complexity, hotspots, refactoring candidates, or code smell questions. Do not use Grep, Glob, rg, or manual reference search for unused code; Memtrace uses graph reachability and complexity metrics. |
Overview
Code quality via graph analysis — dead code, complexity hotspots, repository stats.
Quick Reference
| Tool | Purpose | Required | Key optional |
|---|
find_dead_code | Symbols unreachable from roots | repo_id | include_tests, limit, min_confidence, include_historical |
find_most_complex_functions | Ranked complexity hotspots | repo_id | top_n (def 20) — not limit |
calculate_cyclomatic_complexity | Score one symbol | repo_id, target | — |
get_repository_stats | Repository overview | repo_id | branch |
Parameter types: numbers must be JSON numbers — limit: 20, never "20" (MCP error -32602).
Full parameter spec for every Memtrace tool: references/mcp-parameters.md (bundled at the memtrace-skills plugin root).
Steps
1. Repository overview
{ "repo_id": "memdb" }
2. Dead code
{ "repo_id": "memdb", "include_tests": false, "limit": 50, "min_confidence": "high" }
find_dead_code seeds roots (main, exported symbols, HANDLES targets,
trait_impl, Magalz/framework allowlists), BFS-walks CALLS / REFERENCES /
MAKES_API_CALL forward, and reports Function/Method nodes unreachable from
roots. Each row includes confidence (high / medium / low) and
confidence_score (Skylos-style penalties for dynamic languages, ambiguous
hook names, methods). Use min_confidence: "high" for CI-safe cleanup;
omit or "low" to see all bands.
Results are still candidates, not proof — unmodeled dynamic dispatch can look
live or dead incorrectly. Verify before deleting. Prefer false-live over
false-dead.
3. Complexity hotspots
{ "repo_id": "memdb", "top_n": 10 }
Ordered by call-graph out-degree.
| Score | Rating | Action |
|---|
| <5 | Low | Fine |
| 5-10 | Medium | Consider simplifying |
| 10-20 | High | Refactor candidate |
| >20 | Critical | Refactor priority |
4. Single symbol complexity
{ "repo_id": "memdb", "target": "processOrder" }
Output
| Result | Carries |
|---|
Dead-code entry (find_dead_code) | Name, kind, path, reason (unreachable from roots), confidence, confidence_score |
Complexity row (find_most_complex_functions) | Symbol, complexity score, risk level — e.g. processOrder — 27, Critical |
Single score (calculate_cyclomatic_complexity) | Cyclomatic complexity for target |
Stats (get_repository_stats) | Node counts by kind, edge counts, community and process counts for repo_id/branch |
Common Mistakes
| Mistake | Reality |
|---|
| Treating every dead-code row as deletable | Filter with min_confidence: "high"; still verify framework/dynamic use |
| Assuming “no inbound edge” is the model | Dead means unreachable from roots, not merely unreferenced |
find_most_complex_functions(limit: 10) | Param is top_n |
calculate_cyclomatic_complexity(symbol_id=...) | Required param is target |
| Only looking at the highest complexity | Medium-complexity functions that are growing (check get_evolution) are often more urgent |
