feat: Use opencode log path

Author: dmtrKovalenko

bun.lock

@@ -97,6 +97,7 @@
   },
   "dependencies": {
     "@aws-sdk/client-s3": "3.933.0",
+    "@ff-labs/fff-bun": "0.6.4",
     "@opencode-ai/plugin": "workspace:*",
     "@opencode-ai/script": "workspace:*",
     "@opencode-ai/sdk": "workspace:*",

package.json

@@ -102,7 +102,7 @@
     "@clack/prompts": "1.0.0-alpha.1",
     "@effect/opentelemetry": "catalog:",
     "@effect/platform-node": "catalog:",
-    "@ff-labs/fff-bun": "0.6.2",
+    "@ff-labs/fff-bun": "0.6.4",
     "@gitlab/opencode-gitlab-auth": "1.3.3",
     "@hono/node-server": "1.19.11",
     "@hono/node-ws": "1.3.0",

packages/opencode/package.json

@@ -18,8 +18,6 @@ import { Glob } from "../util/glob"
 import { Log } from "../util/log"
 
 export namespace Fff {
-  const log = Log.create({ service: "file.fff" })
-
   export const Match = z.object({
     path: z.object({
       text: z.string(),
@@ -52,7 +50,7 @@ export namespace Fff {
 
   const root = path.join(Global.Path.cache, "fff")
 
-  async function db() {
+  async function dbs() {
     await fs.mkdir(root, { recursive: true })
     // fff databases are global across the file system
     return {
@@ -71,18 +69,26 @@ export namespace Fff {
     if (wait) return wait
 
     const next = (async () => {
-      const files = await db()
-      const made = FileFinder.create({
+      const files = await dbs()
+      const base = Log.file()
+      const logfile = path.join(Global.Path.log, base ? "fff-" + path.basename(base) : "fff.log")
+      const result = FileFinder.create({
+        aiMode: true,
         basePath: dir,
         frecencyDbPath: files.frecency,
         historyDbPath: files.history,
-        aiMode: true,
+        logFilePath: logfile,
+        logLevel: Log.currentLevel().toLowerCase() as "debug" | "info" | "warn" | "error",
+        // if there is second project opened within the same sesion - disable
+        // content mapping, the memory mapping address space is finite, so we
+        // don't want to blow user's computer (the limit depends on repo size)
+        cacheBudgetMaxFiles: memo.map.size > 0 ? 0 : undefined,
       })
-      if (!made.ok) throw new Error(made.error)
+      if (!result.ok) throw new Error(result.error)
       // we do not syncrhnously wait for the results here to not block anything
       // fff will do the indexing in the background and will automatically
       // become available
-      const pick = made.value
+      const pick = result.value
       memo.map.set(dir, pick)
       return pick
     })()
@@ -96,8 +102,8 @@ export namespace Fff {
   }
 
   export async function files(input: { cwd: string; query: string; page?: number; size?: number; current?: string }) {
-    const pick = await picker(input.cwd)
-    const out = pick.fileSearch(input.query, {
+    const fff = await picker(input.cwd)
+    const out = fff.fileSearch(input.query, {
       pageIndex: input.page ?? 0,
       pageSize: input.size ?? 100,
       currentFile: input.current,
@@ -107,8 +113,8 @@ export namespace Fff {
   }
 
   export async function mixed(input: { cwd: string; query: string; page?: number; size?: number; current?: string }) {
-    const pick = await picker(input.cwd)
-    const out = pick.mixedSearch(input.query, {
+    const fff = await picker(input.cwd)
+    const out = fff.mixedSearch(input.query, {
       pageIndex: input.page ?? 0,
       pageSize: input.size ?? 100,
       currentFile: input.current,

packages/opencode/src/file/fff.ts

@@ -650,8 +650,8 @@ export const layer = Layer.effect(
         const ctx = yield* InstanceState.context
         const fast = yield* Effect.promise(() =>
           Fff.mixed({
-            cwd: ctx.directory,
             query,
+            cwd: ctx.directory,
             size: limit,
           })
             .then((out) => {

packages/opencode/src/file/index.ts

@@ -17,6 +17,9 @@ const levelPriority: Record<Level, number> = {
 const keep = 10
 
 let level: Level = "INFO"
+export function currentLevel() {
+  return level
+}
 
 function shouldLog(input: Level): boolean {
   return levelPriority[input] >= levelPriority[level]