@launchsecure/launch-kit 0.0.2 → 0.0.4

package/dist/server/cli.js

@@ -6341,6 +6341,7 @@ function getTs() {
   }
   return tsModule;
 }
+var HTTP_METHODS = /* @__PURE__ */ new Set(["get", "post", "put", "patch", "delete", "head", "options"]);
 function parseFile(absPath) {
   const ts = getTs();
   const content = (0, import_node_fs.readFileSync)(absPath, "utf-8");
@@ -6363,6 +6364,8 @@ function parseFile(absPath) {
   const reExports = [];
   const jsxElements = /* @__PURE__ */ new Set();
   const navigations = [];
+  const fetchCalls = [];
+  const includeConcat = process.env.LAUNCH_CHART_INCLUDE_CONCAT_FETCHES === "1";
   function addExport(name2, kind) {
     if (!exportsSet.has(name2)) {
       exportsSet.add(name2);
@@ -6385,6 +6388,33 @@ function parseFile(absPath) {
     }
     return null;
   }
+  function looksLikeUrl(s) {
+    return s.startsWith("/") || /^(https?:)?\/\//i.test(s);
+  }
+  function templateStartsWithSlash(expr) {
+    const head = expr.head.text;
+    return head.startsWith("/");
+  }
+  function extractUrlFromFetchArg(arg) {
+    if (ts.isStringLiteral(arg) || ts.isNoSubstitutionTemplateLiteral(arg)) {
+      if (!looksLikeUrl(arg.text)) return null;
+      return { url: arg.text, isTemplate: false };
+    }
+    if (ts.isTemplateExpression(arg)) {
+      if (!templateStartsWithSlash(arg)) return null;
+      return { url: arg.getText(sourceFile), isTemplate: true };
+    }
+    if (includeConcat && ts.isBinaryExpression(arg) && arg.operatorToken.kind === ts.SyntaxKind.PlusToken) {
+      let leftmost = arg;
+      while (ts.isBinaryExpression(leftmost) && leftmost.operatorToken.kind === ts.SyntaxKind.PlusToken) {
+        leftmost = leftmost.left;
+      }
+      if ((ts.isStringLiteral(leftmost) || ts.isNoSubstitutionTemplateLiteral(leftmost)) && leftmost.text.startsWith("/")) {
+        return { url: arg.getText(sourceFile), isTemplate: false, isConcat: true };
+      }
+    }
+    return null;
+  }
   function visit(node) {
     if (ts.isImportDeclaration(node)) {
       const moduleSpec = node.moduleSpecifier;
@@ -6408,6 +6438,8 @@ function parseFile(absPath) {
         }
         if (names.length > 0 || isTypeOnly) {
           imports.push({ names, specifier, isTypeOnly, typeNames });
+        } else if (!clause) {
+          imports.push({ names: [], specifier, isTypeOnly: false, typeNames: /* @__PURE__ */ new Set() });
         }
       }
     }
@@ -6421,6 +6453,19 @@ function parseFile(absPath) {
             reExports.push({ name: exportedName, from: fromSpec });
           }
         }
+      } else if (!node.exportClause && fromSpec) {
+        reExports.push({ name: "*", from: fromSpec, isWildcard: true });
+      }
+    }
+    if (ts.isCallExpression(node) && node.expression.kind === ts.SyntaxKind.ImportKeyword) {
+      const arg = node.arguments[0];
+      if (arg && ts.isStringLiteral(arg)) {
+        imports.push({
+          names: [],
+          specifier: arg.text,
+          isTypeOnly: false,
+          typeNames: /* @__PURE__ */ new Set()
+        });
       }
     }
     if (ts.isExportAssignment(node) && !node.isExportEquals) {
@@ -6482,6 +6527,36 @@ function parseFile(absPath) {
         }
       }
     }
+    if (ts.isCallExpression(node) && node.arguments.length > 0) {
+      const expr = node.expression;
+      const firstArg = node.arguments[0];
+      if (ts.isIdentifier(expr) && expr.text === "fetch") {
+        const extracted = extractUrlFromFetchArg(firstArg);
+        if (extracted) {
+          fetchCalls.push({
+            url: extracted.url,
+            isTemplate: extracted.isTemplate,
+            ...extracted.isConcat ? { isConcat: true } : {},
+            kind: "fetch"
+          });
+        }
+      }
+      if (ts.isPropertyAccessExpression(expr) && ts.isIdentifier(expr.name)) {
+        const methodName = expr.name.text;
+        if (HTTP_METHODS.has(methodName)) {
+          const extracted = extractUrlFromFetchArg(firstArg);
+          if (extracted) {
+            fetchCalls.push({
+              method: methodName.toUpperCase(),
+              url: extracted.url,
+              isTemplate: extracted.isTemplate,
+              ...extracted.isConcat ? { isConcat: true } : {},
+              kind: "client-method"
+            });
+          }
+        }
+      }
+    }
     if (ts.isJsxOpeningElement(node) || ts.isJsxSelfClosingElement(node)) {
       const tagName = node.tagName;
       if (ts.isIdentifier(tagName) && tagName.text === "Link") {
@@ -6531,7 +6606,8 @@ function parseFile(absPath) {
     imports,
     reExports,
     jsxElements,
-    navigations
+    navigations,
+    fetchCalls
   };
 }
 var MUTATION_METHODS = /* @__PURE__ */ new Set([
@@ -6610,6 +6686,19 @@ function walk(dir, exts) {
   }
   return results;
 }
+function walkWithIgnore(dir, exts, ignoreDirs) {
+  const results = [];
+  if (!(0, import_node_fs2.existsSync)(dir)) return results;
+  for (const entry of (0, import_node_fs2.readdirSync)(dir, { withFileTypes: true })) {
+    if (entry.isDirectory()) {
+      if (ignoreDirs.has(entry.name)) continue;
+      results.push(...walkWithIgnore((0, import_node_path2.join)(dir, entry.name), exts, ignoreDirs));
+    } else if (exts.includes((0, import_node_path2.extname)(entry.name))) {
+      results.push((0, import_node_path2.join)(dir, entry.name));
+    }
+  }
+  return results;
+}
 function toNodeId(srcDir, absPath) {
   return (0, import_node_path2.relative)(srcDir, absPath).replace(/\\/g, "/");
 }
@@ -6629,20 +6718,58 @@ function resolveRelativeImport(fromFile, specifier) {
   }
   return null;
 }
+function resolveBarrelMap(barrelAbsPath, parsedByPath, memo, visiting) {
+  const cached = memo.get(barrelAbsPath);
+  if (cached) return cached;
+  if (visiting.has(barrelAbsPath)) return /* @__PURE__ */ new Map();
+  visiting.add(barrelAbsPath);
+  const parsed = parsedByPath.get(barrelAbsPath);
+  const map = /* @__PURE__ */ new Map();
+  if (!parsed) {
+    visiting.delete(barrelAbsPath);
+    memo.set(barrelAbsPath, map);
+    return map;
+  }
+  for (const re of parsed.reExports) {
+    if (!re.from.startsWith(".")) continue;
+    const resolved = resolveRelativeImport(barrelAbsPath, re.from);
+    if (!resolved) continue;
+    if (re.isWildcard) {
+      const targetBn = (0, import_node_path2.basename)(resolved);
+      const targetIsBarrel = targetBn === "index.ts" || targetBn === "index.tsx";
+      if (targetIsBarrel) {
+        const nested = resolveBarrelMap(resolved, parsedByPath, memo, visiting);
+        for (const [name, target] of nested) {
+          if (!map.has(name)) map.set(name, target);
+        }
+      } else {
+        const targetParsed = parsedByPath.get(resolved);
+        if (targetParsed) {
+          for (const exp of targetParsed.exports) {
+            if (!map.has(exp)) map.set(exp, resolved);
+          }
+        }
+      }
+    } else {
+      if (!map.has(re.name)) map.set(re.name, resolved);
+    }
+  }
+  visiting.delete(barrelAbsPath);
+  memo.set(barrelAbsPath, map);
+  return map;
+}
 function buildAllBarrelMaps(srcDir, parsedByPath) {
   const barrels = /* @__PURE__ */ new Map();
+  const memo = /* @__PURE__ */ new Map();
   for (const [absPath, parsed] of parsedByPath) {
     const bn = (0, import_node_path2.basename)(absPath);
     if (bn !== "index.ts" && bn !== "index.tsx") continue;
     if (parsed.reExports.length === 0) continue;
-    const barrelId = (0, import_node_path2.relative)(srcDir, (0, import_node_path2.dirname)(absPath)).replace(/\\/g, "/");
-    const map = /* @__PURE__ */ new Map();
-    for (const re of parsed.reExports) {
-      if (!re.from.startsWith(".")) continue;
-      const resolved = resolveRelativeImport(absPath, re.from);
-      if (resolved) map.set(re.name, resolved);
+    const map = resolveBarrelMap(absPath, parsedByPath, memo, /* @__PURE__ */ new Set());
+    if (map.size > 0) {
+      const barrelId = (0, import_node_path2.relative)(srcDir, (0, import_node_path2.dirname)(absPath)).replace(/\\/g, "/");
+      barrels.set(barrelId, map);
     }
-    if (map.size > 0) barrels.set(barrelId, map);
   }
   return barrels;
 }
@@ -6780,6 +6907,105 @@ function matchRouteToPage(route, routeToNodeId) {
   if (routeToNodeId.has(normalized)) return routeToNodeId.get(normalized);
   return null;
 }
+function loadApiRoutes(rootDir) {
+  const apiJsonPath = (0, import_node_path2.join)(rootDir, ".launchsecure", "graphs", "api.json");
+  if (!(0, import_node_fs2.existsSync)(apiJsonPath)) return [];
+  try {
+    const parsed = JSON.parse((0, import_node_fs2.readFileSync)(apiJsonPath, "utf-8"));
+    const routes = [];
+    for (const n of parsed.nodes ?? []) {
+      const path9 = n.path;
+      if (!path9 || typeof path9 !== "string") continue;
+      routes.push({
+        path: path9,
+        nodeId: n.id,
+        segments: path9.split("/").filter(Boolean)
+      });
+    }
+    return routes;
+  } catch {
+    return [];
+  }
+}
+function buildApiPathMap(routes) {
+  const map = /* @__PURE__ */ new Map();
+  for (const r of routes) {
+    if (!map.has(r.path)) map.set(r.path, r.nodeId);
+  }
+  return map;
+}
+function normalizeFetchUrl(raw) {
+  let s = raw.replace(/^`|`$/g, "");
+  const qIdx = s.indexOf("?");
+  if (qIdx >= 0) s = s.slice(0, qIdx);
+  const hIdx = s.indexOf("#");
+  if (hIdx >= 0) s = s.slice(0, hIdx);
+  let hadInterpolation = false;
+  s = s.replace(/\$\{([^}]+)\}/g, (_, expr) => {
+    hadInterpolation = true;
+    const cleaned = expr.trim();
+    const last = cleaned.split(".").pop() ?? cleaned;
+    const name = last.replace(/[^\w]/g, "") || "param";
+    return ":" + name;
+  });
+  s = s.replace(/\/+/g, "/");
+  if (s.length > 1 && s.endsWith("/")) s = s.slice(0, -1);
+  return { path: s || "/", hadInterpolation };
+}
+function scoreApiRouteMatch(candidate, known) {
+  if (candidate.length !== known.length) return -1;
+  let score = 0;
+  for (let i = 0; i < candidate.length; i++) {
+    const a = candidate[i];
+    const b = known[i];
+    if (a === b) {
+      score += 3;
+      continue;
+    }
+    if (a.startsWith(":") && b.startsWith(":")) {
+      score += 2;
+      continue;
+    }
+    if (a.startsWith(":") || b.startsWith(":")) {
+      score += 1;
+      continue;
+    }
+    return -1;
+  }
+  return score;
+}
+function resolveFetchCall(call, apiPathMap, apiRoutes) {
+  const raw = call.url;
+  if (/^(https?:)?\/\//i.test(raw)) {
+    return { kind: "external", normalizedUrl: raw };
+  }
+  if (call.isConcat) {
+    return { kind: "dynamic", normalizedUrl: raw };
+  }
+  const { path: path9, hadInterpolation } = normalizeFetchUrl(raw);
+  if (!path9.startsWith("/")) {
+    return { kind: "unresolved", normalizedUrl: path9 };
+  }
+  const segs = path9.split("/").filter(Boolean);
+  if (hadInterpolation && segs.length > 0 && segs[0].startsWith(":")) {
+    return { kind: "dynamic", normalizedUrl: path9 };
+  }
+  const exact = apiPathMap.get(path9);
+  if (exact) return { kind: "resolved", nodeId: exact, normalizedUrl: path9 };
+  let bestScore = -1;
+  let bestId = null;
+  for (const r of apiRoutes) {
+    const score = scoreApiRouteMatch(segs, r.segments);
+    if (score > bestScore) {
+      bestScore = score;
+      bestId = r.nodeId;
+    }
+  }
+  if (bestId && bestScore > 0) {
+    return { kind: "resolved", nodeId: bestId, normalizedUrl: path9 };
+  }
+  return { kind: "unresolved", normalizedUrl: path9 };
+}
 function extractEdges(srcDir, absPath, sourceId, parsed, nodeIdSet, nodeTypeMap, barrelMaps, routeToNodeId) {
   const edges = [];
   const flagged = [];
@@ -6884,7 +7110,7 @@ function detect(rootDir) {
 function generate(rootDir) {
   const srcDir = (0, import_node_path2.join)(rootDir, "src");
   const appFiles = walk((0, import_node_path2.join)(srcDir, "app"), [".tsx", ".ts"]).filter(
-    (f) => f.endsWith("/page.tsx") || f.endsWith("/layout.tsx")
+    (f) => (0, import_node_path2.basename)(f) !== "route.ts" && (0, import_node_path2.basename)(f) !== "route.tsx"
   );
   const clientFiles = walk((0, import_node_path2.join)(srcDir, "client"), [".tsx", ".ts"]);
   const serverFiles = walk((0, import_node_path2.join)(srcDir, "server"), [".ts", ".tsx"]).filter(
@@ -6917,6 +7143,7 @@ function generate(rootDir) {
   }
   const allEdges = [];
   const allFlagged = [];
+  const crossRefs = [];
   for (const absPath of fileSet) {
     const sourceId = toNodeId(srcDir, absPath);
     const parsed = parsedByPath.get(absPath);
@@ -6933,6 +7160,139 @@ function generate(rootDir) {
     allEdges.push(...edges);
     allFlagged.push(...flagged);
   }
+  const apiRoutes = loadApiRoutes(rootDir);
+  const apiPathMap = buildApiPathMap(apiRoutes);
+  const includeExternalFetches = process.env.LAUNCH_CHART_INCLUDE_EXTERNAL_FETCHES === "1";
+  const fetchSeen = /* @__PURE__ */ new Set();
+  let fetchResolvedCount = 0;
+  let fetchDynamicCount = 0;
+  let fetchUnresolvedCount = 0;
+  let fetchExternalCount = 0;
+  for (const absPath of fileSet) {
+    const sourceId = toNodeId(srcDir, absPath);
+    const parsed = parsedByPath.get(absPath);
+    if (parsed.fetchCalls.length === 0) continue;
+    for (const call of parsed.fetchCalls) {
+      const result = resolveFetchCall(call, apiPathMap, apiRoutes);
+      const methodTag = call.method ?? (call.kind === "fetch" ? "GET?" : "?");
+      if (result.kind === "resolved" && result.nodeId) {
+        const key = `${sourceId}\u2192${result.nodeId}\u2192calls_api`;
+        if (fetchSeen.has(key)) continue;
+        fetchSeen.add(key);
+        crossRefs.push({
+          source: sourceId,
+          target: result.nodeId,
+          type: "calls_api",
+          layer: "api"
+        });
+        fetchResolvedCount++;
+        continue;
+      }
+      if (result.kind === "dynamic") {
+        fetchDynamicCount++;
+        allFlagged.push({
+          source: sourceId,
+          target: "DYNAMIC",
+          type: "calls_api",
+          label: call.isConcat ? `${methodTag} fetch with concat: ${call.url}` : `${methodTag} fetch with template: ${call.url}`,
+          confidence: call.isConcat ? "low" : "medium"
+        });
+        continue;
+      }
+      if (result.kind === "external") {
+        fetchExternalCount++;
+        if (!includeExternalFetches) continue;
+        allFlagged.push({
+          source: sourceId,
+          target: "EXTERNAL",
+          type: "calls_external",
+          label: `${methodTag} external fetch: ${call.url}`,
+          confidence: "high"
+        });
+        continue;
+      }
+      fetchUnresolvedCount++;
+      allFlagged.push({
+        source: sourceId,
+        target: "UNRESOLVED",
+        type: "calls_api",
+        label: `${methodTag} fetch to unknown path: ${result.normalizedUrl}`,
+        confidence: "medium"
+      });
+    }
+  }
+  const externalScanned = new Set(allDiscovered.map((f) => f.replace(/\\/g, "/")));
+  const IGNORE_DIRS = /* @__PURE__ */ new Set([
+    "node_modules",
+    ".next",
+    "dist",
+    ".launchsecure",
+    ".git",
+    "src",
+    "coverage",
+    ".turbo",
+    "build",
+    "out",
+    ".vercel"
+  ]);
+  const externalCandidates = walkWithIgnore(rootDir, [".ts", ".tsx"], IGNORE_DIRS);
+  for (const absPath of externalCandidates) {
+    const normalized = absPath.replace(/\\/g, "/");
+    if (externalScanned.has(normalized)) continue;
+    let parsed;
+    try {
+      parsed = parseFile(absPath);
+    } catch {
+      continue;
+    }
+    const externalId = (0, import_node_path2.relative)(rootDir, absPath).replace(/\\/g, "/");
+    const edgesFromThis = [];
+    const seen = /* @__PURE__ */ new Set();
+    for (const imp of parsed.imports) {
+      const { specifier, isTypeOnly, names } = imp;
+      let resolved = null;
+      if (specifier.startsWith("@/")) {
+        const relToSrc = specifier.slice(2);
+        const barrelMap = barrelMaps.get(relToSrc);
+        if (barrelMap && names.length > 0) {
+          for (const name of names) {
+            const targetAbs = barrelMap.get(name);
+            if (!targetAbs) continue;
+            const targetId2 = toNodeId(srcDir, targetAbs);
+            if (!nodeIdSet.has(targetId2)) continue;
+            const key2 = `${externalId}\u2192${targetId2}`;
+            if (seen.has(key2)) continue;
+            seen.add(key2);
+            edgesFromThis.push({ source: externalId, target: targetId2, type: "imports" });
+          }
+          continue;
+        }
+        resolved = resolveImport(srcDir, specifier);
+      } else if (specifier.startsWith(".")) {
+        resolved = resolveRelativeImport(absPath, specifier);
+      }
+      if (!resolved) continue;
+      const targetId = toNodeId(srcDir, resolved);
+      if (!nodeIdSet.has(targetId)) continue;
+      if (targetId.endsWith("/index.ts") || targetId.endsWith("/index.tsx")) continue;
+      const key = `${externalId}\u2192${targetId}\u2192${isTypeOnly ? "type" : "value"}`;
+      if (seen.has(key)) continue;
+      seen.add(key);
+      edgesFromThis.push({ source: externalId, target: targetId, type: "imports" });
+    }
+    if (edgesFromThis.length === 0) continue;
+    nodes.push({
+      id: externalId,
+      type: "external",
+      name: parsed.name || nameFromFilename(absPath),
+      route: null,
+      module: "external",
+      exports: parsed.exports
+    });
+    nodeIdSet.add(externalId);
+    nodeTypeMap.set(externalId, "external");
+    allEdges.push(...edgesFromThis);
+  }
   const flaggedSet = /* @__PURE__ */ new Set();
   const dedupedFlagged = allFlagged.filter((f) => {
     const key = `${f.source}\u2192${f.target}\u2192${f.label}`;
@@ -6964,6 +7324,7 @@ function generate(rootDir) {
     total_configs: byType("config"),
     total_utils: byType("util"),
     total_libs: byType("lib"),
+    total_external: byType("external"),
     total_edges: allEdges.length,
     total_flagged: dedupedFlagged.length
   };
@@ -6975,11 +7336,20 @@ function generate(rootDir) {
       layer: "ui",
       parser: "react-nextjs-ast",
       ...stats,
+      api_call_detection: {
+        includeExternalFetches,
+        includeConcatFetches: process.env.LAUNCH_CHART_INCLUDE_CONCAT_FETCHES === "1",
+        apiRoutesLoaded: apiRoutes.length,
+        resolved: fetchResolvedCount,
+        dynamic: fetchDynamicCount,
+        unresolved: fetchUnresolvedCount,
+        external: fetchExternalCount
+      },
       notes: "Auto-generated via TypeScript AST \u2014 edges derived from actual imports, renders from JSX usage, navigations from router/Link calls."
     },
     nodes,
     edges: allEdges,
-    cross_refs: [],
+    cross_refs: crossRefs,
     contradictions: [],
     warnings: [],
     flagged_edges: dedupedFlagged,
@@ -7004,7 +7374,7 @@ var reactNextjsParser = {
 // src/server/graph/parsers/api/nextjs-routes.ts
 var import_node_fs3 = require("node:fs");
 var import_node_path3 = require("node:path");
-var HTTP_METHODS = /* @__PURE__ */ new Set(["GET", "POST", "PUT", "DELETE", "PATCH", "HEAD", "OPTIONS"]);
+var HTTP_METHODS2 = /* @__PURE__ */ new Set(["GET", "POST", "PUT", "DELETE", "PATCH", "HEAD", "OPTIONS"]);
 function walk2(dir) {
   const results = [];
   if (!(0, import_node_fs3.existsSync)(dir)) return results;
@@ -7048,7 +7418,7 @@ function generate2(rootDir) {
     const authWrappers = extractAuthWrappers(absPath);
     const methods = [];
     for (const exp of parsed.exports) {
-      if (HTTP_METHODS.has(exp)) methods.push(exp);
+      if (HTTP_METHODS2.has(exp)) methods.push(exp);
     }
     const routePath = filePathToRoute(apiDir, absPath);
     const relPath = (0, import_node_path3.relative)(rootDir, absPath).replace(/\\/g, "/");
@@ -7118,7 +7488,7 @@ function generate2(rootDir) {
     flagged_edges: [],
     patterns: {
       total_endpoints: nodes.length,
-      methods_breakdown: [...HTTP_METHODS].reduce((acc, m) => {
+      methods_breakdown: [...HTTP_METHODS2].reduce((acc, m) => {
         acc[m] = nodes.filter((n) => n.methods.includes(m)).length;
         return acc;
       }, {}),
@@ -7310,13 +7680,14 @@ function generateLayer(rootDir, layer) {
   };
 }
 function generateAll(rootDir) {
-  const layers = ["ui", "api", "db"];
+  const layers = ["api", "db", "ui"];
   const results = [];
   for (const layer of layers) {
     const result = generateLayer(rootDir, layer);
     if (result) results.push(result);
   }
-  return results;
+  const byLayer = new Map(results.map((r) => [r.layer, r]));
+  return ["ui", "api", "db"].map((l) => byLayer.get(l)).filter((r) => !!r);
 }
 
 // src/server/graph/index.ts
@@ -7421,8 +7792,69 @@ function handleGraphCommand(subcommand, args) {
 }
 
 // src/server/graph-mcp.ts
+var import_node_fs7 = require("node:fs");
+var import_node_path7 = require("node:path");
+
+// src/server/lockfile.ts
+var import_node_child_process = require("node:child_process");
 var import_node_fs6 = require("node:fs");
+var import_node_os = require("node:os");
 var import_node_path6 = require("node:path");
+function lockDir() {
+  return (0, import_node_path6.join)((0, import_node_os.homedir)(), ".launchsecure");
+}
+function lockPath() {
+  return (0, import_node_path6.join)(lockDir(), "launch-chart.lock");
+}
+function readLock() {
+  const p = lockPath();
+  if (!(0, import_node_fs6.existsSync)(p)) return null;
+  try {
+    const data = JSON.parse((0, import_node_fs6.readFileSync)(p, "utf-8"));
+    if (typeof data.pid !== "number" || typeof data.port !== "number") return null;
+    return data;
+  } catch {
+    return null;
+  }
+}
+function isPidAlive(pid) {
+  try {
+    process.kill(pid, 0);
+    return true;
+  } catch {
+    return false;
+  }
+}
+function getListenerPid(port) {
+  try {
+    const out = (0, import_node_child_process.execFileSync)("lsof", ["-nP", "-iTCP:" + port, "-sTCP:LISTEN", "-t"], {
+      encoding: "utf-8",
+      stdio: ["ignore", "pipe", "ignore"],
+      timeout: 500
+    }).trim();
+    if (!out) return null;
+    const pid = parseInt(out.split("\n")[0], 10);
+    return Number.isFinite(pid) ? pid : null;
+  } catch {
+    return null;
+  }
+}
+function getLiveLock() {
+  const lock = readLock();
+  if (!lock) return null;
+  const listenerPid = getListenerPid(lock.port);
+  const live = listenerPid !== null ? listenerPid === lock.pid : isPidAlive(lock.pid);
+  if (!live) {
+    try {
+      (0, import_node_fs6.unlinkSync)(lockPath());
+    } catch {
+    }
+    return null;
+  }
+  return lock;
+}
+
+// src/server/graph-mcp.ts
 var SERVER_INFO = {
   name: "launchsecure-graph",
   version: "0.0.1"
@@ -7444,7 +7876,7 @@ var TOOLS = [
   },
   {
     name: "read_graph",
-    description: 'Query the structural project graph \u2014 a smart Glob replacement that locates files by type/module/name and returns structural metadata (imports, renders, routes, relations). \n\nUSE THIS FOR: "where is X", "what files are in module Y", "what pages exist under /admin", "what components does Z render", "what tables relate to User", "list all hooks in auth module". \n\nDO NOT USE FOR: finding text/code content (use Grep), reading actual source code (use Read), understanding behavior/logic/patterns (graph has no code semantics \u2014 only names and edges). \n\nQUERY PARAMS (at least one required for node data \u2014 unfiltered calls return summary only to stay in context):\n- search: substring match on node id, name, or route\n- type: filter by node type (ui layer: page, layout, component, ui, hook, context, config, util; api layer: endpoint; db layer: table, enum)\n- module: filter by module (ui layer only: auth, admin, project, org, settings, integrations, shared-ui, layout, root)\n- node_id: return this node + its neighborhood (incoming+outgoing edges within `hops`)\n- hops: neighborhood radius when node_id is set (default 1)\n- minimal: return only id/type/name/module/route per node (skip heavy fields like columns, exports)\n\nBATCH MODE: pass `queries` (array of query objects) to run multiple independent queries in a single call. Each query object uses the same params (layer/search/type/module/node_id/hops/minimal). Returns { batch: true, count, results: [{index, query, result}, ...] }. Use this when you need multiple graph views up-front (e.g. scoping a feature across ui+api+db layers) to save round-trips. When batch mode is used, top-level params are ignored.\n\nReturns: filtered nodes + edges between them. If no filter given, returns per-layer counts and type breakdown only.',
+    description: 'Query the structural project graph \u2014 a smart Glob replacement that locates files by type/module/name and returns structural metadata (imports, renders, routes, relations). \n\nUSE THIS FOR: "where is X", "what files are in module Y", "what pages exist under /admin", "what components does Z render", "what tables relate to User", "list all hooks in auth module". \n\nDO NOT USE FOR: finding text/code content (use Grep), reading actual source code (use Read), understanding behavior/logic/patterns (graph has no code semantics \u2014 only names and edges). \n\nQUERY PARAMS (at least one required for node data \u2014 unfiltered calls return summary only to stay in context):\n- search: substring match on node id, name, or route\n- type: filter by node type (ui layer: page, layout, component, ui, hook, context, config, util; api layer: endpoint; db layer: table, enum)\n- module: filter by module (ui layer only: auth, admin, project, org, settings, integrations, shared-ui, layout, root)\n- node_id: return this node + its neighborhood (incoming+outgoing edges within `hops`)\n- hops: neighborhood radius when node_id is set (default 1)\n- minimal: return only id/type/name/module/route per node (skip heavy fields like columns, exports)\n- include_edges: return the actual edge list. Default: TRUE for neighborhood queries (node_id), FALSE for filter queries (search/type/module). Filter responses always include `edge_count`; only pass include_edges:true when you actually need to inspect individual edges (e.g. "which components render X"). This default cuts typical filter responses in half.\n\nBATCH MODE: pass `queries` (array of query objects) to run multiple independent queries in a single call. Each query object uses the same params (layer/search/type/module/node_id/hops/minimal). Returns { batch: true, count, results: [{index, query, result}, ...] }. Use this when you need multiple graph views up-front (e.g. scoping a feature across ui+api+db layers) to save round-trips. When batch mode is used, top-level params are ignored.\n\nReturns: filtered nodes + edges between them. If no filter given, returns per-layer counts and type breakdown only.\n\nWIRE FORMAT (compact): responses that include nodes/edges use short keys and edge-by-index refs to cut payload ~40-60%. Every such response carries a `_schema` legend. Quick reference:\n  nodes[]: { i: id, t: type, n: name, m: module, r: route, mt: methods, x: exports, c: columns }\n  edges[]: { s: source_node_index, d: target_node_index, t: type, l: label }\nedges.s / edges.d are 0-based indices into THIS response\'s nodes array. If a referenced node is not in the response (boundary case), s/d may instead contain the full node id string \u2014 always check the type.\n\nBUDGET GUARDS:\n- Neighborhood queries stop expanding when the projected response exceeds budget. The response then contains `budget_exceeded: true` plus `hops_traversed < hops_requested`. When this happens, drill into a specific neighbor with another node_id call rather than retrying with larger hops \u2014 it will just truncate again.\n- Batch mode caps total response size. Once the budget is hit, later queries return `{skipped: true, reason: "batch_budget_exhausted"}` and you must re-run them individually.',
     inputSchema: {
       type: "object",
       properties: {
@@ -7475,11 +7907,15 @@ var TOOLS = [
         },
         minimal: {
           type: "boolean",
-          description: "Return minimal node fields only (id, type, name, module, route). Default false."
+          description: "Return minimal node fields only (id, type, name, module, route). Default false, except db-layer filter queries default to true (db table nodes carry heavy `columns` arrays). Pass minimal:false on a db filter query if you want columns."
+        },
+        include_edges: {
+          type: "boolean",
+          description: "Include the edge list in the response. Default TRUE for neighborhood queries (node_id), FALSE for filter queries. Filter responses always include edge_count. Only set true on filter queries when you actually need edge data."
         },
         queries: {
           type: "array",
-          description: "Batch mode \u2014 array of query objects to run in a single call. Each uses the same param schema (layer/search/type/module/node_id/hops/minimal). When set, top-level params are ignored.",
+          description: "Batch mode \u2014 array of query objects to run in a single call. Each uses the same param schema. When set, top-level params are ignored. Subject to an aggregate size budget \u2014 later queries may return a skipped stub.",
           items: {
             type: "object",
             properties: {
@@ -7489,7 +7925,8 @@ var TOOLS = [
               module: { type: "string" },
               node_id: { type: "string" },
               hops: { type: "number" },
-              minimal: { type: "boolean" }
+              minimal: { type: "boolean" },
+              include_edges: { type: "boolean" }
             }
           }
         }
@@ -7543,6 +7980,14 @@ Returns: { pattern, filter, files_searched, total_matches, matches: [{file, line
       },
       required: ["layer", "pattern"]
     }
+  },
+  {
+    name: "get_graph_ui_url",
+    description: 'Return the URL of a running launch-chart UI server if one exists. The UI is a visual, interactive view of the merged UI+API+DB project graph served by `launch-chart serve` (or auto-started via LAUNCH_CHART_AUTOSERVE=1). \n\nReturns: { running: boolean, url?: string, port?: number, pid?: number, startedAt?: string, cwd?: string }. If running is false, no server is currently live \u2014 suggest the user run `launch-chart serve` to start one. \n\nUse this when the user asks "open the graph", "show me the project graph UI", "where\'s the chart", etc.',
+    inputSchema: {
+      type: "object",
+      properties: {}
+    }
   }
 ];
 function matchesSearch(node, query) {
@@ -7556,30 +8001,134 @@ function matchesSearch(node, query) {
 function toMinimal(nodes) {
   return nodes.map((n) => {
     const out = { id: n.id, type: n.type, name: n.name };
-    if (n.module) out.module = n.module;
-    if (n.route) out.route = n.route;
-    if (n.methods) out.methods = n.methods;
+    if (n.module != null) out.module = n.module;
+    if (n.route != null) out.route = n.route;
+    if (n.methods != null) out.methods = n.methods;
     return out;
   });
 }
-function neighborhood(graph, centerId, hops) {
+var COMPACT_SCHEMA = {
+  nodes: {
+    i: "id",
+    t: "type",
+    n: "name",
+    m: "module",
+    r: "route",
+    mt: "methods",
+    x: "exports",
+    c: "columns"
+  },
+  edges: {
+    s: "source_node_index",
+    d: "target_node_index",
+    t: "type",
+    l: "label"
+  },
+  note: "edges.s/d are 0-based indices into this response's nodes array. If a referenced node is outside the response (boundary case), s/d may contain the full node id string instead of an index."
+};
+var COMPACT_NODE_KNOWN_KEYS = /* @__PURE__ */ new Set([
+  "id",
+  "type",
+  "name",
+  "module",
+  "route",
+  "methods",
+  "exports",
+  "columns"
+]);
+var EST_CHARS_PER_NODE_FULL = {
+  ui: 300,
+  api: 300,
+  db: 3500
+};
+var EST_CHARS_PER_NODE_MIN = {
+  ui: 150,
+  api: 200,
+  db: 120
+};
+var EST_CHARS_PER_EDGE = {
+  ui: 65,
+  api: 65,
+  db: 65
+};
+var NEIGHBORHOOD_BUDGET_CHARS = 55e3;
+var BATCH_BUDGET_CHARS = 6e4;
+function toCompactNode(n) {
+  const out = { i: n.id, t: n.type, n: n.name };
+  if (n.module != null) out.m = n.module;
+  if (n.route != null) out.r = n.route;
+  if (n.methods != null) out.mt = n.methods;
+  if (n.exports != null) out.x = n.exports;
+  if (n.columns != null) out.c = n.columns;
+  for (const k of Object.keys(n)) {
+    if (!COMPACT_NODE_KNOWN_KEYS.has(k) && n[k] != null) out[k] = n[k];
+  }
+  return out;
+}
+function toCompactEdges(edges, idx) {
+  return edges.map((e) => {
+    const s = idx.get(e.source);
+    const d = idx.get(e.target);
+    const o = {
+      s: s ?? e.source,
+      d: d ?? e.target,
+      t: e.type
+    };
+    if (e.label != null) o.l = e.label;
+    return o;
+  });
+}
+function compactResult(raw) {
+  const nodes = raw.nodes;
+  if (!nodes) return raw;
+  const idx = /* @__PURE__ */ new Map();
+  nodes.forEach((n, i) => idx.set(n.id, i));
+  const compactNodes = nodes.map(toCompactNode);
+  const edges = raw.edges;
+  const compactEdges = edges ? toCompactEdges(edges, idx) : void 0;
+  const out = { _schema: COMPACT_SCHEMA };
+  for (const [k, v] of Object.entries(raw)) {
+    if (k === "nodes" || k === "edges") continue;
+    out[k] = v;
+  }
+  out.nodes = compactNodes;
+  if (compactEdges !== void 0) out.edges = compactEdges;
+  return out;
+}
+function neighborhood(graph, centerId, hops, layer, minimal) {
   const center = graph.nodes.find((n) => n.id === centerId);
   if (!center) return null;
   const visited = /* @__PURE__ */ new Set([centerId]);
   let frontier = /* @__PURE__ */ new Set([centerId]);
+  let budgetExceeded = false;
+  let stoppedAtHop = 0;
   for (let h = 0; h < hops; h++) {
     const next = /* @__PURE__ */ new Set();
     for (const edge of graph.edges) {
       if (frontier.has(edge.source) && !visited.has(edge.target)) next.add(edge.target);
       if (frontier.has(edge.target) && !visited.has(edge.source)) next.add(edge.source);
     }
+    const projectedVisited = visited.size + next.size;
+    let projectedEdges = 0;
+    for (const e of graph.edges) {
+      const srcIn = visited.has(e.source) || next.has(e.source);
+      const dstIn = visited.has(e.target) || next.has(e.target);
+      if (srcIn && dstIn) projectedEdges++;
+    }
+    const perNode = minimal ? EST_CHARS_PER_NODE_MIN[layer] : EST_CHARS_PER_NODE_FULL[layer];
+    const projectedChars = projectedVisited * perNode + projectedEdges * EST_CHARS_PER_EDGE[layer];
+    if (projectedChars > NEIGHBORHOOD_BUDGET_CHARS) {
+      budgetExceeded = true;
+      break;
+    }
     for (const id of next) visited.add(id);
     frontier = next;
+    stoppedAtHop = h + 1;
     if (frontier.size === 0) break;
   }
   const nodes = graph.nodes.filter((n) => visited.has(n.id));
   const edges = graph.edges.filter((e) => visited.has(e.source) && visited.has(e.target));
-  return { nodes, edges };
+  return { nodes, edges, budgetExceeded, stoppedAtHop };
 }
 function layerSummary(graph) {
   const typeCounts = {};
@@ -7638,14 +8187,16 @@ Output: .launchsecure/graphs/
 Use read_graph with filters (search/type/module/node_id) to query.`
   );
 }
-function runReadGraphQuery(rootDir, args) {
+function runReadGraphQueryRaw(rootDir, args) {
   const layer = args.layer;
   const search = args.search;
   const type = args.type;
   const module_ = args.module;
   const nodeId = args.node_id;
   const hops = args.hops ?? 1;
-  const minimal = args.minimal ?? false;
+  const layerIsDb = args.layer === "db";
+  const minimal = args.minimal ?? layerIsDb;
+  const includeEdges = args.include_edges;
   const hasFilter = !!(search || type || module_ || nodeId);
   if (layer && !["ui", "api", "db"].includes(layer)) {
     return { error: `Invalid layer "${layer}". Must be one of: ui, api, db` };
@@ -7671,19 +8222,26 @@ function runReadGraphQuery(rootDir, args) {
     return { error: `No ${layer} graph found at .launchsecure/graphs/${layer}.json. Run generate_graph first.` };
   }
   if (nodeId) {
-    const nb = neighborhood(graph, nodeId, hops);
+    const nb = neighborhood(graph, nodeId, hops, layer, minimal);
     if (!nb) {
       return { error: `Node "${nodeId}" not found in ${layer} graph. Try read_graph with search="${nodeId}" to find similar nodes.` };
     }
-    return {
+    const wantEdges2 = includeEdges ?? true;
+    const result2 = {
       layer,
       center: nodeId,
-      hops,
+      hops_requested: hops,
+      hops_traversed: nb.stoppedAtHop,
       node_count: nb.nodes.length,
       edge_count: nb.edges.length,
-      nodes: minimal ? toMinimal(nb.nodes) : nb.nodes,
-      edges: nb.edges
+      nodes: minimal ? toMinimal(nb.nodes) : nb.nodes
     };
+    if (wantEdges2) result2.edges = nb.edges;
+    if (nb.budgetExceeded) {
+      result2.budget_exceeded = true;
+      result2.hint = `Neighborhood truncated at hop ${nb.stoppedAtHop} (projected size exceeded budget). To explore further, call read_graph with node_id set to a specific neighbor from the returned nodes, or rerun with hops=${Math.max(1, nb.stoppedAtHop)} to confirm the partial view is what you wanted.`;
+    }
+    return result2;
   }
   if (!hasFilter) {
     return {
@@ -7708,14 +8266,24 @@ function runReadGraphQuery(rootDir, args) {
       hint: "No nodes matched. Check spelling, or call read_graph without filter to see the summary and available types/modules."
     };
   }
-  return {
+  const wantEdges = includeEdges ?? false;
+  const result = {
     layer,
     filter: { search, type, module: module_ },
     matched: matched.length,
     edge_count: matchedEdges.length,
-    nodes: minimal ? toMinimal(matched) : matched,
-    edges: matchedEdges
+    nodes: minimal ? toMinimal(matched) : matched
   };
+  if (wantEdges) {
+    result.edges = matchedEdges;
+  } else {
+    result.edges_hint = `${matchedEdges.length} edges between matched nodes omitted. Pass include_edges:true to retrieve them (only do this when you actually need edge data).`;
+  }
+  return result;
+}
+function runReadGraphQuery(rootDir, args) {
+  const raw = runReadGraphQueryRaw(rootDir, args);
+  return compactResult(raw);
 }
 function handleReadGraph(args) {
   const rootDir = process.cwd();
@@ -7724,16 +8292,57 @@ function handleReadGraph(args) {
     if (queries.length === 0) {
       return err("queries array is empty. Provide at least one query object.");
     }
-    const results = queries.map((q, i) => ({ index: i, query: q, result: runReadGraphQuery(rootDir, q) }));
-    return okJson({ batch: true, count: results.length, results });
+    const results = [];
+    let cumulativeChars = 0;
+    let budgetHit = false;
+    for (let i = 0; i < queries.length; i++) {
+      const q = queries[i];
+      if (budgetHit) {
+        results.push({
+          index: i,
+          query: q,
+          result: {
+            skipped: true,
+            reason: "batch_budget_exhausted",
+            hint: "Previous sub-results filled the batch budget. Re-run this query on its own."
+          }
+        });
+        continue;
+      }
+      const r = runReadGraphQuery(rootDir, q);
+      const entry = { index: i, query: q, result: r };
+      const entrySize = JSON.stringify(entry, null, 2).length;
+      if (cumulativeChars + entrySize > BATCH_BUDGET_CHARS && results.length > 0) {
+        budgetHit = true;
+        results.push({
+          index: i,
+          query: q,
+          result: {
+            skipped: true,
+            reason: "batch_budget_exhausted",
+            hint: "This sub-query would push the batch over its size budget. Re-run it on its own."
+          }
+        });
+      } else {
+        results.push(entry);
+        cumulativeChars += entrySize;
+      }
+    }
+    return okJson({
+      batch: true,
+      count: results.length,
+      cumulative_chars: cumulativeChars,
+      budget_hit: budgetHit,
+      results
+    });
   }
   const result = runReadGraphQuery(rootDir, args);
   return okJson(result);
 }
 function nodeToFilePath(rootDir, layer, nodeId) {
-  if (layer === "ui") return (0, import_node_path6.join)(rootDir, "src", nodeId);
-  if (layer === "api") return (0, import_node_path6.join)(rootDir, nodeId);
-  if (layer === "db") return (0, import_node_path6.join)(rootDir, "prisma", "schema.prisma");
+  if (layer === "ui") return (0, import_node_path7.join)(rootDir, "src", nodeId);
+  if (layer === "api") return (0, import_node_path7.join)(rootDir, nodeId);
+  if (layer === "db") return (0, import_node_path7.join)(rootDir, "prisma", "schema.prisma");
   return null;
 }
 function handleGrepNodes(args) {
@@ -7755,7 +8364,7 @@ function handleGrepNodes(args) {
   } catch (e) {
     return err(`Invalid regex: ${e.message}`);
   }
-  const queryResult = runReadGraphQuery(rootDir, {
+  const queryResult = runReadGraphQueryRaw(rootDir, {
     layer,
     search: args.search,
     type: args.type,
@@ -7793,11 +8402,11 @@ function handleGrepNodes(args) {
   let filesSearched = 0;
   let truncated = false;
   for (const [filePath, nodeId] of filePaths) {
-    if (!(0, import_node_fs6.existsSync)(filePath)) continue;
+    if (!(0, import_node_fs7.existsSync)(filePath)) continue;
     filesSearched++;
     let content;
     try {
-      content = (0, import_node_fs6.readFileSync)(filePath, "utf-8");
+      content = (0, import_node_fs7.readFileSync)(filePath, "utf-8");
     } catch {
       continue;
     }
@@ -7834,6 +8443,23 @@ function handleGrepNodes(args) {
     truncated
   });
 }
+function handleGetGraphUiUrl() {
+  const lock = getLiveLock();
+  if (!lock) {
+    return okJson({
+      running: false,
+      hint: "No launch-chart UI server is currently running. Start one with `launch-chart serve`, or set LAUNCH_CHART_AUTOSERVE=1 in your MCP config to auto-start it alongside the MCP server."
+    });
+  }
+  return okJson({
+    running: true,
+    url: lock.url,
+    port: lock.port,
+    pid: lock.pid,
+    cwd: lock.cwd,
+    startedAt: lock.startedAt
+  });
+}
 function send(msg) {
   process.stdout.write(JSON.stringify(msg) + "\n");
 }
@@ -7877,6 +8503,10 @@ function handleMessage(msg) {
       respond(id ?? null, handleGrepNodes(args));
       return;
     }
+    if (toolName === "get_graph_ui_url") {
+      respond(id ?? null, handleGetGraphUiUrl());
+      return;
+    }
     respondError(id ?? null, -32601, `Unknown tool: ${toolName}`);
     return;
   }