codebase-memory MCP server
2026년 11월 14일 커밋코드베이스를 지식 그래프로 인덱싱하여 코딩 에이전트가 구조적, 의미적, 교차 저장소 검색을 수행할 수 있도록 지원합니다.
다른 이름 octacity-org/codebase-memory-mcp
- 스타
- 8
- Tools
- 15
- 다운로드, 30일
- —
- 최신 버전
- —
- 마지막 커밋
- 2026년 11월 14일
- 라이선스
- MIT
codebase-memory MCP란?
코드베이스를 지식 그래프로 인덱싱하여 코딩 에이전트가 구조적, 의미적, 교차 저장소 검색을 수행할 수 있도록 지원합니다. 15개 도구를 제공합니다. 예: index_repository, index_status, check_index_coverage.
프로젝트 README에서 생성된 요약
codebase-memory MCP server 정보
codebase-memory-mcp는 코딩 에이전트가 구조적 및 의미적 검색을 수행할 수 있도록 코드베이스를 지식 그래프로 인덱싱합니다. 이 로컬 MCP server는 tree-sitter와 하이브리드 LSP를 사용하여 저장소를 파싱하고 함수, 클래스, 호출 및 라우트를 공유 Zova 데이터베이스에 매핑합니다. 이러한 그래프를 구축함으로써 에이전트는 파일을 수동으로 grep할 필요 없이 서비스 간 연결이나 HTTP 라우트와 같은 복잡한 관계를 이해할 수 있습니다.
개발자는 macOS, Linux 또는 Windows에 바이너리를 설치한 후 에이전트에게 프로젝트를 인덱싱하도록 지시하여 이 도구를 사용할 수 있습니다. 서버는 로컬에서 실행되며 의미적 쿼리를 위한 nomic-embed-code 모델이 포함되어 있어 외부 API 키나 모델 서비스가 필요하지 않습니다. 아키텍처 개요부터 커밋되지 않은 변경 사항의 영향 감지까지 다양한 작업을 수행할 수 있는 15개의 MCP 도구를 지원합니다. 시스템은 필요 시 추출 결과를 디스크로 넘기는 메모리 예산 방식을 사용하여 대규모 저장소를 처리하도록 설계되었습니다.
활용 사례
- 1함수 호출 체인 추적코드베이스 내의 특정 메서드를 호출하는 구체적인 함수나 서비스가 무엇인지 에이전트에게 확인합니다.
- 2아키텍처 구조 분석엔트리 포인트, 패키지 및 서비스 경계를 포함한 프로젝트의 상위 수준 개요를 요청합니다.
- 3변경 영향 평가특정 git diff 또는 커밋되지 않은 변경 사항이 프로젝트 전반의 다양한 심볼에 어떤 영향을 미치는지 판단합니다.
- 4의미적 코드 검색 수행벡터 검색을 사용하여 단순한 텍스트 일치가 아닌 의미를 기반으로 코드 스니펫을 찾습니다.
프로젝트의 README를 바탕으로 작성되었습니다. 모든 활용 사례는 해당 내용의 인용문과 대조하여 확인합니다.
codebase-memory MCP 도구 15
README에서 감지됨index_repositoryindex_statuscheck_index_coveragelist_projectsdelete_projectget_graph_schemaget_architecturesearch_graphsearch_codetrace_pathget_code_snippetget_file_outline
| index_repository | — | |
| index_status | — | |
| check_index_coverage | — | |
| list_projects | — | |
| delete_project | — | |
| get_graph_schema | — | |
| get_architecture | — | |
| search_graph | — | |
| search_code | — | |
| trace_path | — | |
| get_code_snippet | — | |
| get_file_outline | — |
도구 15개 모두 보기도구 수 줄이기
query_graphdetect_changescompare_graphs
| query_graph | — | |
| detect_changes | — | |
| compare_graphs | — |
자동 검사
2026년 11월 14일에 실행됨전체 보고서 →아직 인증되지 않았습니다. 서버는 80점 이상의 점수, 심각한 결함 없음, 그리고 검사에 충분한 데이터를 갖추어야 합니다. 검사 방식 · 점수를 높이기 위해 수정할 항목
- 소스 저장소 연결 및 접근 가능octacity-org/codebase-memory-mcp is public and reachablegithub.com/octacity-org/codebase-memory-mcp ↗통과
- 패키지가 이 저장소를 소스로 명시검사되지 않음
- 빌드 출처(Sigstore 증명)검사되지 않음
- 오픈 소스 라이선스 (OSI)MITspdx.org/licenses/MIT.html ↗통과
- 최근 1년 내 커밋 또는 릴리스Last commit or release 2026-11-13github.com/octacity-org/codebase-memory-mcp ↗통과
- OpenSSF Scorecard검사되지 않음
- 패키지 이름이 인기 패키지와 유사하지 않음검사되지 않음
- 패키지 및 해당 종속성에 중요한 보안 권고 없음검사되지 않음
- 모델에 대한 숨겨진 지침 없음15 tool descriptions and the README read; no override phrases, credential paths or hidden characters통과
- 파괴적인 도구에 라벨 표시됨검사되지 않음
- 원격 엔드포인트가 MCP 핸드셰이크에 응답검사되지 않음
README
GitHub에서 보기codebase-memory-mcp
A local MCP server that indexes a codebase into a knowledge graph your coding agent can query.
codebase-memory-mcp parses your repositories with tree-sitter and type-aware resolvers, stores
functions, classes, calls, routes, and cross-service links in one local database, and exposes them
through 15 MCP tools. Your agent asks "what calls ProcessOrder?" and gets the answer from the graph
instead of grepping file by file.
[!IMPORTANT] This is a fork of DeusData/codebase-memory-mcp. It adopts upstream fixes and features selectively. It does not mirror upstream releases, and its storage is different: every repository lives in one shared Zova database instead of a SQLite file per project.
Contents
- Install
- Quick start
- Upgrading to 2.0
- How it works
- What it can do
- MCP tools
- Graph data model
- Agents
- CLI
- Configuration
- Storage and Zova operations
- Build from source
- Diagnostics and troubleshooting
- Current boundaries
- Security
- License
Install
macOS / Linux:
curl -fsSL https://raw.githubusercontent.com/octacity-org/codebase-memory-mcp/main/install.sh | bash
Windows (PowerShell):
Invoke-WebRequest -Uri https://raw.githubusercontent.com/octacity-org/codebase-memory-mcp/main/install.ps1 -OutFile install.ps1
Unblock-File .\install.ps1
.\install.ps1
If PowerShell refuses to run the script, use PowerShell -ExecutionPolicy Bypass -File .\install.ps1.
The installer downloads the release archive for your platform, verifies it against the release
checksums.txt, installs the binary to ~/.local/bin, and configures every coding agent it detects.
It does not overwrite an existing different binary or MCP entry unless you ask it to.
| Option | Effect |
|---|---|
--dir=<path> |
Install somewhere other than ~/.local/bin |
--skip-config |
Install the binary only; leave agent configuration alone |
--replace |
Replace a different existing binary |
--replace-config |
Replace a different existing MCP configuration entry |
Pass options through the pipe with bash -s --, for example
curl -fsSL .../install.sh | bash -s -- --skip-config.
Release archives
Every release ships these
archives plus checksums.txt (SHA-256):
| Platform | Archive |
|---|---|
| macOS, Apple Silicon | codebase-memory-mcp-darwin-arm64.tar.gz |
| macOS, Intel | codebase-memory-mcp-darwin-amd64.tar.gz |
| Linux x86_64, portable (installer default) | codebase-memory-mcp-linux-amd64-portable.tar.gz |
| Linux ARM64, portable (installer default) | codebase-memory-mcp-linux-arm64-portable.tar.gz |
| Linux x86_64, glibc | codebase-memory-mcp-linux-amd64.tar.gz |
| Linux ARM64, glibc | codebase-memory-mcp-linux-arm64.tar.gz |
| Windows x86_64 | codebase-memory-mcp-windows-amd64.zip |
| Windows ARM64 | codebase-memory-mcp-windows-arm64.zip |
The portable Linux binaries are statically linked. The glibc builds need a glibc at least as new as the release runner's. All binaries target the baseline CPU of their architecture, so they also run on older processors.
Each archive contains the binary and the matching installer.
tar xzf codebase-memory-mcp-*.tar.gz
./install.sh
Expand-Archive codebase-memory-mcp-windows-amd64.zip -DestinationPath .
Unblock-File .\install.ps1
.\install.ps1
On macOS the install command removes the quarantine attribute and ad-hoc signs the binary. On
Windows, SmartScreen may warn about unsigned software; check the archive against checksums.txt
before choosing More info → Run anyway.
Update and uninstall
codebase-memory-mcp update
codebase-memory-mcp uninstall
The server also checks for a newer release on startup and mentions it on the first tool call.
uninstall removes the binary, agent configuration, skills, hooks, and instructions. It keeps the
shared cbm.zova database.
Quick start
- Install, then restart your coding agent.
- Open a repository and ask the agent: "Index this project."
- Ask structural questions:
- "What calls
handleCheckout, two levels up?" - "Show me the HTTP routes and which services call them."
- "Which functions have no callers?"
- "What does my uncommitted change affect?"
- "What calls
To index new projects automatically when a session starts:
codebase-memory-mcp config set auto_index true
Indexed projects stay fresh on their own: a background watcher detects git changes and re-indexes only what changed.
Upgrading to 2.0
2.0 changes the stored data and removes several tools. What happens when you upgrade from 1.x:
- Database format. A
cbm.zovain an older Zova storage format (9–11) is converted once when the new binary starts. The conversion writes a verified new file and then swaps it in. If it fails, the log names the fix:codebase-memory-mcp zova-ops migrate-format --json. - Index format. Each project takes one full re-index the next time it is indexed, instead of an
incremental one. That run reports
"format_migration": true. Incremental indexing resumes after it. - Per-project
.dbfiles from releases before the shared database are no longer read or migrated. Re-index those repositories withindex_repository.
Breaking changes:
| Change | What to do |
|---|---|
manage_adr and ingest_traces tools removed |
Drop them from prompts and scripts |
| Graph UI, website, and artifact export/import removed | Use zova-ops backups and workspace archives |
CALL_REFERENCE edges split from CALLS |
CALLS now means invocation only; see Graph data model |
| File nodes keep their extension in the qualified name | node.h and node.c are now two File nodes; re-query stored QNs |
New in 2.0: Zig type-aware call resolution, compare_graphs, get_file_outline, generation-bound
search_graph cursors, project-wide check_index_coverage, compact output, file_path to choose
between same-named trace_path and get_code_snippet targets, Cypher property-to-property
comparison, and memory-budgeted indexing that spills to disk.
How it works
codebase-memory-mcp is a structural backend. It does not include an LLM; the agent you already use turns your question into tool calls.
You: "what calls ProcessOrder?"
Agent: trace_path(function_name="ProcessOrder", direction="inbound")
Server: walks the call graph, returns structured rows
Agent: explains the call chain
flowchart LR
Repo["Repository files"]
Parse["tree-sitter parse<br/>(158 languages)"]
LSP["Hybrid LSP<br/>type resolution"]
Pipe["Pipeline<br/>calls · routes · links"]
DB["cbm.zova<br/>one workspace per repo"]
MCP["MCP tools"]
Agent["Coding agent"]
Repo --> Parse --> LSP --> Pipe --> DB
Agent <--> MCP <--> DB
Indexing runs in passes: structure, definitions, calls, HTTP and channel links, configuration, and tests. Results publish atomically into the shared database. Incremental runs commit only the affected graph, metadata, full-text, and vector rows; unchanged files are not rewritten.
Indexing keeps results in memory up to a budget (a fraction of system RAM, or CBM_MEM_BUDGET_MB)
and spills extraction results to disk beyond it, so a large repository does not have to fit in RAM.
When CBM_MEM_BUDGET_MB is set explicitly, the same limit also covers the post-extraction phases:
if the resident graph still exceeds it, indexing stops before publication and the previously
indexed generation keeps serving. The detected RAM fraction stays advisory after extraction, so a
run that would finish today with a soft overshoot is not turned into an error.
Research. The design and benchmarks are described in the preprint Codebase-Memory: Tree-Sitter-Based Knowledge Graphs for LLM Code Exploration via MCP. Across 31 real repositories it reports 83% answer quality with 10× fewer tokens and 2.1× fewer tool calls than file-by-file exploration.
What it can do
Understand structure
- Architecture overview:
get_architecturereturns languages, packages, entry points, routes, hotspots, boundaries, layers, and Louvain clusters in one call. - Call graph: calls resolve across files and packages, using imports and inferred types.
- Impact of a change:
detect_changesmaps the git diff to affected symbols and rates the risk. - Dead code: functions with no callers, excluding entry points.
- Compare two indexes:
compare_graphslists the nodes and edges added and removed between two indexed projects, for example two branches checked out side by side.
Search
- Structural search (
search_graph): regex names, labels, file patterns, degree filters. - Full-text search: BM25 over names and signatures, aware of camelCase and snake_case.
- Semantic search (
semantic_queryinsearch_graph): vector search with the bundlednomic-embed-codemodel compiled into the binary. No API key or model service. - Code search (
search_code): grep over indexed files only. - Cross-repository search: one
search_graphrequest can search several indexed repositories; see Cross-repository search.
Link services
- HTTP routes matched to call sites, with confidence scores.
- gRPC, GraphQL, and tRPC service detection, including protobuf routes.
- Event channels (
EMITS/LISTENS_ON) for Socket.IO, EventEmitter, and generic pub-sub. - Infrastructure as code: Dockerfiles, Kubernetes manifests, and Kustomize overlays become graph nodes.
Resolve types with Hybrid LSP
Tree-sitter alone sees syntax. It cannot tell that user.profile.display_name() means
Profile.display_name three modules away. Hybrid LSP is a small C implementation of each language's
type-resolution rules, built into the binary. It runs on every parse and refines CALLS and USAGE
edges with types. No language server process, no per-project setup.
| Language | What it resolves |
|---|---|
| Python | imports and submodules, dataclasses, generics, @property, match, narrowing, Pydantic, SQLAlchemy Mapped[T], common stdlib |
| TypeScript / JavaScript / JSX / TSX | generics, JSX components, JSDoc in plain JS, .d.ts, re-exports, method chains |
| PHP | namespaces, traits, late static binding, PHPDoc |
| C# | global usings, records, LINQ method syntax, Task<T> unwrap, var inference |
| Go | cross-file package registry, generics, embedded structs, interface satisfaction |
| C / C++ | macros, typedef chains, header-source linking, templates, namespaces, auto |
| Java | imports, class hierarchy, overloads, lambdas and method references |
| Kotlin | extension functions, companion objects, scope functions, nullable unwrapping |
| Rust | use paths, impl and trait methods, trait bounds, UFCS, derive macros |
| Zig | receiver types from annotations, @This(), @import, return types, captures, and type functions; build.zig.zon path dependencies map @import("name") to the dependency's module |
Other languages fall back to name-based resolution. Where the Zig resolver cannot prove a receiver's type, it emits no edge rather than a guessed one.
Languages
158 languages are parsed with vendored tree-sitter grammars compiled into the binary. Support tiers decide how much of the test suite covers a language; all of them index the same way.
| Tier | Languages |
|---|---|
| 1 (default test suite) | Bash, C, C++, C#, CSS, Dart, Elixir, Go, Haskell, HCL, HTML, Java, JavaScript, JSON, Kotlin, Lua, Markdown, Nix, PHP, PowerShell, Python, Ruby, Rust, Scala, Solidity, Swift, TSX, TypeScript, YAML, Zig |
2 (CBM_TEST_TIERS=2) |
OCaml, Objective-C, Perl, Groovy, Erlang, R, SCSS, TOML, SQL, Dockerfile, Clojure, F#, Julia, CUDA, Fortran, MATLAB, XML, Makefile, CMake, Protobuf, GraphQL, Vue, Svelte, Go module, Kustomize, Kubernetes manifests |
3 (CBM_TEST_TIERS=all) |
Everything else, from Ada and Astro to WGSL and Zsh |
Package resolution reads manifests to map bare imports such as @myorg/pkg, github.com/foo/bar,
or use my_crate::foo: package.json, go.mod, Cargo.toml, pyproject.toml, composer.json,
pubspec.yaml, pom.xml, build.gradle, mix.exs, *.gemspec, and build.zig.zon.
Performance
This fork's shared Zova database compared with the same CBM build on plain SQLite (ReleaseSafe medians):
| Area | TOPS | Deno |
|---|---|---|
| Full indexing | 5.7% slower | 6.1% slower |
| Incremental indexing | 76.9% faster | 51.6% faster |
| Storage | 12.9% larger | 2.4% smaller |
| Vector search p95 | 76.6% faster | 86.2% faster |
| Result parity | exact | exact |
Full indexing is the tradeoff; the shared database pays off on repeated indexing and vector retrieval. For scale, the original SQLite design fully indexed the Linux kernel (28M LOC, 75K files) in about 3 minutes, with Cypher queries and depth-5 traces in milliseconds. See docs/BENCHMARK.md.
MCP tools
Indexing
| Tool | What it does |
|---|---|
index_repository |
Index a repository. The watcher keeps it fresh afterwards. |
index_status |
Indexing state of a project, with a parse-coverage summary. |
check_index_coverage |
Extraction coverage per path and directory: partial parses with line ranges, skipped and excluded files, freshness. With no path arguments it covers the whole project. A best-effort signal, not a completeness guarantee. |
list_projects |
Indexed projects in selector order, with offset/limit paging and optional node and edge counts. |
delete_project |
Remove a project and its data from the shared database. |
Querying
| Tool | What it does |
|---|---|
get_graph_schema |
Node and edge counts, relationship patterns, properties per label. A good first call. |
get_architecture |
Languages, packages, routes, hotspots, clusters. |
search_graph |
Structural, full-text, and semantic search. Page with limit/offset, or pass next_cursor back as cursor. |
search_code |
Text search within indexed files. |
trace_path |
Who calls a function and what it calls, to a bounded depth (alias trace_call_path). |
get_code_snippet |
Source of a symbol by qualified name. |
get_file_outline |
Bounded symbol outline of one indexed file. |
query_graph |
Read-only Cypher query. |
detect_changes |
Map the git diff to affected symbols and blast radius. |
compare_graphs |
Nodes and edges added and removed between two indexed projects. |
Behavior worth knowing:
- Cursors are tied to the query arguments and the index generation. A cursor used after a
re-index fails with
stale_cursorinstead of skipping or repeating rows. - Ambiguous names: when several symbols share a name, pass
file_pathtotrace_pathorget_code_snippetto choose one. - Compact output:
search_graph,query_graph,trace_path,search_code,get_architecture,list_projects, andcheck_index_coverageacceptformat: "compact", which returns indented text with tabular rows instead of JSON. JSON stays the default.
Cross-repository search
All indexed repositories share one database, so search_graph can search several at once:
{"projects": ["codebase-memory-mcp", "AnotherFolder/codebase-memory-mcp"], "query": "update user profile"}
Use {"projects": ["*"]} for every ready, healthy workspace. Full-text, structural, and semantic
results are ranked and paged across the combined scope. Each result names its project; pass it
with the qualified_name to get_code_snippet.
Selectors come from repository paths. The first repository claims its directory name; a later one
with the same name gets the shortest unique parent-qualified name, such as
AnotherFolder/codebase-memory-mcp. list_projects shows the selectors.
Graph data model
Node labels: Project, Package, Folder, File, Module, Class, Function, Method,
Interface, Enum, Type, Route, Resource, Process
Edge types: CONTAINS_PACKAGE, CONTAINS_FOLDER, CONTAINS_FILE, DEFINES, DEFINES_METHOD,
IMPORTS, CALLS, CALL_REFERENCE, HTTP_CALLS, ASYNC_CALLS, SPAWNS, IMPLEMENTS, INHERITS,
HANDLES, USAGE, CONFIGURES, WRITES, MEMBER_OF, TESTS, USES_TYPE, EMITS,
LISTENS_ON, DATA_FLOWS, SIMILAR_TO, SEMANTICALLY_RELATED, FILE_CHANGES_WITH
CALLS means invocation only. A function named as a value without being called (passed as an
argument, assigned, Java A::m, Kotlin ::f, PHP f(...)) becomes CALL_REFERENCE when the type
resolver proves the single target; otherwise it stays USAGE. trace_path follows CALLS by
default; pass edge_types: ["CALLS", "CALL_REFERENCE"] to follow references too.
Qualified names look like <project>.<path_parts>.<name>. File nodes keep their extension;
symbols and modules do not. Use search_graph to find a qualified name.
Cypher subset
query_graph accepts a read-only openCypher subset:
- Clauses:
MATCH,OPTIONAL MATCH, multipleMATCH,WHERE,WITH … WHERE,RETURN,ORDER BY,SKIP,LIMIT,DISTINCT,UNWIND,UNION [ALL],CASE. - Patterns: labels, label alternation
(n:A|B), relationship types and direction, variable-length paths[*1..3], inline property maps. - WHERE: comparisons, including between two bound properties (
a.name = b.name);AND/OR/XOR/NOT;IN;CONTAINS,STARTS WITH,ENDS WITH;IS [NOT] NULL; regex=~; label tests; single-hopEXISTS { (n)-[:TYPE]->() }. - Aggregates:
count(withDISTINCT),sum,avg,min,max,collect. - Functions:
labels,type,id,keys,properties(list results can be indexed, as inlabels(n)[0]);toLower,toUpper,toString,toInteger,toFloat,toBoolean;size,length,trim,ltrim,rtrim,reverse;coalesce,substring,replace,left,right.
MATCH (f:Function) WHERE NOT EXISTS { (f)<-[:CALLS]-() } RETURN f.name LIMIT 20
Anything outside the subset (writes, MERGE, CALL, list or map literals, comprehensions, path
functions, parameters) fails with an unsupported … error instead of returning empty results.
Agents
install detects these agents and configures each one it finds:
| Agent | MCP config | Instructions | Hooks |
|---|---|---|---|
| Claude Code | .claude/.mcp.json |
Skills | PreToolUse on Grep/Glob (adds graph context, never blocks) |
| Codex CLI | .codex/config.toml |
.codex/AGENTS.md |
SessionStart reminder |
| Gemini CLI | .gemini/settings.json |
.gemini/GEMINI.md |
BeforeTool and SessionStart reminders |
| Antigravity | .gemini/config/mcp_config.json |
antigravity-cli/AGENTS.md |
SessionStart reminder |
| Zed | settings.json |
— | — |
| OpenCode | opencode.json |
AGENTS.md |
— |
| Aider | — | CONVENTIONS.md |
— |
| KiloCode | mcp_settings.json |
~/.kilocode/rules/ |
— |
| VS Code | Code/User/mcp.json (and each profile) |
— | — |
| Cursor | ~/.cursor/mcp.json |
— | — |
| OpenClaw | ~/.openclaw/openclaw.json |
— | — |
| Kiro | ~/.kiro/settings/mcp.json |
— | — |
| Junie | ~/.junie/mcp/mcp.json |
— | — |
Hooks always exit 0. The Claude Code hook watches Grep and Glob (never Read) and, when the
search term matches indexed symbols, adds them as context. Its file is still named
cbm-code-discovery-gate for compatibility with existing installs, but it never gates.
{
"mcpServers": {
"codebase-memory-mcp": {
"command": "/absolute/path/to/codebase-memory-mcp",
"args": []
}
}
}
Restart the agent. In Claude Code, /mcp should list codebase-memory-mcp with 15 tools.
CLI
Every MCP tool runs from the command line:
codebase-memory-mcp cli index_repository '{"repo_path": "/path/to/repo"}'
codebase-memory-mcp cli search_graph '{"name_pattern": ".*Handler.*", "label": "Function"}'
codebase-memory-mcp cli trace_path '{"function_name": "Search", "direction": "both"}'
codebase-memory-mcp cli query_graph '{"query": "MATCH (f:Function) RETURN f.name LIMIT 5"}'
codebase-memory-mcp cli --raw search_graph '{"label": "Function"}' | jq '.results[].name'
The other subcommands are install, uninstall, update, config, and zova-ops (below).
Configuration
codebase-memory-mcp config list # show settings
codebase-memory-mcp config set auto_index true # index new projects on session start
codebase-memory-mcp config set auto_index_limit 50000 # skip auto-index above this many files
codebase-memory-mcp config set auto_watch false # don't register the background watcher
codebase-memory-mcp config reset auto_index # back to the default
auto_watch defaults to true. Turn it off to keep each session limited to explicit indexing.
Environment variables
| Variable | Default | Effect |
|---|---|---|
CBM_CACHE_DIR |
~/.cache/codebase-memory-mcp |
Where cbm.zova and settings live. |
CBM_ALLOWED_ROOT |
unset | Refuse to index any path that resolves outside this directory. Useful when an untrusted caller drives the server. |
CBM_WORKERS |
detected | Indexing workers. 0 is sequential; 1–256 sets the count. |
CBM_MEM_BUDGET_MB |
fraction of RAM | Indexing memory budget in MiB. Beyond it, extraction results spill to disk. An explicit value also stops post-extraction phases before publication; the detected default does not hard-fail after extraction. |
CBM_LOG_LEVEL |
info |
debug, info, warn, error, or none. Logs go to stderr; stdout carries MCP JSON-RPC. |
CBM_DIAGNOSTICS |
off | 1 writes periodic resource snapshots; see Diagnostics. |
CBM_DUMP_VERIFY_MIN_RATIO |
0.5 |
If fewer than this fraction of indexed nodes persist, index_repository reports status: "degraded". 0 disables the check. |
CBM_DOWNLOAD_URL |
GitHub releases | Override the update download URL. |
Ignoring files
Ignore rules layer: built-in patterns (.git, node_modules, …), then the .gitignore hierarchy,
then .cbmignore (gitignore syntax, project-specific). Symlinks are always skipped. See
docs/cbmignore.md.
codebase-memory MCP 질문
codebase-memory MCP는 어떤 도구를 제공하나요?
15개 도구를 제공합니다. 예: index_repository, index_status, check_index_coverage, list_projects, delete_project.
프로젝트를 어떻게 인덱싱하나요?
코딩 에이전트에서 저장소를 연 다음 'Index this project.'라고 요청하면 됩니다.
의미적 검색을 위해 LLM이나 API 키가 필요한가요?
아니요. API 키나 외부 모델 서비스 없이도 번들로 포함된 모델을 사용하여 의미적 검색을 수행하는 구조적 백엔드입니다.
시스템 RAM을 초과하는 대규모 저장소는 어떻게 처리하나요?
서버는 메모리 예산을 사용하며, 대규모 저장소로 인해 시스템 메모리가 고갈되는 것을 방지하기 위해 추출 결과를 디스크로 저장합니다.