mstro-app 0.3.8 → 0.4.0

package/server/mcp/bouncer-cli.ts

@@ -0,0 +1,73 @@
+#!/usr/bin/env node
+// Copyright (c) 2025-present Mstro, Inc. All rights reserved.
+// Licensed under the MIT License. See LICENSE file for details.
+
+/**
+ * Bouncer CLI — stdin/stdout wrapper for Claude Code PreToolUse hooks.
+ *
+ * Reads a tool use request from stdin (JSON), runs it through the full
+ * 2-layer bouncer (pattern matching + Haiku AI), and writes the decision
+ * to stdout in the format Claude Code hooks expect.
+ *
+ * Input format (from Claude Code hook):
+ *   { "tool_name": "Bash", "input": { "command": "rm -rf /" } }
+ *
+ * Output format (to Claude Code hook):
+ *   { "decision": "allow"|"deny", "reason": "..." }
+ */
+
+import type { BouncerReviewRequest } from './bouncer-integration.js';
+import { reviewOperation } from './bouncer-integration.js';
+
+function buildOperation(toolName: string, toolInput: Record<string, unknown>): string {
+  const prefix = `${toolName}: `;
+  if (toolName === 'Bash' && toolInput.command) return prefix + String(toolInput.command);
+  if (toolName === 'Edit' && toolInput.file_path) return prefix + String(toolInput.file_path);
+  if (toolName === 'Write' && toolInput.file_path) return prefix + String(toolInput.file_path);
+  return prefix + JSON.stringify(toolInput).slice(0, 500);
+}
+
+async function evaluate(rawInput: string): Promise<{ decision: string; reason: string }> {
+  if (!rawInput.trim()) {
+    return { decision: 'allow', reason: 'Empty input' };
+  }
+
+  let parsed: { tool_name?: string; toolName?: string; input?: Record<string, unknown>; toolInput?: Record<string, unknown> };
+  try {
+    parsed = JSON.parse(rawInput);
+  } catch {
+    return { decision: 'allow', reason: 'Invalid JSON input' };
+  }
+
+  const toolName = parsed.tool_name || parsed.toolName || 'unknown';
+  const toolInput = parsed.input || parsed.toolInput || {};
+
+  const request: BouncerReviewRequest = {
+    operation: buildOperation(toolName, toolInput),
+    context: {
+      purpose: 'Tool use request from Claude Code hook',
+      workingDirectory: process.cwd(),
+      toolName,
+      toolInput,
+    },
+  };
+
+  const result = await reviewOperation(request);
+  return {
+    decision: result.decision === 'deny' ? 'deny' : 'allow',
+    reason: result.reasoning,
+  };
+}
+
+async function main(): Promise<void> {
+  let rawInput = '';
+  for await (const chunk of process.stdin) {
+    rawInput += chunk;
+  }
+  const result = await evaluate(rawInput);
+  console.log(JSON.stringify(result));
+}
+
+main().catch(() => {
+  console.log(JSON.stringify({ decision: 'allow', reason: 'Bouncer crash' }));
+});

package/server/services/plan/composer.ts

@@ -0,0 +1,199 @@
+// Copyright (c) 2025-present Mstro, Inc. All rights reserved.
+// Licensed under the MIT License. See LICENSE file for details.
+
+/**
+ * Plan Composer — Handles natural language prompts for PPS creation/editing.
+ *
+ * When a planPrompt message arrives, this builds a context-enriched prompt
+ * against the .pm/ (or legacy .plan/) directory and spawns a scoped
+ * HeadlessRunner session to execute it.
+ */
+
+import { existsSync, readFileSync } from 'node:fs';
+import { join } from 'node:path';
+import { runWithFileLogger } from '../../cli/headless/headless-logger.js';
+import { HeadlessRunner, type ToolUseEvent } from '../../cli/headless/index.js';
+import type { HandlerContext } from '../websocket/handler-context.js';
+import type { WSContext } from '../websocket/types.js';
+import { getNextId, parsePlanDirectory, resolvePmDir } from './parser.js';
+
+const PROMPT_TOOL_MESSAGES: Record<string, string> = {
+  Glob: 'Discovering project files...',
+  Read: 'Reading project structure...',
+  Grep: 'Searching codebase...',
+  Write: 'Creating project files...',
+  Edit: 'Updating project files...',
+  Bash: 'Running commands...',
+};
+
+function getPromptToolCompleteMessage(event: ToolUseEvent): string | null {
+  const input = event.completeInput;
+  if (!input) return null;
+  if (event.toolName === 'Write' && input.file_path) {
+    const filename = String(input.file_path).split('/').pop() ?? '';
+    return `Created ${filename}`;
+  }
+  if (event.toolName === 'Edit' && input.file_path) {
+    const filename = String(input.file_path).split('/').pop() ?? '';
+    return `Updated ${filename}`;
+  }
+  if (event.toolName === 'Read' && input.file_path) {
+    return `Read ${String(input.file_path).split('/').slice(-2).join('/')}`;
+  }
+  return null;
+}
+
+function createPromptProgressTracker() {
+  const seenToolStarts = new Set<string>();
+
+  return (event: ToolUseEvent): string | null => {
+    if (event.type === 'tool_start' && event.toolName) {
+      if (seenToolStarts.has(event.toolName)) return null;
+      seenToolStarts.add(event.toolName);
+      return PROMPT_TOOL_MESSAGES[event.toolName] ?? null;
+    }
+    if (event.type === 'tool_complete') return getPromptToolCompleteMessage(event);
+    return null;
+  };
+}
+
+function readFileOrEmpty(path: string): string {
+  try {
+    if (existsSync(path)) return readFileSync(path, 'utf-8');
+  } catch { /* skip */ }
+  return '';
+}
+
+export async function handlePlanPrompt(
+  ctx: HandlerContext,
+  ws: WSContext,
+  userPrompt: string,
+  workingDir: string,
+): Promise<void> {
+  const pmDir = resolvePmDir(workingDir) ?? join(workingDir, '.pm');
+  const stateContent = readFileOrEmpty(join(pmDir, 'STATE.md'));
+  const projectContent = readFileOrEmpty(join(pmDir, 'project.md'));
+
+  // Compute next available IDs
+  const fullState = parsePlanDirectory(workingDir);
+  let idInfo = '';
+  if (fullState) {
+    const nextIS = getNextId(fullState.issues, 'IS');
+    const nextBG = getNextId(fullState.issues, 'BG');
+    const nextEP = getNextId(fullState.issues, 'EP');
+    idInfo = `Next available IDs: ${nextIS}, ${nextBG}, ${nextEP}`;
+  }
+
+  // Read existing epic files to provide context
+  let epicContext = '';
+  if (fullState) {
+    const existingEpics = fullState.issues.filter((i: { type: string }) => i.type === 'epic');
+    if (existingEpics.length > 0) {
+      epicContext = `\nExisting epics:\n${existingEpics.map((e: { id: string; title: string; path: string; children: string[] }) => `- ${e.id}: ${e.title} (${e.path}, children: ${e.children.length})`).join('\n')}\n`;
+    }
+  }
+
+  const enrichedPrompt = `You are managing a project in the .pm/ directory format (Project Plan Spec).
+The project's current state is:
+
+<state>
+${stateContent || 'No STATE.md exists yet'}
+</state>
+
+<project>
+${projectContent || 'No project.md yet'}
+</project>
+
+${idInfo}
+${epicContext}
+
+Follow these rules:
+- When creating .pm/ files, use YAML front matter + markdown body
+- When modifying issues, preserve all existing YAML fields you don't change
+- After any state change, update STATE.md to reflect the new status
+- Use the next available ID for new entities
+- Respond briefly describing what you did
+
+Issue scoping rules (critical for execution quality):
+- Each issue is executed by a single AI agent with its own context window
+- Issues estimated at 1-3 story points execute well (focused, single concern)
+- Issues at 5 story points are viable if scoped to one subsystem
+- Issues at 8+ story points MUST be decomposed into smaller sub-issues
+- Issues at 13+ story points MUST become an epic with child issues
+- Each issue should touch one logical concern (one component, one service, one data flow)
+- If an issue requires work across multiple subsystems, split it into one issue per subsystem with blocked_by edges between them
+- Research/investigation issues should be separate from implementation issues
+
+Epic creation rules (when user asks for a feature with sub-tasks or an epic):
+- Create an EP-*.md file in .pm/backlog/ with type: epic and a children: [] field in front matter
+- Create individual IS-*.md (or BG-*.md) files for each child issue
+- Each child issue must have epic: backlog/EP-XXX.md in its front matter
+- The epic's children field must list all child paths: [backlog/IS-001.md, backlog/IS-002.md, ...]
+- Set blocked_by between child issues where there are natural dependencies
+- Give each child issue clear acceptance criteria and files to modify when possible
+- Set appropriate priorities (P0-P3) based on the issue's importance within the epic
+
+User request: ${userPrompt}`;
+
+  try {
+    ctx.broadcastToAll({
+      type: 'planPromptProgress',
+      data: { message: 'Starting project planning...' },
+    });
+
+    const runner = new HeadlessRunner({
+      workingDir,
+      directPrompt: enrichedPrompt,
+      outputCallback: (text: string) => {
+        ctx.send(ws, {
+          type: 'planPromptStreaming',
+          data: { token: text },
+        });
+      },
+      toolUseCallback: (() => {
+        const getProgressMessage = createPromptProgressTracker();
+        return (event: ToolUseEvent) => {
+          const message = getProgressMessage(event);
+          if (message) {
+            ctx.broadcastToAll({
+              type: 'planPromptProgress',
+              data: { message },
+            });
+          }
+        };
+      })(),
+    });
+
+    ctx.broadcastToAll({
+      type: 'planPromptProgress',
+      data: { message: 'Claude is planning your project...' },
+    });
+
+    const result = await runWithFileLogger('pm-compose', () => runner.run());
+
+    ctx.broadcastToAll({
+      type: 'planPromptProgress',
+      data: { message: 'Finalizing project plan...' },
+    });
+
+    ctx.send(ws, {
+      type: 'planPromptResponse',
+      data: {
+        response: result.completed ? 'Prompt executed successfully.' : (result.error || 'Unknown error'),
+        success: result.completed,
+        error: result.error || null,
+      },
+    });
+
+    // Re-parse and broadcast updated state
+    const updatedState = parsePlanDirectory(workingDir);
+    if (updatedState) {
+      ctx.broadcastToAll({ type: 'planStateUpdated', data: updatedState });
+    }
+  } catch (error) {
+    ctx.send(ws, {
+      type: 'planError',
+      data: { error: error instanceof Error ? error.message : String(error) },
+    });
+  }
+}

package/server/services/plan/dependency-resolver.ts

@@ -0,0 +1,182 @@
+// Copyright (c) 2025-present Mstro, Inc. All rights reserved.
+// Licensed under the MIT License. See LICENSE file for details.
+
+/**
+ * Dependency Resolver — Validates and computes the dependency DAG.
+ *
+ * Builds adjacency list from blocked_by/blocks fields, detects cycles,
+ * and computes the "ready to work" set.
+ */
+
+import type { Issue } from './types.js';
+
+/**
+ * Detect cycles in the dependency graph.
+ * Returns the first cycle found as an array of issue IDs, or null if acyclic.
+ */
+export function detectCycles(issues: Issue[]): string[] | null {
+  const issueByPath = new Map<string, Issue>();
+  for (const issue of issues) {
+    issueByPath.set(issue.path, issue);
+  }
+
+  // DFS with coloring: 0=white, 1=gray, 2=black
+  const color = new Map<string, number>();
+  const parent = new Map<string, string>();
+
+  for (const issue of issues) {
+    color.set(issue.path, 0);
+  }
+
+  for (const issue of issues) {
+    if (color.get(issue.path) === 0) {
+      const cycle = dfs(issue.path, issueByPath, color, parent);
+      if (cycle) return cycle;
+    }
+  }
+
+  return null;
+}
+
+function dfs(
+  path: string,
+  issueByPath: Map<string, Issue>,
+  color: Map<string, number>,
+  parent: Map<string, string>,
+): string[] | null {
+  color.set(path, 1); // Gray
+  const issue = issueByPath.get(path);
+  if (!issue) {
+    color.set(path, 2);
+    return null;
+  }
+
+  for (const dep of issue.blocks) {
+    if (!issueByPath.has(dep)) continue;
+    const depColor = color.get(dep);
+    if (depColor === 1) {
+      // Found cycle — reconstruct
+      const cycle = [dep, path];
+      let cur = path;
+      while (parent.has(cur) && parent.get(cur) !== dep) {
+        cur = parent.get(cur)!;
+        cycle.push(cur);
+      }
+      return cycle.map(p => issueByPath.get(p)?.id || p);
+    }
+    if (depColor === 0) {
+      parent.set(dep, path);
+      const cycle = dfs(dep, issueByPath, color, parent);
+      if (cycle) return cycle;
+    }
+  }
+
+  color.set(path, 2); // Black
+  return null;
+}
+
+/**
+ * Compute the set of issues that are ready to work on.
+ * An issue is ready if:
+ * - It's not an epic
+ * - Its status is backlog or todo (not started, done, or cancelled)
+ * - All its blocked_by items are done or cancelled
+ *
+ * If epicScope is provided, only returns issues belonging to that epic.
+ */
+export function resolveReadyToWork(issues: Issue[], epicScope?: string): Issue[] {
+  const issueByPath = new Map<string, Issue>();
+  for (const issue of issues) {
+    issueByPath.set(issue.path, issue);
+  }
+
+  const readyStatuses = new Set(['backlog', 'todo']);
+  const doneStatuses = new Set(['done', 'cancelled']);
+
+  const priorityOrder: Record<string, number> = { P0: 0, P1: 1, P2: 2, P3: 3 };
+
+  // Build set of child paths for epic scoping
+  let epicChildPaths: Set<string> | null = null;
+  if (epicScope) {
+    const epic = issueByPath.get(epicScope);
+    if (epic) {
+      epicChildPaths = new Set(epic.children);
+      // Also include issues that reference this epic via their epic field
+      for (const issue of issues) {
+        if (issue.epic === epicScope) epicChildPaths.add(issue.path);
+      }
+    }
+  }
+
+  return issues
+    .filter(issue => {
+      if (issue.type === 'epic') return false;
+      if (!readyStatuses.has(issue.status)) return false;
+
+      // If scoped to an epic, only include that epic's children
+      if (epicChildPaths && !epicChildPaths.has(issue.path)) return false;
+
+      // Check all blockers are resolved
+      if (issue.blockedBy.length > 0) {
+        const allResolved = issue.blockedBy.every(bp => {
+          const blocker = issueByPath.get(bp);
+          return blocker && doneStatuses.has(blocker.status);
+        });
+        if (!allResolved) return false;
+      }
+
+      return true;
+    })
+    .sort((a, b) => {
+      // Sort by priority (P0 first)
+      return (priorityOrder[a.priority] ?? 9) - (priorityOrder[b.priority] ?? 9);
+    });
+}
+
+/**
+ * Compute the critical path through incomplete issues.
+ * Returns the longest chain of dependent issues.
+ */
+export function computeCriticalPath(issues: Issue[]): Issue[] {
+  const issueByPath = new Map<string, Issue>();
+  for (const issue of issues) {
+    issueByPath.set(issue.path, issue);
+  }
+
+  const doneStatuses = new Set(['done', 'cancelled']);
+  const incompleteIssues = issues.filter(i => !doneStatuses.has(i.status) && i.type !== 'epic');
+
+  // Compute longest path using DFS with memoization
+  const longestFrom = new Map<string, Issue[]>();
+
+  function getLongest(path: string): Issue[] {
+    if (longestFrom.has(path)) return longestFrom.get(path)!;
+
+    const issue = issueByPath.get(path);
+    if (!issue || doneStatuses.has(issue.status)) {
+      longestFrom.set(path, []);
+      return [];
+    }
+
+    // Set sentinel before recursing to break cycles
+    longestFrom.set(path, [issue]);
+
+    let best: Issue[] = [];
+    for (const dep of issue.blocks) {
+      const sub = getLongest(dep);
+      if (sub.length > best.length) best = sub;
+    }
+
+    const result = [issue, ...best];
+    longestFrom.set(path, result);
+    return result;
+  }
+
+  let criticalPath: Issue[] = [];
+  for (const issue of incompleteIssues) {
+    const path = getLongest(issue.path);
+    if (path.length > criticalPath.length) criticalPath = path;
+  }
+
+  return criticalPath;
+}