Struct TaskOrchestrator 

pub struct TaskOrchestrator {
    pub current_model_state: Arc<Mutex<ModelLifecycle>>,
    pub current_model_id: Arc<Mutex<Option<u64>>>,
    pub resident_memory_bytes: Arc<AtomicU64>,
    pub scrubbing_lock: Arc<AtomicBool>,
    pub mlock_enabled: Arc<AtomicBool>,
    /* private fields */
}

Fields

current_model_state: Arc<Mutex<ModelLifecycle>>

current_model_id: Arc<Mutex<Option<u64>>>

resident_memory_bytes: Arc<AtomicU64>

scrubbing_lock: Arc<AtomicBool>

mlock_enabled: Arc<AtomicBool>

Implementations

impl TaskOrchestrator

pub fn new(thermal_governor: Box<dyn ThermalGovernor>) -> Self

pub fn thermal_state_label(&self) -> &'static str

pub fn resident_model_id(&self) -> Option<u64>

pub fn resident_memory_bytes(&self) -> u64

pub fn register_resident_model(&self, model_id: u64, bytes: u64)

pub fn load_model( &self, agent: &LocalLlmAgent, model_id: u64, ) -> Result<(), &'static str>

pub fn evict_model(&self, model_id: u64)

pub fn orchestrate_inference( &self, agent: &dyn AgentRuntime, prompt: &str, graph_context: &str, intent: AgentIntent, suspended: Option<&mut SuspendedTransactionQueue>, ) -> OrchestrationResult

Runs a full, Webizen-gated inference cycle for a registered LLM sub-agent.

This is the citation-presence gate (no grounding resolver). For the deeper gate that verifies the claim is supported by its cited facts, use Self::orchestrate_inference_grounded.

pub fn orchestrate_inference_grounded( &self, agent: &dyn AgentRuntime, prompt: &str, graph_context: &str, intent: AgentIntent, suspended: Option<&mut SuspendedTransactionQueue>, resolver: &dyn GroundingResolver, thresholds: GroundingThresholds, ) -> OrchestrationResult

Like Self::orchestrate_inference, but adds the KG↔LLM grounding gate to the post-flight: the model’s structured claim is graded against its resolved cited facts. A weakly-grounded claim is routed to human review (blocked, not committed); an ungrounded one is blocked outright. Both happen before the WAL commit, so an unsupported claim never reaches the graph.