stageflow 0.9.0 → 0.12.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +1 -0
- package/dist/agent/activity.d.ts +9 -0
- package/dist/agent/agentBackend.d.ts +32 -0
- package/dist/agent/agentBackend.js +38 -0
- package/dist/agent/claudeActivity.d.ts +15 -0
- package/dist/agent/claudeActivity.js +58 -0
- package/dist/agent/claudeAdapter.d.ts +5 -0
- package/dist/agent/claudeAdapter.js +301 -0
- package/dist/agent/claudeSession.d.ts +18 -0
- package/dist/agent/claudeSession.js +54 -0
- package/dist/agent/claudeTools.d.ts +89 -0
- package/dist/agent/claudeTools.js +135 -0
- package/dist/agent/fakeAgent.js +24 -4
- package/dist/agent/piAdapter.d.ts +6 -3
- package/dist/agent/piAdapter.js +129 -21
- package/dist/agent/port.d.ts +50 -1
- package/dist/agent/resolveAgentPort.d.ts +26 -0
- package/dist/agent/resolveAgentPort.js +39 -0
- package/dist/cli/runCommand.js +2 -2
- package/dist/cli/runsCommand.d.ts +1 -1
- package/dist/cli/runsCommand.js +184 -2
- package/dist/cli.d.ts +1 -1
- package/dist/cli.js +11 -5
- package/dist/config/browseCatalog.js +1 -1
- package/dist/config/createPipeline.d.ts +2 -1
- package/dist/config/createPipeline.js +34 -9
- package/dist/config/createStage.js +14 -9
- package/dist/config/loadPipeline.js +10 -1
- package/dist/config/loadStage.js +138 -2
- package/dist/config/loadStageflowManifest.js +14 -1
- package/dist/config/mergePipelineIncludes.d.ts +1 -0
- package/dist/config/mergePipelineIncludes.js +14 -1
- package/dist/config/normalizePipelineStageEntry.d.ts +7 -2
- package/dist/config/normalizePipelineStageEntry.js +49 -6
- package/dist/config/parseCompletionContract.d.ts +8 -0
- package/dist/config/parseCompletionContract.js +218 -0
- package/dist/config/parsePreEmitChecks.d.ts +3 -0
- package/dist/config/parsePreEmitChecks.js +65 -0
- package/dist/config/pipelineNeeds.d.ts +19 -0
- package/dist/config/pipelineNeeds.js +151 -0
- package/dist/config/pipelineStageKeys.js +16 -1
- package/dist/config/resolveForkEmitContext.d.ts +6 -2
- package/dist/config/resolveForkEmitContext.js +9 -2
- package/dist/config/resolvePipelineDag.d.ts +2 -1
- package/dist/config/resolvePipelineDag.js +182 -39
- package/dist/config/validateCatalog.d.ts +1 -1
- package/dist/config/validateCompletionContract.d.ts +4 -0
- package/dist/config/validateCompletionContract.js +52 -0
- package/dist/envelope/check.d.ts +1 -1
- package/dist/envelope/check.js +86 -13
- package/dist/envelope/cloneForks.d.ts +1 -1
- package/dist/envelope/cloneForks.js +24 -9
- package/dist/envelope/feedbackLoop.d.ts +4 -0
- package/dist/envelope/feedbackLoop.js +31 -0
- package/dist/envelope/payloadSchema.d.ts +7 -1
- package/dist/envelope/payloadSchema.js +170 -13
- package/dist/envelope/preEmitChecks.d.ts +29 -0
- package/dist/envelope/preEmitChecks.js +57 -0
- package/dist/hitl/qaTrail.d.ts +25 -0
- package/dist/hitl/qaTrail.js +51 -0
- package/dist/mcp/catalogTools.js +4 -2
- package/dist/mcp/controlTools.js +72 -0
- package/dist/mcp/waitingGates.d.ts +2 -1
- package/dist/mcp/waitingGates.js +17 -1
- package/dist/package-meta.d.ts +1 -1
- package/dist/package-meta.js +1 -1
- package/dist/projection/projectRun.d.ts +4 -1
- package/dist/projection/projectRun.js +7 -0
- package/dist/prompt/feedbackLoopContext.d.ts +2 -0
- package/dist/prompt/feedbackLoopContext.js +17 -0
- package/dist/prompt/priorEnvelope.d.ts +2 -2
- package/dist/prompt/priorEnvelope.js +4 -1
- package/dist/runstore/pipelineDagSnapshot.d.ts +1 -0
- package/dist/runstore/pipelineDagSnapshot.js +51 -11
- package/dist/runstore/port.d.ts +185 -3
- package/dist/runstore/port.js +42 -3
- package/dist/runstore/runProjection.d.ts +7 -3
- package/dist/runstore/runProjection.js +30 -15
- package/dist/runstore/sqlite/SqliteRunStore.d.ts +25 -1
- package/dist/runstore/sqlite/SqliteRunStore.js +626 -8
- package/dist/runstore/sqlite/schema.d.ts +1 -1
- package/dist/runstore/sqlite/schema.js +99 -0
- package/dist/runstore/stageInstanceId.d.ts +1 -1
- package/dist/runstore/stageInstanceId.js +3 -2
- package/dist/runstore/trackProjection.js +59 -27
- package/dist/runstore/verificationHistory.d.ts +19 -0
- package/dist/runstore/verificationHistory.js +30 -0
- package/dist/runtime/cloneSchedule.d.ts +40 -4
- package/dist/runtime/cloneSchedule.js +212 -28
- package/dist/runtime/completionCheckRunner.d.ts +137 -0
- package/dist/runtime/completionCheckRunner.js +365 -0
- package/dist/runtime/completionCheckoutBaseline.d.ts +3 -0
- package/dist/runtime/completionCheckoutBaseline.js +44 -0
- package/dist/runtime/envelopeRouting.d.ts +10 -3
- package/dist/runtime/envelopeRouting.js +146 -5
- package/dist/runtime/feedbackLoopCoordinator.d.ts +74 -0
- package/dist/runtime/feedbackLoopCoordinator.js +446 -0
- package/dist/runtime/feedbackLoopDecision.d.ts +44 -0
- package/dist/runtime/feedbackLoopDecision.js +207 -0
- package/dist/runtime/feedbackLoopRoute.d.ts +5 -0
- package/dist/runtime/feedbackLoopRoute.js +13 -0
- package/dist/runtime/feedbackLoopSchedule.d.ts +38 -0
- package/dist/runtime/feedbackLoopSchedule.js +72 -0
- package/dist/runtime/forkGeneration.d.ts +72 -0
- package/dist/runtime/forkGeneration.js +295 -0
- package/dist/runtime/gitCheckoutCapability.d.ts +7 -0
- package/dist/runtime/gitCheckoutCapability.js +97 -0
- package/dist/runtime/manualRecoveryState.d.ts +40 -0
- package/dist/runtime/manualRecoveryState.js +73 -0
- package/dist/runtime/pipelineScheduler.d.ts +13 -1
- package/dist/runtime/pipelineScheduler.js +328 -45
- package/dist/runtime/replayLifecycle.d.ts +107 -0
- package/dist/runtime/replayLifecycle.js +168 -0
- package/dist/runtime/runManager.d.ts +54 -1
- package/dist/runtime/runManager.js +471 -6
- package/dist/runtime/runRetryCoordinator.d.ts +6 -1
- package/dist/runtime/runRetryCoordinator.js +43 -9
- package/dist/runtime/stageAttemptBootstrap.d.ts +3 -1
- package/dist/runtime/stageAttemptBootstrap.js +79 -1
- package/dist/runtime/stageProcessLauncher.d.ts +1 -1
- package/dist/runtime/stageRecovery.js +1 -1
- package/dist/runtime/stageRunner.d.ts +4 -1
- package/dist/runtime/stageRunner.js +29 -3
- package/dist/runtime/stageWorker.js +69 -2
- package/dist/runtime/stageWorkerProtocol.d.ts +1 -1
- package/dist/runtime/verifiedStageExecution.d.ts +29 -0
- package/dist/runtime/verifiedStageExecution.js +119 -0
- package/dist/server/bootstrap.js +1 -0
- package/dist/server/http.js +114 -0
- package/dist/server/operatorResults.js +2 -0
- package/dist/tools/askOperator.d.ts +161 -5
- package/dist/tools/askOperator.js +58 -25
- package/dist/tools/emitStageEnvelope.d.ts +12 -12
- package/dist/tools/emitStageEnvelope.js +112 -24
- package/dist/types/completion.d.ts +43 -0
- package/dist/types/completion.js +1 -0
- package/dist/types/envelope.d.ts +18 -0
- package/dist/types/forkChoice.d.ts +9 -4
- package/dist/types/forkChoice.js +1 -1
- package/dist/types/pipeline.d.ts +39 -2
- package/dist/types/preEmitCheck.d.ts +18 -0
- package/dist/types/preEmitCheck.js +1 -0
- package/dist/types/stage.d.ts +13 -0
- package/dist/types/stageflowManifest.d.ts +2 -0
- package/dist/ui/assets/index-CXGz4nL7.js +118 -0
- package/dist/ui/assets/{index-C3N7MXAC.css → index-uVHiae8s.css} +1 -1
- package/dist/ui/index.html +2 -2
- package/package.json +2 -1
- package/skills/stageflow-author/references/catalog-mapping.md +26 -2
- package/skills/stageflow-author/references/catalog-write-conventions.md +1 -1
- package/dist/ui/assets/index-CSoGDA3A.js +0 -118
|
@@ -0,0 +1,19 @@
|
|
|
1
|
+
import type { NeedTerminalState, PipelineNeedEdge, PipelineNeeds, PipelineStageRef, ResolvedPipelineStageNode } from "../types/pipeline.js";
|
|
2
|
+
export declare const NEED_TERMINAL_STATES: readonly NeedTerminalState[];
|
|
3
|
+
export declare function isNeedTerminalState(value: unknown): value is NeedTerminalState;
|
|
4
|
+
export declare function parsePipelineNeeds(raw: unknown, stageId: string): {
|
|
5
|
+
ok: true;
|
|
6
|
+
value: PipelineNeeds;
|
|
7
|
+
} | {
|
|
8
|
+
ok: false;
|
|
9
|
+
message: string;
|
|
10
|
+
};
|
|
11
|
+
export declare function toNeedEdges(needs: PipelineStageRef["needs"]): PipelineNeedEdge[];
|
|
12
|
+
export declare function predecessorEdges(node: Pick<ResolvedPipelineStageNode, "needs" | "needsEdges">): PipelineNeedEdge[];
|
|
13
|
+
export declare function hydrateResolvedNeeds(node: {
|
|
14
|
+
needs?: unknown;
|
|
15
|
+
needsEdges?: unknown;
|
|
16
|
+
}): {
|
|
17
|
+
needs: string | null;
|
|
18
|
+
needsEdges: PipelineNeedEdge[];
|
|
19
|
+
};
|
|
@@ -0,0 +1,151 @@
|
|
|
1
|
+
export const NEED_TERMINAL_STATES = [
|
|
2
|
+
"succeeded",
|
|
3
|
+
"failed",
|
|
4
|
+
"skipped",
|
|
5
|
+
];
|
|
6
|
+
const NEED_TERMINAL_STATE_SET = new Set(NEED_TERMINAL_STATES);
|
|
7
|
+
export function isNeedTerminalState(value) {
|
|
8
|
+
return typeof value === "string" && NEED_TERMINAL_STATE_SET.has(value);
|
|
9
|
+
}
|
|
10
|
+
function isPlainObject(value) {
|
|
11
|
+
return typeof value === "object" && value !== null && !Array.isArray(value);
|
|
12
|
+
}
|
|
13
|
+
function parseNeedOn(raw, stageId, parentId) {
|
|
14
|
+
if (!Array.isArray(raw) || raw.length === 0) {
|
|
15
|
+
return {
|
|
16
|
+
ok: false,
|
|
17
|
+
message: `stage "${stageId}": needs "${parentId}": on must be a non-empty unique subset of succeeded, failed, skipped`,
|
|
18
|
+
};
|
|
19
|
+
}
|
|
20
|
+
const seen = new Set();
|
|
21
|
+
const on = [];
|
|
22
|
+
for (const item of raw) {
|
|
23
|
+
if (typeof item !== "string" || !NEED_TERMINAL_STATE_SET.has(item) || seen.has(item)) {
|
|
24
|
+
return {
|
|
25
|
+
ok: false,
|
|
26
|
+
message: `stage "${stageId}": needs "${parentId}": on must be a non-empty unique subset of succeeded, failed, skipped`,
|
|
27
|
+
};
|
|
28
|
+
}
|
|
29
|
+
seen.add(item);
|
|
30
|
+
on.push(item);
|
|
31
|
+
}
|
|
32
|
+
return { ok: true, value: on };
|
|
33
|
+
}
|
|
34
|
+
export function parsePipelineNeeds(raw, stageId) {
|
|
35
|
+
if (typeof raw === "string") {
|
|
36
|
+
if (!raw) {
|
|
37
|
+
return { ok: false, message: `stage "${stageId}": needs must be a non-empty string` };
|
|
38
|
+
}
|
|
39
|
+
return { ok: true, value: raw };
|
|
40
|
+
}
|
|
41
|
+
if (!Array.isArray(raw)) {
|
|
42
|
+
return {
|
|
43
|
+
ok: false,
|
|
44
|
+
message: `stage "${stageId}": needs must be a non-empty string or an array of at least two items`,
|
|
45
|
+
};
|
|
46
|
+
}
|
|
47
|
+
if (raw.length < 2) {
|
|
48
|
+
return {
|
|
49
|
+
ok: false,
|
|
50
|
+
message: `stage "${stageId}": needs array must contain at least two items`,
|
|
51
|
+
};
|
|
52
|
+
}
|
|
53
|
+
const edges = [];
|
|
54
|
+
const seen = new Set();
|
|
55
|
+
for (const item of raw) {
|
|
56
|
+
if (typeof item === "string") {
|
|
57
|
+
if (!item) {
|
|
58
|
+
return {
|
|
59
|
+
ok: false,
|
|
60
|
+
message: `stage "${stageId}": needs item must be a stage id or { id, on }`,
|
|
61
|
+
};
|
|
62
|
+
}
|
|
63
|
+
if (seen.has(item)) {
|
|
64
|
+
return {
|
|
65
|
+
ok: false,
|
|
66
|
+
message: `stage "${stageId}": needs contains duplicate id "${item}"`,
|
|
67
|
+
};
|
|
68
|
+
}
|
|
69
|
+
seen.add(item);
|
|
70
|
+
edges.push({ id: item, on: ["succeeded"] });
|
|
71
|
+
continue;
|
|
72
|
+
}
|
|
73
|
+
if (!isPlainObject(item)) {
|
|
74
|
+
return {
|
|
75
|
+
ok: false,
|
|
76
|
+
message: `stage "${stageId}": needs item must be a stage id or { id, on }`,
|
|
77
|
+
};
|
|
78
|
+
}
|
|
79
|
+
for (const key of Object.keys(item)) {
|
|
80
|
+
if (key !== "id" && key !== "on") {
|
|
81
|
+
return {
|
|
82
|
+
ok: false,
|
|
83
|
+
message: `stage "${stageId}": needs item: unknown key "${key}"`,
|
|
84
|
+
};
|
|
85
|
+
}
|
|
86
|
+
}
|
|
87
|
+
if (typeof item.id !== "string" || !item.id) {
|
|
88
|
+
return {
|
|
89
|
+
ok: false,
|
|
90
|
+
message: `stage "${stageId}": needs item must be a stage id or { id, on }`,
|
|
91
|
+
};
|
|
92
|
+
}
|
|
93
|
+
if (seen.has(item.id)) {
|
|
94
|
+
return {
|
|
95
|
+
ok: false,
|
|
96
|
+
message: `stage "${stageId}": needs contains duplicate id "${item.id}"`,
|
|
97
|
+
};
|
|
98
|
+
}
|
|
99
|
+
const onResult = parseNeedOn(item.on, stageId, item.id);
|
|
100
|
+
if (!onResult.ok)
|
|
101
|
+
return onResult;
|
|
102
|
+
seen.add(item.id);
|
|
103
|
+
edges.push({ id: item.id, on: onResult.value });
|
|
104
|
+
}
|
|
105
|
+
return { ok: true, value: edges };
|
|
106
|
+
}
|
|
107
|
+
export function toNeedEdges(needs) {
|
|
108
|
+
if (needs === undefined)
|
|
109
|
+
return [];
|
|
110
|
+
if (typeof needs === "string") {
|
|
111
|
+
return needs ? [{ id: needs, on: ["succeeded"] }] : [];
|
|
112
|
+
}
|
|
113
|
+
return needs.map((item) => typeof item === "string"
|
|
114
|
+
? { id: item, on: ["succeeded"] }
|
|
115
|
+
: { id: item.id, on: item.on && item.on.length > 0 ? item.on : ["succeeded"] });
|
|
116
|
+
}
|
|
117
|
+
export function predecessorEdges(node) {
|
|
118
|
+
if (node.needsEdges !== undefined)
|
|
119
|
+
return node.needsEdges;
|
|
120
|
+
if (typeof node.needs === "string" && node.needs) {
|
|
121
|
+
return [{ id: node.needs, on: ["succeeded"] }];
|
|
122
|
+
}
|
|
123
|
+
return [];
|
|
124
|
+
}
|
|
125
|
+
export function hydrateResolvedNeeds(node) {
|
|
126
|
+
if (Array.isArray(node.needsEdges)) {
|
|
127
|
+
const edges = [];
|
|
128
|
+
for (const item of node.needsEdges) {
|
|
129
|
+
if (!isPlainObject(item) || typeof item.id !== "string" || !item.id)
|
|
130
|
+
continue;
|
|
131
|
+
const on = Array.isArray(item.on)
|
|
132
|
+
? item.on.filter((state) => typeof state === "string" && NEED_TERMINAL_STATE_SET.has(state))
|
|
133
|
+
: ["succeeded"];
|
|
134
|
+
edges.push({ id: item.id, on: on.length > 0 ? on : ["succeeded"] });
|
|
135
|
+
}
|
|
136
|
+
if (typeof node.needs === "string") {
|
|
137
|
+
return { needs: node.needs, needsEdges: edges };
|
|
138
|
+
}
|
|
139
|
+
if (node.needs === null) {
|
|
140
|
+
return { needs: null, needsEdges: edges };
|
|
141
|
+
}
|
|
142
|
+
return {
|
|
143
|
+
needs: edges.length === 1 ? edges[0].id : null,
|
|
144
|
+
needsEdges: edges,
|
|
145
|
+
};
|
|
146
|
+
}
|
|
147
|
+
if (typeof node.needs === "string" && node.needs) {
|
|
148
|
+
return { needs: node.needs, needsEdges: toNeedEdges(node.needs) };
|
|
149
|
+
}
|
|
150
|
+
return { needs: null, needsEdges: [] };
|
|
151
|
+
}
|
|
@@ -1,9 +1,24 @@
|
|
|
1
|
-
export const WIRING_KEYS = new Set([
|
|
1
|
+
export const WIRING_KEYS = new Set([
|
|
2
|
+
"id",
|
|
3
|
+
"needs",
|
|
4
|
+
"fork",
|
|
5
|
+
"uses",
|
|
6
|
+
"clonable",
|
|
7
|
+
"clone_cap",
|
|
8
|
+
"completion",
|
|
9
|
+
"recovery",
|
|
10
|
+
"feedback_loop",
|
|
11
|
+
"replay_safe",
|
|
12
|
+
]);
|
|
2
13
|
export const BODY_KEYS = new Set([
|
|
3
14
|
"system_prompt",
|
|
4
15
|
"model",
|
|
5
16
|
"payload_schema",
|
|
6
17
|
"gate_kinds",
|
|
18
|
+
"pre_emit_checks",
|
|
19
|
+
"clone_input_schema",
|
|
20
|
+
"clone_actions",
|
|
21
|
+
"timeout_ms",
|
|
7
22
|
"skill",
|
|
8
23
|
]);
|
|
9
24
|
export function isPipelineStageBodyKey(key) {
|
|
@@ -1,4 +1,8 @@
|
|
|
1
|
-
import type { CloneEmitContext, ForkEmitContext } from "../types/forkChoice.js";
|
|
1
|
+
import type { CloneAction, CloneEmitContext, ForkEmitContext } from "../types/forkChoice.js";
|
|
2
2
|
import type { ResolvedPipelineDag } from "../types/pipeline.js";
|
|
3
|
-
export
|
|
3
|
+
export type ResolveCloneEmitOptions = {
|
|
4
|
+
allowedActions?: CloneAction[];
|
|
5
|
+
successorCloneInputSchemas?: Record<string, unknown>;
|
|
6
|
+
};
|
|
7
|
+
export declare function resolveCloneEmitContext(dag: ResolvedPipelineDag, stageId: string, options?: ResolveCloneEmitOptions): CloneEmitContext | undefined;
|
|
4
8
|
export declare function resolveForkEmitContext(dag: ResolvedPipelineDag, stageId: string): ForkEmitContext | undefined;
|
|
@@ -1,18 +1,25 @@
|
|
|
1
|
-
export function resolveCloneEmitContext(dag, stageId) {
|
|
1
|
+
export function resolveCloneEmitContext(dag, stageId, options) {
|
|
2
2
|
const childIds = dag.childrenOf[stageId] ?? [];
|
|
3
3
|
const clonableSuccessors = [];
|
|
4
4
|
for (const childId of childIds) {
|
|
5
5
|
const node = dag.nodes.find((n) => n.id === childId);
|
|
6
6
|
if (node?.clonable === true) {
|
|
7
|
+
const cloneInputSchema = options?.successorCloneInputSchemas?.[childId];
|
|
7
8
|
clonableSuccessors.push({
|
|
8
9
|
successorId: childId,
|
|
9
10
|
cloneCap: node.clone_cap,
|
|
11
|
+
...(cloneInputSchema !== undefined ? { cloneInputSchema } : {}),
|
|
10
12
|
});
|
|
11
13
|
}
|
|
12
14
|
}
|
|
13
15
|
if (clonableSuccessors.length === 0)
|
|
14
16
|
return undefined;
|
|
15
|
-
return {
|
|
17
|
+
return {
|
|
18
|
+
clonableSuccessors,
|
|
19
|
+
...(options?.allowedActions !== undefined
|
|
20
|
+
? { allowedActions: options.allowedActions }
|
|
21
|
+
: {}),
|
|
22
|
+
};
|
|
16
23
|
}
|
|
17
24
|
export function resolveForkEmitContext(dag, stageId) {
|
|
18
25
|
const dagNode = dag.nodes.find((n) => n.id === stageId);
|
|
@@ -1,8 +1,9 @@
|
|
|
1
|
-
import type { PipelineStageRef, PipelineStageYamlEntry, ResolvedPipelineDag } from "../types/pipeline.js";
|
|
1
|
+
import type { PipelineStageRef, PipelineStageYamlEntry, ResolvedPipelineDag, FeedbackLoopConfig } from "../types/pipeline.js";
|
|
2
2
|
export type ResolvePipelineDagContext = {
|
|
3
3
|
pipelineId: string;
|
|
4
4
|
path: string;
|
|
5
5
|
};
|
|
6
|
+
export declare function parseFeedbackLoopConfig(value: unknown, stageId: string, ctx: ResolvePipelineDagContext): FeedbackLoopConfig;
|
|
6
7
|
export declare function parsePipelineStageEntries(raw: unknown, ctx: ResolvePipelineDagContext): PipelineStageYamlEntry[];
|
|
7
8
|
export declare function resolvePipelineDagFromRefs(refs: PipelineStageRef[], ctx: ResolvePipelineDagContext): {
|
|
8
9
|
stages: string[];
|
|
@@ -1,4 +1,6 @@
|
|
|
1
1
|
import { isAllowedPipelineStageEntryKey } from "./pipelineStageKeys.js";
|
|
2
|
+
import { parseExecutionPolicy } from "./parseCompletionContract.js";
|
|
3
|
+
import { parsePipelineNeeds, predecessorEdges, toNeedEdges } from "./pipelineNeeds.js";
|
|
2
4
|
const ALLOWED_FORK_KEYS = new Set(["select", "allow_none"]);
|
|
3
5
|
function pipelineLabel(ctx) {
|
|
4
6
|
return `Pipeline ${ctx.pipelineId} (${ctx.path})`;
|
|
@@ -9,6 +11,44 @@ function formatError(ctx, message) {
|
|
|
9
11
|
function isPlainObject(value) {
|
|
10
12
|
return typeof value === "object" && value !== null && !Array.isArray(value);
|
|
11
13
|
}
|
|
14
|
+
const ALLOWED_FEEDBACK_LOOP_KEYS = new Set([
|
|
15
|
+
"target",
|
|
16
|
+
"max_replays",
|
|
17
|
+
"on_max_replays",
|
|
18
|
+
"replay_session",
|
|
19
|
+
]);
|
|
20
|
+
export function parseFeedbackLoopConfig(value, stageId, ctx) {
|
|
21
|
+
if (!isPlainObject(value)) {
|
|
22
|
+
throw new Error(formatError(ctx, `stage "${stageId}": feedback_loop must be an object`));
|
|
23
|
+
}
|
|
24
|
+
for (const key of Object.keys(value)) {
|
|
25
|
+
if (!ALLOWED_FEEDBACK_LOOP_KEYS.has(key)) {
|
|
26
|
+
throw new Error(formatError(ctx, `stage "${stageId}": feedback_loop: unknown key "${key}"`));
|
|
27
|
+
}
|
|
28
|
+
}
|
|
29
|
+
if (Array.isArray(value.target)) {
|
|
30
|
+
throw new Error(formatError(ctx, `stage "${stageId}": feedback_loop.target must be a single stage id string, not an array`));
|
|
31
|
+
}
|
|
32
|
+
if (typeof value.target !== "string" || value.target.trim() === "") {
|
|
33
|
+
throw new Error(formatError(ctx, `stage "${stageId}": feedback_loop.target must be a non-empty stage id`));
|
|
34
|
+
}
|
|
35
|
+
if (!Number.isInteger(value.max_replays) || value.max_replays < 1) {
|
|
36
|
+
throw new Error(formatError(ctx, `stage "${stageId}": feedback_loop.max_replays must be a positive integer`));
|
|
37
|
+
}
|
|
38
|
+
if (value.on_max_replays !== "require_continue" &&
|
|
39
|
+
value.on_max_replays !== "wait_for_human") {
|
|
40
|
+
throw new Error(formatError(ctx, `stage "${stageId}": feedback_loop.on_max_replays must be "require_continue" or "wait_for_human"`));
|
|
41
|
+
}
|
|
42
|
+
if (value.replay_session !== "resume" && value.replay_session !== "new_session") {
|
|
43
|
+
throw new Error(formatError(ctx, `stage "${stageId}": feedback_loop.replay_session must be "resume" or "new_session"`));
|
|
44
|
+
}
|
|
45
|
+
return {
|
|
46
|
+
target: value.target,
|
|
47
|
+
max_replays: value.max_replays,
|
|
48
|
+
on_max_replays: value.on_max_replays,
|
|
49
|
+
replay_session: value.replay_session,
|
|
50
|
+
};
|
|
51
|
+
}
|
|
12
52
|
export function parsePipelineStageEntries(raw, ctx) {
|
|
13
53
|
if (!Array.isArray(raw)) {
|
|
14
54
|
throw new Error(formatError(ctx, "stages[] is required"));
|
|
@@ -53,41 +93,69 @@ export function parsePipelineStageEntries(raw, ctx) {
|
|
|
53
93
|
...(entry.clonable !== undefined ? { clonable: entry.clonable } : {}),
|
|
54
94
|
...(entry.clone_cap !== undefined ? { clone_cap: entry.clone_cap } : {}),
|
|
55
95
|
};
|
|
96
|
+
const policyOutcome = parseExecutionPolicy(entry, entry.id);
|
|
97
|
+
if (!policyOutcome.ok) {
|
|
98
|
+
throw new Error(formatError(ctx, policyOutcome.issues[0]?.message ?? "invalid execution policy"));
|
|
99
|
+
}
|
|
100
|
+
const policyFields = {
|
|
101
|
+
...(policyOutcome.value.completion !== undefined
|
|
102
|
+
? { completion: policyOutcome.value.completion }
|
|
103
|
+
: {}),
|
|
104
|
+
...(policyOutcome.value.recovery !== undefined
|
|
105
|
+
? { recovery: policyOutcome.value.recovery }
|
|
106
|
+
: {}),
|
|
107
|
+
};
|
|
108
|
+
const feedbackLoopFields = entry.feedback_loop !== undefined
|
|
109
|
+
? { feedback_loop: parseFeedbackLoopConfig(entry.feedback_loop, entry.id, ctx) }
|
|
110
|
+
: {};
|
|
111
|
+
if (entry.replay_safe !== undefined && typeof entry.replay_safe !== "boolean") {
|
|
112
|
+
throw new Error(formatError(ctx, `stage "${entry.id}": replay_safe must be a boolean`));
|
|
113
|
+
}
|
|
114
|
+
const replaySafetyFields = entry.replay_safe !== undefined ? { replay_safe: entry.replay_safe } : {};
|
|
56
115
|
if (entry.needs === undefined) {
|
|
57
116
|
entries.push({
|
|
58
117
|
id: entry.id,
|
|
59
118
|
...(forkValue !== undefined ? { fork: forkValue } : {}),
|
|
60
119
|
...clonableFields,
|
|
120
|
+
...policyFields,
|
|
121
|
+
...feedbackLoopFields,
|
|
122
|
+
...replaySafetyFields,
|
|
61
123
|
});
|
|
62
124
|
continue;
|
|
63
125
|
}
|
|
64
|
-
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
}
|
|
68
|
-
throw new Error(formatError(ctx, `stage "${entry.id}": needs must be a string, not an array`));
|
|
69
|
-
}
|
|
70
|
-
if (typeof entry.needs !== "string" || !entry.needs) {
|
|
71
|
-
throw new Error(formatError(ctx, `stage "${entry.id}": needs must be a non-empty string`));
|
|
126
|
+
const parsedNeeds = parsePipelineNeeds(entry.needs, entry.id);
|
|
127
|
+
if (!parsedNeeds.ok) {
|
|
128
|
+
throw new Error(formatError(ctx, parsedNeeds.message));
|
|
72
129
|
}
|
|
73
130
|
entries.push({
|
|
74
131
|
id: entry.id,
|
|
75
|
-
needs:
|
|
132
|
+
needs: parsedNeeds.value,
|
|
76
133
|
...(forkValue !== undefined ? { fork: forkValue } : {}),
|
|
77
134
|
...clonableFields,
|
|
135
|
+
...policyFields,
|
|
136
|
+
...feedbackLoopFields,
|
|
137
|
+
...replaySafetyFields,
|
|
78
138
|
});
|
|
79
139
|
}
|
|
80
140
|
return entries;
|
|
81
141
|
}
|
|
82
142
|
function normalizeToEdges(entries) {
|
|
83
|
-
return entries.map((entry, index) =>
|
|
84
|
-
|
|
85
|
-
|
|
86
|
-
|
|
87
|
-
|
|
88
|
-
|
|
89
|
-
|
|
90
|
-
|
|
143
|
+
return entries.map((entry, index) => {
|
|
144
|
+
const needsEdges = toNeedEdges(entry.needs);
|
|
145
|
+
return {
|
|
146
|
+
id: entry.id,
|
|
147
|
+
needs: needsEdges.length === 1 ? needsEdges[0].id : null,
|
|
148
|
+
needsEdges,
|
|
149
|
+
stageIndex: index,
|
|
150
|
+
...(entry.fork !== undefined ? { fork: entry.fork } : {}),
|
|
151
|
+
...(entry.clonable !== undefined ? { clonable: entry.clonable } : {}),
|
|
152
|
+
...(entry.clone_cap !== undefined ? { clone_cap: entry.clone_cap } : {}),
|
|
153
|
+
...(entry.completion !== undefined ? { completion: entry.completion } : {}),
|
|
154
|
+
...(entry.recovery !== undefined ? { recovery: entry.recovery } : {}),
|
|
155
|
+
...(entry.feedback_loop !== undefined ? { feedback_loop: entry.feedback_loop } : {}),
|
|
156
|
+
...(entry.replay_safe !== undefined ? { replay_safe: entry.replay_safe } : {}),
|
|
157
|
+
};
|
|
158
|
+
});
|
|
91
159
|
}
|
|
92
160
|
function detectDuplicateIds(edges, ctx) {
|
|
93
161
|
const seen = new Set();
|
|
@@ -101,8 +169,10 @@ function detectDuplicateIds(edges, ctx) {
|
|
|
101
169
|
function validateNeedsTargets(edges, ctx) {
|
|
102
170
|
const declared = new Set(edges.map((edge) => edge.id));
|
|
103
171
|
for (const edge of edges) {
|
|
104
|
-
|
|
105
|
-
|
|
172
|
+
for (const parent of edge.needsEdges) {
|
|
173
|
+
if (!declared.has(parent.id)) {
|
|
174
|
+
throw new Error(formatError(ctx, `stage "${edge.id}" has unknown needs "${parent.id}"`));
|
|
175
|
+
}
|
|
106
176
|
}
|
|
107
177
|
}
|
|
108
178
|
}
|
|
@@ -114,10 +184,10 @@ function detectCycle(edges, ctx) {
|
|
|
114
184
|
children.set(edge.id, []);
|
|
115
185
|
}
|
|
116
186
|
for (const edge of edges) {
|
|
117
|
-
|
|
118
|
-
|
|
119
|
-
|
|
120
|
-
|
|
187
|
+
for (const parent of edge.needsEdges) {
|
|
188
|
+
indegree.set(edge.id, (indegree.get(edge.id) ?? 0) + 1);
|
|
189
|
+
children.get(parent.id)?.push(edge.id);
|
|
190
|
+
}
|
|
121
191
|
}
|
|
122
192
|
const queue = [];
|
|
123
193
|
for (const [id, degree] of indegree) {
|
|
@@ -140,19 +210,31 @@ function detectCycle(edges, ctx) {
|
|
|
140
210
|
}
|
|
141
211
|
}
|
|
142
212
|
function computeAncestors(edges) {
|
|
143
|
-
const
|
|
213
|
+
const parentsById = new Map(edges.map((edge) => [edge.id, edge.needsEdges]));
|
|
144
214
|
const ancestorsById = new Map();
|
|
145
215
|
function ancestorsFor(id) {
|
|
146
216
|
const cached = ancestorsById.get(id);
|
|
147
217
|
if (cached)
|
|
148
218
|
return cached;
|
|
149
|
-
const
|
|
150
|
-
if (
|
|
219
|
+
const parents = parentsById.get(id) ?? [];
|
|
220
|
+
if (parents.length === 0) {
|
|
151
221
|
ancestorsById.set(id, []);
|
|
152
222
|
return [];
|
|
153
223
|
}
|
|
154
|
-
const
|
|
155
|
-
const ancestors = [
|
|
224
|
+
const seen = new Set();
|
|
225
|
+
const ancestors = [];
|
|
226
|
+
for (const parent of parents) {
|
|
227
|
+
for (const ancestor of ancestorsFor(parent.id)) {
|
|
228
|
+
if (seen.has(ancestor))
|
|
229
|
+
continue;
|
|
230
|
+
seen.add(ancestor);
|
|
231
|
+
ancestors.push(ancestor);
|
|
232
|
+
}
|
|
233
|
+
if (!seen.has(parent.id)) {
|
|
234
|
+
seen.add(parent.id);
|
|
235
|
+
ancestors.push(parent.id);
|
|
236
|
+
}
|
|
237
|
+
}
|
|
156
238
|
ancestorsById.set(id, ancestors);
|
|
157
239
|
return ancestors;
|
|
158
240
|
}
|
|
@@ -170,16 +252,16 @@ function topologicalSort(edges) {
|
|
|
170
252
|
children.set(edge.id, []);
|
|
171
253
|
}
|
|
172
254
|
for (const edge of edges) {
|
|
173
|
-
|
|
174
|
-
|
|
175
|
-
|
|
176
|
-
|
|
255
|
+
for (const parent of edge.needsEdges) {
|
|
256
|
+
indegree.set(edge.id, (indegree.get(edge.id) ?? 0) + 1);
|
|
257
|
+
children.get(parent.id)?.push(edge.id);
|
|
258
|
+
}
|
|
177
259
|
}
|
|
178
260
|
for (const [, childIds] of children) {
|
|
179
261
|
childIds.sort((a, b) => (byId.get(a)?.stageIndex ?? 0) - (byId.get(b)?.stageIndex ?? 0));
|
|
180
262
|
}
|
|
181
263
|
const roots = edges
|
|
182
|
-
.filter((edge) => edge.
|
|
264
|
+
.filter((edge) => edge.needsEdges.length === 0)
|
|
183
265
|
.sort((a, b) => a.stageIndex - b.stageIndex)
|
|
184
266
|
.map((edge) => edge.id);
|
|
185
267
|
const sorted = [];
|
|
@@ -206,8 +288,8 @@ function buildResolvedPipelineDag(edges) {
|
|
|
206
288
|
childrenOf[edge.id] = [];
|
|
207
289
|
}
|
|
208
290
|
for (const edge of edges) {
|
|
209
|
-
|
|
210
|
-
childrenOf[
|
|
291
|
+
for (const parent of edge.needsEdges) {
|
|
292
|
+
childrenOf[parent.id].push(edge.id);
|
|
211
293
|
}
|
|
212
294
|
}
|
|
213
295
|
for (const id of Object.keys(childrenOf)) {
|
|
@@ -215,12 +297,13 @@ function buildResolvedPipelineDag(edges) {
|
|
|
215
297
|
(edges.find((edge) => edge.id === b)?.stageIndex ?? 0));
|
|
216
298
|
}
|
|
217
299
|
const roots = edges
|
|
218
|
-
.filter((edge) => edge.
|
|
300
|
+
.filter((edge) => edge.needsEdges.length === 0)
|
|
219
301
|
.sort((a, b) => a.stageIndex - b.stageIndex)
|
|
220
302
|
.map((edge) => edge.id);
|
|
221
303
|
const nodes = sortedEdges.map((edge) => ({
|
|
222
304
|
id: edge.id,
|
|
223
305
|
needs: edge.needs,
|
|
306
|
+
needsEdges: edge.needsEdges,
|
|
224
307
|
ancestors: ancestorsById.get(edge.id) ?? [],
|
|
225
308
|
stageIndex: edge.stageIndex,
|
|
226
309
|
...(edge.fork !== undefined
|
|
@@ -229,6 +312,10 @@ function buildResolvedPipelineDag(edges) {
|
|
|
229
312
|
...(edge.clonable === true
|
|
230
313
|
? { clonable: true, clone_cap: edge.clone_cap ?? 5 }
|
|
231
314
|
: {}),
|
|
315
|
+
...(edge.completion !== undefined ? { completion: edge.completion } : {}),
|
|
316
|
+
...(edge.recovery !== undefined ? { recovery: edge.recovery } : {}),
|
|
317
|
+
...(edge.feedback_loop !== undefined ? { feedback_loop: edge.feedback_loop } : {}),
|
|
318
|
+
...(edge.replay_safe !== undefined ? { replay_safe: edge.replay_safe } : {}),
|
|
232
319
|
}));
|
|
233
320
|
return { nodes, roots, childrenOf };
|
|
234
321
|
}
|
|
@@ -259,6 +346,34 @@ function validateClonableFields(edges, dag, ctx) {
|
|
|
259
346
|
}
|
|
260
347
|
}
|
|
261
348
|
}
|
|
349
|
+
function validateFeedbackLoopFields(dag, ctx) {
|
|
350
|
+
const byId = new Map(dag.nodes.map((node) => [node.id, node]));
|
|
351
|
+
for (const source of dag.nodes) {
|
|
352
|
+
const policy = source.feedback_loop;
|
|
353
|
+
if (!policy)
|
|
354
|
+
continue;
|
|
355
|
+
if (source.clonable === true) {
|
|
356
|
+
throw new Error(formatError(ctx, `stage "${source.id}": feedback_loop source cannot be clonable`));
|
|
357
|
+
}
|
|
358
|
+
const targetId = policy.target;
|
|
359
|
+
const target = byId.get(targetId);
|
|
360
|
+
if (!target) {
|
|
361
|
+
throw new Error(formatError(ctx, `stage "${source.id}": feedback_loop target "${targetId}" is not declared`));
|
|
362
|
+
}
|
|
363
|
+
if (!source.ancestors.includes(targetId)) {
|
|
364
|
+
throw new Error(formatError(ctx, `stage "${source.id}": feedback_loop target "${targetId}" must be an earlier ancestor`));
|
|
365
|
+
}
|
|
366
|
+
if (target.clonable === true) {
|
|
367
|
+
throw new Error(formatError(ctx, `stage "${source.id}": feedback_loop target "${targetId}" cannot be clonable`));
|
|
368
|
+
}
|
|
369
|
+
const targetIndex = source.ancestors.indexOf(targetId);
|
|
370
|
+
const route = [...source.ancestors.slice(targetIndex), source.id];
|
|
371
|
+
const unsafeStage = route.find((stageId) => byId.get(stageId)?.replay_safe === false);
|
|
372
|
+
if (unsafeStage !== undefined) {
|
|
373
|
+
throw new Error(formatError(ctx, `stage "${source.id}": feedback_loop target "${targetId}" replays replay_safe: false stage "${unsafeStage}"`));
|
|
374
|
+
}
|
|
375
|
+
}
|
|
376
|
+
}
|
|
262
377
|
export function resolvePipelineDagFromRefs(refs, ctx) {
|
|
263
378
|
const edges = normalizeToEdges(refs);
|
|
264
379
|
detectDuplicateIds(edges, ctx);
|
|
@@ -271,6 +386,7 @@ export function resolvePipelineDagFromRefs(refs, ctx) {
|
|
|
271
386
|
const dag = buildResolvedPipelineDag(edges);
|
|
272
387
|
validateForkFields(edges, dag, ctx);
|
|
273
388
|
validateClonableFields(edges, dag, ctx);
|
|
389
|
+
validateFeedbackLoopFields(dag, ctx);
|
|
274
390
|
return { stages, dag };
|
|
275
391
|
}
|
|
276
392
|
export function resolvePipelineDag(rawStages, ctx) {
|
|
@@ -293,12 +409,40 @@ export function areResolvedDagsEquivalent(a, b) {
|
|
|
293
409
|
const nodeB = byIdB.get(id);
|
|
294
410
|
if (nodeA.needs !== nodeB.needs)
|
|
295
411
|
return false;
|
|
412
|
+
const edgesA = predecessorEdges(nodeA);
|
|
413
|
+
const edgesB = predecessorEdges(nodeB);
|
|
414
|
+
if (edgesA.length !== edgesB.length)
|
|
415
|
+
return false;
|
|
416
|
+
for (let i = 0; i < edgesA.length; i++) {
|
|
417
|
+
if (edgesA[i].id !== edgesB[i].id)
|
|
418
|
+
return false;
|
|
419
|
+
if (edgesA[i].on.length !== edgesB[i].on.length)
|
|
420
|
+
return false;
|
|
421
|
+
for (let j = 0; j < edgesA[i].on.length; j++) {
|
|
422
|
+
if (edgesA[i].on[j] !== edgesB[i].on[j])
|
|
423
|
+
return false;
|
|
424
|
+
}
|
|
425
|
+
}
|
|
296
426
|
if (nodeA.ancestors.length !== nodeB.ancestors.length)
|
|
297
427
|
return false;
|
|
298
428
|
for (let i = 0; i < nodeA.ancestors.length; i++) {
|
|
299
429
|
if (nodeA.ancestors[i] !== nodeB.ancestors[i])
|
|
300
430
|
return false;
|
|
301
431
|
}
|
|
432
|
+
if ((nodeA.replay_safe ?? true) !== (nodeB.replay_safe ?? true))
|
|
433
|
+
return false;
|
|
434
|
+
if (nodeA.feedback_loop?.max_replays !== nodeB.feedback_loop?.max_replays) {
|
|
435
|
+
return false;
|
|
436
|
+
}
|
|
437
|
+
if (nodeA.feedback_loop?.on_max_replays !==
|
|
438
|
+
nodeB.feedback_loop?.on_max_replays) {
|
|
439
|
+
return false;
|
|
440
|
+
}
|
|
441
|
+
if (nodeA.feedback_loop?.replay_session !== nodeB.feedback_loop?.replay_session) {
|
|
442
|
+
return false;
|
|
443
|
+
}
|
|
444
|
+
if (nodeA.feedback_loop?.target !== nodeB.feedback_loop?.target)
|
|
445
|
+
return false;
|
|
302
446
|
}
|
|
303
447
|
return true;
|
|
304
448
|
}
|
|
@@ -321,9 +465,8 @@ export function extractPipelineStageIds(rawStages) {
|
|
|
321
465
|
if (typeof entry.id !== "string" || !entry.id)
|
|
322
466
|
return null;
|
|
323
467
|
if (entry.needs !== undefined) {
|
|
324
|
-
|
|
325
|
-
|
|
326
|
-
if (typeof entry.needs !== "string" || !entry.needs)
|
|
468
|
+
const parsedNeeds = parsePipelineNeeds(entry.needs, entry.id);
|
|
469
|
+
if (!parsedNeeds.ok)
|
|
327
470
|
return null;
|
|
328
471
|
}
|
|
329
472
|
stageIds.push(entry.id);
|
|
@@ -2,7 +2,7 @@ import type { LoadedPipeline } from "../types/pipeline.js";
|
|
|
2
2
|
import type { LoadIssue } from "./loadOutcome.js";
|
|
3
3
|
export type ValidationSeverity = "error" | "warning";
|
|
4
4
|
export type ValidationCategory = "pipeline" | "stage" | "catalog" | "task";
|
|
5
|
-
export type ValidationFindingCode = "pipeline.invalid_shape" | "pipeline.dag_error" | "pipeline.missing_stage" | "pipeline.load_error" | "pipeline.string_stage_ref" | "pipeline.stage_uses_inline_conflict" | "pipeline.stage_missing_body" | "pipeline.stage_id_mismatch" | "pipeline.include_cycle" | "pipeline.include_invalid" | "pipeline.include_duplicate_stage" | "stage.invalid_shape" | "stage.invalid_payload_schema" | "stage.invalid_gate_kinds" | "stage.invalid_skill" | "stage.load_error" | "stage.id_filename_mismatch" | "task.invalid_shape" | "task.load_error" | "catalog.duplicate_pipeline_id" | "catalog.manifest_missing" | "catalog.manifest_invalid" | "catalog.empty_catalog" | "catalog.manifest_load_error";
|
|
5
|
+
export type ValidationFindingCode = "pipeline.invalid_shape" | "pipeline.dag_error" | "pipeline.missing_stage" | "pipeline.load_error" | "pipeline.string_stage_ref" | "pipeline.stage_uses_inline_conflict" | "pipeline.stage_missing_body" | "pipeline.stage_id_mismatch" | "pipeline.invalid_completion" | "pipeline.invalid_recovery" | "pipeline.include_cycle" | "pipeline.include_invalid" | "pipeline.include_duplicate_stage" | "pipeline.invalid_agent" | "stage.invalid_shape" | "stage.invalid_payload_schema" | "stage.invalid_clone_input_schema" | "stage.invalid_clone_actions" | "stage.invalid_gate_kinds" | "stage.invalid_pre_emit_checks" | "stage.invalid_timeout_ms" | "stage.invalid_skill" | "stage.invalid_agent" | "stage.load_error" | "stage.id_filename_mismatch" | "task.invalid_shape" | "task.load_error" | "catalog.duplicate_pipeline_id" | "catalog.manifest_missing" | "catalog.manifest_invalid" | "catalog.empty_catalog" | "catalog.manifest_load_error";
|
|
6
6
|
export type ValidationFinding = {
|
|
7
7
|
severity: ValidationSeverity;
|
|
8
8
|
code: ValidationFindingCode | string;
|
|
@@ -0,0 +1,4 @@
|
|
|
1
|
+
import type { CompletionContract } from "../types/completion.js";
|
|
2
|
+
import type { StageConfig } from "../types/stage.js";
|
|
3
|
+
import { type LoadOutcome } from "./loadOutcome.js";
|
|
4
|
+
export declare function validateCompletionContractForStage(stage: StageConfig, completion: CompletionContract | undefined): LoadOutcome<void>;
|