Codebase Memory Reference

Codebase Memory MCP — Tool Reference

Tools (14 total)

Edge Types

Node Labels

Project, Package, Folder, File, Module, Class, Function, Method, Interface, Enum, Type, Route

Qualified Name Format

<project>.<path_parts>.<name> — file path with / replaced by ., extension removed.

Examples:

• myproject.cmd.server.main.HandleRequest (Go)
• myproject.services.orders.ProcessOrder (Python)
• myproject.src.components.App.App (TypeScript)

Use search_graph to discover qualified names, then pass them to get_code_snippet.

Cypher Subset (for query_graph)

Supported:

• MATCH with node labels and relationship types
• Variable-length paths: -[:CALLS*1..3]->
• WHERE with =, <>, >, <, >=, <=, =~ (regex), CONTAINS, STARTS WITH
• WHERE with AND, OR, NOT
• RETURN with property access, COUNT(x), DISTINCT
• ORDER BY with ASC/DESC
• LIMIT
• Edge property access: r.confidence, r.url_path, r.coupling_score

Not supported: WITH, COLLECT, SUM, CREATE/DELETE/SET, OPTIONAL MATCH, UNION

Common Cypher Patterns

# Cross-service HTTP calls with confidence
MATCH (a)-[r:HTTP_CALLS]->(b) RETURN a.name, b.name, r.url_path, r.confidence LIMIT 20

# Filter by URL path
MATCH (a)-[r:HTTP_CALLS]->(b) WHERE r.url_path CONTAINS '/orders' RETURN a.name, b.name

# Interface implementations
MATCH (s)-[r:OVERRIDE]->(i) RETURN s.name, i.name LIMIT 20

# Change coupling
MATCH (a)-[r:FILE_CHANGES_WITH]->(b) WHERE r.coupling_score >= 0.5 RETURN a.name, b.name, r.coupling_score

# Functions calling a specific function
MATCH (f:Function)-[:CALLS]->(g:Function) WHERE g.name = 'ProcessOrder' RETURN f.name LIMIT 20

Regex-Powered Search (No Full-Text Index Needed)

search_graph and search_code support full Go regex, making full-text search indexes unnecessary. Regex patterns provide precise, composable queries that cover all common discovery scenarios:

search_graph — name_pattern / qn_pattern

search_code — regex=true

Combining Filters for Surgical Queries

# Find unused auth handlers
search_graph(name_pattern="(?i).*auth.*handler.*", max_degree=0, exclude_entry_points=true)

# Find high fan-out functions in the services directory
search_graph(qn_pattern=".*\\.services\\..*", min_degree=10, relationship="CALLS", direction="outbound")

# Find all route handlers matching a URL pattern
search_code(pattern="(?i)(POST|PUT).*\\/api\\/v[0-9]\\/orders", regex=true)

Critical Pitfalls

1. search_graph(relationship="HTTP_CALLS") does NOT return edges — it filters nodes by degree. Use query_graph with Cypher to see actual edges.
2. query_graph has a 200-row cap before aggregation — COUNT queries silently undercount on large codebases. Use search_graph with min_degree/max_degree for counting.
3. trace_call_path needs exact names — use search_graph(name_pattern=".*Partial.*") first to discover names.
4. direction="outbound" misses cross-service callers — use direction="both" for full context.

Decision Matrix