beads/cmd/bd/dep_embedded_test.go
gascity-eddie[bot] 6db46664da
test(cmd/bd): pin mixed-case dep tree --format Mermaid through the CLI (#7697)
* test(cmd/bd): pin mixed-case dep tree --format Mermaid through the CLI

TestDepTreeFormatMermaidCaseInsensitive calls isMermaidTreeFormat directly,
so reverting the runDepTree dispatch to formatStr == "mermaid" (the PR #6646
bug) kept every test green. Add a --format Mermaid call to the embedded
tree_format_mermaid subtest so the flag-to-renderer wiring is pinned.

AC: AC-1
AC: AC-2

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
(cherry picked from commit c325246d4a)

Ported-From: opus/c325246d4a8e4cd5f60f9548053b5385e20a4d2e
AC: AC-1

* test(cmd/bd): record AC-2 mutant evidence for the mixed-case pin

No code change: AC-2 is the mutant-killing property of the row added in
the AC-1 commit. Evidence (bazel test //cmd/bd:bd_test --config=ci
--test_filter='TestDepTreeFormat|TestEmbeddedDepBTreeAndCycles/tree_format_mermaid'
--test_arg=-test.skip= --test_env=BEADS_TEST_EMBEDDED_DOLT=1
--test_output=all):

- Mutant M1 (cmd/bd/dep_tree.go:153 changed to formatStr == "mermaid",
  isMermaidTreeFormat left intact), row absent: all targeted tests pass —
  the hole.
- M1 applied, row present: TestEmbeddedDepBTreeAndCycles/tree_format_mermaid
  FAILS with the plain-text fall-through header ("Dependency tree for"),
  while TestDepTreeFormatMermaidCaseInsensitive, TestDepTreeFormatFlag and
  the lowercase e2e row stay green.
- M1 reverted, row kept: all pass; no SKIPs in any run.

AC: AC-2
Agent-Signature: claude-code-glm-5.3-unknown-reasoning on behalf of Julian Knutsen
Co-Authored-By: Claude Code <noreply@anthropic.com>
(cherry picked from commit 38df0c5b22)

Ported-From: glm/38df0c5b224c41fa312dd130b8e7fe378d74b0b4
AC: AC-2

---------

Co-authored-by: Julian Knutsen <julianknutsen@users.noreply.github.com>
2026-10-19 08:36:16 +00:00

790 lines
29 KiB
Go

//go:build cgo
package main
import (
"encoding/json"
"fmt"
"os"
"os/exec"
"path/filepath"
"strings"
"sync"
"testing"
"github.com/steveyegge/beads/internal/configfile"
"github.com/steveyegge/beads/internal/storage/embeddeddolt"
)
// bdDep runs "bd dep" with the given args and returns raw stdout.
func bdDep(t *testing.T, bd, dir string, args ...string) string {
t.Helper()
fullArgs := append([]string{"dep"}, args...)
cmd := exec.Command(bd, fullArgs...)
cmd.Dir = dir
cmd.Env = bdEnv(dir)
stdout, stderr, err := runCommandBuffers(t, cmd)
if err != nil {
t.Fatalf("bd dep %s failed: %v\nstdout:\n%s\nstderr:\n%s", strings.Join(args, " "), err, stdout.String(), stderr.String())
}
return stdout.String()
}
// bdDepFail runs "bd dep" expecting failure.
func bdDepFail(t *testing.T, bd, dir string, args ...string) string {
t.Helper()
fullArgs := append([]string{"dep"}, args...)
cmd := exec.Command(bd, fullArgs...)
cmd.Dir = dir
cmd.Env = bdEnv(dir)
out, err := cmd.CombinedOutput()
if err == nil {
t.Fatalf("expected bd dep %s to fail, but succeeded:\n%s", strings.Join(args, " "), out)
}
return string(out)
}
// bdDepJSON runs "bd dep" with --json and parses the result.
func bdDepJSON(t *testing.T, bd, dir string, args ...string) map[string]interface{} {
t.Helper()
fullArgs := append([]string{"dep"}, args...)
fullArgs = append(fullArgs, "--json")
cmd := exec.Command(bd, fullArgs...)
cmd.Dir = dir
cmd.Env = bdEnv(dir)
stdout, stderr, err := runCommandBuffers(t, cmd)
if err != nil {
t.Fatalf("bd dep --json %s failed: %v\nstdout:\n%s\nstderr:\n%s", strings.Join(args, " "), err, stdout.String(), stderr.String())
}
s := strings.TrimSpace(stdout.String())
start := strings.IndexAny(s, "{[")
if start < 0 {
t.Fatalf("no JSON in dep output: %s", s)
}
var m map[string]interface{}
if err := json.Unmarshal([]byte(s[start:]), &m); err != nil {
t.Fatalf("parse dep JSON: %v\n%s", err, s)
}
return m
}
func bdDepWithInput(t *testing.T, bd, dir, input string, args ...string) string {
t.Helper()
fullArgs := append([]string{"dep"}, args...)
cmd := exec.Command(bd, fullArgs...)
cmd.Dir = dir
cmd.Env = bdEnv(dir)
cmd.Stdin = strings.NewReader(input)
stdout, stderr, err := runCommandBuffers(t, cmd)
if err != nil {
t.Fatalf("bd dep %s failed: %v\nstdout:\n%s\nstderr:\n%s", strings.Join(args, " "), err, stdout.String(), stderr.String())
}
return stdout.String()
}
// bdDepWithInputFail runs "bd dep" with stdin input expecting failure.
func bdDepWithInputFail(t *testing.T, bd, dir, input string, args ...string) string {
t.Helper()
fullArgs := append([]string{"dep"}, args...)
cmd := exec.Command(bd, fullArgs...)
cmd.Dir = dir
cmd.Env = bdEnv(dir)
cmd.Stdin = strings.NewReader(input)
out, err := cmd.CombinedOutput()
if err == nil {
t.Fatalf("expected bd dep %s to fail, but succeeded:\n%s", strings.Join(args, " "), out)
}
return string(out)
}
// The TestEmbeddedDepA* and TestEmbeddedDepB* tests were split from
// TestEmbeddedDep (originally ~317s, measured under --config=embedded), first
// into TestEmbeddedDepA and TestEmbeddedDepB and then (~95s each on
// rbe-west) into these 6 top-level tests over disjoint subtest groups, for
// CI shard balance (see scripts/ci/embedded_cmd_test_durations.json and
// engdocs/TESTING.md). Every original subtest is preserved exactly once. The
// "list_*" subtests (which assert on dependencies added by
// "add_positional_args" / "add_type_parent_child") stay with those subtests
// and the shared pre-created issues in TestEmbeddedDepAAddAndList, and the
// tree_* subtests with the pre-wired graph in TestEmbeddedDepBTreeAndCycles;
// the subtests that create every issue they use run in their own workspace.
func TestEmbeddedDepAAddAndList(t *testing.T) {
if os.Getenv("BEADS_TEST_EMBEDDED_DOLT") != "1" {
t.Skip("set BEADS_TEST_EMBEDDED_DOLT=1 to run embedded dolt integration tests")
}
t.Parallel()
bd := buildEmbeddedBD(t)
dir, _, _ := bdInit(t, bd, "--prefix", "dp")
// Pre-create issues for dependency testing.
issueA := bdCreate(t, bd, dir, "Dep issue A", "--type", "task")
issueB := bdCreate(t, bd, dir, "Dep issue B", "--type", "task")
issueC := bdCreate(t, bd, dir, "Dep issue C", "--type", "task")
issueD := bdCreate(t, bd, dir, "Dep issue D", "--type", "task")
epic := bdCreate(t, bd, dir, "Dep epic", "--type", "epic")
child1 := bdCreate(t, bd, dir, "Dep child 1", "--type", "task")
child2 := bdCreate(t, bd, dir, "Dep child 2", "--type", "task")
// ===== dep --blocks =====
t.Run("root_blocks_flag", func(t *testing.T) {
out := bdDep(t, bd, dir, issueA.ID, "--blocks", issueB.ID)
if !strings.Contains(out, "Added") || !strings.Contains(out, "blocks") {
t.Errorf("expected 'Added ... blocks' output: %s", out)
}
})
// ===== dep add =====
t.Run("add_positional_args", func(t *testing.T) {
out := bdDep(t, bd, dir, "add", issueC.ID, issueD.ID)
if !strings.Contains(out, "Added dependency") {
t.Errorf("expected 'Added dependency': %s", out)
}
})
t.Run("add_type_parent_child", func(t *testing.T) {
bdDep(t, bd, dir, "add", child1.ID, epic.ID, "--type", "parent-child")
bdDep(t, bd, dir, "add", child2.ID, epic.ID, "--type", "parent-child")
// Verify via dep list
out := bdDep(t, bd, dir, "list", epic.ID, "--direction", "up")
if !strings.Contains(out, child1.ID) {
t.Errorf("expected child1 in dependents: %s", out)
}
})
// ===== dep list =====
t.Run("list_default_direction_down", func(t *testing.T) {
// issueC depends on issueD (added earlier)
out := bdDep(t, bd, dir, "list", issueC.ID)
if !strings.Contains(out, issueD.ID) {
t.Errorf("expected dependency in list output: %s", out)
}
})
t.Run("list_direction_up", func(t *testing.T) {
out := bdDep(t, bd, dir, "list", issueD.ID, "--direction", "up")
if !strings.Contains(out, issueC.ID) {
t.Errorf("expected dependent in list --direction up: %s", out)
}
})
t.Run("list_type_filter", func(t *testing.T) {
out := bdDep(t, bd, dir, "list", epic.ID, "--direction", "up", "--type", "parent-child")
if !strings.Contains(out, child1.ID) || !strings.Contains(out, child2.ID) {
t.Errorf("expected children in type-filtered list: %s", out)
}
})
t.Run("list_json_output", func(t *testing.T) {
fullArgs := []string{"dep", "list", issueC.ID, "--json"}
cmd := exec.Command(bd, fullArgs...)
cmd.Dir = dir
cmd.Env = bdEnv(dir)
stdout, stderr, err := runCommandBuffers(t, cmd)
if err != nil {
t.Fatalf("dep list --json failed: %v\nstdout:\n%s\nstderr:\n%s", err, stdout.String(), stderr.String())
}
if !strings.Contains(stdout.String(), issueD.ID) {
t.Errorf("expected dependency ID in JSON: %s", stdout.String())
}
})
}
func TestEmbeddedDepAAddTypesAndFlags(t *testing.T) {
if os.Getenv("BEADS_TEST_EMBEDDED_DOLT") != "1" {
t.Skip("set BEADS_TEST_EMBEDDED_DOLT=1 to run embedded dolt integration tests")
}
t.Parallel()
bd := buildEmbeddedBD(t)
dir, _, _ := bdInit(t, bd, "--prefix", "dp")
t.Run("add_type_tracks", func(t *testing.T) {
tracker := bdCreate(t, bd, dir, "Tracker", "--type", "task")
tracked := bdCreate(t, bd, dir, "Tracked", "--type", "task")
bdDep(t, bd, dir, "add", tracker.ID, tracked.ID, "--type", "tracks")
out := bdDep(t, bd, dir, "list", tracker.ID)
if !strings.Contains(out, tracked.ID) {
t.Errorf("expected tracked issue in deps: %s", out)
}
})
t.Run("add_type_related", func(t *testing.T) {
r1 := bdCreate(t, bd, dir, "Related 1", "--type", "task")
r2 := bdCreate(t, bd, dir, "Related 2", "--type", "task")
bdDep(t, bd, dir, "add", r1.ID, r2.ID, "--type", "related")
// Should succeed without error
})
t.Run("add_blocked_by_flag", func(t *testing.T) {
x := bdCreate(t, bd, dir, "Blocked by test", "--type", "task")
y := bdCreate(t, bd, dir, "Blocker test", "--type", "task")
bdDep(t, bd, dir, "add", x.ID, "--blocked-by", y.ID)
out := bdDep(t, bd, dir, "list", x.ID)
if !strings.Contains(out, y.ID) {
t.Errorf("expected blocker in deps: %s", out)
}
})
t.Run("add_depends_on_flag", func(t *testing.T) {
x := bdCreate(t, bd, dir, "Depends on test", "--type", "task")
y := bdCreate(t, bd, dir, "Dependency test", "--type", "task")
bdDep(t, bd, dir, "add", x.ID, "--depends-on", y.ID)
out := bdDep(t, bd, dir, "list", x.ID)
if !strings.Contains(out, y.ID) {
t.Errorf("expected dependency in deps: %s", out)
}
})
}
func TestEmbeddedDepAAddRejectionsAndBulk(t *testing.T) {
if os.Getenv("BEADS_TEST_EMBEDDED_DOLT") != "1" {
t.Skip("set BEADS_TEST_EMBEDDED_DOLT=1 to run embedded dolt integration tests")
}
t.Parallel()
bd := buildEmbeddedBD(t)
dir, _, _ := bdInit(t, bd, "--prefix", "dp")
t.Run("add_cycle_rejected", func(t *testing.T) {
// A->B already exists, add B->A to create cycle — should be rejected
cyA := bdCreate(t, bd, dir, "Cycle A", "--type", "task")
cyB := bdCreate(t, bd, dir, "Cycle B", "--type", "task")
bdDep(t, bd, dir, "add", cyA.ID, cyB.ID)
out := bdDepFail(t, bd, dir, "add", cyB.ID, cyA.ID)
if !strings.Contains(out, "cycle") {
t.Errorf("expected 'cycle' error: %s", out)
}
})
t.Run("add_child_parent_antipattern", func(t *testing.T) {
p := bdCreate(t, bd, dir, "AP Parent", "--type", "epic")
// Create child with hierarchical ID
c := bdCreate(t, bd, dir, "AP Child", "--type", "task")
bdDep(t, bd, dir, "add", c.ID, p.ID, "--type", "parent-child")
// Try to add child->parent blocking dep (should fail)
bdDepFail(t, bd, dir, "add", c.ID, p.ID)
})
t.Run("add_json_output", func(t *testing.T) {
j1 := bdCreate(t, bd, dir, "JSON dep A", "--type", "task")
j2 := bdCreate(t, bd, dir, "JSON dep B", "--type", "task")
m := bdDepJSON(t, bd, dir, "add", j1.ID, j2.ID)
if m["status"] != "added" {
t.Errorf("expected status=added, got %v", m["status"])
}
})
t.Run("add_bulk_file_jsonl", func(t *testing.T) {
b1 := bdCreate(t, bd, dir, "Bulk dep A", "--type", "task")
b2 := bdCreate(t, bd, dir, "Bulk dep B", "--type", "task")
b3 := bdCreate(t, bd, dir, "Bulk dep C", "--type", "task")
path := filepath.Join(t.TempDir(), "deps.jsonl")
body := fmt.Sprintf("{\"from\":%q,\"to\":%q}\n{\"issue_id\":%q,\"depends_on_id\":%q,\"type\":\"tracks\"}\n", b1.ID, b2.ID, b3.ID, b2.ID)
if err := os.WriteFile(path, []byte(body), 0o600); err != nil {
t.Fatalf("write deps file: %v", err)
}
out := bdDep(t, bd, dir, "add", "--file", path)
if !strings.Contains(out, "Added 2 dependencies") {
t.Fatalf("expected bulk add summary, got: %s", out)
}
list1 := bdDep(t, bd, dir, "list", b1.ID)
if !strings.Contains(list1, b2.ID) {
t.Fatalf("expected first bulk dependency in list: %s", list1)
}
list3 := bdDep(t, bd, dir, "list", b3.ID)
if !strings.Contains(list3, b2.ID) || !strings.Contains(list3, "tracks") {
t.Fatalf("expected typed bulk dependency in list: %s", list3)
}
})
t.Run("add_bulk_file_validation_no_partial_mutation", func(t *testing.T) {
v1 := bdCreate(t, bd, dir, "Bulk validation A", "--type", "task")
v2 := bdCreate(t, bd, dir, "Bulk validation B", "--type", "task")
path := filepath.Join(t.TempDir(), "bad-deps.jsonl")
body := fmt.Sprintf("{\"from\":%q,\"to\":%q}\n{\"from\":\"\",\"to\":%q}\n{\"from\":%q,\"to\":\"\"}\n", v1.ID, v2.ID, v2.ID, v1.ID)
if err := os.WriteFile(path, []byte(body), 0o600); err != nil {
t.Fatalf("write bad deps file: %v", err)
}
out := bdDepFail(t, bd, dir, "add", "--file", path)
if !strings.Contains(out, "line 2: missing from") || !strings.Contains(out, "line 3: missing to") {
t.Fatalf("expected all validation errors, got: %s", out)
}
list := bdDep(t, bd, dir, "list", v1.ID)
if strings.Contains(list, v2.ID) {
t.Fatalf("bulk validation failure should not add valid rows: %s", list)
}
})
}
func TestEmbeddedDepBTreeAndCycles(t *testing.T) {
if os.Getenv("BEADS_TEST_EMBEDDED_DOLT") != "1" {
t.Skip("set BEADS_TEST_EMBEDDED_DOLT=1 to run embedded dolt integration tests")
}
t.Parallel()
bd := buildEmbeddedBD(t)
dir, _, _ := bdInit(t, bd, "--prefix", "dp")
// Pre-create issues for dependency testing.
_ = bdCreate(t, bd, dir, "Dep issue A", "--type", "task")
_ = bdCreate(t, bd, dir, "Dep issue B", "--type", "task")
issueC := bdCreate(t, bd, dir, "Dep issue C", "--type", "task")
issueD := bdCreate(t, bd, dir, "Dep issue D", "--type", "task")
epic := bdCreate(t, bd, dir, "Dep epic", "--type", "epic")
child1 := bdCreate(t, bd, dir, "Dep child 1", "--type", "task")
child2 := bdCreate(t, bd, dir, "Dep child 2", "--type", "task")
// Wire up the same parent-child/blocks edges TestEmbeddedDepA builds, so
// the tree_* subtests below exercise real multi-node traversal instead of
// rendering isolated single-node trees (see review S2: these subtests
// previously passed vacuously against an edgeless graph).
bdDep(t, bd, dir, "add", child1.ID, epic.ID, "--type", "parent-child")
bdDep(t, bd, dir, "add", child2.ID, epic.ID, "--type", "parent-child")
bdDep(t, bd, dir, "add", issueC.ID, issueD.ID)
// ===== dep tree =====
t.Run("tree_basic", func(t *testing.T) {
out := bdDep(t, bd, dir, "tree", epic.ID)
if !strings.Contains(out, epic.ID) {
t.Errorf("expected epic ID in tree: %s", out)
}
})
t.Run("tree_direction_up", func(t *testing.T) {
out := bdDep(t, bd, dir, "tree", child1.ID, "--direction", "up")
if len(out) == 0 {
t.Error("expected non-empty tree output")
}
})
t.Run("tree_direction_both", func(t *testing.T) {
out := bdDep(t, bd, dir, "tree", epic.ID, "--direction", "both")
if len(out) == 0 {
t.Error("expected non-empty tree output for --direction both")
}
})
t.Run("tree_max_depth", func(t *testing.T) {
out := bdDep(t, bd, dir, "tree", epic.ID, "--max-depth", "1")
// Should show epic but not recurse deeply
if !strings.Contains(out, epic.ID) {
t.Errorf("expected epic in shallow tree: %s", out)
}
})
t.Run("tree_status_filter", func(t *testing.T) {
// Filter to open only — should still work
bdDep(t, bd, dir, "tree", epic.ID, "--status", "open")
// Just verify no crash
})
t.Run("tree_format_mermaid", func(t *testing.T) {
out := bdDep(t, bd, dir, "tree", epic.ID, "--format", "mermaid")
if !strings.Contains(out, "flowchart") && !strings.Contains(out, "graph") {
t.Errorf("expected mermaid flowchart/graph syntax: %s", out)
}
// Mixed-case pins case-folding at the runDepTree dispatch site.
// TestDepTreeFormatMermaidCaseInsensitive calls isMermaidTreeFormat
// directly and would stay green if the call site went back to
// formatStr == "mermaid" (the PR #6646 bug).
mixed := bdDep(t, bd, dir, "tree", epic.ID, "--format", "Mermaid")
if !strings.Contains(mixed, "flowchart") && !strings.Contains(mixed, "graph") {
t.Errorf("expected mermaid flowchart/graph syntax for --format Mermaid: %s", mixed)
}
})
t.Run("tree_json_output", func(t *testing.T) {
fullArgs := []string{"dep", "tree", epic.ID, "--json"}
cmd := exec.Command(bd, fullArgs...)
cmd.Dir = dir
cmd.Env = bdEnv(dir)
stdout, stderr, err := runCommandBuffers(t, cmd)
if err != nil {
t.Fatalf("dep tree --json failed: %v\nstdout:\n%s\nstderr:\n%s", err, stdout.String(), stderr.String())
}
if !strings.Contains(stdout.String(), epic.ID) {
t.Errorf("expected epic ID in JSON tree: %s", stdout.String())
}
})
// ===== dep cycles =====
t.Run("cycles_detect", func(t *testing.T) {
// We created a cycle earlier (cyA <-> cyB)
out := bdDep(t, bd, dir, "cycles")
// Should report at least one cycle
if !strings.Contains(out, "cycle") && !strings.Contains(out, "Cycle") && !strings.Contains(out, "No cycles") {
t.Errorf("expected cycle info in output: %s", out)
}
})
}
func TestEmbeddedDepBRemove(t *testing.T) {
if os.Getenv("BEADS_TEST_EMBEDDED_DOLT") != "1" {
t.Skip("set BEADS_TEST_EMBEDDED_DOLT=1 to run embedded dolt integration tests")
}
t.Parallel()
bd := buildEmbeddedBD(t)
dir, _, _ := bdInit(t, bd, "--prefix", "dp")
// ===== dep remove =====
t.Run("remove_basic", func(t *testing.T) {
r1 := bdCreate(t, bd, dir, "Remove A", "--type", "task")
r2 := bdCreate(t, bd, dir, "Remove B", "--type", "task")
bdDep(t, bd, dir, "add", r1.ID, r2.ID)
out := bdDep(t, bd, dir, "remove", r1.ID, r2.ID)
if !strings.Contains(out, "Removed") {
t.Errorf("expected 'Removed' in output: %s", out)
}
})
t.Run("remove_rm_alias", func(t *testing.T) {
r1 := bdCreate(t, bd, dir, "Rm A", "--type", "task")
r2 := bdCreate(t, bd, dir, "Rm B", "--type", "task")
bdDep(t, bd, dir, "add", r1.ID, r2.ID)
out := bdDep(t, bd, dir, "rm", r1.ID, r2.ID)
if !strings.Contains(out, "Removed") {
t.Errorf("expected 'Removed' via rm alias: %s", out)
}
})
}
func TestEmbeddedDepBRemoveOutputAndRelatesTo(t *testing.T) {
if os.Getenv("BEADS_TEST_EMBEDDED_DOLT") != "1" {
t.Skip("set BEADS_TEST_EMBEDDED_DOLT=1 to run embedded dolt integration tests")
}
t.Parallel()
bd := buildEmbeddedBD(t)
dir, _, _ := bdInit(t, bd, "--prefix", "dp")
t.Run("remove_json_output", func(t *testing.T) {
r1 := bdCreate(t, bd, dir, "RmJSON A", "--type", "task")
r2 := bdCreate(t, bd, dir, "RmJSON B", "--type", "task")
bdDep(t, bd, dir, "add", r1.ID, r2.ID)
m := bdDepJSON(t, bd, dir, "remove", r1.ID, r2.ID)
if m["status"] != "removed" {
t.Errorf("expected status=removed, got %v", m["status"])
}
if m["removed"] != true {
t.Errorf("expected removed=true, got %v", m["removed"])
}
})
t.Run("remove_missing_edge_reports_noop", func(t *testing.T) {
r1 := bdCreate(t, bd, dir, "Missing edge A", "--type", "task")
r2 := bdCreate(t, bd, dir, "Missing edge B", "--type", "task")
out := bdDep(t, bd, dir, "remove", r1.ID, r2.ID)
if !strings.Contains(out, "No dependency found") || strings.Contains(out, "✓") {
t.Errorf("missing edge should report a no-op, got: %s", out)
}
m := bdDepJSON(t, bd, dir, "remove", r1.ID, r2.ID)
if m["status"] != "not_found" || m["removed"] != false {
t.Errorf("missing edge JSON = %v, want status=not_found removed=false", m)
}
})
t.Run("tree_ignores_bidirectional_relates_to", func(t *testing.T) {
root := bdCreate(t, bd, dir, "Tree relates root", "--type", "task")
blocker := bdCreate(t, bd, dir, "Tree real blocker", "--type", "task")
related := bdCreate(t, bd, dir, "Tree loose relation", "--type", "task")
bdDep(t, bd, dir, "add", root.ID, blocker.ID, "--type", "blocks")
bdDep(t, bd, dir, "add", root.ID, related.ID, "--type", "relates-to")
bdDep(t, bd, dir, "add", related.ID, root.ID, "--type", "relates-to")
listOut := bdDep(t, bd, dir, "list", root.ID)
if !strings.Contains(listOut, related.ID) || !strings.Contains(listOut, "relates-to") {
t.Fatalf("expected relates-to edge in dep list output: %s", listOut)
}
treeOut := bdDep(t, bd, dir, "tree", root.ID)
if !strings.Contains(treeOut, root.ID) || !strings.Contains(treeOut, blocker.ID) {
t.Fatalf("expected root and real blocker in dep tree: %s", treeOut)
}
if strings.Contains(treeOut, related.ID) {
t.Fatalf("relates-to edge should not render as a dependency tree edge: %s", treeOut)
}
upOut := bdDep(t, bd, dir, "tree", related.ID, "--direction", "up")
if strings.Contains(upOut, root.ID) {
t.Fatalf("reverse relates-to edge should not render as a dependent tree edge: %s", upOut)
}
})
t.Run("cycles_no_cycles", func(t *testing.T) {
// Fresh init with no cycles
dir2, _, _ := bdInit(t, bd, "--prefix", "dp2")
a := bdCreate(t, bd, dir2, "No cycle A", "--type", "task")
b := bdCreate(t, bd, dir2, "No cycle B", "--type", "task")
bdDep(t, bd, dir2, "add", a.ID, b.ID)
out := bdDep(t, bd, dir2, "cycles")
if !strings.Contains(out, "No dependency cycles detected") {
t.Errorf("expected no-cycle message: %s", out)
}
})
}
// TestEmbeddedDepConcurrent exercises dep operations concurrently.
func TestEmbeddedDepConcurrent(t *testing.T) {
if os.Getenv("BEADS_TEST_EMBEDDED_DOLT") != "1" {
t.Skip("set BEADS_TEST_EMBEDDED_DOLT=1 to run embedded dolt integration tests")
}
t.Parallel()
bd := buildEmbeddedBD(t)
dir, _, _ := bdInit(t, bd, "--prefix", "dpc")
// Pre-create issues.
var ids []string
for i := 0; i < 16; i++ {
issue := bdCreate(t, bd, dir, fmt.Sprintf("concurrent-dep-%d", i), "--type", "task")
ids = append(ids, issue.ID)
}
// Pre-create some deps for read operations.
for i := 0; i < 8; i++ {
bdDep(t, bd, dir, "add", ids[i*2], ids[i*2+1])
}
const numWorkers = 8
type workerResult struct {
worker int
err error
}
results := make([]workerResult, numWorkers)
var wg sync.WaitGroup
wg.Add(numWorkers)
for w := 0; w < numWorkers; w++ {
go func(worker int) {
defer wg.Done()
r := workerResult{worker: worker}
id := ids[worker*2]
// Read operations: list and tree
args := []string{"dep", "list", id, "--json"}
cmd := exec.Command(bd, args...)
cmd.Dir = dir
cmd.Env = bdEnv(dir)
out, err := cmd.CombinedOutput()
if err != nil {
r.err = fmt.Errorf("worker %d dep list: %v\n%s", worker, err, out)
results[worker] = r
return
}
args = []string{"dep", "tree", id}
cmd = exec.Command(bd, args...)
cmd.Dir = dir
cmd.Env = bdEnv(dir)
out, err = cmd.CombinedOutput()
if err != nil {
r.err = fmt.Errorf("worker %d dep tree: %v\n%s", worker, err, out)
results[worker] = r
return
}
results[worker] = r
}(w)
}
wg.Wait()
for _, r := range results {
if r.err != nil && !strings.Contains(r.err.Error(), "one writer at a time") {
t.Errorf("worker %d failed: %v", r.worker, r.err)
}
}
}
func TestEmbeddedDepNoCycleCheck(t *testing.T) {
if os.Getenv("BEADS_TEST_EMBEDDED_DOLT") != "1" {
t.Skip("set BEADS_TEST_EMBEDDED_DOLT=1 to run embedded dolt integration tests")
}
t.Parallel()
bd := buildEmbeddedBD(t)
dir, _, _ := bdInit(t, bd, "--prefix", "ncc")
// Create a linear chain of issues to simulate bulk dependency wiring.
const n = 10
ids := make([]string, n)
for i := 0; i < n; i++ {
issue := bdCreate(t, bd, dir, fmt.Sprintf("bulk-dep-%d", i), "--type", "task")
ids[i] = issue.ID
}
// Wire the chain with --no-cycle-check — each call must succeed without
// hanging on a full-graph cycle traversal.
for i := 1; i < n; i++ {
out := bdDep(t, bd, dir, "add", ids[i], ids[i-1], "--no-cycle-check")
// Must not print a cycle warning (there are no cycles in a linear chain).
if strings.Contains(out, "cycle") {
t.Errorf("unexpected cycle warning with --no-cycle-check: %s", out)
}
}
// Verify the graph is acyclic after bulk wiring.
cyclesOut := bdDep(t, bd, dir, "cycles")
if strings.Contains(cyclesOut, "Found") {
t.Errorf("unexpected cycles after bulk wiring: %s", cyclesOut)
}
// Verify --no-cycle-check also works with the dep --blocks shorthand.
extra := bdCreate(t, bd, dir, "bulk-dep-extra", "--type", "task")
bdDep(t, bd, dir, extra.ID, "--blocks", ids[n-1], "--no-cycle-check")
}
// TestEmbeddedDepBulkNoCycleCheckKeepsWholeGraphGate pins the bd-6dnrw.8
// contract: bulk --no-cycle-check skips the per-edge recursive check for
// speed, but one whole-graph cycle check still gates the commit, so a bulk
// add that would introduce a cycle rolls back atomically instead of landing
// and poisoning ready-work.
func TestEmbeddedDepBulkNoCycleCheckKeepsWholeGraphGate(t *testing.T) {
if os.Getenv("BEADS_TEST_EMBEDDED_DOLT") != "1" {
t.Skip("set BEADS_TEST_EMBEDDED_DOLT=1 to run embedded dolt integration tests")
}
t.Parallel()
bd := buildEmbeddedBD(t)
dir, _, _ := bdInit(t, bd, "--prefix", "bcy")
a := bdCreate(t, bd, dir, "Bulk cycle A", "--type", "task")
b := bdCreate(t, bd, dir, "Bulk cycle B", "--type", "task")
c := bdCreate(t, bd, dir, "Bulk cycle C", "--type", "task")
// Cycle-free bulk wiring succeeds with the per-edge check skipped.
okInput := fmt.Sprintf("{\"from\":%q,\"to\":%q}\n{\"from\":%q,\"to\":%q}\n", a.ID, b.ID, b.ID, c.ID)
out := bdDepWithInput(t, bd, dir, okInput, "add", "--file", "-", "--no-cycle-check")
if !strings.Contains(out, "Added 2 dependencies") {
t.Fatalf("expected bulk add summary, got: %s", out)
}
// Closing the chain into a cycle is refused by the final whole-graph
// check, and the refused batch commits nothing.
cycleInput := fmt.Sprintf("{\"from\":%q,\"to\":%q}\n", c.ID, a.ID)
failOut := bdDepWithInputFail(t, bd, dir, cycleInput, "add", "--file", "-", "--no-cycle-check")
if !strings.Contains(failOut, "dependency cycle would be created") || !strings.Contains(failOut, "no edges added") {
t.Fatalf("expected whole-graph cycle rejection, got: %s", failOut)
}
cycles := bdDep(t, bd, dir, "cycles")
if !strings.Contains(cycles, "No dependency cycles detected") {
t.Fatalf("expected rolled-back bulk add to leave the graph acyclic, got: %s", cycles)
}
}
// TestEmbeddedDepAddWispSource is the front-door test for a wisp-sourced
// dependency edge: `bd dep add <wisp-id> <target>` on the real CLI against a
// real embedded store. Coverage of source routing otherwise stops at the
// storage role's own contract, and the behaviour this pins is the user-visible
// one — pinning an edge's source to the issues plane refused every one of
// these with "issue <id> not found", because a wisp has no row there.
//
// It also discharges the CHANGELOG's staging claim: every edge here is
// wisp-sourced, so all of them land in the dolt-ignored wisp plane, nothing
// versioned is staged, and the adds must record no Dolt commit and leave the
// working set clean.
func TestEmbeddedDepAddWispSource(t *testing.T) {
if os.Getenv("BEADS_TEST_EMBEDDED_DOLT") != "1" {
t.Skip("set BEADS_TEST_EMBEDDED_DOLT=1 to run embedded dolt integration tests")
}
t.Parallel()
bd := buildEmbeddedBD(t)
dir, beadsDir, _ := bdInit(t, bd, "--prefix", "dws")
// --ephemeral is the front door's route to a wisp: the row lands in the
// dolt-ignored `wisps` table, which is what the routing probe reads.
wispA := bdCreate(t, bd, dir, "Wisp dep source", "--ephemeral").ID
wispB := bdCreate(t, bd, dir, "Wisp dep target", "--ephemeral").ID
wispC := bdCreate(t, bd, dir, "Wisp dep source two", "--ephemeral").ID
issue := bdCreate(t, bd, dir, "Issue dep target", "--type", "task").ID
// Baseline AFTER the fixtures, so a commit or a dirty table left by
// creation cannot be misread as one the dependency adds produced.
beforeCommits, beforeDirty := embeddedLogCountAndDirtyTables(t, beadsDir)
if len(beforeDirty) != 0 {
t.Fatalf("fixture setup left a dirty working set, so later state cannot be attributed: %v", beforeDirty)
}
t.Run("wisp_to_wisp", func(t *testing.T) {
out := bdDep(t, bd, dir, "add", wispA, wispB)
if !strings.Contains(out, "Added dependency") {
t.Fatalf("expected wisp-sourced dep add to succeed, got: %s", out)
}
if list := bdDep(t, bd, dir, "list", wispA); !strings.Contains(list, wispB) {
t.Errorf("expected %s in dep list of wisp %s, got: %s", wispB, wispA, list)
}
})
t.Run("wisp_to_issue", func(t *testing.T) {
out := bdDep(t, bd, dir, "add", wispC, issue)
if !strings.Contains(out, "Added dependency") {
t.Fatalf("expected wisp->issue dep add to succeed, got: %s", out)
}
if list := bdDep(t, bd, dir, "list", wispC); !strings.Contains(list, issue) {
t.Errorf("expected %s in dep list of wisp %s, got: %s", issue, wispC, list)
}
// The edge lives on the wisp's plane, so walking up from the issue
// finds it only if the reverse read scans wisp_dependencies too.
if up := bdDep(t, bd, dir, "list", issue, "--direction", "up"); !strings.Contains(up, wispC) {
t.Errorf("expected wisp dependent %s walking up from %s, got: %s", wispC, issue, up)
}
})
// Both adds were wisp-sourced. ChangedTables drops the wisp tables, so the
// staged set was empty each time and the auto-commit had nothing to write.
afterCommits, afterDirty := embeddedLogCountAndDirtyTables(t, beadsDir)
if afterCommits != beforeCommits {
t.Errorf("wisp-sourced dep adds recorded %d Dolt commit(s); the wisp plane is dolt-ignored and must record none",
afterCommits-beforeCommits)
}
if len(afterDirty) != 0 {
t.Errorf("wisp-sourced dep adds left versioned tables dirty: %v", afterDirty)
}
}
// embeddedLogCountAndDirtyTables reports the embedded store's Dolt commit
// count and the tables its working set currently reports as changed.
func embeddedLogCountAndDirtyTables(t *testing.T, beadsDir string) (commits int, dirty []string) {
t.Helper()
cfg, _ := configfile.Load(beadsDir)
database := ""
if cfg != nil {
database = cfg.GetDoltDatabase()
}
db, cleanup, err := embeddeddolt.OpenSQL(t.Context(), filepath.Join(beadsDir, "embeddeddolt"), database, "main")
if err != nil {
t.Fatalf("OpenSQL: %v", err)
}
defer cleanup()
if err := db.QueryRowContext(t.Context(), "SELECT COUNT(*) FROM dolt_log").Scan(&commits); err != nil {
t.Fatalf("query dolt_log: %v", err)
}
rows, err := db.QueryContext(t.Context(), "SELECT table_name, status FROM dolt_status")
if err != nil {
t.Fatalf("query dolt_status: %v", err)
}
defer func() { _ = rows.Close() }()
for rows.Next() {
var table, status string
if err := rows.Scan(&table, &status); err != nil {
t.Fatalf("scan dolt_status: %v", err)
}
dirty = append(dirty, table+":"+status)
}
if err := rows.Err(); err != nil {
t.Fatalf("iterate dolt_status: %v", err)
}
return commits, dirty
}