bcode_server 0.0.1-alpha.0

Local bcode daemon runtime
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88

//! Bounded graph-node inspection through typed store read APIs; never execution authority.
use super::{ServerError, ServerState, open, representation, retained_store, unavailable};
use bcode_workflow_view_models::{WorkflowNodeStatus, WorkflowNodeView, WorkflowRunView};
use switchy_database::Database;

/// Add a canonical revision-pinned node prefix for ordinary node selection.
/// # Errors
/// Rejects malformed limits, unavailable graph or invalid stored definitions; does not repair.
pub async fn populate_nodes(
    state: &ServerState,
    run_id: &str,
    limit: usize,
    view: &mut WorkflowRunView,
) -> Result<(), ServerError> {
    let limit = u16::try_from(limit)
        .ok()
        .filter(|limit| (1..=100).contains(limit))
        .ok_or_else(unavailable)?;
    let retained = retained_store(state).await?;
    let db = open(retained.path(), false)?;
    let tx = db.begin_transaction().await.map_err(|_| unavailable())?;
    let revision = representation::graph_pages::revision(&*tx, run_id)
        .await
        .map_err(|_| unavailable())?;
    let nodes = representation::graph_pages::nodes(&*tx, run_id, revision, None, limit)
        .await
        .map_err(|_| unavailable())?;
    let scheduling =
        representation::scheduling::snapshot_in(&*tx, run_id, Some(revision), None, limit)
            .await
            .map_err(|_| unavailable())?;
    let mut projected = Vec::with_capacity(nodes.len());
    for node in nodes {
        let activation_id = representation::graph::activation_id(&*tx, run_id, &node.id)
            .await
            .map_err(|_| unavailable())?;
        projected.push(WorkflowNodeView {
            node_id: node.id,
            name: node.name,
            kind: bcode_workflow_view::project_node_kind(node.kind),
            status: scheduling
                .activations
                .iter()
                .find(|activation| {
                    Some(activation.activation_id.as_str()) == activation_id.as_deref()
                })
                .map_or_else(
                    || {
                        WorkflowNodeStatus::Unknown(
                            "activation is outside bounded observation".into(),
                        )
                    },
                    |activation| match activation.status {
                        representation::scheduling::ActivationState::Skipped => {
                            WorkflowNodeStatus::Skipped
                        }
                        representation::scheduling::ActivationState::OutputCommitted => {
                            WorkflowNodeStatus::Completed
                        }
                        representation::scheduling::ActivationState::Unresolved => match activation
                            .latest_attempt
                            .as_ref()
                            .and_then(|attempt| attempt.terminal.as_ref())
                        {
                            Some(representation::attempts::TerminalOutcome::Failed) => {
                                WorkflowNodeStatus::Failed
                            }
                            Some(representation::attempts::TerminalOutcome::Cancelled) => {
                                WorkflowNodeStatus::Cancelled
                            }
                            _ => WorkflowNodeStatus::Unknown(
                                "attempt is unresolved; running not established".into(),
                            ),
                        },
                    },
                ),
            activation_id,
        });
    }
    tx.commit().await.map_err(|_| unavailable())?;
    view.nodes = projected;
    view.health = bcode_workflow_view_models::WorkflowProjectionHealth::Degraded {
        reason: format!(
            "Canonical graph revision {revision}: bounded node and output prefixes. Node lifecycle, edges, progress, ancestry and controls unavailable; empty sections are not proof of absence. Continuation not exposed by this view."
        ),
    };
    Ok(())
}