|
| 1 | +package query |
| 2 | + |
| 3 | +import ( |
| 4 | + "database/sql" |
| 5 | + "fmt" |
| 6 | + "path/filepath" |
| 7 | + "strings" |
| 8 | + "testing" |
| 9 | + "time" |
| 10 | +) |
| 11 | + |
| 12 | +func TestEdgeResumeSetupIsLinearAcrossRestart(t *testing.T) { |
| 13 | + for _, minutes := range []int{5, 15, 30} { |
| 14 | + t.Run(fmt.Sprintf("%d_minutes", minutes), func(t *testing.T) { |
| 15 | + path := filepath.Join(t.TempDir(), "cache.duckdb") |
| 16 | + var db *sql.DB |
| 17 | + open := func() { |
| 18 | + var err error |
| 19 | + db, err = sql.Open("duckdb", path) |
| 20 | + if err != nil { |
| 21 | + t.Fatal(err) |
| 22 | + } |
| 23 | + db.SetMaxOpenConns(1) |
| 24 | + if _, err := db.Exec("SET TimeZone='UTC'"); err != nil { |
| 25 | + t.Fatal(err) |
| 26 | + } |
| 27 | + if err := CreateTables(db); err != nil { |
| 28 | + t.Fatal(err) |
| 29 | + } |
| 30 | + } |
| 31 | + open() |
| 32 | + defer func() { _ = db.Close() }() |
| 33 | + base := time.Date(2026, 10, 1, 12, 0, 0, 0, time.UTC) |
| 34 | + stamp := base.UnixNano() |
| 35 | + // N occupied event minutes, separated to force N resumable passes |
| 36 | + // without needing 250k spans per minute in the regular test suite. |
| 37 | + if _, err := db.Exec(`INSERT INTO telemetry.spans |
| 38 | + (namespace,trace_id,span_id,parent_span_id,service,kind,start_time,duration_ms,status,ingested_unix_nano) |
| 39 | + SELECT 'ns',(i//2)::VARCHAR,i::VARCHAR,CASE WHEN i%2=1 THEN (i-1)::VARCHAR END, |
| 40 | + CASE WHEN i%2=0 THEN 'gateway' ELSE 'checkout' END,'SPAN_KIND_SERVER', |
| 41 | + ?::TIMESTAMP_NS + (i//2)*INTERVAL 31 MINUTE,5,'OK',? FROM range(?) t(i)`, base, stamp, minutes*2); err != nil { |
| 42 | + t.Fatal(err) |
| 43 | + } |
| 44 | + if _, err := db.Exec("CREATE SEQUENCE edge_setup_reads"); err != nil { |
| 45 | + t.Fatal(err) |
| 46 | + } |
| 47 | + // Only discovery uses ingestion stamps. Count actual source-row |
| 48 | + // evaluations there, rather than timing the drain or inspecting SQL. |
| 49 | + view := strings.Replace(viewSpans, " ingested_unix_nano,", " CASE WHEN nextval('edge_setup_reads')>0 THEN ingested_unix_nano END AS ingested_unix_nano,", 1) |
| 50 | + if _, err := db.Exec(view); err != nil { |
| 51 | + t.Fatal(err) |
| 52 | + } |
| 53 | + var setupReads int64 |
| 54 | + for pass := 0; pass < minutes; pass++ { |
| 55 | + d := &Duck{DB: db, writeDB: db, publicationBounds: func() (int64, int64, int64) { return stamp, stamp, stamp }} |
| 56 | + _, pending, err := d.refreshEdgeRollupPass(t.Context()) |
| 57 | + if err != nil || pending != (pass < minutes-1) { |
| 58 | + t.Fatalf("pass=%d pending=%v err=%v", pass, pending, err) |
| 59 | + } |
| 60 | + var reads int64 |
| 61 | + if err := db.QueryRow("SELECT last_value FROM duckdb_sequences() WHERE sequence_name='edge_setup_reads'").Scan(&reads); err != nil { |
| 62 | + t.Fatal(err) |
| 63 | + } |
| 64 | + if pass == 0 { |
| 65 | + setupReads = reads |
| 66 | + if reads < int64(minutes*2) || reads > int64(minutes*8) { |
| 67 | + t.Fatalf("setup reads=%d, want a constant number per input row", reads) |
| 68 | + } |
| 69 | + } else if reads != setupReads { |
| 70 | + t.Fatalf("resume repeated discovery: reads=%d first pass=%d", reads, setupReads) |
| 71 | + } |
| 72 | + var remaining int |
| 73 | + if err := db.QueryRow("SELECT count(*) FROM read_edge_buckets").Scan(&remaining); err != nil || remaining != minutes-pass-1 { |
| 74 | + t.Fatalf("remaining=%d pass=%d err=%v", remaining, pass, err) |
| 75 | + } |
| 76 | + if pass == 0 { |
| 77 | + // Close the native database: summaries and cursor must survive, |
| 78 | + // while the connection-local pass view must have disappeared. |
| 79 | + if err := db.Close(); err != nil { |
| 80 | + t.Fatal(err) |
| 81 | + } |
| 82 | + open() |
| 83 | + } |
| 84 | + } |
| 85 | + var calls, buckets int |
| 86 | + if err := db.QueryRow("SELECT sum(calls),count(DISTINCT bucket) FROM edge_rollup").Scan(&calls, &buckets); err != nil || calls != minutes || buckets != minutes { |
| 87 | + t.Fatalf("calls=%d buckets=%d err=%v", calls, buckets, err) |
| 88 | + } |
| 89 | + t.Logf("occupied_minutes=%d setup_row_evaluations=%d passes=%d", minutes, setupReads, minutes) |
| 90 | + }) |
| 91 | + } |
| 92 | +} |
| 93 | + |
| 94 | +func TestEdgeResumeKeepsFrozenWindowAndRepairsNewArrivals(t *testing.T) { |
| 95 | + db := openTestDuck(t) |
| 96 | + if err := CreateTables(db); err != nil { |
| 97 | + t.Fatal(err) |
| 98 | + } |
| 99 | + if err := CreateViews(db); err != nil { |
| 100 | + t.Fatal(err) |
| 101 | + } |
| 102 | + base := time.Date(2026, 10, 1, 12, 0, 0, 0, time.UTC) |
| 103 | + stamp := base.Add(time.Hour).UnixNano() |
| 104 | + horizon := stamp |
| 105 | + d := &Duck{DB: db, writeDB: db, publicationBounds: func() (int64, int64, int64) { return horizon, horizon, stamp }} |
| 106 | + for _, span := range []rollupTestSpan{ |
| 107 | + {namespace: "ns", traceID: "late", spanID: "child", parentSpanID: "parent", service: "late-child", start: base, ingested: stamp}, |
| 108 | + {namespace: "ns", traceID: "existing", spanID: "parent", service: "gateway", start: base, ingested: stamp}, |
| 109 | + {namespace: "ns", traceID: "existing", spanID: "child", parentSpanID: "parent", service: "existing-child", start: base, ingested: stamp}, |
| 110 | + {namespace: "ns", traceID: "tail", spanID: "parent", service: "gateway", start: base.Add(31 * time.Minute), ingested: stamp}, |
| 111 | + {namespace: "ns", traceID: "tail", spanID: "child", parentSpanID: "parent", service: "tail-child", start: base.Add(31 * time.Minute), ingested: stamp}, |
| 112 | + } { |
| 113 | + insertRollupTestSpan(t, db, span) |
| 114 | + } |
| 115 | + if _, pending, err := d.refreshEdgeRollupPass(t.Context()); err != nil || !pending { |
| 116 | + t.Fatalf("initial pass pending=%v err=%v", pending, err) |
| 117 | + } |
| 118 | + // Publish a parent for an already-completed event bucket while the old |
| 119 | + // ingestion window is paused. It belongs to the NEXT discovery window. |
| 120 | + horizon++ |
| 121 | + insertRollupTestSpan(t, db, rollupTestSpan{namespace: "ns", traceID: "late", spanID: "parent", service: "late-gateway", start: base, ingested: horizon}) |
| 122 | + if _, pending, err := d.refreshEdgeRollupPass(t.Context()); err != nil || !pending { |
| 123 | + t.Fatalf("resumed pass pending=%v err=%v", pending, err) |
| 124 | + } |
| 125 | + if watermark, cursor := readEdgeRollupState(t, d); watermark != stamp || cursor != 0 { |
| 126 | + t.Fatalf("resume changed frozen ingestion end: watermark=%d cursor=%d", watermark, cursor) |
| 127 | + } |
| 128 | + requireRowCount(t, db, "SELECT count(*) FROM edge_rollup WHERE callee=?", "late-child", 0) |
| 129 | + if _, pending, err := d.refreshEdgeRollupPass(t.Context()); err != nil || pending { |
| 130 | + t.Fatalf("repair pass pending=%v err=%v", pending, err) |
| 131 | + } |
| 132 | + // Repair replaces the complete bucket: both the new relationship and the |
| 133 | + // unrelated edge that was already aggregated must appear exactly once. |
| 134 | + for _, child := range []string{"late-child", "existing-child", "tail-child"} { |
| 135 | + requireRowCount(t, db, "SELECT count(*) FROM edge_rollup WHERE calls=1 AND callee=?", child, 1) |
| 136 | + } |
| 137 | + if watermark, cursor := readEdgeRollupState(t, d); watermark != horizon || cursor != 0 { |
| 138 | + t.Fatalf("repair did not reach publication horizon: watermark=%d cursor=%d", watermark, cursor) |
| 139 | + } |
| 140 | +} |
0 commit comments